Home
last modified time | relevance | path

Searched refs:num_sccs (Results 1 – 8 of 8) sorted by relevance

/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dddg.c729 fprintf (file, "\n;; Number of SCC nodes - %d\n", sccs->num_sccs); in print_sccs()
730 for (i = 0; i < sccs->num_sccs; i++) in print_sccs()
881 int size = (g->num_sccs + 1) * sizeof (ddg_scc_ptr); in add_scc_to_ddg()
884 g->sccs[g->num_sccs++] = scc; in add_scc_to_ddg()
953 qsort (g->sccs, g->num_sccs, sizeof (ddg_scc_ptr), in order_sccs()
966 for (i = 0; i < sccs->num_sccs; i++) in check_sccs()
991 sccs->num_sccs = 0; in create_ddg_all_sccs()
1012 scc = create_scc (g, scc_nodes, sccs->num_sccs); in create_ddg_all_sccs()
1055 for (i = 0; i < sccs->num_sccs; i++) in create_ddg_all_sccs()
1075 for (i = 0; i < all_sccs->num_sccs; i++) in free_ddg_all_sccs()
H A Dtree-loop-distribution.c2344 int i, j, num_sccs = graphds_scc (pg, NULL); in merge_dep_scc_partitions() local
2348 if ((unsigned) num_sccs < partitions->length ()) in merge_dep_scc_partitions()
2350 for (i = 0; i < num_sccs; ++i) in merge_dep_scc_partitions()
2370 gcc_assert (partitions->length () == (unsigned)num_sccs); in merge_dep_scc_partitions()
2444 int i, j, k, num_sccs, num_sccs_no_alias = 0; in break_alias_scc_partitions() local
2451 num_sccs = graphds_scc (pg, NULL); in break_alias_scc_partitions()
2454 if ((unsigned) num_sccs < partitions->length ()) in break_alias_scc_partitions()
2463 bitmap_set_range (sccs_to_merge, 0, (unsigned) num_sccs); in break_alias_scc_partitions()
2464 for (i = 0; i < num_sccs; ++i) in break_alias_scc_partitions()
2501 if (bitmap_count_bits (sccs_to_merge) != (unsigned) num_sccs) in break_alias_scc_partitions()
[all …]
H A Dddg.h156 int num_sccs; member
H A Dmodulo-sched.c2512 if (sccs->num_sccs > 0) in sms_order_nodes()
2546 for (i = 0; i < all_sccs->num_sccs; i++) in order_nodes_of_sccs()
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dddg.cc729 fprintf (file, "\n;; Number of SCC nodes - %d\n", sccs->num_sccs); in print_sccs()
730 for (i = 0; i < sccs->num_sccs; i++) in print_sccs()
881 int size = (g->num_sccs + 1) * sizeof (ddg_scc_ptr); in add_scc_to_ddg()
884 g->sccs[g->num_sccs++] = scc; in add_scc_to_ddg()
953 qsort (g->sccs, g->num_sccs, sizeof (ddg_scc_ptr), in order_sccs()
966 for (i = 0; i < sccs->num_sccs; i++) in check_sccs()
991 sccs->num_sccs = 0; in create_ddg_all_sccs()
1012 scc = create_scc (g, scc_nodes, sccs->num_sccs); in create_ddg_all_sccs()
1055 for (i = 0; i < sccs->num_sccs; i++) in create_ddg_all_sccs()
1075 for (i = 0; i < all_sccs->num_sccs; i++) in free_ddg_all_sccs()
H A Dddg.h156 int num_sccs; member
H A Dtree-loop-distribution.cc2382 int i, j, num_sccs = graphds_scc (pg, NULL); in merge_dep_scc_partitions() local
2386 if ((unsigned) num_sccs < partitions->length ()) in merge_dep_scc_partitions()
2388 for (i = 0; i < num_sccs; ++i) in merge_dep_scc_partitions()
2408 gcc_assert (partitions->length () == (unsigned)num_sccs); in merge_dep_scc_partitions()
2483 int i, j, k, num_sccs, num_sccs_no_alias = 0; in break_alias_scc_partitions() local
2490 num_sccs = graphds_scc (pg, NULL); in break_alias_scc_partitions()
2493 if ((unsigned) num_sccs < partitions->length ()) in break_alias_scc_partitions()
2502 bitmap_set_range (sccs_to_merge, 0, (unsigned) num_sccs); in break_alias_scc_partitions()
2503 for (i = 0; i < num_sccs; ++i) in break_alias_scc_partitions()
2540 if (bitmap_count_bits (sccs_to_merge) != (unsigned) num_sccs) in break_alias_scc_partitions()
[all …]
H A Dmodulo-sched.cc2513 if (sccs->num_sccs > 0) in sms_order_nodes()
2547 for (i = 0; i < all_sccs->num_sccs; i++) in order_nodes_of_sccs()