Home | History | Annotate | Download | only in gen

Lines Matching refs:RB_FATHER

199 	 * updating RB_FATHER(rb_node)->rb_nodes[RB_POSITION(rb_node)] will
296 RB_NODETOITEM(rbto, RB_FATHER(self))) < 0);
297 RB_TAILQ_INSERT_BEFORE(RB_FATHER(self), self, rb_link);
300 RB_NODETOITEM(rbto, RB_FATHER(self)),
302 RB_TAILQ_INSERT_AFTER(&rbt->rbt_nodes, RB_FATHER(self),
332 struct rb_node * const grandpa = RB_FATHER(old_father);
340 KASSERT(RB_FATHER(old_child) == old_father);
394 struct rb_node * father = RB_FATHER(self);
395 struct rb_node * grandpa = RB_FATHER(father);
414 grandpa = RB_FATHER(father);
443 father = RB_FATHER(self);
470 KASSERT(RB_FATHER(father) == self);
472 KASSERT(RB_FATHER(self) == grandpa);
474 father = RB_FATHER(self);
485 KASSERT(RB_FATHER(self) == father);
486 KASSERT(RB_FATHER(self)->rb_nodes[RB_POSITION(self) ^ RB_DIR_OTHER] == grandpa);
501 struct rb_node *father = RB_FATHER(self);
556 struct rb_node *standin_father = RB_FATHER(standin);
665 RB_SET_FATHER(standin, RB_FATHER(self));
666 RB_FATHER(standin)->rb_nodes[RB_POSITION(standin)] = standin;
676 rbt->rbt_minmax[RB_POSITION(self)] = RB_FATHER(self);
706 struct rb_node *father = RB_FATHER(self);
873 parent = RB_FATHER(parent);
925 KASSERT(RB_FATHER(brother) == parent->rb_nodes[other]);
995 return RB_NODETOITEM(rbto, RB_FATHER(self));
996 self = RB_FATHER(self);
1042 return RB_FATHER(self);
1043 self = RB_FATHER(self);
1092 KASSERT(RB_FATHER(self)->rb_nodes[RB_DIR_LEFT] == self);
1093 KASSERT(RB_FATHER(self) == (const struct rb_node *) &rbt->rbt_root);
1097 RB_NODETOITEM(rbto, RB_FATHER(self)));
1103 KASSERT(RB_FATHER(self)->rb_nodes[RB_DIR_LEFT] == self);
1106 KASSERT(RB_FATHER(self)->rb_nodes[RB_DIR_RIGHT] == self);
1134 brother = RB_FATHER(self)->rb_nodes[RB_POSITION(self) ^ RB_DIR_OTHER];
1135 KASSERT(RB_BLACK_P(RB_FATHER(self)));
1186 && RB_BLACK_P(RB_FATHER(self))) {
1202 || RB_RED_P(RB_FATHER(relative)));
1211 || RB_ROOT_P(rbt, RB_FATHER(self))
1212 || RB_TWOCHILDREN_P(RB_FATHER(RB_FATHER(self))));