Searched refs:sibling (Results 1 - 25 of 26) sorted by relevance

12

/freebsd-10-stable/contrib/unbound/util/
H A Drbtree.c405 rbnode_t* sibling; local
408 /* determine sibling to the node that is one-black short */
409 if(child_parent->right == child) sibling = child_parent->left;
410 else sibling = child_parent->right;
420 if(sibling->color == RED)
421 { /* rotate to get a black sibling */
423 sibling->color = BLACK;
427 /* new sibling after rotation */
428 if(child_parent->right == child) sibling = child_parent->left;
429 else sibling
[all...]
/freebsd-10-stable/contrib/ncurses/ncurses/tinfo/
H A Dadd_tries.c64 && ptr->sibling != 0)
65 ptr = ptr->sibling;
77 if ((ptr->sibling = typeCalloc(TRIES, 1)) == 0) {
81 savedptr = ptr = ptr->sibling;
H A Dlib_options.c189 || has_key_internal(keycode, tp->sibling));
/freebsd-10-stable/contrib/ncurses/ncurses/base/
H A Dtries.c67 ptr = ptr->sibling;
105 *tree = (*tree)->sibling;
110 tree = &(*tree)->sibling;
133 *tree = (*tree)->sibling;
140 tree = &(*tree)->sibling;
H A Dkey_defined.c44 for (ptr = tree; ptr != 0; ptr = ptr->sibling) {
H A Dlib_getch.c628 ptr = ptr->sibling;
H A Dlib_set_term.c94 _nc_free_keytry(kt->sibling);
/freebsd-10-stable/contrib/ldns/
H A Drbtree.c415 ldns_rbnode_t* sibling; local
418 /* determine sibling to the node that is one-black short */
419 if(child_parent->right == child) sibling = child_parent->left;
420 else sibling = child_parent->right;
430 if(sibling->color == RED)
431 { /* rotate to get a black sibling */
433 sibling->color = BLACK;
437 /* new sibling after rotation */
438 if(child_parent->right == child) sibling = child_parent->left;
439 else sibling
[all...]
/freebsd-10-stable/contrib/tcsh/
H A Ded.xmap.c111 struct Xmapnode *sibling; /* ptr to another Xkey with same prefix */ member in struct:Xmapnode
199 if (ptr->sibling) {
200 /* try next sibling */
201 return (TraverseMap(ptr->sibling, ch, val));
204 /* no next sibling -- mismatch */
247 for (xm = ptr; xm->sibling != NULL; xm = xm->sibling)
248 if (xm->sibling->ch == *(str->buf))
250 if (xm->sibling == NULL)
251 xm->sibling
[all...]
/freebsd-10-stable/lib/libedit/
H A Dkey.c77 struct key_node_t *sibling; /* ptr to another key with same prefix*/ member in struct:key_node_t
293 if (ptr->sibling) {
294 /* try next sibling */
295 return (node_trav(el, ptr->sibling, ch, val));
297 /* no next sibling -- mismatch */
315 for (xm = ptr; xm->sibling != NULL; xm = xm->sibling)
316 if (xm->sibling->ch == *str)
318 if (xm->sibling == NULL)
319 xm->sibling
[all...]
/freebsd-10-stable/contrib/tcpdump/
H A Dmakemib207 for (sib = child[parent]; sib != ""; sib = sibling[sib])
223 sibling[new] = child[parent]
234 # printf "/* %s c=%s s=%s */\n", newitem, child[item], sibling[item]
241 if (sibling[item] != "") {
242 dump(sibling[item])
243 s = "&_"sibling[item]"_obj"
/freebsd-10-stable/contrib/llvm/lib/DebugInfo/
H A DDWARFDebugInfoEntry.h35 /// How many to add to "this" to get the sibling.
77 // our sibling will be some index after "this".
102 void setSibling(DWARFDebugInfoEntryMinimal *sibling) { argument
103 if (sibling) {
105 // our sibling will be some index after "this".
106 SiblingIdx = sibling - this;
107 sibling->setParent(getParent());
/freebsd-10-stable/contrib/ncurses/ncurses/trace/
H A Dtrace_tries.c62 tree = tree->sibling;
/freebsd-10-stable/contrib/binutils/bfd/
H A Ddwarf1.c109 unsigned long sibling; member in struct:die_info
218 aDieInfo->sibling = bfd_get_32 (abfd, (bfd_byte *) xptr);
365 /* Move to next sibling, if none, end loop */
366 if (eachDieInfo.sibling)
367 eachDie = stash->debug_section + eachDieInfo.sibling;
532 not it's sibling. */
533 if (aDieInfo.sibling
537 != stash->debug_section + aDieInfo.sibling)
549 if (aDieInfo.sibling != 0)
550 stash->currentDie = stash->debug_section + aDieInfo.sibling;
[all...]
/freebsd-10-stable/contrib/subversion/subversion/libsvn_repos/
H A Dnode_tree.c77 /* No ELDER sibling? That's just not gonna work out. */
83 while (tmp_node->sibling)
84 tmp_node = tmp_node->sibling;
86 /* Create a new youngest sibling and return that. */
87 return (tmp_node->sibling = create_node(name, elder->parent, pool));
104 /* If PARENT already has a child, create a new sibling for its first
130 if (tmp_node->sibling)
131 tmp_node = tmp_node->sibling;
/freebsd-10-stable/contrib/llvm/tools/lldb/source/Plugins/SymbolFile/DWARF/
H A DDWARFDebugInfoEntry.h363 // our sibling will be some index after "this".
405 SetSibling (DWARFDebugInfoEntry* sibling) argument
407 if (sibling)
410 // our sibling will be some index after "this".
411 m_sibling_idx = sibling - this;
412 sibling->SetParent(GetParent());
449 uint32_t m_sibling_idx:31, // How many to add to "this" to get the sibling.
H A DDWARFDebugInfoEntry.cpp1795 const DWARFDebugInfoEntry *sibling = GetSibling();
1796 assert (sibling); // TODO: take this out
1797 if (sibling)
1798 return die_offset < sibling->GetOffset();
2300 strm.PutCString("\noffset parent sibling child\n");
/freebsd-10-stable/contrib/gcc/
H A Dtree-sra.c101 struct sra_elt *sibling; member in struct:sra_elt
155 : (CHILD)->sibling)
165 child = child->sibling;
182 child = child->sibling;
404 for (c = elt->children; c; c = c->sibling)
408 for (c = elt->groups; c; c = c->sibling)
563 elt->sibling = parent->groups;
568 elt->sibling = parent->children;
1080 for (c = elt->children; c ; c = c->sibling)
1083 for (c = elt->groups; c ; c = c->sibling)
[all...]
/freebsd-10-stable/contrib/apr/memory/unix/
H A Dapr_pools.c496 * It is used for parent, child, sibling management.
503 apr_pool_t *sibling; member in struct:apr_pool_t
828 if ((*pool->ref = pool->sibling) != NULL)
829 pool->sibling->ref = pool->ref;
928 if ((pool->sibling = parent->child) != NULL)
929 pool->sibling->ref = &pool->sibling;
940 pool->sibling = NULL;
1005 pool->sibling = NULL;
1235 child = child->sibling;
[all...]
/freebsd-10-stable/contrib/ncurses/ncurses/
H A Dcurses.priv.h208 TRIES *sibling; /* ptr to sibling. NULL if none */ variable
/freebsd-10-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/
H A Dzap.c611 uint64_t sibling; local
659 sibling = (ZAP_HASH_IDX(hash, old_prefix_len + 1) | 1) << prefix_diff;
664 err = zap_idx_to_blk(zap, sibling+i, &blk);
673 /* set sibling pointers */
675 err = zap_set_idx_to_blk(zap, sibling+i, nl->l_blkid, tx);
680 /* we want the sibling */
/freebsd-10-stable/contrib/gdb/gdb/
H A Ddwarf2read.c324 char *sibling; member in struct:partial_die_info
360 struct die_info *sibling; /* Its next sibling, if any. */ member in struct:die_info
1431 /* If the die has a sibling, skip to the sibling, unless another
1757 /* Locate ORIG_PDI's sibling; INFO_PTR should point to the next DIE
1764 /* Do we know the sibling already? */
1766 if (orig_pdi->sibling)
1767 return orig_pdi->sibling;
1774 /* Okay, we don't know the sibling, bu
[all...]
/freebsd-10-stable/contrib/subversion/subversion/svnlook/
H A Dsvnlook.c544 tmp_node = tmp_node->sibling;
565 tmp_node = tmp_node->sibling;
642 node = node->sibling;
1148 for (node = node->child; node; node = node->sibling)
/freebsd-10-stable/contrib/subversion/subversion/include/
H A Dsvn_repos.h2684 /** Pointer to the next sibling of this node */
2685 struct svn_repos_node_t *sibling;
2673 struct svn_repos_node_t *sibling; member in struct:svn_repos_node_t
/freebsd-10-stable/contrib/gcc/config/arm/
H A Darm.c1475 If SIBLING is non-null, this is a test for a return before a sibling
1479 use_return_insn (int iscond, rtx sibling)
1544 if (sibling)
1546 gcc_assert (GET_CODE (sibling) == CALL_INSN);
1548 if (find_regno_fusage (sibling, USE, 3))
9852 arm_output_epilogue (rtx sibling)
9863 int really_return = (sibling == NULL);
9869 if (use_return_insn (FALSE, sibling) && return_used_this_function)
1474 use_return_insn(int iscond, rtx sibling) argument
9836 arm_output_epilogue(rtx sibling) argument

Completed in 481 milliseconds

12