Lines Matching defs:KASSERT
52 #define KASSERT(e) assert(e)
54 #define KASSERT(e) do { } while (0)
199 KASSERT(PTN_BRANCH_BITLEN(src) == 1);
234 KASSERT(PT_LEAF_P(mask_node));
235 KASSERT(PTN_LEAF_POSITION(mask) == id->id_parent_slot);
236 KASSERT(mask_len <= id->id_bitoff);
237 KASSERT(PTN_ISMASK_P(mask));
238 KASSERT(!PTN_ISMASK_P(target) || mask_len < PTN_MASK_BITLEN(target));
241 KASSERT(id->id_parent != mask);
253 KASSERT(mask_nodep != NULL);
254 KASSERT(*mask_nodep == PTN_BRANCH(mask));
255 KASSERT(PTN_BRANCH_BITLEN(mask) == 1);
301 KASSERT(PT_LEAF_P(node) || id->id_parent_slot == PTN_BRANCH_POSITION(ptn));
302 KASSERT(PT_BRANCH_P(node) || id->id_parent_slot == PTN_LEAF_POSITION(ptn));
303 KASSERT(PTN_ISMASK_P(target));
335 KASSERT(PT_BRANCH_P(node) || id->id_parent_slot == PTN_LEAF_POSITION(PT_NODE(node)));
336 KASSERT(PT_LEAF_P(node) || id->id_parent_slot == PTN_BRANCH_POSITION(PT_NODE(node)));
337 KASSERT((node == pt->pt_root) == (id->id_parent == &pt->pt_rootnode));
339 KASSERT(!PTN_ISMASK_P(target) || id->id_bitoff <= PTN_MASK_BITLEN(target));
341 KASSERT(node == pt->pt_root || PTN_BRANCH_BITOFF(id->id_parent) + PTN_BRANCH_BITLEN(id->id_parent) <= id->id_bitoff);
380 KASSERT(PT_LEAF_P(leaf_node));
381 KASSERT(PTN_LEAF_POSITION(leaf) == id->id_parent_slot);
500 KASSERT
509 KASSERT(PT_BRANCH_P(id.id_node));
510 KASSERT(PTN_BRANCH_POSITION(ptn) == id.id_parent_slot);
522 KASSERT(!(PTN_ISMASK_P(ptn) && PTN_BRANCH_BITLEN(ptn) == 0) || PTN_MASK_BITLEN(ptn) == branch_bitoff);
572 KASSERT(id.id_bitoff < branch_bitoff);
581 KASSERT(id.id_bitoff >= branch_bitoff);
616 KASSERT(mask_len == 0 || (~PT__MASK(PTN_MASK_BITLEN) & mask_len) == 0);
683 KASSERT(PTN_ISROOT_P(pt, parent) || PTN_BRANCH_BITOFF(parent) + PTN_BRANCH_BITLEN(parent) == bitoff);
706 KASSERT(ptree_matchkey(pt, key, mask, 0, PTN_MASK_BITLEN(mask)));
773 KASSERT(PTN_ISMASK_P(PT_NODE(node)) && PTN_BRANCH_BITLEN(PT_NODE(node)) == 0);
784 KASSERT(PT_NULL_P(next_node));
830 KASSERT(!PT_NULL_P(PTN_BRANCH_ROOT_SLOT(&pt->pt_rootnode)));
855 KASSERT(nodep == NULL);
863 KASSERT(PT_NULL_P(PTN_BRANCH_ODDMAN_SLOT(ptn)));
869 KASSERT(*nodep == PTN_BRANCH(target));
891 KASSERT(target == ptn);
900 KASSERT(PTN_BRANCH_ODDMAN_SLOT(&pt->pt_rootnode) == PTN_LEAF(target));
901 KASSERT(nodep == NULL);
905 KASSERT((removep == NULL) == (parent == &pt->pt_rootnode));
912 KASSERT(removep == NULL);
913 KASSERT(parent == &pt->pt_rootnode);
914 KASSERT(nodep == &PTN_BRANCH_ODDMAN_SLOT(&pt->pt_rootnode));
915 KASSERT(*nodep == PTN_LEAF(target));
921 KASSERT((parent == target) == (removep == nodep));
933 KASSERT(PTN_BRANCH_BITOFF(target) < PTN_BRANCH_BITOFF(parent));
978 KASSERT(PTN_ISMASK_P(parent));
979 KASSERT(slot == ptree_testnode(pt, parent, target));
1004 KASSERT(PTN_ISMASK_P(parent));
1005 KASSERT(parent != target);
1052 KASSERT(nodep == &PTN_BRANCH_ODDMAN_SLOT(&pt->pt_rootnode));
1061 KASSERT(PTN_BRANCH_BITOFF(parent) > PTN_BRANCH_BITOFF(target));
1106 KASSERT(ok);
1112 KASSERT(ok);
1114 KASSERT(ok);
1117 KASSERT(ok);
1119 KASSERT(ok);
1122 KASSERT(ok);
1124 KASSERT(ok);
1148 KASSERT(ok);
1150 KASSERT(ok);
1154 KASSERT(ok);
1157 KASSERT(ok);
1159 KASSERT(ok);
1167 KASSERT(ok);
1175 KASSERT(ok);
1178 KASSERT(ok);
1181 KASSERT(ok);