Home
last modified time | relevance | path

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

12345678910>>...44

/freebsd/sys/dev/sound/midi/
H A Dmidiq.h46 #define MIDIQ_EMPTY(head) ((head).h == (head).t ) argument
48 #define MIDIQ_LENBASE(head) ((head).h - (head).t < 0 ? \ argument
53 #define MIDIQ_AVAIL(head) (MIDIQ_FULL(head) ? 0 : (head).s - MIDIQ_LENBASE(head)) argument
54 #define MIDIQ_LEN(head) ((head).s - MIDIQ_AVAIL(head)) argument
66 …MIDIQ_MOVE(&(head).b[(head).h], (buf), sizeof(*(head).b) * MIN((size), (head).s - (head).h)); …
70 …MIDIQ_MOVE((head).b, (buf) + (head).s - (head).h, sizeof(*(head).b) * ((size) - (head).s + (head).…
80 if(MIDIQ_FULL(head)) (head).h=(head).t; \
87 …if (move) MIDIQ_MOVE((buf) + (head).s - (head).t, (head).b, sizeof(*(head).b) * ((size) - (head).s…
100 #define MIDIQ_CLEAR(head) ((head).h = (head).t = 0) argument
101 #define MIDIQ_BUF(head) ((head).b) argument
[all …]
/freebsd/contrib/ntp/sntp/libevent/compat/sys/
H A Dqueue.h106 #define SLIST_FIRST(head) ((head)->slh_first) argument
108 #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head)) argument
120 SLIST_FIRST(head) = SLIST_END(head); \
157 #define LIST_FIRST(head) ((head)->lh_first) argument
159 #define LIST_EMPTY(head) (LIST_FIRST(head) == LIST_END(head)) argument
171 LIST_FIRST(head) = LIST_END(head); \
233 #define SIMPLEQ_EMPTY(head) (SIMPLEQ_FIRST(head) == SIMPLEQ_END(head)) argument
246 (head)->sqh_last = &(head)->sqh_first; \
302 (TAILQ_FIRST(head) == TAILQ_END(head))
385 { CIRCLEQ_END(&head), CIRCLEQ_END(&head) }
[all …]
/freebsd/contrib/libevent/compat/sys/
H A Dqueue.h106 #define SLIST_FIRST(head) ((head)->slh_first) argument
108 #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head)) argument
120 SLIST_FIRST(head) = SLIST_END(head); \
157 #define LIST_FIRST(head) ((head)->lh_first) argument
159 #define LIST_EMPTY(head) (LIST_FIRST(head) == LIST_END(head)) argument
171 LIST_FIRST(head) = LIST_END(head); \
233 #define SIMPLEQ_EMPTY(head) (SIMPLEQ_FIRST(head) == SIMPLEQ_END(head)) argument
246 (head)->sqh_last = &(head)->sqh_first; \
302 (TAILQ_FIRST(head) == TAILQ_END(head))
385 { CIRCLEQ_END(&head), CIRCLEQ_END(&head) }
[all …]
/freebsd/crypto/openssh/openbsd-compat/
H A Dsys-queue.h204 #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head)) argument
221 SLIST_FIRST(head) = SLIST_END(head); \
278 #define LIST_EMPTY(head) (LIST_FIRST(head) == LIST_END(head)) argument
295 LIST_FIRST(head) = LIST_END(head); \
361 #define SIMPLEQ_EMPTY(head) (SIMPLEQ_FIRST(head) == SIMPLEQ_END(head)) argument
439 #define XSIMPLEQ_FIRST(head) XSIMPLEQ_XOR(head, ((head)->sqx_first)) argument
441 #define XSIMPLEQ_EMPTY(head) (XSIMPLEQ_FIRST(head) == XSIMPLEQ_END(head)) argument
461 (head)->sqx_last = XSIMPLEQ_XOR(head, &(head)->sqx_first); \
473 *(XSIMPLEQ_XOR(head, (head)->sqx_last)) = XSIMPLEQ_XOR(head, (elm)); \
487 (head)->sqx_last = XSIMPLEQ_XOR(head, &(head)->sqx_first); \
[all …]
H A Dsys-tree.h84 #define SPLAY_ROOT(head) (head)->sph_root argument
85 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
103 (head)->sph_root = SPLAY_LEFT((head)->sph_root, field); \
109 (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field); \
131 if (SPLAY_EMPTY(head)) \
197 (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field);\
200 (head)->sph_root = SPLAY_LEFT((head)->sph_root, field);\
324 #define RB_ROOT(head) (head)->rbh_root argument
325 #define RB_EMPTY(head) (RB_ROOT(head) == NULL) argument
486 elm = RB_ROOT(head); \
[all …]
/freebsd/contrib/ntp/sntp/libevent/
H A Dht-internal.h50 (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
56 #define HT_START(name, head) name##_HT_START(head) argument
57 #define HT_NEXT(name, head, elm) name##_HT_NEXT((head), (elm)) argument
59 #define HT_CLEAR(name, head) name##_HT_CLEAR(head) argument
60 #define HT_INIT(name, head) name##_HT_INIT(head) argument
174 if (!head->hth_table || head->hth_n_entries >= head->hth_load_limit) \
[all …]
/freebsd/contrib/libevent/
H A Dht-internal.h50 (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
56 #define HT_START(name, head) name##_HT_START(head) argument
57 #define HT_NEXT(name, head, elm) name##_HT_NEXT((head), (elm)) argument
59 #define HT_CLEAR(name, head) name##_HT_CLEAR(head) argument
60 #define HT_INIT(name, head) name##_HT_INIT(head) argument
174 if (!head->hth_table || head->hth_n_entries >= head->hth_load_limit) \
[all …]
/freebsd/sys/sys/
H A Darb.h69 (head)->arb_root_idx = (head)->arb_free_idx = \
94 #define ARB_NODES(head) (head)->arb_nodes argument
95 #define ARB_MAXNODES(head) (head)->arb_maxnodes argument
96 #define ARB_CURNODES(head) (head)->arb_curnodes argument
98 #define ARB_FULL(head) ((head)->arb_curnodes >= (head)->arb_maxnodes) argument
104 #define ARB_ROOT(head) ARB_NODE(head, ARB_ROOTIDX(head)) argument
108 #define ARB_FREEIDX(head) (head)->arb_free_idx argument
109 #define ARB_ROOTIDX(head) (head)->arb_root_idx argument
110 #define ARB_MINIDX(head) (head)->arb_min_idx argument
111 #define ARB_MAXIDX(head) (head)->arb_max_idx argument
[all …]
H A Dqueue.h136 (head)->trace.prevline = (head)->trace.lastline; \
137 (head)->trace.prevfile = (head)->trace.lastfile; \
227 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
229 #define SLIST_FIRST(head) ((head)->slh_first) argument
352 #define STAILQ_FIRST(head) ((head)->stqh_first) argument
376 (head)->stqh_last = &STAILQ_FIRST((head)); \
427 (head)->stqh_last = &STAILQ_FIRST((head)); \
539 #define LIST_FIRST(head) ((head)->lh_first) argument
743 #define TAILQ_FIRST(head) ((head)->tqh_first) argument
787 (head)->tqh_last = &TAILQ_FIRST((head)); \
[all …]
/freebsd/contrib/openbsm/compat/
H A Dqueue.h117 (head)->trace.prevline = (head)->trace.lastline; \
118 (head)->trace.prevfile = (head)->trace.lastfile; \
156 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
158 #define SLIST_FIRST(head) ((head)->slh_first) argument
239 #define STAILQ_FIRST(head) ((head)->stqh_first) argument
254 (head)->stqh_last = &STAILQ_FIRST((head)); \
301 (head)->stqh_last = &STAILQ_FIRST((head)); \
306 (head)->stqh_last = &STAILQ_FIRST((head)); \
357 #define LIST_FIRST(head) ((head)->lh_first) argument
447 #define TAILQ_FIRST(head) ((head)->tqh_first) argument
[all …]
/freebsd/sys/kern/
H A Dsubr_disk.c156 head->last_offset = 0; in bioq_init()
158 head->total = 0; in bioq_init()
159 head->batched = 0; in bioq_init()
174 head->batched = 0; in bioq_remove()
175 head->total--; in bioq_remove()
194 head->total++; in bioq_insert_head()
195 head->batched = 0; in bioq_insert_head()
203 head->total++; in bioq_insert_tail()
204 head->batched = 0; in bioq_insert_tail()
297 head->total++; in bioq_disksort()
[all …]
/freebsd/contrib/libarchive/unzip/
H A Dla_queue.h106 (head)->trace.prevline = (head)->trace.lastline; \
107 (head)->trace.prevfile = (head)->trace.lastfile; \
197 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
199 #define SLIST_FIRST(head) ((head)->slh_first) argument
318 #define STAILQ_FIRST(head) ((head)->stqh_first) argument
342 (head)->stqh_last = &STAILQ_FIRST((head)); \
393 (head)->stqh_last = &STAILQ_FIRST((head)); \
501 #define LIST_EMPTY(head) ((head)->lh_first == NULL) argument
503 #define LIST_FIRST(head) ((head)->lh_first) argument
687 #define TAILQ_FIRST(head) ((head)->tqh_first) argument
[all …]
/freebsd/contrib/libucl/uthash/
H A Dutlist.h310 LL_PREPEND2(head,add,next)
334 LL_APPEND2(head,add,next)
350 LL_DELETE2(head,del,next)
356 (head)=(head)->next; \
390 (head)=(head)->next; \
429 LL_FOREACH2(head,el,next)
585 DL_FOREACH2(head,el,next)
670 if ( ((head)==(del)) && ((head)->next == (head))) { \
689 CDL_FOREACH2(head,el,next)
692 for(el=head;el;el=((el)->next==head ? 0L : (el)->next))
[all …]
H A Duthash.h102 HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], \
148 (head)->hh.tbl->tail = &((head)->hh); \
151 (head)->hh.tbl->hho = (char*)(&(head)->hh) - (char*)(head); \
186 (add)->hh.prev = ELMT_FROM_HH((head)->hh.tbl, (head)->hh.tbl->tail); \
228 if ((delptr) == ELMT_FROM_HH((head)->hh.tbl,(head)->hh.tbl->tail)) { \
331 #define HASH_FSCK(hh,head) argument
490 #define HASH_SORT(head,cmpfcn) HASH_SRT(hh,head,cmpfcn) argument
640 for((el)=(head), (*(char**)(&(tmp)))=(char*)((head)?(head)->hh.next:NULL); \
644 for((el)=(head),(tmp)=DECLTYPE(el)((head)?(head)->hh.next:NULL); \
649 #define HASH_COUNT(head) HASH_CNT(hh,head) argument
[all …]
/freebsd/sys/contrib/ck/include/
H A Dck_queue.h142 #define CK_SLIST_EMPTY(head) \ argument
145 #define CK_SLIST_FIRST(head) \ argument
146 (ck_pr_load_ptr(&(head)->cslh_first))
171 #define CK_SLIST_INIT(head) do { \ argument
242 { NULL, &(head).cstqh_first }
261 #define CK_STAILQ_EMPTY(head) (ck_pr_load_ptr(&(head)->cstqh_first) == NULL) argument
263 #define CK_STAILQ_FIRST(head) (ck_pr_load_ptr(&(head)->cstqh_first)) argument
284 (head)->cstqh_last = &(head)->cstqh_first; \
335 (head)->cstqh_last = &(head)->cstqh_first; \
378 #define CK_LIST_FIRST(head) ck_pr_load_ptr(&(head)->clh_first) argument
[all …]
/freebsd/crypto/heimdal/base/
H A Dheimqueue.h48 { NULL, &(head).tqh_first }
60 if ((head)->tqh_first && \
61 (head)->tqh_first->field.tqe_prev != &(head)->tqh_first) \
64 if (*(head)->tqh_last != NULL) \
90 (head)->tqh_first = NULL; \
91 (head)->tqh_last = &(head)->tqh_first; \
101 (head)->tqh_first = (elm); \
109 *(head)->tqh_last = (elm); \
145 for ((var) = ((head)->tqh_first); \
157 #define HEIM_TAILQ_EMPTY(head) ((head)->tqh_first == NULL) argument
[all …]
/freebsd/crypto/heimdal/lib/asn1/
H A Dasn1_queue.h48 { NULL, &(head).tqh_first }
60 if ((head)->tqh_first && \
61 (head)->tqh_first->field.tqe_prev != &(head)->tqh_first) \
64 if (*(head)->tqh_last != NULL) \
90 (head)->tqh_first = NULL; \
91 (head)->tqh_last = &(head)->tqh_first; \
101 (head)->tqh_first = (elm); \
109 *(head)->tqh_last = (elm); \
145 for ((var) = ((head)->tqh_first); \
157 #define ASN1_TAILQ_EMPTY(head) ((head)->tqh_first == NULL) argument
[all …]
/freebsd/contrib/sendmail/include/sm/
H A Dtailq.h64 { NULL, &(head).tqh_first }
75 #define SM_TAILQ_FIRST(head) ((head)->tqh_first) argument
76 #define SM_TAILQ_END(head) NULL argument
83 #define SM_TAILQ_EMPTY(head) \ argument
84 (SM_TAILQ_FIRST(head) == SM_TAILQ_END(head))
88 (var) != SM_TAILQ_END(head); \
93 (var) != SM_TAILQ_END(head); \
100 (head)->tqh_first = NULL; \
101 (head)->tqh_last = &(head)->tqh_first; \
110 (head)->tqh_first = (elm); \
[all …]
/freebsd/tools/tools/drm/radeon/mkregtable/
H A Dmkregtable.c86 __list_add(new, head, head->next); in list_add()
99 __list_add(new, head->prev, head); in list_add_tail()
204 return head->next == head; in list_empty()
223 return (next == head) && (next == head->prev); in list_empty_careful()
232 return !list_empty(head) && (head->next == head->prev); in list_is_singular()
268 if (list_is_singular(head) && (head->next != entry && head != entry)) in list_cut_position()
298 __list_splice(list, head, head->next); in list_splice()
310 __list_splice(list, head->prev, head); in list_splice_tail()
324 __list_splice(list, head, head->next); in list_splice_init()
341 __list_splice(list, head->prev, head); in list_splice_tail_init()
[all …]
/freebsd/contrib/elftoolchain/common/
H A Duthash.h103 HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], \
148 (head)->hh.tbl->tail = &((head)->hh); \
151 (head)->hh.tbl->hho = (char*)(&(head)->hh) - (char*)(head); \
176 (add)->hh.prev = ELMT_FROM_HH((head)->hh.tbl, (head)->hh.tbl->tail); \
218 if ((delptr) == ELMT_FROM_HH((head)->hh.tbl,(head)->hh.tbl->tail)) { \
584 if (head.hh_head) DECLTYPE_ASSIGN(out,ELMT_FROM_HH(tbl,head.hh_head)); \
703 #define HASH_SORT(head,cmpfcn) HASH_SRT(hh,head,cmpfcn) argument
839 for((el)=(head), (*(char**)(&(tmp)))=(char*)((head)?(head)->hh.next:NULL); \
843 for((el)=(head),(tmp)=DECLTYPE(el)((head)?(head)->hh.next:NULL); \
848 #define HASH_COUNT(head) HASH_CNT(hh,head) argument
[all …]
H A D_elftc.h104 #define STAILQ_EMPTY(head) ((head)->stqh_first == NULL) argument
115 #define STAILQ_FIRST(head) ((head)->stqh_first) argument
128 { NULL, &(head).stqh_first }
147 (head)->stqh_first = NULL; \
148 (head)->stqh_last = &(head)->stqh_first; \
178 (STAILQ_EMPTY((head)) ? \
204 if (((head)->stqh_first = (head)->stqh_first->field.stqe_next) == \
206 (head)->stqh_last = &(head)->stqh_first; \
230 _e = STAILQ_FIRST((head)); \
239 _q = STAILQ_FIRST((head)); \
[all …]
/freebsd/contrib/ntp/sntp/libevent/WIN32-Code/
H A Dtree.h77 #define SPLAY_ROOT(head) (head)->sph_root argument
78 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
96 (head)->sph_root = SPLAY_LEFT((head)->sph_root, field); \
102 (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field); \
124 if (SPLAY_EMPTY(head)) \
190 (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field);\
193 (head)->sph_root = SPLAY_LEFT((head)->sph_root, field);\
317 #define RB_ROOT(head) (head)->rbh_root argument
318 #define RB_EMPTY(head) (RB_ROOT(head) == NULL) argument
469 elm = RB_ROOT(head); \
[all …]
/freebsd/contrib/libevent/WIN32-Code/
H A Dtree.h77 #define SPLAY_ROOT(head) (head)->sph_root argument
78 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
96 (head)->sph_root = SPLAY_LEFT((head)->sph_root, field); \
102 (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field); \
124 if (SPLAY_EMPTY(head)) \
190 (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field);\
193 (head)->sph_root = SPLAY_LEFT((head)->sph_root, field);\
317 #define RB_ROOT(head) (head)->rbh_root argument
318 #define RB_EMPTY(head) (RB_ROOT(head) == NULL) argument
469 elm = RB_ROOT(head); \
[all …]
/freebsd/sys/dev/drm2/
H A Ddrm_linux_list.h44 (head)->next = head; in INIT_LIST_HEAD()
45 (head)->prev = head; in INIT_LIST_HEAD()
55 return (head)->next == head; in list_empty()
69 (entry)->next = head; in list_add_tail()
71 (head)->prev = entry; in list_add_tail()
92 list_add(list, head); in list_move()
110 for (entry = (head)->next; entry != head; entry = (entry)->next)
113 for (entry = (head)->prev; entry != (head); \
118 entry != head; \
173 __list_splice(list, head, head->next); in list_splice()
[all …]
/freebsd/sys/dev/hpt27xx/
H A Dlist.h56 __list_add(_new, head, head->next); in list_add()
61 __list_add(_new, head->prev, head); in list_add_tail()
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
94 first->prev = head; in __list_splice()
95 head->next = first; in __list_splice()
104 __list_splice(list, head); in list_splice()
110 __list_splice(list, head); in list_splice_init()
119 for (pos = (head)->next; pos != (head); pos = pos->next)
[all …]

12345678910>>...44