| /src/external/gpl3/gcc/dist/gcc/ |
| ddg.h | 152 /* This structure holds the SCCs of the DDG. */
155 /* Array that holds the SCCs in the DDG, and their number. */ member in struct:ddg_all_sccs
156 ddg_scc_ptr *sccs;
|
| gimple-ssa-sccopy.cc | 79 strongly-connected components (SCCs) in dataflow graph. The algorithm was
82 To identify SCCs we implement the Robert Tarjan's SCC algorithm. For the
85 the main algorithm has to be able to compute SCCs of subgraphs of the whole
132 Used to find SCCs in a dataflow graph. Implements Tarjan's SCC
213 /* Compute SCCs in dataflow graph on given statements 'stmts'. Ignore
214 statements outside 'stmts'. Return the SCCs in a reverse topological
222 auto_vec<vec<gimple *>> sccs; local
308 sccs.safe_push (scc);
334 return sccs;
507 on strongly-connected components (SCCs) in dataflow graph. The origina
[all...] |
| ddg.cc | 719 /* Dump the sccs in SCCS. */
721 print_sccs (FILE *file, ddg_all_sccs_ptr sccs, ddg_ptr g)
730 fprintf (file, "\n;; Number of SCC nodes - %d\n", sccs->num_sccs);
731 for (i = 0; i < sccs->num_sccs; i++)
734 EXECUTE_IF_SET_IN_BITMAP (sccs->sccs[i]->nodes, 0, u, sbi)
885 g->sccs = (ddg_scc_ptr *) xrealloc (g->sccs, size);
886 g->sccs[g->num_sccs++] = scc
986 ddg_all_sccs_ptr sccs = (ddg_all_sccs_ptr) local
[all...] |
| dominance.cc | 1316 vec<int> *sccs; local
1349 sccs = XCNEWVEC (vec_int_heap, nc);
1351 sccs[g->vertices[a].component].safe_push (a);
1356 FOR_EACH_VEC_ELT (sccs[i], si, a)
1369 FOR_EACH_VEC_ELT (sccs[i], si, a)
1377 sccs[i].release ();
1378 free (sccs);
|
| lto-streamer-out.cc | 618 struct sccs struct in class:DFS
626 sccs *from_state;
627 sccs *cstate;
637 tree expr, sccs *expr_state, bool ref_p);
639 void DFS_write_tree (struct output_block *ob, sccs *from_state,
646 hash_map<tree, sccs *> sccstate;
704 sccs *from_state = w.from_state;
705 sccs *cstate = w.cstate;
710 sccs **slot = &sccstate.get_or_insert (expr);
723 *slot = cstate = XOBNEW (&sccstate_obstack, struct sccs);
[all...] |
| modulo-sched.cc | 2508 ddg_all_sccs_ptr sccs = create_ddg_all_sccs (g);
2513 print_sccs (dump_file, sccs, g);
2515 order_nodes_of_sccs (sccs, node_order);
2517 if (sccs->num_sccs > 0)
2519 rec_mii = sccs->sccs[0]->recurrence_length;
2529 free_ddg_all_sccs (sccs);
2553 ddg_scc_ptr scc = all_sccs->sccs[i];
2555 /* Add nodes on paths from previous SCCs to the current SCC. */
2559 /* Add nodes on paths from the current SCC to previous SCCs. *
2504 ddg_all_sccs_ptr sccs = create_ddg_all_sccs (g); local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| ddg.h | 152 /* This structure holds the SCCs of the DDG. */
155 /* Array that holds the SCCs in the DDG, and their number. */ member in struct:ddg_all_sccs
156 ddg_scc_ptr *sccs;
|
| ddg.cc | 719 /* Dump the sccs in SCCS. */
721 print_sccs (FILE *file, ddg_all_sccs_ptr sccs, ddg_ptr g)
730 fprintf (file, "\n;; Number of SCC nodes - %d\n", sccs->num_sccs);
731 for (i = 0; i < sccs->num_sccs; i++)
734 EXECUTE_IF_SET_IN_BITMAP (sccs->sccs[i]->nodes, 0, u, sbi)
885 g->sccs = (ddg_scc_ptr *) xrealloc (g->sccs, size);
886 g->sccs[g->num_sccs++] = scc
986 ddg_all_sccs_ptr sccs = (ddg_all_sccs_ptr) local
[all...] |
| dominance.cc | 1313 vec<int> *sccs; local
1346 sccs = XCNEWVEC (vec_int_heap, nc);
1348 sccs[g->vertices[a].component].safe_push (a);
1353 FOR_EACH_VEC_ELT (sccs[i], si, a)
1366 FOR_EACH_VEC_ELT (sccs[i], si, a)
1374 sccs[i].release ();
1375 free (sccs);
|
| lto-streamer-out.cc | 611 struct sccs struct in class:DFS
619 sccs *from_state;
620 sccs *cstate;
630 tree expr, sccs *expr_state, bool ref_p);
632 void DFS_write_tree (struct output_block *ob, sccs *from_state,
639 hash_map<tree, sccs *> sccstate;
697 sccs *from_state = w.from_state;
698 sccs *cstate = w.cstate;
703 sccs **slot = &sccstate.get_or_insert (expr);
716 *slot = cstate = XOBNEW (&sccstate_obstack, struct sccs);
[all...] |
| modulo-sched.cc | 2508 ddg_all_sccs_ptr sccs = create_ddg_all_sccs (g);
2513 print_sccs (dump_file, sccs, g);
2515 order_nodes_of_sccs (sccs, node_order);
2517 if (sccs->num_sccs > 0)
2519 rec_mii = sccs->sccs[0]->recurrence_length;
2529 free_ddg_all_sccs (sccs);
2553 ddg_scc_ptr scc = all_sccs->sccs[i];
2555 /* Add nodes on paths from previous SCCs to the current SCC. */
2559 /* Add nodes on paths from the current SCC to previous SCCs. *
2504 ddg_all_sccs_ptr sccs = create_ddg_all_sccs (g); local
[all...] |
