/freebsd-current/sys/dev/sound/midi/ |
H A D | midiq.h | 40 #define MIDIQ_INIT(head, buf, size) do { \ 41 (head).h=(head).t=0; \ 42 (head).s=size; \ 43 (head).b=buf; \ 46 #define MIDIQ_EMPTY(head) ((head).h == (head).t ) 48 #define MIDIQ_LENBASE(head) ((head) [all...] |
/freebsd-current/sys/compat/linuxkpi/common/include/linux/ |
H A D | circ_buf.h | 30 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size) - 1)) 31 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head) + 1),(size))
|
/freebsd-current/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-current/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-current/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-current/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-current/crypto/openssh/openbsd-compat/ |
H A D | sys-queue.h | 140 * 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) \ [all...] |
/freebsd-current/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-current/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-current/sys/dev/hpt27xx/ |
H A D | list.h | 54 static HPT_INLINE void list_add(struct list_head *_new, struct list_head *head) argument 56 __list_add(_new, head, head->next); 59 static HPT_INLINE void list_add_tail(struct list_head *_new, struct list_head *head) argument 61 __list_add(_new, head->prev, head); 81 static HPT_INLINE int list_empty(struct list_head *head) argument 83 HPT_ASSERT(!(head->next==head && head 87 __list_splice(struct list_head *list, struct list_head *head) argument 101 list_splice(struct list_head *list, struct list_head *head) argument 107 list_splice_init(struct list_head *list, struct list_head *head) argument [all...] |
/freebsd-current/sys/dev/hptnr/ |
H A D | list.h | 53 static HPT_INLINE void list_add(struct list_head *_new, struct list_head *head) argument 55 __list_add(_new, head, head->next); 58 static HPT_INLINE void list_add_tail(struct list_head *_new, struct list_head *head) argument 60 __list_add(_new, head->prev, head); 80 static HPT_INLINE int list_empty(struct list_head *head) argument 82 HPT_ASSERT(!(head->next==head && head 86 __list_splice(struct list_head *list, struct list_head *head) argument 100 list_splice(struct list_head *list, struct list_head *head) argument 106 list_splice_init(struct list_head *list, struct list_head *head) argument [all...] |
/freebsd-current/sys/dev/hptrr/ |
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-current/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-current/sys/sys/ |
H A D | arb.h | 59 #define ARB_ALLOCSIZE(head, maxn, x) \ 60 (sizeof(*head) + (maxn) * sizeof(*x)) 66 #define ARB_INIT(x, field, head, maxn) \ 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, \ [all...] |
H A D | queue.h | 44 * 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) d [all...] |
/freebsd-current/contrib/libdiff/include/ |
H A D | arraylist.h | 30 * // list.head may change due to realloc: 37 * printf("%s", foo_to_str(list.head[i])); 42 MEMBER_TYPE *head; \ 50 (ARRAY_LIST).head = NULL; \ 61 if ((ARRAY_LIST).head == NULL \ 63 (ARRAY_LIST).p = recallocarray((ARRAY_LIST).head, \ 70 sizeof(*(ARRAY_LIST).head)); \ 80 (ARRAY_LIST).head = (ARRAY_LIST).p; \ 83 if ((ARRAY_LIST).head == NULL \ 88 (NEW_ITEM_P) = &(ARRAY_LIST).head[(ARRAY_LIS [all...] |
/freebsd-current/sys/kern/ |
H A D | subr_disk.c | 82 * 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 positio 152 bioq_init(struct bio_queue_head *head) argument 163 bioq_remove(struct bio_queue_head *head, struct bio *bp) argument 179 bioq_flush(struct bio_queue_head *head, struct devstat *stp, int error) argument 188 bioq_insert_head(struct bio_queue_head *head, struct bio *bp) argument 199 bioq_insert_tail(struct bio_queue_head *head, struct bio *bp) argument 210 bioq_first(struct bio_queue_head *head) argument 217 bioq_takefirst(struct bio_queue_head *head) argument 233 bioq_bio_key(struct bio_queue_head *head, struct bio *bp) argument 247 bioq_disksort(struct bio_queue_head *head, struct bio *bp) argument [all...] |
/freebsd-current/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-current/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...] |
/freebsd-current/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-current/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-current/sys/dev/ath/ |
H A D | if_ath_descdma.h | 33 struct ath_descdma *dd, ath_bufhead *head, const char *name, 36 ath_bufhead *head, const char *name, int ds_size, int nbuf, 39 struct ath_descdma *dd, ath_bufhead *head, const char *name, 42 struct ath_descdma *dd, ath_bufhead *head);
|
/freebsd-current/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-current/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-current/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...] |