Home
last modified time | relevance | path

Searched defs:head (Results 1 – 25 of 427) sorted by relevance

12345678910>>...18

/freebsd-9-stable/contrib/ntp/sntp/libevent/compat/sys/
Dqueue.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
119 #define SLIST_INIT(head) { \ argument
128 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
133 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
145 #define LIST_HEAD_INITIALIZER(head) \ argument
157 #define LIST_FIRST(head) ((head)->lh_first) argument
[all …]
/freebsd-9-stable/crypto/openssh/openbsd-compat/
Dsys-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
205 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
213 #define SLIST_INIT(head) { \ argument
222 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
231 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
235 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
[all …]
Dsys-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
94 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
100 #define SPLAY_LINKLEFT(head, tmp, field) do { \ argument
106 #define SPLAY_LINKRIGHT(head, tmp, field) do { \ argument
112 #define SPLAY_ASSEMBLE(head, node, left, right, field) do { \ argument
292 #define SPLAY_FOREACH(x, name, head) \ argument
324 #define RB_ROOT(head) (head)->rbh_root argument
325 #define RB_EMPTY(head) (RB_ROOT(head) == NULL) argument
[all …]
/freebsd-9-stable/sys/dev/sound/midi/
Dmidiq.h40 #define MIDIQ_INIT(head, buf, size) do { \ argument
46 #define MIDIQ_EMPTY(head) ((head).h == (head).t ) argument
48 #define MIDIQ_LENBASE(head) ((head).h - (head).t < 0 ? \ argument
52 #define MIDIQ_FULL(head) ((head).h == -1) 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
59 #define MIDIQ_ENQ(head, buf, size) do { … argument
79 #define MIDIQ_DEQ_I(head, buf, size, move, update) do { … argument
99 #define MIDIQ_SIZE(head) ((head).s) argument
100 #define MIDIQ_CLEAR(head) ((head).h = (head).t = 0) argument
[all …]
/freebsd-9-stable/contrib/openbsm/compat/
Dqueue.h117 #define QMD_TRACE_HEAD(head) do { \ argument
133 #define QMD_TRACE_HEAD(head) argument
146 #define SLIST_HEAD_INITIALIZER(head) \ argument
157 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
159 #define SLIST_FIRST(head) ((head)->slh_first) argument
161 #define SLIST_FOREACH(var, head, field) \ argument
166 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
171 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
176 #define SLIST_INIT(head) do { \ argument
185 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
[all …]
/freebsd-9-stable/usr.bin/csup/
Dqueue.h52 #define STAILQ_HEAD_INITIALIZER(head) \ argument
62 #define STAILQ_EMPTY(head) ((head)->stqh_first == NULL) argument
65 #define STAILQ_FIRST(head) ((head)->stqh_first) argument
68 #define STAILQ_FOREACH(var, head, field) \ argument
74 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
80 #define STAILQ_INIT(head) do { \ argument
86 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \ argument
93 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
100 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
107 #define STAILQ_LAST(head, type, field) \ argument
[all …]
/freebsd-9-stable/sys/geom/sched/
Dsubr_disk.c106 gs_bioq_init(struct bio_queue_head *head) in gs_bioq_init()
115 gs_bioq_remove(struct bio_queue_head *head, struct bio *bp) in gs_bioq_remove()
128 gs_bioq_flush(struct bio_queue_head *head, struct devstat *stp, int error) in gs_bioq_flush()
137 gs_bioq_insert_head(struct bio_queue_head *head, struct bio *bp) in gs_bioq_insert_head()
146 gs_bioq_insert_tail(struct bio_queue_head *head, struct bio *bp) in gs_bioq_insert_tail()
155 gs_bioq_first(struct bio_queue_head *head) in gs_bioq_first()
162 gs_bioq_takefirst(struct bio_queue_head *head) in gs_bioq_takefirst()
178 gs_bioq_bio_key(struct bio_queue_head *head, struct bio *bp) in gs_bioq_bio_key()
192 gs_bioq_disksort(struct bio_queue_head *head, struct bio *bp) in gs_bioq_disksort()
/freebsd-9-stable/sys/sys/
Dqueue.h124 #define QMD_TRACE_HEAD(head) do { \ argument
140 #define QMD_TRACE_HEAD(head) argument
168 #define SLIST_HEAD_INITIALIZER(head) \ argument
184 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
186 #define SLIST_FIRST(head) ((head)->slh_first) argument
188 #define SLIST_FOREACH(var, head, field) \ argument
193 #define SLIST_FOREACH_FROM(var, head, field) \ argument
198 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
203 #define SLIST_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
208 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
[all …]
Dtree.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
92 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
98 #define SPLAY_LINKLEFT(head, tmp, field) do { \ argument
104 #define SPLAY_LINKRIGHT(head, tmp, field) do { \ argument
110 #define SPLAY_ASSEMBLE(head, node, left, right, field) do { \ argument
290 #define SPLAY_FOREACH(x, name, head) \ argument
322 #define RB_ROOT(head) (head)->rbh_root argument
323 #define RB_EMPTY(head) (RB_ROOT(head) == NULL) argument
[all …]
/freebsd-9-stable/contrib/libucl/uthash/
Dutlist.h309 #define LL_PREPEND(head,add) \ argument
312 #define LL_PREPEND2(head,add,next) \ argument
333 #define LL_APPEND(head,add) \ argument
336 #define LL_APPEND2(head,add,next) \ argument
349 #define LL_DELETE(head,del) \ argument
352 #define LL_DELETE2(head,del,next) \ argument
369 #define LL_APPEND_VS2008(head,add) \ argument
372 #define LL_APPEND2_VS2008(head,add,next) \ argument
384 #define LL_DELETE_VS2008(head,del) \ argument
387 #define LL_DELETE2_VS2008(head,del,next) \ argument
[all …]
Duthash.h95 #define HASH_FIND(hh,head,keyptr,keylen,out) \ argument
142 #define HASH_MAKE_TABLE(hh,head) \ argument
161 #define HASH_ADD(hh,head,fieldname,keylen_in,add) \ argument
164 #define HASH_REPLACE(hh,head,fieldname,keylen_in,add,replaced) \ argument
174 #define HASH_ADD_KEYPTR(hh,head,keyptr,keylen_in,add) \ argument
216 #define HASH_DELETE(hh,head,delptr) \ argument
253 #define HASH_FIND_STR(head,findstr,out) \ argument
255 #define HASH_ADD_STR(head,strfield,add) \ argument
257 #define HASH_REPLACE_STR(head,strfield,add,replaced) \ argument
259 #define HASH_FIND_INT(head,findint,out) \ argument
[all …]
/freebsd-9-stable/contrib/sendmail/include/sm/
Dtailq.h63 #define SM_TAILQ_HEAD_INITIALIZER(head) \ argument
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
83 #define SM_TAILQ_EMPTY(head) \ argument
86 #define SM_TAILQ_FOREACH(var, head, field) \ argument
91 #define SM_TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
99 #define SM_TAILQ_INIT(head) do { \ argument
104 #define SM_TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
114 #define SM_TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
[all …]
/freebsd-9-stable/crypto/heimdal/lib/asn1/
Dasn1_queue.h47 #define ASN1_TAILQ_HEAD_INITIALIZER(head) \ argument
59 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field) \ argument
63 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field) \ argument
73 #define QUEUEDEBUG_ASN1_TAILQ_PREREMOVE(head, elm, field) \ argument
82 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field) argument
83 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field) argument
85 #define QUEUEDEBUG_ASN1_TAILQ_PREREMOVE(head, elm, field) argument
89 #define ASN1_TAILQ_INIT(head) do { \ argument
94 #define ASN1_TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
105 #define ASN1_TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
[all …]
/freebsd-9-stable/sys/kern/
Dsubr_disk.c147 bioq_init(struct bio_queue_head *head) in bioq_init()
156 bioq_remove(struct bio_queue_head *head, struct bio *bp) in bioq_remove()
169 bioq_flush(struct bio_queue_head *head, struct devstat *stp, int error) in bioq_flush()
178 bioq_insert_head(struct bio_queue_head *head, struct bio *bp) in bioq_insert_head()
187 bioq_insert_tail(struct bio_queue_head *head, struct bio *bp) in bioq_insert_tail()
196 bioq_first(struct bio_queue_head *head) in bioq_first()
203 bioq_takefirst(struct bio_queue_head *head) in bioq_takefirst()
219 bioq_bio_key(struct bio_queue_head *head, struct bio *bp) in bioq_bio_key()
233 bioq_disksort(struct bio_queue_head *head, struct bio *bp) in bioq_disksort()
/freebsd-9-stable/sys/dev/drm2/
Ddrm_linux_list.h46 INIT_LIST_HEAD(struct list_head *head) { in INIT_LIST_HEAD()
57 list_empty(const struct list_head *head) { in list_empty()
62 list_add(struct list_head *new, struct list_head *head) { in list_add()
70 list_add_tail(struct list_head *entry, struct list_head *head) { in list_add_tail()
92 static inline void list_move(struct list_head *list, struct list_head *head) in list_move()
99 struct list_head *head) in list_move_tail()
112 #define list_for_each(entry, head) \ argument
115 #define list_for_each_prev(entry, head) \ argument
119 #define list_for_each_safe(entry, temp, head) \ argument
124 #define list_for_each_entry(pos, head, member) \ argument
[all …]
/freebsd-9-stable/contrib/nvi/include/sys/
Dqueue.h85 #define LIST_INIT(head) { \ argument
104 #define LIST_INSERT_HEAD(head, elm, field) { \ argument
136 #define TAILQ_INIT(head) { \ argument
141 #define TAILQ_INSERT_HEAD(head, elm, field) { \ argument
151 #define TAILQ_INSERT_TAIL(head, elm, field) { \ argument
158 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) { \ argument
175 #define TAILQ_REMOVE(head, elm, field) { \ argument
202 #define CIRCLEQ_INIT(head) { \ argument
207 #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) { \ argument
217 #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) { \ argument
[all …]
/freebsd-9-stable/contrib/ntp/sntp/libevent/
Dht-internal.h41 #define HT_EMPTY(head) \ argument
45 #define HT_SIZE(head) \ argument
49 #define HT_MEM_USAGE(head) \ argument
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
58 #define HT_NEXT_RMV(name, head, elm) name##_HT_NEXT_RMV((head), (elm)) argument
[all …]
/freebsd-9-stable/sys/dev/drm/
Ddrm_linux_list.h46 INIT_LIST_HEAD(struct list_head *head) { in INIT_LIST_HEAD()
52 list_empty(struct list_head *head) { in list_empty()
57 list_add(struct list_head *new, struct list_head *head) { in list_add()
65 list_add_tail(struct list_head *entry, struct list_head *head) { in list_add_tail()
85 #define list_for_each(entry, head) \ argument
88 #define list_for_each_prev(entry, head) \ argument
92 #define list_for_each_safe(entry, temp, head) \ argument
104 #define list_for_each_entry_safe(pos, n, head, member) \ argument
/freebsd-9-stable/sys/ofed/include/linux/
Dlist.h83 list_empty(const struct list_head *head) in list_empty()
121 #define list_for_each(p, head) \ argument
124 #define list_for_each_safe(p, n, head) \ argument
143 list_add(struct list_head *new, struct list_head *head) in list_add()
150 list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail()
157 list_move(struct list_head *list, struct list_head *head) in list_move()
165 list_move_tail(struct list_head *entry, struct list_head *head) in list_move_tail()
190 list_splice(const struct list_head *list, struct list_head *head) in list_splice()
197 list_splice_tail(struct list_head *list, struct list_head *head) in list_splice_tail()
204 list_splice_init(struct list_head *list, struct list_head *head) in list_splice_init()
[all …]
/freebsd-9-stable/sys/netatalk/
Dat_rmx.c72 at_addroute(void *v_arg, void *n_arg, struct radix_node_head *head, in at_addroute()
80 at_matroute(void *v_arg, struct radix_node_head *head) in at_matroute()
87 at_lookup(void *v_arg, void *m_arg, struct radix_node_head *head) in at_lookup()
94 at_delroute(void *v_arg, void *netmask_arg, struct radix_node_head *head) in at_delroute()
104 at_inithead(void **head, int off) in at_inithead()
/freebsd-9-stable/sys/dev/hpt27xx/
Dlist.h54 static HPT_INLINE void list_add(struct list_head *_new, struct list_head *head) in list_add()
59 static HPT_INLINE void list_add_tail(struct list_head *_new, struct list_head *head) in list_add_tail()
81 static HPT_INLINE int list_empty(struct list_head *head) in list_empty()
88 struct list_head *head) in __list_splice()
101 static HPT_INLINE void list_splice(struct list_head *list, struct list_head *head) in list_splice()
107 static HPT_INLINE void list_splice_init(struct list_head *list, struct list_head *head) in list_splice_init()
118 #define list_for_each(pos, head) \ argument
121 #define list_for_each_safe(pos, n, head) \ argument
/freebsd-9-stable/sys/dev/hptrr/
Dlist.h56 static HPT_INLINE void list_add(struct list_head *_new, struct list_head *head) in list_add()
61 static HPT_INLINE void list_add_tail(struct list_head *_new, struct list_head *head) in list_add_tail()
83 static HPT_INLINE int list_empty(struct list_head *head) in list_empty()
90 struct list_head *head) in __list_splice()
103 static HPT_INLINE void list_splice(struct list_head *list, struct list_head *head) in list_splice()
109 static HPT_INLINE void list_splice_init(struct list_head *list, struct list_head *head) in list_splice_init()
120 #define list_for_each(pos, head) \ argument
123 #define list_for_each_safe(pos, n, head) \ argument
/freebsd-9-stable/sys/dev/hptnr/
Dlist.h53 static HPT_INLINE void list_add(struct list_head *_new, struct list_head *head) in list_add()
58 static HPT_INLINE void list_add_tail(struct list_head *_new, struct list_head *head) in list_add_tail()
80 static HPT_INLINE int list_empty(struct list_head *head) in list_empty()
87 struct list_head *head) in __list_splice()
100 static HPT_INLINE void list_splice(struct list_head *list, struct list_head *head) in list_splice()
106 static HPT_INLINE void list_splice_init(struct list_head *list, struct list_head *head) in list_splice_init()
117 #define list_for_each(pos, head) \ argument
120 #define list_for_each_safe(pos, n, head) \ argument
/freebsd-9-stable/contrib/libucl/src/
Dtree.h188 #define TREE_INSERT(head, node, field, elm) \ argument
191 #define TREE_FIND(head, node, field, elm) \ argument
194 #define TREE_REMOVE(head, node, field, elm) \ argument
197 #define TREE_DEPTH(head, field) \ argument
200 #define TREE_FORWARD_APPLY(head, node, field, function, data) \ argument
203 #define TREE_REVERSE_APPLY(head, node, field, function, data) \ argument
206 #define TREE_INIT(head, cmp) do { \ argument
/freebsd-9-stable/contrib/ntp/sntp/libevent/WIN32-Code/
Dtree.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
87 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
93 #define SPLAY_LINKLEFT(head, tmp, field) do { \ argument
99 #define SPLAY_LINKRIGHT(head, tmp, field) do { \ argument
105 #define SPLAY_ASSEMBLE(head, node, left, right, field) do { \ argument
285 #define SPLAY_FOREACH(x, name, head) \ argument
317 #define RB_ROOT(head) (head)->rbh_root argument
318 #define RB_EMPTY(head) (RB_ROOT(head) == NULL) argument
[all …]

12345678910>>...18