Lines Matching refs:right
66 /* The left and right children, respectively. */
67 splay_tree_node_s *left, *right;
276 deallocated, we just need to process left and right. */
285 if (active->right)
287 KDEL (active->right->key);
288 VDEL (active->right->value);
289 active->right->back = pending;
290 pending = active->right;
310 tmp = n->right;
311 n->right = p;
316 /* Rotate the edge joining the right child N with its parent P. PP is the
328 p->right = tmp;
352 /* Left or right? If no child, then we're done. */
356 c = n->right;
360 /* Next one left or right? If found or no child, we're done
365 || (cmp2 > 0 && !c->right))
382 rotate_right (&n->right, c, c->right);
383 rotate_right (&root, n, n->right);
387 rotate_right (&n->left, c, c->right);
392 rotate_left (&n->right, c, c->left);
393 rotate_right (&root, n, n->right);
438 node = node->right;
478 node->left = node->right = 0;
482 node->right = node->left->right;
483 node->left->right = 0;
487 node->right = root;
488 node->left = node->right->left;
489 node->right->left = 0;
508 splay_tree_node left, right;
511 right = root->right;
523 /* If there was a right child as well, hang it off the
524 right-most leaf of the left child. */
525 if (right)
527 while (left->right)
528 left = left->right;
529 left->right = right;
533 root = right;
563 while (n->right)
564 n = n->right;
613 while (node->right)
614 node = node->right;
643 /* Otherwise, find the leftmost element of the right subtree. */
644 node = root->right;