Lines Matching refs:right
86 deallocated, we just need to process left and right. */
95 if (active->right)
97 KDEL (active->right->key);
98 VDEL (active->right->value);
99 active->right->key = (splay_tree_key)pending;
100 pending = (splay_tree_node)(active->right);
119 tmp = n->right;
120 n->right = p;
125 /* Rotate the edge joining the right child N with its parent P. PP is the
134 p->right = tmp;
157 /* Left or right? If no child, then we're done. */
161 c = n->right;
165 /* Next one left or right? If found or no child, we're done
170 || (cmp2 > 0 && !c->right))
187 rotate_right (&n->right, c, c->right);
188 rotate_right (&sp->root, n, n->right);
192 rotate_right (&n->left, c, c->right);
197 rotate_left (&n->right, c, c->left);
198 rotate_right (&sp->root, n, n->right);
248 node = node->right;
400 node->left = node->right = 0;
404 node->right = node->left->right;
405 node->left->right = 0;
409 node->right = sp->root;
410 node->left = node->right->left;
411 node->right->left = 0;
429 splay_tree_node left, right;
432 right = sp->root->right;
447 /* If there was a right child as well, hang it off the
448 right-most leaf of the left child. */
449 if (right)
451 while (left->right)
452 left = left->right;
453 left->right = right;
457 sp->root = right;
485 while (n->right)
486 n = n->right;
532 while (node->right)
533 node = node->right;
560 /* Otherwise, find the leftmost element of the right subtree. */
561 node = sp->root->right;