| /netbsd-src/external/gpl3/gcc/dist/gcc/ |
| H A D | gimple-loop-jam.cc | 108 basic_block *bbs; in merge_loop_tree() local
115 bbs = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun)); in merge_loop_tree()
116 n = get_loop_body_with_size (loop, bbs, n_basic_blocks_for_fn (cfun)); in merge_loop_tree()
124 if (bbs[i]->loop_father == old in merge_loop_tree()
125 || loop_depth (bbs[i]->loop_father) < loop_depth (old)) in merge_loop_tree()
127 remove_bb_from_loops (bbs[i]); in merge_loop_tree()
128 add_bb_to_loop (bbs[i], loop); in merge_loop_tree()
133 subloop = bbs[i]->loop_father; in merge_loop_tree()
134 if (loop_outer (subloop) == old && subloop->header == bbs[i]) in merge_loop_tree()
144 FOR_EACH_EDGE (e, ei, bbs[i]->succs) in merge_loop_tree()
[all …]
|
| H A D | domwalk.cc | 145 sort_bbs_postorder (basic_block *bbs, int n, int *bb_postorder) in sort_bbs_postorder() argument
149 basic_block bb0 = bbs[0], bb1 = bbs[1]; in sort_bbs_postorder()
151 bbs[0] = bb1, bbs[1] = bb0; in sort_bbs_postorder()
155 basic_block bb0 = bbs[0], bb1 = bbs[1], bb2 = bbs[2]; in sort_bbs_postorder()
164 bbs[0] = bb0, bbs[1] = bb1, bbs[2] = bb2; in sort_bbs_postorder()
167 gcc_sort_r (bbs, n, sizeof *bbs, cmp_bb_postorder, bb_postorder); in sort_bbs_postorder()
|
| H A D | cfgloopmanip.cc | 55 remove_bbs (basic_block *bbs, int nbbs) in remove_bbs() argument
60 delete_basic_block (bbs[i]); in remove_bbs()
70 find_path (edge e, basic_block **bbs) in find_path() argument
75 *bbs = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun)); in find_path()
76 return dfs_enumerate_from (e->dest, 0, rpe_enum_p, *bbs, in find_path()
231 basic_block *bbs = get_loop_body (from->loop_father); in fix_bb_placements() local
233 bitmap_set_bit (loop_closed_ssa_invalidated, bbs[i]->index); in fix_bb_placements()
234 free (bbs); in fix_bb_placements()
442 basic_block *bbs; in add_loop() local
453 bbs = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun)); in add_loop()
[all …]
|
| H A D | dominance.cc | 898 auto_vec<basic_block> bbs; in get_dominated_by() local
903 return bbs; in get_dominated_by()
905 bbs.safe_push ((basic_block) son->data); in get_dominated_by()
907 bbs.safe_push ((basic_block) ason->data); in get_dominated_by()
909 return bbs; in get_dominated_by()
946 auto_vec<basic_block> bbs; in get_dominated_to_depth() local
951 bbs.safe_push (bb); in get_dominated_to_depth()
958 bb = bbs[i++]; in get_dominated_to_depth()
962 bbs.safe_push (son); in get_dominated_to_depth()
965 next_level_start = bbs.length (); in get_dominated_to_depth()
[all …]
|
| H A D | tree-ssa-tail-merge.cc | 221 bitmap bbs; member
253 bitmap bbs; member
401 bitmap_print (file, e->bbs, "bbs:", "\n"); in same_succ_print()
465 unsigned int first = bitmap_first_set_bit (e->bbs); in same_succ_hash()
588 first1 = bitmap_first_set_bit (e1->bbs); in equal()
589 first2 = bitmap_first_set_bit (e2->bbs); in equal()
628 same->bbs = BITMAP_ALLOC (NULL); in same_succ_alloc()
642 BITMAP_FREE (e->bbs); in remove()
655 bitmap_clear (same->bbs); in same_succ_reset()
708 if (bitmap_count_bits (same->bbs) < 2) in add_to_worklist()
[all …]
|
| H A D | tree-ssa-loop-unswitch.cc | 270 basic_block *bbs; in tree_unswitch_single_loop() local
318 bbs = get_loop_body (loop); in tree_unswitch_single_loop()
325 if ((cond = tree_may_unswitch_on (bbs[i], loop))) in tree_unswitch_single_loop()
337 free (bbs); in tree_unswitch_single_loop()
344 stmt = last_stmt (bbs[i]); in tree_unswitch_single_loop()
395 bbs[i]->flags &= ~BB_REACHABLE; in tree_unswitch_single_loop()
398 *tos++ = bbs[0]; in tree_unswitch_single_loop()
399 bbs[0]->flags |= BB_REACHABLE; in tree_unswitch_single_loop()
444 if ((bbs[found]->flags & BB_REACHABLE) in tree_unswitch_single_loop()
445 && (cond = tree_may_unswitch_on (bbs[found], loop))) in tree_unswitch_single_loop()
[all …]
|
| H A D | tree-ssa-loop-split.cc | 530 basic_block *bbs; in split_loop() local
552 bbs = get_loop_body (loop1); in split_loop()
554 if (!can_copy_bbs_p (bbs, loop1->num_nodes)) in split_loop()
556 free (bbs); in split_loop()
562 if ((guard_iv = split_at_bb_p (loop1, bbs[i], &border, &iv))) in split_loop()
576 gcond *guard_stmt = as_a<gcond *> (last_stmt (bbs[i])); in split_loop()
615 extract_true_false_edges_from_block (bbs[i], &true_edge, &false_edge); in split_loop()
660 gcond *force_true = as_a<gcond *> (last_stmt (bbs[i])); in split_loop()
661 gcond *force_false = as_a<gcond *> (last_stmt (get_bb_copy (bbs[i]))); in split_loop()
682 free (bbs); in split_loop()
[all …]
|
| H A D | cfgloopanal.cc | 179 basic_block *bbs, bb; in num_loop_insns() local
183 bbs = get_loop_body (loop); in num_loop_insns()
186 bb = bbs[i]; in num_loop_insns()
191 free (bbs); in num_loop_insns()
203 basic_block *bbs, bb; in average_num_loop_insns() local
209 bbs = get_loop_body (loop); in average_num_loop_insns()
212 bb = bbs[i]; in average_num_loop_insns()
223 free (bbs); in average_num_loop_insns()
227 free (bbs); in average_num_loop_insns()
|
| H A D | cfgloop.cc | 114 basic_block *bbs; in flow_loop_dump() local
151 bbs = get_loop_body (loop); in flow_loop_dump()
153 fprintf (file, " %d", bbs[i]->index); in flow_loop_dump()
154 free (bbs); in flow_loop_dump()
973 basic_block *bbs = get_loop_body (loop); in get_loop_body_in_custom_order() local
975 qsort (bbs, loop->num_nodes, sizeof (basic_block), bb_comparator); in get_loop_body_in_custom_order()
977 return bbs; in get_loop_body_in_custom_order()
986 basic_block *bbs = get_loop_body (loop); in get_loop_body_in_custom_order() local
988 gcc_sort_r (bbs, loop->num_nodes, sizeof (basic_block), bb_comparator, data); in get_loop_body_in_custom_order()
990 return bbs; in get_loop_body_in_custom_order()
[all …]
|
| H A D | tree-ssa-loop-ch.cc | 373 basic_block *bbs, *copied_bbs; in copy_headers() local
381 bbs = XNEWVEC (basic_block, n_basic_blocks_for_fn (fun)); in copy_headers()
457 bbs[n_bbs++] = header; in copy_headers()
480 if (!gimple_duplicate_sese_region (entry, exit, bbs, n_bbs, copied_bbs, in copy_headers()
572 free (bbs); in copy_headers()
|
| H A D | cfghooks.cc | 1297 can_copy_bbs_p (basic_block *bbs, unsigned n) in can_copy_bbs_p() argument
1304 bbs[i]->flags |= BB_DUPLICATED; in can_copy_bbs_p()
1310 FOR_EACH_EDGE (e, ei, bbs[i]->succs) in can_copy_bbs_p()
1318 if (!can_duplicate_block_p (bbs[i])) in can_copy_bbs_p()
1327 bbs[i]->flags &= ~BB_DUPLICATED; in can_copy_bbs_p()
1356 copy_bbs (basic_block *bbs, unsigned n, basic_block *new_bbs, in copy_bbs() argument
1369 bbs[i]->flags |= BB_DUPLICATED; in copy_bbs()
1375 bb = bbs[i]; in copy_bbs()
1394 bb = bbs[i]; in copy_bbs()
1411 bb = bbs[i]; in copy_bbs()
[all …]
|
| H A D | tree-loop-distribution.cc | 754 basic_block *bbs = get_loop_body_in_custom_order (loop, this, bb_top_order_cmp_r); in stmts_from_loop() local
758 basic_block bb = bbs[i]; in stmts_from_loop()
774 free (bbs); in stmts_from_loop()
983 basic_block *bbs; in generate_loops_for_partition() local
1001 bbs = get_loop_body_in_dom_order (loop); in generate_loops_for_partition()
1006 basic_block bb = bbs[i]; in generate_loops_for_partition()
1029 basic_block bb = bbs[i]; in generate_loops_for_partition()
1084 free (bbs); in generate_loops_for_partition()
1266 basic_block *bbs; in destroy_loop() local
1269 bbs = get_loop_body_in_dom_order (loop); in destroy_loop()
[all …]
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/ |
| H A D | domwalk.c | 145 sort_bbs_postorder (basic_block *bbs, int n, int *bb_postorder) in sort_bbs_postorder() argument
149 basic_block bb0 = bbs[0], bb1 = bbs[1]; in sort_bbs_postorder()
151 bbs[0] = bb1, bbs[1] = bb0; in sort_bbs_postorder()
155 basic_block bb0 = bbs[0], bb1 = bbs[1], bb2 = bbs[2]; in sort_bbs_postorder()
164 bbs[0] = bb0, bbs[1] = bb1, bbs[2] = bb2; in sort_bbs_postorder()
167 gcc_sort_r (bbs, n, sizeof *bbs, cmp_bb_postorder, bb_postorder); in sort_bbs_postorder()
|
| H A D | gimple-loop-jam.c | 107 basic_block *bbs; in merge_loop_tree() local
114 bbs = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun)); in merge_loop_tree()
115 n = get_loop_body_with_size (loop, bbs, n_basic_blocks_for_fn (cfun)); in merge_loop_tree()
123 if (bbs[i]->loop_father == old in merge_loop_tree()
124 || loop_depth (bbs[i]->loop_father) < loop_depth (old)) in merge_loop_tree()
126 remove_bb_from_loops (bbs[i]); in merge_loop_tree()
127 add_bb_to_loop (bbs[i], loop); in merge_loop_tree()
132 subloop = bbs[i]->loop_father; in merge_loop_tree()
133 if (loop_outer (subloop) == old && subloop->header == bbs[i]) in merge_loop_tree()
143 FOR_EACH_EDGE (e, ei, bbs[i]->succs) in merge_loop_tree()
[all …]
|
| H A D | cfgloopmanip.c | 55 remove_bbs (basic_block *bbs, int nbbs) in remove_bbs() argument
60 delete_basic_block (bbs[i]); in remove_bbs()
70 find_path (edge e, basic_block **bbs) in find_path() argument
75 *bbs = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun)); in find_path()
76 return dfs_enumerate_from (e->dest, 0, rpe_enum_p, *bbs, in find_path()
232 basic_block *bbs = get_loop_body (from->loop_father); in fix_bb_placements() local
234 bitmap_set_bit (loop_closed_ssa_invalidated, bbs[i]->index); in fix_bb_placements()
235 free (bbs); in fix_bb_placements()
443 basic_block *bbs; in add_loop() local
454 bbs = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun)); in add_loop()
[all …]
|
| H A D | tree-ssa-tail-merge.c | 221 bitmap bbs; member
253 bitmap bbs; member
401 bitmap_print (file, e->bbs, "bbs:", "\n"); in same_succ_print()
465 unsigned int first = bitmap_first_set_bit (e->bbs); in same_succ_hash()
588 first1 = bitmap_first_set_bit (e1->bbs); in equal()
589 first2 = bitmap_first_set_bit (e2->bbs); in equal()
628 same->bbs = BITMAP_ALLOC (NULL); in same_succ_alloc()
642 BITMAP_FREE (e->bbs); in remove()
655 bitmap_clear (same->bbs); in same_succ_reset()
708 if (bitmap_count_bits (same->bbs) < 2) in add_to_worklist()
[all …]
|
| H A D | dominance.c | 891 vec<basic_block> bbs = vNULL; in get_dominated_by() local
898 bbs.safe_push ((basic_block) son->data); in get_dominated_by()
900 bbs.safe_push ((basic_block) ason->data); in get_dominated_by()
902 return bbs; in get_dominated_by()
939 vec<basic_block> bbs = vNULL; in get_dominated_to_depth() local
944 bbs.safe_push (bb); in get_dominated_to_depth()
951 bb = bbs[i++]; in get_dominated_to_depth()
955 bbs.safe_push (son); in get_dominated_to_depth()
958 next_level_start = bbs.length (); in get_dominated_to_depth()
962 return bbs; in get_dominated_to_depth()
[all …]
|
| H A D | cfgloopanal.c | 179 basic_block *bbs, bb; in num_loop_insns() local
183 bbs = get_loop_body (loop); in num_loop_insns()
186 bb = bbs[i]; in num_loop_insns()
191 free (bbs); in num_loop_insns()
203 basic_block *bbs, bb; in average_num_loop_insns() local
209 bbs = get_loop_body (loop); in average_num_loop_insns()
212 bb = bbs[i]; in average_num_loop_insns()
223 free (bbs); in average_num_loop_insns()
227 free (bbs); in average_num_loop_insns()
|
| H A D | tree-ssa-loop-split.c | 497 basic_block *bbs; in split_loop() local
518 bbs = get_loop_body (loop1); in split_loop()
520 if (!can_copy_bbs_p (bbs, loop1->num_nodes)) in split_loop()
522 free (bbs); in split_loop()
528 if ((guard_iv = split_at_bb_p (loop1, bbs[i], &border, &iv))) in split_loop()
542 gcond *guard_stmt = as_a<gcond *> (last_stmt (bbs[i])); in split_loop()
613 gcond *force_true = as_a<gcond *> (last_stmt (bbs[i])); in split_loop()
614 gcond *force_false = as_a<gcond *> (last_stmt (get_bb_copy (bbs[i]))); in split_loop()
636 free (bbs); in split_loop()
676 basic_block *bbs;
[all …]
|
| H A D | tree-ssa-loop-unswitch.c | 269 basic_block *bbs; in tree_unswitch_single_loop() local
312 bbs = get_loop_body (loop); in tree_unswitch_single_loop()
319 if ((cond = tree_may_unswitch_on (bbs[i], loop))) in tree_unswitch_single_loop()
331 free (bbs); in tree_unswitch_single_loop()
338 stmt = last_stmt (bbs[i]); in tree_unswitch_single_loop()
389 bbs[i]->flags &= ~BB_REACHABLE; in tree_unswitch_single_loop()
392 *tos++ = bbs[0]; in tree_unswitch_single_loop()
393 bbs[0]->flags |= BB_REACHABLE; in tree_unswitch_single_loop()
438 if ((bbs[found]->flags & BB_REACHABLE) in tree_unswitch_single_loop()
439 && (cond = tree_may_unswitch_on (bbs[found], loop))) in tree_unswitch_single_loop()
[all …]
|
| H A D | cfgloop.c | 112 basic_block *bbs; in flow_loop_dump() local
149 bbs = get_loop_body (loop); in flow_loop_dump()
151 fprintf (file, " %d", bbs[i]->index); in flow_loop_dump()
152 free (bbs); in flow_loop_dump()
976 basic_block *bbs = get_loop_body (loop); in get_loop_body_in_custom_order() local
978 qsort (bbs, loop->num_nodes, sizeof (basic_block), bb_comparator); in get_loop_body_in_custom_order()
980 return bbs; in get_loop_body_in_custom_order()
989 basic_block *bbs = get_loop_body (loop); in get_loop_body_in_custom_order() local
991 gcc_sort_r (bbs, loop->num_nodes, sizeof (basic_block), bb_comparator, data); in get_loop_body_in_custom_order()
993 return bbs; in get_loop_body_in_custom_order()
[all …]
|
| H A D | tree-ssa-loop-ch.c | 354 basic_block *bbs, *copied_bbs; in copy_headers() local
362 bbs = XNEWVEC (basic_block, n_basic_blocks_for_fn (fun)); in copy_headers()
402 bbs[n_bbs++] = header; in copy_headers()
425 if (!gimple_duplicate_sese_region (entry, exit, bbs, n_bbs, copied_bbs, in copy_headers()
517 free (bbs); in copy_headers()
|
| H A D | cfghooks.c | 1278 can_copy_bbs_p (basic_block *bbs, unsigned n) in can_copy_bbs_p() argument
1285 bbs[i]->flags |= BB_DUPLICATED; in can_copy_bbs_p()
1291 FOR_EACH_EDGE (e, ei, bbs[i]->succs) in can_copy_bbs_p()
1299 if (!can_duplicate_block_p (bbs[i])) in can_copy_bbs_p()
1308 bbs[i]->flags &= ~BB_DUPLICATED; in can_copy_bbs_p()
1337 copy_bbs (basic_block *bbs, unsigned n, basic_block *new_bbs, in copy_bbs() argument
1350 bbs[i]->flags |= BB_DUPLICATED; in copy_bbs()
1356 bb = bbs[i]; in copy_bbs()
1375 bb = bbs[i]; in copy_bbs()
1394 bb = bbs[i]; in copy_bbs()
[all …]
|
| H A D | hsa-regalloc.c | 421 int *bbs = XNEWVEC (int, n_basic_blocks_for_fn (cfun)); in linear_scan_regalloc() local
430 n = pre_and_rev_post_order_compute (NULL, bbs, true); in linear_scan_regalloc()
438 basic_block bb = BASIC_BLOCK_FOR_FN (cfun, bbs[i]); in linear_scan_regalloc()
470 basic_block bb = BASIC_BLOCK_FOR_FN (cfun, bbs[i]); in linear_scan_regalloc()
526 basic_block bb = BASIC_BLOCK_FOR_FN (cfun, bbs[i]); in linear_scan_regalloc()
648 free (bbs); in linear_scan_regalloc()
|
| H A D | tree-ssa-phiprop.c | 487 vec<basic_block> bbs; in execute() local
502 bbs = get_all_dominated_blocks (CDI_DOMINATORS, in execute()
504 FOR_EACH_VEC_ELT (bbs, i, bb) in execute()
517 bbs.release (); in execute()
|