Lines Matching refs:right
83 deallocated, we just need to process left and right. */
92 if (active->right)
94 KDEL (active->right->key);
95 VDEL (active->right->value);
96 active->right->key = (splay_tree_key)pending;
97 pending = (splay_tree_node)(active->right);
116 tmp = n->right;
117 n->right = p;
122 /* Rotate the edge joining the right child N with its parent P. PP is the
131 p->right = tmp;
154 /* Left or right? If no child, then we're done. */
158 c = n->right;
162 /* Next one left or right? If found or no child, we're done
167 || (cmp2 > 0 && !c->right))
184 rotate_right (&n->right, c, c->right);
185 rotate_right (&sp->root, n, n->right);
189 rotate_right (&n->left, c, c->right);
194 rotate_left (&n->right, c, c->left);
195 rotate_right (&sp->root, n, n->right);
222 return splay_tree_foreach_helper (sp, node->right, fn, data);
324 node->left = node->right = 0;
328 node->right = node->left->right;
329 node->left->right = 0;
333 node->right = sp->root;
334 node->left = node->right->left;
335 node->right->left = 0;
353 splay_tree_node left, right;
356 right = sp->root->right;
369 /* If there was a right child as well, hang it off the
370 right-most leaf of the left child. */
371 if (right)
373 while (left->right)
374 left = left->right;
375 left->right = right;
379 sp->root = right;
407 while (n->right)
408 n = n->right;
454 while (node->right)
455 node = node->right;
482 /* Otherwise, find the leftmost element of the right subtree. */
483 node = sp->root->right;