Home
last modified time | relevance | path

Searched full:leaf (Results 1 – 25 of 681) sorted by relevance

12345678910>>...28

/freebsd-src/contrib/jemalloc/src/
H A Drtree.c53 rtree_leaf_dalloc_impl(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *leaf) { in rtree_leaf_dalloc_impl() argument
78 rtree_leaf_elm_t *leaf = in rtree_delete_subtree() local
81 if (leaf != NULL) { in rtree_delete_subtree()
82 rtree_leaf_dalloc(tsdn, rtree, leaf); in rtree_delete_subtree()
135 rtree_leaf_elm_t *leaf = atomic_load_p(elmp, ATOMIC_RELAXED); in rtree_leaf_init() local
136 if (leaf == NULL) { in rtree_leaf_init()
137 leaf = rtree_leaf_alloc(tsdn, rtree, ZU(1) << in rtree_leaf_init()
139 if (leaf == NULL) { in rtree_leaf_init()
147 atomic_store_p(elmp, leaf, ATOMIC_RELEASE); in rtree_leaf_init()
151 return leaf; in rtree_leaf_init()
[all …]
/freebsd-src/contrib/llvm-project/clang/lib/Tooling/Syntax/
H A DNodes.cpp204 syntax::Leaf *syntax::UnaryOperatorExpression::getOperatorToken() { in getOperatorToken()
205 return cast_or_null<syntax::Leaf>(findChild(syntax::NodeRole::OperatorToken)); in getOperatorToken()
212 syntax::Leaf *syntax::BinaryOperatorExpression::getOperatorToken() { in getOperatorToken()
213 return cast_or_null<syntax::Leaf>(findChild(syntax::NodeRole::OperatorToken)); in getOperatorToken()
221 syntax::Leaf *syntax::SwitchStatement::getSwitchKeyword() { in getSwitchKeyword()
222 return cast_or_null<syntax::Leaf>( in getSwitchKeyword()
231 syntax::Leaf *syntax::CaseStatement::getCaseKeyword() { in getCaseKeyword()
232 return cast_or_null<syntax::Leaf>( in getCaseKeyword()
246 syntax::Leaf *syntax::DefaultStatement::getDefaultKeyword() { in getDefaultKeyword()
247 return cast_or_null<syntax::Leaf>( in getDefaultKeyword()
[all …]
H A DTree.cpp35 syntax::Leaf::Leaf(syntax::TokenManager::Key K) : Node(NodeKind::Leaf), K(K) {} in Leaf() function in syntax::Leaf
186 if (const auto *L = dyn_cast<syntax::Leaf>(N)) { in dumpNode()
231 if (const auto *L = dyn_cast<syntax::Leaf>(N)) { in dumpTokens()
268 assert(isa<Leaf>(C)); in assertInvariants()
269 // FIXME: re-enable it when there is way to retrieve token kind in Leaf. in assertInvariants()
270 // assert(cast<Leaf>(C).getToken()->kind() == L->getDelimiterTokenKind()); in assertInvariants()
283 const syntax::Leaf *syntax::Tree::findFirstLeaf() const { in findFirstLeaf()
285 if (const auto *L = dyn_cast<syntax::Leaf>(&C)) in findFirstLeaf()
293 const syntax::Leaf *syntax::Tree::findLastLeaf() const { in findLastLeaf()
295 if (const auto *L = dyn_cast<syntax::Leaf>(C)) in findLastLeaf()
[all …]
/freebsd-src/lib/libc/stdlib/
H A Dtdelete.c38 if ((*leaf)->balance == 0 || \
39 ((*leaf)->balance < 0 && (*leaf)->rlink->balance == 0)) { \
48 rootp = leaf; \
52 leaf = &(*leaf)->llink; \
57 if ((*leaf)->balance == 0 || \
58 ((*leaf)->balance > 0 && (*leaf)->llink->balance == 0)) { \
59 rootp = leaf; \
63 leaf = &(*leaf)->rlink; \
71 posix_tnode **leaf, *old, **n, *x, *y, *z, *result; in tdelete() local
79 * Find the leaf that needs to be removed. Return if we cannot in tdelete()
[all …]
H A Dtsearch.c37 posix_tnode **leaf, *result, *n, *x, *y, *z; in tsearch() local
45 * Find the leaf where the new key needs to be inserted. Return in tsearch()
51 leaf = rootp; in tsearch()
52 while (*leaf != NULL) { in tsearch()
53 if ((*leaf)->balance != 0) { in tsearch()
62 rootp = leaf; in tsearch()
65 cmp = compar(key, (*leaf)->key); in tsearch()
68 leaf = &(*leaf)->llink; in tsearch()
71 leaf = &(*leaf)->rlink; in tsearch()
73 return (*leaf); in tsearch()
[all …]
/freebsd-src/sys/contrib/xen/arch-x86/
H A Dcpuid.h46 * Leaf 1 (0x40000x00)
47 * EAX: Largest Xen-information leaf. All leaves up to an including @EAX
57 * Leaf 2 (0x40000x01)
64 * Leaf 3 (0x40000x02)
77 * Leaf 4 (0x40000x03)
78 * Sub-leaf 0: EAX: bit 0: emulated tsc
85 * Sub-leaf 1: EAX: tsc offset low part
89 * Sub-leaf 2: EAX: host tsc frequency in kHz
93 * Leaf 5 (0x40000x04)
95 * Sub-leaf 0: EAX: Features
[all …]
/freebsd-src/sys/contrib/openzfs/module/zfs/
H A Dbtree.c101 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)hdr; in zfs_btree_poison_node() local
102 (void) memset(leaf->btl_elems, 0x0f, hdr->bth_first * size); in zfs_btree_poison_node()
103 (void) memset(leaf->btl_elems + in zfs_btree_poison_node()
130 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)hdr; in zfs_btree_poison_node_at() local
131 (void) memset(leaf->btl_elems + in zfs_btree_poison_node_at()
152 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)hdr; in zfs_btree_verify_poison_at() local
156 VERIFY3U(leaf->btl_elems[(hdr->bth_first + idx) in zfs_btree_verify_poison_at()
273 * and the last leaf in the tree before doing the normal search, in zfs_btree_find()
311 * element in the last leaf, it's in the last leaf o in zfs_btree_find()
356 zfs_btree_leaf_t *leaf = (depth == 0 ? zfs_btree_find() local
498 bt_grow_leaf(zfs_btree_t * tree,zfs_btree_leaf_t * leaf,uint32_t idx,uint32_t n) bt_grow_leaf() argument
533 bt_shrink_leaf(zfs_btree_t * tree,zfs_btree_leaf_t * leaf,uint32_t idx,uint32_t n) bt_shrink_leaf() argument
603 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)node; zfs_btree_first_helper() local
790 zfs_btree_insert_leaf_impl(zfs_btree_t * tree,zfs_btree_leaf_t * leaf,uint32_t idx,const void * value) zfs_btree_insert_leaf_impl() argument
812 zfs_btree_insert_into_leaf(zfs_btree_t * tree,zfs_btree_leaf_t * leaf,const void * value,uint32_t idx) zfs_btree_insert_into_leaf() argument
930 zfs_btree_leaf_t *leaf = tree->bt_bulk; zfs_btree_bulk_finish() local
1116 zfs_btree_leaf_t *leaf = zfs_btree_leaf_alloc(tree); zfs_btree_add_idx() local
1201 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)node; zfs_btree_last_helper() local
1252 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)idx->bti_node; zfs_btree_next_helper() local
1339 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)idx->bti_node; zfs_btree_prev() local
1392 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)idx->bti_node; zfs_btree_get() local
1702 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)hdr; zfs_btree_remove_idx() local
2070 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)hdr; zfs_btree_verify_order_helper() local
2151 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)hdr; zfs_btree_verify_poison_helper() local
[all...]
H A Dmmp.c107 * enough time for a write to be attempted to each leaf vdev, and mmp_delay
154 * On average an mmp write will be issued for each leaf vdev every
183 * if it was set to 2, because a single leaf vdev pool will issue a write once
272 * Find a leaf vdev to write an MMP block to. It must not have an outstanding
274 * leaf, a nonzero error value is returned. The error value returned is a bit
277 * MMP_FAIL_WRITE_PENDING One or more leaf vdevs are writeable, but have an
279 * MMP_FAIL_NOT_WRITABLE One or more leaf vdevs are not writeable.
285 vdev_t *leaf; in mmp_next_leaf() local
299 leaf = spa->spa_mmp.mmp_last_leaf; in mmp_next_leaf()
300 if (leaf in mmp_next_leaf()
[all...]
/freebsd-src/sys/contrib/openzfs/tests/zfs-tests/tests/functional/vdev_zaps/
H A Dvdev_zaps_004_pos.ksh23 # 1. Create a pool with one disk. Verify that it has a top and leaf ZAP.
25 # 3. Verify that top-level and leaf-level ZAPs were transferred properly.
26 # 4. Verify that the newly-attached disk has a leaf ZAP.
28 # 6. Verify that top-level and leaf-level ZAPs were transferred properly.
63 # Ensure leaf ZAP of original disk was transferred successfully.
66 log_fail "$DISK used to have leaf-level ZAP $orig_leaf, now has "\
71 [[ -n "$dsk1_top" ]] && log_fail "$DISK has top-level ZAP, but is only leaf."
73 # Ensure attached disk got a leaf-level ZAP but not a top-level ZAP.
77 [[ -z "$dsk2_leaf" ]] && log_fail "Attached disk $disk2 has no leaf ZAP."
92 # Make sure leaf ZAP was successfully transferred.
[all …]
/freebsd-src/contrib/llvm-project/clang/lib/Headers/
H A Dcpuid.h75 /* Features in %ecx for leaf 1 */
110 /* Features in %edx for leaf 1 */
143 /* Features in %ebx for leaf 7 sub-leaf 0 */
169 /* Features in %ecx for leaf 7 sub-leaf 0 */
189 /* Features in %edx for leaf 7 sub-leaf 0 */
202 /* Features in %eax for leaf 7 sub-leaf
[all...]
/freebsd-src/contrib/kyua/utils/config/
H A Dnodes.hpp57 /// to the dynamic nature of our trees (each leaf being able to hold arbitrary
84 /// Abstract leaf node without any specified type.
87 /// to cast any leaf. We later provide templated derivates of this class, and
90 /// It is important to understand that a leaf can exist without actually holding
113 /// Base leaf node for a single arbitrary type.
115 /// This templated leaf node holds a single object of any type. The conversion
125 /// Constructs a new leaf node that contains no value.
149 /// Leaf node holding a native type.
151 /// This templated leaf node holds a native type. The conversion to/from string
161 /// A leaf node that holds a boolean value.
[all …]
H A Dtree.ipp52 /// \tparam LeafType The node type of the leaf we are defining.
68 /// Gets a read-only reference to the value of a leaf addressed by its key.
70 /// \tparam LeafType The node type of the leaf we are querying.
73 /// \return A reference to the value in the located leaf, if successful.
95 /// Gets a read-write reference to the value of a leaf addressed by its key.
97 /// \tparam LeafType The node type of the leaf we are querying.
100 /// \return A reference to the value in the located leaf, if successful.
123 /// Sets the value of a leaf addressed by its key.
125 /// \tparam LeafType The node type of the leaf we are setting.
/freebsd-src/contrib/jemalloc/include/jemalloc/internal/
H A Drtree.h33 /* Use compact leaf representation if virtual address encoding allows. */
43 atomic_p_t child; /* (rtree_{node,leaf}_elm_t *) */
49 * Single pointer-width field containing all three leaf element fields.
93 * number of levels, place one remainder bit per level starting at the leaf
338 rtree_leaf_elm_t *leaf = rtree_ctx->cache[slot].leaf; in rtree_leaf_elm_lookup() local
339 assert(leaf != NULL); in rtree_leaf_elm_lookup()
341 return &leaf[subkey]; in rtree_leaf_elm_lookup()
349 rtree_leaf_elm_t *leaf = rtree_ctx->l2_cache[i].leaf; \ in rtree_leaf_elm_lookup()
350 assert(leaf != NULL); \ in rtree_leaf_elm_lookup()
355 rtree_ctx->l2_cache[i].leaf = \ in rtree_leaf_elm_lookup()
[all …]
/freebsd-src/usr.sbin/makefs/zfs/
H A Dzap.c232 * Write some data to the fat ZAP leaf chunk starting at index "li".
259 * overflowing a leaf block. This is not (space) optimal, but is simple, and
260 * directories large enough to overflow a single 128KB leaf block are uncommon.
270 * All chunks will fit in a single leaf block. in zap_fat_write_prefixlen()
314 * Initialize a fat ZAP leaf block.
319 zap_leaf_phys_t *leaf; in zap_fat_write_leaf_init() local
321 leaf = l->l_phys; in zap_fat_write_leaf_init()
323 leaf->l_hdr.lh_block_type = ZBT_LEAF; in zap_fat_write_leaf_init()
324 leaf->l_hdr.lh_magic = ZAP_LEAF_MAGIC; in zap_fat_write_leaf_init()
325 leaf->l_hdr.lh_nfree = ZAP_LEAF_NUMCHUNKS(l); in zap_fat_write_leaf_init()
[all …]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/ADT/
H A DIntervalMap.h199 // Both leaf and branch nodes store vectors of pairs.
215 // 8 4 16 0 Leaf<4,4>, Branch<4>
216 // 8 8 12 0 Leaf<4,8>, Branch<8>
217 // 16 4 9 12 Leaf<8,4>
218 // 16 8 8 0 Leaf<8,8>
441 // Compute the leaf node branching factor that makes a node fit in three
455 // Now that we have the leaf branching factor, compute the actual allocation
464 /// Allocator - The recycling allocator used for both branch and leaf nodes.
485 // A NodeRef doesn't know whether it references a leaf node or a branch node.
549 // Leaf nodes store up to N disjoint intervals with corresponding values.
[all …]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/IR/
H A DMetadata.def27 // Handler for leaf nodes in the class hierarchy.
32 // Handler for non-leaf nodes in the class hierarchy.
37 // Handler for specialized and uniquable leaf nodes under MDNode. Defers to
50 // Handler for leaf nodes under MDNode.
55 // Handler for leaf nodes under MDNode.
60 // Handler for non-leaf nodes under MDNode.
65 // Handler for specialized leaf nodes under MDNode.
70 // Handler for specialized non-leaf nodes under MDNode.
/freebsd-src/contrib/llvm-project/clang/include/clang/Tooling/Syntax/
H A DNodes.h159 Leaf *getOperatorToken();
203 Leaf *getOperatorToken();
242 Leaf *getSwitchKeyword();
251 Leaf *getCaseKeyword();
261 Leaf *getDefaultKeyword();
271 Leaf *getIfKeyword();
273 Leaf *getElseKeyword();
282 Leaf *getForKeyword();
291 Leaf *getWhileKeyword();
300 Leaf *getContinueKeyword();
[all …]
H A DTree.h9 // - leaf nodes correspond to tokens,
14 // preprocessing), the specific tokens coverered are stored in the leaf nodes of
15 // a tree. A post-order traversal of a tree will visit leaf nodes in an order
52 /// A node in a syntax tree. Each node is either a Leaf (representing tokens) or
130 /// A leaf node points to a single token.
132 class Leaf final : public Node {
134 Leaf(TokenManager::Key K);
184 const Leaf *findFirstLeaf() const;
185 Leaf *findFirstLeaf() { in findFirstLeaf()
186 return const_cast<Leaf *>(const_cast<const Tree *>(this)->findFirstLeaf()); in findFirstLeaf()
[all …]
/freebsd-src/sys/dev/irdma/
H A Dirdma_pble.c354 struct irdma_pble_info *leaf = lvl2->leaf; in free_lvl2() local
356 for (i = 0; i < lvl2->leaf_cnt; i++, leaf++) { in free_lvl2()
357 if (leaf->addr) in free_lvl2()
359 &leaf->chunkinfo); in free_lvl2()
368 lvl2->leaf = NULL; in free_lvl2()
385 struct irdma_pble_info *leaf; in get_lvl2_pble() local
395 lvl2->leafmem.size = (sizeof(*leaf) * total); in get_lvl2_pble()
400 lvl2->leaf = lvl2->leafmem.va; in get_lvl2_pble()
401 leaf = lvl2->leaf; in get_lvl2_pble()
406 lvl2->leaf = NULL; in get_lvl2_pble()
[all …]
/freebsd-src/contrib/libxo/encoder/csv/
H A Denc_csv.c30 * Data is then constrained to be sibling leaf values. In addition,
32 * the specific leaf names (to ensure consistency) and some
80 * - The leafs record the current set of leaf
81 * - A key from the parent list counts as a leaf (unless CF_NO_KEYS)
103 ssize_t f_name; /* Name of leaf; offset in c_name_buf */
104 ssize_t f_value; /* Value of leaf; offset in c_value_buf */
107 ssize_t f_depth; /* Depth of stack when leaf was recorded */
112 #define LF_KEY (1<<0) /* Leaf is a key */
133 xo_buffer_t c_name_buf; /* String buffer for leaf names */
134 xo_buffer_t c_value_buf; /* String buffer for leaf values */
[all …]
/freebsd-src/contrib/libxo/libxo/
H A Dxo_open_list.3133 .Sh LEAF LISTS
134 In contrast to a list of instances, a "leaf list" is list of simple
136 To emit a leaf list, call the
145 The name of the field must match the name of the leaf list.
147 In JSON, leaf lists are rendered as arrays of values. In XML, they
148 are rendered as multiple leaf elements.
/freebsd-src/crypto/openssl/include/crypto/
H A Dsparse_array.h47 void (*leaf)(ossl_uintmax_t, type *)) \
50 (void (*)(ossl_uintmax_t, void *))leaf); \
54 void (*leaf)(ossl_uintmax_t, type *, void *), \
58 (void (*)(ossl_uintmax_t, void *, void *))leaf, arg); \
83 void ossl_sa_doall(const OPENSSL_SA *sa, void (*leaf)(ossl_uintmax_t, void *));
85 void (*leaf)(ossl_uintmax_t, void *, void *), void *);
/freebsd-src/sys/contrib/device-tree/Bindings/clock/
H A Dbrcm,iproc-clocks.txt9 comprises of several leaf clocks
11 Required properties for a PLL and its leaf clocks:
18 Have a value of <1> since there are more than 1 leaf clock of a given PLL
89 PLL and leaf clock compatible strings for Cygnus are:
142 PLL and leaf clock compatible strings for Hurricane 2 are:
156 PLL and leaf clock compatible strings for Northstar and Northstar Plus are:
186 PLL and leaf clock compatible strings for Northstar 2 are:
234 PLL and leaf clock compatible strings for BCM63138 are:
239 PLL and leaf clock compatible strings for Stingray are:
/freebsd-src/sys/contrib/openzfs/tests/zfs-tests/tests/functional/mmp/
H A Dmmp_write_distribution.ksh28 # 4. Verify the MMP writes are distributed evenly across leaf vdevs
46 log_assert "mmp writes are evenly distributed across leaf vdevs"
63 # default settings, every leaf written once/second
88 log_fail "mmp writes were not evenly distributed across leaf vdevs"
91 log_pass "mmp writes were evenly distributed across leaf vdevs"
/freebsd-src/sys/kern/
H A Dsubr_blist.c40 * constant defines the size of the bitmaps contained in a leaf node
49 * For a leaf node, a bit is set if the corresponding block is free. For a
155 * number of leaf nodes of the subtree is L=radix/BLIST_RADIX. If 'm'
157 * leaf nodes, the total number of tree nodes is 1 + m + m**2 + ... + m**h,
201 * The smallest blist consists of a single leaf node capable of
221 * Include a sentinel node to ensure that cross-leaf scans stay within in blist_create()
538 * Scan leaf. in blist_stats()
576 * BLST_NEXT_LEAF_ALLOC() - allocate the blocks starting with the next leaf.
578 * 'scan' is a leaf node, and its first block is at address 'start'. The
579 * next leaf node could be adjacent, or several nodes away if the least
[all …]

12345678910>>...28