blob: c14eb4c7d834be56557a2a286cb0720c71b3da34 (
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
|
/*
* BIRD Library -- Linked Lists
*
* (c) 1998 Martin Mares <mj@ucw.cz>
*
* Can be freely distributed and used under the terms of the GNU GPL.
*/
#define _BIRD_LISTS_C_
#include "nest/bird.h"
#include "lib/lists.h"
LIST_INLINE void
add_tail(list *l, node *n)
{
node *z = l->tail;
n->next = (node *) &l->null;
n->prev = z;
z->next = n;
l->tail = n;
}
LIST_INLINE void
add_head(list *l, node *n)
{
node *z = l->head;
n->next = z;
n->prev = (node *) &l->head;
z->prev = n;
l->head = n;
}
LIST_INLINE void
insert_node(node *n, node *after)
{
node *z = after->next;
n->next = z;
n->prev = after;
after->next = n;
z->prev = n;
}
LIST_INLINE void
rem_node(node *n)
{
node *z = n->prev;
node *x = n->next;
z->next = x;
x->prev = z;
}
LIST_INLINE void
init_list(list *l)
{
l->head = (node *) &l->null;
l->null = NULL;
l->tail = (node *) &l->head;
}
LIST_INLINE void
add_tail_list(list *to, list *l)
{
node *p = to->tail;
node *q = l->head;
p->next = q;
q->prev = p;
q = l->tail;
q->next = (node *) &to->null;
to->tail = q;
}
|
