Lines Matching defs:node
57 /* Obtain a new queue node. */
70 dq->node = splay_tree_insert (di->nodes, (splay_tree_key) t,
102 /* If there's no node, just return. This makes for fewer checks in
107 /* See if we've already queued or dumped this node. */
115 /* Print the index of the node. */
222 /* Dump the next node in the queue. */
236 /* Get the next node from the queue. */
238 stn = dq->node;
243 /* Remove the node from the queue, and put it on the free list. */
250 /* Print the node index. */
252 /* And the type of node this is. */
260 /* Figure out what kind of node this is. */
696 is not the root node of the dump. */
698 int dump_flag (dump_info_p di, int flag, tree node)
700 return (di->flags & flag) && (node != di->node);
720 di.node = t;
724 /* Queue up the first node. */