Lines Matching refs:left
83 deallocated, we just need to process left and right. */
85 if (active->left)
87 KDEL (active->left->key);
88 VDEL (active->left->value);
89 active->left->key = (splay_tree_key)pending;
90 pending = (splay_tree_node)(active->left);
109 /* Rotate the edge joining the left child N with its parent P. PP is the
118 p->left = tmp;
129 tmp = n->left;
130 n->left = p;
156 c = n->left;
162 /* Next one left or right? If found or no child, we're done
166 || (cmp2 < 0 && !c->left)
179 rotate_left (&n->left, c, c->left);
180 rotate_left (&sp->root, n, n->left);
189 rotate_right (&n->left, c, c->right);
190 rotate_left (&sp->root, n, n->left);
194 rotate_left (&n->right, c, c->left);
214 val = splay_tree_foreach_helper (sp, node->left, fn, data);
324 node->left = node->right = 0;
327 node->left = sp->root;
328 node->right = node->left->right;
329 node->left->right = 0;
334 node->left = node->right->left;
335 node->right->left = 0;
353 splay_tree_node left, right;
355 left = sp->root->left;
365 if (left)
367 sp->root = left;
370 right-most leaf of the left child. */
373 while (left->right)
374 left = left->right;
375 left->right = right;
423 while (n->left)
424 n = n->left;
451 /* Otherwise, find the rightmost element of the left subtree. */
452 node = sp->root->left;
485 while (node->left)
486 node = node->left;