86 	  if (active->left)  in splay_tree_delete_helper()
88 	      KDEL (active->left->key);  in splay_tree_delete_helper()
89 	      VDEL (active->left->value);  in splay_tree_delete_helper()
90 	      active->left->key = (splay_tree_key)pending;  in splay_tree_delete_helper()
91 	      pending = (splay_tree_node)(active->left);  in splay_tree_delete_helper()
119   p->left = tmp;  in rotate_left()
130   tmp = n->left;  in rotate_right()
131   n->left = p;  in rotate_right()
157       c = n->left;  in splay_tree_splay()
167         || (cmp2 < 0 && !c->left)  in splay_tree_splay()
180 	rotate_left (&n->left, c, c->left);  in splay_tree_splay()
181 	rotate_left (&sp->root, n, n->left);  in splay_tree_splay()
190 	rotate_right (&n->left, c, c->right);  in splay_tree_splay()
191 	rotate_left (&sp->root, n, n->left);  in splay_tree_splay()
195 	rotate_left (&n->right, c, c->left);  in splay_tree_splay()
234 	  node = node->left;  in splay_tree_foreach_helper()
391 	node->left = node->right = 0;  in splay_tree_insert()
394 	  node->left = sp->root;  in splay_tree_insert()
395 	  node->right = node->left->right;  in splay_tree_insert()
396 	  node->left->right = 0;  in splay_tree_insert()
401 	  node->left = node->right->left;  in splay_tree_insert()
402 	  node->right->left = 0;  in splay_tree_insert()
420       splay_tree_node left, right;  in splay_tree_remove()  local
422       left = sp->root->left;  in splay_tree_remove()
432       if (left)  in splay_tree_remove()
434 	  sp->root = left;  in splay_tree_remove()
440 	      while (left->right)  in splay_tree_remove()
441 		left = left->right;  in splay_tree_remove()
442 	      left->right = right;  in splay_tree_remove()
490   while (n->left)  in splay_tree_min()
491     n = n->left;  in splay_tree_min()
519   node = sp->root->left;  in splay_tree_predecessor()
552     while (node->left)  in splay_tree_successor()
553       node = node->left;  in splay_tree_successor()