Searched refs:leaf (Results 1 - 25 of 82) sorted by last modified time

1234

/freebsd-current/sys/x86/x86/
H A Didentcpu.c123 u_int cpu_power_eax; /* 06H: Power management leaf, %eax */
124 u_int cpu_power_ebx; /* 06H: Power management leaf, %ebx */
125 u_int cpu_power_ecx; /* 06H: Power management leaf, %ecx */
126 u_int cpu_power_edx; /* 06H: Power management leaf, %edx */
1379 u_int leaf, regs[4]; local
1394 for (leaf = 0x40000000; leaf < 0x40010000; leaf += 0x100) {
1395 do_cpuid(leaf, regs);
1402 * highest supported leaf i
[all...]
H A Dmp_x86.c405 u_int leaf; local
411 /* Prefer leaf 1Fh (V2 Extended Topology Enumeration). */
413 leaf = 0x1f;
414 cpuid_count(leaf, 0, p);
416 /* Fall back to leaf 0Bh (Extended Topology Enumeration). */
418 leaf = 0x0b;
419 cpuid_count(leaf, 0, p);
421 /* Fall back to leaf 04h (Deterministic Cache Parameters). */
429 cpuid_count(leaf, i, p);
471 * via CPUID leaf
[all...]
/freebsd-current/contrib/bmake/mk/
H A Ddirdeps.mk577 # leaf makefiles rarely work for building DIRDEPS_CACHE
H A Dsys.dirdeps.mk200 # we need defaults for both first include in a leaf dir
/freebsd-current/sys/conf/
H A Dkmod.mk164 CFLAGS+= -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer
H A DMakefile.arm6459 CFLAGS += -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer
H A DMakefile.amd6435 CFLAGS+= -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer
/freebsd-current/sys/kern/
H A Dkern_sysctl.c404 sysctl_warn_reuse(const char *func, struct sysctl_oid *leaf) argument
414 sbuf_printf(&sb, "%s: can't re-use a leaf (", __func__);
416 rc = sysctl_search_oid(nodes, leaf);
422 sbuf_cat(&sb, leaf->oid_name);
547 * Mark the leaf as dormant if it's not to be immediately enabled.
1280 /* If node does not have an iterator, treat it as leaf */
1316 /* If node does not have an iterator, treat it as leaf */
/freebsd-current/sys/contrib/openzfs/module/zfs/
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/contrib/openzfs/cmd/
H A Dztest.c3697 uint64_t leaf, top; local
3735 * RAIDZ leaf VDEV mirrors are not currently supported while a
3754 * Pick a random leaf within it.
3756 leaf = ztest_random(leaves);
3767 oldvd = oldvd->vdev_child[leaf / raidz_children];
3776 oldvd = oldvd->vdev_child[leaf % raidz_children];
3835 top * leaves + leaf);
4097 * Get next attached leaf id
4316 * leaf vdev we encounter.
4391 * Determine the size of the first leaf vde
6388 uint64_t top, leaf; local
[all...]
/freebsd-current/share/mk/
H A Dsys.dirdeps.mk200 # we need defaults for both first include in a leaf dir
H A Ddirdeps.mk577 # leaf makefiles rarely work for building DIRDEPS_CACHE
/freebsd-current/contrib/llvm-project/openmp/runtime/src/
H A Dkmp_affinity.cpp2173 // Check if cpuid leaf 4 is supported.
2503 * CPUID.B or 1F, Input ECX (sub leaf # aka level number)
2549 // This function takes the topology leaf, a levels array to store the levels
2553 __kmp_x2apicid_get_levels(int leaf,
2569 __kmp_x86_cpuid(leaf, level, &buf);
2641 // Get the highest cpuid leaf supported
2645 // If a specific topology method was requested, only allow that specific leaf
2663 // Check to see if cpuid leaf 31 or 11 is supported.
2667 int leaf = leaves[i];
2668 if (highest_leaf < leaf)
[all...]
H A Dkmp.h1407 static inline void __kmp_x86_cpuid(int leaf, int subleaf, struct kmp_cpuid *p) { argument
1410 : "a"(leaf), "c"(subleaf));
/freebsd-current/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 {
970 RootLeaf leaf;
[all...]
/freebsd-current/contrib/llvm-project/lldb/source/Commands/
H A DCommandObjectCommands.cpp1784 // This means that command only had a leaf command, so the container is
2074 const char *leaf = command.GetArgumentAtIndex(num_args - 1); variable
2076 container->RemoveUserSubcommand(leaf, /* multiword okay */ true);
/freebsd-current/contrib/sqlite3/
H A Dsqlite3.c69382 u8 leaf; /* True if a leaf page */ member in struct:MemPage
[all...]
/freebsd-current/stand/libsa/zfs/
H A Dzfsimpl.c761 * random (healthy) leaf vdev. We have to verify
1149 * error, reset it because leaf devices have no children.
1695 * Non-leaf vdevs do not have v_phys_write.
2428 * Compare a name with a zap leaf entry. Return non-zero if the name
2460 * Extract a uint64_t value from a zap leaf entry.
2498 * Extract a array from a zap leaf entry.
2559 zap_leaf_free(zap_leaf_t *leaf) argument
2561 free(leaf->l_phys);
2562 free(leaf);
2805 * This assumes that the leaf block
[all...]
/freebsd-current/sys/dev/irdma/
H A Dirdma_verbs.c1688 struct irdma_pble_info *leaf = lvl2->leaf; local
1701 start_addr = leaf->addr;
1703 for (i = 0; i < lvl2->leaf_cnt; i++, leaf++) {
1704 arr = leaf->addr;
1707 ret = irdma_check_mem_contiguous(arr, leaf->cnt, pg_size);
1741 palloc->level2.leaf;
1896 palloc->level2.leaf + (iwmr->npages >> PBLE_512_SHIFT);
H A Dirdma_kcompat.c1154 pinfo = (level == PBLE_LEVEL_1) ? NULL : palloc->level2.leaf;
/freebsd-current/crypto/openssl/test/
H A Dsslapitest.c567 char *skey = test_mk_file_path(certsdir, "leaf.key");
568 char *leaf = test_mk_file_path(certsdir, "leaf.pem"); local
582 if (!TEST_int_eq(SSL_CTX_use_certificate_chain_file(sctx, leaf), 1)
635 OPENSSL_free(leaf);
648 char *skey = test_mk_file_path(certsdir, "leaf.key");
649 char *leaf_chain = test_mk_file_path(certsdir, "leaf-chain.pem");
655 /* leaf_chain contains leaf + subinterCA + interCA + rootCA */
687 char *skey = test_mk_file_path(certsdir, "leaf-encrypted.key");
688 char *leaf_chain = test_mk_file_path(certsdir, "leaf
[all...]
H A Dcrltest.c241 * Verify |leaf| certificate (chained up to |root|). |crls| if
246 static int verify(X509 *leaf, X509 *root, STACK_OF(X509_CRL) *crls, argument
264 || !TEST_true(X509_STORE_CTX_init(ctx, store, leaf, NULL)))
/freebsd-current/sys/dev/xen/blkback/
H A Dblkback.c3076 const char *leaf; local
3089 leaf = "sectors";
3090 error = xs_printf(xst, our_path, leaf,
3096 leaf = "info";
3097 error = xs_printf(xst, our_path, leaf, "%u",
3103 leaf = "sector-size";
3104 error = xs_printf(xst, our_path, leaf, "%u",
3119 our_path, leaf);
/freebsd-current/sys/x86/iommu/
H A Dintel_idpgtbl.c85 int leaf; /* The last materialized page table member in struct:idpgtbl
124 if (lvl != tbl->leaf) {
130 if (lvl == tbl->leaf) {
168 int leaf, i; local
170 leaf = 0; /* silence gcc */
177 leaf = i;
185 * supported by the DMAR and leaf should be equal to the
194 tbl->leaf == leaf) {
213 tbl->leaf
[all...]
/freebsd-current/sys/net/
H A Dradix.c78 static int rn_satisfies_leaf(const char *trial, struct radix_node *leaf,
111 * a key satisfies a normal route, and also in remembering the unique leaf
250 rn_satisfies_leaf(const char *trial, struct radix_node *leaf, int skip) argument
252 const char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask;
297 * match and the leaf we have is the most specific one anyway;
333 * we may match if the leaf we wound up at is
393 * Whenever we add a new leaf to the tree, we also add a parent node,
395 * the leaf (see RNTORT() in route.c), the second one is the parent.
397 * the leaf i
[all...]

Completed in 909 milliseconds

1234