92 	  if (active->right)  in splay_tree_delete_helper()
94 	      KDEL (active->right->key);  in splay_tree_delete_helper()
95 	      VDEL (active->right->value);  in splay_tree_delete_helper()
96 	      active->right->key = (splay_tree_key)pending;  in splay_tree_delete_helper()
97 	      pending = (splay_tree_node)(active->right);  in splay_tree_delete_helper()
116   tmp = n->right;  in rotate_left()
117   n->right = p;  in rotate_left()
131   p->right = tmp;  in rotate_right()
158       c = n->right;  in splay_tree_splay()
167         || (cmp2 > 0 && !c->right))  in splay_tree_splay()
184 	rotate_right (&n->right, c, c->right);  in splay_tree_splay()
185 	rotate_right (&sp->root, n, n->right);  in splay_tree_splay()
189 	rotate_right (&n->left, c, c->right);  in splay_tree_splay()
194 	rotate_left (&n->right, c, c->left);  in splay_tree_splay()
195 	rotate_right (&sp->root, n, n->right);  in splay_tree_splay()
222   return splay_tree_foreach_helper (sp, node->right, fn, data);  in splay_tree_foreach_helper()
324 	node->left = node->right = 0;  in splay_tree_insert()
328 	  node->right = node->left->right;  in splay_tree_insert()
329 	  node->left->right = 0;  in splay_tree_insert()
333 	  node->right = sp->root;  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
356       right = sp->root->right;  in splay_tree_remove()
371 	  if (right)  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()
379 	sp->root = right;  in splay_tree_remove()
407   while (n->right)  in splay_tree_max()
408     n = n->right;  in splay_tree_max()
454     while (node->right)  in splay_tree_predecessor()
455       node = node->right;  in splay_tree_predecessor()
483   node = sp->root->right;  in splay_tree_successor()