summaryrefslogtreecommitdiffstats
path: root/llist.h
blob: 3d4221852914cb9d87fd33a1276bcdd58eace3fc (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
#ifndef foosydneyllistfoo
#define foosydneyllistfoo


#include "macro.h"

#define SA_LLIST_HEAD(t,head) t* head

#define SA_LLIST_ITEM(t,name) t* name##_prev, *name##_next

#define SA_LLIST_HEAD_INIT(t,head) (head) = (t*) NULL

#define SA_LLIST_ITEM_INIT(t,name,item) do { \
                               t *_item = (item); \
                               sa_assert(_item); \
                               _item->name##_prev = _item->name##_next = NULL; \
                               } while(0)

#define SA_LLIST_PREPEND(t,name,head,item) do { \
                                        t **_head = &(head), *_item = (item); \
                                        sa_assert(_item); \
                                        if ((_item->name##_next = *_head)) \
                                            _item->name##_next->name##_prev = _item; \
                                        _item->name##_prev = NULL; \
                                        *_head = _item; \
                                        } while (0)

#define SA_LLIST_INSERT_BEFORE(t,name,head,at,item) do { \
                                        t **_head = &(head), *_item = (item), *_at = (at); \
                                        sa_assert(_item); \
                                        sa_assert(_at); \
                                        if ((_item->name##_prev = _at->name##_prev)) { \
                                            sa_assert(_item->name##_prev->name##_next == _at); \
                                            _item->name##_prev->name##_next = _item; \
                                        } else {\
                                            sa_assert(*_head == _at); \
                                            *_head = _item; \
                                        }  \
                                        _item->name##_next = _at; \
                                        _at->name##_prev = _item; \
                                        } while (0)

#define SA_LLIST_INSERT_AFTER(t,name,head,at,item) do { \
                                        t *_item = (item), *_at = (at); \
                                        sa_assert(_item); \
                                        sa_assert(_at); \
                                        if ((_item->name##_next = _at->name##_next)) { \
                                            sa_assert(_item->name##_next->name##_prev == _at); \
                                            _item->name##_next->name##_prev = _item; \
                                        } \
                                        _item->name##_prev = _at; \
                                        _at->name##_next = _item; \
                                        } while (0)

#define SA_LLIST_REMOVE(t,name,head,item) do { \
                                    t **_head = &(head), *_item = (item); \
                                    sa_assert(_item); \
                                    if (_item->name##_next) \
                                        _item->name##_next->name##_prev = _item->name##_prev; \
                                    if (_item->name##_prev) \
                                        _item->name##_prev->name##_next = _item->name##_next; \
                                    else {\
                                        sa_assert(*_head == _item); \
                                        *_head = _item->name##_next; \
                                    } \
                                    _item->name##_next = _item->name##_prev = NULL; \
                                    } while(0)


#endif