Home
last modified time | relevance | path

Searched refs:implicit_preds (Results 1 – 3 of 3) sorted by relevance

/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dtree-ssa-structalias.c556 bitmap *implicit_preds; member
1150 if (!graph->implicit_preds[to]) in add_implicit_graph_edge()
1151 graph->implicit_preds[to] = BITMAP_ALLOC (&predbitmap_obstack); in add_implicit_graph_edge()
1153 if (bitmap_set_bit (graph->implicit_preds[to], from)) in add_implicit_graph_edge()
1235 graph->implicit_preds = XCNEWVEC (bitmap, graph->size); in build_pred_graph()
2056 EXECUTE_IF_IN_NONNULL_BITMAP (graph->implicit_preds[n], 0, i, bi) in condense_visit()
2118 if (graph->implicit_preds[b]) in condense_visit()
2120 if (!graph->implicit_preds[a]) in condense_visit()
2121 std::swap (graph->implicit_preds[a], in condense_visit()
2122 graph->implicit_preds[b]); in condense_visit()
[all …]
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dtree-ssa-structalias.cc564 bitmap *implicit_preds; member
1164 if (!graph->implicit_preds[to]) in add_implicit_graph_edge()
1165 graph->implicit_preds[to] = BITMAP_ALLOC (&predbitmap_obstack); in add_implicit_graph_edge()
1167 if (bitmap_set_bit (graph->implicit_preds[to], from)) in add_implicit_graph_edge()
1265 graph->implicit_preds = XCNEWVEC (bitmap, graph->size); in build_pred_graph()
2065 EXECUTE_IF_IN_NONNULL_BITMAP (graph->implicit_preds[n], 0, i, bi) in condense_visit()
2127 if (graph->implicit_preds[b]) in condense_visit()
2129 if (!graph->implicit_preds[a]) in condense_visit()
2130 std::swap (graph->implicit_preds[a], in condense_visit()
2131 graph->implicit_preds[b]); in condense_visit()
[all …]
H A DChangeLog-200731901 (constraint_graph): Add size, implicit_preds, rep,