Home
last modified time | relevance | path

Searched refs:predbitmap_obstack (Results 1 – 2 of 2) sorted by relevance

/dragonfly/contrib/gcc-4.7/gcc/
HDtree-ssa-structalias.c205 static bitmap_obstack predbitmap_obstack; variable
1108 graph->implicit_preds[to] = BITMAP_ALLOC (&predbitmap_obstack); in add_implicit_graph_edge()
1123 graph->preds[to] = BITMAP_ALLOC (&predbitmap_obstack); in add_pred_graph_edge()
1207 graph->address_taken = BITMAP_ALLOC (&predbitmap_obstack); in build_pred_graph()
1249 graph->points_to[lhsvar] = BITMAP_ALLOC (&predbitmap_obstack); in build_pred_graph()
1253 graph->pointed_by[rhsvar] = BITMAP_ALLOC (&predbitmap_obstack); in build_pred_graph()
2088 graph->preds[n] = BITMAP_ALLOC (&predbitmap_obstack); in condense_visit()
2094 graph->implicit_preds[n] = BITMAP_ALLOC (&predbitmap_obstack); in condense_visit()
2101 graph->points_to[n] = BITMAP_ALLOC (&predbitmap_obstack); in condense_visit()
2122 graph->points_to[n] = BITMAP_ALLOC (&predbitmap_obstack); in label_visit()
[all …]
/dragonfly/contrib/gcc-8.0/gcc/
HDtree-ssa-structalias.c203 static bitmap_obstack predbitmap_obstack; variable
1144 graph->implicit_preds[to] = BITMAP_ALLOC (&predbitmap_obstack); in add_implicit_graph_edge()
1159 graph->preds[to] = BITMAP_ALLOC (&predbitmap_obstack); in add_pred_graph_edge()
1236 graph->address_taken = BITMAP_ALLOC (&predbitmap_obstack); in build_pred_graph()
1278 graph->points_to[lhsvar] = BITMAP_ALLOC (&predbitmap_obstack); in build_pred_graph()
1282 graph->pointed_by[rhsvar] = BITMAP_ALLOC (&predbitmap_obstack); in build_pred_graph()
2078 graph->preds[n] = BITMAP_ALLOC (&predbitmap_obstack); in condense_visit()
2084 graph->implicit_preds[n] = BITMAP_ALLOC (&predbitmap_obstack); in condense_visit()
2091 graph->points_to[n] = BITMAP_ALLOC (&predbitmap_obstack); in condense_visit()
2149 graph->points_to[n] = BITMAP_ALLOC (&predbitmap_obstack); in label_visit()
[all …]