blob: 1fc35f6bbca7238cb2ea29eae320a64fc61f5ed4 (
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
|
#include <lib/queue.h>
void push_to_queue(struct Entry* e, struct Queue* q)
{
q->end.next->next = e;
q->end.next = e;
e->next = &q->end;
}
void prepend_to_queue(struct Entry* e, struct Queue* q)
{
e->next = q->start.next;
q->start.next = e;
if (e->next->entry_type == END_ENTRY)
q->end.next = e;
}
struct Entry* pop_from_queue(struct Queue* q)
{
if (q->start.next->entry_type == END_ENTRY)
return 0;
struct Entry* e = q->start.next;
q->start.next = e->next;
if (e->next->entry_type == END_ENTRY)
q->end.next = &q->start;
return e;
}
struct Entry* remove_next_from_queue(struct Entry* e)
{
struct Entry* prev = e;
struct Entry* remove = e->next;
struct Entry* next = remove->next;
if (remove->entry_type != VALUE_ENTRY)
return 0;
prev->next = next;
if (next->entry_type == END_ENTRY)
next->next = prev;
return remove;
}
struct Entry* find_value(void* value, struct Queue* q)
{
struct Entry* prev;
struct Entry* entry;
prev = &q->start;
entry = prev->next;
while (entry->entry_type != END_ENTRY) {
if (entry->value == value)
return prev;
prev = entry;
entry = prev->next;
}
return 0;
}
|
