Lines Matching refs:left
84 deallocated, we just need to process left and right. */
86 if (active->left)
88 KDEL (active->left->key);
89 VDEL (active->left->value);
90 active->left->key = (splay_tree_key)pending;
91 pending = (splay_tree_node)(active->left);
110 /* Rotate the edge joining the left child N with its parent P. PP is the
119 p->left = tmp;
130 tmp = n->left;
131 n->left = p;
155 /* Left or right? If no child, then we're done. */
157 c = n->left;
163 /* Next one left or right? If found or no child, we're done
167 || (cmp2 < 0 && !c->left)
180 rotate_left (&n->left, c, c->left);
181 rotate_left (&sp->root, n, n->left);
190 rotate_right (&n->left, c, c->right);
191 rotate_left (&sp->root, n, n->left);
195 rotate_left (&n->right, c, c->left);
234 node = node->left;
391 node->left = node->right = 0;
394 node->left = sp->root;
395 node->right = node->left->right;
396 node->left->right = 0;
401 node->left = node->right->left;
402 node->right->left = 0;
420 splay_tree_node left, right;
422 left = sp->root->left;
432 if (left)
434 sp->root = left;
437 right-most leaf of the left child. */
440 while (left->right)
441 left = left->right;
442 left->right = right;
490 while (n->left)
491 n = n->left;
518 /* Otherwise, find the rightmost element of the left subtree. */
519 node = sp->root->left;
552 while (node->left)
553 node = node->left;
