summaryrefslogtreecommitdiff
path: root/kernel/queue.c
blob: 43b240084b5015a7fde16ea9d73609902b279da7 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
#include <assert.h>
#include <kmalloc.h>
#include <queue.h>
#include <sched/scheduler.h>
#include <socket.h>
#include <stdio.h>

int queue_create(u32 *id, process_t *p) {
  struct event_queue *q = kcalloc(1, sizeof(struct event_queue));
  q->wait = 0;
  q->p = p;
  list_init(&q->events);

  struct list *list = &current_task->event_queue;
  list_add(list, q, id);
  return 1;
}

struct event_queue *get_event_queue(u32 id) {
  const struct list *list = &current_task->event_queue;
  struct event_queue *q;
  if (!list_get(list, id, (void **)&q)) {
    return NULL;
  }
  return q;
}

int queue_add(u32 queue_id, struct event *ev, u32 size) {
  struct event_queue *q = get_event_queue(queue_id);
  if (!q) {
    return 0;
  }
  for (u32 i = 0; i < size; i++) {
    // TODO: Should it be a copy or could it be kept in userland to
    // improve performance?
    struct event *new_ev = kmalloc(sizeof(struct event));
    memcpy(new_ev, ev, sizeof(struct event));
    list_add(&q->events, new_ev, NULL);
  }
  return 1;
}

int queue_should_block(struct event_queue *q, int *is_empty) {
  if (!q->wait) {
    return 0;
  }
  *is_empty = 1;
  for (int i = 0;; i++) {
    struct event *ev;
    if (!list_get(&q->events, i, (void **)&ev)) {
      break;
    }
    *is_empty = 0;
    if (EVENT_TYPE_FD == ev->type) {
      vfs_fd_t *fd = get_vfs_fd(ev->internal_id, q->p);
      if (!fd) {
        kprintf("queue: Invalid fd given\n");
        continue;
      }
      if (fd->inode->_has_data) {
        if (fd->inode->_has_data(fd->inode)) {
          return 0;
        }
      }
    } else if (EVENT_TYPE_TCP_SOCKET == ev->type) {
      struct TcpConnection *con = tcp_get_connection(ev->internal_id, q->p);
      assert(con);
      if (!ringbuffer_isempty(&con->buffer)) {
        return 0;
      }
    }
  }
  return 1;
}

int queue_wait(u32 queue_id) {
  struct event_queue *q = get_event_queue(queue_id);
  if (!q) {
    return 0;
  }
  q->wait = 1;
  switch_task();
  q->wait = 0;
  return 1;
}