| /freebsd-9-stable/lib/libedit/ |
| D | key.c | 77 struct key_node_t *sibling; /* ptr to another key with same prefix*/ member
293 if (ptr->sibling) { in node_trav()
295 return (node_trav(el, ptr->sibling, ch, val)); in node_trav()
315 for (xm = ptr; xm->sibling != NULL; xm = xm->sibling) in node__try()
316 if (xm->sibling->ch == *str) in node__try()
318 if (xm->sibling == NULL) in node__try()
319 xm->sibling = node__get(*str); /* setup new node */ in node__try()
320 ptr = xm->sibling; in node__try()
381 for (xm = ptr; xm->sibling != NULL; xm = xm->sibling) in node__delete()
382 if (xm->sibling->ch == *str) in node__delete()
[all …]
|
| /freebsd-9-stable/contrib/tcsh/ |
| D | ed.xmap.c | 111 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 …]
|
| /freebsd-9-stable/contrib/ncurses/ncurses/base/ |
| D | tries.c | 67 ptr = ptr->sibling; in NCURSES_EXPORT()
105 *tree = (*tree)->sibling; in _nc_remove_key()
110 tree = &(*tree)->sibling; in _nc_remove_key()
133 *tree = (*tree)->sibling; in _nc_remove_string()
140 tree = &(*tree)->sibling; in _nc_remove_string()
|
| D | key_defined.c | 44 for (ptr = tree; ptr != 0; ptr = ptr->sibling) { in find_definition()
|
| D | lib_getch.c | 628 ptr = ptr->sibling; in kgetch()
|
| D | lib_set_term.c | 94 _nc_free_keytry(kt->sibling); in _nc_free_keytry()
|
| /freebsd-9-stable/contrib/tcpdump/ |
| D | makemib | 207 for (sib = child[parent]; sib != ""; sib = sibling[sib])
223 sibling[new] = child[parent]
241 if (sibling[item] != "") {
242 dump(sibling[item])
243 s = "&_"sibling[item]"_obj"
|
| /freebsd-9-stable/contrib/ncurses/ncurses/tinfo/ |
| D | add_tries.c | 64 && ptr->sibling != 0) in NCURSES_EXPORT()
65 ptr = ptr->sibling; in NCURSES_EXPORT()
77 if ((ptr->sibling = typeCalloc(TRIES, 1)) == 0) { in NCURSES_EXPORT()
81 savedptr = ptr = ptr->sibling; in NCURSES_EXPORT()
|
| D | lib_options.c | 189 || has_key_internal(keycode, tp->sibling)); in has_key_internal()
|
| /freebsd-9-stable/contrib/bind9/lib/dns/ |
| D | rbt.c | 1814 dns_rbtnode_t *child, *sibling, *parent; in deletefromlevel() local
1966 sibling = RIGHT(parent); in deletefromlevel()
1968 if (IS_RED(sibling)) { in deletefromlevel()
1969 MAKE_BLACK(sibling); in deletefromlevel()
1972 sibling = RIGHT(parent); in deletefromlevel()
1975 INSIST(sibling != NULL); in deletefromlevel()
1977 if (IS_BLACK(LEFT(sibling)) && in deletefromlevel()
1978 IS_BLACK(RIGHT(sibling))) { in deletefromlevel()
1979 MAKE_RED(sibling); in deletefromlevel()
1984 if (IS_BLACK(RIGHT(sibling))) { in deletefromlevel()
[all …]
|
| D | rpz.c | 773 dns_rpz_cidr_node_t *cur, *parent, *child, *new_parent, *sibling; in search() local
903 sibling = new_node(cidr, tgt_ip, tgt_prefix, 0); in search()
904 if (sibling == NULL) in search()
908 isc_mem_put(cidr->mctx, sibling, sizeof(*sibling)); in search()
917 new_parent->child[child_num] = sibling; in search()
920 sibling->parent = new_parent; in search()
921 set_node_flags(sibling, type); in search()
923 *found = sibling; in search()
|
| /freebsd-9-stable/contrib/binutils/bfd/ |
| D | dwarf1.c | 109 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()
|
| /freebsd-9-stable/contrib/llvm/lib/DebugInfo/ |
| D | DWARFDebugInfoEntry.h | 102 void setSibling(DWARFDebugInfoEntryMinimal *sibling) { in setSibling() argument
103 if (sibling) { in setSibling()
106 SiblingIdx = sibling - this; in setSibling()
107 sibling->setParent(getParent()); in setSibling()
|
| /freebsd-9-stable/contrib/gcc/ |
| D | tree-sra.c | 101 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 …]
|
| D | common.opt | 655 foptimize-sibling-calls
657 Optimize sibling and tail recursive calls
|
| /freebsd-9-stable/share/examples/pf/ |
| D | queue4 | 10 # respectively. These sibling departments can use more than their linkshare
11 # whenever there is no backlogged sibling queue but when a queue gets
|
| /freebsd-9-stable/contrib/ncurses/ncurses/trace/ |
| D | trace_tries.c | 62 tree = tree->sibling; in recur_tries()
|
| /freebsd-9-stable/contrib/bind9/doc/misc/ |
| D | options | 89 check-sibling <boolean>;
324 check-sibling <boolean>;
499 check-sibling <boolean>;
596 check-sibling <boolean>;
|
| /freebsd-9-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/ |
| D | zap.c | 599 uint64_t sibling; in zap_expand_leaf() local
647 sibling = (ZAP_HASH_IDX(hash, old_prefix_len + 1) | 1) << prefix_diff; in zap_expand_leaf()
652 err = zap_idx_to_blk(zap, sibling+i, &blk); in zap_expand_leaf()
663 err = zap_set_idx_to_blk(zap, sibling+i, nl->l_blkid, tx); in zap_expand_leaf()
|
| /freebsd-9-stable/contrib/gdb/gdb/ |
| D | dwarf2read.c | 324 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()
7308 if (die->sibling != NULL) in dump_die_list()
[all …]
|
| /freebsd-9-stable/contrib/libc++/include/ |
| D | __tree | 330 // __w is __x's possibly null uncle (will become __x's sibling)
407 // reset sibling, and it still can't be null
422 // reset sibling, and it still can't be null
437 // reset sibling, and it still can't be null
459 // reset sibling, and it still can't be null
474 // reset sibling, and it still can't be null
489 // reset sibling, and it still can't be null
|
| /freebsd-9-stable/sys/dev/ofw/ |
| D | ofw_if.m | 52 * @brief Return next sibling of node.
|
| /freebsd-9-stable/contrib/gcc/doc/ |
| D | cfg.texi | 272 @item sibling calls
273 @cindex sibling call
|
| /freebsd-9-stable/contrib/ncurses/ncurses/ |
| D | curses.priv.h | 208 TRIES *sibling; /* ptr to sibling. NULL if none */
|
| /freebsd-9-stable/contrib/gcc/config/arm/ |
| D | arm.c | 1472 use_return_insn (int iscond, rtx sibling) in use_return_insn() argument
1537 if (sibling) in use_return_insn()
1539 gcc_assert (GET_CODE (sibling) == CALL_INSN); in use_return_insn()
1541 if (find_regno_fusage (sibling, USE, 3)) in use_return_insn()
9834 arm_output_epilogue (rtx sibling) in arm_output_epilogue() argument
9845 int really_return = (sibling == NULL); in arm_output_epilogue()
9851 if (use_return_insn (FALSE, sibling) && return_used_this_function) in arm_output_epilogue()
|