Lines Matching refs:x_p
232 /* x_p is always the parent node of X. We have to track this
235 struct rb_node *x, *x_p;
240 x_p = rb_node_parent(z);
244 x_p = rb_node_parent(z);
253 x_p = y;
255 x_p = rb_node_parent(y);
267 assert(x_p == NULL || x == x_p->left || x == x_p->right);
274 if (x == x_p->left) {
275 struct rb_node *w = x_p->right;
278 rb_node_set_red(x_p);
279 rb_tree_rotate_left(T, x_p);
280 assert(x == x_p->left);
281 w = x_p->right;
285 x = x_p;
291 w = x_p->right;
293 rb_node_copy_color(w, x_p);
294 rb_node_set_black(x_p);
296 rb_tree_rotate_left(T, x_p);
300 struct rb_node *w = x_p->left;
303 rb_node_set_red(x_p);
304 rb_tree_rotate_right(T, x_p);
305 assert(x == x_p->right);
306 w = x_p->left;
310 x = x_p;
316 w = x_p->left;
318 rb_node_copy_color(w, x_p);
319 rb_node_set_black(x_p);
321 rb_tree_rotate_right(T, x_p);
325 x_p = rb_node_parent(x);