/freebsd-11-stable/contrib/unbound/util/ |
H A D | rbtree.c | 409 rbnode_type* sibling; local 412 /* determine sibling to the node that is one-black short */ 413 if(child_parent->right == child) sibling = child_parent->left; 414 else sibling = child_parent->right; 424 if(sibling->color == RED) 425 { /* rotate to get a black sibling */ 427 sibling->color = BLACK; 431 /* new sibling after rotation */ 432 if(child_parent->right == child) sibling = child_parent->left; 433 else sibling [all...] |
/freebsd-11-stable/contrib/ncurses/ncurses/tinfo/ |
H A D | add_tries.c | 65 && ptr->sibling != 0) 66 ptr = ptr->sibling; 78 if ((ptr->sibling = typeCalloc(TRIES, 1)) == 0) { 82 savedptr = ptr = ptr->sibling;
|
H A D | lib_options.c | 273 || has_key_internal(keycode, tp->sibling));
|
/freebsd-11-stable/contrib/ncurses/ncurses/base/ |
H A D | tries.c | 67 ptr = ptr->sibling; 107 *tree = (*tree)->sibling; 112 tree = &(*tree)->sibling; 135 *tree = (*tree)->sibling; 142 tree = &(*tree)->sibling;
|
H A D | key_defined.c | 44 for (ptr = tree; ptr != 0; ptr = ptr->sibling) {
|
H A D | lib_getch.c | 709 ptr = ptr->sibling;
|
H A D | lib_set_term.c | 105 _nc_free_keytry(kt->sibling);
|
/freebsd-11-stable/contrib/ldns/ |
H A D | rbtree.c | 415 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-11-stable/contrib/tcsh/ |
H A D | ed.xmap.c | 107 struct Xmapnode *sibling; /* ptr to another Xkey with same prefix */ member in struct:Xmapnode 195 if (ptr->sibling) { 196 /* try next sibling */ 197 return (TraverseMap(ptr->sibling, ch, val)); 200 /* no next sibling -- mismatch */ 243 for (xm = ptr; xm->sibling != NULL; xm = xm->sibling) 244 if (xm->sibling->ch == *(str->buf)) 246 if (xm->sibling == NULL) 247 xm->sibling [all...] |
/freebsd-11-stable/lib/libedit/ |
H A D | keymacro.c | 83 struct keymacro_node_t *sibling;/* ptr to another key with same prefix*/ member in struct:keymacro_node_t 306 if (ptr->sibling) { 307 /* try next sibling */ 308 return node_trav(el, ptr->sibling, ch, val); 310 /* no next sibling -- mismatch */ 329 for (xm = ptr; xm->sibling != NULL; xm = xm->sibling) 330 if (xm->sibling->ch == *str) 332 if (xm->sibling == NULL) 333 xm->sibling [all...] |
/freebsd-11-stable/contrib/tcpdump/ |
H A D | makemib | 205 for (sib = child[parent]; sib != ""; sib = sibling[sib]) 221 sibling[new] = child[parent] 232 # printf "/* %s c=%s s=%s */\n", newitem, child[item], sibling[item] 239 if (sibling[item] != "") { 240 dump(sibling[item]) 241 s = "&_"sibling[item]"_obj"
|
/freebsd-11-stable/contrib/wpa/src/utils/ |
H A D | json.h | 31 struct json_token *parent, *child, *sibling; member in struct:json_token
|
H A D | json.c | 196 json_check_tree_state(token->sibling) < 0) 289 !curr_token->child->sibling) { 351 curr_token->sibling = json_alloc_token(&tokens); 352 if (!curr_token->sibling) 354 curr_token->sibling->parent = curr_token->parent; 355 curr_token = curr_token->sibling; 484 json_free(json->sibling); 498 for (token = json->child; token; token = token->sibling) { 568 json_print_token(token->sibling, depth, buf, buflen);
|
/freebsd-11-stable/sys/conf/ |
H A D | Makefile.riscv | 32 CFLAGS += -fno-omit-frame-pointer -fno-optimize-sibling-calls
|
/freebsd-11-stable/contrib/ncurses/ncurses/trace/ |
H A D | trace_tries.c | 63 tree = tree->sibling;
|
/freebsd-11-stable/contrib/binutils/bfd/ |
H A D | dwarf1.c | 109 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-11-stable/contrib/subversion/subversion/libsvn_repos/ |
H A D | node_tree.c | 77 /* 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-11-stable/contrib/gcc/ |
H A D | tree-sra.c | 101 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-11-stable/cddl/usr.sbin/zfsd/ |
H A D | zfsd_event.cc | 462 Vdev sibling = *siblings_it; local 464 if (!sibling.IsSpare() && 465 sibling.State() == VDEV_STATE_HEALTHY) {
|
/freebsd-11-stable/contrib/llvm-project/lldb/bindings/interface/ |
H A D | SBBlock.i | 67 %feature("docstring", "Get the sibling block for this block.") GetSibling; 152 sibling = property(GetSibling, None, doc='''A read only property that returns the same result as GetSibling().''')
|
/freebsd-11-stable/contrib/apr/memory/unix/ |
H A D | apr_pools.c | 573 * It is used for parent, child, sibling management. 580 apr_pool_t *sibling; member in struct:apr_pool_t 1015 if ((*pool->ref = pool->sibling) != NULL) 1016 pool->sibling->ref = pool->ref; 1131 if ((pool->sibling = parent->child) != NULL) 1132 pool->sibling->ref = &pool->sibling; 1143 pool->sibling = NULL; 1210 pool->sibling = NULL; 1512 child = child->sibling; [all...] |
/freebsd-11-stable/contrib/ncurses/ncurses/ |
H A D | curses.priv.h | 269 TRIES *sibling; /* ptr to sibling. NULL if none */ variable
|
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-xray/ |
H A D | xray-converter.cpp | 165 // Traversal keeps sibling pointers to other threads stacks. This is helpful 173 // A helper function to find the sibling nodes for an encountered function in a 175 // traversed in a thread, sibling bidirectional pointers are maintained. 206 // and keeps sibling links up to when creating new nodes. 232 for (auto *sibling : CurrentStack->ExtraData.siblings) 233 sibling->ExtraData.siblings.push_back(CurrentStack);
|
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/ |
H A D | zap.c | 642 uint64_t sibling = local 648 err = zap_idx_to_blk(zap, sibling + i, &blk); 657 /* set sibling pointers */ 659 err = zap_set_idx_to_blk(zap, sibling + i, nl->l_blkid, tx); 664 /* we want the sibling */
|
/freebsd-11-stable/contrib/gdb/gdb/ |
H A D | dwarf2read.c | 324 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...] |