Home
last modified time | relevance | path

Searched refs:sibling (Results 1 – 25 of 53) sorted by relevance

123

/NextBSD/contrib/unbound/util/
HDrbtree.c405 rbnode_t* sibling; in rbtree_delete_fixup() local
409 if(child_parent->right == child) sibling = child_parent->left; in rbtree_delete_fixup()
410 else sibling = child_parent->right; in rbtree_delete_fixup()
420 if(sibling->color == RED) in rbtree_delete_fixup()
423 sibling->color = BLACK; in rbtree_delete_fixup()
428 if(child_parent->right == child) sibling = child_parent->left; in rbtree_delete_fixup()
429 else sibling = child_parent->right; in rbtree_delete_fixup()
433 && sibling->color == BLACK in rbtree_delete_fixup()
434 && sibling->left->color == BLACK in rbtree_delete_fixup()
435 && sibling->right->color == BLACK) in rbtree_delete_fixup()
[all …]
/NextBSD/contrib/ldns/
HDrbtree.c415 ldns_rbnode_t* sibling; in ldns_rbtree_delete_fixup() local
419 if(child_parent->right == child) sibling = child_parent->left; in ldns_rbtree_delete_fixup()
420 else sibling = child_parent->right; in ldns_rbtree_delete_fixup()
430 if(sibling->color == RED) in ldns_rbtree_delete_fixup()
433 sibling->color = BLACK; in ldns_rbtree_delete_fixup()
438 if(child_parent->right == child) sibling = child_parent->left; in ldns_rbtree_delete_fixup()
439 else sibling = child_parent->right; in ldns_rbtree_delete_fixup()
443 && sibling->color == BLACK in ldns_rbtree_delete_fixup()
444 && sibling->left->color == BLACK in ldns_rbtree_delete_fixup()
445 && sibling->right->color == BLACK) in ldns_rbtree_delete_fixup()
[all …]
/NextBSD/lib/libedit/
HDkeymacro.c83 struct keymacro_node_t *sibling;/* ptr to another key with same prefix*/ member
304 if (ptr->sibling) { in node_trav()
306 return node_trav(el, ptr->sibling, ch, val); in node_trav()
327 for (xm = ptr; xm->sibling != NULL; xm = xm->sibling) in node__try()
328 if (xm->sibling->ch == *str) in node__try()
330 if (xm->sibling == NULL) in node__try()
331 xm->sibling = node__get(*str); /* setup new node */ in node__try()
332 ptr = xm->sibling; in node__try()
393 for (xm = ptr; xm->sibling != NULL; xm = xm->sibling) in node__delete()
394 if (xm->sibling->ch == *str) in node__delete()
[all …]
/NextBSD/contrib/tcsh/
HDed.xmap.c111 struct Xmapnode *sibling; /* ptr to another Xkey with same prefix */ member
199 if (ptr->sibling) { in TraverseMap()
201 return (TraverseMap(ptr->sibling, ch, val)); in TraverseMap()
247 for (xm = ptr; xm->sibling != NULL; xm = xm->sibling) in TryNode()
248 if (xm->sibling->ch == *(str->buf)) in TryNode()
250 if (xm->sibling == NULL) in TryNode()
251 xm->sibling = GetFreeNode(str); /* setup new node */ in TryNode()
252 ptr = xm->sibling; in TryNode()
347 for (xm = ptr; xm->sibling != NULL; xm = xm->sibling) in TryDeleteNode()
348 if (xm->sibling->ch == *(str->buf)) in TryDeleteNode()
[all …]
/NextBSD/contrib/ncurses/ncurses/base/
HDtries.c67 ptr = ptr->sibling; in NCURSES_EXPORT()
107 *tree = (*tree)->sibling; in _nc_remove_key()
112 tree = &(*tree)->sibling; in _nc_remove_key()
135 *tree = (*tree)->sibling; in _nc_remove_string()
142 tree = &(*tree)->sibling; in _nc_remove_string()
HDkey_defined.c44 for (ptr = tree; ptr != 0; ptr = ptr->sibling) { in find_definition()
HDlib_getch.c709 ptr = ptr->sibling; in kgetch()
HDlib_set_term.c105 _nc_free_keytry(kt->sibling); in _nc_free_keytry()
/NextBSD/contrib/tcpdump/
HDmakemib205 for (sib = child[parent]; sib != ""; sib = sibling[sib])
221 sibling[new] = child[parent]
239 if (sibling[item] != "") {
240 dump(sibling[item])
241 s = "&_"sibling[item]"_obj"
/NextBSD/contrib/ncurses/ncurses/tinfo/
HDadd_tries.c65 && ptr->sibling != 0) in NCURSES_EXPORT()
66 ptr = ptr->sibling; in NCURSES_EXPORT()
78 if ((ptr->sibling = typeCalloc(TRIES, 1)) == 0) { in NCURSES_EXPORT()
82 savedptr = ptr = ptr->sibling; in NCURSES_EXPORT()
HDlib_options.c273 || has_key_internal(keycode, tp->sibling)); in has_key_internal()
/NextBSD/contrib/binutils/bfd/
HDdwarf1.c109 unsigned long sibling; member
218 aDieInfo->sibling = bfd_get_32 (abfd, (bfd_byte *) xptr); in parse_die()
366 if (eachDieInfo.sibling) in parse_functions_in_unit()
367 eachDie = stash->debug_section + eachDieInfo.sibling; in parse_functions_in_unit()
533 if (aDieInfo.sibling in _bfd_dwarf1_find_nearest_line()
537 != stash->debug_section + aDieInfo.sibling) in _bfd_dwarf1_find_nearest_line()
549 if (aDieInfo.sibling != 0) in _bfd_dwarf1_find_nearest_line()
550 stash->currentDie = stash->debug_section + aDieInfo.sibling; in _bfd_dwarf1_find_nearest_line()
/NextBSD/contrib/subversion/subversion/libsvn_repos/
HDnode_tree.c81 while (tmp_node->sibling) in create_sibling_node()
82 tmp_node = tmp_node->sibling; in create_sibling_node()
85 return (tmp_node->sibling = create_node(name, elder->parent, pool)); in create_sibling_node()
128 if (tmp_node->sibling) in find_child_by_name()
129 tmp_node = tmp_node->sibling; in find_child_by_name()
/NextBSD/contrib/gcc/
HDtree-sra.c101 struct sra_elt *sibling; member
155 : (CHILD)->sibling)
165 child = child->sibling; in next_child_for_group()
182 child = child->sibling; in next_child_for_group()
403 for (c = elt->children; c; c = c->sibling) in can_completely_scalarize_p()
407 for (c = elt->groups; c; c = c->sibling) in can_completely_scalarize_p()
561 elt->sibling = parent->groups; in lookup_element()
566 elt->sibling = parent->children; in lookup_element()
1075 for (c = elt->children; c ; c = c->sibling) in scan_dump()
1078 for (c = elt->groups; c ; c = c->sibling) in scan_dump()
[all …]
HDcommon.opt655 foptimize-sibling-calls
657 Optimize sibling and tail recursive calls
/NextBSD/share/examples/pf/
HDqueue410 # respectively. These sibling departments can use more than their linkshare
11 # whenever there is no backlogged sibling queue but when a queue gets
/NextBSD/contrib/apr/memory/unix/
HDapr_pools.c503 apr_pool_t *sibling; member
828 if ((*pool->ref = pool->sibling) != NULL) in apr_pool_destroy()
829 pool->sibling->ref = pool->ref; in apr_pool_destroy()
928 if ((pool->sibling = parent->child) != NULL) in apr_pool_create_ex()
929 pool->sibling->ref = &pool->sibling; in apr_pool_create_ex()
940 pool->sibling = NULL; in apr_pool_create_ex()
1005 pool->sibling = NULL; in apr_pool_create_unmanaged_ex()
1235 child = child->sibling; in apr_pool_walk_tree()
1649 if ((*pool->ref = pool->sibling) != NULL) in pool_destroy_debug()
1650 pool->sibling->ref = pool->ref; in pool_destroy_debug()
[all …]
/NextBSD/contrib/llvm/tools/lldb/source/Plugins/SymbolFile/DWARF/
HDDWARFDebugInfoEntry.h411 SetSibling (DWARFDebugInfoEntry* sibling) in SetSibling() argument
413 if (sibling) in SetSibling()
417 m_sibling_idx = sibling - this; in SetSibling()
418 sibling->SetParent(GetParent()); in SetSibling()
HDDWARFDebugInfoEntry.cpp1830 const DWARFDebugInfoEntry *sibling = GetSibling(); in Contains() local
1831 assert (sibling); // TODO: take this out in Contains()
1832 if (sibling) in Contains()
1833 return die_offset < sibling->GetOffset(); in Contains()
/NextBSD/contrib/ncurses/ncurses/trace/
HDtrace_tries.c63 tree = tree->sibling; in recur_tries()
/NextBSD/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/
HDzap.c598 uint64_t sibling; in zap_expand_leaf() local
646 sibling = (ZAP_HASH_IDX(hash, old_prefix_len + 1) | 1) << prefix_diff; in zap_expand_leaf()
651 err = zap_idx_to_blk(zap, sibling+i, &blk); in zap_expand_leaf()
662 err = zap_set_idx_to_blk(zap, sibling+i, nl->l_blkid, tx); in zap_expand_leaf()
/NextBSD/contrib/subversion/subversion/svnlook/
HDsvnlook.c539 tmp_node = tmp_node->sibling; in print_dirs_changed_tree()
560 tmp_node = tmp_node->sibling; in print_dirs_changed_tree()
637 node = node->sibling; in print_changed_tree()
1156 while (node->sibling) in print_diff_tree()
1159 node = node->sibling; in print_diff_tree()
/NextBSD/contrib/gdb/gdb/
HDdwarf2read.c324 char *sibling; member
360 struct die_info *sibling; /* Its next sibling, if any. */ member
1766 if (orig_pdi->sibling) in locate_pdi_sibling()
1767 return orig_pdi->sibling; in locate_pdi_sibling()
4144 die->sibling = NULL; in read_die_and_children()
4176 last_sibling->sibling = die; in read_die_and_siblings()
4203 next = die->sibling; in free_die_list()
4470 part_die->sibling = in read_partial_die()
6369 return die->sibling; in sibling_die()
7310 if (die->sibling != NULL) in dump_die_list()
[all …]
/NextBSD/contrib/libc++/include/
D__tree322 // __w is __x's possibly null uncle (will become __x's sibling)
399 // reset sibling, and it still can't be null
414 // reset sibling, and it still can't be null
429 // reset sibling, and it still can't be null
451 // reset sibling, and it still can't be null
466 // reset sibling, and it still can't be null
481 // reset sibling, and it still can't be null
/NextBSD/sys/dev/ofw/
HDofw_if.m52 * @brief Return next sibling of node.

123