88 	  if (active->left)  in splay_tree_delete_helper()
90 	      KDEL (active->left->key);  in splay_tree_delete_helper()
91 	      VDEL (active->left->value);  in splay_tree_delete_helper()
92 	      active->left->key = (splay_tree_key)pending;  in splay_tree_delete_helper()
93 	      pending = (splay_tree_node)(active->left);  in splay_tree_delete_helper()
121   p->left = tmp;  in rotate_left()
132   tmp = n->left;  in rotate_right()
133   n->left = p;  in rotate_right()
159       c = n->left;  in splay_tree_splay()
169         || (cmp2 < 0 && !c->left)  in splay_tree_splay()
182 	rotate_left (&n->left, c, c->left);  in splay_tree_splay()
183 	rotate_left (&sp->root, n, n->left);  in splay_tree_splay()
192 	rotate_right (&n->left, c, c->right);  in splay_tree_splay()
193 	rotate_left (&sp->root, n, n->left);  in splay_tree_splay()
197 	rotate_left (&n->right, c, c->left);  in splay_tree_splay()
236 	  node = node->left;  in splay_tree_foreach_helper()
400 	node->left = node->right = 0;  in splay_tree_insert()
403 	  node->left = sp->root;  in splay_tree_insert()
404 	  node->right = node->left->right;  in splay_tree_insert()
405 	  node->left->right = 0;  in splay_tree_insert()
410 	  node->left = node->right->left;  in splay_tree_insert()
411 	  node->right->left = 0;  in splay_tree_insert()
429       splay_tree_node left, right;  in splay_tree_remove()  local
431       left = sp->root->left;  in splay_tree_remove()
443       if (left)  in splay_tree_remove()
445 	  sp->root = left;  in splay_tree_remove()
451 	      while (left->right)  in splay_tree_remove()
452 		left = left->right;  in splay_tree_remove()
453 	      left->right = right;  in splay_tree_remove()
501   while (n->left)  in splay_tree_min()
502     n = n->left;  in splay_tree_min()
530   node = sp->root->left;  in splay_tree_predecessor()
563     while (node->left)  in splay_tree_successor()
564       node = node->left;  in splay_tree_successor()