Home
last modified time | relevance | path

Searched refs:head (Results 1 – 25 of 1450) sorted by relevance

12345678910>>...58

/dragonfly/sys/dev/sound/midi/
HDmidiq.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 …]
/dragonfly/contrib/gcc-4.7/gcc/
HDtree-browser.c115 tree head; local
125 head = N; \
127 if (head) \
129 print_generic_expr (TB_OUT_FILE, head, 0); \
139 TB_update_up (head);
159 TB_update_up (head);
163 if (head && (INTEGRAL_TYPE_P (head)
164 || TREE_CODE (head) == REAL_TYPE
165 || TREE_CODE (head) == FIXED_POINT_TYPE))
166 TB_SET_HEAD (TYPE_MAX_VALUE (head));
[all …]
HDtree-iterator.c106 struct tree_statement_list_node *head, *tail, *cur; in tsi_link_before() local
113 head = STATEMENT_LIST_HEAD (t); in tsi_link_before()
121 if (!head || !tail) in tsi_link_before()
123 gcc_assert (head == tail); in tsi_link_before()
129 head = ggc_alloc_tree_statement_list_node (); in tsi_link_before()
130 head->prev = NULL; in tsi_link_before()
131 head->next = NULL; in tsi_link_before()
132 head->stmt = t; in tsi_link_before()
133 tail = head; in tsi_link_before()
143 head->prev = cur->prev; in tsi_link_before()
[all …]
/dragonfly/lib/libssh/openbsd-compat/
HDsys-queue.h191 #define SLIST_HEAD_INITIALIZER(head) \ argument
202 #define SLIST_FIRST(head) ((head)->slh_first) argument
203 #define SLIST_END(head) NULL argument
204 #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head)) argument
207 #define SLIST_FOREACH(var, head, field) \ argument
208 for((var) = SLIST_FIRST(head); \
209 (var) != SLIST_END(head); \
212 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
213 for ((var) = SLIST_FIRST(head); \
220 #define SLIST_INIT(head) { \ argument
[all …]
HDsys-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 …]
/dragonfly/sys/sys/
HDqueue.h120 #define QMD_TRACE_HEAD(head) do { \ argument
121 (head)->trace.prevline = (head)->trace.lastline; \
122 (head)->trace.prevfile = (head)->trace.lastfile; \
123 (head)->trace.lastline = __LINE__; \
124 (head)->trace.lastfile = __FILE__; \
136 #define QMD_TRACE_HEAD(head) argument
150 #define SLIST_HEAD_INITIALIZER(head) \ argument
163 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
165 #define SLIST_FIRST(head) ((head)->slh_first) argument
167 #define SLIST_FOREACH(var, head, field) \ argument
[all …]
HDtree.h85 #define SPLAY_ROOT(head) (head)->sph_root argument
86 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
89 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
90 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
91 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
92 (head)->sph_root = tmp; \
95 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
96 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
97 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
98 (head)->sph_root = tmp; \
[all …]
/dragonfly/sys/dev/disk/dm/
HDdm_table.c59 dm_table_busy(dm_table_head_t *head, uint8_t table_id) in dm_table_busy() argument
65 lockmgr(&head->table_mtx, LK_SHARED); in dm_table_busy()
68 id = head->cur_active_table; in dm_table_busy()
70 id = 1 - head->cur_active_table; in dm_table_busy()
72 atomic_add_int(&head->io_cnt, 1); in dm_table_busy()
81 dm_table_unbusy(dm_table_head_t *head) in dm_table_unbusy() argument
83 KKASSERT(head->io_cnt != 0); in dm_table_unbusy()
85 atomic_subtract_int(&head->io_cnt, 1); in dm_table_unbusy()
87 lockmgr(&head->table_mtx, LK_RELEASE); in dm_table_unbusy()
94 dm_table_get_entry(dm_table_head_t *head, uint8_t table_id) in dm_table_get_entry() argument
[all …]
/dragonfly/contrib/lvm2/dist/libdm/datastruct/
HDlist.c25 void dm_list_init(struct dm_list *head) in dm_list_init() argument
27 head->n = head->p = head; in dm_list_init()
34 void dm_list_add(struct dm_list *head, struct dm_list *elem) in dm_list_add() argument
36 assert(head->n); in dm_list_add()
38 elem->n = head; in dm_list_add()
39 elem->p = head->p; in dm_list_add()
41 head->p->n = elem; in dm_list_add()
42 head->p = elem; in dm_list_add()
49 void dm_list_add_h(struct dm_list *head, struct dm_list *elem) in dm_list_add_h() argument
51 assert(head->n); in dm_list_add_h()
[all …]
HDlist.h38 void dm_list_init(struct dm_list *head);
44 void dm_list_add(struct dm_list *head, struct dm_list *elem);
50 void dm_list_add_h(struct dm_list *head, struct dm_list *elem);
62 void dm_list_move(struct dm_list *head, struct dm_list *elem);
67 int dm_list_empty(const struct dm_list *head);
72 int dm_list_start(const struct dm_list *head, const struct dm_list *elem);
77 int dm_list_end(const struct dm_list *head, const struct dm_list *elem);
82 struct dm_list *dm_list_first(const struct dm_list *head);
87 struct dm_list *dm_list_last(const struct dm_list *head);
92 struct dm_list *dm_list_prev(const struct dm_list *head, const struct dm_list *elem);
[all …]
/dragonfly/contrib/lvm2/dist/lib/datastruct/
HDlist.c24 void dm_list_init(struct dm_list *head) in dm_list_init() argument
26 head->n = head->p = head; in dm_list_init()
33 void dm_list_add(struct dm_list *head, struct dm_list *elem) in dm_list_add() argument
35 assert(head->n); in dm_list_add()
37 elem->n = head; in dm_list_add()
38 elem->p = head->p; in dm_list_add()
40 head->p->n = elem; in dm_list_add()
41 head->p = elem; in dm_list_add()
48 void dm_list_add_h(struct dm_list *head, struct dm_list *elem) in dm_list_add_h() argument
50 assert(head->n); in dm_list_add_h()
[all …]
HDlist.h38 void dm_list_init(struct dm_list *head);
44 void dm_list_add(struct dm_list *head, struct dm_list *elem);
50 void dm_list_add_h(struct dm_list *head, struct dm_list *elem);
62 void dm_list_move(struct dm_list *head, struct dm_list *elem);
67 int dm_list_empty(const struct dm_list *head);
72 int dm_list_start(const struct dm_list *head, const struct dm_list *elem);
77 int dm_list_end(const struct dm_list *head, const struct dm_list *elem);
82 struct dm_list *dm_list_first(const struct dm_list *head);
87 struct dm_list *dm_list_last(const struct dm_list *head);
92 struct dm_list *dm_list_prev(const struct dm_list *head, const struct dm_list *elem);
[all …]
/dragonfly/tools/tools/drm/radeon/mkregtable/
HDmkregtable.c84 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()
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()
169 static inline void list_move(struct list_head *list, struct list_head *head) in list_move() argument
172 list_add(list, head); in list_move()
181 struct list_head *head) in list_move_tail() argument
184 list_add_tail(list, head); in list_move_tail()
193 const struct list_head *head) in list_is_last() argument
195 return list->next == head; in list_is_last()
[all …]
/dragonfly/contrib/elftoolchain/common/
HD_elftc.h80 #define LIST_FOREACH_SAFE(var, head, field, tvar) \ argument
81 for ((var) = LIST_FIRST((head)); \
87 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
88 for ((var) = SLIST_FIRST((head)); \
104 #define STAILQ_EMPTY(head) ((head)->stqh_first == NULL) argument
115 #define STAILQ_FIRST(head) ((head)->stqh_first) argument
127 #define STAILQ_HEAD_INITIALIZER(head) \ argument
128 { NULL, &(head).stqh_first }
132 #define STAILQ_FOREACH(var, head, field) \ argument
133 for ((var) = ((head)->stqh_first); \
[all …]
/dragonfly/sys/dev/drm/include/linux/
HDlist.h60 list_first(const struct list_head *head) in list_first() argument
62 return head->next; in list_first()
66 list_last(const struct list_head *head) in list_last() argument
68 return head->prev; in list_last()
72 list_empty(const struct list_head *head) in list_empty() argument
74 return (head->next == head); in list_empty()
78 list_empty_careful(const struct list_head *head) in list_empty_careful() argument
80 return (head == head->next) && (head == head->prev); in list_empty_careful()
159 #define list_for_each(p, head) \ argument
160 for (p = (head)->next; p != (head); p = p->next)
[all …]
HDkfifo.h106 const size_t head = meta->kfm_head; in _kfifo_len() local
110 return (head <= tail ? tail - head : nbytes + tail - head); in _kfifo_len()
124 const size_t head = meta->kfm_head; in _kfifo_out_peek() local
127 if (head <= tail) { in _kfifo_out_peek()
128 if (size <= tail - head) { in _kfifo_out_peek()
129 memcpy(dst, src + head, size); in _kfifo_out_peek()
133 if (size <= nbytes - head) { in _kfifo_out_peek()
134 memcpy(dst, src + head, size); in _kfifo_out_peek()
136 } else if (size <= nbytes + tail - head) { in _kfifo_out_peek()
137 memcpy(dst, src + head, nbytes - head); in _kfifo_out_peek()
[all …]
/dragonfly/bin/cpdup/
HDhcproto.c138 struct HCHead *head; in hc_hello() local
155 if ((head = hcc_finish_command(trans)) == NULL) { in hc_hello()
161 if (head->error) { in hc_hello()
163 hc->host, head->error); in hc_hello()
168 FOR_EACH_ITEM(item, trans, head) { in hc_hello()
195 rc_hello(hctransaction_t trans, struct HCHead *head) in rc_hello() argument
200 FOR_EACH_ITEM(item, trans, head) { in rc_hello()
222 struct HCHead *head; in hc_stat() local
230 if ((head = hcc_finish_command(trans)) == NULL) in hc_stat()
232 if (head->error) in hc_stat()
[all …]
/dragonfly/sys/dev/raid/hpt27xx/
HDlist.h54 static HPT_INLINE void list_add(struct list_head *_new, struct list_head *head) in list_add() argument
56 __list_add(_new, head, head->next); in list_add()
59 static HPT_INLINE void list_add_tail(struct list_head *_new, struct list_head *head) in list_add_tail() argument
61 __list_add(_new, head->prev, head); in list_add_tail()
81 static HPT_INLINE int list_empty(struct list_head *head) in list_empty() argument
83 HPT_ASSERT(!(head->next==head && head->prev!=head)); in list_empty()
84 return head->next == head; in list_empty()
88 struct list_head *head) in __list_splice() argument
92 struct list_head *at = head->next; in __list_splice()
94 first->prev = head; in __list_splice()
[all …]
/dragonfly/sys/dev/raid/hptrr/
HDlist.h56 static HPT_INLINE void list_add(struct list_head *_new, struct list_head *head) in list_add() argument
58 __list_add(_new, head, head->next); in list_add()
61 static HPT_INLINE void list_add_tail(struct list_head *_new, struct list_head *head) in list_add_tail() argument
63 __list_add(_new, head->prev, head); in list_add_tail()
83 static HPT_INLINE int list_empty(struct list_head *head) in list_empty() argument
85 HPT_ASSERT(!(head->next==head && head->prev!=head)); in list_empty()
86 return head->next == head; in list_empty()
90 struct list_head *head) in __list_splice() argument
94 struct list_head *at = head->next; in __list_splice()
96 first->prev = head; in __list_splice()
[all …]
/dragonfly/contrib/gcc-8.0/libgomp/
HDpriority_queue.h139 priority_queue_multi_p (struct priority_queue *head) in priority_queue_multi_p() argument
141 return __builtin_expect (head->t.root != NULL, 0); in priority_queue_multi_p()
147 priority_queue_init (struct priority_queue *head) in priority_queue_init() argument
149 head->t.root = NULL; in priority_queue_init()
156 head->l.tasks = NULL; in priority_queue_init()
157 head->l.last_parent_depends_on = NULL; in priority_queue_init()
161 priority_queue_free (struct priority_queue *head) in priority_queue_free() argument
183 priority_queue_empty_p (struct priority_queue *head, enum memmodel model) in priority_queue_empty_p() argument
191 if (priority_queue_multi_p (head)) in priority_queue_empty_p()
194 return __atomic_load_n (&head->t.root, MEMMODEL_ACQUIRE) == NULL; in priority_queue_empty_p()
[all …]
/dragonfly/usr.sbin/makefs/hammer2/
HDhammer2_xops.c168 chain = hammer2_inode_chain(xop->head.ip1, clindex, in hammer2_xop_ipcluster()
176 hammer2_xop_feed(&xop->head, chain, clindex, error); in hammer2_xop_ipcluster()
204 parent = hammer2_inode_chain(xop->head.ip1, clindex, in hammer2_xop_readdir()
224 error = hammer2_xop_feed(&xop->head, chain, clindex, 0); in hammer2_xop_readdir()
239 hammer2_xop_feed(&xop->head, NULL, clindex, error); in hammer2_xop_readdir()
257 parent = hammer2_inode_chain(xop->head.ip1, clindex, in hammer2_xop_nresolve()
266 name = xop->head.name1; in hammer2_xop_nresolve()
267 name_len = xop->head.name1_len; in hammer2_xop_nresolve()
306 error = hammer2_xop_feed(&xop->head, chain, clindex, error); in hammer2_xop_nresolve()
346 parent = hammer2_inode_chain(xop->head.ip1, clindex, in hammer2_xop_unlink()
[all …]
/dragonfly/sys/vfs/hammer2/
HDhammer2_xops.c165 chain = hammer2_inode_chain(xop->head.ip1, clindex, in hammer2_xop_ipcluster()
173 hammer2_xop_feed(&xop->head, chain, clindex, error); in hammer2_xop_ipcluster()
201 parent = hammer2_inode_chain(xop->head.ip1, clindex, in hammer2_xop_readdir()
221 error = hammer2_xop_feed(&xop->head, chain, clindex, 0); in hammer2_xop_readdir()
236 hammer2_xop_feed(&xop->head, NULL, clindex, error); in hammer2_xop_readdir()
254 parent = hammer2_inode_chain(xop->head.ip1, clindex, in hammer2_xop_nresolve()
263 name = xop->head.name1; in hammer2_xop_nresolve()
264 name_len = xop->head.name1_len; in hammer2_xop_nresolve()
303 error = hammer2_xop_feed(&xop->head, chain, clindex, error); in hammer2_xop_nresolve()
343 parent = hammer2_inode_chain(xop->head.ip1, clindex, in hammer2_xop_unlink()
[all …]
/dragonfly/contrib/binutils-2.27/gprof/
HDcg_dfn.c92 Sym *head = 0; in find_cycle() local
99 head = dfn_stack[cycle_top].sym; in find_cycle()
100 if (child == head) in find_cycle()
104 if (child->cg.cyc.head != child && child->cg.cyc.head == head) in find_cycle()
119 if (head) in find_cycle()
121 print_name (head); in find_cycle()
152 for (tail = head; tail->cg.cyc.next; tail = tail->cg.cyc.next) in find_cycle()
165 if (head->cg.cyc.head != head) in find_cycle()
167 head = head->cg.cyc.head; in find_cycle()
169 print_name (head); in find_cycle()
[all …]
/dragonfly/contrib/binutils-2.34/gprof/
HDcg_dfn.c92 Sym *head = 0; in find_cycle() local
99 head = dfn_stack[cycle_top].sym; in find_cycle()
100 if (child == head) in find_cycle()
104 if (child->cg.cyc.head != child && child->cg.cyc.head == head) in find_cycle()
119 if (head) in find_cycle()
121 print_name (head); in find_cycle()
152 for (tail = head; tail->cg.cyc.next; tail = tail->cg.cyc.next) in find_cycle()
165 if (head->cg.cyc.head != head) in find_cycle()
167 head = head->cg.cyc.head; in find_cycle()
169 print_name (head); in find_cycle()
[all …]
/dragonfly/contrib/gcc-8.0/gcc/
HDtree-iterator.c113 struct tree_statement_list_node *head, *tail, *cur; in tsi_link_before() local
120 head = STATEMENT_LIST_HEAD (t); in tsi_link_before()
128 if (!head || !tail) in tsi_link_before()
130 gcc_assert (head == tail); in tsi_link_before()
136 head = ggc_alloc<tree_statement_list_node> (); in tsi_link_before()
137 head->prev = NULL; in tsi_link_before()
138 head->next = NULL; in tsi_link_before()
139 head->stmt = t; in tsi_link_before()
140 tail = head; in tsi_link_before()
151 head->prev = cur->prev; in tsi_link_before()
[all …]

12345678910>>...58