| /freebsd-9-stable/contrib/gcc/ |
| D | lcm.c | 185 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
257 num_edges = NUM_EDGES (edge_list); in compute_laterin()
266 for (i = 0; i < num_edges; i++) in compute_laterin()
279 sbitmap_vector_ones (later, num_edges); in compute_laterin()
387 int num_edges; in pre_edge_lcm() local
390 num_edges = NUM_EDGES (edge_list); in pre_edge_lcm()
425 earliest = sbitmap_vector_alloc (num_edges, n_exprs); in pre_edge_lcm()
[all …]
|
| D | profile.c | 136 int num_edges = NUM_EDGES (el); in instrument_edges() local
160 total_num_blocks_created += num_edges; in instrument_edges()
231 unsigned num_edges = 0; in get_exec_counts() local
243 num_edges++; in get_exec_counts()
246 counts = get_coverage_counts (GCOV_COUNTER_ARCS, num_edges, &profile_info); in get_exec_counts()
266 int num_edges = 0; in compute_branch_probabilities() local
325 num_edges++; in compute_branch_probabilities()
352 fprintf (dump_file, "\n%d edge counts read\n", num_edges); in compute_branch_probabilities()
740 unsigned num_edges, ignored_edges; in branch_prob() local
840 num_edges = NUM_EDGES (el); in branch_prob()
[all …]
|
| D | cfganal.c | 343 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 …]
|
| D | cfglayout.c | 1218 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()
|
| D | basic-block.h | 553 int num_edges; member
576 #define NUM_EDGES(el) ((el)->num_edges)
|
| D | loop-unroll.c | 1701 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()
|
| D | cfgloop.c | 919 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()
|
| D | tree-cfg.c | 2330 long num_edges; in dump_cfg_stats() local
2352 num_edges = 0; in dump_cfg_stats()
2354 num_edges += EDGE_COUNT (bb->succs); in dump_cfg_stats()
2355 size = num_edges * sizeof (struct edge_def); in dump_cfg_stats()
2357 fprintf (file, fmt_str_2, "Edges", num_edges, SCALE (size), LABEL (size)); in dump_cfg_stats()
|
| D | gcse.c | 4117 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()
|
| D | see.c | 1656 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()
|
| D | tree-ssa-structalias.c | 204 unsigned int num_edges; member
933 stats.num_edges++; in add_graph_edge()
4613 fprintf (outfile, "Number of edges: %d\n", stats.num_edges); in dump_sa_points_to_info()
|
| D | ChangeLog-2005 | 1722 (struct constraint_stats): Add num_edges.
11806 and use it when printing num_edges.
24699 * cfglayout.c (copy_bbs): Rename n_edges to num_edges.
|