Lines Matching defs:KASSERT
42 #define KASSERT(s) assert(s)
45 #define KASSERT(s) do { } while (/*CONSTCOND*/ 0)
235 KASSERT(prev == NULL || !RB_SENTINEL_P(prev));
236 KASSERT(next == NULL || !RB_SENTINEL_P(next));
241 KASSERT(prev == NULL || !RB_SENTINEL_P(prev));
242 KASSERT(next == NULL || !RB_SENTINEL_P(next));
243 KASSERT(prev == NULL || (*compare_nodes)(rbto->rbto_context,
245 KASSERT(next == NULL || (*compare_nodes)(rbto->rbto_context,
263 KASSERT(position == RB_DIR_LEFT || position == RB_DIR_RIGHT);
280 KASSERT(RB_SENTINEL_P(parent->rb_nodes[position]));
284 KASSERT(RB_CHILDLESS_P(self));
294 KASSERT((*compare_nodes)(rbto->rbto_context,
299 KASSERT((*compare_nodes)(rbto->rbto_context,
306 KASSERT(rb_tree_check_node(rbt, self, NULL, !rebalance));
313 KASSERT(rb_tree_check_node(rbt, self, NULL, true));
337 KASSERT(which == RB_DIR_LEFT || which == RB_DIR_RIGHT);
339 KASSERT(!RB_SENTINEL_P(old_child));
340 KASSERT(RB_FATHER(old_child) == old_father);
342 KASSERT(rb_tree_check_node(rbt, old_father, NULL, false));
343 KASSERT(rb_tree_check_node(rbt, old_child, NULL, false));
344 KASSERT(RB_ROOT_P(rbt, old_father) ||
385 KASSERT(rb_tree_check_node(rbt, new_father, NULL, false));
386 KASSERT(rb_tree_check_node(rbt, new_child, NULL, false));
387 KASSERT(RB_ROOT_P(rbt, new_father) ||
400 KASSERT(!RB_ROOT_P(rbt, self));
401 KASSERT(RB_RED_P(self));
402 KASSERT(RB_RED_P(father));
406 KASSERT(!RB_SENTINEL_P(self));
408 KASSERT(RB_RED_P(self));
409 KASSERT(RB_RED_P(father));
415 KASSERT(RB_BLACK_P(grandpa));
416 KASSERT(RB_DIR_RIGHT == 1 && RB_DIR_LEFT == 0);
438 KASSERT(RB_BLACK_P(grandpa));
444 KASSERT(RB_RED_P(self));
449 KASSERT(RB_BLACK_P(rbt->rbt_root));
454 KASSERT(!RB_ROOT_P(rbt, self));
455 KASSERT(RB_RED_P(self));
456 KASSERT(RB_RED_P(father));
457 KASSERT(RB_BLACK_P(uncle));
458 KASSERT(RB_BLACK_P(grandpa));
470 KASSERT(RB_FATHER(father) == self);
471 KASSERT(self->rb_nodes[which] == father);
472 KASSERT(RB_FATHER(self) == grandpa);
476 KASSERT(RB_RED_P(self) && RB_RED_P(father));
477 KASSERT(grandpa->rb_nodes[which] == father);
485 KASSERT(RB_FATHER(self) == father);
486 KASSERT(RB_FATHER(self)->rb_nodes[RB_POSITION(self) ^ RB_DIR_OTHER] == grandpa);
487 KASSERT(RB_RED_P(self));
488 KASSERT(RB_BLACK_P(father));
489 KASSERT(RB_RED_P(grandpa));
506 KASSERT(rebalance || (RB_ROOT_P(rbt, self) || RB_RED_P(self)));
507 KASSERT(!rebalance || RB_BLACK_P(self));
508 KASSERT(RB_CHILDLESS_P(self));
509 KASSERT(rb_tree_check_node(rbt, self, NULL, false));
543 KASSERT(was_root || rb_tree_check_node(rbt, father, NULL, true));
564 KASSERT(RB_SENTINEL_P(standin->rb_nodes[standin_other]));
571 KASSERT(RB_SENTINEL_P(standin->rb_nodes[standin_which]));
578 KASSERT(RB_TWOCHILDREN_P(self));
582 KASSERT(RB_SENTINEL_P(standin_son) || RB_RED_P(standin_son));
587 KASSERT(rb_tree_check_node(rbt, self, NULL, false));
588 KASSERT(rb_tree_check_node(rbt, standin, NULL, false));
595 KASSERT(rb_tree_check_node(rbt, standin_son, NULL, true));
600 KASSERT(RB_POSITION(standin_son) == standin_which);
602 KASSERT(RB_POSITION(standin_son) == standin_other);
623 KASSERT(RB_SENTINEL_P(standin->rb_nodes[standin_other]));
624 KASSERT(!RB_SENTINEL_P(self->rb_nodes[standin_other]));
625 KASSERT(self->rb_nodes[standin_which] == standin);
644 KASSERT(RB_POSITION(self->rb_nodes[standin_other]) == standin_other);
656 KASSERT(standin->rb_nodes[standin_other] != self->rb_nodes[standin_other]);
680 KASSERT(rb_tree_check_node(rbt, standin, NULL, false));
681 KASSERT(RB_FATHER_SENTINEL_P(standin)
683 KASSERT(RB_LEFT_SENTINEL_P(standin)
685 KASSERT(RB_RIGHT_SENTINEL_P(standin)
692 KASSERT(rb_tree_check_node(rbt, standin, NULL, true));
712 KASSERT(which == RB_DIR_LEFT || which == RB_DIR_RIGHT);
713 KASSERT(RB_BLACK_P(self) && RB_RED_P(son));
714 KASSERT(!RB_TWOCHILDREN_P(son));
715 KASSERT(RB_CHILDLESS_P(son));
716 KASSERT(rb_tree_check_node(rbt, self, NULL, false));
717 KASSERT(rb_tree_check_node(rbt, son, NULL, false));
735 KASSERT(rbt->rbt_minmax[which] == son);
743 KASSERT(was_root || rb_tree_check_node(rbt, father, NULL, true));
744 KASSERT(rb_tree_check_node(rbt, son, NULL, true));
754 KASSERT(!RB_SENTINEL_P(self));
779 KASSERT(!RB_CHILDLESS_P(self));
790 KASSERT(RB_BLACK_P(self));
791 KASSERT(RB_RED_P(self->rb_nodes[which]));
792 KASSERT(RB_CHILDLESS_P(self->rb_nodes[which]));
796 KASSERT(RB_TWOCHILDREN_P(self));
816 KASSERT(!RB_SENTINEL_P(parent));
817 KASSERT(RB_SENTINEL_P(parent->rb_nodes[which]));
818 KASSERT(which == RB_DIR_LEFT || which == RB_DIR_RIGHT);
827 KASSERT(!RB_SENTINEL_P(brother));
847 KASSERT(RB_BLACK_P(parent));
850 KASSERT(!RB_SENTINEL_P(brother));
851 KASSERT(RB_RED_P(parent));
852 KASSERT(RB_BLACK_P(brother));
853 KASSERT(rb_tree_check_node(rbt, brother, NULL, false));
854 KASSERT(rb_tree_check_node(rbt, parent, NULL, false));
866 KASSERT(RB_BLACK_P(brother->rb_left));
867 KASSERT(RB_BLACK_P(brother->rb_right));
870 KASSERT(rb_tree_check_node(rbt, brother, NULL, false));
871 KASSERT(rb_tree_check_node(rbt, parent, NULL, false));
885 KASSERT(RB_RED_P(parent));
886 KASSERT(RB_BLACK_P(brother));
887 KASSERT(RB_BLACK_P(brother->rb_left));
888 KASSERT(RB_BLACK_P(brother->rb_right));
901 KASSERT(rb_tree_check_node(rbt, brother, NULL, true));
908 KASSERT(RB_BLACK_P(brother));
909 KASSERT(RB_RED_P(brother->rb_nodes[which]) ||
923 KASSERT(RB_RED_P(brother->rb_nodes[which]));
925 KASSERT(RB_FATHER(brother) == parent->rb_nodes[other]);
927 KASSERT(RB_RED_P(brother->rb_nodes[other]));
953 KASSERT(RB_BLACK_P(brother));
954 KASSERT(RB_RED_P(brother->rb_nodes[other]));
960 KASSERT(rb_tree_check_node(rbt, parent, NULL, true));
970 KASSERT(direction == RB_DIR_LEFT || direction == RB_DIR_RIGHT);
987 KASSERT(!RB_SENTINEL_P(self));
1006 KASSERT(!RB_SENTINEL_P(self));
1018 KASSERT(direction == RB_DIR_LEFT || direction == RB_DIR_RIGHT);
1034 KASSERT(!RB_SENTINEL_P(self));
1053 KASSERT(!RB_SENTINEL_P(self));
1070 KASSERT(left == right);
1082 KASSERT(!RB_SENTINEL_P(self));
1083 KASSERT(prev == NULL || (*compare_nodes)(rbto->rbto_context,
1090 KASSERT(self == rbt->rbt_root);
1091 KASSERT(RB_POSITION(self) == RB_DIR_LEFT);
1092 KASSERT
1093 KASSERT(RB_FATHER(self) == (const struct rb_node *) &rbt->rbt_root);
1099 KASSERT(self != rbt->rbt_root);
1100 KASSERT(!RB_FATHER_SENTINEL_P(self));
1102 KASSERT(diff < 0);
1103 KASSERT(RB_FATHER(self)->rb_nodes[RB_DIR_LEFT] == self);
1105 KASSERT(diff > 0);
1106 KASSERT(RB_FATHER(self)->rb_nodes[RB_DIR_RIGHT] == self);
1116 KASSERT(prev0 == TAILQ_PREV(self, rb_node_qh, rb_link));
1117 KASSERT(next0 == TAILQ_NEXT(self, rb_link));
1119 KASSERT(prev0 != NULL || self == rbt->rbt_minmax[RB_DIR_LEFT]);
1120 KASSERT(next0 != NULL || self == rbt->rbt_minmax[RB_DIR_RIGHT]);
1129 KASSERT(!RB_ROOT_P(rbt, self) || RB_BLACK_P(self));
1133 KASSERT(!RB_ROOT_P(rbt, self));
1135 KASSERT(RB_BLACK_P(RB_FATHER(self)));
1141 KASSERT(!RB_CHILDLESS_P(self)
1149 KASSERT(RB_CHILDLESS_P(self)
1158 KASSERT(RB_CHILDLESS_P(self)
1168 KASSERT(RB_CHILDLESS_P(self)
1193 KASSERT(relative0 != NULL);
1196 KASSERT(relative != NULL);
1197 KASSERT(RB_SENTINEL_P(relative->rb_nodes[which]));
1199 KASSERT(RB_RED_P(relative)
1210 KASSERT(RB_ROOT_P(rbt, self)
1217 KASSERT(RB_LEFT_SENTINEL_P(self)
1224 KASSERT(RB_RIGHT_SENTINEL_P(self)
1233 KASSERT(RB_TWOCHILDREN_P(self->rb_left)
1247 KASSERT(RB_TWOCHILDREN_P(self->rb_right)
1265 KASSERT(prev0 != NULL);
1266 KASSERT(RB_RIGHT_SENTINEL_P(prev0));
1269 KASSERT(next0 != NULL);
1270 KASSERT(RB_LEFT_SENTINEL_P(next0));
1286 KASSERT(rbt->rbt_root != NULL);
1287 KASSERT(RB_LEFT_P(rbt->rbt_root));
1290 KASSERT(rbt->rbt_count > 1
1302 KASSERT(rbt->rbt_count == count);
1305 KASSERT(RB_BLACK_P(rbt->rbt_root));
1306 KASSERT(RB_SENTINEL_P(rbt->rbt_root)
Indexes created Sun Sep 28 07:09:56 GMT 2025