Lines Matching defs:node
58 The node and pred/succ list is a simple linear list of nodes and
269 elim_graph_add_node (elim_graph g, tree node)
275 if (t == node)
277 VEC_safe_push (tree, heap, g->nodes, node);
292 return the successor node. -1 is returned if there is no such edge. */
295 elim_graph_remove_succ_edge (elim_graph g, int node)
300 if (VEC_index (int, g->edge_list, x) == node)
313 code fragment executed for every node found. */
332 code fragment executed for every node found. */
1089 /* Remove any PHI node which is a virtual PHI. */
1156 /* When PHI nodes are turned into copies, the result of each PHI node
1403 /* Allocate a new value list node. Take it from the free list in TABLE if
1422 /* Add value list node P to the free list in TABLE. */
1471 /* Add value node INFO if it's value isn't already in LIST. Free INFO if
2421 /* Search every PHI node for arguments associated with backedges which
2497 the PHI node. */