binutils/libiberty/splay-tree.c

52 splay_tree_delete_helper (splay_tree sp, splay_tree_node node)
57   if (!node)
63   KDEL (node->key);
64   VDEL (node->value);
67   node->key = (splay_tree_key)pending;
68   pending = (splay_tree_node)node;
82 	  /* active points to a node which has its key and value
200 /* Call FN, passing it the DATA, for every node below NODE, all of
206 splay_tree_foreach_helper (splay_tree sp, splay_tree_node node,
211   if (!node)
214   val = splay_tree_foreach_helper (sp, node->left, fn, data);
218   val = (*fn)(node, data);
222   return splay_tree_foreach_helper (sp, node->right, fn, data);
290 /* Insert a new node (associating KEY with DATA) into SP.  If a
291    previous node with the indicated KEY exists, its data is replaced
292    with the new value.  Returns the new node.  */
314       /* Create a new node, and insert it at the root.  */
315       splay_tree_node node;
317       node = ((splay_tree_node)
320       node->key = key;
321       node->value = value;
324 	node->left = node->right = 0;
327 	  node->left = sp->root;
328 	  node->right = node->left->right;
329 	  node->left->right = 0;
333 	  node->right = sp->root;
334 	  node->left = node->right->left;
335 	  node->right->left = 0;
338       sp->root = node;
358       /* Delete the root node itself.  */
397 /* Return the node in SP with the greatest key.  */
413 /* Return the node in SP with the smallest key.  */
436   splay_tree_node node;
452   node = sp->root->left;
453   if (node)
454     while (node->right)
455       node = node->right;
457   return node;
467   splay_tree_node node;
483   node = sp->root->right;
484   if (node)
485     while (node->left)
486       node = node->left;
488   return node;
491 /* Call FN, passing it the DATA, for every node in SP, following an