72   if (sp->root == NULL)  in splay_tree_splay()
79     n = sp->root;  in splay_tree_splay()
102 	  rotate_left (&sp->root, n, c);  in splay_tree_splay()
104 	  rotate_right (&sp->root, n, c);  in splay_tree_splay()
112 	rotate_left (&sp->root, n, n->left);  in splay_tree_splay()
117 	rotate_right (&sp->root, n, n->right);  in splay_tree_splay()
122 	rotate_left (&sp->root, n, n->left);  in splay_tree_splay()
127 	rotate_right (&sp->root, n, n->right);  in splay_tree_splay()
141   if (sp->root)  in splay_tree_insert()
142     comparison = splay_compare (&sp->root->key, &node->key);  in splay_tree_insert()
144   if (sp->root && comparison == 0)  in splay_tree_insert()
149       if (sp->root == NULL)  in splay_tree_insert()
153 	  node->left = sp->root;  in splay_tree_insert()
159 	  node->right = sp->root;  in splay_tree_insert()
164       sp->root = node;  in splay_tree_insert()
175   if (sp->root && splay_compare (&sp->root->key, key) == 0)  in splay_tree_remove()
179       left = sp->root->left;  in splay_tree_remove()
180       right = sp->root->right;  in splay_tree_remove()
186 	  sp->root = left;  in splay_tree_remove()
198 	sp->root = right;  in splay_tree_remove()
210   if (sp->root && splay_compare (&sp->root->key, key) == 0)  in splay_tree_lookup()
211     return &sp->root->key;  in splay_tree_lookup()
237   splay_tree_foreach_internal (sp->root, func, data);  in splay_tree_foreach()