Lines Matching refs:right
84 deallocated, we just need to process left and right. */
93 if (active->right)
95 KDEL (active->right->key);
96 VDEL (active->right->value);
97 active->right->key = (splay_tree_key)pending;
98 pending = (splay_tree_node)(active->right);
117 tmp = n->right;
118 n->right = p;
123 /* Rotate the edge joining the right child N with its parent P. PP is the
132 p->right = tmp;
155 /* Left or right? If no child, then we're done. */
159 c = n->right;
163 /* Next one left or right? If found or no child, we're done
168 || (cmp2 > 0 && !c->right))
185 rotate_right (&n->right, c, c->right);
186 rotate_right (&sp->root, n, n->right);
190 rotate_right (&n->left, c, c->right);
195 rotate_left (&n->right, c, c->left);
196 rotate_right (&sp->root, n, n->right);
246 node = node->right;
391 node->left = node->right = 0;
395 node->right = node->left->right;
396 node->left->right = 0;
400 node->right = sp->root;
401 node->left = node->right->left;
402 node->right->left = 0;
420 splay_tree_node left, right;
423 right = sp->root->right;
436 /* If there was a right child as well, hang it off the
437 right-most leaf of the left child. */
438 if (right)
440 while (left->right)
441 left = left->right;
442 left->right = right;
446 sp->root = right;
474 while (n->right)
475 n = n->right;
521 while (node->right)
522 node = node->right;
549 /* Otherwise, find the leftmost element of the right subtree. */
550 node = sp->root->right;
