141   if (sp->root == 0)  in splay_tree_splay()
148     n = sp->root;  in splay_tree_splay()
171 	  rotate_left (&sp->root, n, c);  in splay_tree_splay()
173 	  rotate_right (&sp->root, n, c);  in splay_tree_splay()
181 	rotate_left (&sp->root, n, n->left);  in splay_tree_splay()
186 	rotate_right (&sp->root, n, n->right);  in splay_tree_splay()
191 	rotate_left (&sp->root, n, n->left);  in splay_tree_splay()
196 	rotate_right (&sp->root, n, n->right);  in splay_tree_splay()
337   sp->root = 0;  in splay_tree_new_typed_alloc()
353   splay_tree_delete_helper (sp, sp->root);  in splay_tree_delete()
368   if (sp->root)  in splay_tree_insert()
369     comparison = (*sp->comp)(sp->root->key, key);  in splay_tree_insert()
371   if (sp->root && comparison == 0)  in splay_tree_insert()
376 	(*sp->delete_value)(sp->root->value);  in splay_tree_insert()
377       sp->root->value = value;  in splay_tree_insert()
390       if (!sp->root)  in splay_tree_insert()
394 	  node->left = sp->root;  in splay_tree_insert()
400 	  node->right = sp->root;  in splay_tree_insert()
405       sp->root = node;  in splay_tree_insert()
408   return sp->root;  in splay_tree_insert()
418   if (sp->root && (*sp->comp) (sp->root->key, key) == 0)  in splay_tree_remove()
422       left = sp->root->left;  in splay_tree_remove()
423       right = sp->root->right;  in splay_tree_remove()
427 	(*sp->delete_value) (sp->root->value);  in splay_tree_remove()
428       (*sp->deallocate) (sp->root, sp->allocate_data);  in splay_tree_remove()
434 	  sp->root = left;  in splay_tree_remove()
446 	sp->root = right;  in splay_tree_remove()
458   if (sp->root && (*sp->comp)(sp->root->key, key) == 0)  in splay_tree_lookup()
459     return sp->root;  in splay_tree_lookup()
469   splay_tree_node n = sp->root;  in splay_tree_max()
485   splay_tree_node n = sp->root;  in splay_tree_min()
506   if (!sp->root)  in splay_tree_predecessor()
512   comparison = (*sp->comp)(sp->root->key, key);  in splay_tree_predecessor()
516     return sp->root;  in splay_tree_predecessor()
519   node = sp->root->left;  in splay_tree_predecessor()
537   if (!sp->root)  in splay_tree_successor()
543   comparison = (*sp->comp)(sp->root->key, key);  in splay_tree_successor()
547     return sp->root;  in splay_tree_successor()
550   node = sp->root->right;  in splay_tree_successor()
566   return splay_tree_foreach_helper (sp->root, fn, data);  in splay_tree_foreach()