?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
added a bunch of gcc builtins
[smatch.git] / ptrlist.h
blobb1b54071847f9dac0029d092a038f864f95c0259
1 #ifndef PTR_LIST_H
2 #define PTR_LIST_H
3
4 /*
5 * Generic pointer list manipulation code.
6 *
7 * (C) Copyright Linus Torvalds 2003-2005
8 */
9
10 #define container(ptr, type, member) \
11 (type *)((void *)(ptr) - offsetof(type, member))
12
13 /* Silly type-safety check ;) */
14 #define DECLARE_PTR_LIST(listname,type) struct listname { type *list[1]; }
15 #define CHECK_TYPE(head,ptr) (void)(&(ptr) == &(head)->list[0])
16 #define TYPEOF(head) __typeof__(&(head)->list[0])
17 #define VRFY_PTR_LIST(head) (void)(sizeof((head)->list[0]))
18
19 /*
20 * The "unnecessary" statement expression is there to shut up a totally
21 * bogus gcc warning about unused expressions, brought on by the fact
22 * that we cast the result to the proper type.
23 */
24 #define MKTYPE(head,expr) ({ (TYPEOF(head))(expr); })
25
26 #define LIST_NODE_NR (29)
27
28 struct ptr_list {
29 int nr;
30 struct ptr_list *prev;
31 struct ptr_list *next;
32 void *list[LIST_NODE_NR];
33 };
34
35 #define ptr_list_empty(x) ((x) == NULL)
36
37 void * undo_ptr_list_last(struct ptr_list **head);
38 void * delete_ptr_list_last(struct ptr_list **head);
39 int delete_ptr_list_entry(struct ptr_list **, void *, int);
40 int replace_ptr_list_entry(struct ptr_list **, void *old, void *new, int);
41 extern void sort_list(struct ptr_list **, int (*)(const void *, const void *));
42
43 extern void **__add_ptr_list(struct ptr_list **, void *, unsigned long tag);
44 extern void concat_ptr_list(struct ptr_list *a, struct ptr_list **b);
45 extern void __free_ptr_list(struct ptr_list **);
46 extern int ptr_list_size(struct ptr_list *);
47 extern int linearize_ptr_list(struct ptr_list *, void **, int);
48
49 /*
50 * Hey, who said that you can't do overloading in C?
51 *
52 * You just have to be creative, and use some gcc
53 * extensions..
54 */
55 #define add_ptr_list_tag(list,entry,tag) \
56 MKTYPE(*(list), (CHECK_TYPE(*(list),(entry)),__add_ptr_list((struct ptr_list **)(list), (entry), (tag))))
57 #define add_ptr_list(list,entry) \
58 add_ptr_list_tag(list,entry,0)
59 #define free_ptr_list(list) \
60 do { VRFY_PTR_LIST(*(list)); __free_ptr_list((struct ptr_list **)(list)); } while (0)
61
62 #define PTR_ENTRY(h,i) (void *)(~3UL & (unsigned long)(h)->list[i])
63
64 static inline void *first_ptr_list(struct ptr_list *list)
65 {
66 if (!list)
67 return NULL;
68 return PTR_ENTRY(list, 0);
69 }
70
71 static inline void *last_ptr_list(struct ptr_list *list)
72 {
73
74 if (!list)
75 return NULL;
76 list = list->prev;
77 return PTR_ENTRY(list, list->nr-1);
78 }
79
80 #define DO_PREPARE(head, ptr, __head, __list, __nr) \
81 do { \
82 struct ptr_list *__head = (struct ptr_list *) (head); \
83 struct ptr_list *__list = __head; \
84 int __nr = 0; \
85 CHECK_TYPE(head,ptr); \
86 if (__head) ptr = PTR_ENTRY(__head, 0); \
87 else ptr = NULL
88
89 #define DO_NEXT(ptr, __head, __list, __nr) \
90 if (ptr) { \
91 if (++__nr < __list->nr) { \
92 ptr = PTR_ENTRY(__list,__nr); \
93 } else { \
94 __list = __list->next; \
95 ptr = NULL; \
96 if (__list != __head) { \
97 __nr = 0; \
98 ptr = PTR_ENTRY(__list,0); \
99 } \
100 } \
101 }
102
103 #define DO_RESET(ptr, __head, __list, __nr) \
104 do { \
105 __nr = 0; \
106 __list = __head; \
107 if (__head) ptr = PTR_ENTRY(__head, 0); \
108 } while (0)
109
110 #define DO_FINISH(ptr, __head, __list, __nr) \
111 (void)(__nr); /* Sanity-check nesting */ \
112 } while (0)
113
114 #define PREPARE_PTR_LIST(head, ptr) \
115 DO_PREPARE(head, ptr, __head##ptr, __list##ptr, __nr##ptr)
116
117 #define NEXT_PTR_LIST(ptr) \
118 DO_NEXT(ptr, __head##ptr, __list##ptr, __nr##ptr)
119
120 #define RESET_PTR_LIST(ptr) \
121 DO_RESET(ptr, __head##ptr, __list##ptr, __nr##ptr)
122
123 #define FINISH_PTR_LIST(ptr) \
124 DO_FINISH(ptr, __head##ptr, __list##ptr, __nr##ptr)
125
126 #define DO_FOR_EACH(head, ptr, __head, __list, __nr) do { \
127 struct ptr_list *__head = (struct ptr_list *) (head); \
128 struct ptr_list *__list = __head; \
129 CHECK_TYPE(head,ptr); \
130 if (__head) { \
131 do { int __nr; \
132 for (__nr = 0; __nr < __list->nr; __nr++) { \
133 do { \
134 ptr = PTR_ENTRY(__list,__nr); \
135 do {
136
137 #define DO_END_FOR_EACH(ptr, __head, __list, __nr) \
138 } while (0); \
139 } while (0); \
140 } \
141 } while ((__list = __list->next) != __head); \
142 } \
143 } while (0)
144
145 #define DO_FOR_EACH_REVERSE(head, ptr, __head, __list, __nr) do { \
146 struct ptr_list *__head = (struct ptr_list *) (head); \
147 struct ptr_list *__list = __head; \
148 CHECK_TYPE(head,ptr); \
149 if (__head) { \
150 do { int __nr; \
151 __list = __list->prev; \
152 __nr = __list->nr; \
153 while (--__nr >= 0) { \
154 do { \
155 ptr = PTR_ENTRY(__list,__nr); \
156 do {
157
158
159 #define DO_END_FOR_EACH_REVERSE(ptr, __head, __list, __nr) \
160 } while (0); \
161 } while (0); \
162 } \
163 } while (__list != __head); \
164 } \
165 } while (0)
166
167 #define DO_REVERSE(ptr, __head, __list, __nr, new, __newhead, __newlist, __newnr) do { \
168 struct ptr_list *__newhead = __head; \
169 struct ptr_list *__newlist = __list; \
170 int __newnr = __nr; \
171 new = ptr; \
172 goto __inside##new; \
173 if (1) { \
174 do { \
175 __newlist = __newlist->prev; \
176 __newnr = __newlist->nr; \
177 __inside##new: \
178 while (--__newnr >= 0) { \
179 do { \
180 new = PTR_ENTRY(__newlist,__newnr); \
181 do {
182
183 #define RECURSE_PTR_REVERSE(ptr, new) \
184 DO_REVERSE(ptr, __head##ptr, __list##ptr, __nr##ptr, \
185 new, __head##new, __list##new, __nr##new)
186
187 #define DO_THIS_ADDRESS(ptr, __head, __list, __nr) \
188 ((__typeof__(&(ptr))) (__list->list + __nr))
189
190 #define FOR_EACH_PTR(head, ptr) \
191 DO_FOR_EACH(head, ptr, __head##ptr, __list##ptr, __nr##ptr)
192
193 #define END_FOR_EACH_PTR(ptr) \
194 DO_END_FOR_EACH(ptr, __head##ptr, __list##ptr, __nr##ptr)
195
196 #define FOR_EACH_PTR_REVERSE(head, ptr) \
197 DO_FOR_EACH_REVERSE(head, ptr, __head##ptr, __list##ptr, __nr##ptr)
198
199 #define END_FOR_EACH_PTR_REVERSE(ptr) \
200 DO_END_FOR_EACH_REVERSE(ptr, __head##ptr, __list##ptr, __nr##ptr)
201
202 #define THIS_ADDRESS(ptr) \
203 DO_THIS_ADDRESS(ptr, __head##ptr, __list##ptr, __nr##ptr)
204
205 extern void split_ptr_list_head(struct ptr_list *);
206
207 #define DO_SPLIT(ptr, __head, __list, __nr) do { \
208 split_ptr_list_head(__list); \
209 if (__nr >= __list->nr) { \
210 __nr -= __list->nr; \
211 __list = __list->next; \
212 }; \
213 } while (0)
214
215 #define DO_INSERT_CURRENT(new, ptr, __head, __list, __nr) do { \
216 void **__this, **__last; \
217 if (__list->nr == LIST_NODE_NR) \
218 DO_SPLIT(ptr, __head, __list, __nr); \
219 __this = __list->list + __nr; \
220 __last = __list->list + __list->nr - 1; \
221 while (__last >= __this) { \
222 __last[1] = __last[0]; \
223 __last--; \
224 } \
225 *__this = (new); \
226 __list->nr++; \
227 } while (0)
228
229 #define INSERT_CURRENT(new, ptr) \
230 DO_INSERT_CURRENT(new, ptr, __head##ptr, __list##ptr, __nr##ptr)
231
232 #define DO_DELETE_CURRENT(ptr, __head, __list, __nr) do { \
233 void **__this = __list->list + __nr; \
234 void **__last = __list->list + __list->nr - 1; \
235 while (__this < __last) { \
236 __this[0] = __this[1]; \
237 __this++; \
238 } \
239 *__this = (void *)0xf0f0f0f0; \
240 __list->nr--; __nr--; \
241 } while (0)
242
243 #define DELETE_CURRENT_PTR(ptr) \
244 DO_DELETE_CURRENT(ptr, __head##ptr, __list##ptr, __nr##ptr)
245
246 #define REPLACE_CURRENT_PTR(ptr, new_ptr) \
247 do { *THIS_ADDRESS(ptr) = (new_ptr); } while (0)
248
249 extern void pack_ptr_list(struct ptr_list **);
250
251 #define PACK_PTR_LIST(x) pack_ptr_list((struct ptr_list **)(x))
252
253 static inline void update_tag(void *p, unsigned long tag)
254 {
255 unsigned long *ptr = p;
256 *ptr = tag | (~3UL & *ptr);
257 }
258
259 static inline void *tag_ptr(void *ptr, unsigned long tag)
260 {
261 return (void *)(tag | (unsigned long)ptr);
262 }
263
264 #define CURRENT_TAG(ptr) (3 & (unsigned long)*THIS_ADDRESS(ptr))
265 #define TAG_CURRENT(ptr,val) update_tag(THIS_ADDRESS(ptr),val)
266
267 #endif /* PTR_LIST_H */
Static analysis for C