93 	  if (active->right)  in splay_tree_delete_helper()
95 	      KDEL (active->right->key);  in splay_tree_delete_helper()
96 	      VDEL (active->right->value);  in splay_tree_delete_helper()
97 	      active->right->key = (splay_tree_key)pending;  in splay_tree_delete_helper()
98 	      pending = (splay_tree_node)(active->right);  in splay_tree_delete_helper()
117   tmp = n->right;  in rotate_left()
118   n->right = p;  in rotate_left()
132   p->right = tmp;  in rotate_right()
159       c = n->right;  in splay_tree_splay()
168         || (cmp2 > 0 && !c->right))  in splay_tree_splay()
185 	rotate_right (&n->right, c, c->right);  in splay_tree_splay()
186 	rotate_right (&sp->root, n, n->right);  in splay_tree_splay()
190 	rotate_right (&n->left, c, c->right);  in splay_tree_splay()
195 	rotate_left (&n->right, c, c->left);  in splay_tree_splay()
196 	rotate_right (&sp->root, n, n->right);  in splay_tree_splay()
246       node = node->right;  in splay_tree_foreach_helper()
391 	node->left = node->right = 0;  in splay_tree_insert()
395 	  node->right = node->left->right;  in splay_tree_insert()
396 	  node->left->right = 0;  in splay_tree_insert()
400 	  node->right = sp->root;  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
423       right = sp->root->right;  in splay_tree_remove()
438 	  if (right)  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()
446 	sp->root = right;  in splay_tree_remove()
474   while (n->right)  in splay_tree_max()
475     n = n->right;  in splay_tree_max()
521     while (node->right)  in splay_tree_predecessor()
522       node = node->right;  in splay_tree_predecessor()
550   node = sp->root->right;  in splay_tree_successor()