Home
last modified time | relevance | path

Searched refs:parent (Results 1 – 25 of 4588) sorted by relevance

12345678910>>...184

/netbsd-src/external/bsd/mdocml/dist/
H A Deqn.c508 eqn_box_alloc(struct eqn_node *ep, struct eqn_box *parent) in eqn_box_alloc() argument
513 bp->parent = parent; in eqn_box_alloc()
514 bp->parent->args++; in eqn_box_alloc()
515 bp->font = bp->parent->font; in eqn_box_alloc()
518 if (NULL != parent->first) { in eqn_box_alloc()
519 parent->last->next = bp; in eqn_box_alloc()
520 bp->prev = parent->last; in eqn_box_alloc()
522 parent->first = bp; in eqn_box_alloc()
524 parent->last = bp; in eqn_box_alloc()
535 eqn_box_makebinary(struct eqn_node *ep, struct eqn_box *parent) in eqn_box_makebinary() argument
[all …]
/netbsd-src/external/bsd/ipf/dist/
H A Dipf_rb.h18 struct _t *parent; \
42 _t *parent, *tmp1, *tmp2; \
44 parent = node->_f.parent; \
49 tmp2->_f.parent = node; \
50 if (parent == & _n##_rb_zero) \
52 else if (parent->_f.right == node) \
53 parent->_f.right = tmp1; \
55 parent->_f.left = tmp1; \
57 tmp1->_f.parent = parent; \
58 node->_f.parent = tmp1; \
[all …]
H A Dradix_ipf.c129 nodes[0].parent = &nodes[1];
216 prev = node->parent;
219 for (node = prev; node->root == 0; node = node->parent) {
407 cur->parent = &nodes[1];
408 nodes[1].parent = prev;
426 for (cur = nodes[1].parent; cur->root == 0; cur = cur->parent) {
553 nodes[0].parent = prev;
555 x->parent = &nodes[0];
558 prev = x->parent;
559 nodes[0].parent = prev;
[all …]
/netbsd-src/external/bsd/nsd/dist/
H A Drbtree.c69 right->left->parent = node; in rbtree_rotate_left()
71 right->parent = node->parent; in rbtree_rotate_left()
73 if (node->parent != RBTREE_NULL) { in rbtree_rotate_left()
74 if (node == node->parent->left) { in rbtree_rotate_left()
75 node->parent->left = right; in rbtree_rotate_left()
77 node->parent->right = right; in rbtree_rotate_left()
83 node->parent = right; in rbtree_rotate_left()
96 left->right->parent = node; in rbtree_rotate_right()
98 left->parent = node->parent; in rbtree_rotate_right()
100 if (node->parent != RBTREE_NULL) { in rbtree_rotate_right()
[all …]
/netbsd-src/external/bsd/unbound/dist/util/
H A Drbtree.c113 right->left->parent = node; in rbtree_rotate_left()
115 right->parent = node->parent; in rbtree_rotate_left()
117 if (node->parent != RBTREE_NULL) { in rbtree_rotate_left()
118 if (node == node->parent->left) { in rbtree_rotate_left()
119 node->parent->left = right; in rbtree_rotate_left()
121 node->parent->right = right; in rbtree_rotate_left()
127 node->parent = right; in rbtree_rotate_left()
140 left->right->parent = node; in rbtree_rotate_right()
142 left->parent = node->parent; in rbtree_rotate_right()
144 if (node->parent != RBTREE_NULL) { in rbtree_rotate_right()
[all …]
/netbsd-src/sys/external/bsd/ipf/netinet/
H A Dipf_rb.h75 struct _t *parent; \
103 _t *parent, *tmp1, *tmp2; \
105 parent = node->_f.parent; \
110 tmp2->_f.parent = node; \
111 if (parent == & _n##_rb_zero) \
113 else if (parent->_f.right == node) \
114 parent->_f.right = tmp1; \
116 parent->_f.left = tmp1; \
118 tmp1->_f.parent = parent; \
119 node->_f.parent = tmp1; \
[all …]
H A Dradix_ipf.c123 nodes[0].parent = &nodes[1]; in buildnodes()
206 prev = node->parent; in ipf_rx_match()
209 for (node = prev; node->root == 0; node = node->parent) { in ipf_rx_match()
390 cur->parent = &nodes[1]; in ipf_rx_insert()
391 nodes[1].parent = prev; in ipf_rx_insert()
409 for (cur = nodes[1].parent; cur->root == 0; cur = cur->parent) { in ipf_rx_insert()
534 nodes[0].parent = prev; in ipf_rx_addroute()
536 x->parent = &nodes[0]; in ipf_rx_addroute()
539 prev = x->parent; in ipf_rx_addroute()
540 nodes[0].parent = prev; in ipf_rx_addroute()
[all …]
/netbsd-src/external/mit/libuv/dist/src/
H A Dheap-inl.h30 struct heap_node* parent; member
73 struct heap_node* parent, in heap_node_swap() argument
78 t = *parent; in heap_node_swap()
79 *parent = *child; in heap_node_swap()
82 parent->parent = child; in heap_node_swap()
84 child->left = parent; in heap_node_swap()
87 child->right = parent; in heap_node_swap()
91 sibling->parent = child; in heap_node_swap()
93 if (parent->left != NULL) in heap_node_swap()
94 parent->left->parent = parent; in heap_node_swap()
[all …]
/netbsd-src/external/gpl3/binutils/dist/gprof/
H A Dcg_arcs.c60 arc_lookup (Sym *parent, Sym *child) in arc_lookup() argument
64 if (!parent || !child) in arc_lookup()
70 parent->name, child->name)); in arc_lookup()
71 for (arc = parent->cg.children; arc; arc = arc->next_child) in arc_lookup()
74 arc->parent->name, arc->child->name)); in arc_lookup()
89 arc_add (Sym *parent, Sym *child, unsigned long count) in arc_add() argument
95 count, parent->name, child->name)); in arc_add()
96 arc = arc_lookup (parent, child); in arc_add()
109 arc->parent = parent; in arc_add()
115 if (parent != child) in arc_add()
[all …]
H A Dcg_print.c227 Sym *left_parent = left->parent; in cmp_arc()
229 Sym *right_parent = right->parent; in cmp_arc()
346 Sym *parent; in print_parents() local
368 parent = arc->parent; in print_parents()
369 if (child == parent || (child->cg.cyc.num != 0 in print_parents()
370 && parent->cg.cyc.num == child->cg.cyc.num)) in print_parents()
378 print_name (parent); in print_parents()
390 print_name (parent); in print_parents()
398 sort_children (Sym *parent) in sort_children() argument
410 for (arc = parent->cg.children; arc; arc = detached) in sort_children()
[all …]
/netbsd-src/external/gpl3/binutils.old/dist/gprof/
H A Dcg_arcs.c59 arc_lookup (Sym *parent, Sym *child) in arc_lookup() argument
63 if (!parent || !child) in arc_lookup()
69 parent->name, child->name)); in arc_lookup()
70 for (arc = parent->cg.children; arc; arc = arc->next_child) in arc_lookup()
73 arc->parent->name, arc->child->name)); in arc_lookup()
88 arc_add (Sym *parent, Sym *child, unsigned long count) in arc_add() argument
94 count, parent->name, child->name)); in arc_add()
95 arc = arc_lookup (parent, child); in arc_add()
108 arc->parent = parent; in arc_add()
114 if (parent != child) in arc_add()
[all …]
H A Dcg_print.c227 Sym *left_parent = left->parent; in cmp_arc()
229 Sym *right_parent = right->parent; in cmp_arc()
346 Sym *parent; in print_parents() local
368 parent = arc->parent; in print_parents()
369 if (child == parent || (child->cg.cyc.num != 0 in print_parents()
370 && parent->cg.cyc.num == child->cg.cyc.num)) in print_parents()
378 print_name (parent); in print_parents()
390 print_name (parent); in print_parents()
398 sort_children (Sym *parent) in sort_children() argument
410 for (arc = parent->cg.children; arc; arc = detached) in sort_children()
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/gcc/brig/brigfrontend/
H A Dbrig-code-entry-handler.h38 brig_code_entry_handler (brig_to_generic &parent);
169 brig_inst_mod_handler (brig_to_generic &parent) in brig_inst_mod_handler() argument
170 : brig_code_entry_handler (parent) in brig_inst_mod_handler()
184 brig_directive_function_handler (brig_to_generic &parent) in brig_directive_function_handler() argument
185 : brig_code_entry_handler (parent) in brig_directive_function_handler()
194 brig_directive_control_handler (brig_to_generic &parent) in brig_directive_control_handler() argument
195 : brig_code_entry_handler (parent) in brig_directive_control_handler()
205 brig_directive_variable_handler (brig_to_generic &parent) in brig_directive_variable_handler() argument
206 : brig_code_entry_handler (parent) in brig_directive_variable_handler()
221 brig_directive_fbarrier_handler (brig_to_generic &parent) in brig_directive_fbarrier_handler() argument
[all …]
/netbsd-src/usr.sbin/acpitools/aml/
H A Daml_name.c77 aml_find_name(struct aml_name *parent, const u_int8_t *name) in aml_find_name() argument
81 if (!parent) in aml_find_name()
82 parent = &rootname; in aml_find_name()
83 for (result = parent->child; result; result = result->brother) in aml_find_name()
95 aml_find_from_namespace(struct aml_name *parent, const char *name) in aml_find_from_namespace() argument
102 if (!parent) in aml_find_from_namespace()
103 parent = &rootname; in aml_find_from_namespace()
107 parent = &rootname; in aml_find_from_namespace()
112 for (result = parent->child; result; result = result->brother) { in aml_find_from_namespace()
130 _aml_apply_foreach_found_objects(struct aml_name *parent, char *name, in _aml_apply_foreach_found_objects() argument
[all …]
/netbsd-src/external/bsd/libarchive/dist/libarchive/
H A Darchive_rb.c106 struct archive_rb_node *parent = rbt->rbt_root; in __archive_rb_tree_find_node() local
108 while (!RB_SENTINEL_P(parent)) { in __archive_rb_tree_find_node()
109 const signed int diff = (*compare_key)(parent, key); in __archive_rb_tree_find_node()
111 return parent; in __archive_rb_tree_find_node()
112 parent = parent->rb_nodes[diff > 0]; in __archive_rb_tree_find_node()
122 struct archive_rb_node *parent = rbt->rbt_root; in __archive_rb_tree_find_node_geq() local
125 while (!RB_SENTINEL_P(parent)) { in __archive_rb_tree_find_node_geq()
126 const signed int diff = (*compare_key)(parent, key); in __archive_rb_tree_find_node_geq()
128 return parent; in __archive_rb_tree_find_node_geq()
130 last = parent; in __archive_rb_tree_find_node_geq()
[all …]
/netbsd-src/external/mpl/dhcp/bind/dist/lib/isc/
H A Dradix.c298 isc_radix_node_t *node, *new_node, *parent, *glue = NULL; in isc_radix_insert() local
331 node->parent = NULL; in isc_radix_insert()
417 parent = node->parent; in isc_radix_insert()
418 while (parent != NULL && parent->bit >= differ_bit) { in isc_radix_insert()
419 node = parent; in isc_radix_insert()
420 parent = node->parent; in isc_radix_insert()
511 new_node->parent = NULL; in isc_radix_insert()
544 new_node->parent = node; in isc_radix_insert()
567 new_node->parent = node->parent; in isc_radix_insert()
568 if (node->parent == NULL) { in isc_radix_insert()
[all …]
/netbsd-src/external/mpl/bind/dist/lib/isc/
H A Dradix.c292 isc_radix_node_t *node, *new_node, *parent, *glue = NULL; in isc_radix_search()
325 node->parent = NULL; in isc_radix_insert()
411 parent = node->parent; in isc_radix_insert()
412 while (parent != NULL && parent->bit >= differ_bit) { in isc_radix_insert()
413 node = parent; in isc_radix_insert()
414 parent = node->parent; in isc_radix_insert()
505 new_node->parent in isc_radix_insert()
298 isc_radix_node_t *node, *new_node, *parent, *glue = NULL; isc_radix_insert() local
615 isc_radix_node_t *parent, *child; isc_radix_remove() local
[all...]
/netbsd-src/common/lib/libc/gen/
H A Dptree.c212 pt_node_t *parent; in ptree_find_branch() local
214 for (parent = &pt->pt_rootnode;;) { in ptree_find_branch()
216 &PTN_BRANCH_SLOT(parent, ptree_testnode(pt, branch, parent)); in ptree_find_branch()
221 parent = PT_NODE(*nodep); in ptree_find_branch()
637 pt_node_t *ptn, *parent; in ptree_find_filtered_node() local
645 parent = &pt->pt_rootnode; in ptree_find_filtered_node()
648 const uintptr_t node = PTN_BRANCH_SLOT(parent, parent_slot); in ptree_find_filtered_node()
678 parent = ptn; in ptree_find_filtered_node()
679 parent_slot = ptree_testkey(pt, key, parent); in ptree_find_filtered_node()
680 bitoff += PTN_BRANCH_BITLEN(parent); in ptree_find_filtered_node()
[all …]
/netbsd-src/external/bsd/libevent/dist/WIN32-Code/
H A Dtree.h321 #define RB_SET(elm, parent, field) do { \ argument
322 RB_PARENT(elm, field) = parent; \
394 struct type *parent, *gparent, *tmp; \
395 while ((parent = RB_PARENT(elm, field)) && \
396 RB_COLOR(parent, field) == RB_RED) { \
397 gparent = RB_PARENT(parent, field); \
398 if (parent == RB_LEFT(gparent, field)) { \
402 RB_SET_BLACKRED(parent, gparent, field);\
406 if (RB_RIGHT(parent, field) == elm) { \
407 RB_ROTATE_LEFT(head, parent, tmp, field);\
[all …]
/netbsd-src/external/bsd/ntp/dist/sntp/libevent/WIN32-Code/
H A Dtree.h322 #define RB_SET(elm, parent, field) do { \ argument
323 RB_PARENT(elm, field) = parent; \
395 struct type *parent, *gparent, *tmp; \
396 while ((parent = RB_PARENT(elm, field)) && \
397 RB_COLOR(parent, field) == RB_RED) { \
398 gparent = RB_PARENT(parent, field); \
399 if (parent == RB_LEFT(gparent, field)) { \
403 RB_SET_BLACKRED(parent, gparent, field);\
407 if (RB_RIGHT(parent, field) == elm) { \
408 RB_ROTATE_LEFT(head, parent, tmp, field);\
[all …]
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dsplay-tree-utils.tcc314 new_root = parent::template splay_limit<1 - N> (new_root); in splay_neighbor()
393 m_root = parent::remove_node_internal (node); in remove_root()
446 m_root = parent::template splay_limit<0> (m_root); in splay_min_node()
458 m_root = parent::template splay_limit<1> (m_root); in splay_max_node()
523 node_type parent = node_type (); in lookup() local
544 promote_child (parent, 0, node); in lookup()
558 link_right (parent); in lookup()
567 promote_child (parent, 1, node); in lookup()
581 link_left (parent); in lookup()
590 parent = node; in lookup()
[all …]
/netbsd-src/sys/external/gpl2/dts/dist/arch/arm/boot/dts/
H A Darm-realview-pba8.dts45 interrupt-parent = <&intc>;
62 interrupt-parent = <&intc>;
67 interrupt-parent = <&intc>;
80 interrupt-parent = <&intc>;
85 interrupt-parent = <&intc>;
90 interrupt-parent = <&intc>;
95 interrupt-parent = <&intc>;
100 interrupt-parent = <&intc>;
105 interrupt-parent = <&intc>;
110 interrupt-parent = <&intc>;
[all …]
/netbsd-src/external/bsd/ipf/dist/sys/
H A Dtree.h330 #define RB_SET(elm, parent, field) do { \ argument
331 RB_PARENT(elm, field) = parent; \
413 struct type *parent, *gparent, *tmp; \
414 while ((parent = RB_PARENT(elm, field)) != NULL && \
415 RB_COLOR(parent, field) == RB_RED) { \
416 gparent = RB_PARENT(parent, field); \
417 if (parent == RB_LEFT(gparent, field)) { \
421 RB_SET_BLACKRED(parent, gparent, field);\
425 if (RB_RIGHT(parent, field) == elm) { \
426 RB_ROTATE_LEFT(head, parent, tmp, field);\
[all …]
/netbsd-src/external/mit/libuv/dist/include/uv/
H A Dtree.h327 #define RB_SET(elm, parent, field) do { \ argument
328 RB_PARENT(elm, field) = parent; \
410 struct type *parent, *gparent, *tmp; \
411 while ((parent = RB_PARENT(elm, field)) != NULL && \
412 RB_COLOR(parent, field) == RB_RED) { \
413 gparent = RB_PARENT(parent, field); \
414 if (parent == RB_LEFT(gparent, field)) { \
418 RB_SET_BLACKRED(parent, gparent, field); \
422 if (RB_RIGHT(parent, field) == elm) { \
423 RB_ROTATE_LEFT(head, parent, tmp, field); \
[all …]
/netbsd-src/sys/sys/
H A Dtree.h321 #define RB_SET(elm, parent, field) do { \ argument
322 RB_PARENT(elm, field) = parent; \
404 struct type *parent, *gparent, *tmp; \
405 while ((parent = RB_PARENT(elm, field)) != NULL && \
406 RB_COLOR(parent, field) == RB_RED) { \
407 gparent = RB_PARENT(parent, field); \
408 if (parent == RB_LEFT(gparent, field)) { \
412 RB_SET_BLACKRED(parent, gparent, field);\
416 if (RB_RIGHT(parent, field) == elm) { \
417 RB_ROTATE_LEFT(head, parent, tmp, field);\
[all …]

12345678910>>...184