2 * Sherlock Library -- Linked Lists
4 * (c) 1997 Martin Mares, <mj@atrey.karlin.mff.cuni.cz>
8 struct node *next, *prev;
10 typedef struct node node;
13 struct node head, tail;
15 typedef struct list list;
18 #define HEAD(list) ((void *)((list).head.next))
19 #define TAIL(list) ((void *)((list).tail.prev))
20 #define DO_FOR_ALL(n,list) for((n)=HEAD(list);(NODE (n))->next; \
21 n=(void *)((NODE (n))->next))
22 #define EMPTY_LIST(list) (!(list).head.next->next)
24 void add_tail(list *, node *);
25 void add_head(list *, node *);
26 void rem_node(node *);
27 void add_tail_list(list *, list *);
28 void init_list(list *);
29 void insert_node(node *, node *);
34 add_tail(list *l, node *n)
36 node *z = l->tail.prev;
45 add_head(list *l, node *n)
47 node *z = l->head.next;
56 insert_node(node *n, node *after)
58 node *z = after->next;
79 l->head.next = &l->tail;
82 l->tail.prev = &l->head;
86 add_tail_list(list *to, list *l)
88 node *p = to->tail.prev;
89 node *q = l->head.next;