| /haiku/src/add-ons/kernel/drivers/audio/ac97/auich/ |
| H A D | queue.h | 108 #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) \
112 #define QUEUEDEBUG_LIST_OP(elm, field) \
113 if ((elm)->field.le_next && \
114 (elm)->field.le_next->field.le_prev != \
115 &(elm)->field.le_next) \
116 panic("LIST_* forw %p %s:%d", (elm), __FILE__, __LINE__);\
117 if (*(elm)->field.le_prev != (elm)) \
118 panic("LIST_* back %p %s:%d", (elm), __FILE__, __LINE__);
119 #define QUEUEDEBUG_LIST_POSTREMOVE(elm, fiel
[all...] |
| /haiku/src/add-ons/kernel/drivers/audio/ac97/auvia/ |
| H A D | queue.h | 108 #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) \
112 #define QUEUEDEBUG_LIST_OP(elm, field) \
113 if ((elm)->field.le_next && \
114 (elm)->field.le_next->field.le_prev != \
115 &(elm)->field.le_next) \
116 panic("LIST_* forw %p %s:%d", (elm), __FILE__, __LINE__);\
117 if (*(elm)->field.le_prev != (elm)) \
118 panic("LIST_* back %p %s:%d", (elm), __FILE__, __LINE__);
119 #define QUEUEDEBUG_LIST_POSTREMOVE(elm, fiel
[all...] |
| /haiku/src/add-ons/kernel/drivers/audio/ac97/es1370/ |
| H A D | queue.h | 108 #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) \
112 #define QUEUEDEBUG_LIST_OP(elm, field) \
113 if ((elm)->field.le_next && \
114 (elm)->field.le_next->field.le_prev != \
115 &(elm)->field.le_next) \
116 panic("LIST_* forw %p %s:%d", (elm), __FILE__, __LINE__);\
117 if (*(elm)->field.le_prev != (elm)) \
118 panic("LIST_* back %p %s:%d", (elm), __FILE__, __LINE__);
119 #define QUEUEDEBUG_LIST_POSTREMOVE(elm, fiel
[all...] |
| /haiku/src/add-ons/kernel/drivers/audio/echo/ |
| H A D | queue.h | 108 #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) \
112 #define QUEUEDEBUG_LIST_OP(elm, field) \
113 if ((elm)->field.le_next && \
114 (elm)->field.le_next->field.le_prev != \
115 &(elm)->field.le_next) \
116 panic("LIST_* forw %p %s:%d", (elm), __FILE__, __LINE__);\
117 if (*(elm)->field.le_prev != (elm)) \
118 panic("LIST_* back %p %s:%d", (elm), __FILE__, __LINE__);
119 #define QUEUEDEBUG_LIST_POSTREMOVE(elm, fiel
[all...] |
| /haiku/src/add-ons/kernel/drivers/audio/emuxki/ |
| H A D | queue.h | 108 #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) \
112 #define QUEUEDEBUG_LIST_OP(elm, field) \
113 if ((elm)->field.le_next && \
114 (elm)->field.le_next->field.le_prev != \
115 &(elm)->field.le_next) \
116 panic("LIST_* forw %p %s:%d", (elm), __FILE__, __LINE__);\
117 if (*(elm)->field.le_prev != (elm)) \
118 panic("LIST_* back %p %s:%d", (elm), __FILE__, __LINE__);
119 #define QUEUEDEBUG_LIST_POSTREMOVE(elm, fiel
[all...] |
| /haiku/headers/private/firewire/ |
| H A D | queue.h | 178 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
179 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
180 SLIST_NEXT((slistelm), field) = (elm); \
183 #define SLIST_INSERT_HEAD(head, elm, field) do { \
184 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
185 SLIST_FIRST((head)) = (elm); \
188 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
190 #define SLIST_REMOVE(head, elm, type, field) do { \
191 if (SLIST_FIRST((head)) == (elm)) { \
[all...] |
| /haiku/headers/compatibility/bsd/sys/ |
| H A D | queue.h | 183 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
184 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
185 SLIST_NEXT((slistelm), field) = (elm); \
188 #define SLIST_INSERT_HEAD(head, elm, field) do { \
189 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
190 SLIST_FIRST((head)) = (elm); \
193 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
195 #define SLIST_REMOVE(head, elm, type, field) do { \
196 if (SLIST_FIRST((head)) == (elm)) { \
[all...] |
| /haiku/src/libs/compat/openbsd_wlan/sys/ |
| H A D | tree.h | 77 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
78 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
122 /* Finds the node with the same key as elm */ \
124 name##_SPLAY_FIND(struct name *head, struct type *elm) \
128 name##_SPLAY(head, elm); \
129 if ((cmp)(elm, (head)->sph_root) == 0) \
135 name##_SPLAY_NEXT(struct name *head, struct type *elm) \
137 name##_SPLAY(head, elm); \
[all...] |
| /haiku/src/libs/compat/freebsd_network/compat/sys/ |
| H A D | queue.h | 236 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
237 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
238 SLIST_NEXT((slistelm), field) = (elm); \
241 #define SLIST_INSERT_HEAD(head, elm, field) do { \
242 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
243 SLIST_FIRST((head)) = (elm); \
246 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
248 #define SLIST_REMOVE(head, elm, type, field) do { \
249 QMD_SAVELINK(oldnext, (elm)
[all...] |
| /haiku/src/libs/compat/openbsd_wlan/ |
| H A D | subr_tree.c | 390 _rb_remove(const struct rb_type *t, struct rb_tree *rbt, void *elm) argument
392 struct rb_entry *rbe = rb_n2e(t, elm);
401 _rb_insert(const struct rb_type *t, struct rb_tree *rbt, void *elm) argument
403 struct rb_entry *rbe = rb_n2e(t, elm);
414 comp = (*t->t_compare)(elm, node);
440 /* Finds the node with the same key as elm */
487 _rb_next(const struct rb_type *t, void *elm) argument
489 struct rb_entry *rbe = rb_n2e(t, elm);
511 _rb_prev(const struct rb_type *t, void *elm) argument
513 struct rb_entry *rbe = rb_n2e(t, elm);
[all...] |