Home
last modified time | relevance | path

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

12345678910>>...42

/freebsd-13-stable/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 …]
/freebsd-13-stable/contrib/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 …]
/freebsd-13-stable/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 …]
/freebsd-13-stable/crypto/openssh/openbsd-compat/
HDsys-queue.h191 #define SLIST_HEAD_INITIALIZER(head) \ argument
202 #define SLIST_FIRST(head) ((head)->slh_first) argument
203 #define SLIST_END(head) NULL argument
204 #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head)) argument
207 #define SLIST_FOREACH(var, head, field) \ argument
208 for((var) = SLIST_FIRST(head); \
209 (var) != SLIST_END(head); \
212 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
213 for ((var) = SLIST_FIRST(head); \
220 #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 …]
/freebsd-13-stable/contrib/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 …]
/freebsd-13-stable/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 …]
/freebsd-13-stable/sys/sys/
HDarb.h59 #define ARB_ALLOCSIZE(head, maxn, x) \ argument
60 (sizeof(*head) + (maxn) * sizeof(*x))
66 #define ARB_INIT(x, field, head, maxn) \ argument
67 (head)->arb_curnodes = 0; \
68 (head)->arb_maxnodes = (maxn); \
69 (head)->arb_root_idx = (head)->arb_free_idx = \
70 (head)->arb_min_idx = (head)->arb_max_idx = ARB_NULLIDX; \
72 ARB_ARRFOREACH_REVWCOND(x, field, head, \
73 ARB_RETURNFREE(head, x, field))
93 #define ARB_ELMTYPE(head) __typeof(&(head)->arb_nodes[0]) argument
[all …]
HDqueue.h136 #define QMD_TRACE_HEAD(head) do { \ argument
137 (head)->trace.prevline = (head)->trace.lastline; \
138 (head)->trace.prevfile = (head)->trace.lastfile; \
139 (head)->trace.lastline = __LINE__; \
140 (head)->trace.lastfile = __FILE__; \
152 #define QMD_TRACE_HEAD(head) argument
189 #define SLIST_HEAD_INITIALIZER(head) \ argument
228 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
230 #define SLIST_FIRST(head) ((head)->slh_first) argument
232 #define SLIST_FOREACH(var, head, field) \ argument
[all …]
/freebsd-13-stable/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 …]
/freebsd-13-stable/sys/kern/
HDsubr_disk.c152 bioq_init(struct bio_queue_head *head) in bioq_init() argument
155 TAILQ_INIT(&head->queue); in bioq_init()
156 head->last_offset = 0; in bioq_init()
157 head->insert_point = NULL; in bioq_init()
158 head->total = 0; in bioq_init()
159 head->batched = 0; in bioq_init()
163 bioq_remove(struct bio_queue_head *head, struct bio *bp) in bioq_remove() argument
166 if (head->insert_point == NULL) { in bioq_remove()
167 if (bp == TAILQ_FIRST(&head->queue)) in bioq_remove()
168 head->last_offset = bp->bio_offset + bp->bio_length; in bioq_remove()
[all …]
/freebsd-13-stable/contrib/libarchive/unzip/
HDla_queue.h105 #define QMD_TRACE_HEAD(head) do { \ argument
106 (head)->trace.prevline = (head)->trace.lastline; \
107 (head)->trace.prevfile = (head)->trace.lastfile; \
108 (head)->trace.lastline = __LINE__; \
109 (head)->trace.lastfile = __FILE__; \
121 #define QMD_TRACE_HEAD(head) argument
158 #define SLIST_HEAD_INITIALIZER(head) \ argument
197 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
199 #define SLIST_FIRST(head) ((head)->slh_first) argument
201 #define SLIST_FOREACH(var, head, field) \ argument
[all …]
/freebsd-13-stable/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 …]
/freebsd-13-stable/sys/contrib/ck/include/
HDck_queue.h131 #define CK_SLIST_HEAD_INITIALIZER(head) \ argument
142 #define CK_SLIST_EMPTY(head) \ argument
143 (ck_pr_load_ptr(&(head)->cslh_first) == NULL)
145 #define CK_SLIST_FIRST(head) \ argument
146 (ck_pr_load_ptr(&(head)->cslh_first))
151 #define CK_SLIST_FOREACH(var, head, field) \ argument
152 for ((var) = CK_SLIST_FIRST((head)); \
156 #define CK_SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
157 for ((var) = CK_SLIST_FIRST(head); \
161 #define CK_SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
[all …]
/freebsd-13-stable/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 …]
/freebsd-13-stable/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 …]
/freebsd-13-stable/contrib/sendmail/include/sm/
HDtailq.h63 #define SM_TAILQ_HEAD_INITIALIZER(head) \ argument
64 { NULL, &(head).tqh_first }
75 #define SM_TAILQ_FIRST(head) ((head)->tqh_first) argument
76 #define SM_TAILQ_END(head) NULL argument
78 #define SM_TAILQ_LAST(head, headname) \ argument
79 (*(((struct headname *)((head)->tqh_last))->tqh_last))
83 #define SM_TAILQ_EMPTY(head) \ argument
84 (SM_TAILQ_FIRST(head) == SM_TAILQ_END(head))
86 #define SM_TAILQ_FOREACH(var, head, field) \ argument
87 for((var) = SM_TAILQ_FIRST(head); \
[all …]
/freebsd-13-stable/tools/tools/drm/radeon/mkregtable/
HDmkregtable.c85 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
87 __list_add(new, head, head->next); in list_add()
98 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
100 __list_add(new, head->prev, head); in list_add_tail()
170 static inline void list_move(struct list_head *list, struct list_head *head) in list_move() argument
173 list_add(list, head); in list_move()
182 struct list_head *head) in list_move_tail() argument
185 list_add_tail(list, head); in list_move_tail()
194 const struct list_head *head) in list_is_last() argument
196 return list->next == head; in list_is_last()
[all …]
/freebsd-13-stable/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 …]
/freebsd-13-stable/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 …]
/freebsd-13-stable/contrib/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 …]
/freebsd-13-stable/sys/dev/drm2/
HDdrm_linux_list.h43 INIT_LIST_HEAD(struct list_head *head) { in INIT_LIST_HEAD() argument
44 (head)->next = head; in INIT_LIST_HEAD()
45 (head)->prev = head; in INIT_LIST_HEAD()
54 list_empty(const struct list_head *head) { in list_empty() argument
55 return (head)->next == head; in list_empty()
59 list_add(struct list_head *new, struct list_head *head) { in list_add() argument
60 (head)->next->prev = new; in list_add()
61 (new)->next = (head)->next; in list_add()
62 (new)->prev = head; in list_add()
63 (head)->next = new; in list_add()
[all …]
/freebsd-13-stable/sys/compat/linuxkpi/common/include/linux/
HDlist.h95 list_empty(const struct list_head *head) in list_empty() argument
98 return (head->next == head); in list_empty()
102 list_empty_careful(const struct list_head *head) in list_empty_careful() argument
104 struct list_head *next = head->next; in list_empty_careful()
106 return ((next == head) && (next == head->prev)); in list_empty_careful()
185 #define list_for_each(p, head) \ argument
186 for (p = (head)->next; p != (head); p = (p)->next)
188 #define list_for_each_safe(p, n, head) \ argument
189 for (p = (head)->next, n = (p)->next; p != (head); p = n, n = (p)->next)
208 #define list_for_each_entry_safe_from(pos, n, head, member) \ argument
[all …]

12345678910>>...42