Lines Matching refs:RB_DIR_LEFT
108 rbt->rbt_minmax[RB_DIR_LEFT] = rbt->rbt_root; /* minimum node */
197 * just like rb_node->rb_nodes[RB_DIR_LEFT], we can use this fact to
203 position = RB_DIR_LEFT;
258 rbt->rbt_minmax[RB_DIR_LEFT] = self;
263 KASSERT(position == RB_DIR_LEFT || position == RB_DIR_RIGHT);
293 } else if (position == RB_DIR_LEFT) {
337 KASSERT(which == RB_DIR_LEFT || which == RB_DIR_RIGHT);
416 KASSERT(RB_DIR_RIGHT == 1 && RB_DIR_LEFT == 0);
527 * When removing the root, rbt->rbt_minmax[RB_DIR_LEFT] is
712 KASSERT(which == RB_DIR_LEFT || which == RB_DIR_RIGHT);
789 which = RB_LEFT_SENTINEL_P(self) ? RB_DIR_RIGHT : RB_DIR_LEFT;
818 KASSERT(which == RB_DIR_LEFT || which == RB_DIR_RIGHT);
970 KASSERT(direction == RB_DIR_LEFT || direction == RB_DIR_RIGHT);
1018 KASSERT(direction == RB_DIR_LEFT || direction == RB_DIR_RIGHT);
1091 KASSERT(RB_POSITION(self) == RB_DIR_LEFT);
1092 RB_DIR_LEFT] == self);
1101 if (RB_POSITION(self) == RB_DIR_LEFT) {
1103 KASSERT(RB_FATHER(self)->rb_nodes[RB_DIR_LEFT] == self);
1114 const struct rb_node *prev0 = rb_tree_iterate_const(rbt, self, RB_DIR_LEFT);
1119 KASSERT(prev0 != NULL || self == rbt->rbt_minmax[RB_DIR_LEFT]);
1264 prev0 = rb_tree_iterate_const(rbt, self, RB_DIR_LEFT);
1291 || rbt->rbt_minmax[RB_DIR_LEFT] == rbt->rbt_minmax[RB_DIR_RIGHT]);