| /src/external/gpl3/gcc.old/dist/gcc/ |
| gimple-loop-jam.cc | 108 basic_block *bbs; local
115 bbs = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun));
116 n = get_loop_body_with_size (loop, bbs, n_basic_blocks_for_fn (cfun));
122 as well. This avoids changing the loop father for BBs
124 if (bbs[i]->loop_father == old
125 || loop_depth (bbs[i]->loop_father) < loop_depth (old))
127 remove_bb_from_loops (bbs[i]);
128 add_bb_to_loop (bbs[i], loop);
133 subloop = bbs[i]->loop_father;
134 if (loop_outer (subloop) == old && subloop->header == bbs[i]
191 basic_block *bbs; local
[all...] |
| domwalk.cc | 141 /* Permute array BBS of N basic blocks in postorder,
145 sort_bbs_postorder (basic_block *bbs, int n, int *bb_postorder)
149 basic_block bb0 = bbs[0], bb1 = bbs[1];
151 bbs[0] = bb1, bbs[1] = bb0;
155 basic_block bb0 = bbs[0], bb1 = bbs[1], bb2 = bbs[2];
164 bbs[0] = bb0, bbs[1] = bb1, bbs[2] = bb2
[all...] |
| cfgloopmanip.cc | 52 /* Remove basic blocks BBS. NBBS is the number of the basic blocks. */
55 remove_bbs (basic_block *bbs, int nbbs)
60 delete_basic_block (bbs[i]);
64 into array BBS, that will be allocated large enough to contain them.
70 find_path (edge e, basic_block **bbs)
74 /* Find bbs in the path. */
75 *bbs = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun));
76 return dfs_enumerate_from (e->dest, 0, rpe_enum_p, *bbs,
231 basic_block *bbs = get_loop_body (from->loop_father); local
233 bitmap_set_bit (loop_closed_ssa_invalidated, bbs[i]->index)
442 basic_block *bbs; local
494 basic_block *bbs; local
1041 basic_block *bbs = get_loop_body (loop); local
1070 basic_block *new_bbs, *bbs, *first_active; local
1694 basic_block *bbs = get_loop_body_in_dom_order (nloop), after; local
[all...] |
| cfgloopanal.cc | 179 basic_block *bbs, bb; local
183 bbs = get_loop_body (loop);
186 bb = bbs[i];
191 free (bbs);
203 basic_block *bbs, bb; local
209 bbs = get_loop_body (loop);
212 bb = bbs[i];
223 free (bbs);
227 free (bbs);
|
| dominance.cc | 898 auto_vec<basic_block> bbs; local
903 return bbs;
905 bbs.safe_push ((basic_block) son->data);
907 bbs.safe_push ((basic_block) ason->data);
909 return bbs;
946 auto_vec<basic_block> bbs; local
951 bbs.safe_push (bb);
952 next_level_start = 1; /* = bbs.length (); */
958 bb = bbs[i++];
962 bbs.safe_push (son)
[all...] |
| tree-ssa-tail-merge.cc | 211 /* Describes a group of bbs with the same successors. The successor bbs are
220 /* The bbs that have the same successor bbs. */
221 bitmap bbs; member in struct:same_succ
222 /* The successor bbs. */
227 /* The edge flags for each of the successor bbs. */
248 /* A group of bbs where 1 bb from bbs can replace the other bbs. *
253 bitmap bbs; member in struct:bb_cluster
[all...] |
| tree-ssa-loop-split.cc | 488 don't adjust the bbs dominated by true branches of that loop to avoid
530 basic_block *bbs; local
552 bbs = get_loop_body (loop1);
554 if (!can_copy_bbs_p (bbs, loop1->num_nodes))
556 free (bbs);
562 if ((guard_iv = split_at_bb_p (loop1, bbs[i], &border, &iv)))
576 gcond *guard_stmt = as_a<gcond *> (last_stmt (bbs[i]));
615 extract_true_false_edges_from_block (bbs[i], &true_edge, &false_edge);
660 gcond *force_true = as_a<gcond *> (last_stmt (bbs[i]));
661 gcond *force_false = as_a<gcond *> (last_stmt (get_bb_copy (bbs[i])))
722 basic_block *bbs; member in class:split_info
1379 basic_block *bbs = ((split_info *) loop->aux)->bbs; local
1609 basic_block *bbs = info->bbs = get_loop_body (loop); local
[all...] |
| tree-ssa-loop-unswitch.cc | 270 basic_block *bbs; local
318 bbs = get_loop_body (loop);
325 if ((cond = tree_may_unswitch_on (bbs[i], loop)))
337 free (bbs);
344 stmt = last_stmt (bbs[i]);
367 loop and find the condition only among those still reachable bbs. */
390 of reachable bbs after the above changes and only
391 consider conditions in still reachable bbs. */
395 bbs[i]->flags &= ~BB_REACHABLE;
398 *tos++ = bbs[0]
[all...] |
| tree-ssa-loop-ch.cc | 373 basic_block *bbs, *copied_bbs; local
381 bbs = XNEWVEC (basic_block, n_basic_blocks_for_fn (fun));
457 bbs[n_bbs++] = header;
480 if (!gimple_duplicate_sese_region (entry, exit, bbs, n_bbs, copied_bbs,
572 free (bbs);
|
| cfgloop.cc | 115 basic_block *bbs;
152 bbs = get_loop_body (loop);
154 fprintf (file, " %d", bbs[i]->index);
155 free (bbs);
974 basic_block *bbs = get_loop_body (loop);
976 qsort (bbs, loop->num_nodes, sizeof (basic_block), bb_comparator);
978 return bbs;
987 basic_block *bbs = get_loop_body (loop);
989 gcc_sort_r (bbs, loop->num_nodes, sizeof (basic_block), bb_comparator, data);
991 return bbs;
114 basic_block *bbs; local
973 basic_block *bbs = get_loop_body (loop); local
986 basic_block *bbs = get_loop_body (loop); local
1357 basic_block *bbs; local
1402 basic_block bb, *bbs; local
[all...] |
| cfghooks.cc | 1295 /* Checks whether all N blocks in BBS array can be copied. */
1297 can_copy_bbs_p (basic_block *bbs, unsigned n)
1304 bbs[i]->flags |= BB_DUPLICATED;
1310 FOR_EACH_EDGE (e, ei, bbs[i]->succs)
1318 if (!can_duplicate_block_p (bbs[i]))
1327 bbs[i]->flags &= ~BB_DUPLICATED;
1332 /* Duplicates N basic blocks stored in array BBS. Newly created basic blocks
1334 in BBS are also duplicated and copies of those that lead into BBS are
1335 redirected to appropriate newly created block. The function assigns bbs
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| gimple-loop-jam.cc | 109 basic_block *bbs; local
116 bbs = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun));
117 n = get_loop_body_with_size (loop, bbs, n_basic_blocks_for_fn (cfun));
123 as well. This avoids changing the loop father for BBs
125 if (bbs[i]->loop_father == old
126 || loop_depth (bbs[i]->loop_father) < loop_depth (old))
128 remove_bb_from_loops (bbs[i]);
129 add_bb_to_loop (bbs[i], loop);
134 subloop = bbs[i]->loop_father;
135 if (loop_outer (subloop) == old && subloop->header == bbs[i]
192 basic_block *bbs; local
[all...] |
| domwalk.cc | 141 /* Permute array BBS of N basic blocks in postorder,
145 sort_bbs_postorder (basic_block *bbs, int n, int *bb_postorder)
149 basic_block bb0 = bbs[0], bb1 = bbs[1];
151 bbs[0] = bb1, bbs[1] = bb0;
155 basic_block bb0 = bbs[0], bb1 = bbs[1], bb2 = bbs[2];
164 bbs[0] = bb0, bbs[1] = bb1, bbs[2] = bb2
[all...] |
| cfgloopmanip.cc | 53 /* Remove basic blocks BBS. NBBS is the number of the basic blocks. */
56 remove_bbs (basic_block *bbs, int nbbs)
61 delete_basic_block (bbs[i]);
65 into array BBS, that will be allocated large enough to contain them.
71 find_path (edge e, basic_block **bbs)
75 /* Find bbs in the path. */
76 *bbs = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun));
77 return dfs_enumerate_from (e->dest, 0, rpe_enum_p, *bbs,
232 basic_block *bbs = get_loop_body (from->loop_father); local
234 bitmap_set_bit (loop_closed_ssa_invalidated, bbs[i]->index)
443 basic_block *bbs; local
495 basic_block *bbs; local
1177 basic_block *bbs = get_loop_body (loop); local
1206 basic_block *new_bbs, *bbs, *first_active; local
1860 basic_block *bbs = get_loop_body_in_dom_order (nloop), after; local
[all...] |
| dominance.cc | 901 auto_vec<basic_block> bbs; local
906 return bbs;
908 bbs.safe_push ((basic_block) son->data);
910 bbs.safe_push ((basic_block) ason->data);
912 return bbs;
949 auto_vec<basic_block> bbs; local
954 bbs.safe_push (bb);
955 next_level_start = 1; /* = bbs.length (); */
961 bb = bbs[i++];
965 bbs.safe_push (son)
[all...] |
| tree-ssa-tail-merge.cc | 211 /* Describes a group of bbs with the same successors. The successor bbs are
220 /* The bbs that have the same successor bbs. */
221 bitmap bbs; member in struct:same_succ
222 /* The successor bbs. */
227 /* The edge flags for each of the successor bbs. */
248 /* A group of bbs where 1 bb from bbs can replace the other bbs. *
253 bitmap bbs; member in struct:bb_cluster
[all...] |
| cfgloopanal.cc | 179 basic_block *bbs, bb; local
183 bbs = get_loop_body (loop);
186 bb = bbs[i];
191 free (bbs);
203 basic_block *bbs, bb; local
209 bbs = get_loop_body (loop);
212 bb = bbs[i];
223 free (bbs);
227 free (bbs);
|
| tree-ssa-loop-split.cc | 527 don't adjust the bbs dominated by true branches of that loop to avoid
571 basic_block *bbs; local
600 bbs = get_loop_body (loop1);
602 if (!can_copy_bbs_p (bbs, loop1->num_nodes))
604 free (bbs);
611 if ((guard_iv = split_at_bb_p (loop1, bbs[i], &border, &iv, &guard_code)))
625 gcond *guard_stmt = as_a<gcond *> (*gsi_last_bb (bbs[i]));
659 if (!dominated_by_p (CDI_DOMINATORS, exit1->src, bbs[i]))
682 extract_true_false_edges_from_block (bbs[i], &true_edge, &false_edge);
770 gcond *force_true = as_a<gcond *> (*gsi_last_bb (bbs[i]))
832 basic_block *bbs; member in class:split_info
1488 basic_block *bbs = ((split_info *) loop->aux)->bbs; local
1718 basic_block *bbs = info->bbs = get_loop_body (loop); local
[all...] |
| tree-ssa-loop-unswitch.cc | 90 4) We consider one by one the unswitching candidates and calculate BBs that
262 basic_block *bbs = get_loop_body (loop); local
279 find_unswitching_predicates_for_bb (bbs[i], loop, outer_loop, candidates,
282 set_predicates_for_bb (bbs[i], candidates);
286 gimple *last = last_nondebug_stmt (bbs[i]);
294 free (bbs);
295 bbs = get_loop_body (outer_loop);
302 for (gimple_stmt_iterator gsi = gsi_start_bb (bbs[i]); !gsi_end_p (gsi);
306 if (!flow_bb_inside_loop_p (loop, bbs[i]))
308 gimple *last = last_nondebug_stmt (bbs[i])
800 basic_block *bbs = get_loop_body (loop); local
[all...] |
| cfgloop.cc | 116 basic_block *bbs;
145 bbs = get_loop_body (loop);
147 fprintf (file, " %d", bbs[i]->index);
148 free (bbs);
967 basic_block *bbs = get_loop_body (loop);
969 qsort (bbs, loop->num_nodes, sizeof (basic_block), bb_comparator);
971 return bbs;
980 basic_block *bbs = get_loop_body (loop);
982 gcc_sort_r (bbs, loop->num_nodes, sizeof (basic_block), bb_comparator, data);
984 return bbs;
115 basic_block *bbs; local
966 basic_block *bbs = get_loop_body (loop); local
979 basic_block *bbs = get_loop_body (loop); local
1350 basic_block *bbs; local
1395 basic_block bb, *bbs; local
[all...] |
| tree-ssa-loop-ch.cc | 552 bbs duplicated.
784 basic_block *bbs, *copied_bbs; local
791 bbs = XNEWVEC (basic_block, n_basic_blocks_for_fn (fun));
894 /* "Duplicate" all BBs with zero cost following last basic blocks we
955 bbs[n_bbs++] = header;
976 if (!gimple_duplicate_seme_region (entry, exit, bbs, n_bbs, copied_bbs,
986 update_profile_after_ch (loop, bbs, copied_bbs, n_bbs,
1074 basic_block *bbs = get_loop_body (loop); local
1077 basic_block bb = bbs[i];
1109 free (bbs);
[all...] |
| cfghooks.cc | 1303 /* Checks whether all N blocks in BBS array can be copied. */
1305 can_copy_bbs_p (basic_block *bbs, unsigned n)
1312 bbs[i]->flags |= BB_DUPLICATED;
1318 FOR_EACH_EDGE (e, ei, bbs[i]->succs)
1326 if (!can_duplicate_block_p (bbs[i]))
1335 bbs[i]->flags &= ~BB_DUPLICATED;
1340 /* Duplicates N basic blocks stored in array BBS. Newly created basic blocks
1342 in BBS are also duplicated and copies of those that lead into BBS are
1343 redirected to appropriate newly created block. The function assigns bbs
[all...] |
| /src/lib/libc/arch/vax/gen/ |
| swapcontext.S | 46 bbs $13,6(%fp),2f /* was this a CALLG? */
|
| /src/external/gpl3/gcc.old/dist/gcc/rtl-ssa/ |
| blocks.cc | 298 for (const bb_info *bb : bbs ())
552 for (bb_info *bb : ebb->bbs ())
1218 auto_vec<bb_info *, 16> bbs; local
1229 bbs.safe_push (create_bb_info (cfg_bb));
1235 auto *ebb = allocate<ebb_info> (bbs[0], bbs.last ());
1236 for (bb_info *bb : bbs)
1238 bbs.truncate (0);
|
| /src/external/apache2/llvm/dist/llvm/utils/ |
| update_mir_test_checks.py | 154 bbs = 0
158 if bbs == 1:
161 bbs = 0
164 bbs += 1
165 if bbs == 1:
|
