Lines Matching refs:nodes
44 /* Add T to the end of the queue of nodes to dump. Returns the index
70 dq->node = splay_tree_insert (di->nodes, (splay_tree_key) t,
108 n = splay_tree_lookup (di->nodes, (splay_tree_key) t);
300 /* We can knock off a bunch of expression nodes in exactly the same
322 /* These nodes are handled explicitly below. */
403 /* Now handle the various kinds of nodes. */
561 /* These nodes are unary, but do not have code class `1'. */
574 /* These nodes are binary, but do not have code class `2'. */
721 di.nodes = splay_tree_new (splay_tree_compare_pointers, 0,
727 /* Until the queue is empty, keep dumping nodes. */
737 splay_tree_delete (di.nodes);