Home
last modified time | relevance | path

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

/openbsd/gnu/gcc/gcc/
H A Dlcm.c185 int x, num_edges; in compute_earliest() local
188 num_edges = NUM_EDGES (edge_list); in compute_earliest()
193 for (x = 0; x < num_edges; x++) in compute_earliest()
251 int num_edges, i; in compute_laterin() local
266 for (i = 0; i < num_edges; i++) in compute_laterin()
387 int num_edges; in pre_edge_lcm() local
565 int x, num_edges; in compute_farthest() local
573 for (x = 0; x < num_edges; x++) in compute_farthest()
607 int num_edges, i; in compute_nearerout() local
621 for (i = 0; i < num_edges; i++) in compute_nearerout()
[all …]
H A Dprofile.c136 int num_edges = NUM_EDGES (el); in instrument_edges() local
231 unsigned num_edges = 0; in get_exec_counts() local
243 num_edges++; in get_exec_counts()
266 int num_edges = 0; in compute_branch_probabilities() local
325 num_edges++; in compute_branch_probabilities()
840 num_edges = NUM_EDGES (el); in branch_prob()
889 total_num_edges += num_edges; in branch_prob()
1103 int num_edges = NUM_EDGES (el); in find_spanning_tree() local
1116 for (i = 0; i < num_edges; i++) in find_spanning_tree()
1133 for (i = 0; i < num_edges; i++) in find_spanning_tree()
[all …]
H A Dcfganal.c343 int num_edges; in create_edge_list() local
350 num_edges = 0; in create_edge_list()
356 num_edges += EDGE_COUNT (bb->succs); in create_edge_list()
361 elist->num_edges = num_edges; in create_edge_list()
362 elist->index_to_edge = XNEWVEC (edge, num_edges); in create_edge_list()
364 num_edges = 0; in create_edge_list()
369 elist->index_to_edge[num_edges++] = e; in create_edge_list()
394 elist->num_blocks, elist->num_edges); in print_edge_list()
396 for (x = 0; x < elist->num_edges; x++) in print_edge_list()
539 flow_edge_list_print (const char *str, const edge *edge_list, int num_edges, FILE *file) in flow_edge_list_print() argument
[all …]
H A Dcfglayout.c1218 edge *edges, unsigned num_edges, edge *new_edges, in copy_bbs() argument
1258 for (j = 0; j < num_edges; j++) in copy_bbs()
1268 for (j = 0; j < num_edges; j++) in copy_bbs()
H A Dbasic-block.h553 int num_edges; member
576 #define NUM_EDGES(el) ((el)->num_edges)
H A Dloop-unroll.c1701 unsigned i, num_edges = 0; in analyze_insns_in_loop() local
1708 edge *edges = get_loop_exit_edges (loop, &num_edges); in analyze_insns_in_loop()
1728 if (num_edges == 1 in analyze_insns_in_loop()
H A Dcfgloop.c919 get_loop_exit_edges (const struct loop *loop, unsigned int *num_edges) in get_loop_exit_edges() argument
935 *num_edges = n; in get_loop_exit_edges()
H A Dtree-cfg.c2323 long num_edges; in dump_cfg_stats() local
2345 num_edges = 0; in dump_cfg_stats()
2347 num_edges += EDGE_COUNT (bb->succs); in dump_cfg_stats()
2348 size = num_edges * sizeof (struct edge_def); in dump_cfg_stats()
2350 fprintf (file, fmt_str_2, "Edges", num_edges, SCALE (size), LABEL (size)); in dump_cfg_stats()
H A Dgcse.c4117 int e, i, j, num_edges, set_size, did_insert = 0; in pre_edge_insert() local
4124 num_edges = NUM_EDGES (edge_list); in pre_edge_insert()
4125 inserted = sbitmap_vector_alloc (num_edges, expr_hash_table.n_elems); in pre_edge_insert()
4126 sbitmap_vector_zero (inserted, num_edges); in pre_edge_insert()
4128 for (e = 0; e < num_edges; e++) in pre_edge_insert()
H A Dsee.c1656 int num_edges = NUM_EDGES (edge_list); in see_pre_insert_extensions() local
1665 for (e = 0; e < num_edges; e++) in see_pre_insert_extensions()
H A Dtree-ssa-structalias.c204 unsigned int num_edges; member
933 stats.num_edges++; in add_graph_edge()
4532 fprintf (outfile, "Number of edges: %d\n", stats.num_edges); in dump_sa_points_to_info()
/openbsd/gnu/usr.bin/gcc/gcc/
H A Dlcm.c195 int x, num_edges; local
198 num_edges = NUM_EDGES (edge_list);
203 for (x = 0; x < num_edges; x++)
262 int num_edges, i; local
276 for (i = 0; i < num_edges; i++)
402 int num_edges; local
580 int x, num_edges; local
588 for (x = 0; x < num_edges; x++)
623 int num_edges, i; local
637 for (i = 0; i < num_edges; i++)
[all …]
H A Dprofile.c179 int num_edges = NUM_EDGES (el); local
255 int num_edges = 0; in get_exec_counts() local
280 num_edges++; in get_exec_counts()
290 for (i = 0; i < num_edges; i++) in get_exec_counts()
363 else if (arc_count != num_edges in get_exec_counts()
423 int num_edges = 0; in compute_branch_probabilities() local
463 num_edges++; in compute_branch_probabilities()
775 int num_edges, ignored_edges; in branch_prob() local
873 num_edges = NUM_EDGES (el); in branch_prob()
970 for (i = 0; i < num_edges; i++) in branch_prob()
[all …]
H A Dcfganal.c466 int num_edges; in create_edge_list() local
472 num_edges = 0; in create_edge_list()
479 num_edges++; in create_edge_list()
484 elist->num_edges = num_edges; in create_edge_list()
487 num_edges = 0; in create_edge_list()
492 elist->index_to_edge[num_edges++] = e; in create_edge_list()
520 elist->num_blocks - 2, elist->num_edges);
522 for (x = 0; x < elist->num_edges; x++)
644 flow_edge_list_print (str, edge_list, num_edges, file) in flow_edge_list_print() argument
647 int num_edges;
[all …]
H A Dsched-rgn.c381 int i, unreachable, num_edges; local
385 num_edges = NUM_EDGES (edge_list);
405 edge_table = (haifa_edge *) xcalloc (num_edges, sizeof (haifa_edge));
408 for (i = 0; i < num_edges; i++)
650 int num_edges = NUM_EDGES (edge_list); local
788 for (i = 0; i < num_edges; i++)
H A Dbasic-block.h573 int num_edges; member
593 #define NUM_EDGES(el) ((el)->num_edges)
H A Dgcse.c5235 int e, i, j, num_edges, set_size, did_insert = 0; local
5242 num_edges = NUM_EDGES (edge_list);
5243 inserted = sbitmap_vector_alloc (num_edges, expr_hash_table.n_elems);
5244 sbitmap_vector_zero (inserted, num_edges);
5246 for (e = 0; e < num_edges; e++)