dist/libiberty/splay-tree.c

55 splay_tree_delete_helper (splay_tree sp, splay_tree_node node)
60   if (!node)
66   KDEL (node->key);
67   VDEL (node->value);
70   node->key = (splay_tree_key)pending;
71   pending = (splay_tree_node)node;
85 	  /* active points to a node which has its key and value
203 /* Call FN, passing it the DATA, for every node below NODE, all of
209 splay_tree_foreach_helper (splay_tree_node node,
228       while (node != NULL)
235 	  stack[stack_ptr++] = node;
236 	  node = node->left;
242       node = stack[--stack_ptr];
244       val = (*fn) (node, data);
248       node = node->right;
322 tree is deleted using splay_tree_delete or when a node is removed
363 /* Insert a new node (associating KEY with DATA) into SP.  If a
364    previous node with the indicated KEY exists, its data is replaced
365    with the new value.  Returns the new node.  */
390       /* Create a new node, and insert it at the root.  */
391       splay_tree_node node;
393       node = ((splay_tree_node)
396       node->key = key;
397       node->value = value;
400 	node->left = node->right = 0;
403 	  node->left = sp->root;
404 	  node->right = node->left->right;
405 	  node->left->right = 0;
409 	  node->right = sp->root;
410 	  node->left = node->right->left;
411 	  node->right->left = 0;
414       sp->root = node;
434       /* Delete the root node itself.  */
475 /* Return the node in SP with the greatest key.  */
491 /* Return the node in SP with the smallest key.  */
514   splay_tree_node node;
530   node = sp->root->left;
531   if (node)
532     while (node->right)
533       node = node->right;
535   return node;
545   splay_tree_node node;
561   node = sp->root->right;
562   if (node)
563     while (node->left)
564       node = node->left;
566   return node;
569 /* Call FN, passing it the DATA, for every node in SP, following an