Home
last modified time | relevance | path

Searched refs:leaf (Results 1 – 25 of 143) sorted by relevance

123456

/freebsd/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
86 leaf = rootp; in tdelete()
[all …]
H A Dtsearch.c37 posix_tnode **leaf, *result, *n, *x, *y, *z; in tsearch() local
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()
78 result = *leaf = malloc(sizeof(**leaf)); in tsearch()
[all …]
/freebsd/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/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()
356 zfs_btree_leaf_t *leaf = (depth == 0 ? in zfs_btree_find() local
358 void *d = tree->bt_find_in_buf(tree, leaf->btl_elems + in zfs_btree_find()
359 leaf->btl_hdr.bth_first * size, in zfs_btree_find()
[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/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/contrib/jemalloc/include/jemalloc/internal/
H A Drtree.h338 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()
356 rtree_ctx->l2_cache[i - 1].leaf; \ in rtree_leaf_elm_lookup()
359 rtree_ctx->l2_cache[i - 1].leaf = \ in rtree_leaf_elm_lookup()
360 rtree_ctx->cache[slot].leaf; \ in rtree_leaf_elm_lookup()
364 rtree_ctx->l2_cache[0].leaf = \ in rtree_leaf_elm_lookup()
[all …]
/freebsd/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/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/crypto/openssl/crypto/
H A Dsparse_array.c66 void (*leaf)(ossl_uintmax_t, void *, void *), void *arg) in sa_doall()
92 } else if (leaf != NULL) { in sa_doall()
93 (*leaf)(idx, p[n], arg); in sa_doall()
134 void ossl_sa_doall(const OPENSSL_SA *sa, void (*leaf)(ossl_uintmax_t, void *)) in ossl_sa_doall()
138 tramp.func = leaf; in ossl_sa_doall()
144 void (*leaf)(ossl_uintmax_t, void *, void *), in ossl_sa_doall_arg()
148 sa_doall(sa, NULL, leaf, arg); in ossl_sa_doall_arg()
/freebsd/contrib/ncurses/ncurses/tinfo/
H A Daccess.c141 char *leaf; in _nc_access() local
144 leaf = _nc_basename(head); in _nc_access()
145 if (leaf == 0) in _nc_access()
146 leaf = head; in _nc_access()
147 *leaf = '\0'; in _nc_access()
148 if (head == leaf) in _nc_access()
/freebsd/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_mutex.cpp74 bool leaf[kMutexTypeMax]; in DebugMutexInit() local
75 internal_memset(&leaf, 0, sizeof(leaf)); in DebugMutexInit()
88 CHECK(!leaf[t]); in DebugMutexInit()
89 leaf[t] = true; in DebugMutexInit()
106 if (!leaf[t]) in DebugMutexInit()
110 if (z == MutexInvalid || t == z || leaf[z]) in DebugMutexInit()
/freebsd/contrib/llvm-project/llvm/include/llvm/Frontend/OpenMP/
H A DConstructDecompositionT.h109 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()
394 for (auto &leaf : range) { in applyToFirst()
395 if (!llvm::omp::isAllowedClauseForDirective(leaf.id, node->id, version)) in applyToFirst()
397 leaf.clauses.push_back(node); in applyToFirst()
422 for (auto &leaf : leafs) { in applyIf()
[all …]
/freebsd/contrib/kyua/utils/config/
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/contrib/dialog/
H A Dfselect.c108 char *leaf = strrchr(path, '/'); in leaf_of() local
109 if (leaf != 0) in leaf_of()
110 leaf++; in leaf_of()
112 leaf = path; in leaf_of()
113 return leaf; in leaf_of()
315 char *leaf = leaf_of(input); in show_both_lists() local
317 return show_list(leaf, d_list, keep) || show_list(leaf, f_list, keep); in show_both_lists()
479 char *leaf; in fill_lists() local
491 if ((leaf = strrchr(path, '/')) != 0) { in fill_lists()
492 *++leaf = 0; in fill_lists()
[all …]
/freebsd/usr.sbin/makefs/zfs/
H A Dzap.c319 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()
326 leaf->l_hdr.lh_prefix = prefix; in zap_fat_write_leaf_init()
327 leaf->l_hdr.lh_prefix_len = prefixlen; in zap_fat_write_leaf_init()
330 assert(leaf->l_hdr.lh_nfree < 0xffff); in zap_fat_write_leaf_init()
331 memset(leaf->l_hash, 0xff, in zap_fat_write_leaf_init()
332 ZAP_LEAF_HASH_NUMENTRIES(l) * sizeof(*leaf->l_hash)); in zap_fat_write_leaf_init()
/freebsd/sys/x86/iommu/
H A Dintel_idpgtbl.c89 int leaf; /* The last materialized page table member
128 if (lvl != tbl->leaf) { in dmar_idmap_nextlvl()
134 if (lvl == tbl->leaf) { in dmar_idmap_nextlvl()
172 int leaf, i; in dmar_get_idmap_pgtbl() local
174 leaf = 0; /* silence gcc */ in dmar_get_idmap_pgtbl()
181 leaf = i; in dmar_get_idmap_pgtbl()
198 tbl->leaf == leaf) { in dmar_get_idmap_pgtbl()
217 tbl->leaf == leaf) { in dmar_get_idmap_pgtbl()
231 tbl->leaf = leaf; in dmar_get_idmap_pgtbl()
/freebsd/contrib/processor-trace/libipt/src/posix/
H A Dpt_cpuid.c33 extern void pt_cpuid(uint32_t leaf, uint32_t *eax, uint32_t *ebx, in pt_cpuid() argument
36 __get_cpuid(leaf, eax, ebx, ecx, edx); in pt_cpuid()
/freebsd/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/contrib/processor-trace/libipt/src/windows/
H A Dpt_cpuid.c33 extern void pt_cpuid(uint32_t leaf, uint32_t *eax, uint32_t *ebx, in pt_cpuid() argument
38 __cpuid(cpu_info, leaf); in pt_cpuid()
/freebsd/contrib/bmake/unit-tests/
H A Ddepsrc-optional.mk15 : An optional leaf node is not executed.
19 : A leaf node using '::' is considered out-of-date.
/freebsd/sys/contrib/device-tree/Bindings/sound/
H A Dbrcm,cygnus-audio.txt12 - clocks: PLL and leaf clocks used by audio ports
13 - assigned-clocks: PLL and leaf clocks
18 - clock-names: names of 3 leaf clocks used by audio ports
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DIntervalMap.h199 // Both leaf and branch nodes store vectors of pairs.
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.
696 // When all of the leaf nodes from all the subtrees are concatenated, they must
697 // satisfy the same constraints as a single leaf node. They must be sorted,
792 /// path - The path entries, path[0] is the root node, path.back() is a leaf.
805 template <typename NodeT> NodeT &leaf() const { in leaf() function
970 RootLeaf leaf; member
[all...]
/freebsd/contrib/libxo/doc/
H A Dencoders.rst32 df --libxo encoder=csv+path=filesystem+leaf=name+no-header
33 df --libxo encoder=csv:path=filesystem:leaf=name:no-header
39 leaf=name
97 The CSV encoder will emit the leaf values in this output as `fields`
154 instances. If the first instance is missing a leaf that is desired by
155 the consumer, the "leaf" option can be used to ensure that an empty
156 value is recorded for instances that lack a particular leaf.
168 The value of the leafs option should be one or more leaf names,
184 as the plural form of "leaf". libxo follows that convention.
/freebsd/crypto/openssl/doc/internal/man3/
H A DOPENSSL_SA.pod23 void ossl_sa_TYPE_doall(const OPENSSL_SA *sa, void (*leaf)(ossl_uintmax_t,
26 void (*leaf)(ossl_uintmax_t, void *, void *),
69 B<ossl_sa_I<TYPE>_doall>() calls the function I<leaf> for each element in I<sa>
71 of each item is passed as the first argument to the leaf function and a
74 B<ossl_sa_I<TYPE>_doall_arg>() calls the function I<leaf> for each element in
76 array, of each item is passed as the first argument to the leaf function,

123456