Home
last modified time | relevance | path

Searched refs:new_graph (Results 1 – 16 of 16) sorted by relevance

/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dgraphds.h54 struct graph *new_graph (int);
H A Dcfgloopanal.c101 g = new_graph (last_basic_block_for_fn (cfun) + num); in mark_irreducible_loops()
H A Dgraphds.c55 new_graph (int n_vertices) in new_graph() function
H A Dgraphite-scop-detection.c1411 struct graph *g = new_graph (num_vertices); in build_alias_set()
H A Ddominance.c1491 g = new_graph (n + 1); in iterate_fix_dominators()
H A Dtree-loop-distribution.c801 rdg = new_graph (stmts.length ()); in build_rdg()
2258 graph *pg = new_graph (partitions->length ()); in build_partition_graph()
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dgraphds.h54 struct graph *new_graph (int);
H A Dgraphds.cc55 new_graph (int n_vertices) in new_graph() function
H A Dcfgloopanal.cc101 g = new_graph (last_basic_block_for_fn (cfun) + num); in mark_irreducible_loops()
H A Ddominance.cc1498 g = new_graph (n + 1); in iterate_fix_dominators()
H A Dgraphite-scop-detection.cc1409 struct graph *g = new_graph (num_vertices); in build_alias_set()
H A Dtree-loop-distribution.cc811 rdg = new_graph (stmts.length ()); in build_rdg()
2296 graph *pg = new_graph (partitions->length ()); in build_partition_graph()
H A Dtree-vect-slp.cc3649 struct graph *slpg = new_graph (vertices.length ()); in vect_optimize_slp()
H A DChangeLog-200718915 (struct edge, struct vertex, struct graph, dump_graph, new_graph,
H A DChangeLog-201331580 * graphds.c (new_graph): Initialize obstack and allocate
H A DChangeLog-200442044 (dump_graph, new_graph, add_edge, dfs, check_irred, for_each_edge,