/
list.h
140 lines (106 loc) · 3.36 KB
/
list.h
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
/* TinyaML
* Copyright (C) 2007 Damien Leroux
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#ifndef __TINYAP__LIST_H__
#define __TINYAP__LIST_H__
/*
* structs defined as macros to allow precise typing of data in nodes (i.e. avoid using void* that could be easily miscast to some type)
* routines defined as macros to avoir rewriting trivial stuff for each type
*
*/
#define NODE_P(__type) \
struct NodeOfType_##__type {\
struct NodeOfType_##__type *prev,*next;\
struct ListOfType_##__type*list;\
__type* data;\
}
#define NODE(__type) \
struct NodeOfType_##__type {\
struct NodeOfType_##__type *prev,*next;\
struct ListOfType_##__type*list;\
__type data;\
}
#define LIST(__type) \
struct ListOfType_##__type {\
struct NodeOfType_##__type *head,*tail;\
long count;\
}
#define listInit(__l) do { (__l).head=NULL; (__l).tail=NULL; (__l).count=0; } while(0)
#define TypeDefList(__id,__type)\
typedef LIST(__type) __id;\
typedef NODE(__type) __id##Node
#define TypeDefPList(__id,__type)\
typedef LIST(__type) __id;\
typedef NODE_P(__type) __id##Node
TypeDefPList(GenericList,void);
#define listInsertAfter(__a,__n) do { __n->prev=__a;\
__n->list=__a->list;\
if(__a->next) {\
__n->next=__a->next;\
__n->next->prev=__n;\
} else {\
__n->next=NULL;\
__n->list->tail=__n;\
}\
__a->next=__n;\
__n->list->count++;\
} while(0)
#define listInsertBefore(__a,__n) do { __n->next=__a;\
__n->list=__a->list;\
if(__a->prev) {\
__n->prev=__a->prev;\
__n->prev->next=__n;\
} else {\
__n->prev=NULL;\
__n->list->head=__n;\
}\
__a->prev=__n;\
__n->list->count++;\
} while(0)
#define listAddHead(_l,_a) do { if((_l).head) {\
listInsertBefore((_l).head,(_a));\
} else {\
(_a)->prev=NULL;\
(_a)->next=NULL;\
(_a)->list=&(_l);\
(_l).head=(_a);\
(_l).tail=(_a);\
(_l).count=1;\
}\
} while(0)
#define listAddTail(_l,_a) do { if((_l).tail) {\
listInsertAfter((_l).tail,(_a));\
} else {\
(_a)->prev=NULL;\
(_a)->next=NULL;\
(_a)->list=&(_l);\
(_l).head=(_a);\
(_l).tail=(_a);\
(_l).count++;\
}\
} while(0)
#define listRemove(__l,__a) do { if((__a)->prev) (__a)->prev->next=(__a)->next;\
if((__a)->next) (__a)->next->prev=(__a)->prev;\
if((__l).tail==(__a)) (__l).tail=(__a)->prev;\
if((__l).head==(__a)) (__l).head=(__a)->next;\
(__l).count--;\
} while(0)
#define listHead(__l,__a) do { __a=(__l).head; } while(0)
#define listTail(__l,__a) do { __a=(__l).tail; } while(0)
#define Prev(__a) do { __a=(__a)->prev; } while(0)
#define Next(__a) do { __a=(__a)->next; } while(0)
#endif