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

12

/freebsd-10.0-release/cddl/contrib/opensolaris/cmd/ztest/
H A Dztest.c2743 uint64_t leaf, top; local
2770 * Pick a random leaf within it.
2772 leaf = ztest_random(leaves);
2781 oldvd = oldvd->vdev_child[leaf / ztest_opts.zo_raidz];
2786 oldvd = oldvd->vdev_child[leaf % ztest_opts.zo_raidz];
2830 top * leaves + leaf);
3002 * leaf vdev we encounter.
3049 * Determine the size of the first leaf vdev associated with
4225 * 2050 entries we should see ptrtbl growth and leaf-block split.
4752 uint64_t top, leaf; local
[all...]
/freebsd-10.0-release/contrib/atf/atf-c/detail/
H A Dfs_test.c295 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/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.0-release/contrib/binutils/gas/config/
H A Dtc-score.c165 unsigned long leaf; member in struct:proc
6003 cur_proc_ptr->leaf = 0xdeafbeaf;
6061 cur_proc_ptr->leaf = val;
6125 (cur_proc_ptr->leaf == 0xdeafbeaf) ||
6143 md_number_to_chars (fragp + 12, (valueT) cur_proc_ptr->leaf, 4);
/freebsd-10.0-release/contrib/binutils/include/opcode/
H A Dcgen.h647 const struct cgen_ifld * leaf;
637 const struct cgen_ifld * leaf; member in union:cgen_maybe_multi_ifield::__anon577
/freebsd-10.0-release/contrib/bsnmp/gensnmptree/
H A Dgensnmptree.c47 * 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/compiler-rt/lib/sparc64/
H A Ddivmod.m4244 retl ! leaf-routine return
H A Ddivsi3.S329 retl ! leaf-routine return
H A Dmodsi3.S329 retl ! leaf-routine return
/freebsd-10.0-release/contrib/dialog/
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());
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 Dinputstr.c107 if (which == postorder || which == leaf) {
/freebsd-10.0-release/contrib/gcc/config/arm/
H A Darm.c9292 even call clobbered ones. If this is a leaf function
9754 a leaf function. These function types will not contain a stack
10498 int leaf;
10504 /* We need to know if we are a leaf function. Unfortunately, it
10510 to know about leaf functions once reload has completed, and the
10521 leaf = leaf_function_p ();
10571 /* A leaf function does not need any stack alignment if it has nothing
10573 if (leaf && frame_size == 0)
13381 /* This test is only important for leaf functions. */
10482 int leaf; local
/freebsd-10.0-release/contrib/libcxxrt/
H A Ddynamic_cast.cc37 /** 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/libstdc++/include/
H A DMakefile.am426 ${pb_srcdir}/detail/pat_trie_/leaf.hpp \
/freebsd-10.0-release/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/
H A Dcond_dtor_entry_dealtor.hpp75 m_p_nd->~leaf();
H A Dconstructors_destructor_fn_imps.hpp180 new (p_new_lf) leaf(p_other_leaf->value());
H A Derase_fn_imps.hpp128 p_l->~leaf();
169 static_cast<leaf_pointer>(p_nd)->~leaf();
H A Dinsert_join_fn_imps.hpp400 new (p_new_lf) leaf(r_val);
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;
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 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...]
/freebsd-10.0-release/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.0-release/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.0-release/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 297 milliseconds

12