Home
last modified time | relevance | path

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

12

/freebsd/contrib/unbound/util/
H A Drbtree.c409 rbnode_type* sibling; in rbtree_delete_fixup() local
413 if(child_parent->right == child) sibling = child_parent->left; in rbtree_delete_fixup()
414 else sibling = child_parent->right; in rbtree_delete_fixup()
424 if(sibling->color == RED) in rbtree_delete_fixup()
427 sibling->color = BLACK; in rbtree_delete_fixup()
432 if(child_parent->right == child) sibling = child_parent->left; in rbtree_delete_fixup()
433 else sibling = child_parent->right; in rbtree_delete_fixup()
437 && sibling->color == BLACK in rbtree_delete_fixup()
438 && sibling->left->color == BLACK in rbtree_delete_fixup()
439 && sibling->right->color == BLACK) in rbtree_delete_fixup()
[all …]
/freebsd/contrib/ldns/
H A Drbtree.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 …]
/freebsd/contrib/libedit/
H A Dkeymacro.c82 struct keymacro_node_t *sibling;/* ptr to another key with same prefix*/ member
301 if (ptr->sibling) { in node_trav()
303 return node_trav(el, ptr->sibling, ch, val); in node_trav()
324 for (xm = ptr; xm->sibling != NULL; xm = xm->sibling) in node__try()
325 if (xm->sibling->ch == *str) in node__try()
327 if (xm->sibling == NULL) in node__try()
328 xm->sibling = node__get(*str); /* setup new node */ in node__try()
329 ptr = xm->sibling; in node__try()
388 for (xm = ptr; xm->sibling != NULL; xm = xm->sibling) in node__delete()
389 if (xm->sibling->ch == *str) in node__delete()
[all …]
/freebsd/contrib/tcsh/
H A Ded.xmap.c107 struct Xmapnode *sibling; /* ptr to another Xkey with same prefix */ member
195 if (ptr->sibling) { in TraverseMap()
197 return (TraverseMap(ptr->sibling, ch, val)); in TraverseMap()
243 for (xm = ptr; xm->sibling != NULL; xm = xm->sibling) in TryNode()
244 if (xm->sibling->ch == *(str->buf)) in TryNode()
246 if (xm->sibling == NULL) in TryNode()
247 xm->sibling = GetFreeNode(str); /* setup new node */ in TryNode()
248 ptr = xm->sibling; in TryNode()
343 for (xm = ptr; xm->sibling != NULL; xm = xm->sibling) in TryDeleteNode()
344 if (xm->sibling->ch == *(str->buf)) in TryDeleteNode()
[all …]
/freebsd/contrib/ncurses/ncurses/base/
H A Dtries.c69 ptr = ptr->sibling; in NCURSES_EXPORT()
109 *tree = (*tree)->sibling; in _nc_remove_key()
114 tree = &(*tree)->sibling; in _nc_remove_key()
137 *tree = (*tree)->sibling; in _nc_remove_string()
144 tree = &(*tree)->sibling; in _nc_remove_string()
H A Dkey_defined.c46 for (ptr = tree; ptr != 0; ptr = ptr->sibling) { in find_definition()
/freebsd/contrib/tcpdump/
H A Dmakemib205 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"
/freebsd/contrib/ncurses/ncurses/tinfo/
H A Dadd_tries.c67 && ptr->sibling != 0) in NCURSES_EXPORT()
68 ptr = ptr->sibling; in NCURSES_EXPORT()
80 if ((ptr->sibling = typeCalloc(TRIES, 1)) == 0) { in NCURSES_EXPORT()
84 savedptr = ptr = ptr->sibling; in NCURSES_EXPORT()
H A Dlib_options.c278 || has_key_internal(keycode, tp->sibling)); in has_key_internal()
/freebsd/contrib/wpa/src/utils/
H A Djson.c196 json_check_tree_state(token->sibling) < 0) in json_check_tree_state()
289 !curr_token->child->sibling) { in json_parse()
353 curr_token->sibling = json_alloc_token(&tokens); in json_parse()
354 if (!curr_token->sibling) in json_parse()
356 curr_token->sibling->parent = curr_token->parent; in json_parse()
357 curr_token = curr_token->sibling; in json_parse()
486 json_free(json->sibling); in json_free()
500 for (token = json->child; token; token = token->sibling) { in json_get_member()
592 json_print_token(token->sibling, depth, buf, buflen); in json_print_token()
H A Djson.h31 struct json_token *parent, *child, *sibling; member
/freebsd/share/examples/pf/
H A Dqueue49 # respectively. These sibling departments can use more than their linkshare
10 # whenever there is no backlogged sibling queue but when a queue gets
/freebsd/cddl/usr.sbin/zfsd/
H A Dzfsd_event.cc467 Vdev sibling = *siblings_it; in TryDetach() local
469 if (!sibling.IsSpare() && in TryDetach()
470 sibling.State() == VDEV_STATE_HEALTHY) { in TryDetach()
/freebsd/sys/modules/linux64/
H A DMakefile67 -fno-omit-frame-pointer -foptimize-sibling-calls \
74 -fno-omit-frame-pointer -foptimize-sibling-calls \
/freebsd/contrib/llvm-project/lld/docs/MachO/
H A Dindex.rst26 by its sibling file ``lld``, as ``ld64.lld`` is technically a symlink to ``lld``.
45 by its sibling file ``lld``, as ``ld64.lld`` is technically a symlink to ``lld``.
/freebsd/sys/dev/cxgbe/
H A Dt4_if.m45 # Called by the PF4 driver on each sibling device when the PF4 driver is
51 # Called by the PF4 driver on each sibling device when the PF4 driver is
/freebsd/sys/conf/
H A DMakefile.riscv39 CFLAGS += -fno-omit-frame-pointer -fno-optimize-sibling-calls
/freebsd/contrib/ncurses/ncurses/trace/
H A Dtrace_tries.c64 tree = tree->sibling; in recur_tries()
/freebsd/sys/modules/linux/
H A DMakefile101 -fno-omit-frame-pointer -foptimize-sibling-calls ${VDSOFLAGS} \
108 -fno-omit-frame-pointer -foptimize-sibling-calls ${VDSOFLAGS} \
/freebsd/sys/contrib/device-tree/Bindings/power/supply/
H A Dtwl-charger.txt9 if there is a sibling of the BCI node which is compatible with
/freebsd/contrib/llvm-project/lldb/bindings/interface/
H A DSBBlockExtensions.i51 …sibling = property(GetSibling, None, doc='''A read only property that returns the same result as G…
/freebsd/sys/dev/ice/
H A Dice_sched.c376 if (p->sibling == node) { in ice_free_sched_node()
377 p->sibling = node->sibling; in ice_free_sched_node()
380 p = p->sibling; in ice_free_sched_node()
383 /* update the sibling head if head is getting removed */ in ice_free_sched_node()
386 node->sibling; in ice_free_sched_node()
1053 new_node->sibling = NULL; in ice_sched_add_elems()
1056 /* add it to previous node sibling pointer */ in ice_sched_add_elems()
1060 while (prev->sibling) in ice_sched_add_elems()
1061 prev = prev->sibling; in ice_sched_add_elems()
[all...]
/freebsd/sys/contrib/device-tree/Bindings/usb/
H A Dtwlxxxx-usb.txt33 If a sibling node is compatible "ti,twl4030-bci", then it will find
/freebsd/contrib/llvm-project/llvm/tools/llvm-xray/
H A Dxray-converter.cpp174 // Traversal keeps sibling pointers to other threads stacks. This is helpful
182 // A helper function to find the sibling nodes for an encountered function in a
184 // traversed in a thread, sibling bidirectional pointers are maintained.
215 // and keeps sibling links up to when creating new nodes.
241 for (auto *sibling : CurrentStack->ExtraData.siblings) in findOrCreateStackNode() local
242 sibling->ExtraData.siblings.push_back(CurrentStack); in findOrCreateStackNode()
/freebsd/contrib/one-true-awk/
H A Dmakefile25 CFLAGS = -fsanitize=address -O1 -g -fno-omit-frame-pointer -fno-optimize-sibling-calls

12