Home
last modified time | relevance | path

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

12345

/freebsd-13.1/lib/libc/stdlib/
H A Dtdelete.c42 ((*leaf)->balance < 0 && (*leaf)->rlink->balance == 0)) { \
51 rootp = leaf; \
55 leaf = &(*leaf)->llink; \
61 ((*leaf)->balance > 0 && (*leaf)->llink->balance == 0)) { \
66 leaf = &(*leaf)->rlink; \
89 leaf = rootp; in tdelete()
91 if (*leaf == NULL) in tdelete()
95 result = *leaf; in tdelete()
98 result = *leaf; in tdelete()
108 old = *leaf; in tdelete()
[all …]
H A Dtsearch.c40 posix_tnode **leaf, *result, *n, *x, *y, *z; in tsearch() local
54 leaf = rootp; in tsearch()
55 while (*leaf != NULL) { in tsearch()
56 if ((*leaf)->balance != 0) { in tsearch()
65 rootp = leaf; in tsearch()
68 cmp = compar(key, (*leaf)->key); in tsearch()
71 leaf = &(*leaf)->llink; in tsearch()
74 leaf = &(*leaf)->rlink; in tsearch()
76 return (*leaf); in tsearch()
81 result = *leaf = malloc(sizeof(**leaf)); in tsearch()
[all …]
/freebsd-13.1/contrib/jemalloc/src/
H A Drtree.c81 if (leaf != NULL) { in rtree_delete_subtree()
136 if (leaf == NULL) { in rtree_leaf_init()
139 if (leaf == NULL) { in rtree_leaf_init()
151 return leaf; in rtree_leaf_init()
195 rtree_leaf_elm_t *leaf; in rtree_child_leaf_tryread() local
206 return leaf; in rtree_child_leaf_tryread()
219 return leaf; in rtree_child_leaf_read()
230 leaf = rtree->root; in rtree_leaf_elm_lookup_hard()
287 rtree_ctx->cache[slot].leaf = leaf; \ in rtree_leaf_elm_lookup_hard()
313 cache->leaf = NULL; in rtree_ctx_data_init()
[all …]
/freebsd-13.1/sys/contrib/openzfs/module/zfs/
H A Dbtree.c297 zfs_btree_leaf_t *leaf = (depth == 0 ? in zfs_btree_find() local
500 return (&leaf->btl_elems[0]); in zfs_btree_first_helper()
686 zfs_btree_hdr_t *hdr = &leaf->btl_hdr; in zfs_btree_insert_leaf_impl()
694 leaf->btl_hdr.bth_count); in zfs_btree_insert_leaf_impl()
747 leaf->btl_hdr.bth_count = keep_count; in zfs_btree_insert_into_leaf()
822 zfs_btree_hdr_t *hdr = &leaf->btl_hdr; in zfs_btree_bulk_finish()
866 leaf->btl_hdr.bth_count + i); in zfs_btree_bulk_finish()
1011 tree->bt_root = &leaf->btl_hdr; in zfs_btree_add_idx()
1021 tree->bt_bulk = leaf; in zfs_btree_add_idx()
1148 out_idx->bti_node = &leaf->btl_hdr; in zfs_btree_next_helper()
[all …]
H A Dmmp.c286 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()
302 leaf = list_head(&spa->spa_leaf_list); in mmp_next_leaf()
303 starting_leaf = leaf; in mmp_next_leaf()
306 leaf = list_next(&spa->spa_leaf_list, leaf); in mmp_next_leaf()
307 if (leaf == NULL) in mmp_next_leaf()
316 if (!vdev_writeable(leaf) || leaf->vdev_offline || in mmp_next_leaf()
317 leaf->vdev_detached) { in mmp_next_leaf()
324 spa->spa_mmp.mmp_last_leaf = leaf; in mmp_next_leaf()
[all …]
/freebsd-13.1/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()
368 rtree_ctx->cache[slot].leaf = leaf; \ in rtree_leaf_elm_lookup()
370 return &leaf[subkey]; \ in rtree_leaf_elm_lookup()
472 rtree_leaf_elm_t *leaf = rtree_ctx->cache[slot].leaf; in rtree_szind_slab_read_fast() local
473 assert(leaf != NULL); in rtree_szind_slab_read_fast()
[all …]
/freebsd-13.1/contrib/ncurses/ncurses/tinfo/
H A Daccess.c120 char *leaf; in _nc_access() local
123 leaf = _nc_basename(head); in _nc_access()
124 if (leaf == 0) in _nc_access()
125 leaf = head; in _nc_access()
126 *leaf = '\0'; in _nc_access()
127 if (head == leaf) in _nc_access()
/freebsd-13.1/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-13.1/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-13.1/contrib/dialog/
H A Dfselect.c109 if (leaf != 0) in leaf_of()
110 leaf++; in leaf_of()
112 leaf = path; in leaf_of()
113 return leaf; in leaf_of()
308 char *leaf = leaf_of(input); in show_both_lists() local
310 return show_list(leaf, d_list, keep) || show_list(leaf, f_list, keep); in show_both_lists()
441 char *leaf; in fill_lists() local
473 *++leaf = 0; in fill_lists()
485 leaf[len] = '\0'; in fill_lists()
488 add_to_list(d_list, leaf); in fill_lists()
[all …]
/freebsd-13.1/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-13.1/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-13.1/sys/x86/iommu/
H A Dintel_idpgtbl.c88 int leaf; /* The last materialized page table member
127 if (lvl != tbl->leaf) { in domain_idmap_nextlvl()
133 if (lvl == tbl->leaf) { in domain_idmap_nextlvl()
171 int leaf, i; in domain_get_idmap_pgtbl() local
173 leaf = 0; /* silence gcc */ in domain_get_idmap_pgtbl()
180 leaf = i; in domain_get_idmap_pgtbl()
197 tbl->leaf == leaf) { in domain_get_idmap_pgtbl()
216 tbl->leaf == leaf) { in domain_get_idmap_pgtbl()
230 tbl->leaf = leaf; in domain_get_idmap_pgtbl()
/freebsd-13.1/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-13.1/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-13.1/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-13.1/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-13.1/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-13.1/contrib/libucl/tests/basic/
H A D3.res10 leaf = "query -e '%a == 0' '%n-%v'";
11 leaf = "query -e '%a == 0' '%n-%v'";
H A D3.in16 leaf: query -e '%a == 0' '%n-%v',
17 leaf: query -e '%a == 0' '%n-%v',
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/DebugInfo/CodeView/
H A DCodeViewTypes.def1 //===-- CodeViewTypes.def - All CodeView leaf types -------------*- C++ -*-===//
77 // ID leaf records. Subsequent leaf types may be referenced from .debug$S.
196 // ID leaf records. Subsequent leaf types may be referenced from .debug$S.
198 // Numeric leaf types. These are generally contained in other records, and not
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/ADT/
H A DIntervalMap.h807 template <typename NodeT> NodeT &leaf() const { in leaf() function
1386 return &path.template leaf<Leaf>() == &RHS.path.template leaf<Leaf>();
1624 RootLeaf &Node = P.leaf<RootLeaf>(); in canCoalesceLeft()
1630 Leaf &Node = P.leaf<Leaf>(); in canCoalesceLeft()
1654 RootLeaf &Node = P.leaf<RootLeaf>(); in canCoalesceRight()
1659 Leaf &Node = P.leaf<Leaf>(); in canCoalesceRight()
1832 Leaf &CurLeaf = P.leaf<Leaf>(); in treeInsert()
1855 Size = P.leaf<Leaf>().insertFrom(P.leafOffset(), Size, a, b, y); in treeInsert()
1892 Leaf &Node = P.leaf<Leaf>(); in treeErase()
1900 IM.rootBranchStart() = P.leaf<Leaf>().start(0); in treeErase()
[all …]
/freebsd-13.1/contrib/processor-trace/libipt/src/
H A Dpt_packet.c290 uint8_t payload, mode, leaf; in pt_pkt_read_mode() local
299 leaf = payload & pt_mom_leaf; in pt_pkt_read_mode()
302 packet->leaf = (enum pt_mode_leaf) leaf; in pt_pkt_read_mode()
303 switch (leaf) { in pt_pkt_read_mode()
/freebsd-13.1/contrib/libcxxrt/
H A Ddynamic_cast.cc208 void *leaf = ADD_TO_PTR(const_cast<void *>(sub), header->leaf_offset); in __dynamic_cast() local
209 return header->type->cast_to(leaf, dst); in __dynamic_cast()
/freebsd-13.1/sys/contrib/device-tree/Bindings/cpu/
H A Dcpu-topology.txt112 A socket node can not be a leaf node.
126 A cluster node can not be a leaf node.
139 nodes are leaf nodes, otherwise they become containers of
144 A core node must be a leaf node if SMT is not supported.
146 Properties for core nodes that are leaf nodes:
154 If a core node is not a leaf node (CPUs supporting SMT) a core node's
165 always leaf nodes in the device tree.
169 A thread node must be a leaf node.

12345