contrib/gcc/tree-outof-ssa.c

311 /* Find all the nodes in GRAPH which are successors to NODE in the
315 #define FOR_EACH_ELIM_GRAPH_SUCC(GRAPH, NODE, VAR, CODE)		\
319   for (x_ = 0; x_ < VEC_length (int, (GRAPH)->edge_list); x_ += 2)	\
321       y_ = VEC_index (int, (GRAPH)->edge_list, x_);			\
324       (VAR) = VEC_index (int, (GRAPH)->edge_list, x_ + 1);		\
331    GRAPH.  VAR will hold the partition number found.  CODE is the
334 #define FOR_EACH_ELIM_GRAPH_PRED(GRAPH, NODE, VAR, CODE)		\
338   for (x_ = 0; x_ < VEC_length (int, (GRAPH)->edge_list); x_ += 2)	\
340       y_ = VEC_index (int, (GRAPH)->edge_list, x_ + 1);			\
343       (VAR) = VEC_index (int, (GRAPH)->edge_list, x_);			\
573 /* Coalesce partitions in MAP which are live across abnormal edges in GRAPH.