Searched refs:eq_rep (Results 1 – 2 of 2) sorted by relevance
| /dflybsd-src/contrib/gcc-4.7/gcc/ |
| H A D | tree-ssa-structalias.c | 529 int *eq_rep; local
1205 graph->eq_rep = XNEWVEC (int, graph->size); in build_pred_graph()
1217 graph->eq_rep[j] = -1; in build_pred_graph()
2280 free (graph->eq_rep); in free_var_substitution_info()
2303 if (graph->eq_rep[label] != -1) in find_equivalent_node()
2306 if (unite (graph->eq_rep[label], node)) in find_equivalent_node()
2307 unify_nodes (graph, graph->eq_rep[label], node, false); in find_equivalent_node()
2308 return graph->eq_rep[label]; in find_equivalent_node()
2312 graph->eq_rep[label] = node; in find_equivalent_node()
|
| /dflybsd-src/contrib/gcc-8.0/gcc/ |
| H A D | tree-ssa-structalias.c | 564 int *eq_rep; member
1234 graph->eq_rep = XNEWVEC (int, graph->size); in build_pred_graph()
1246 graph->eq_rep[j] = -1; in build_pred_graph()
2425 free (graph->eq_rep); in free_var_substitution_info()
2450 if (graph->eq_rep[label] != -1) in find_equivalent_node()
2453 if (unite (graph->eq_rep[label], node)) in find_equivalent_node()
2454 unify_nodes (graph, graph->eq_rep[label], node, false); in find_equivalent_node()
2455 return graph->eq_rep[label]; in find_equivalent_node()
2459 graph->eq_rep[label] = node; in find_equivalent_node()
|