HomeSort by: relevance | last modified time | path
    Searched refs:sibling (Results 1 - 25 of 95) sorted by relevancy

1 2 3 4

  /src/lib/libedit/
keymacro.c 82 struct keymacro_node_t *sibling;/* ptr to another key with same prefix*/ member in struct:keymacro_node_t
301 if (ptr->sibling) {
302 /* try next sibling */
303 return node_trav(el, ptr->sibling, ch, val);
305 /* no next sibling -- mismatch */
324 for (xm = ptr; xm->sibling != NULL; xm = xm->sibling)
325 if (xm->sibling->ch == *str)
327 if (xm->sibling == NULL)
328 xm->sibling = node__get(*str); /* setup new node *
    [all...]
  /src/external/bsd/nsd/dist/
rbtree.c 398 rbnode_type* sibling; local
406 /* determine sibling to the node that is one-black short */
407 if(child_parent->right == child) sibling = child_parent->left;
408 else sibling = child_parent->right;
418 if(sibling->color == RED)
419 { /* rotate to get a black sibling */
421 sibling->color = BLACK;
425 /* new sibling after rotation */
426 if(child_parent->right == child) sibling = child_parent->left;
427 else sibling = child_parent->right
    [all...]
  /src/external/bsd/unbound/dist/util/
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 = child_parent->right
    [all...]
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.dwarf2/
corrupt.exp 54 {sibling 12345678 DW_FORM_ref4}
63 {sibling 12345678 DW_FORM_ref4}
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.dwarf2/
corrupt.exp 54 {sibling 12345678 DW_FORM_ref4}
63 {sibling 12345678 DW_FORM_ref4}
  /src/external/bsd/jemalloc.old/dist/test/unit/
ph.c 60 node_t *leftmost_child, *sibling; local
73 for (sibling = node_next_get(leftmost_child); sibling !=
74 NULL; sibling = node_next_get(sibling)) {
75 node_print(sibling, depth + 1);
104 node_t *leftmost_child, *sibling; local
119 for (sibling = node_next_get(leftmost_child); sibling !=
120 NULL; sibling = node_next_get(sibling))
    [all...]
  /src/external/bsd/jemalloc/dist/test/unit/
ph.c 60 node_t *leftmost_child, *sibling; local
73 for (sibling = node_next_get(leftmost_child); sibling != NULL;
74 sibling = node_next_get(sibling)) {
75 node_print(sibling, depth + 1);
104 node_t *leftmost_child, *sibling; local
119 for (sibling = node_next_get(leftmost_child); sibling != NULL;
120 sibling = node_next_get(sibling))
    [all...]
  /src/external/bsd/tcpdump/dist/
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"
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/experimental/allocator/building_blocks/
free_tree.d 70 Node* sibling;
80 assert(!which.sibling);
106 if (auto sis = n.sibling)
110 n.sibling = sis.sibling;
134 for (auto sis = n; sis; sis = sis.sibling)
159 for (auto sis = n.sibling; sis; sis = sis.sibling)
203 which.sibling = null;
209 which.sibling = where.sibling
    [all...]
  /src/external/gpl3/gcc/dist/libcpp/
makeuname2c.cc 103 struct node *sibling, *child; member in struct:node
342 n->sibling = NULL;
355 p = &n->sibling;
370 n->sibling = NULL;
380 p = &n->sibling;
388 for (; n; n = n->sibling)
413 if (n->sibling)
414 size_nodes (n->sibling);
418 else if (n->sibling == NULL)
422 if (n->sibling)
    [all...]
  /src/sys/external/bsd/drm2/dist/drm/i915/gt/
intel_lrc.h 123 const struct intel_engine_cs *sibling);
127 unsigned int sibling);
intel_lrc.c 439 if (engine == ve->siblings[0]) { /* only preempt one sibling */
1972 if (unlikely(!rq)) { /* lost the race to a sibling */
4713 struct intel_engine_cs *sibling = ve->siblings[n]; local
4714 struct rb_node *node = &ve->nodes[sibling->id].rb;
4717 if (!ve->nodes[sibling->id].inserted)
4720 spin_lock_irqsave(&sibling->active.lock, flags);
4723 if (ve->nodes[sibling->id].inserted) {
4724 rb_erase_cached(node, &sibling->execlists.virtual);
4725 ve->nodes[sibling->id].inserted = false;
4728 spin_unlock_irqrestore(&sibling->active.lock, flags)
4868 struct intel_engine_cs *sibling = ve->siblings[n]; local
5094 struct intel_engine_cs *sibling = siblings[n]; local
    [all...]
  /src/external/gpl3/gdb.old/dist/sim/common/
hw-base.c 340 struct hw **sibling = &parent->child_of_hw; local
341 while ((*sibling) != NULL)
342 sibling = &(*sibling)->sibling_of_hw;
343 *sibling = hw;
477 struct hw **sibling = &hw_parent (me)->child_of_hw; local
478 while (*sibling != NULL)
480 if (*sibling == me)
482 *sibling = me->sibling_of_hw;
  /src/external/gpl3/gdb/dist/sim/common/
hw-base.c 340 struct hw **sibling = &parent->child_of_hw; local
341 while ((*sibling) != NULL)
342 sibling = &(*sibling)->sibling_of_hw;
343 *sibling = hw;
477 struct hw **sibling = &hw_parent (me)->child_of_hw; local
478 while (*sibling != NULL)
480 if (*sibling == me)
482 *sibling = me->sibling_of_hw;
  /src/external/mit/libuv/dist/src/
heap-inl.h 75 struct heap_node* sibling; local
85 sibling = child->right;
88 sibling = child->left;
90 if (sibling != NULL)
91 sibling->parent = child;
  /src/external/gpl3/binutils/dist/bfd/
dwarf1.c 112 unsigned long sibling; member in struct:die_info
235 aDieInfo->sibling = bfd_get_32 (abfd, xptr);
405 /* Move to next sibling, if none, end loop */
406 if (eachDieInfo.sibling)
407 eachDie = stash->debug_section + eachDieInfo.sibling;
571 not it's sibling. */
572 if (aDieInfo.sibling
576 != stash->debug_section + aDieInfo.sibling)
588 if (aDieInfo.sibling != 0)
589 stash->currentDie = stash->debug_section + aDieInfo.sibling;
    [all...]
  /src/external/gpl3/binutils.old/dist/bfd/
dwarf1.c 112 unsigned long sibling; member in struct:die_info
235 aDieInfo->sibling = bfd_get_32 (abfd, xptr);
405 /* Move to next sibling, if none, end loop */
406 if (eachDieInfo.sibling)
407 eachDie = stash->debug_section + eachDieInfo.sibling;
571 not it's sibling. */
572 if (aDieInfo.sibling
576 != stash->debug_section + aDieInfo.sibling)
588 if (aDieInfo.sibling != 0)
589 stash->currentDie = stash->debug_section + aDieInfo.sibling;
    [all...]
  /src/external/gpl3/gdb.old/dist/bfd/
dwarf1.c 112 unsigned long sibling; member in struct:die_info
235 aDieInfo->sibling = bfd_get_32 (abfd, xptr);
405 /* Move to next sibling, if none, end loop */
406 if (eachDieInfo.sibling)
407 eachDie = stash->debug_section + eachDieInfo.sibling;
571 not it's sibling. */
572 if (aDieInfo.sibling
576 != stash->debug_section + aDieInfo.sibling)
588 if (aDieInfo.sibling != 0)
589 stash->currentDie = stash->debug_section + aDieInfo.sibling;
    [all...]
  /src/external/gpl3/gdb/dist/bfd/
dwarf1.c 112 unsigned long sibling; member in struct:die_info
235 aDieInfo->sibling = bfd_get_32 (abfd, xptr);
405 /* Move to next sibling, if none, end loop */
406 if (eachDieInfo.sibling)
407 eachDie = stash->debug_section + eachDieInfo.sibling;
571 not it's sibling. */
572 if (aDieInfo.sibling
576 != stash->debug_section + aDieInfo.sibling)
588 if (aDieInfo.sibling != 0)
589 stash->currentDie = stash->debug_section + aDieInfo.sibling;
    [all...]
  /src/usr.sbin/altq/libaltq/
qop_cdnr.c 339 root->child = cl->sibling;
341 prev->sibling != NULL; prev = prev->sibling)
342 if (prev->sibling == cl) {
343 prev->sibling = cl->sibling;
348 cl->sibling = clinfo->child;
374 while (cl->sibling != NULL) {
376 cl = cl->sibling;
381 cl->sibling = clinfo->sibling
    [all...]
  /src/external/bsd/wpa/dist/src/utils/
json.h 31 struct json_token *parent, *child, *sibling; member in struct:json_token
json.c 196 json_check_tree_state(token->sibling) < 0)
289 !curr_token->child->sibling) {
353 curr_token->sibling = json_alloc_token(&tokens);
354 if (!curr_token->sibling)
356 curr_token->sibling->parent = curr_token->parent;
357 curr_token = curr_token->sibling;
486 json_free(json->sibling);
500 for (token = json->child; token; token = token->sibling) {
592 json_print_token(token->sibling, depth, buf, buflen);
  /src/external/mpl/bind/dist/lib/dns/
rbt.c 1815 dns_rbtnode_t *child, *sibling, *parent; local
1971 sibling = parent->right;
1973 if (IS_RED(sibling)) {
1974 sibling->color = BLACK;
1977 sibling = parent->right;
1980 INSIST(sibling != NULL);
1982 if (IS_BLACK(sibling->left) &&
1983 IS_BLACK(sibling->right))
1985 sibling->color = RED;
1988 if (IS_BLACK(sibling->right))
    [all...]
  /src/external/mpl/dhcp/bind/dist/lib/dns/
rbt.c 2658 dns_rbtnode_t *child, *sibling, *parent; local
2816 sibling = RIGHT(parent);
2818 if (IS_RED(sibling)) {
2819 MAKE_BLACK(sibling);
2822 sibling = RIGHT(parent);
2825 INSIST(sibling != NULL);
2828 * symbolName=sibling */
2829 if (IS_BLACK(LEFT(sibling)) &&
2830 IS_BLACK(RIGHT(sibling)))
2832 MAKE_RED(sibling);
    [all...]
  /src/external/gpl3/gdb.old/dist/gdb/dwarf2/
die.c 187 if (die->sibling != NULL && level > 0)
189 dump_die_1 (f, level, max_level, die->sibling);

Completed in 75 milliseconds

1 2 3 4