leaf
pt_node_t * const leaf = PT_NODE(leaf_node);
const bool at_mask = PTN_ISMASK_P(leaf);
const pt_bitlen_t leaf_masklen = PTN_MASK_BITLEN(leaf);
KASSERT(PTN_LEAF_POSITION(leaf) == id->id_parent_slot);
matched = ptree_matchnode(pt, target, leaf, UINT_MAX,
(*action)(root, leaf, level);
struct radix_node *leaf,
char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask;
void **leaf[32];
if ((p = vtophysaddr((void *)map->leaf[i])) == NULL) {
i, map->leaf[i / map->leafsize][i % map->leafsize]);
i, map->leaf[i / map->leafsize][i % map->leafsize]);
map->leaf[i] = (void **)p;
return (map->leaf[pageno / map->leafsize][pageno % map->leafsize] + offset);
if ((map->leaf[i] = (void **)vmem_alloc()) == NULL) {
void **leaf = map->leaf[i / map->leafsize];
if ((leaf[i % map->leafsize] = alloc_kpage(start)) == NULL) {
map->leaf[i / map->leafsize][i % map->leafsize] = NULL; /* END MARK */
for (i = 0; p = map->leaf[i / map->leafsize][i % map->leafsize]; i++) {
i, map->leaf[i / map->leafsize][i % map->leafsize]);
i, map->leaf[i / map->leafsize][i % map->leafsize]);
map->leaf[i / map->leafsize][i % map->leafsize] = p;
struct ia64_lpte *leaf;
leaf = dir1[KPTE_DIR1_INDEX(va)];
dir1, leaf, &leaf[KPTE_PTE_INDEX(va)], 0);
return (&leaf[KPTE_PTE_INDEX(va)]);
struct ia64_lpte *leaf;
leaf = (struct ia64_lpte *)pmap_page_to_va(nkpg);
bzero(leaf, PAGE_SIZE);
leaf = (struct ia64_lpte *)pmap_page_to_va(pg);
dir1[KPTE_DIR1_INDEX(kernel_vm_end)] = leaf;
cpu_dcp_cacheinfo(struct cpu_info *ci, uint32_t leaf)
x86_cpuid2(leaf, i, descs);
uint32_t leaf;
if (cpuid->leaf != eax) {
if (cpudata->cpuid[i].leaf == cpuid->leaf) {
if (cpudata->cpuid[i].leaf == cpuid->leaf) {
if (cpuid->leaf != eax) {
if (cpudata->cpuid[i].leaf == cpuid->leaf) {
if (cpudata->cpuid[i].leaf == cpuid->leaf) {
const thmap_leaf_t *leaf, unsigned level)
const void *key = THMAP_GETPTR(thmap, leaf->key);
return (hash(thmap->seed, key, leaf->len, i) >> shift) & LEVEL_MASK;
const thmap_leaf_t *leaf)
return hashval_getleafslot(thmap, leaf, 0);
key_cmp_p(const thmap_t *thmap, const thmap_leaf_t *leaf,
const void *leafkey = THMAP_GETPTR(thmap, leaf->key);
return len == leaf->len && memcmp(key, leafkey, len) == 0;
thmap_leaf_t *leaf;
leaf = THMAP_GETPTR(thmap, leaf_off);
ASSERT(THMAP_ALIGNED_P(leaf));
leaf->key = key_off;
leaf->key = (uintptr_t)key;
leaf->len = len;
leaf->val = val;
return leaf;
leaf_free(const thmap_t *thmap, thmap_leaf_t *leaf)
gc_free(thmap, leaf->key, leaf->len);
gc_free(thmap, THMAP_GETOFF(thmap, leaf), sizeof(thmap_leaf_t));
root_try_put(thmap_t *thmap, const thmap_query_t *query, thmap_leaf_t *leaf)
slot = hashval_getl0slot(thmap, query, leaf);
node_insert(node, slot, THMAP_GETOFF(thmap, leaf) | THMAP_LEAF_BIT);
thmap_leaf_t *leaf;
leaf = get_leaf(thmap, parent, slot);
if (!leaf) {
if (!key_cmp_p(thmap, leaf, key, len)) {
return leaf->val;
thmap_leaf_t *leaf, *other;
leaf = leaf_create(thmap, key, len, val);
if (__predict_false(!leaf)) {
switch (root_try_put(thmap, &query, leaf)) {
target = THMAP_GETOFF(thmap, leaf) | THMAP_LEAF_BIT;
leaf_free(thmap, leaf);
leaf_free(thmap, leaf);
target = THMAP_GETOFF(thmap, leaf) | THMAP_LEAF_BIT;
thmap_leaf_t *leaf;
leaf = get_leaf(thmap, parent, slot);
if (!leaf || !key_cmp_p(thmap, leaf, key, len)) {
== leaf);
val = leaf->val;
stage_mem_gc(thmap, leaf->key, leaf->len);
stage_mem_gc(thmap, THMAP_GETOFF(thmap, leaf), sizeof(thmap_leaf_t));
struct radix_node *leaf,
const char *cp2 = leaf->rn_key;
const char *cp3 = leaf->rn_mask;
uint32_t leaf;
for (leaf = leafstart; leaf <= leafend; leaf++) {
x86_cpuid(leaf, descs);
leaf, descs[0], descs[1], descs[2], descs[3]);