Searched refs:leaf (Results 1 - 25 of 42) sorted by relevance

12

/freebsd-10-stable/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/
H A Dtraits.hpp52 #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 Dcond_dtor_entry_dealtor.hpp75 m_p_nd->~leaf();
H A Derase_fn_imps.hpp128 p_l->~leaf();
169 static_cast<leaf_pointer>(p_nd)->~leaf();
H A Dpat_trie_.hpp149 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 Dconstructors_destructor_fn_imps.hpp180 new (p_new_lf) leaf(p_other_leaf->value());
H A Dinternal_node.hpp93 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-stable/contrib/libucl/tests/basic/
H A D3.in16 leaf: query -e '%a == 0' '%n-%v',
17 leaf: query -e '%a == 0' '%n-%v',
/freebsd-10-stable/contrib/ncurses/ncurses/tinfo/
H A Daccess.c117 char *leaf = _nc_basename(strcpy(head, path)); local
119 if (leaf == 0)
120 leaf = head;
121 *leaf = '\0';
122 if (head == leaf)
/freebsd-10-stable/crypto/heimdal/lib/roken/
H A Dsearch.hin30 leaf
H A Dtsearch.c82 (*action)(root, leaf, level);
/freebsd-10-stable/lib/libc/stdlib/
H A Dtwalk.c35 (*action)(root, leaf, level);
/freebsd-10-stable/include/
H A Dsearch.h33 leaf enumerator in enum:__anon553
/freebsd-10-stable/contrib/libcxxrt/
H A Ddynamic_cast.cc37 /** Offset of the leaf object. */
208 void *leaf = ADD_TO_PTR(const_cast<void *>(sub), header->leaf_offset); local
209 return header->type->cast_to(leaf, dst);
/freebsd-10-stable/contrib/dialog/
H A Dfselect.c108 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 Ddialog.c1222 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-stable/sys/x86/iommu/
H A Dintel_idpgtbl.c85 int leaf; /* The last materialized page table member in struct:idpgtbl
124 if (lvl != tbl->leaf) {
130 if (lvl == tbl->leaf) {
168 int leaf, i; local
170 leaf = 0; /* silence gcc */
177 leaf = i;
185 * supported by the DMAR and leaf should be equal to the
194 tbl->leaf == leaf) {
213 tbl->leaf
[all...]
/freebsd-10-stable/contrib/llvm/include/llvm/ADT/
H A DIntervalMap.h189 // 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-stable/contrib/bsnmp/gensnmptree/
H A Dgensnmptree.c47 * leaf := head type STRING ACCESS ')'
67 * element := tree | leaf | column
164 struct leaf { struct in union:node::__anon85
165 enum snmp_syntax syntax; /* syntax for this leaf */
167 } leaf; member in union:node::__anon85
800 node->u.leaf.func = savetok();
801 node->u.leaf.syntax = syntax;
929 /* leaf or column */
944 syntax = np->u.leaf.syntax;
995 fprintf(fp, "%s, ", np->u.leaf
[all...]
/freebsd-10-stable/contrib/binutils/gas/
H A Dcgen.c723 (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-stable/contrib/compiler-rt/lib/sparc64/
H A Ddivmod.m4244 retl ! leaf-routine return
/freebsd-10-stable/contrib/tcpdump/
H A Dprint-slow.c172 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-stable/sys/net/
H A Dradix.c95 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
267 rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip) argument
269 char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask;
314 * match and the leaf we have is the most specific one anyway;
350 * we may match if the leaf we wound up at is
396 * Whenever we add a new leaf to the tree, we also add a parent node,
398 * the leaf (see RNTORT() in route.c), the second one is the parent.
400 * the leaf i
[all...]
/freebsd-10-stable/sys/dev/xen/blkback/
H A Dblkback.c3232 const char *leaf; local
3245 leaf = "sectors";
3246 error = xs_printf(xst, our_path, leaf,
3252 leaf = "info";
3253 error = xs_printf(xst, our_path, leaf, "%u",
3259 leaf = "sector-size";
3260 error = xs_printf(xst, our_path, leaf, "%u",
3275 our_path, leaf);
/freebsd-10-stable/contrib/atf/atf-c/detail/
H A Dfs_test.c292 const char *leaf; member in struct:test
308 printf("Expected output: %s\n", t->leaf);
313 ATF_REQUIRE(atf_equal_dynstr_cstring(&ln, t->leaf));
/freebsd-10-stable/contrib/ncurses/progs/
H A Dtset.c1316 char *leaf; local
1322 && ((len = (int) strlen(leaf = _nc_basename(var))) >= 3)
1323 && !strcmp(leaf + len - 3, "csh"))

Completed in 292 milliseconds

12