Searched refs:bbs (Results 1 - 25 of 108) sorted by relevance

12345

/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Dgimple-loop-jam.cc108 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));
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])
144 FOR_EACH_EDGE (e, ei, bbs[
191 basic_block *bbs; local
[all...]
H A Ddomwalk.cc145 sort_bbs_postorder (basic_block *bbs, int n, int *bb_postorder) argument
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[
[all...]
H A Dcfgloopmanip.cc55 remove_bbs (basic_block *bbs, int nbbs) argument
60 delete_basic_block (bbs[i]);
70 find_path (edge e, basic_block **bbs) argument
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);
234 free (bbs);
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...]
H A Dcfgloopanal.cc179 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);
H A Ddominance.cc898 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
1237 prune_bbs_to_update_dominators(vec<basic_block> &bbs, bool conservative) argument
1308 determine_dominators_for_sons(struct graph *g, vec<basic_block> bbs, int y, int *son, int *brother) argument
1389 iterate_fix_dominators(enum cdi_direction dir, vec<basic_block> &bbs, bool conservative) argument
[all...]
H A Dtree-ssa-tail-merge.cc211 /* 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
846 same_succ_flush_bbs(bitmap bbs) argument
[all...]
H A Dtree-ssa-loop-split.cc488 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[
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...]
H A Dtree-ssa-loop-unswitch.cc270 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[
[all...]
H A Dtree-ssa-loop-ch.cc373 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);
H A Dcfgloop.cc115 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...]
/netbsd-current/external/gpl3/gcc.old/dist/gcc/
H A Dgimple-loop-jam.c107 basic_block *bbs; local
114 bbs = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun));
115 n = get_loop_body_with_size (loop, bbs, n_basic_blocks_for_fn (cfun));
123 if (bbs[i]->loop_father == old
124 || loop_depth (bbs[i]->loop_father) < loop_depth (old))
126 remove_bb_from_loops (bbs[i]);
127 add_bb_to_loop (bbs[i], loop);
132 subloop = bbs[i]->loop_father;
133 if (loop_outer (subloop) == old && subloop->header == bbs[i])
143 FOR_EACH_EDGE (e, ei, bbs[
190 basic_block *bbs; local
[all...]
H A Ddomwalk.c145 sort_bbs_postorder (basic_block *bbs, int n, int *bb_postorder) argument
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[
[all...]
H A Dcfgloopmanip.c55 remove_bbs (basic_block *bbs, int nbbs) argument
60 delete_basic_block (bbs[i]);
70 find_path (edge e, basic_block **bbs) argument
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,
232 basic_block *bbs = get_loop_body (from->loop_father); local
234 bitmap_set_bit (loop_closed_ssa_invalidated, bbs[i]->index);
235 free (bbs);
443 basic_block *bbs; local
495 basic_block *bbs; local
1107 basic_block *bbs = get_loop_body (loop); local
1137 basic_block *new_bbs, *bbs, *first_active; local
1756 basic_block *bbs = get_loop_body_in_dom_order (nloop), after; local
[all...]
H A Dtree-ssa-tail-merge.c211 /* 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
846 same_succ_flush_bbs(bitmap bbs) argument
[all...]
H A Ddominance.c891 vec<basic_block> bbs = vNULL; local
898 bbs.safe_push ((basic_block) son->data);
900 bbs.safe_push ((basic_block) ason->data);
902 return bbs;
939 vec<basic_block> bbs = vNULL; local
944 bbs.safe_push (bb);
945 next_level_start = 1; /* = bbs.length (); */
951 bb = bbs[i++];
955 bbs.safe_push (son);
958 next_level_start = bbs
1301 determine_dominators_for_sons(struct graph *g, vec<basic_block> bbs, int y, int *son, int *brother) argument
1382 iterate_fix_dominators(enum cdi_direction dir, vec<basic_block> bbs, bool conservative) argument
[all...]
H A Dcfgloopanal.c179 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);
H A Dtree-ssa-loop-split.c497 basic_block *bbs; local
518 bbs = get_loop_body (loop1);
520 if (!can_copy_bbs_p (bbs, loop1->num_nodes))
522 free (bbs);
528 if ((guard_iv = split_at_bb_p (loop1, bbs[i], &border, &iv)))
542 gcond *guard_stmt = as_a<gcond *> (last_stmt (bbs[i]));
613 gcond *force_true = as_a<gcond *> (last_stmt (bbs[i]));
614 gcond *force_false = as_a<gcond *> (last_stmt (get_bb_copy (bbs[i])));
636 free (bbs);
676 basic_block *bbs; variable
1333 basic_block *bbs = ((split_info *) loop->aux)->bbs; local
1556 basic_block *bbs = info->bbs = get_loop_body (loop); local
[all...]
H A Dtree-ssa-loop-unswitch.c269 basic_block *bbs; local
312 bbs = get_loop_body (loop);
319 if ((cond = tree_may_unswitch_on (bbs[i], loop)))
331 free (bbs);
338 stmt = last_stmt (bbs[i]);
361 loop and find the condition only among those still reachable bbs. */
384 of reachable bbs after the above changes and only
385 consider conditions in still reachable bbs. */
389 bbs[i]->flags &= ~BB_REACHABLE;
392 *tos++ = bbs[
[all...]
H A Dtree-ssa-phiprop.c487 vec<basic_block> bbs; local
502 bbs = get_all_dominated_blocks (CDI_DOMINATORS,
504 FOR_EACH_VEC_ELT (bbs, i, bb)
517 bbs.release ();
H A Dtree-ssa-loop-ch.c354 basic_block *bbs, *copied_bbs; local
362 bbs = XNEWVEC (basic_block, n_basic_blocks_for_fn (fun));
402 bbs[n_bbs++] = header;
425 if (!gimple_duplicate_sese_region (entry, exit, bbs, n_bbs, copied_bbs,
517 free (bbs);
H A Dcfgloop.c113 basic_block *bbs;
150 bbs = get_loop_body (loop);
152 fprintf (file, " %d", bbs[i]->index);
153 free (bbs);
977 basic_block *bbs = get_loop_body (loop);
979 qsort (bbs, loop->num_nodes, sizeof (basic_block), bb_comparator);
981 return bbs;
990 basic_block *bbs = get_loop_body (loop);
992 gcc_sort_r (bbs, loop->num_nodes, sizeof (basic_block), bb_comparator, data);
994 return bbs;
112 basic_block *bbs; local
976 basic_block *bbs = get_loop_body (loop); local
989 basic_block *bbs = get_loop_body (loop); local
1360 basic_block *bbs; local
1405 basic_block bb, *bbs; local
[all...]
H A Dhsa-regalloc.c421 int *bbs = XNEWVEC (int, n_basic_blocks_for_fn (cfun)); local
430 n = pre_and_rev_post_order_compute (NULL, bbs, true);
438 basic_block bb = BASIC_BLOCK_FOR_FN (cfun, bbs[i]);
470 basic_block bb = BASIC_BLOCK_FOR_FN (cfun, bbs[i]);
526 basic_block bb = BASIC_BLOCK_FOR_FN (cfun, bbs[i]);
648 free (bbs);
H A Dcfghooks.c1278 can_copy_bbs_p (basic_block *bbs, unsigned n) argument
1285 bbs[i]->flags |= BB_DUPLICATED;
1291 FOR_EACH_EDGE (e, ei, bbs[i]->succs)
1299 if (!can_duplicate_block_p (bbs[i]))
1308 bbs[i]->flags &= ~BB_DUPLICATED;
1316 redirected to appropriate newly created block. The function assigns bbs
1337 copy_bbs (basic_block *bbs, unsigned n, basic_block *new_bbs, argument
1350 bbs[i]->flags |= BB_DUPLICATED;
1352 /* Duplicate bbs, update dominators, assign bbs t
[all...]
/netbsd-current/lib/libc/arch/vax/gen/
H A Dswapcontext.S46 bbs $13,6(%fp),2f /* was this a CALLG? */
/netbsd-current/external/apache2/llvm/dist/llvm/utils/
H A Dupdate_mir_test_checks.py154 bbs = 0
158 if bbs == 1:
161 bbs = 0
164 bbs += 1
165 if bbs == 1:

Completed in 225 milliseconds

12345