/dragonfly/sys/dev/sound/midi/ |
H A D | midiq.h | 46 #define MIDIQ_EMPTY(head) ((head).h == (head).t ) argument 48 #define MIDIQ_LENBASE(head) ((head).h - (head).t < 0 ? \ argument 53 #define MIDIQ_AVAIL(head) (MIDIQ_FULL(head) ? 0 : (head).s - MIDIQ_LENBASE(head)) argument 54 #define MIDIQ_LEN(head) ((head).s - MIDIQ_AVAIL(head)) argument 66 …MIDIQ_MOVE(&(head).b[(head).h], (buf), sizeof(*(head).b) * MIN((size), (head).s - (head).h)); … 70 …MIDIQ_MOVE((head).b, (buf) + (head).s - (head).h, sizeof(*(head).b) * ((size) - (head).s + (head).… 80 if(MIDIQ_FULL(head)) (head).h=(head).t; \ 87 …if (move) MIDIQ_MOVE((buf) + (head).s - (head).t, (head).b, sizeof(*(head).b) * ((size) - (head).s… 100 #define MIDIQ_CLEAR(head) ((head).h = (head).t = 0) argument 101 #define MIDIQ_BUF(head) ((head).b) argument [all …]
|
/dragonfly/contrib/gcc-4.7/gcc/ |
H A D | tree-browser.c | 256 if (head && TYPE_P (head)) 263 if (head && TYPE_P (head)) 324 if (head && DECL_P (head)) 331 if (head && DECL_P (head)) 338 if (head && DECL_P (head)) 345 if (head && DECL_P (head)) 354 if (head && DECL_P (head)) 363 if (head && DECL_P (head)) 387 if (head && DECL_P (head)) 427 if (head && EXPR_P (head) && TREE_OPERAND (head, 0)) [all …]
|
H A D | tree-iterator.c | 132 head->stmt = t; in tsi_link_before() 133 tail = head; in tsi_link_before() 144 if (head->prev) in tsi_link_before() 145 head->prev->next = head; in tsi_link_before() 154 if (head->prev) in tsi_link_before() 155 head->prev->next = head; in tsi_link_before() 167 i->ptr = head; in tsi_link_before() 208 head->stmt = t; in tsi_link_after() 209 tail = head; in tsi_link_after() 224 head->prev = cur; in tsi_link_after() [all …]
|
/dragonfly/lib/libssh/openbsd-compat/ |
H A D | sys-queue.h | 204 #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head)) argument 221 SLIST_FIRST(head) = SLIST_END(head); \ 278 #define LIST_EMPTY(head) (LIST_FIRST(head) == LIST_END(head)) argument 295 LIST_FIRST(head) = LIST_END(head); \ 361 #define SIMPLEQ_EMPTY(head) (SIMPLEQ_FIRST(head) == SIMPLEQ_END(head)) argument 439 #define XSIMPLEQ_FIRST(head) XSIMPLEQ_XOR(head, ((head)->sqx_first)) argument 441 #define XSIMPLEQ_EMPTY(head) (XSIMPLEQ_FIRST(head) == XSIMPLEQ_END(head)) argument 461 (head)->sqx_last = XSIMPLEQ_XOR(head, &(head)->sqx_first); \ 473 *(XSIMPLEQ_XOR(head, (head)->sqx_last)) = XSIMPLEQ_XOR(head, (elm)); \ 487 (head)->sqx_last = XSIMPLEQ_XOR(head, &(head)->sqx_first); \ [all …]
|
H A D | sys-tree.h | 84 #define SPLAY_ROOT(head) (head)->sph_root argument 85 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument 103 (head)->sph_root = SPLAY_LEFT((head)->sph_root, field); \ 109 (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field); \ 131 if (SPLAY_EMPTY(head)) \ 197 (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field);\ 200 (head)->sph_root = SPLAY_LEFT((head)->sph_root, field);\ 324 #define RB_ROOT(head) (head)->rbh_root argument 325 #define RB_EMPTY(head) (RB_ROOT(head) == NULL) argument 486 elm = RB_ROOT(head); \ [all …]
|
/dragonfly/sys/sys/ |
H A D | queue.h | 121 (head)->trace.prevline = (head)->trace.lastline; \ 122 (head)->trace.prevfile = (head)->trace.lastfile; \ 163 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument 165 #define SLIST_FIRST(head) ((head)->slh_first) argument 267 #define STAILQ_FIRST(head) ((head)->stqh_first) argument 291 (head)->stqh_last = &STAILQ_FIRST((head)); \ 336 (head)->stqh_last = &STAILQ_FIRST((head)); \ 407 #define LIST_FIRST(head) ((head)->lh_first) argument 517 (head), *(head)->tqh_last); \ 552 #define TAILQ_FIRST(head) ((head)->tqh_first) argument [all …]
|
H A D | tree.h | 85 #define SPLAY_ROOT(head) (head)->sph_root argument 86 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument 104 (head)->sph_root = SPLAY_LEFT((head)->sph_root, field); \ 110 (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field); \ 132 if (SPLAY_EMPTY(head)) \ 198 (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field);\ 201 (head)->sph_root = SPLAY_LEFT((head)->sph_root, field);\ 345 #define RB_ROOT(head) (head)->rbh_root argument 346 #define RB_INPROG(head) (head)->rbh_inprog argument 347 #define RB_EMPTY(head) (RB_ROOT(head) == NULL) argument [all …]
|
/dragonfly/sys/dev/disk/dm/ |
H A D | dm_table.c | 83 KKASSERT(head->io_cnt != 0); in dm_table_unbusy() 100 return &head->tables[id]; in dm_table_get_entry() 109 dm_table_unbusy(head); in dm_table_release() 120 head->cur_active_table = 1 - head->cur_active_table; in dm_table_switch_tables() 145 tbl = &head->tables[id]; in dm_table_destroy() 191 dm_table_unbusy(head); in _dm_table_size() 228 dm_table_unbusy(head); in dm_table_get_target_count() 240 head->cur_active_table = 0; in dm_table_head_init() 241 head->io_cnt = 0; in dm_table_head_init() 274 dm_table_head_t *head; in dm_table_add_deps() local [all …]
|
/dragonfly/contrib/lvm2/dist/lib/datastruct/ |
H A D | list.c | 26 head->n = head->p = head; in dm_list_init() 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() 41 head->p = elem; in dm_list_add() 50 assert(head->n); in dm_list_add_h() 53 elem->p = head; in dm_list_add_h() 56 head->n = elem; in dm_list_add_h() 84 return head->n == head; in dm_list_empty() 108 return (dm_list_empty(head) ? NULL : head->n); in dm_list_first() [all …]
|
H A D | list.h | 38 void dm_list_init(struct dm_list *head); 103 #define dm_list_struct_base(v, t, head) \ argument 128 #define dm_list_iterate(v, head) \ argument 129 for (v = (head)->n; v != head; v = v->n) 139 for (v = (start)->p; v != head; v = v->p) 147 for (v = (head)->n, t = v->n; v != head; v = t, t = v->n) 156 &v->field != (head); \ 164 #define dm_list_iterate_items(v, head) dm_list_iterate_items_gen(v, (head), list) argument 175 &v->field != (head); \ 194 &v->field != (head); \ [all …]
|
/dragonfly/contrib/lvm2/dist/libdm/datastruct/ |
H A D | list.c | 27 head->n = head->p = head; in dm_list_init() 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() 42 head->p = elem; in dm_list_add() 51 assert(head->n); in dm_list_add_h() 54 elem->p = head; in dm_list_add_h() 57 head->n = elem; in dm_list_add_h() 85 return head->n == head; in dm_list_empty() 109 return (dm_list_empty(head) ? NULL : head->n); in dm_list_first() [all …]
|
H A D | list.h | 38 void dm_list_init(struct dm_list *head); 103 #define dm_list_struct_base(v, t, head) \ argument 128 #define dm_list_iterate(v, head) \ argument 129 for (v = (head)->n; v != head; v = v->n) 139 for (v = (start)->p; v != head; v = v->p) 147 for (v = (head)->n, t = v->n; v != head; v = t, t = v->n) 156 &v->field != (head); \ 164 #define dm_list_iterate_items(v, head) dm_list_iterate_items_gen(v, (head), list) argument 175 &v->field != (head); \ 194 &v->field != (head); \ [all …]
|
/dragonfly/tools/tools/drm/radeon/mkregtable/ |
H A D | mkregtable.c | 86 __list_add(new, head, head->next); in list_add() 99 __list_add(new, head->prev, head); in list_add_tail() 204 return head->next == head; in list_empty() 223 return (next == head) && (next == head->prev); in list_empty_careful() 232 return !list_empty(head) && (head->next == head->prev); in list_is_singular() 268 if (list_is_singular(head) && (head->next != entry && head != entry)) in list_cut_position() 298 __list_splice(list, head, head->next); in list_splice() 310 __list_splice(list, head->prev, head); in list_splice_tail() 324 __list_splice(list, head, head->next); in list_splice_init() 341 __list_splice(list, head->prev, head); in list_splice_tail_init() [all …]
|
/dragonfly/contrib/elftoolchain/common/ |
H A D | _elftc.h | 104 #define STAILQ_EMPTY(head) ((head)->stqh_first == NULL) argument 115 #define STAILQ_FIRST(head) ((head)->stqh_first) argument 128 { NULL, &(head).stqh_first } 147 (head)->stqh_first = NULL; \ 148 (head)->stqh_last = &(head)->stqh_first; \ 178 (STAILQ_EMPTY((head)) ? \ 204 if (((head)->stqh_first = (head)->stqh_first->field.stqe_next) == \ 206 (head)->stqh_last = &(head)->stqh_first; \ 230 _e = STAILQ_FIRST((head)); \ 239 _q = STAILQ_FIRST((head)); \ [all …]
|
/dragonfly/sys/dev/drm/include/linux/ |
H A D | list.h | 74 return (head->next == head); in list_empty() 80 return (head == head->next) && (head == head->prev); in list_empty_careful() 160 for (p = (head)->next; p != (head); p = p->next) 207 _list_add(new, head, head->next); in list_add() 214 _list_add(new, head->prev, head); in list_add_tail() 254 _list_splice(list, head, head->next); in list_splice() 261 _list_splice(list, head->prev, head); in list_splice_tail() 268 _list_splice(list, head, head->next); in list_splice_init() 276 _list_splice(list, head->prev, head); in list_splice_tail_init() 381 return !list_empty(head) && (head->next == head->prev); in list_is_singular() [all …]
|
H A D | kfifo.h | 110 return (head <= tail ? tail - head : nbytes + tail - head); in _kfifo_len() 127 if (head <= tail) { in _kfifo_out_peek() 128 if (size <= tail - head) { in _kfifo_out_peek() 133 if (size <= nbytes - head) { in _kfifo_out_peek() 137 memcpy(dst, src + head, nbytes - head); in _kfifo_out_peek() 162 if (head <= tail) { in _kfifo_out() 163 if (size <= tail - head) { in _kfifo_out() 169 if (size <= nbytes - head) { in _kfifo_out() 174 memcpy(dst, src + head, nbytes - head); in _kfifo_out() 200 if (tail <= head) { in _kfifo_in() [all …]
|
/dragonfly/bin/cpdup/ |
H A D | hcproto.c | 161 if (head->error) { in hc_hello() 232 if (head->error) in hc_stat() 250 if (head->error) in hc_lstat() 420 if (head->error) in hc_opendir() 439 if ((head = hcc_finish_command(trans)) == NULL || head->error) in hc_opendir() 496 if (head->error) in hc_readdir() 687 if ((head = hcc_finish_command(trans)) == NULL || head->error) in hc_open() 708 if (head->error) in hc_open() 815 if (head->error) in hc_close() 1957 if ((head = hcc_finish_command(trans)) == NULL || head->error) in hc_geteuid() [all …]
|
/dragonfly/sys/dev/raid/hpt27xx/ |
H A D | list.h | 56 __list_add(_new, head, head->next); in list_add() 61 __list_add(_new, head->prev, head); in list_add_tail() 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 94 first->prev = head; in __list_splice() 95 head->next = first; in __list_splice() 104 __list_splice(list, head); in list_splice() 110 __list_splice(list, head); in list_splice_init() 119 for (pos = (head)->next; pos != (head); pos = pos->next) [all …]
|
/dragonfly/sys/dev/raid/hptrr/ |
H A D | list.h | 58 __list_add(_new, head, head->next); in list_add() 63 __list_add(_new, head->prev, head); in list_add_tail() 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 96 first->prev = head; in __list_splice() 97 head->next = first; in __list_splice() 106 __list_splice(list, head); in list_splice() 112 __list_splice(list, head); in list_splice_init() 121 for (pos = (head)->next; pos != (head); pos = pos->next) [all …]
|
/dragonfly/contrib/gcc-8.0/libgomp/ |
H A D | priority_queue.h | 149 head->t.root = NULL; in priority_queue_init() 156 head->l.tasks = NULL; in priority_queue_init() 191 if (priority_queue_multi_p (head)) in priority_queue_empty_p() 195 return head->t.root == NULL; in priority_queue_empty_p() 199 return head->l.tasks == NULL; in priority_queue_empty_p() 209 if (head->t.root == NULL) in priority_queue_lookup_priority() 291 struct priority_queue *head, in priority_tree_insert() argument 302 if (head->l.tasks != NULL) in priority_tree_insert() 308 k->key.l.tasks = head->l.tasks; in priority_tree_insert() 311 head->l.tasks = NULL; in priority_tree_insert() [all …]
|
/dragonfly/sys/vfs/hammer2/ |
H A D | hammer2_xops.c | 263 name = xop->head.name1; in hammer2_xop_nresolve() 351 name = xop->head.name1; in hammer2_xop_unlink() 524 ip = xop->head.ip4; in hammer2_xop_nrename() 553 ip = xop->head.ip2; in hammer2_xop_nrename() 619 xop->head.name1, in hammer2_xop_nrename() 620 xop->head.name2); in hammer2_xop_nrename() 658 xop->head.name1_len != xop->head.name2_len || in hammer2_xop_nrename() 659 bcmp(xop->head.name1, xop->head.name2, xop->head.name1_len) != 0) { in hammer2_xop_nrename() 1194 pip = xop->head.ip1; in hammer2_xop_inode_create_det() 1352 ip = xop->head.ip1; in hammer2_xop_inode_destroy() [all …]
|
/dragonfly/usr.sbin/makefs/hammer2/ |
H A D | hammer2_xops.c | 266 name = xop->head.name1; in hammer2_xop_nresolve() 354 name = xop->head.name1; in hammer2_xop_unlink() 527 ip = xop->head.ip4; in hammer2_xop_nrename() 556 ip = xop->head.ip2; in hammer2_xop_nrename() 622 xop->head.name1, in hammer2_xop_nrename() 623 xop->head.name2); in hammer2_xop_nrename() 661 xop->head.name1_len != xop->head.name2_len || in hammer2_xop_nrename() 662 bcmp(xop->head.name1, xop->head.name2, xop->head.name1_len) != 0) { in hammer2_xop_nrename() 1197 pip = xop->head.ip1; in hammer2_xop_inode_create_det() 1355 ip = xop->head.ip1; in hammer2_xop_inode_destroy() [all …]
|
/dragonfly/contrib/binutils-2.34/gprof/ |
H A D | cg_dfn.c | 92 Sym *head = 0; in find_cycle() local 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() 165 if (head->cg.cyc.head != head) in find_cycle() 167 head = head->cg.cyc.head; in find_cycle() 182 child->cg.cyc.head = head; in find_cycle() 186 print_name (head); in find_cycle() 190 tail->cg.cyc.next->cg.cyc.head = head; in find_cycle() [all …]
|
/dragonfly/contrib/binutils-2.27/gprof/ |
H A D | cg_dfn.c | 92 Sym *head = 0; in find_cycle() local 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() 165 if (head->cg.cyc.head != head) in find_cycle() 167 head = head->cg.cyc.head; in find_cycle() 182 child->cg.cyc.head = head; in find_cycle() 186 print_name (head); in find_cycle() 190 tail->cg.cyc.next->cg.cyc.head = head; in find_cycle() [all …]
|
/dragonfly/contrib/gcc-8.0/gcc/ |
H A D | tree-iterator.c | 139 head->stmt = t; in tsi_link_before() 140 tail = head; in tsi_link_before() 152 if (head->prev) in tsi_link_before() 153 head->prev->next = head; in tsi_link_before() 162 if (head->prev) in tsi_link_before() 163 head->prev->next = head; in tsi_link_before() 175 i->ptr = head; in tsi_link_before() 216 head->stmt = t; in tsi_link_after() 217 tail = head; in tsi_link_after() 233 head->prev = cur; in tsi_link_after() [all …]
|