/
waitqueue.c
186 lines (143 loc) · 3.73 KB
/
waitqueue.c
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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
#include <lighttpd/waitqueue.h>
static void wq_cb(liEventBase *watcher, int events) {
liWaitQueue *queue = LI_CONTAINER_OF(li_event_timer_from(watcher), liWaitQueue, timer);
UNUSED(events);
queue->callback(queue, queue->data);
}
void li_waitqueue_init(liWaitQueue *queue, liEventLoop *loop, const char *waitqueue_name, liWaitQueueCB callback, gdouble delay, gpointer data) {
li_event_timer_init(loop, waitqueue_name, &queue->timer, wq_cb);
queue->head = queue->tail = NULL;
queue->delay = delay;
queue->callback = callback;
queue->data = data;
queue->length = 0;
}
void li_waitqueue_stop(liWaitQueue *queue) {
li_event_clear(&queue->timer);
}
void li_waitqueue_set_delay(liWaitQueue *queue, gdouble delay) {
queue->delay = delay;
if (li_event_active(&queue->timer)) {
li_waitqueue_update(queue);
}
}
void li_waitqueue_update(liWaitQueue *queue) {
li_tstamp repeat;
li_tstamp now = li_event_now(li_event_get_loop(&queue->timer));
if (G_LIKELY(queue->head)) {
repeat = queue->head->ts + queue->delay - now;
if (repeat < 0.05) repeat = 0.05;
li_event_timer_once(&queue->timer, repeat);
} else {
/* stop timer if queue empty */
li_event_stop(&queue->timer);
return;
}
}
void li_waitqueue_push(liWaitQueue *queue, liWaitQueueElem *elem) {
elem->ts = li_event_now(li_event_get_loop(&queue->timer));
if (!elem->queued) {
/* not in the queue yet, insert at the end */
elem->queued = TRUE;
queue->length++;
if (!queue->head) {
/* queue is empty */
queue->head = elem;
queue->tail = elem;
elem->prev = NULL;
elem->next = NULL;
} else {
/* queue not empty */
elem->prev = queue->tail;
elem->next = NULL;
queue->tail->next = elem;
queue->tail = elem;
}
} else {
/* already queued, move to end */
if (elem == queue->tail)
return;
if (elem == queue->head)
queue->head = elem->next;
else
elem->prev->next = elem->next;
elem->next->prev = elem->prev;
elem->prev = queue->tail;
elem->next = NULL;
queue->tail->next = elem;
queue->tail = elem;
}
if (G_UNLIKELY(!li_event_active(&queue->timer)))
li_event_timer_once(&queue->timer, queue->delay);
}
liWaitQueueElem *li_waitqueue_pop(liWaitQueue *queue) {
liWaitQueueElem *elem = queue->head;
li_tstamp now = li_event_now(li_event_get_loop(&queue->timer));
if (!elem || (elem->ts + queue->delay) > now) {
return NULL;
}
if (elem == queue->tail)
queue->tail = NULL;
else
elem->next->prev = NULL;
queue->head = elem->next;
queue->length--;
elem->ts = 0;
elem->queued = FALSE;
return elem;
}
liWaitQueueElem *li_waitqueue_pop_force(liWaitQueue *queue) {
liWaitQueueElem *elem = queue->head;
if (!elem) {
return NULL;
}
if (elem == queue->tail)
queue->tail = NULL;
else
elem->next->prev = NULL;
queue->head = elem->next;
queue->length--;
elem->ts = 0;
elem->queued = FALSE;
return elem;
}
void li_waitqueue_remove(liWaitQueue *queue, liWaitQueueElem *elem) {
if (!elem->queued)
return;
if (elem == queue->head)
queue->head = elem->next;
else
elem->prev->next = elem->next;
if (elem == queue->tail)
queue->tail = elem->prev;
else
elem->next->prev = elem->prev;
elem->ts = 0;
elem->queued = FALSE;
queue->length--;
if (G_UNLIKELY(!queue->head))
li_event_stop(&queue->timer);
}
guint li_waitqueue_pop_ready(liWaitQueue *queue, liWaitQueueElem **head) {
guint i = 0;
liWaitQueueElem *elem = queue->head;
li_tstamp now = li_event_now(li_event_get_loop(&queue->timer));
*head = elem;
while (elem != NULL) {
if ((elem->ts + queue->delay) > now) {
queue->head = elem;
if (elem->prev) {
elem->prev->next = NULL;
}
return i;
}
elem->ts = 0;
elem->queued = FALSE;
elem = elem->next;
queue->length--;
i++;
}
queue->head = NULL;
queue->tail = NULL;
return i;
}