Searched refs:head (Results 1 - 25 of 766) sorted by relevance

1234567891011>>

/freebsd-10.0-release/sys/dev/sound/midi/
H A Dmidiq.h40 #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-10.0-release/contrib/ncurses/ncurses/
H A Dfifo_defs.h43 #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-10.0-release/sys/geom/sched/
H A Dsubr_disk.c36 * 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-10.0-release/crypto/heimdal/lib/gssapi/mech/
H A Dmechqueue.h45 #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-10.0-release/sys/dev/drm/
H A Ddrm_linux_list.h46 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-10.0-release/contrib/gcc/
H A Dtree-browser.c117 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...]
H A Dtree-iterator.c70 struct tree_statement_list_node *head, *tail, *cur; local
77 head = STATEMENT_LIST_HEAD (t);
85 if (!head || !tail)
87 gcc_assert (head == tail);
93 head = ggc_alloc (sizeof (*head));
94 head->prev = NULL;
95 head->next = NULL;
96 head->stmt = t;
97 tail = head;
146 struct tree_statement_list_node *head, *tail, *cur; local
[all...]
/freebsd-10.0-release/usr.bin/head/
H A DMakefile4 PROG= head
/freebsd-10.0-release/sys/dev/hpt27xx/
H A Dlist.h54 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-10.0-release/sys/dev/hptnr/
H A Dlist.h53 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-10.0-release/sys/dev/hptrr/
H A Dlist.h56 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-10.0-release/sys/kern/
H A Dsubr_disk.c77 * 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-10.0-release/contrib/sendmail/include/sm/
H A Dtailq.h46 * 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-10.0-release/usr.bin/csup/
H A Dqueue.h52 #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-10.0-release/contrib/openbsm/compat/
H A Dqueue.h47 * 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-10.0-release/sys/netatalk/
H A Dat_rmx.c41 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-10.0-release/crypto/heimdal/base/
H A Dheimqueue.h47 #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-10.0-release/crypto/heimdal/lib/asn1/
H A Dasn1_queue.h47 #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-10.0-release/crypto/openssh/openbsd-compat/
H A Dsys-queue.h131 * 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-10.0-release/sys/dev/drm2/
H A Ddrm_linux_list.h46 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-10.0-release/sys/sys/
H A Dqueue.h45 * 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 */
123 #define QMD_TRACE_HEAD(head) d
[all...]
/freebsd-10.0-release/lib/libc/iconv/
H A Dcitrus_hash.h38 #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) \
/freebsd-10.0-release/sys/dev/cxgb/sys/
H A Dmbufq.h36 struct mbuf *head; member in struct:mbuf_head
46 l->head = l->tail = NULL;
53 return (l->head == NULL);
71 return (l->head ? l->head->m_pkthdr.len : 0);
78 if (l->head == NULL)
79 l->head = m;
91 m = l->head;
94 l->head = l->tail = NULL;
96 l->head
[all...]
/freebsd-10.0-release/sys/dev/xen/netfront/
H A Dmbufq.h36 struct mbuf *head; member in struct:mbuf_head
46 l->head = l->tail = NULL;
53 return (l->head == NULL);
71 return (l->head ? l->head->m_pkthdr.len : 0);
78 if (l->head == NULL)
79 l->head = m;
91 m = l->head;
94 l->head = l->tail = NULL;
96 l->head
[all...]
/freebsd-10.0-release/tools/tools/drm/radeon/mkregtable/
H A Dmkregtable.c82 * @head: list head to add it after
84 * Insert a new entry after the specified head.
87 static inline void list_add(struct list_head *new, struct list_head *head) argument
89 __list_add(new, head, head->next);
95 * @head: list head to add it before
97 * Insert a new entry before the specified head.
100 static inline void list_add_tail(struct list_head *new, struct list_head *head) argument
172 list_move(struct list_head *list, struct list_head *head) argument
183 list_move_tail(struct list_head *list, struct list_head *head) argument
195 list_is_last(const struct list_head *list, const struct list_head *head) argument
205 list_empty(const struct list_head *head) argument
223 list_empty_careful(const struct list_head *head) argument
233 list_is_singular(const struct list_head *head) argument
238 __list_cut_position(struct list_head *list, struct list_head *head, struct list_head *entry) argument
265 list_cut_position(struct list_head *list, struct list_head *head, struct list_head *entry) argument
297 list_splice(const struct list_head *list, struct list_head *head) argument
309 list_splice_tail(struct list_head *list, struct list_head *head) argument
323 list_splice_init(struct list_head *list, struct list_head *head) argument
340 list_splice_tail_init(struct list_head *list, struct list_head *head) argument
[all...]

Completed in 198 milliseconds

1234567891011>>