/freebsd-9.3-release/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-9.3-release/contrib/ncurses/ncurses/ |
H A D | fifo_defs.h | 43 #define head sp->_fifohead macro 48 #define h_inc() { head == FIFO_SIZE-1 ? head = 0 : head++; if (head == tail) head = -1, tail = 0;} 49 #define h_dec() { head == 0 ? head = FIFO_SIZE-1 : head--; if (head [all...] |
/freebsd-9.3-release/sys/geom/sched/ |
H A D | subr_disk.c | 36 * current head position (bioq->last_offset) in the scan direction, i.e. 47 * bioq_first() return the head of the queue, without removing; 49 * bioq_takefirst() return and remove the head of the queue, 50 * updating the 'current head position' as 53 * When updating the 'current head position', we assume that the result of 55 * represents the head position once the request is complete. 63 * update, but its use tracks the head position in a better way. 64 * Historical behaviour was also to update the head position when 67 * has no method to update the head position; secondly, once 69 * the actual head positio 106 gs_bioq_init(struct bio_queue_head *head) argument 115 gs_bioq_remove(struct bio_queue_head *head, struct bio *bp) argument 128 gs_bioq_flush(struct bio_queue_head *head, struct devstat *stp, int error) argument 137 gs_bioq_insert_head(struct bio_queue_head *head, struct bio *bp) argument 146 gs_bioq_insert_tail(struct bio_queue_head *head, struct bio *bp) argument 155 gs_bioq_first(struct bio_queue_head *head) argument 162 gs_bioq_takefirst(struct bio_queue_head *head) argument 178 gs_bioq_bio_key(struct bio_queue_head *head, struct bio *bp) argument 192 gs_bioq_disksort(struct bio_queue_head *head, struct bio *bp) argument [all...] |
/freebsd-9.3-release/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-9.3-release/sys/dev/drm/ |
H A D | drm_linux_list.h | 46 INIT_LIST_HEAD(struct list_head *head) { argument 47 (head)->next = head; 48 (head)->prev = head; 52 list_empty(struct list_head *head) { argument 53 return (head)->next == head; 57 list_add(struct list_head *new, struct list_head *head) { argument 58 (head) 65 list_add_tail(struct list_head *entry, struct list_head *head) argument [all...] |
/freebsd-9.3-release/contrib/gcc/ |
H A D | tree-browser.c | 117 tree head; local 127 head = N; \ 129 if (head) \ 131 print_generic_expr (TB_OUT_FILE, head, 0); \ 141 TB_update_up (head); 161 TB_update_up (head); 165 if (head && (INTEGRAL_TYPE_P (head) 166 || TREE_CODE (head) == REAL_TYPE)) 167 TB_SET_HEAD (TYPE_MAX_VALUE (head)); [all...] |
/freebsd-9.3-release/usr.bin/head/ |
H A D | Makefile | 4 PROG= head
|
/freebsd-9.3-release/contrib/ntp/include/ |
H A D | ntp_keyacc.h | 13 extern KeyAccT* keyacc_new_push(KeyAccT *head, const sockaddr_u *addr); 14 extern KeyAccT* keyacc_pop_free(KeyAccT *head); 15 extern KeyAccT* keyacc_all_free(KeyAccT *head); 16 extern int keyacc_contains(const KeyAccT *head, const sockaddr_u *addr,
|
/freebsd-9.3-release/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-9.3-release/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-9.3-release/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-9.3-release/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-9.3-release/sys/kern/ |
H A D | subr_disk.c | 77 * current head position (bioq->last_offset) in the scan direction, i.e. 88 * bioq_first() return the head of the queue, without removing; 90 * bioq_takefirst() return and remove the head of the queue, 91 * updating the 'current head position' as 94 * When updating the 'current head position', we assume that the result of 96 * represents the head position once the request is complete. 104 * update, but its use tracks the head position in a better way. 105 * Historical behaviour was also to update the head position when 108 * has no method to update the head position; secondly, once 110 * the actual head positio 147 bioq_init(struct bio_queue_head *head) argument 156 bioq_remove(struct bio_queue_head *head, struct bio *bp) argument 169 bioq_flush(struct bio_queue_head *head, struct devstat *stp, int error) argument 178 bioq_insert_head(struct bio_queue_head *head, struct bio *bp) argument 187 bioq_insert_tail(struct bio_queue_head *head, struct bio *bp) argument 196 bioq_first(struct bio_queue_head *head) argument 203 bioq_takefirst(struct bio_queue_head *head) argument 219 bioq_bio_key(struct bio_queue_head *head, struct bio *bp) argument 233 bioq_disksort(struct bio_queue_head *head, struct bio *bp) argument [all...] |
/freebsd-9.3-release/contrib/nvi/include/sys/ |
H A D | queue.h | 47 * or after an existing element or at the head of the list. A list 50 * A tail queue is headed by a pair of pointers, one to the head of the 54 * after an existing element, at the head of the list, or at the end of 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) { \ 86 (head)->lh_first = NULL; \ 104 #define LIST_INSERT_HEAD(head, elm, field) { \ 105 if (((elm)->field.le_next = (head)->lh_first) != NULL) \ 106 (head) [all...] |
/freebsd-9.3-release/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-9.3-release/usr.bin/csup/ |
H A D | queue.h | 52 #define STAILQ_HEAD_INITIALIZER(head) \ 53 { NULL, &(head).stqh_first } 62 #define STAILQ_EMPTY(head) ((head)->stqh_first == NULL) 65 #define STAILQ_FIRST(head) ((head)->stqh_first) 68 #define STAILQ_FOREACH(var, head, field) \ 69 for((var) = STAILQ_FIRST((head)); \ 74 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \ 75 for ((var) = STAILQ_FIRST((head)); \ [all...] |
/freebsd-9.3-release/contrib/openbsm/compat/ |
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 106 /* Store the last 2 places the queue element or head was altered */ 117 #define QMD_TRACE_HEAD(head) d [all...] |
/freebsd-9.3-release/sys/netatalk/ |
H A D | at_rmx.c | 41 int at_inithead(void **head, int off); 72 at_addroute(void *v_arg, void *n_arg, struct radix_node_head *head, argument 76 return (rn_addroute(v_arg, n_arg, head, treenodes)); 80 at_matroute(void *v_arg, struct radix_node_head *head) argument 83 return (rn_match(v_arg, head)); 87 at_lookup(void *v_arg, void *m_arg, struct radix_node_head *head) argument 90 return (rn_lookup(v_arg, m_arg, head)); 94 at_delroute(void *v_arg, void *netmask_arg, struct radix_node_head *head) argument 97 return (rn_delete(v_arg, netmask_arg, head)); 104 at_inithead(void **head, in argument [all...] |
/freebsd-9.3-release/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-9.3-release/crypto/openssh/openbsd-compat/ |
H A D | sys-queue.h | 131 * added to the list after an existing element or at the head of the list. 132 * Elements being removed from the head of the list should use the explicit 142 * or after an existing element or at the head of the list. A list 145 * A simple queue is headed by a pair of pointers, one the head of the 148 * head of the list. New elements can be added to the list before or after 149 * an existing element, at the head of the list, or at the end of the 152 * A tail queue is headed by a pair of pointers, one to the head of the 156 * after an existing element, at the head of the list, or at the end of 159 * A circle queue is headed by a pair of pointers, one to the head of the 163 * an existing element, at the head o [all...] |
/freebsd-9.3-release/sys/dev/drm2/ |
H A D | drm_linux_list.h | 46 INIT_LIST_HEAD(struct list_head *head) { argument 47 (head)->next = head; 48 (head)->prev = head; 57 list_empty(const struct list_head *head) { argument 58 return (head)->next == head; 62 list_add(struct list_head *new, struct list_head *head) { argument 63 (head) 70 list_add_tail(struct list_head *entry, struct list_head *head) argument 92 list_move(struct list_head *list, struct list_head *head) argument 98 list_move_tail(struct list_head *list, struct list_head *head) argument 171 list_splice(const struct list_head *list, struct list_head *head) argument [all...] |
/freebsd-9.3-release/contrib/libucl/uthash/ |
H A D | utlist.h | 40 * Either way, the pointer to the head of the list must be initialized to NULL. 81 * namely, we always reassign our tmp variable to the list head if we need 82 * to dereference its prev/next pointers, and save/restore the real head.*/ 309 #define LL_PREPEND(head,add) \ 310 LL_PREPEND2(head,add,next) 312 #define LL_PREPEND2(head,add,next) \ 314 (add)->next = head; \ 315 head = add; \ 333 #define LL_APPEND(head,add) \ 334 LL_APPEND2(head,ad [all...] |
H A D | uthash.h | 95 #define HASH_FIND(hh,head,keyptr,keylen,out) \ 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) \ 144 (head)->hh.tbl = (UT_hash_table*)uthash_malloc( \ 146 if (!((head)->hh.tbl)) { uthash_fatal( "out of memory"); } \ 147 memset((head) [all...] |
/freebsd-9.3-release/sys/sys/ |
H A D | queue.h | 45 * added to the list after an existing element or at the head of the list. 46 * Elements being removed from the head of the list should use the explicit 53 * head of the list and the other to the tail of the list. The elements are 56 * to the list after an existing element, at the head of the list, or at the 57 * end of the list. Elements being removed from the head of the tail queue 67 * or after an existing element or at the head of the list. A list 70 * A tail queue is headed by a pair of pointers, one to the head of the 74 * after an existing element, at the head of the list, or at the end of 110 /* Store the last 2 places the queue element or head was altered */ 122 #define QMD_TRACE_HEAD(head) d [all...] |
/freebsd-9.3-release/lib/libc/iconv/ |
H A D | citrus_hash.h | 38 #define _CITRUS_HASH_INIT(head, hashsize) \ 43 LIST_INIT(&(head)->chh_table[_ch_loop]); \ 46 #define _CITRUS_HASH_INSERT(head, elm, field, hashval) \ 47 LIST_INSERT_HEAD(&(head)->chh_table[hashval], elm, field) 48 #define _CITRUS_HASH_SEARCH(head, elm, field, matchfunc, key, hashval) \ 50 LIST_FOREACH((elm), &(head)->chh_table[hashval], field) \
|