Searched refs:leaf (Results 1 - 25 of 82) sorted by relevance

1234

/freebsd-current/contrib/processor-trace/libipt/src/posix/
H A Dpt_cpuid.c33 extern void pt_cpuid(uint32_t leaf, uint32_t *eax, uint32_t *ebx, argument
36 __get_cpuid(leaf, eax, ebx, ecx, edx);
/freebsd-current/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; \
71 posix_tnode **leaf, *old, **n, *x, *y, *z, *result; local
[all...]
H A Dtsearch.c37 posix_tnode **leaf, *result, *n, *x, *y, *z; local
45 * Find the leaf where the new key needs to be inserted. Return
51 leaf = rootp;
52 while (*leaf != NULL) {
53 if ((*leaf)->balance != 0) {
62 rootp = leaf;
65 cmp = compar(key, (*leaf)->key);
68 leaf = &(*leaf)->llink;
71 leaf
[all...]
H A Dtwalk.c30 (*action)(root, leaf, level);
/freebsd-current/contrib/processor-trace/libipt/src/windows/
H A Dpt_cpuid.c33 extern void pt_cpuid(uint32_t leaf, uint32_t *eax, uint32_t *ebx, argument
38 __cpuid(cpu_info, leaf);
/freebsd-current/contrib/jemalloc/src/
H A Drtree.c53 rtree_leaf_dalloc_impl(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *leaf) { argument
78 rtree_leaf_elm_t *leaf = local
81 if (leaf != NULL) {
82 rtree_leaf_dalloc(tsdn, rtree, leaf);
135 rtree_leaf_elm_t *leaf = atomic_load_p(elmp, ATOMIC_RELAXED); local
136 if (leaf == NULL) {
137 leaf = rtree_leaf_alloc(tsdn, rtree, ZU(1) <<
139 if (leaf == NULL) {
147 atomic_store_p(elmp, leaf, ATOMIC_RELEASE);
151 return leaf;
160 rtree_leaf_valid(rtree_leaf_elm_t *leaf) argument
195 rtree_leaf_elm_t *leaf; local
212 rtree_leaf_elm_t *leaf; local
226 rtree_leaf_elm_t *leaf; local
[all...]
/freebsd-current/contrib/processor-trace/libipt/internal/include/
H A Dpt_cpuid.h34 /* Execute cpuid with @leaf set in the eax register.
37 extern void pt_cpuid(uint32_t leaf, uint32_t *eax, uint32_t *ebx,
/freebsd-current/contrib/jemalloc/include/jemalloc/internal/
H A Drtree_tsd.h5 * Number of leafkey/leaf pairs to cache in L1 and L2 level respectively. Each
6 * entry supports an entire leaf, so the cache hit rate is typically high even
8 * the boundary between two leaf nodes. Furthermore, an arena may use a
37 rtree_leaf_elm_t *leaf; member in struct:rtree_ctx_cache_elm_s
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; local
339 assert(leaf != NULL);
341 return &leaf[subkey];
349 rtree_leaf_elm_t *leaf = rtree_ctx->l2_cache[i].leaf; \
472 rtree_leaf_elm_t *leaf = rtree_ctx->cache[slot].leaf; local
[all...]
/freebsd-current/contrib/ncurses/ncurses/tinfo/
H A Daccess.c126 char *leaf; local
129 leaf = _nc_basename(head);
130 if (leaf == 0)
131 leaf = head;
132 *leaf = '\0';
133 if (head == leaf)
/freebsd-current/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-current/crypto/openssl/crypto/
H A Dsparse_array.c66 void (*leaf)(ossl_uintmax_t, void *, void *), void *arg)
92 } else if (leaf != NULL) {
93 (*leaf)(idx, p[n], arg);
134 void ossl_sa_doall(const OPENSSL_SA *sa, void (*leaf)(ossl_uintmax_t, void *)) argument
138 tramp.func = leaf;
144 void (*leaf)(ossl_uintmax_t, void *, void *),
148 sa_doall(sa, NULL, leaf, arg);
65 sa_doall(const OPENSSL_SA *sa, void (*node)(void **), void (*leaf)(ossl_uintmax_t, void *, void *), void *arg) argument
143 ossl_sa_doall_arg(const OPENSSL_SA *sa, void (*leaf)(ossl_uintmax_t, void *, void *), void *arg) argument
/freebsd-current/sys/dev/irdma/
H A Dirdma_pble.c354 struct irdma_pble_info *leaf = lvl2->leaf; local
356 for (i = 0; i < lvl2->leaf_cnt; i++, leaf++) {
357 if (leaf->addr)
359 &leaf->chunkinfo);
368 lvl2->leaf = NULL;
385 struct irdma_pble_info *leaf; local
395 lvl2->leafmem.size = (sizeof(*leaf) * total);
400 lvl2->leaf = lvl2->leafmem.va;
401 leaf
[all...]
/freebsd-current/sys/contrib/openzfs/module/zfs/
H A Dbtree.c101 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)hdr; local
102 (void) memset(leaf->btl_elems, 0x0f, hdr->bth_first * size);
103 (void) memset(leaf->btl_elems +
130 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)hdr; local
131 (void) memset(leaf->btl_elems +
152 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)hdr; local
156 VERIFY3U(leaf->btl_elems[(hdr->bth_first + idx)
273 * and the last leaf in the tree before doing the normal search,
311 * element in the last leaf, it's in the last leaf o
356 zfs_btree_leaf_t *leaf = (depth == 0 ? local
498 bt_grow_leaf(zfs_btree_t *tree, zfs_btree_leaf_t *leaf, uint32_t idx, uint32_t n) argument
533 bt_shrink_leaf(zfs_btree_t *tree, zfs_btree_leaf_t *leaf, uint32_t idx, uint32_t n) argument
603 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)node; local
790 zfs_btree_insert_leaf_impl(zfs_btree_t *tree, zfs_btree_leaf_t *leaf, uint32_t idx, const void *value) argument
812 zfs_btree_insert_into_leaf(zfs_btree_t *tree, zfs_btree_leaf_t *leaf, const void *value, uint32_t idx) argument
930 zfs_btree_leaf_t *leaf = tree->bt_bulk; local
1116 zfs_btree_leaf_t *leaf = zfs_btree_leaf_alloc(tree); local
1201 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)node; local
1252 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)idx->bti_node; local
1339 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)idx->bti_node; local
1392 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)idx->bti_node; local
1702 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)hdr; local
2070 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)hdr; local
2151 zfs_btree_leaf_t *leaf = (zfs_btree_leaf_t *)hdr; 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; local
299 leaf = spa->spa_mmp.mmp_last_leaf;
300 if (leaf
[all...]
/freebsd-current/sys/conf/
H A DMakefile.amd6435 CFLAGS+= -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer
H A DMakefile.arm6460 CFLAGS += -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer
/freebsd-current/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_mutex.cpp74 bool leaf[kMutexTypeMax]; local
75 internal_memset(&leaf, 0, sizeof(leaf));
88 CHECK(!leaf[t]);
89 leaf[t] = true;
104 // Add leaf mutexes.
106 if (!leaf[t])
110 if (z == MutexInvalid || t == z || leaf[z])
/freebsd-current/contrib/libcxxrt/
H A Ddynamic_cast.cc37 /** Offset of the leaf object. */
208 void *leaf = ADD_TO_PTR(const_cast<void *>(sub), header->leaf_offset); local
209 return header->type->cast_to(leaf, dst);
/freebsd-current/sys/arm64/iommu/
H A Dsmmuvar.h106 bool leaf; member in struct:smmu_cmdq_entry::__anon1135::__anon1136
111 bool leaf; member in struct:smmu_cmdq_entry::__anon1135::__anon1137
/freebsd-current/contrib/dialog/
H A Dfselect.c108 char *leaf = strrchr(path, '/'); local
109 if (leaf != 0)
110 leaf++;
112 leaf = path;
113 return leaf;
315 char *leaf = leaf_of(input); local
317 return show_list(leaf, d_list, keep) || show_list(leaf, f_list, keep);
479 char *leaf; local
491 if ((leaf
[all...]
/freebsd-current/include/
H A Dsearch.h32 leaf enumerator in enum:__anon79
/freebsd-current/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.
314 * Initialize a fat ZAP leaf block.
319 zap_leaf_phys_t *leaf; local
321 leaf = l->l_phys;
323 leaf->l_hdr.lh_block_type = ZBT_LEAF;
324 leaf->l_hdr.lh_magic = ZAP_LEAF_MAGIC;
325 leaf
[all...]
/freebsd-current/contrib/bmake/unit-tests/
H A Ddepsrc-optional.exp10 : A leaf node using '::' is considered out-of-date.
/freebsd-current/contrib/processor-trace/libipt/test/src/
H A Dptunit-cpu.c39 void pt_cpuid(uint32_t leaf, uint32_t *eax, uint32_t *ebx, uint32_t *ecx, argument
42 (void) leaf;

Completed in 153 milliseconds

1234