/freebsd-13-stable/sys/dev/sound/midi/ |
H A D | midiq.h | 42 #define MIDIQ_INIT(head, buf, size) do { \ 43 (head).h=(head).t=0; \ 44 (head).s=size; \ 45 (head).b=buf; \ 48 #define MIDIQ_EMPTY(head) ((head).h == (head).t ) 50 #define MIDIQ_LENBASE(head) ((head) [all...] |
/freebsd-13-stable/contrib/ncurses/ncurses/ |
H A D | fifo_defs.h | 44 #define head sp->_fifohead macro 50 (head >= FIFO_SIZE-1) \ 51 ? head = 0 \ 52 : head++; \ 53 if (head == tail) \ 54 head = -1, tail = 0; \ 57 (head <= 0) \ 58 ? head = FIFO_SIZE-1 \ 59 : head--; \ 60 if (head [all...] |
/freebsd-13-stable/crypto/heimdal/lib/gssapi/mech/ |
H A D | mechqueue.h | 45 #define HEIM_SLIST_HEAD_INITIALIZER(head) \ 56 #define HEIM_SLIST_INIT(head) do { \ 57 (head)->slh_first = NULL; \ 65 #define HEIM_SLIST_INSERT_HEAD(head, elm, field) do { \ 66 (elm)->field.sle_next = (head)->slh_first; \ 67 (head)->slh_first = (elm); \ 70 #define HEIM_SLIST_REMOVE_HEAD(head, field) do { \ 71 (head)->slh_first = (head)->slh_first->field.sle_next; \ 74 #define HEIM_SLIST_REMOVE(head, el [all...] |
/freebsd-13-stable/contrib/libevent/ |
H A D | ht-internal.h | 41 #define HT_EMPTY(head) \ 42 ((head)->hth_n_entries == 0) 44 /* How many elements in 'head'? */ 45 #define HT_SIZE(head) \ 46 ((head)->hth_n_entries) 49 #define HT_MEM_USAGE(head) \ 50 (sizeof(*head) + (head)->hth_table_length * sizeof(void*)) 52 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (el [all...] |
/freebsd-13-stable/contrib/ntp/sntp/libevent/ |
H A D | ht-internal.h | 41 #define HT_EMPTY(head) \ 42 ((head)->hth_n_entries == 0) 44 /* How many elements in 'head'? */ 45 #define HT_SIZE(head) \ 46 ((head)->hth_n_entries) 49 #define HT_MEM_USAGE(head) \ 50 (sizeof(*head) + (head)->hth_table_length * sizeof(void*)) 52 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (el [all...] |
/freebsd-13-stable/contrib/bmake/unit-tests/ |
H A D | varmod-head.exp | 0 head (dirname) of 'a/b/c' is 'a/b' 2 head (dirname) of 'def' is '.' 3 head (dirname) of 'a.b.c' is '.' 4 head (dirname) of 'a.b/c' is 'a.b' 5 head (dirname) of 'a' is '.' 6 head (dirname) of 'a.a' is '.' 7 head (dirname) of '.gitignore' is '.' 8 head (dirname) of 'a' is '.' 9 head (dirname) of 'a.a' is '.' 10 head (dirnam [all...] |
/freebsd-13-stable/contrib/libevent/compat/sys/ |
H A D | queue.h | 46 * 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 o [all...] |
/freebsd-13-stable/contrib/ntp/sntp/libevent/compat/sys/ |
H A D | queue.h | 46 * 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 o [all...] |
/freebsd-13-stable/sys/dev/hpt27xx/ |
H A D | list.h | 56 static HPT_INLINE void list_add(struct list_head *_new, struct list_head *head) argument 58 __list_add(_new, head, head->next); 61 static HPT_INLINE void list_add_tail(struct list_head *_new, struct list_head *head) argument 63 __list_add(_new, head->prev, head); 83 static HPT_INLINE int list_empty(struct list_head *head) argument 85 HPT_ASSERT(!(head->next==head && head 89 __list_splice(struct list_head *list, struct list_head *head) argument 103 list_splice(struct list_head *list, struct list_head *head) argument 109 list_splice_init(struct list_head *list, struct list_head *head) argument [all...] |
/freebsd-13-stable/sys/dev/hptnr/ |
H A D | list.h | 55 static HPT_INLINE void list_add(struct list_head *_new, struct list_head *head) argument 57 __list_add(_new, head, head->next); 60 static HPT_INLINE void list_add_tail(struct list_head *_new, struct list_head *head) argument 62 __list_add(_new, head->prev, head); 82 static HPT_INLINE int list_empty(struct list_head *head) argument 84 HPT_ASSERT(!(head->next==head && head 88 __list_splice(struct list_head *list, struct list_head *head) argument 102 list_splice(struct list_head *list, struct list_head *head) argument 108 list_splice_init(struct list_head *list, struct list_head *head) argument [all...] |
/freebsd-13-stable/sys/dev/hptrr/ |
H A D | list.h | 58 static HPT_INLINE void list_add(struct list_head *_new, struct list_head *head) argument 60 __list_add(_new, head, head->next); 63 static HPT_INLINE void list_add_tail(struct list_head *_new, struct list_head *head) argument 65 __list_add(_new, head->prev, head); 85 static HPT_INLINE int list_empty(struct list_head *head) argument 87 HPT_ASSERT(!(head->next==head && head 91 __list_splice(struct list_head *list, struct list_head *head) argument 105 list_splice(struct list_head *list, struct list_head *head) argument 111 list_splice_init(struct list_head *list, struct list_head *head) argument [all...] |
/freebsd-13-stable/contrib/sendmail/include/sm/ |
H A D | tailq.h | 46 * A tail queue is headed by a pair of pointers, one to the head of the 50 * after an existing element, at the head of the list, or at the end of 63 #define SM_TAILQ_HEAD_INITIALIZER(head) \ 64 { NULL, &(head).tqh_first } 75 #define SM_TAILQ_FIRST(head) ((head)->tqh_first) 76 #define SM_TAILQ_END(head) NULL 78 #define SM_TAILQ_LAST(head, headname) \ 79 (*(((struct headname *)((head)->tqh_last))->tqh_last)) 83 #define SM_TAILQ_EMPTY(head) \ [all...] |
/freebsd-13-stable/sys/sys/ |
H A D | arb.h | 61 #define ARB_ALLOCSIZE(head, maxn, x) \ 62 (sizeof(*head) + (maxn) * sizeof(*x)) 68 #define ARB_INIT(x, field, head, maxn) \ 69 (head)->arb_curnodes = 0; \ 70 (head)->arb_maxnodes = (maxn); \ 71 (head)->arb_root_idx = (head)->arb_free_idx = \ 72 (head)->arb_min_idx = (head)->arb_max_idx = ARB_NULLIDX; \ 74 ARB_ARRFOREACH_REVWCOND(x, field, head, \ [all...] |
H A D | queue.h | 47 * added to the list after an existing element or at the head of the list. 48 * Elements being removed from the head of the list should use the explicit 55 * head of the list and the other to the tail of the list. The elements are 58 * to the list after an existing element, at the head of the list, or at the 59 * end of the list. Elements being removed from the head of the tail queue 69 * or after an existing element or at the head of the list. A list 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 126 /* Store the last 2 places the queue element or head was altered */ 137 #define QMD_TRACE_HEAD(head) d [all...] |
/freebsd-13-stable/sys/kern/ |
H A D | subr_disk.c | 84 * current head position (bioq->last_offset) in the scan direction, i.e. 95 * bioq_first() return the head of the queue, without removing; 97 * bioq_takefirst() return and remove the head of the queue, 98 * updating the 'current head position' as 101 * When updating the 'current head position', we assume that the result of 103 * represents the head position once the request is complete. 111 * update, but its use tracks the head position in a better way. 112 * Historical behaviour was also to update the head position when 115 * has no method to update the head position; secondly, once 117 * the actual head positio 154 bioq_init(struct bio_queue_head *head) argument 165 bioq_remove(struct bio_queue_head *head, struct bio *bp) argument 181 bioq_flush(struct bio_queue_head *head, struct devstat *stp, int error) argument 190 bioq_insert_head(struct bio_queue_head *head, struct bio *bp) argument 201 bioq_insert_tail(struct bio_queue_head *head, struct bio *bp) argument 212 bioq_first(struct bio_queue_head *head) argument 219 bioq_takefirst(struct bio_queue_head *head) argument 235 bioq_bio_key(struct bio_queue_head *head, struct bio *bp) argument 249 bioq_disksort(struct bio_queue_head *head, struct bio *bp) argument [all...] |
/freebsd-13-stable/contrib/openbsm/compat/ |
H A D | queue.h | 46 * 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) d [all...] |
/freebsd-13-stable/sys/contrib/ck/include/ |
H A D | ck_hp_fifo.h | 54 struct ck_hp_fifo_entry *head; member in struct:ck_hp_fifo 63 fifo->head = fifo->tail = stub; 72 *stub = fifo->head; 73 fifo->head = fifo->tail = NULL; 142 struct ck_hp_fifo_entry *head, *tail, *next; local 145 head = ck_pr_load_ptr(&fifo->head); 148 ck_hp_set_fence(record, 0, head); 149 if (head != ck_pr_load_ptr(&fifo->head)) 176 struct ck_hp_fifo_entry *head, *tail, *next; local [all...] |
H A D | ck_queue.h | 71 * 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) \ 142 #define CK_SLIST_EMPTY(head) \ 143 (ck_pr_load_ptr(&(head)->cslh_first) == NULL) 145 #define CK_SLIST_FIRST(head) \ [all...] |
/freebsd-13-stable/sys/dev/ath/ |
H A D | if_ath_descdma.h | 35 struct ath_descdma *dd, ath_bufhead *head, const char *name, 38 ath_bufhead *head, const char *name, int ds_size, int nbuf, 41 struct ath_descdma *dd, ath_bufhead *head, const char *name, 44 struct ath_descdma *dd, ath_bufhead *head);
|
/freebsd-13-stable/contrib/netbsd-tests/usr.bin/nbperf/ |
H A D | h_nbperf.sh | 30 head -n $4 $1 | nbperf -m hash.map -o hash.c -a $2 2> /dev/null 32 head -n $4 $1 | ./testprog | $3
|
/freebsd-13-stable/contrib/ntp/include/ |
H A D | ntp_keyacc.h | 14 extern KeyAccT* keyacc_new_push(KeyAccT *head, const sockaddr_u *addr, 16 extern KeyAccT* keyacc_pop_free(KeyAccT *head); 17 extern KeyAccT* keyacc_all_free(KeyAccT *head); 18 extern int keyacc_contains(const KeyAccT *head, const sockaddr_u *addr,
|
/freebsd-13-stable/crypto/heimdal/base/ |
H A D | heimqueue.h | 47 #define HEIM_TAILQ_HEAD_INITIALIZER(head) \ 48 { NULL, &(head).tqh_first } 59 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_HEAD(head, elm, field) \ 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) \ 64 if (*(head)->tqh_last != NULL) \ 65 panic("HEIM_TAILQ_INSERT_TAIL %p %s:%d", (head), __FILE_ [all...] |
/freebsd-13-stable/crypto/heimdal/lib/asn1/ |
H A D | asn1_queue.h | 47 #define ASN1_TAILQ_HEAD_INITIALIZER(head) \ 48 { NULL, &(head).tqh_first } 59 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field) \ 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) \ 64 if (*(head)->tqh_last != NULL) \ 65 panic("ASN1_TAILQ_INSERT_TAIL %p %s:%d", (head), __FILE_ [all...] |
/freebsd-13-stable/contrib/ofed/librdmacm/ |
H A D | indexer.h | 109 static inline void dlist_init(dlist_entry *head) argument 111 head->next = head; 112 head->prev = head; 115 static inline int dlist_empty(dlist_entry *head) argument 117 return head->next == head; 120 static inline void dlist_insert_after(dlist_entry *item, dlist_entry *head) argument 122 item->next = head 128 dlist_insert_before(dlist_entry *item, dlist_entry *head) argument [all...] |
/freebsd-13-stable/crypto/openssh/openbsd-compat/ |
H A D | sys-queue.h | 136 * added to the list after an existing element or at the head of the list. 137 * Elements being removed from the head of the list should use the explicit 147 * or after an existing element or at the head of the list. A list 150 * A simple queue is headed by a pair of pointers, one the head of the 153 * head of the list. New elements can be added to the list before or after 154 * an existing element, at the head of the list, or at the end of the 157 * A tail queue is headed by a pair of pointers, one to the head of the 161 * after an existing element, at the head of the list, or at the end of 164 * A circle queue is headed by a pair of pointers, one to the head of the 168 * an existing element, at the head o [all...] |