Home
last modified time | relevance | path

Searched full:head (Results 1 – 25 of 2562) sorted by relevance

12345678910>>...103

/freebsd/sys/dev/sound/midi/
H A Dmidiq.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/sys/sys/
H A Darb.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 …]
H A Dqueue.h44 * added to the list after an existing element or at the head of the list.
45 * Elements being removed from the head of the list should use the explicit
52 * head of the list and the other to the tail of the list. The elements are
55 * to the list after an existing element, at the head of the list, or at the
56 * end of the list. Elements being removed from the head of the tail queue
66 * or after an existing element or at the head of the list. A list
69 * A tail queue is headed by a pair of pointers, one to the head of the
73 * after an existing element, at the head of the list, or at the end of
124 /* Store the last 2 places the queue element or head was altered */
135 #define QMD_TRACE_HEAD(head) do { \ argument
[all …]
/freebsd/contrib/ntp/sntp/libevent/compat/sys/
H A Dqueue.h46 * added to the list after an existing element or at the head of the list.
47 * Elements being removed from the head of the list should use the explicit
57 * or after an existing element or at the head of the list. A list
60 * A simple queue is headed by a pair of pointers, one the head of the
63 * head of the list. New elements can be added to the list before or after
64 * an existing element, at the head of the list, or at the end of the
67 * A tail queue is headed by a pair of pointers, one to the head of the
71 * after an existing element, at the head of the list, or at the end of
74 * A circle queue is headed by a pair of pointers, one to the head of the
78 * an existing element, at the head of the list, or at the end of the list.
[all …]
/freebsd/contrib/libevent/compat/sys/
H A Dqueue.h46 * added to the list after an existing element or at the head of the list.
47 * Elements being removed from the head of the list should use the explicit
57 * or after an existing element or at the head of the list. A list
60 * A simple queue is headed by a pair of pointers, one the head of the
63 * head of the list. New elements can be added to the list before or after
64 * an existing element, at the head of the list, or at the end of the
67 * A tail queue is headed by a pair of pointers, one to the head of the
71 * after an existing element, at the head of the list, or at the end of
74 * A circle queue is headed by a pair of pointers, one to the head of the
78 * an existing element, at the head of the list, or at the end of the list.
[all …]
/freebsd/share/man/man3/
H A Dqueue.3139 .Fn SLIST_EMPTY "SLIST_HEAD *head"
140 .Fn SLIST_EMPTY_ATOMIC "SLIST_HEAD *head"
142 .Fn SLIST_FIRST "SLIST_HEAD *head"
143 .Fn SLIST_FOREACH "TYPE *var" "SLIST_HEAD *head" "SLIST_ENTRY NAME"
144 .Fn SLIST_FOREACH_FROM "TYPE *var" "SLIST_HEAD *head" "SLIST_ENTRY NAME"
145 .Fn SLIST_FOREACH_FROM_SAFE "TYPE *var" "SLIST_HEAD *head" "SLIST_ENTRY NAME" "TYPE *temp_var"
146 .Fn SLIST_FOREACH_SAFE "TYPE *var" "SLIST_HEAD *head" "SLIST_ENTRY NAME" "TYPE *temp_var"
148 .Fn SLIST_HEAD_INITIALIZER "SLIST_HEAD head"
149 .Fn SLIST_INIT "SLIST_HEAD *head"
151 .Fn SLIST_INSERT_HEAD "SLIST_HEAD *head" "TYPE *elm" "SLIST_ENTRY NAME"
[all …]
/freebsd/crypto/krb5/src/include/
H A Dk5-queue.h52 * head of the list. Elements being removed from the head of the list
62 * or after an existing element or at the head of the list. A list
65 * A simple queue is headed by a pair of pointers, one the head of the
68 * head of the list. New elements can be added to the list after
69 * an existing element, at the head of the list, or at the end of the
72 * A tail queue is headed by a pair of pointers, one to the head of the
76 * after an existing element, at the head of the list, or at the end of
79 * A circle queue is headed by a pair of pointers, one to the head of the
83 * an existing element, at the head of the list, or at the end of the list.
98 #define K5_LIST_HEAD_INITIALIZER(head) \ argument
[all …]
/freebsd/contrib/libucl/uthash/
H A Dutlist.h40 * Either way, the pointer to the head of the list must be initialized to NULL.
83 * namely, we always reassign our tmp variable to the list head if we need
84 * to dereference its prev/next pointers, and save/restore the real head.*/
316 #define LL_PREPEND(head,add) \ argument
317 LL_PREPEND2(head,add,next)
319 #define LL_PREPEND2(head,add,next) \ argument
321 (add)->next = (head); \
322 (head) = (add); \
340 #define LL_APPEND(head,add) \ argument
341 LL_APPEND2(head,add,next)
[all …]
H A Duthash.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/crypto/openssh/openbsd-compat/
H A Dsys-queue.h140 * added to the list after an existing element or at the head of the list.
141 * Elements being removed from the head of the list should use the explicit
151 * or after an existing element or at the head of the list. A list
154 * A simple queue is headed by a pair of pointers, one to the head of the
157 * head of the list. New elements can be added to the list before or after
158 * an existing element, at the head of the list, or at the end of the
161 * A tail queue is headed by a pair of pointers, one to the head of the
165 * after an existing element, at the head of the list, or at the end of
169 * The difference is that the head structure also includes a "cookie" that
191 #define SLIST_HEAD_INITIALIZER(head) \ argument
[all …]
H A 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
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/contrib/ntp/sntp/libevent/
H A Dht-internal.h41 #define HT_EMPTY(head) \ argument
42 ((head)->hth_n_entries == 0)
44 /* How many elements in 'head'? */
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
[all …]
/freebsd/contrib/libevent/
H A Dht-internal.h41 #define HT_EMPTY(head) \ argument
42 ((head)->hth_n_entries == 0)
44 /* How many elements in 'head'? */
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
[all …]
/freebsd/contrib/openbsm/compat/
H A Dqueue.h46 * added to the list after an existing element or at the head of the list.
47 * Elements being removed from the head of the list should use the explicit
54 * head of the list and the other to the tail of the list. The elements are
57 * to the list after an existing element, at the head of the list, or at the
58 * end of the list. Elements being removed from the head of the tail queue
68 * or after an existing element or at the head of the list. A list
71 * A tail queue is headed by a pair of pointers, one to the head of the
75 * after an existing element, at the head of the list, or at the end of
105 /* Store the last 2 places the queue element or head was altered */
116 #define QMD_TRACE_HEAD(head) do { \ argument
[all …]
/freebsd/contrib/libarchive/unzip/
H A Dla_queue.h17 * added to the list after an existing element or at the head of the list.
18 * Elements being removed from the head of the list should use the explicit
25 * head of the list and the other to the tail of the list. The elements are
28 * to the list after an existing element, at the head of the list, or at the
29 * end of the list. Elements being removed from the head of the tail queue
39 * or after an existing element or at the head of the list. A list
42 * A tail queue is headed by a pair of pointers, one to the head of the
46 * after an existing element, at the head of the list, or at the end of
94 /* Store the last 2 places the queue element or head was altered */
105 #define QMD_TRACE_HEAD(head) do { \ argument
[all …]
/freebsd/tools/tools/drm/radeon/mkregtable/
H A Dmkregtable.c79 * @head: list head to add it after
81 * Insert a new entry after the specified head.
84 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
86 __list_add(new, head, head->next); in list_add()
92 * @head: list head to add it before
94 * Insert a new entry before the specified head.
97 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
99 __list_add(new, head->prev, head); in list_add_tail()
165 * list_move - delete from one list and add as another's head
167 * @head: the head that will precede our entry
[all …]
/freebsd/sys/kern/
H A Dsubr_disk.c82 * current head position (bioq->last_offset) in the scan direction, i.e.
93 * bioq_first() return the head of the queue, without removing;
95 * bioq_takefirst() return and remove the head of the queue,
96 * updating the 'current head position' as
99 * When updating the 'current head position', we assume that the result of
101 * represents the head position once the request is complete.
109 * update, but its use tracks the head position in a better way.
110 * Historical behaviour was also to update the head position when
113 * has no method to update the head position; secondly, once
115 * the actual head position, so the final one is our best guess.
[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
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/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
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/crypto/krb5/src/plugins/kdb/db2/libdb2/include/
H A Ddb-queue.h47 * an existing element or at the head of the list. A list may only be
50 * A tail queue is headed by a pair of pointers, one to the head of the
54 * an existing element, at the head of the list, or at the end of the
57 * A circle queue is headed by a pair of pointers, one to the head of the
61 * an existing element, at the head of the list, or at the end of the list.
85 #define LIST_INIT(head) { \ argument
86 (head)->lh_first = NULL; \
97 #define LIST_INSERT_HEAD(head, elm, field) { \ argument
98 if (((elm)->field.le_next = (head)->lh_first) != NULL) \
99 (head)->lh_first->field.le_prev = &(elm)->field.le_next;\
[all …]
/freebsd/sys/contrib/vchiq/interface/compat/
H A Dlist.h67 INIT_LIST_HEAD(struct list_head *head) in INIT_LIST_HEAD() argument
69 head->prev = head; in INIT_LIST_HEAD()
70 head->next = head; in INIT_LIST_HEAD()
74 list_first(const struct list_head *head) in list_first() argument
76 return head->next; in list_first()
80 list_last(const struct list_head *head) in list_last() argument
82 return head->prev; in list_last()
98 list_empty(const struct list_head *head) in list_empty() argument
100 return (head->next == head); in list_empty()
104 list_is_singular(const struct list_head *head) in list_is_singular() argument
[all …]
/freebsd/sys/dev/drm2/
H A Ddrm_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/sys/contrib/ck/include/
H A Dck_queue.h71 * added to the list after an existing element or at the head of the list.
72 * Elements being removed from the head of the list should use the explicit
79 * head of the list and the other to the tail of the list. The elements are
82 * to the list after an existing element, at the head of the list, or at the
83 * end of the list. Elements being removed from the head of the tail queue
93 * or after an existing element or at the head of the list. A list
131 #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
[all …]
/freebsd/crypto/heimdal/base/
H A Dheimqueue.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/crypto/heimdal/lib/asn1/
H A Dasn1_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 …]

12345678910>>...103