| /src/external/gpl3/gcc/dist/gcc/ |
| cfganal.h | 28 int num_edges; member in struct:edge_list
|
| lcm.cc | 176 int x, num_edges;
179 num_edges = NUM_EDGES (edge_list);
182 for (x = 0; x < num_edges; x++)
237 int num_edges, i;
243 num_edges = NUM_EDGES (edge_list);
252 for (i = 0; i < num_edges; i++)
265 bitmap_vector_ones (later, num_edges);
354 for (x = 0; x < NUM_EDGES (edge_list); x++
175 int x, num_edges; local
236 int num_edges, i; local
378 int num_edges; local
588 int x, num_edges; local
625 int num_edges, i; local
740 int num_edges; local
[all...] |
| cfganal.cc | 263 int num_edges;
269 num_edges = 0;
273 num_edges += EDGE_COUNT (bb->succs);
277 elist->num_edges = num_edges;
278 elist->index_to_edge = XNEWVEC (edge, num_edges);
280 num_edges = 0;
286 elist->index_to_edge[num_edges++] = e;
311 n_basic_blocks_for_fn (cfun), elist->num_edges);
313 for (x = 0; x < elist->num_edges; x++
261 int num_edges; local
446 int num_edges = 0; local
[all...] |
| mcf.cc | 111 int num_edges; member in struct:fixup_graph_type
282 fnum_edges = fixup_graph->num_edges;
367 fixup_edge_p curr_edge = fixup_graph->edge_list + fixup_graph->num_edges;
371 fixup_graph->num_edges++;
550 gcc_assert (fixup_graph->num_edges <= fnum_edges_after_transform);
552 fnum_edges_after_transform = fixup_graph->num_edges;
651 fnum_edges = fixup_graph->num_edges;
798 fnum_edges = fixup_graph->num_edges;
938 fnum_edges = fixup_graph->num_edges;
1038 fnum_edges = fixup_graph->num_edges;
[all...] |
| profile.cc | 128 int num_edges = NUM_EDGES (el); local
152 total_num_blocks_created += num_edges;
219 unsigned num_edges = 0;
231 num_edges++;
235 lineno_checksum, num_edges);
366 int num_edges = 0;
381 num_edges++;
400 return num_edges;
438 int num_edges = 0
218 unsigned num_edges = 0; local
365 int num_edges = 0; local
437 int num_edges = 0; local
1189 unsigned num_edges, ignored_edges; local
1672 int num_edges = NUM_EDGES (el); local
[all...] |
| gcse.cc | 2131 int e, i, j, num_edges, set_size;
2139 num_edges = NUM_EDGES (edge_list);
2140 inserted = sbitmap_vector_alloc (num_edges, expr_hash_table.n_elems);
2141 bitmap_vector_clear (inserted, num_edges);
2143 for (e = 0; e < num_edges; e++)
2118 int e, i, j, num_edges, set_size; local
|
| tree-cfg.cc | 2667 long num_edges; local
2687 num_edges = 0;
2689 num_edges += EDGE_COUNT (bb->succs);
2690 size = num_edges * sizeof (class edge_def);
2692 fprintf (file, fmt_str_2, "Edges", num_edges, SIZE_AMOUNT (size));
|
| tree-ssa-structalias.cc | 238 unsigned int num_edges; member in struct:constraint_stats
1238 stats.num_edges++;
7153 fprintf (outfile, "Number of edges: %d\n", stats.num_edges);
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| cfganal.h | 28 int num_edges; member in struct:edge_list
|
| lcm.cc | 174 int x, num_edges;
177 num_edges = NUM_EDGES (edge_list);
180 for (x = 0; x < num_edges; x++)
235 int num_edges, i;
241 num_edges = NUM_EDGES (edge_list);
250 for (i = 0; i < num_edges; i++)
263 bitmap_vector_ones (later, num_edges);
353 for (x = 0; x < NUM_EDGES (edge_list); x++
173 int x, num_edges; local
234 int num_edges, i; local
377 int num_edges; local
589 int x, num_edges; local
626 int num_edges, i; local
741 int num_edges; local
[all...] |
| cfganal.cc | 263 int num_edges;
269 num_edges = 0;
273 num_edges += EDGE_COUNT (bb->succs);
277 elist->num_edges = num_edges;
278 elist->index_to_edge = XNEWVEC (edge, num_edges);
280 num_edges = 0;
286 elist->index_to_edge[num_edges++] = e;
311 n_basic_blocks_for_fn (cfun), elist->num_edges);
313 for (x = 0; x < elist->num_edges; x++
261 int num_edges; local
446 int num_edges = 0; local
[all...] |
| mcf.cc | 111 int num_edges; member in struct:fixup_graph_type
282 fnum_edges = fixup_graph->num_edges;
367 fixup_edge_p curr_edge = fixup_graph->edge_list + fixup_graph->num_edges;
371 fixup_graph->num_edges++;
550 gcc_assert (fixup_graph->num_edges <= fnum_edges_after_transform);
552 fnum_edges_after_transform = fixup_graph->num_edges;
651 fnum_edges = fixup_graph->num_edges;
798 fnum_edges = fixup_graph->num_edges;
938 fnum_edges = fixup_graph->num_edges;
1038 fnum_edges = fixup_graph->num_edges;
[all...] |
| profile.cc | 116 int num_edges = NUM_EDGES (el); local
140 total_num_blocks_created += num_edges;
207 unsigned num_edges = 0;
219 num_edges++;
223 lineno_checksum, num_edges);
354 int num_edges = 0;
369 num_edges++;
388 return num_edges;
426 int num_edges = 0
206 unsigned num_edges = 0; local
353 int num_edges = 0; local
425 int num_edges = 0; local
1171 unsigned num_edges, ignored_edges; local
1606 int num_edges = NUM_EDGES (el); local
[all...] |
| gcse.cc | 2118 int e, i, j, num_edges, set_size, did_insert = 0;
2125 num_edges = NUM_EDGES (edge_list);
2126 inserted = sbitmap_vector_alloc (num_edges, expr_hash_table.n_elems);
2127 bitmap_vector_clear (inserted, num_edges);
2129 for (e = 0; e < num_edges; e++)
2105 int e, i, j, num_edges, set_size, did_insert = 0; local
|
| tree-cfg.cc | 2591 long num_edges; local
2611 num_edges = 0;
2613 num_edges += EDGE_COUNT (bb->succs);
2614 size = num_edges * sizeof (class edge_def);
2616 fprintf (file, fmt_str_2, "Edges", num_edges, SIZE_AMOUNT (size));
|
| tree-ssa-structalias.cc | 238 unsigned int num_edges; member in struct:constraint_stats
1222 stats.num_edges++;
7130 fprintf (outfile, "Number of edges: %d\n", stats.num_edges);
|
| /src/external/gpl3/gcc/dist/gcc/analyzer/ |
| supergraph.h | 174 int num_edges () const { return m_edges.length (); } function in class:ana::supergraph
|
| /src/external/gpl3/gcc.old/dist/gcc/analyzer/ |
| supergraph.h | 167 int num_edges () const { return m_edges.length (); } function in class:ana::supergraph
|
| /src/external/gpl3/gcc/dist/gcc/config/aarch64/ |
| aarch64-early-ra.cc | 2134 unsigned int num_edges = m_allocnos.length () * ARRAY_SIZE (links); local
2135 auto_sbitmap visited_edges (num_edges);
2139 for (unsigned int i = 0; i < num_edges; ++i)
|
| /src/external/gpl3/gcc/dist/gcc/config/riscv/ |
| riscv-vsetvl.cc | 2859 unsigned num_edges = NUM_EDGES (m_edges); local
2865 sbitmap *earliest = sbitmap_vector_alloc (num_edges, num_exprs);
2908 for (unsigned ed = 0; ed < num_edges; ed++)
2927 for (unsigned ed = 0; ed < num_edges; ed++)
3141 unsigned num_edges = NUM_EDGES (m_edges); local
3176 for (unsigned ed = 0; ed < num_edges; ed++)
3374 for (int ed = 0; ed < NUM_EDGES (m_edges); ed++)
|
