| /freebsd/contrib/llvm-project/clang/lib/Tooling/Syntax/ |
| H A D | Nodes.cpp | 204 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 …]
|
| /freebsd/contrib/jemalloc/src/ |
| H A D | rtree.c | 53 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/lib/libc/stdlib/ |
| H A D | tdelete.c | 38 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 D | tsearch.c | 37 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/contrib/llvm-project/llvm/utils/TableGen/GlobalISel/ |
| H A D | GIMatchTree.cpp | |
| /freebsd/sys/contrib/xen/arch-x86/ |
| H A D | cpuid.h | 46 * 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/sys/contrib/openzfs/module/zfs/ |
| H A D | btree.c | 102 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)hdr; in zfs_btree_poison_node() local
103 (void) memset(leaf->btl_elems, 0x0f, hdr->bth_first * size); in zfs_btree_poison_node()
104 (void) memset(leaf->btl_elems + in zfs_btree_poison_node()
131 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)hdr; in zfs_btree_poison_node_at() local
132 (void) memset(leaf->btl_elems + in zfs_btree_poison_node_at()
153 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)hdr; in zfs_btree_verify_poison_at() local
157 VERIFY3U(leaf->btl_elems[(hdr->bth_first + idx) in zfs_btree_verify_poison_at()
274 * and the last leaf in the tree before doing the normal search, in zfs_btree_find()
312 * element in the last leaf, it's in the last leaf or in zfs_btree_find()
354 * The value is in this leaf, or it would be if it were in the in zfs_btree_find()
[all …]
|
| H A D | mmp.c | 108 * enough time for a write to be attempted to each leaf vdev, and mmp_delay
155 * On average an mmp write will be issued for each leaf vdev every
184 * if it was set to 2, because a single leaf vdev pool will issue a write once
273 * Find a leaf vdev to write an MMP block to. It must not have an outstanding
275 * leaf, a nonzero error value is returned. The error value returned is a bit
278 * MMP_FAIL_WRITE_PENDING One or more leaf vdevs are writeable, but have an
280 * MMP_FAIL_NOT_WRITABLE One or more leaf vdevs are not writeable.
286 vdev_t *leaf; in mmp_next_leaf() local
300 leaf = spa->spa_mmp.mmp_last_leaf; in mmp_next_leaf()
301 if (leaf == NULL) in mmp_next_leaf()
[all …]
|
| /freebsd/contrib/llvm-project/clang/lib/Headers/ |
| H A D | cpuid.h | 75 /* 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 1 */
214 /* Features in %edx for leaf 7 sub-leaf 1 */
224 /* Features in %eax for leaf 13 sub-leaf 1 */
229 /* Features in %eax for leaf 0x14 sub-leaf 0 */
232 /* Features in %ecx for leaf 0x80000001 */
[all …]
|
| /freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/vdev_zaps/ |
| H A D | vdev_zaps_004_pos.ksh | 24 # 1. Create a pool with one disk. Verify that it has a top and leaf ZAP.
26 # 3. Verify that top-level and leaf-level ZAPs were transferred properly.
27 # 4. Verify that the newly-attached disk has a leaf ZAP.
29 # 6. Verify that top-level and leaf-level ZAPs were transferred properly.
64 # Ensure leaf ZAP of original disk was transferred successfully.
67 log_fail "$DISK used to have leaf-level ZAP $orig_leaf, now has "\
72 [[ -n "$dsk1_top" ]] && log_fail "$DISK has top-level ZAP, but is only leaf."
74 # Ensure attached disk got a leaf-level ZAP but not a top-level ZAP.
78 [[ -z "$dsk2_leaf" ]] && log_fail "Attached disk $disk2 has no leaf ZAP."
93 # Make sure leaf ZAP was successfully transferred.
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | SuffixTree.h | 12 // represents an entire substring rather than a single character. Each leaf
45 /// Whether to consider leaf descendants or only leaf children.
60 /// Maintains leaf nodes in the tree.
69 /// The end index of each leaf in the tree.
89 /// Allocate a leaf node and add it to the tree.
95 /// \returns A pointer to the allocated leaf node.
136 /// This vector contains all leaf nodes of this suffix tree. These leaf nodes
138 /// of these leaf nodes in the vector matches the order of the leaves in the
144 /// nodes in order of the traversal. The second is to keep track of the leaf
153 /// \param OutlinerLeafDescendants Whether to consider leaf descendants or
[all …]
|
| H A D | SuffixTreeNode.h | 22 // in \p Link. Each leaf node stores the start index of its respective
49 /// These two indices give a range of indices for its leaf descendants.
50 /// Imagine drawing a tree on paper and assigning a unique index to each leaf
52 /// numbering the leaf nodes allows us to associate a continuous range of
53 /// indices with each internal node. For example, if a node has leaf
70 /// \return the index of this node's left most leaf node.
73 /// \return the index of this node's right most leaf node.
76 /// Set the index of the left most leaf node of this node to \p Idx.
79 /// Set the index of the right most leaf node of this node to \p Idx.
101 /// Every leaf node must have its \p EndIdx incremented at the end of every
[all …]
|
| /freebsd/contrib/kyua/utils/config/ |
| H A D | nodes.hpp | 57 /// 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 D | tree.ipp | 52 /// \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/contrib/jemalloc/include/jemalloc/internal/ |
| H A D | rtree.h | 33 /* 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/usr.sbin/makefs/zfs/ |
| H A D | zap.c | 238 * Write some data to the fat ZAP leaf chunk starting at index "li".
265 * overflowing a leaf block. This is not (space) optimal, but is simple, and
266 * directories large enough to overflow a single 128KB leaf block are uncommon.
276 * All chunks will fit in a single leaf block. in zap_fat_write_prefixlen()
320 * Initialize a fat ZAP leaf block.
325 zap_leaf_phys_t *leaf; in zap_fat_write_leaf_init() local
327 leaf = l->l_phys; in zap_fat_write_leaf_init()
329 leaf->l_hdr.lh_block_type = ZBT_LEAF; in zap_fat_write_leaf_init()
330 leaf->l_hdr.lh_magic = ZAP_LEAF_MAGIC; in zap_fat_write_leaf_init()
331 leaf->l_hdr.lh_nfree = ZAP_LEAF_NUMCHUNKS(l); in zap_fat_write_leaf_init()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | IntervalMap.h | 199 // 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 node
805 template <typename NodeT> NodeT &leaf() const { leaf() function
938 using Leaf = IntervalMapImpl::LeafNode<KeyT, ValT, Sizer::LeafSize, Traits>; global() variable
970 RootLeaf leaf; global() member
[all...] |
| /freebsd/contrib/llvm-project/clang/include/clang/Tooling/Syntax/ |
| H A D | Nodes.h | 159 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 D | Tree.h | 9 // - 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/contrib/llvm-project/llvm/include/llvm/Frontend/OpenMP/ |
| H A D | ConstructDecompositionT.h | 9 // constituent leaf constructs, each with a list of clauses that apply to it.
14 // Note: Composite constructs will also be broken up into leaf constructs.
16 // for each leaf constituent should be merged.
105 // Copy the individual leaf directives with their clauses to the in ConstructDecompositionT()
109 for (auto &leaf : leafs) { in ConstructDecompositionT()
110 output.push_back({leaf.id, {}}); in ConstructDecompositionT()
112 for (const ClauseTy *c : leaf.clauses) in ConstructDecompositionT()
129 leafs, [&](const LeafReprInternal &leaf) { return leaf.id == dirId; }); in findDirective()
374 auto unique = detail::find_unique(leafs, [=](const auto &leaf) { in applyToUnique()
375 return llvm::omp::isAllowedClauseForDirective(leaf.id, node->id, version); in applyToUnique()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | Metadata.def | 27 // 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/sys/dev/irdma/ |
| H A D | irdma_pble.c | 354 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/contrib/libxo/encoder/csv/ |
| H A D | enc_csv.c | 30 * 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/contrib/llvm-project/llvm/lib/Support/ |
| H A D | SuffixTree.cpp | 48 // Set the suffix indices of each leaf. in SuffixTree()
52 // Collect all leaf nodes of the suffix tree. And for each internal node, in SuffixTree()
53 // record the range of leaf nodes that are descendants of it. in SuffixTree()
120 // This keeps track of the index of the next leaf node to be added to in setLeafNodes()
159 // the last one to be processed. Hence, the leaf descendants in setLeafNodes()
168 // The current node is a leaf node. in setLeafNodes()
197 // If not, then we can just insert a leaf and move to the next step. in extend()
249 // representing C, and insert a new leaf node l to represent d. This in extend()
250 // allows us to ensure that if n was a leaf, it remains a leaf. in extend()
302 // Each leaf node represents a repeat of a string. in advance()
[all …]
|
| /freebsd/contrib/libxo/libxo/ |
| H A D | xo_open_list.3 | 133 .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.
|