Lines Matching refs:key
63 KDEL (node->key);
66 /* We use the "key" field to hold the "next" pointer. */
67 node->key = (splay_tree_key)pending;
82 /* active points to a node which has its key and value
87 KDEL (active->left->key);
89 active->left->key = (splay_tree_key)pending;
94 KDEL (active->right->key);
96 active->right->key = (splay_tree_key)pending;
101 active = (splay_tree_node)(temp->key);
135 /* Bottom up splay of key. */
138 splay_tree_splay (splay_tree sp, splay_tree_key key)
148 cmp1 = (*sp->comp) (key, n->key);
164 cmp2 = (*sp->comp) (key, c->key);
295 splay_tree_insert (splay_tree sp, splay_tree_key key, splay_tree_value value)
299 splay_tree_splay (sp, key);
302 comparison = (*sp->comp)(sp->root->key, key);
320 node->key = key;
347 splay_tree_remove (splay_tree sp, splay_tree_key key)
349 splay_tree_splay (sp, key);
351 if (sp->root && (*sp->comp) (sp->root->key, key) == 0)
387 splay_tree_lookup (splay_tree sp, splay_tree_key key)
389 splay_tree_splay (sp, key);
391 if (sp->root && (*sp->comp)(sp->root->key, key) == 0)
397 /* Return the node in SP with the greatest key. */
413 /* Return the node in SP with the smallest key. */
433 splay_tree_predecessor (splay_tree sp, splay_tree_key key)
444 splay_tree_splay (sp, key);
445 comparison = (*sp->comp)(sp->root->key, key);
464 splay_tree_successor (splay_tree sp, splay_tree_key key)
475 splay_tree_splay (sp, key);
476 comparison = (*sp->comp)(sp->root->key, key);