Home
last modified time | relevance | path

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

12345678910>>...21

/freebsd-11-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
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-11-stable/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
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 …]
/freebsd-11-stable/sys/dev/sound/midi/
HDmidiq.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-11-stable/contrib/openbsm/compat/
HDqueue.h116 #define QMD_TRACE_HEAD(head) do { \ argument
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
165 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
170 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
175 #define SLIST_INIT(head) do { \ argument
184 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
[all …]
/freebsd-11-stable/sys/sys/
HDqueue.h130 #define QMD_TRACE_HEAD(head) do { \ argument
146 #define QMD_TRACE_HEAD(head) argument
175 #define SLIST_HEAD_INITIALIZER(head) \ argument
204 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
206 #define SLIST_FIRST(head) ((head)->slh_first) argument
208 #define SLIST_FOREACH(var, head, field) \ argument
213 #define SLIST_FOREACH_FROM(var, head, field) \ argument
218 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
223 #define SLIST_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
228 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
[all …]
/freebsd-11-stable/contrib/libucl/uthash/
HDutlist.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 …]
HDuthash.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-11-stable/sys/contrib/ck/include/
HDck_queue.h131 #define CK_SLIST_HEAD_INITIALIZER(head) \ argument
142 #define CK_SLIST_EMPTY(head) \ argument
145 #define CK_SLIST_FIRST(head) \ argument
151 #define CK_SLIST_FOREACH(var, head, field) \ argument
156 #define CK_SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
161 #define CK_SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
166 #define CK_SLIST_INIT(head) do { \ argument
177 #define CK_SLIST_INSERT_HEAD(head, elm, field) do { \ argument
194 #define CK_SLIST_REMOVE(head, elm, type, field) do { \ argument
205 #define CK_SLIST_REMOVE_HEAD(head, field) do { \ argument
[all …]
/freebsd-11-stable/crypto/heimdal/base/
HDheimqueue.h47 #define HEIM_TAILQ_HEAD_INITIALIZER(head) \ argument
59 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_HEAD(head, elm, field) \ argument
63 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_TAIL(head, elm, field) \ argument
73 #define QUEUEDEBUG_HEIM_TAILQ_PREREMOVE(head, elm, field) \ argument
82 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_HEAD(head, elm, field) argument
83 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_TAIL(head, elm, field) argument
85 #define QUEUEDEBUG_HEIM_TAILQ_PREREMOVE(head, elm, field) argument
89 #define HEIM_TAILQ_INIT(head) do { \ argument
94 #define HEIM_TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
105 #define HEIM_TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
[all …]
/freebsd-11-stable/crypto/heimdal/lib/asn1/
HDasn1_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-11-stable/contrib/sendmail/include/sm/
HDtailq.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-11-stable/sys/kern/
HDsubr_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-11-stable/tools/tools/drm/radeon/mkregtable/
HDmkregtable.c87 static inline void list_add(struct list_head *new, struct list_head *head) in list_add()
100 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail()
172 static inline void list_move(struct list_head *list, struct list_head *head) in list_move()
184 struct list_head *head) in list_move_tail()
196 const struct list_head *head) in list_is_last()
205 static inline int list_empty(const struct list_head *head) in list_empty()
223 static inline int list_empty_careful(const struct list_head *head) in list_empty_careful()
233 static inline int list_is_singular(const struct list_head *head) in list_is_singular()
239 struct list_head *head, in __list_cut_position()
266 struct list_head *head, in list_cut_position()
[all …]
/freebsd-11-stable/crypto/heimdal/lib/gssapi/mech/
HDmechqueue.h45 #define HEIM_SLIST_HEAD_INITIALIZER(head) \ argument
56 #define HEIM_SLIST_INIT(head) do { \ argument
65 #define HEIM_SLIST_INSERT_HEAD(head, elm, field) do { \ argument
70 #define HEIM_SLIST_REMOVE_HEAD(head, field) do { \ argument
74 #define HEIM_SLIST_REMOVE(head, elm, type, field) do { \ argument
87 #define HEIM_SLIST_FOREACH(var, head, field) \ argument
93 #define HEIM_SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
94 #define HEIM_SLIST_FIRST(head) ((head)->slh_first) argument
/freebsd-11-stable/sys/dev/drm2/
HDdrm_linux_list.h45 INIT_LIST_HEAD(struct list_head *head) { in INIT_LIST_HEAD()
56 list_empty(const struct list_head *head) { in list_empty()
61 list_add(struct list_head *new, struct list_head *head) { in list_add()
69 list_add_tail(struct list_head *entry, struct list_head *head) { in list_add_tail()
91 static inline void list_move(struct list_head *list, struct list_head *head) in list_move()
98 struct list_head *head) in list_move_tail()
111 #define list_for_each(entry, head) \ argument
114 #define list_for_each_prev(entry, head) \ argument
118 #define list_for_each_safe(entry, temp, head) \ argument
123 #define list_for_each_entry(pos, head, member) \ argument
[all …]
/freebsd-11-stable/contrib/ntp/sntp/libevent/
HDht-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-11-stable/sys/dev/drm/
HDdrm_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-11-stable/contrib/elftoolchain/common/
HD_elftc.h80 #define LIST_FOREACH_SAFE(var, head, field, tvar) \ argument
87 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
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
132 #define STAILQ_FOREACH(var, head, field) \ argument
139 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
146 #define STAILQ_INIT(head) do { \ argument
153 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
161 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
[all …]
/freebsd-11-stable/sys/compat/linuxkpi/common/include/linux/
HDlist.h98 list_empty(const struct list_head *head) in list_empty()
105 list_empty_careful(const struct list_head *head) in list_empty_careful()
188 #define list_for_each(p, head) \ argument
191 #define list_for_each_safe(p, n, head) \ argument
211 #define list_for_each_entry_safe_from(pos, n, head, member) \ argument
236 list_add(struct list_head *new, struct list_head *head) in list_add()
243 list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail()
250 list_move(struct list_head *list, struct list_head *head) in list_move()
258 list_move_tail(struct list_head *entry, struct list_head *head) in list_move_tail()
266 list_bulk_move_tail(struct list_head *head, struct list_head *first, in list_bulk_move_tail()
[all …]
HDrculist.h39 #define list_next_rcu(head) (*((struct list_head **)(&(head)->next))) argument
40 #define list_prev_rcu(head) (*((struct list_head **)(&(head)->prev))) argument
42 #define list_for_each_entry_rcu(pos, head, member) \ argument
58 list_add_rcu(struct list_head *new, struct list_head *head) in list_add_rcu()
64 list_add_tail_rcu(struct list_head *new, struct list_head *head) in list_add_tail_rcu()
88 #define hlist_first_rcu(head) (*((struct hlist_node **)(&(head)->first))) argument
102 #define hlist_for_each_entry_rcu(pos, head, member) \ argument
/freebsd-11-stable/sys/dev/hptrr/
HDlist.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-11-stable/sys/dev/hpt27xx/
HDlist.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-11-stable/sys/dev/hptnr/
HDlist.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-11-stable/contrib/libucl/src/
HDtree.h195 #define TREE_INSERT(head, node, field, elm) \ argument
198 #define TREE_FIND(head, node, field, elm) \ argument
201 #define TREE_REMOVE(head, node, field, elm) \ argument
204 #define TREE_DEPTH(head, field) \ argument
207 #define TREE_FORWARD_APPLY(head, node, field, function, data) \ argument
210 #define TREE_REVERSE_APPLY(head, node, field, function, data) \ argument
213 #define TREE_INIT(head, cmp) do { \ argument
/freebsd-11-stable/sys/contrib/vchiq/interface/compat/
HDlist.h67 INIT_LIST_HEAD(struct list_head *head) in INIT_LIST_HEAD()
74 list_first(const struct list_head *head) in list_first()
80 list_last(const struct list_head *head) in list_last()
98 list_empty(const struct list_head *head) in list_empty()
104 list_is_singular(const struct list_head *head) in list_is_singular()
125 list_add(struct list_head *node, struct list_head *head) in list_add()
131 list_add_tail(struct list_head *node, struct list_head *head) in list_add_tail()
158 list_splice(const struct list_head *list, struct list_head *head) in list_splice()
165 list_splice_tail(const struct list_head *list, struct list_head *head) in list_splice_tail()
172 list_move(struct list_head *node, struct list_head *head) in list_move()
[all …]

12345678910>>...21