143   if (sp->root == 0)  in splay_tree_splay()
150     n = sp->root;  in splay_tree_splay()
173 	  rotate_left (&sp->root, n, c);  in splay_tree_splay()
175 	  rotate_right (&sp->root, n, c);  in splay_tree_splay()
183 	rotate_left (&sp->root, n, n->left);  in splay_tree_splay()
188 	rotate_right (&sp->root, n, n->right);  in splay_tree_splay()
193 	rotate_left (&sp->root, n, n->left);  in splay_tree_splay()
198 	rotate_right (&sp->root, n, n->right);  in splay_tree_splay()
343   sp->root = 0;  in splay_tree_new_typed_alloc()
359   splay_tree_delete_helper (sp, sp->root);  in splay_tree_delete()
374   if (sp->root)  in splay_tree_insert()
375     comparison = (*sp->comp)(sp->root->key, key);  in splay_tree_insert()
377   if (sp->root && comparison == 0)  in splay_tree_insert()
382 	(*sp->delete_key) (sp->root->key);  in splay_tree_insert()
384 	(*sp->delete_value)(sp->root->value);  in splay_tree_insert()
385       sp->root->key = key;  in splay_tree_insert()
386       sp->root->value = value;  in splay_tree_insert()
399       if (!sp->root)  in splay_tree_insert()
403 	  node->left = sp->root;  in splay_tree_insert()
409 	  node->right = sp->root;  in splay_tree_insert()
414       sp->root = node;  in splay_tree_insert()
417   return sp->root;  in splay_tree_insert()
427   if (sp->root && (*sp->comp) (sp->root->key, key) == 0)  in splay_tree_remove()
431       left = sp->root->left;  in splay_tree_remove()
432       right = sp->root->right;  in splay_tree_remove()
436 	(*sp->delete_key) (sp->root->key);  in splay_tree_remove()
438 	(*sp->delete_value) (sp->root->value);  in splay_tree_remove()
439       (*sp->deallocate) (sp->root, sp->allocate_data);  in splay_tree_remove()
445 	  sp->root = left;  in splay_tree_remove()
457 	sp->root = right;  in splay_tree_remove()
469   if (sp->root && (*sp->comp)(sp->root->key, key) == 0)  in splay_tree_lookup()
470     return sp->root;  in splay_tree_lookup()
480   splay_tree_node n = sp->root;  in splay_tree_max()
496   splay_tree_node n = sp->root;  in splay_tree_min()
517   if (!sp->root)  in splay_tree_predecessor()
523   comparison = (*sp->comp)(sp->root->key, key);  in splay_tree_predecessor()
527     return sp->root;  in splay_tree_predecessor()
530   node = sp->root->left;  in splay_tree_predecessor()
548   if (!sp->root)  in splay_tree_successor()
554   comparison = (*sp->comp)(sp->root->key, key);  in splay_tree_successor()
558     return sp->root;  in splay_tree_successor()
561   node = sp->root->right;  in splay_tree_successor()
577   return splay_tree_foreach_helper (sp->root, fn, data);  in splay_tree_foreach()