| /haiku-buildtools/gcc/gcc/ |
| H A D | lcm.c | 194 int x, num_edges;
197 num_edges = NUM_EDGES (edge_list);
202 for (x = 0; x < num_edges; x++)
260 int num_edges, i;
266 num_edges = NUM_EDGES (edge_list);
275 for (i = 0; i < num_edges; i++)
288 bitmap_vector_ones (later, num_edges);
404 int num_edges;
407 num_edges = NUM_EDGES (edge_list);
445 earliest = sbitmap_vector_alloc (num_edges, n_expr
193 int x, num_edges; local
259 int num_edges, i; local
403 int num_edges; local
617 int x, num_edges; local
659 int num_edges, i; local
774 int num_edges; local
[all...] |
| H A D | profile.c | 159 int num_edges = NUM_EDGES (el); local
183 total_num_blocks_created += num_edges;
315 unsigned num_edges = 0;
327 num_edges++;
330 counts = get_coverage_counts (GCOV_COUNTER_ARCS, num_edges, cfg_checksum,
469 int num_edges = 0;
484 num_edges++;
520 return num_edges;
566 int num_edges = 0;
603 num_edges
314 unsigned num_edges = 0; local
468 int num_edges = 0; local
565 int num_edges = 0; local
1042 unsigned num_edges, ignored_edges; local
1417 int num_edges = NUM_EDGES (el); local
[all...] |
| H A D | cfganal.h | 28 int num_edges; member in struct:edge_list
|
| H A D | mcf.c | 123 int num_edges; member in struct:fixup_graph_d
294 fnum_edges = fixup_graph->num_edges;
379 fixup_edge_p curr_edge = fixup_graph->edge_list + fixup_graph->num_edges;
383 fixup_graph->num_edges++;
562 gcc_assert (fixup_graph->num_edges <= fnum_edges_after_transform);
564 fnum_edges_after_transform = fixup_graph->num_edges;
663 fnum_edges = fixup_graph->num_edges;
810 fnum_edges = fixup_graph->num_edges;
950 fnum_edges = fixup_graph->num_edges;
1050 fnum_edges = fixup_graph->num_edges;
[all...] |
| H A D | cfganal.c | 229 int num_edges;
235 num_edges = 0;
239 num_edges += EDGE_COUNT (bb->succs);
243 elist->num_edges = num_edges;
244 elist->index_to_edge = XNEWVEC (edge, num_edges);
246 num_edges = 0;
252 elist->index_to_edge[num_edges++] = e;
277 n_basic_blocks_for_fn (cfun), elist->num_edges);
279 for (x = 0; x < elist->num_edges;
227 int num_edges; local
[all...] |
| H A D | cfghooks.c | 1328 edge *edges, unsigned num_edges, edge *new_edges,
1372 for (j = 0; j < num_edges; j++)
1382 for (j = 0; j < num_edges; j++)
1327 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, bool update_dominance) argument
|
| H A D | basic-block.h | 301 #define NUM_EDGES(el) ((el)->num_edges)
|
| H A D | gcse.c | 2142 int e, i, j, num_edges, set_size, did_insert = 0;
2149 num_edges = NUM_EDGES (edge_list);
2150 inserted = sbitmap_vector_alloc (num_edges, expr_hash_table.n_elems);
2151 bitmap_vector_clear (inserted, num_edges);
2153 for (e = 0; e < num_edges; e++)
2129 int e, i, j, num_edges, set_size, did_insert = 0; local
|
| H A D | tree-cfg.c | 2351 long num_edges; local
2371 num_edges = 0;
2373 num_edges += EDGE_COUNT (bb->succs);
2374 size = num_edges * sizeof (struct edge_def);
2376 fprintf (file, fmt_str_2, "Edges", num_edges, SCALE (size), LABEL (size));
|
| H A D | tree-ssa-structalias.c | 274 unsigned int num_edges; member in struct:constraint_stats
1207 stats.num_edges++;
6480 fprintf (outfile, "Number of edges: %d\n", stats.num_edges);
|