Home
last modified time | relevance | path

Searched refs:num_edges (Results 1 – 11 of 11) sorted by relevance

/netbsd/src/external/gpl3/gcc/dist/gcc/
Dlcm.cc173 int x, num_edges; in compute_earliest() local
176 num_edges = NUM_EDGES (edge_list); in compute_earliest()
179 for (x = 0; x < num_edges; x++) in compute_earliest()
234 int num_edges, i; in compute_laterin() local
240 num_edges = NUM_EDGES (edge_list); in compute_laterin()
249 for (i = 0; i < num_edges; i++) in compute_laterin()
262 bitmap_vector_ones (later, num_edges); in compute_laterin()
377 int num_edges; in pre_edge_lcm_avs() local
380 num_edges = NUM_EDGES (edge_list); in pre_edge_lcm_avs()
418 earliest = sbitmap_vector_alloc (num_edges, n_exprs); in pre_edge_lcm_avs()
[all …]
Dprofile.cc116 int num_edges = NUM_EDGES (el); in instrument_edges() local
140 total_num_blocks_created += num_edges; in instrument_edges()
206 unsigned num_edges = 0; in get_exec_counts() local
218 num_edges++; in get_exec_counts()
222 lineno_checksum, num_edges); in get_exec_counts()
353 int num_edges = 0; in read_profile_edge_counts() local
368 num_edges++; in read_profile_edge_counts()
387 return num_edges; in read_profile_edge_counts()
425 int num_edges = 0; in compute_branch_probabilities() local
463 num_edges = read_profile_edge_counts (exec_counts); in compute_branch_probabilities()
[all …]
Dcfganal.cc261 int num_edges; in create_edge_list() local
267 num_edges = 0; in create_edge_list()
271 num_edges += EDGE_COUNT (bb->succs); in create_edge_list()
275 elist->num_edges = num_edges; in create_edge_list()
276 elist->index_to_edge = XNEWVEC (edge, num_edges); in create_edge_list()
278 num_edges = 0; in create_edge_list()
284 elist->index_to_edge[num_edges++] = e; in create_edge_list()
309 n_basic_blocks_for_fn (cfun), elist->num_edges); in print_edge_list()
311 for (x = 0; x < elist->num_edges; x++) in print_edge_list()
446 int num_edges = 0; in control_dependences() local
[all …]
Dmcf.cc111 int num_edges; member
282 fnum_edges = fixup_graph->num_edges; in dump_fixup_graph()
367 fixup_edge_p curr_edge = fixup_graph->edge_list + fixup_graph->num_edges; in add_edge()
371 fixup_graph->num_edges++; in add_edge()
550 gcc_assert (fixup_graph->num_edges <= fnum_edges_after_transform); in create_fixup_graph()
552 fnum_edges_after_transform = fixup_graph->num_edges; in create_fixup_graph()
651 fnum_edges = fixup_graph->num_edges; in create_fixup_graph()
798 fnum_edges = fixup_graph->num_edges; in cancel_negative_cycle()
938 fnum_edges = fixup_graph->num_edges; in compute_residual_flow()
1038 fnum_edges = fixup_graph->num_edges; in find_max_flow()
[all …]
Dcfganal.h28 int num_edges; member
Dgcse.cc2105 int e, i, j, num_edges, set_size, did_insert = 0; in pre_edge_insert() local
2112 num_edges = NUM_EDGES (edge_list); in pre_edge_insert()
2113 inserted = sbitmap_vector_alloc (num_edges, expr_hash_table.n_elems); in pre_edge_insert()
2114 bitmap_vector_clear (inserted, num_edges); in pre_edge_insert()
2116 for (e = 0; e < num_edges; e++) in pre_edge_insert()
Dbasic-block.h291 #define NUM_EDGES(el) ((el)->num_edges)
Dcfghooks.cc1357 edge *edges, unsigned num_edges, edge *new_edges, in copy_bbs() argument
1420 for (j = 0; j < num_edges; j++) in copy_bbs()
Dtree-cfg.cc2591 long num_edges; in dump_cfg_stats() local
2611 num_edges = 0; in dump_cfg_stats()
2613 num_edges += EDGE_COUNT (bb->succs); in dump_cfg_stats()
2614 size = num_edges * sizeof (class edge_def); in dump_cfg_stats()
2616 fprintf (file, fmt_str_2, "Edges", num_edges, SIZE_AMOUNT (size)); in dump_cfg_stats()
Dtree-ssa-structalias.cc238 unsigned int num_edges; member
1222 stats.num_edges++; in add_graph_edge()
7129 fprintf (outfile, "Number of edges: %d\n", stats.num_edges); in dump_sa_points_to_info()
DChangeLog-20051722 (struct constraint_stats): Add num_edges.
11805 and use it when printing num_edges.
24698 * cfglayout.c (copy_bbs): Rename n_edges to num_edges.