Lines Matching refs:nodes
58 The node and pred/succ list is a simple linear list of nodes and
59 edges represented as pairs of nodes.
71 each other. This means that no virtual PHI nodes are included, and
74 This also limits the number of possible nodes that are involved to
76 of nodes encountered was 12. */
82 /* List of nodes in the elimination graph. */
83 VEC(tree,heap) *nodes;
91 /* Stack for visited nodes. */
214 /* Create an elimination graph with SIZE nodes and associated data
222 g->nodes = VEC_alloc (tree, heap, 30);
238 VEC_truncate (tree, g->nodes, 0);
252 VEC_free (tree, heap, g->nodes);
257 /* Return the number of nodes in graph G. */
262 return VEC_length (tree, g->nodes);
274 for (x = 0; VEC_iterate (tree, g->nodes, x, t); x++)
277 VEC_safe_push (tree, heap, g->nodes, node);
311 /* Find all the nodes in GRAPH which are successors to NODE in the
330 /* Find all the nodes which are predecessors of NODE in the edge list for
493 /* Eliminate all the phi nodes on edge E in graph G. */
518 for (x = 0; VEC_iterate (tree, g->nodes, x, var); x++)
1156 /* When PHI nodes are turned into copies, the result of each PHI node
1167 /* Skip virtual PHI nodes. */
1205 fprintf (dump_file, "Coalesce list from phi nodes:\n");
1905 /* Replace PHI nodes with any required copies. */
2404 /* Remove phi nodes which have been translated back to real variables. */