PT_NODE
branch = ptree_check_find_node2(pt, PT_NODE(node), target);
ok = ok && ptree_matchnode(pt, PT_NODE(node), ptn, bitoff, &tmp_bitoff, &tmp_slot);
tmp_slot = ptree_testnode(pt, PT_NODE(node), ptn);
ok = ok && ptree_check_leaf(pt, ptn, PT_NODE(node));
ok = ok && ptree_check_branch(pt, ptn, PT_NODE(node));
const pt_node_t * const ptn = PT_NODE(node);
PTN_SET_LEAF_POSITION(PT_NODE(node), position);
PTN_SET_BRANCH_POSITION(PT_NODE(node), position);
pt_node_t * const branch = PT_NODE(branch_node);
parent = PT_NODE(*nodep);
pt_node_t * const mask = PT_NODE(mask_node);
pt_node_t * const ptn = PT_NODE(node);
KASSERT(PT_BRANCH_P(node) || id->id_parent_slot == PTN_LEAF_POSITION(PT_NODE(node)));
KASSERT(PT_LEAF_P(node) || id->id_parent_slot == PTN_BRANCH_POSITION(PT_NODE(node)));
pt_node_t * const leaf = PT_NODE(leaf_node);
if (target == PT_NODE(pt->pt_root))
pt_node_t * const ptn = PT_NODE(*id.id_insertp);
const pt_slot_t branch_bitoff = PTN_BRANCH_BITOFF(PT_NODE(node));
ptn = PT_NODE(node);
pt_node_t * const ptn = PT_NODE(node);
pt_node_t * const ptn = PT_NODE(node);
if (PT_NODE(node) != target)
pt_node_t *ptn = PT_NODE(node);
KASSERT(PTN_ISMASK_P(PT_NODE(node)) && PTN_BRANCH_BITLEN(PT_NODE(node)) == 0);
ptn = PT_NODE(next_node);
return NODETOITEM(pt, PT_NODE(mask_node));
pt_node_t * const ptn = PT_NODE(node);
return NODETOITEM(pt, PT_NODE(node));
ptn = PT_NODE(node);