85 	  if (active->left)  in splay_tree_delete_helper()
87 	      KDEL (active->left->key);  in splay_tree_delete_helper()
88 	      VDEL (active->left->value);  in splay_tree_delete_helper()
89 	      active->left->key = (splay_tree_key)pending;  in splay_tree_delete_helper()
90 	      pending = (splay_tree_node)(active->left);  in splay_tree_delete_helper()
118   p->left = tmp;  in rotate_left()
129   tmp = n->left;  in rotate_right()
130   n->left = p;  in rotate_right()
156       c = n->left;  in splay_tree_splay()
166         || (cmp2 < 0 && !c->left)  in splay_tree_splay()
179 	rotate_left (&n->left, c, c->left);  in splay_tree_splay()
180 	rotate_left (&sp->root, n, n->left);  in splay_tree_splay()
189 	rotate_right (&n->left, c, c->right);  in splay_tree_splay()
190 	rotate_left (&sp->root, n, n->left);  in splay_tree_splay()
194 	rotate_left (&n->right, c, c->left);  in splay_tree_splay()
214   val = splay_tree_foreach_helper (sp, node->left, fn, data);  in splay_tree_foreach_helper()
324 	node->left = node->right = 0;  in splay_tree_insert()
327 	  node->left = sp->root;  in splay_tree_insert()
328 	  node->right = node->left->right;  in splay_tree_insert()
329 	  node->left->right = 0;  in splay_tree_insert()
334 	  node->left = node->right->left;  in splay_tree_insert()
335 	  node->right->left = 0;  in splay_tree_insert()
353       splay_tree_node left, right;  in splay_tree_remove()  local
355       left = sp->root->left;  in splay_tree_remove()
365       if (left)  in splay_tree_remove()
367 	  sp->root = left;  in splay_tree_remove()
373 	      while (left->right)  in splay_tree_remove()
374 		left = left->right;  in splay_tree_remove()
375 	      left->right = right;  in splay_tree_remove()
423   while (n->left)  in splay_tree_min()
424     n = n->left;  in splay_tree_min()
452   node = sp->root->left;  in splay_tree_predecessor()
485     while (node->left)  in splay_tree_successor()
486       node = node->left;  in splay_tree_successor()