| /src/usr.bin/make/unit-tests/ |
| depsrc-optional.mk | 15 : An optional leaf node is not executed.
19 : A leaf node using '::' is considered out-of-date.
|
| depsrc-optional.exp | 10 : A leaf node using '::' is considered out-of-date.
|
| /src/sys/kern/ |
| subr_thmap.c | 69 * The leaf nodes just stay as-is until they are reclaimed.
189 * - Intermediate nodes -- arrays pointing to another level or a leaf;
394 const thmap_leaf_t *leaf, unsigned level)
396 const void *key = THMAP_GETPTR(thmap, leaf->key);
401 return (hash(thmap->seed, key, leaf->len, i) >> shift) & LEVEL_MASK;
406 const thmap_leaf_t *leaf)
411 return hashval_getleafslot(thmap, leaf, 0);
415 key_cmp_p(const thmap_t *thmap, const thmap_leaf_t *leaf,
418 const void *leafkey = THMAP_GETPTR(thmap, leaf->key);
419 return len == leaf->len && memcmp(key, leafkey, len) == 0
490 thmap_leaf_t *leaf; local in function:leaf_create
698 thmap_leaf_t *leaf; local in function:thmap_get
726 thmap_leaf_t *leaf, *other; local in function:thmap_put
856 thmap_leaf_t *leaf; local in function:thmap_del
[all...] |
| /src/sys/arch/hpcmips/stand/pbsdboot/ |
| vmem.c | 90 for (i = 0; p = map->leaf[i / map->leafsize][i % map->leafsize]; i++) {
93 i, map->leaf[i / map->leafsize][i % map->leafsize]);
96 i, map->leaf[i / map->leafsize][i % map->leafsize]);
99 map->leaf[i / map->leafsize][i % map->leafsize] = p;
103 if ((p = vtophysaddr((void *)map->leaf[i])) == NULL) {
104 debug_printf(TEXT("vtophysaddr() failed, leaf %d (addr=0x%x) \n"),
105 i, map->leaf[i / map->leafsize][i % map->leafsize]);
107 TEXT("vtophysaddr() failed, leaf %d (addr=0x%x) \n"),
108 i, map->leaf[i / map->leafsize][i % map->leafsize]);
111 map->leaf[i] = (void **)p
357 void **leaf = map->leaf[i \/ map->leafsize]; local in function:vmem_init
[all...] |
| pbsdboot.h | 72 void **leaf[32]; member in struct:map_s
|
| /src/sys/external/bsd/drm2/dist/drm/i915/selftests/ |
| i915_syncmap.c | 151 static int check_seqno(struct i915_syncmap *leaf, unsigned int idx, u32 seqno)
153 if (leaf->height) {
154 pr_err("%s: not a leaf, height is %d\n",
155 __func__, leaf->height);
159 if (__sync_seqno(leaf)[idx] != seqno) { local in function:check_seqno
161 __func__, idx, __sync_seqno(leaf)[idx], seqno);
177 pr_err("Inserting first context=%llx did not return leaf (height=%d, prefix=%llx\n",
216 * Check that inserting a new id, creates a leaf and only that leaf.
252 pr_err("Inserting context=%llx did not return leaf (height=%d, prefix=%llx\n"
513 struct i915_syncmap *leaf = __sync_child(sync)[idx]; local in function:igt_syncmap_compact
[all...] |
| /src/lib/libc/stdlib/ |
| twalk.c | 35 (*action)(root, leaf, level);
|
| /src/sys/external/bsd/compiler_rt/dist/lib/tsan/rtl/ |
| tsan_mutex.cc | 26 // The leaf mutexes can be locked under any other mutexes.
58 bool leaf[N] = {}; local in function:__tsan::InitializeMutex
65 CHECK(!leaf[i]);
66 leaf[i] = true;
75 CHECK(!leaf[i] || cnt[i] == 0);
77 // Add leaf mutexes.
79 if (!leaf[i])
82 if (i == j || leaf[j] || j == MutexTypeInvalid)
|
| /src/include/ |
| search.h | 42 leaf enumerator in enum:__anon345d546c0203
|
| /src/sys/arch/x86/x86/ |
| identcpu_subr.c | 212 * Intel Deterministic Cache Parameter Leaf (0x04)
213 * AMD Cache Topology Information Leaf (0x8000001d)
216 cpu_dcp_cacheinfo(struct cpu_info *ci, uint32_t leaf)
224 x86_cpuid2(leaf, i, descs);
|
| /src/sys/external/bsd/libfdt/dist/ |
| fdt_ro.c | 303 * give only the leaf name (after all /). The actual tree
306 const char *leaf; local in function:fdt_get_name
307 leaf = strrchr(nameptr, '/');
308 if (leaf == NULL) {
312 nameptr = leaf+1;
|
| /src/sys/external/mit/xen-include-public/dist/xen/include/public/ |
| vm_event.h | 291 uint32_t leaf; member in struct:vm_event_cpuid
|
| /src/common/lib/libc/gen/ |
| ptree.c | 74 * to another branching node or a leaf node. The root pointer would also
75 * point to either the first branching node or a leaf node. Leaf nodes
81 * each node has two identities: its leaf identity and its branch identity.
83 * it points to a leaf or a branch. This is not an attribute of the object
85 * the tag to determine whether it points to a leaf or branch identity, with
89 * root to the node's leaf identity, one of the branches traversed will be via
101 * that mask node is converted from being a leaf node to being a one-way
249 * identity. We know that between root and the leaf identity,
284 * change mask from a leaf to a branch
363 pt_node_t * const leaf = PT_NODE(leaf_node); local in function:ptree_insert_leaf
[all...] |
| /src/sys/external/bsd/compiler_rt/dist/lib/msan/tests/ |
| CMakeLists.txt | 32 -mno-omit-leaf-frame-pointer
|
| /src/sys/dev/nvmm/x86/ |
| nvmm_x86.h | 279 /* The leaf. */
280 uint32_t leaf; member in struct:nvmm_vcpu_conf_cpuid
|
| nvmm_x86_svm.c | 871 * leaf is returned.'
1119 if (cpuid->leaf != eax) {
2403 if (cpudata->cpuid[i].leaf == cpuid->leaf) {
2415 if (cpudata->cpuid[i].leaf == cpuid->leaf) {
2507 printf("NVMM: CPUID leaf not available\n");
2616 /* Init the max basic CPUID leaf. */
2619 /* Init the max extended CPUID leaf. */
|
| nvmm_x86_vmx.c | 1253 * leaf is returned.'
1534 if (cpuid->leaf != eax) {
3118 if (cpudata->cpuid[i].leaf == cpuid->leaf) {
3130 if (cpudata->cpuid[i].leaf == cpuid->leaf) {
3585 /* Init the max basic CPUID leaf. */
3588 /* Init the max extended CPUID leaf. */
|
| /src/sys/arch/ia64/ia64/ |
| pmap.c | 1103 struct ia64_lpte *leaf; local in function:pmap_find_kpte
1113 leaf = dir1[KPTE_DIR1_INDEX(va)];
1117 UVMHIST_LOG(maphist, "(dir1=%p, leaf=%p ret=%p)",
1118 dir1, leaf, &leaf[KPTE_PTE_INDEX(va)], 0);
1120 return (&leaf[KPTE_PTE_INDEX(va)]);
1584 struct ia64_lpte *leaf; local in function:pmap_growkernel
1636 leaf = (struct ia64_lpte *)pmap_page_to_va(nkpg);
1637 bzero(leaf, PAGE_SIZE);
1639 leaf = (struct ia64_lpte *)pmap_page_to_va(pg)
[all...] |
| /src/usr.sbin/cpuctl/arch/ |
| i386.c | 985 * Parse the cache info from `cpuid leaf 2', if we have it.
1022 /* Parse the cache info from `cpuid leaf 4', if we have it. */
1027 /* Parse the TLB info from `cpuid leaf 18H', if we have it. */
1755 uint32_t leaf; local in function:dump_descs
1761 for (leaf = leafstart; leaf <= leafend; leaf++) {
1762 x86_cpuid(leaf, descs);
1764 leaf, descs[0], descs[1], descs[2], descs[3]);
|
| /src/sbin/routed/ |
| radix.c | 101 * a key satisfies a normal route, and also in remembering the unique leaf
186 struct radix_node *leaf,
189 char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask;
232 * match and the leaf we have is the most specific one anyway;
281 * we may match if the leaf we wound up at is
835 /* Find the next *leaf* since next node might vanish, too */
|
| /src/sys/net/ |
| radix.c | 121 * a key satisfies a normal route, and also in remembering the unique leaf
217 struct radix_node *leaf,
221 const char *cp2 = leaf->rn_key;
222 const char *cp3 = leaf->rn_mask;
271 * match and the leaf we have is the most specific one anyway;
304 * we may match if the leaf we wound up at is
957 /* Find the next *leaf* since next node might vanish, too */
|
