Searched refs:indirect_cycles (Results 1 – 1 of 1) sorted by relevance
456 int *indirect_cycles; member842 if (graph->indirect_cycles[from] != -1) in merge_graph_nodes()850 if (graph->indirect_cycles[to] == -1) in merge_graph_nodes()852 graph->indirect_cycles[to] = graph->indirect_cycles[from]; in merge_graph_nodes()856 unsigned int tonode = find (graph->indirect_cycles[to]); in merge_graph_nodes()857 unsigned int fromnode = find (graph->indirect_cycles[from]); in merge_graph_nodes()965 graph->indirect_cycles = XNEWVEC (int, VEC_length (varinfo_t, varmap)); in build_pred_graph()987 graph->indirect_cycles[j] = -1; in build_pred_graph()1192 graph->indirect_cycles[i - FIRST_REF_NODE] = lowest_node; in scc_visit()1989 if (graph->indirect_cycles[node] != -1 in eliminate_indirect_cycles()[all …]