Home
last modified time | relevance | path

Searched refs:head (Results 1 – 25 of 1025) sorted by relevance

12345678910>>...41

/NextBSD/sys/dev/sound/midi/
HDmidiq.h40 #define MIDIQ_INIT(head, buf, size) do { \ argument
41 (head).h=(head).t=0; \
42 (head).s=size; \
43 (head).b=buf; \
46 #define MIDIQ_EMPTY(head) ((head).h == (head).t ) argument
48 #define MIDIQ_LENBASE(head) ((head).h - (head).t < 0 ? \ argument
49 (head).h - (head).t + (head).s : \
50 (head).h - (head).t)
52 #define MIDIQ_FULL(head) ((head).h == -1) argument
53 #define MIDIQ_AVAIL(head) (MIDIQ_FULL(head) ? 0 : (head).s - MIDIQ_LENBASE(head)) argument
[all …]
/NextBSD/contrib/ntp/sntp/libevent/compat/sys/
HDqueue.h93 #define SLIST_HEAD_INITIALIZER(head) \ argument
106 #define SLIST_FIRST(head) ((head)->slh_first) argument
107 #define SLIST_END(head) NULL argument
108 #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head)) argument
111 #define SLIST_FOREACH(var, head, field) \ argument
112 for((var) = SLIST_FIRST(head); \
113 (var) != SLIST_END(head); \
119 #define SLIST_INIT(head) { \ argument
120 SLIST_FIRST(head) = SLIST_END(head); \
128 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
[all …]
/NextBSD/contrib/gcc/
HDtree-browser.c117 tree head; in browse_tree() local
127 head = N; \ in browse_tree()
129 if (head) \ in browse_tree()
131 print_generic_expr (TB_OUT_FILE, head, 0); \ in browse_tree()
141 TB_update_up (head); in browse_tree()
161 TB_update_up (head); in browse_tree()
165 if (head && (INTEGRAL_TYPE_P (head) in browse_tree()
166 || TREE_CODE (head) == REAL_TYPE)) in browse_tree()
167 TB_SET_HEAD (TYPE_MAX_VALUE (head)); in browse_tree()
173 if (head && (INTEGRAL_TYPE_P (head) in browse_tree()
[all …]
/NextBSD/crypto/openssh/openbsd-compat/
HDsys-queue.h184 #define SLIST_HEAD_INITIALIZER(head) \ argument
195 #define SLIST_FIRST(head) ((head)->slh_first) argument
196 #define SLIST_END(head) NULL argument
197 #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head)) argument
200 #define SLIST_FOREACH(var, head, field) \ argument
201 for((var) = SLIST_FIRST(head); \
202 (var) != SLIST_END(head); \
205 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
206 for ((var) = SLIST_FIRST(head); \
213 #define SLIST_INIT(head) { \ argument
[all …]
HDsys-tree.h84 #define SPLAY_ROOT(head) (head)->sph_root argument
85 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
88 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
89 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
90 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
91 (head)->sph_root = tmp; \
94 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
95 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
96 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
97 (head)->sph_root = tmp; \
[all …]
/NextBSD/contrib/ntp/sntp/libevent/
HDht-internal.h41 #define HT_EMPTY(head) \ argument
42 ((head)->hth_n_entries == 0)
45 #define HT_SIZE(head) \ argument
46 ((head)->hth_n_entries)
49 #define HT_MEM_USAGE(head) \ argument
50 (sizeof(*head) + (head)->hth_table_length * sizeof(void*))
52 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm)) argument
53 #define HT_INSERT(name, head, elm) name##_HT_INSERT((head), (elm)) argument
54 #define HT_REPLACE(name, head, elm) name##_HT_REPLACE((head), (elm)) argument
55 #define HT_REMOVE(name, head, elm) name##_HT_REMOVE((head), (elm)) argument
[all …]
/NextBSD/contrib/ofed/libcxgb4/src/
HDqueue.h147 #define QMD_TRACE_HEAD(head) do { \ argument
148 (head)->trace.prevline = (head)->trace.lastline; \
149 (head)->trace.prevfile = (head)->trace.lastfile; \
150 (head)->trace.lastline = __LINE__; \
151 (head)->trace.lastfile = __FILE__; \
163 #define QMD_TRACE_HEAD(head) argument
176 #define SLIST_HEAD_INITIALIZER(head) \ argument
187 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
189 #define SLIST_FIRST(head) ((head)->slh_first) argument
191 #define SLIST_FOREACH(var, head, field) \ argument
[all …]
/NextBSD/contrib/openbsm/compat/
HDqueue.h116 #define QMD_TRACE_HEAD(head) do { \ argument
117 (head)->trace.prevline = (head)->trace.lastline; \
118 (head)->trace.prevfile = (head)->trace.lastfile; \
119 (head)->trace.lastline = __LINE__; \
120 (head)->trace.lastfile = __FILE__; \
132 #define QMD_TRACE_HEAD(head) argument
145 #define SLIST_HEAD_INITIALIZER(head) \ argument
156 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
158 #define SLIST_FIRST(head) ((head)->slh_first) argument
160 #define SLIST_FOREACH(var, head, field) \ argument
[all …]
/NextBSD/sys/sys/
HDqueue.h125 #define QMD_TRACE_HEAD(head) do { \ argument
126 (head)->trace.prevline = (head)->trace.lastline; \
127 (head)->trace.prevfile = (head)->trace.lastfile; \
128 (head)->trace.lastline = __LINE__; \
129 (head)->trace.lastfile = __FILE__; \
141 #define QMD_TRACE_HEAD(head) argument
170 #define SLIST_HEAD_INITIALIZER(head) \ argument
186 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
188 #define SLIST_FIRST(head) ((head)->slh_first) argument
190 #define SLIST_FOREACH(var, head, field) \ argument
[all …]
HDtree.h82 #define SPLAY_ROOT(head) (head)->sph_root argument
83 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
86 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
87 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
88 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
89 (head)->sph_root = tmp; \
92 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
93 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
94 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
95 (head)->sph_root = tmp; \
[all …]
/NextBSD/contrib/libucl/uthash/
HDutlist.h309 #define LL_PREPEND(head,add) \ argument
310 LL_PREPEND2(head,add,next)
312 #define LL_PREPEND2(head,add,next) \ argument
314 (add)->next = head; \
315 head = add; \
333 #define LL_APPEND(head,add) \ argument
334 LL_APPEND2(head,add,next)
336 #define LL_APPEND2(head,add,next) \ argument
338 LDECLTYPE(head) _tmp; \
340 if (head) { \
[all …]
HDuthash.h95 #define HASH_FIND(hh,head,keyptr,keylen,out) \ argument
99 if (head) { \
100 HASH_FCN(keyptr,keylen, (head)->hh.tbl->num_buckets, _hf_hashv, _hf_bkt); \
101 if (HASH_BLOOM_TEST((head)->hh.tbl, _hf_hashv)) { \
102 HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], \
142 #define HASH_MAKE_TABLE(hh,head) \ argument
144 (head)->hh.tbl = (UT_hash_table*)uthash_malloc( \
146 if (!((head)->hh.tbl)) { uthash_fatal( "out of memory"); } \
147 memset((head)->hh.tbl, 0, sizeof(UT_hash_table)); \
148 (head)->hh.tbl->tail = &((head)->hh); \
[all …]
/NextBSD/crypto/heimdal/base/
HDheimqueue.h47 #define HEIM_TAILQ_HEAD_INITIALIZER(head) \ argument
48 { NULL, &(head).tqh_first }
59 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_HEAD(head, elm, field) \ argument
60 if ((head)->tqh_first && \
61 (head)->tqh_first->field.tqe_prev != &(head)->tqh_first) \
62 panic("HEIM_TAILQ_INSERT_HEAD %p %s:%d", (head), __FILE__, __LINE__);
63 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_TAIL(head, elm, field) \ argument
64 if (*(head)->tqh_last != NULL) \
65 panic("HEIM_TAILQ_INSERT_TAIL %p %s:%d", (head), __FILE__, __LINE__);
73 #define QUEUEDEBUG_HEIM_TAILQ_PREREMOVE(head, elm, field) \ argument
[all …]
/NextBSD/crypto/heimdal/lib/asn1/
HDasn1_queue.h47 #define ASN1_TAILQ_HEAD_INITIALIZER(head) \ argument
48 { NULL, &(head).tqh_first }
59 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field) \ argument
60 if ((head)->tqh_first && \
61 (head)->tqh_first->field.tqe_prev != &(head)->tqh_first) \
62 panic("ASN1_TAILQ_INSERT_HEAD %p %s:%d", (head), __FILE__, __LINE__);
63 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field) \ argument
64 if (*(head)->tqh_last != NULL) \
65 panic("ASN1_TAILQ_INSERT_TAIL %p %s:%d", (head), __FILE__, __LINE__);
73 #define QUEUEDEBUG_ASN1_TAILQ_PREREMOVE(head, elm, field) \ argument
[all …]
/NextBSD/sys/dev/drm2/
HDdrm_linux_list.h46 INIT_LIST_HEAD(struct list_head *head) { in INIT_LIST_HEAD() argument
47 (head)->next = head; in INIT_LIST_HEAD()
48 (head)->prev = head; in INIT_LIST_HEAD()
57 list_empty(const struct list_head *head) { in list_empty() argument
58 return (head)->next == head; in list_empty()
62 list_add(struct list_head *new, struct list_head *head) { in list_add() argument
63 (head)->next->prev = new; in list_add()
64 (new)->next = (head)->next; in list_add()
65 (new)->prev = head; in list_add()
66 (head)->next = new; in list_add()
[all …]
/NextBSD/sys/kern/
HDsubr_disk.c147 bioq_init(struct bio_queue_head *head) in bioq_init() argument
150 TAILQ_INIT(&head->queue); in bioq_init()
151 head->last_offset = 0; in bioq_init()
152 head->insert_point = NULL; in bioq_init()
156 bioq_remove(struct bio_queue_head *head, struct bio *bp) in bioq_remove() argument
159 if (head->insert_point == NULL) { in bioq_remove()
160 if (bp == TAILQ_FIRST(&head->queue)) in bioq_remove()
161 head->last_offset = bp->bio_offset + bp->bio_length; in bioq_remove()
162 } else if (bp == head->insert_point) in bioq_remove()
163 head->insert_point = NULL; in bioq_remove()
[all …]
/NextBSD/sys/sys/mach/
HDqueue.h355 #define queue_enter(head, elt, type, field) \ argument
359 prev = (head)->prev; \
360 if ((head) == prev) { \
361 (head)->next = (queue_entry_t) (elt); \
367 (elt)->field.next = head; \
368 (head)->prev = (queue_entry_t) elt; \
382 #define queue_enter_first(head, elt, type, field) \ argument
386 next = (head)->next; \
387 if ((head) == next) { \
388 (head)->prev = (queue_entry_t) (elt); \
[all …]
/NextBSD/contrib/elftoolchain/common/
HDuthash.h96 #define HASH_FIND(hh,head,keyptr,keylen,out) \ argument
100 if (head) { \
101 HASH_FCN(keyptr,keylen, (head)->hh.tbl->num_buckets, _hf_hashv, _hf_bkt); \
102 if (HASH_BLOOM_TEST((head)->hh.tbl, _hf_hashv)) { \
103 HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], \
142 #define HASH_MAKE_TABLE(hh,head) \ argument
144 (head)->hh.tbl = (UT_hash_table*)uthash_malloc( \
146 if (!((head)->hh.tbl)) { uthash_fatal( "out of memory"); } \
147 memset((head)->hh.tbl, 0, sizeof(UT_hash_table)); \
148 (head)->hh.tbl->tail = &((head)->hh); \
[all …]
HD_elftc.h80 #define LIST_FOREACH_SAFE(var, head, field, tvar) \ argument
81 for ((var) = LIST_FIRST((head)); \
87 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
88 for ((var) = SLIST_FIRST((head)); \
104 #define STAILQ_EMPTY(head) ((head)->stqh_first == NULL) argument
115 #define STAILQ_FIRST(head) ((head)->stqh_first) argument
127 #define STAILQ_HEAD_INITIALIZER(head) \ argument
128 { NULL, &(head).stqh_first }
132 #define STAILQ_FOREACH(var, head, field) \ argument
133 for ((var) = ((head)->stqh_first); \
[all …]
/NextBSD/contrib/ntp/sntp/libevent/WIN32-Code/
HDtree.h77 #define SPLAY_ROOT(head) (head)->sph_root argument
78 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
81 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
82 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
83 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
84 (head)->sph_root = tmp; \
87 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
88 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
89 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
90 (head)->sph_root = tmp; \
[all …]
/NextBSD/tools/tools/drm/radeon/mkregtable/
HDmkregtable.c87 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
89 __list_add(new, head, head->next); in list_add()
100 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
102 __list_add(new, head->prev, head); in list_add_tail()
172 static inline void list_move(struct list_head *list, struct list_head *head) in list_move() argument
175 list_add(list, head); in list_move()
184 struct list_head *head) in list_move_tail() argument
187 list_add_tail(list, head); in list_move_tail()
196 const struct list_head *head) in list_is_last() argument
198 return list->next == head; in list_is_last()
[all …]
/NextBSD/sys/dev/drm/
HDdrm_linux_list.h46 INIT_LIST_HEAD(struct list_head *head) { in INIT_LIST_HEAD() argument
47 (head)->next = head; in INIT_LIST_HEAD()
48 (head)->prev = head; in INIT_LIST_HEAD()
52 list_empty(struct list_head *head) { in list_empty() argument
53 return (head)->next == head; in list_empty()
57 list_add(struct list_head *new, struct list_head *head) { in list_add() argument
58 (head)->next->prev = new; in list_add()
59 (new)->next = (head)->next; in list_add()
60 (new)->prev = head; in list_add()
61 (head)->next = new; in list_add()
[all …]
/NextBSD/contrib/ipfilter/sys/
HDtree.h80 #define SPLAY_ROOT(head) (head)->sph_root argument
81 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
84 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
85 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
86 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
87 (head)->sph_root = tmp; \
90 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
91 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
92 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
93 (head)->sph_root = tmp; \
[all …]
/NextBSD/sys/compat/linuxkpi/common/include/linux/
HDlist.h88 list_empty(const struct list_head *head) in list_empty() argument
91 return (head->next == head); in list_empty()
138 #define list_for_each(p, head) \ argument
139 for (p = (head)->next; p != (head); p = p->next)
141 #define list_for_each_safe(p, n, head) \ argument
142 for (p = (head)->next, n = p->next; p != (head); p = n, n = p->next)
157 #define list_for_each_entry_safe_from(pos, n, head, member) \ argument
159 &pos->member != (head); \
169 list_add(struct list_head *new, struct list_head *head) in list_add() argument
172 _list_add(new, head, head->next); in list_add()
[all …]
/NextBSD/sys/dev/hpt27xx/
HDlist.h54 static HPT_INLINE void list_add(struct list_head *_new, struct list_head *head) in list_add() argument
56 __list_add(_new, head, head->next); in list_add()
59 static HPT_INLINE void list_add_tail(struct list_head *_new, struct list_head *head) in list_add_tail() argument
61 __list_add(_new, head->prev, head); in list_add_tail()
81 static HPT_INLINE int list_empty(struct list_head *head) in list_empty() argument
83 HPT_ASSERT(!(head->next==head && head->prev!=head)); in list_empty()
84 return head->next == head; in list_empty()
88 struct list_head *head) in __list_splice() argument
92 struct list_head *at = head->next; in __list_splice()
94 first->prev = head; in __list_splice()
[all …]

12345678910>>...41