| /freebsd-9.3-release/contrib/gcc/ |
| H A D | lcm.c | 186 int x, num_edges;
189 num_edges = NUM_EDGES (edge_list);
194 for (x = 0; x < num_edges; x++)
252 int num_edges, i;
258 num_edges = NUM_EDGES (edge_list);
267 for (i = 0; i < num_edges; i++)
280 sbitmap_vector_ones (later, num_edges);
388 int num_edges;
391 num_edges = NUM_EDGES (edge_list);
426 earliest = sbitmap_vector_alloc (num_edges, n_expr
185 int x, num_edges; local
251 int num_edges, i; local
387 int num_edges; local
565 int x, num_edges; local
607 int num_edges, i; local
721 int num_edges; local
[all...] |
| H A D | cfganal.c | 346 int num_edges;
353 num_edges = 0;
359 num_edges += EDGE_COUNT (bb->succs);
364 elist->num_edges = num_edges;
365 elist->index_to_edge = XNEWVEC (edge, num_edges);
367 num_edges = 0;
372 elist->index_to_edge[num_edges++] = e;
397 elist->num_blocks, elist->num_edges);
399 for (x = 0; x < elist->num_edges;
343 int num_edges; local
539 flow_edge_list_print(const char *str, const edge *edge_list, int num_edges, FILE *file) argument
[all...] |
| H A D | profile.c | 137 int num_edges = NUM_EDGES (el);
161 total_num_blocks_created += num_edges;
233 unsigned num_edges = 0;
245 num_edges++;
248 counts = get_coverage_counts (GCOV_COUNTER_ARCS, num_edges, &profile_info);
269 int num_edges = 0;
328 num_edges++;
355 fprintf (dump_file, "\n%d edge counts read\n", num_edges);
743 unsigned num_edges, ignored_edges;
843 num_edges
136 int num_edges = NUM_EDGES (el); local
231 unsigned num_edges = 0; local
266 int num_edges = 0; local
740 unsigned num_edges, ignored_edges; local
1103 int num_edges = NUM_EDGES (el); local
[all...] |
| H A D | cfglayout.c | 1228 edge *edges, unsigned num_edges, edge *new_edges,
1268 for (j = 0; j < num_edges; j++)
1278 for (j = 0; j < num_edges; j++)
1217 copy_bbs(basic_block *bbs, unsigned n, basic_block *new_bbs, edge *edges, unsigned num_edges, edge *new_edges, struct loop *base, basic_block after) argument
|
| H A D | basic-block.h | 554 int num_edges;
577 #define NUM_EDGES(el) ((el)->num_edges)
553 int num_edges; member in struct:edge_list
|
| H A D | cfgloop.c | 920 get_loop_exit_edges (const struct loop *loop, unsigned int *num_edges)
936 *num_edges = n;
919 get_loop_exit_edges(const struct loop *loop, unsigned int *num_edges) argument
|
| H A D | loop-unroll.c | 1701 unsigned i, num_edges = 0; local
1708 edge *edges = get_loop_exit_edges (loop, &num_edges);
1728 if (num_edges == 1
|
| H A D | gcse.c | 4133 int e, i, j, num_edges, set_size, did_insert = 0;
4140 num_edges = NUM_EDGES (edge_list);
4141 inserted = sbitmap_vector_alloc (num_edges, expr_hash_table.n_elems);
4142 sbitmap_vector_zero (inserted, num_edges);
4144 for (e = 0; e < num_edges; e++)
4117 int e, i, j, num_edges, set_size, did_insert = 0; local
|
| H A D | tree-cfg.c | 2330 long num_edges; local
2352 num_edges = 0;
2354 num_edges += EDGE_COUNT (bb->succs);
2355 size = num_edges * sizeof (struct edge_def);
2357 fprintf (file, fmt_str_2, "Edges", num_edges, SCALE (size), LABEL (size));
|
| H A D | see.c | 1657 int num_edges = NUM_EDGES (edge_list);
1666 for (e = 0; e < num_edges; e++)
1656 int num_edges = NUM_EDGES (edge_list); local
|
| H A D | tree-ssa-structalias.c | 204 unsigned int num_edges; member in struct:constraint_stats
933 stats.num_edges++;
4613 fprintf (outfile, "Number of edges: %d\n", stats.num_edges);
|