| /src/external/gpl3/gcc/dist/gcc/ |
| sched-rgn.cc | 217 /* Mapping from each edge in the graph to its number in the rgn. */
373 int rgn, bb;
376 for (rgn = 0; rgn < nr_regions; rgn++)
378 fprintf (sched_dump, ";;\trgn %d nr_blocks %d:\n", rgn,
379 rgn_table[rgn].rgn_nr_blocks);
384 current_blocks = RGN_BLOCKS (rgn);
386 for (bb = 0; bb < rgn_table[rgn].rgn_nr_blocks; bb++)
396 debug_region (int rgn)
372 int rgn, bb; local
3507 int rgn; local
[all...] |
| sel-sched-ir.cc | 3695 int i, n, rgn;
3701 rgn = CONTAINING_RGN (BB_TO_BLOCK (0));
3703 if (CONTAINING_RGN (postorder[i]) == rgn)
3713 gcc_assert (n == RGN_NR_BLOCKS (rgn));
5071 /* Returns a position in RGN where BB can be inserted retaining
5074 find_place_to_insert_bb (basic_block bb, int rgn)
5096 for (i = RGN_NR_BLOCKS (rgn) - 1; i >= 0; i--)
5163 int i, pos, bbi = -2, rgn;
5165 rgn = CONTAINING_RGN (BB_TO_BLOCK (0));
5166 bbi = find_place_to_insert_bb (bb, rgn);
3675 int i, n, rgn; local
5138 int i, pos, bbi = -2, rgn; local
5173 int i, pos, bbi = -2, rgn; local
6158 int rgn = CONTAINING_RGN (loop->latch->index); local
[all...] |
| sel-sched.cc | 180 There are parts of haifa-sched.cc, sched-deps.cc, and sched-rgn.cc that are
6847 setup_current_loop_nest (int rgn, bb_vec_t *bbs)
6849 current_loop_nest = get_loop_nest_for_rgn (rgn);
6865 sel_compute_priorities (int rgn)
6867 sched_rgn_compute_dependencies (rgn);
6879 /* Init scheduling data for RGN. Returns true when this region should not
6882 sel_region_init (int rgn)
6887 rgn_setup_region (rgn);
6903 setup_current_loop_nest (rgn, &bbs);
6917 sel_compute_priorities (rgn);
7720 int rgn; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| sched-rgn.cc | 217 /* Mapping from each edge in the graph to its number in the rgn. */
372 int rgn, bb;
375 for (rgn = 0; rgn < nr_regions; rgn++)
377 fprintf (sched_dump, ";;\trgn %d nr_blocks %d:\n", rgn,
378 rgn_table[rgn].rgn_nr_blocks);
383 current_blocks = RGN_BLOCKS (rgn);
385 for (bb = 0; bb < rgn_table[rgn].rgn_nr_blocks; bb++)
395 debug_region (int rgn)
371 int rgn, bb; local
3500 int rgn; local
[all...] |
| sel-sched-ir.cc | 3695 int i, n, rgn;
3701 rgn = CONTAINING_RGN (BB_TO_BLOCK (0));
3703 if (CONTAINING_RGN (postorder[i]) == rgn)
3713 gcc_assert (n == RGN_NR_BLOCKS (rgn));
5071 /* Returns a position in RGN where BB can be inserted retaining
5074 find_place_to_insert_bb (basic_block bb, int rgn)
5096 for (i = RGN_NR_BLOCKS (rgn) - 1; i >= 0; i--)
5163 int i, pos, bbi = -2, rgn;
5165 rgn = CONTAINING_RGN (BB_TO_BLOCK (0));
5166 bbi = find_place_to_insert_bb (bb, rgn);
3675 int i, n, rgn; local
5138 int i, pos, bbi = -2, rgn; local
5173 int i, pos, bbi = -2, rgn; local
6158 int rgn = CONTAINING_RGN (loop->latch->index); local
[all...] |
| sel-sched.cc | 180 There are parts of haifa-sched.cc, sched-deps.cc, and sched-rgn.cc that are
6839 setup_current_loop_nest (int rgn, bb_vec_t *bbs)
6841 current_loop_nest = get_loop_nest_for_rgn (rgn);
6857 sel_compute_priorities (int rgn)
6859 sched_rgn_compute_dependencies (rgn);
6871 /* Init scheduling data for RGN. Returns true when this region should not
6874 sel_region_init (int rgn)
6879 rgn_setup_region (rgn);
6895 setup_current_loop_nest (rgn, &bbs);
6909 sel_compute_priorities (rgn);
7712 int rgn; local
[all...] |
