/freebsd-10.0-release/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
H A D | traits.hpp | 52 #include <ext/pb_ds/detail/pat_trie_/leaf.hpp> 116 leaf; typedef in struct:pb_ds::detail::trie_traits 138 leaf, 149 leaf, 160 leaf, 171 leaf, 181 leaf, 193 leaf, 277 leaf; typedef in struct:pb_ds::detail::trie_traits 299 leaf, [all...] |
H A D | cond_dtor_entry_dealtor.hpp | 75 m_p_nd->~leaf();
|
H A D | erase_fn_imps.hpp | 128 p_l->~leaf(); 169 static_cast<leaf_pointer>(p_nd)->~leaf();
|
H A D | pat_trie_.hpp | 149 typedef typename Node_And_It_Traits::leaf leaf; typedef in class:pb_ds::detail::PB_DS_CLASS_NAME 150 typedef typename Allocator::template rebind<leaf>::other leaf_allocator;
|
H A D | constructors_destructor_fn_imps.hpp | 180 new (p_new_lf) leaf(p_other_leaf->value());
|
H A D | internal_node.hpp | 93 typedef PB_DS_LEAF_C_DEC leaf; typedef in struct:pb_ds::detail::pat_trie_internal_node 94 typedef typename Allocator::template rebind<leaf>::other leaf_rebind;
|
/freebsd-10.0-release/contrib/ncurses/ncurses/tinfo/ |
H A D | access.c | 117 char *leaf = _nc_basename(strcpy(head, path)); local 119 if (leaf == 0) 120 leaf = head; 121 *leaf = '\0'; 122 if (head == leaf)
|
/freebsd-10.0-release/crypto/heimdal/lib/roken/ |
H A D | search.hin | 30 leaf
|
H A D | tsearch.c | 82 (*action)(root, leaf, level);
|
/freebsd-10.0-release/include/ |
H A D | search.h | 33 leaf enumerator in enum:__anon5330
|
/freebsd-10.0-release/lib/libc/stdlib/ |
H A D | twalk.c | 38 (*action)(root, leaf, level);
|
/freebsd-10.0-release/contrib/libcxxrt/ |
H A D | dynamic_cast.cc | 37 /** Offset of the leaf object. */ 208 void *leaf = ADD_TO_PTR((void*)sub, header->leaf_offset); local 209 return header->type->cast_to(leaf, dst);
|
/freebsd-10.0-release/contrib/dialog/ |
H A D | fselect.c | 108 char *leaf = strrchr(path, '/'); local 109 if (leaf != 0) 110 leaf++; 112 leaf = path; 113 return leaf; 308 char *leaf = leaf_of(input); local 310 return show_list(leaf, d_list, keep) | show_list(leaf, f_list, keep); 441 char *leaf; local 472 if ((leaf [all...] |
H A D | dialog.c | 1222 const char *leaf = strrchr(program, '/'); local 1225 if (leaf != 0) 1226 leaf++; 1228 leaf = program; 1231 fprintf(dialog_state.output, *list, n ? leaf : dialog_version());
|
/freebsd-10.0-release/etc/ |
H A D | protocols | 35 leaf-1 25 LEAF-1 # Leaf-1 36 leaf-2 26 LEAF-2 # Leaf-2
|
/freebsd-10.0-release/contrib/llvm/include/llvm/ADT/ |
H A D | IntervalMap.h | 189 // Both leaf and branch nodes store vectors of pairs. 432 // Compute the leaf node branching factor that makes a node fit in three 446 // Now that we have the leaf branching factor, compute the actual allocation 455 /// Allocator - The recycling allocator used for both branch and leaf nodes. 478 // A NodeRef doesn't know whether it references a leaf node or a branch node. 690 // When all of the leaf nodes from all the subtrees are concatenated, they must 691 // satisfy the same constraints as a single leaf node. They must be sorted, 786 /// path - The path entries, path[0] is the root node, path.back() is a leaf. 799 template <typename NodeT> NodeT &leaf() const { 979 // 1: Root points to leaf [all...] |
/freebsd-10.0-release/contrib/bsnmp/gensnmptree/ |
H A D | gensnmptree.c | 47 * leaf := head type STRING ACCESS ')' 67 * element := tree | leaf | column 164 struct leaf { struct in union:node::__anon718 165 enum snmp_syntax syntax; /* syntax for this leaf */ 167 } leaf; member in union:node::__anon718 802 node->u.leaf.func = savetok(); 803 node->u.leaf.syntax = syntax; 931 /* leaf or column */ 946 syntax = np->u.leaf.syntax; 997 fprintf(fp, "%s, ", np->u.leaf [all...] |
/freebsd-10.0-release/contrib/binutils/gas/ |
H A D | cgen.c | 723 (field ? field->val.leaf->name : "??")); 728 rightshift -= field->val.leaf->length; 902 start = fixP->fx_cgen.field->val.leaf->start; 903 length = fixP->fx_cgen.field->val.leaf->length;
|
/freebsd-10.0-release/sys/net/ |
H A D | radix.c | 95 static int rn_satisfies_leaf(char *trial, struct radix_node *leaf, 128 * a key satisfies a normal route, and also in remembering the unique leaf 248 rn_satisfies_leaf(trial, leaf, skip) 250 register struct radix_node *leaf; 253 register char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask; 297 * match and the leaf we have is the most specific one anyway; 333 * we may match if the leaf we wound up at is 379 * Whenever we add a new leaf to the tree, we also add a parent node, 381 * the leaf (se [all...] |
/freebsd-10.0-release/contrib/compiler-rt/lib/sparc64/ |
H A D | divmod.m4 | 244 retl ! leaf-routine return
|
/freebsd-10.0-release/contrib/tcpdump/ |
H A D | print-slow.c | 172 u_int8_t leaf[2]; member in struct:slow_oam_variablerequest_t 177 u_int8_t leaf[2]; member in struct:slow_oam_variableresponse_t
|
/freebsd-10.0-release/sys/dev/xen/blkback/ |
H A D | blkback.c | 3308 const char *leaf; local 3321 leaf = "sectors"; 3322 error = xs_printf(xst, our_path, leaf, 3328 leaf = "info"; 3329 error = xs_printf(xst, our_path, leaf, "%u", 3335 leaf = "sector-size"; 3336 error = xs_printf(xst, our_path, leaf, "%u", 3351 our_path, leaf);
|
/freebsd-10.0-release/contrib/atf/atf-c/detail/ |
H A D | fs_test.c | 295 const char *leaf; member in struct:test 311 printf("Expected output: %s\n", t->leaf); 316 ATF_REQUIRE(atf_equal_dynstr_cstring(&ln, t->leaf));
|
/freebsd-10.0-release/contrib/ncurses/progs/ |
H A D | tset.c | 1316 char *leaf; local 1322 && ((len = (int) strlen(leaf = _nc_basename(var))) >= 3) 1323 && !strcmp(leaf + len - 3, "csh"))
|
/freebsd-10.0-release/sbin/routed/ |
H A D | radix.c | 101 * a key satisfies a normal route, and also in remembering the unique leaf 186 struct radix_node *leaf, 189 char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask; 232 * match and the leaf we have is the most specific one anyway; 281 * we may match if the leaf we wound up at is 835 /* Find the next *leaf* since next node might vanish, too */ 185 rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip) argument
|