140   if (sp->root == 0)  in splay_tree_splay()
147     n = sp->root;  in splay_tree_splay()
170 	  rotate_left (&sp->root, n, c);  in splay_tree_splay()
172 	  rotate_right (&sp->root, n, c);  in splay_tree_splay()
180 	rotate_left (&sp->root, n, n->left);  in splay_tree_splay()
185 	rotate_right (&sp->root, n, n->right);  in splay_tree_splay()
190 	rotate_left (&sp->root, n, n->left);  in splay_tree_splay()
195 	rotate_right (&sp->root, n, n->right);  in splay_tree_splay()
270   sp->root = 0;  in splay_tree_new_with_allocator()
286   splay_tree_delete_helper (sp, sp->root);  in splay_tree_delete()
301   if (sp->root)  in splay_tree_insert()
302     comparison = (*sp->comp)(sp->root->key, key);  in splay_tree_insert()
304   if (sp->root && comparison == 0)  in splay_tree_insert()
309 	(*sp->delete_value)(sp->root->value);  in splay_tree_insert()
310       sp->root->value = value;  in splay_tree_insert()
323       if (!sp->root)  in splay_tree_insert()
327 	  node->left = sp->root;  in splay_tree_insert()
333 	  node->right = sp->root;  in splay_tree_insert()
338       sp->root = node;  in splay_tree_insert()
341   return sp->root;  in splay_tree_insert()
351   if (sp->root && (*sp->comp) (sp->root->key, key) == 0)  in splay_tree_remove()
355       left = sp->root->left;  in splay_tree_remove()
356       right = sp->root->right;  in splay_tree_remove()
360 	(*sp->delete_value) (sp->root->value);  in splay_tree_remove()
361       (*sp->deallocate) (sp->root, sp->allocate_data);  in splay_tree_remove()
367 	  sp->root = left;  in splay_tree_remove()
379 	sp->root = right;  in splay_tree_remove()
391   if (sp->root && (*sp->comp)(sp->root->key, key) == 0)  in splay_tree_lookup()
392     return sp->root;  in splay_tree_lookup()
402   splay_tree_node n = sp->root;  in splay_tree_max()
418   splay_tree_node n = sp->root;  in splay_tree_min()
439   if (!sp->root)  in splay_tree_predecessor()
445   comparison = (*sp->comp)(sp->root->key, key);  in splay_tree_predecessor()
449     return sp->root;  in splay_tree_predecessor()
452   node = sp->root->left;  in splay_tree_predecessor()
470   if (!sp->root)  in splay_tree_successor()
476   comparison = (*sp->comp)(sp->root->key, key);  in splay_tree_successor()
480     return sp->root;  in splay_tree_successor()
483   node = sp->root->right;  in splay_tree_successor()
499   return splay_tree_foreach_helper (sp, sp->root, fn, data);  in splay_tree_foreach()