Home
last modified time | relevance | path

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

1234567

/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.c76 rtree_leaf_elm_t *leaf = atomic_load_p(elmp, ATOMIC_RELAXED); in rtree_delete_subtree()
77 if (leaf == NULL) { in rtree_delete_subtree()
78 leaf = rtree_leaf_alloc(tsdn, rtree, ZU(1) << in rtree_delete_subtree() local
80 if (leaf == NULL) { in rtree_delete_subtree()
88 atomic_store_p(elmp, leaf, ATOMIC_RELEASE); in rtree_delete_subtree()
92 return leaf;
101 rtree_leaf_valid(rtree_leaf_elm_t *leaf) {
102 return ((uintptr_t)leaf != (uintptr_t)0); in rtree_node_init()
136 rtree_leaf_elm_t *leaf; in rtree_leaf_init()
139 leaf in rtree_leaf_init()
53 rtree_leaf_dalloc_impl(tsdn_t * tsdn,rtree_t * rtree,rtree_leaf_elm_t * leaf) rtree_leaf_dalloc_impl() argument
135 rtree_leaf_elm_t *leaf = atomic_load_p(elmp, ATOMIC_RELAXED); rtree_leaf_init() local
160 rtree_leaf_valid(rtree_leaf_elm_t * leaf) rtree_leaf_valid() argument
195 rtree_leaf_elm_t *leaf; rtree_child_leaf_tryread() local
212 rtree_leaf_elm_t *leaf; rtree_child_leaf_read() local
226 rtree_leaf_elm_t *leaf; rtree_leaf_elm_lookup_hard() local
[all...]
/freebsd/contrib/llvm-project/libc/src/__support/
H A Dfreetrie.cpp22 Node *leaf = node; in remove() local
23 while (leaf->lower || leaf->upper) in remove()
24 leaf = leaf->lower ? leaf->lower : leaf->upper; in remove()
25 if (leaf == node) { in remove()
31 replace_node(leaf, nullptr); in remove()
32 new_node = leaf; in remove()
/freebsd/sys/contrib/openzfs/module/zfs/
H A Dbtree.c106 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)hdr; in zfs_btree_poison_node() local
107 (void) memset(leaf->btl_elems, 0x0f, hdr->bth_first * size); in zfs_btree_poison_node()
108 (void) memset(leaf->btl_elems + in zfs_btree_poison_node()
137 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)hdr; in zfs_btree_poison_node_at() local
138 (void) memset(leaf->btl_elems + in zfs_btree_poison_node_at()
161 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)hdr; in zfs_btree_verify_poison_at() local
165 VERIFY3U(leaf->btl_elems[(hdr->bth_first + idx) in zfs_btree_verify_poison_at()
370 zfs_btree_leaf_t *leaf = (depth == 0 ? in zfs_btree_find() local
372 void *d = tree->bt_find_in_buf(tree, leaf->btl_elems + in zfs_btree_find()
373 leaf->btl_hdr.bth_first * size, in zfs_btree_find()
[all …]
H A Dmmp.c295 vdev_t *leaf; in mmp_next_leaf() local
309 leaf = spa->spa_mmp.mmp_last_leaf; in mmp_next_leaf()
310 if (leaf == NULL) in mmp_next_leaf()
311 leaf = list_head(&spa->spa_leaf_list); in mmp_next_leaf()
312 starting_leaf = leaf; in mmp_next_leaf()
315 leaf = list_next(&spa->spa_leaf_list, leaf); in mmp_next_leaf()
316 if (leaf == NULL) { in mmp_next_leaf()
317 leaf = list_head(&spa->spa_leaf_list); in mmp_next_leaf()
318 ASSERT3P(leaf, !=, NULL); in mmp_next_leaf()
327 if (!vdev_writeable(leaf) || leaf->vdev_offline || 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.h33 /* Use compact leaf representation if virtual address encoding allows. */
40 atomic_p_t child; /* (rtree_{node,leaf}_elm_t *) */
64 * Single pointer-width field containing all three leaf element fields.
113 * number of levels, place one remainder bit per level starting at the leaf
348 rtree_leaf_elm_t *leaf = rtree_ctx->cache[slot].leaf; in rtree_leaf_elm_lookup()
349 assert(leaf != NULL); in rtree_leaf_elm_lookup()
351 *elm = &leaf[subkey]; in rtree_leaf_elm_lookup()
368 rtree_leaf_elm_t *leaf = rtree_ctx->cache[slot].leaf; in rtree_leaf_elm_lookup()
338 rtree_leaf_elm_t *leaf = rtree_ctx->cache[slot].leaf; rtree_leaf_elm_lookup() local
472 rtree_leaf_elm_t *leaf = rtree_ctx->cache[slot].leaf; rtree_szind_slab_read_fast() local
[all...]
/freebsd/crypto/openssl/include/crypto/
H A Dsparse_array.h46 …void (*leaf)(ossl_uintmax_t, type *)) …
49 …(void (*)(ossl_uintmax_t, void *))leaf); …
53 …void (*leaf)(ossl_uintmax_t, type *, void *), …
57 …(void (*)(ossl_uintmax_t, void *, void *))leaf, arg); …
81 void ossl_sa_doall(const OPENSSL_SA *sa, void (*leaf)(ossl_uintmax_t, void *));
83 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/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()
379 auto unique = detail::find_unique(leafs, [=](const auto &leaf) { in applyToUnique()
380 return llvm::omp::isAllowedClauseForDirective(leaf.id, node->id, version); in applyToUnique()
399 for (auto &leaf : range) { in applyToFirst()
400 if (!llvm::omp::isAllowedClauseForDirective(leaf.id, node->id, version)) in applyToFirst()
402 leaf.clauses.push_back(node); in applyToFirst()
427 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.c327 zap_leaf_phys_t *leaf; in zap_fat_write_leaf_init() local
329 leaf = l->l_phys; in zap_fat_write_leaf_init()
331 leaf->l_hdr.lh_block_type = ZBT_LEAF; in zap_fat_write_leaf_init()
332 leaf->l_hdr.lh_magic = ZAP_LEAF_MAGIC; in zap_fat_write_leaf_init()
333 leaf->l_hdr.lh_nfree = ZAP_LEAF_NUMCHUNKS(l); in zap_fat_write_leaf_init()
334 leaf->l_hdr.lh_prefix = prefix; in zap_fat_write_leaf_init()
335 leaf->l_hdr.lh_prefix_len = prefixlen; in zap_fat_write_leaf_init()
338 assert(leaf->l_hdr.lh_nfree < 0xffff); in zap_fat_write_leaf_init()
339 memset(leaf->l_hash, 0xff, in zap_fat_write_leaf_init()
340 ZAP_LEAF_HASH_NUMENTRIES(l) * sizeof(*leaf->l_hash)); in zap_fat_write_leaf_init()
/freebsd/contrib/ncurses/ncurses/tinfo/
H A Daccess.c249 char *leaf; in _nc_access() local
252 leaf = _nc_basename(head); in _nc_access()
253 if (leaf == NULL) in _nc_access()
254 leaf = head; in _nc_access()
255 *leaf = '\0'; in _nc_access()
256 if (head == leaf) in _nc_access()
/freebsd/sys/x86/iommu/
H A Dintel_idpgtbl.c90 int leaf; /* The last materialized page table member
129 if (lvl != tbl->leaf) { in dmar_idmap_nextlvl()
135 if (lvl == tbl->leaf) { in dmar_idmap_nextlvl()
174 int leaf, i; in dmar_get_idmap_pgtbl() local
176 leaf = 0; /* silence gcc */ in dmar_get_idmap_pgtbl()
183 leaf = i; in dmar_get_idmap_pgtbl()
200 tbl->leaf == leaf) { in dmar_get_idmap_pgtbl()
219 tbl->leaf == leaf) { in dmar_get_idmap_pgtbl()
233 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/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/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/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/netpfil/pf/
H A Dpf_ruleset.c193 char *leaf, *p; in pf_get_leaf_kruleset() local
201 leaf = p; in pf_get_leaf_kruleset()
203 leaf = strrchr(p, '/'); in pf_get_leaf_kruleset()
204 if (leaf != NULL) { in pf_get_leaf_kruleset()
205 *leaf = '\0'; in pf_get_leaf_kruleset()
209 leaf = path; in pf_get_leaf_kruleset()
219 *path_remainder = leaf; in pf_get_leaf_kruleset()
223 while (*leaf != '\0') in pf_get_leaf_kruleset()
224 leaf++; in pf_get_leaf_kruleset()
225 *leaf = '/'; in pf_get_leaf_kruleset()
/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.h806 template <typename NodeT> NodeT &leaf() const { in leaf() function
971 RootLeaf leaf; member
989 return leaf; in rootLeaf()
993 return leaf; in rootLeaf()
1384 return branched() ? path.leaf<Leaf>().start(path.leafOffset()) : in unsafeStart()
1385 path.leaf<RootLeaf>().start(path.leafOffset()); in unsafeStart()
1391 return branched() ? path.leaf<Leaf>().stop(path.leafOffset()) : in unsafeStop()
1392 path.leaf<RootLeaf>().stop(path.leafOffset()); in unsafeStop()
1398 return branched() ? path.leaf<Leaf>().value(path.leafOffset()) : in unsafeValue()
1399 path.leaf<RootLeaf>().value(path.leafOffset()); in unsafeValue()
[all …]

1234567