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

12

/haiku-buildtools/gcc/gcc/
H A Dtree-ssa-loop-unswitch.c231 basic_block *bbs; local
239 bbs = get_loop_body (loop);
246 if ((cond = tree_may_unswitch_on (bbs[i], loop)))
258 free (bbs);
265 stmt = last_stmt (bbs[i]);
288 loop and find the condition only among those still reachable bbs. */
311 of reachable bbs after the above changes and only
312 consider conditions in still reachable bbs. */
316 bbs[i]->flags &= ~BB_REACHABLE;
319 *tos++ = bbs[
[all...]
H A Dcfgloopmanip.c72 remove_bbs (basic_block *bbs, int nbbs) argument
77 delete_basic_block (bbs[i]);
87 find_path (edge e, basic_block **bbs) argument
91 /* Find bbs in the path. */
92 *bbs = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun));
93 return dfs_enumerate_from (e->dest, 0, rpe_enum_p, *bbs,
250 basic_block *bbs = get_loop_body (from->loop_father); local
252 bitmap_set_bit (loop_closed_ssa_invalidated, bbs[i]->index);
253 free (bbs);
462 basic_block *bbs; local
514 basic_block *bbs; local
1107 basic_block *bbs = get_loop_body (loop); local
1171 basic_block *new_bbs, *bbs, *first_active; local
1780 basic_block *bbs = get_loop_body_in_dom_order (nloop), after; local
[all...]
H A Dtree-ssa-loop-ch.c184 basic_block *bbs, *copied_bbs; local
197 bbs = XNEWVEC (basic_block, n_basic_blocks_for_fn (fun));
231 bbs[n_bbs++] = header;
252 if (!gimple_duplicate_sese_region (entry, exit, bbs, n_bbs, copied_bbs,
300 free (bbs);
H A Dcfg.c958 scale_bbs_frequencies_int (basic_block *bbs, int nbbs, int num, int den)
982 bbs[i]->frequency = RDIV (bbs[i]->frequency * num, den);
984 if (bbs[i]->frequency > BB_FREQ_MAX)
985 bbs[i]->frequency = BB_FREQ_MAX;
986 bbs[i]->count = RDIV (bbs[i]->count * num, den);
987 FOR_EACH_EDGE (e, ei, bbs[i]->succs)
1000 scale_bbs_frequencies_gcov_type (basic_block *bbs, int nbbs, gcov_type num,
1013 bbs[
950 scale_bbs_frequencies_int(basic_block *bbs, int nbbs, int num, int den) argument
992 scale_bbs_frequencies_gcov_type(basic_block *bbs, int nbbs, gcov_type num, gcov_type den) argument
[all...]
H A Dcfgloopanal.c202 basic_block *bbs, bb; local
206 bbs = get_loop_body (loop);
209 bb = bbs[i];
214 free (bbs);
226 basic_block *bbs, bb; local
231 bbs = get_loop_body (loop);
234 bb = bbs[i];
246 free (bbs);
H A Dtree-ssa-tail-merge.c241 /* Describes a group of bbs with the same successors. The successor bbs are
250 /* The bbs that have the same successor bbs. */
251 bitmap bbs; member in struct:same_succ_def
252 /* The successor bbs. */
257 /* The edge flags for each of the successor bbs. */
282 /* A group of bbs where 1 bb from bbs can replace the other bbs
287 bitmap bbs; member in struct:bb_cluster_def
856 same_succ_flush_bbs(bitmap bbs) argument
[all...]
H A Ddominance.c767 vec<basic_block> bbs = vNULL; local
774 bbs.safe_push ((basic_block) son->data);
776 bbs.safe_push ((basic_block) ason->data);
778 return bbs;
815 vec<basic_block> bbs = vNULL; local
820 bbs.safe_push (bb);
821 next_level_start = 1; /* = bbs.length (); */
827 bb = bbs[i++];
831 bbs.safe_push (son);
834 next_level_start = bbs
1180 determine_dominators_for_sons(struct graph *g, vec<basic_block> bbs, int y, int *son, int *brother) argument
1261 iterate_fix_dominators(enum cdi_direction dir, vec<basic_block> bbs, bool conservative) argument
[all...]
H A Dtree-ssa-phiprop.c424 vec<basic_block> bbs; local
439 bbs = get_all_dominated_blocks (CDI_DOMINATORS,
441 FOR_EACH_VEC_ELT (bbs, i, bb)
448 bbs.release ();
H A Dcfgloop.c131 basic_block *bbs;
159 bbs = get_loop_body (loop);
161 fprintf (file, " %d", bbs[i]->index);
162 free (bbs);
920 basic_block *bbs = get_loop_body (loop);
922 qsort (bbs, loop->num_nodes, sizeof (basic_block), bb_comparator);
924 return bbs;
1293 basic_block *bbs;
1300 bbs = get_loop_body (loop);
1302 bbs[
130 basic_block *bbs; local
919 basic_block *bbs = get_loop_body (loop); local
1292 basic_block *bbs; local
1329 basic_block bb, *bbs; local
[all...]
H A Dtree-loop-distribution.c410 basic_block *bbs = get_loop_body_in_dom_order (loop); local
414 basic_block bb = bbs[i];
430 free (bbs);
642 basic_block *bbs; local
653 bbs = get_loop_body_in_dom_order (loop);
658 basic_block bb = bbs[i];
681 basic_block bb = bbs[i];
726 free (bbs);
905 basic_block *bbs; local
908 bbs
1750 basic_block *bbs; local
[all...]
H A Dcfghooks.c1268 can_copy_bbs_p (basic_block *bbs, unsigned n) argument
1275 bbs[i]->flags |= BB_DUPLICATED;
1281 FOR_EACH_EDGE (e, ei, bbs[i]->succs)
1289 if (!can_duplicate_block_p (bbs[i]))
1298 bbs[i]->flags &= ~BB_DUPLICATED;
1306 redirected to appropriate newly created block. The function assigns bbs
1327 copy_bbs (basic_block *bbs, unsigned n, basic_block *new_bbs, argument
1335 /* Duplicate bbs, update dominators, assign bbs to loops. */
1339 bb = bbs[
[all...]
H A Dtrans-mem.c2591 vec<basic_block> bbs = vNULL;
2598 bbs.safe_push (entry_block);
2603 basic_block bb = bbs[i++];
2620 bbs.safe_push (e->dest);
2623 while (i < bbs.length ());
2629 return bbs;
3953 vec<basic_block> bbs;
3967 bbs = get_tm_region_blocks (region->entry_block,
3974 for (i = 0; bbs.iterate (i, &bb); ++i)
3981 tm_memopt_clear_visited (bbs);
[all...]
H A Dtree-ssa-ifcombine.c783 basic_block *bbs; local
787 bbs = single_pred_before_succ_order ();
800 basic_block bb = bbs[i];
814 free (bbs);
H A Dtree-vectorizer.c496 basic_block *bbs;
504 bbs = get_loop_body (scalar_loop);
507 basic_block bb = bbs[i];
522 free (bbs);
494 basic_block *bbs; local
H A Dtree-parloops.c489 basic_block *bbs = get_loop_body_in_dom_order (loop); local
493 if (bbs[i]->flags & BB_IRREDUCIBLE_LOOP)
498 free (bbs);
1508 basic_block *bbs, *nbbs, ex_bb, orig_header; local
1547 bbs = get_loop_body_in_dom_order (loop);
1549 for (n = 0; bbs[n] != exit->src; n++)
1553 bbs + 1, n, nbbs);
1555 free (bbs);
1932 basic_block *bbs = get_loop_body_in_dom_order (loop); local
1937 for (gsi = gsi_start_phis (bbs[
[all...]
H A Dtree-ssa-loop-im.c1596 basic_block bb, *bbs; local
1603 bbs = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun) - NUM_FIXED_BLOCKS);
1606 bbs[i++] = bb;
1608 qsort (bbs, n, sizeof (basic_block), sort_bbs_in_loop_postorder_cmp);
1614 basic_block bb = bbs[i];
1625 free (bbs);
2388 basic_block bb = NULL, *bbs, last = NULL; local
2395 bbs = get_loop_body_in_dom_order (loop);
2400 bb = bbs[i];
2441 free (bbs);
[all...]
H A Dtree-vect-loop.c219 basic_block *bbs = LOOP_VINFO_BBS (loop_vinfo); local
240 basic_block bb = bbs[i];
869 Used as predicate for dfs order traversal of the loop bbs. */
890 basic_block *bbs; local
897 bbs = get_loop_body (loop);
902 basic_block bb = bbs[i];
958 free (bbs);
959 bbs = XCNEWVEC (basic_block, loop->num_nodes);
961 bbs, loop->num_nodes, loop);
964 LOOP_VINFO_BBS (res) = bbs;
1004 basic_block *bbs; local
1367 basic_block *bbs = LOOP_VINFO_BBS (loop_vinfo); local
2660 basic_block *bbs = LOOP_VINFO_BBS (loop_vinfo); local
5894 basic_block *bbs = LOOP_VINFO_BBS (loop_vinfo); local
[all...]
H A Dgraphite-optimize-isl.c82 FOR_EACH_VEC_ELT (scop->bbs, i, pbb)
550 FOR_EACH_VEC_ELT (scop->bbs, i, pbb)
H A Dtree-vect-loop-manip.c773 basic_block *new_bbs, *bbs; local
787 bbs = XNEWVEC (basic_block, scalar_loop->num_nodes + 1);
788 get_loop_body_with_size (scalar_loop, bbs, scalar_loop->num_nodes);
791 if (!can_copy_bbs_p (bbs, scalar_loop->num_nodes))
793 free (bbs);
811 bbs[scalar_loop->num_nodes] = preheader;
815 copy_bbs (bbs, scalar_loop->num_nodes + 1, new_bbs,
927 free (bbs);
H A Dtree-cfg.c705 auto_vec<basic_block> *bbs, bool computed_goto)
729 if (bbs->is_empty ())
734 FOR_EACH_VEC_ELT (*bbs, idx, bb)
767 FOR_EACH_VEC_ELT (*bbs, idx, bb)
797 FOR_EACH_VEC_ELT (*bbs, idx, bb)
6117 bb_part_of_region_p (basic_block bb, basic_block* bbs, unsigned n_region) argument
6123 if (bb == bbs[n])
6894 bitmap bbs = BITMAP_ALLOC (NULL); local
6904 bitmap_set_bit (bbs, bb->index);
6906 gcc_assert (bitmap_bit_p (bbs, entr
703 handle_abnormal_edges(basic_block *dispatcher_bbs, basic_block for_bb, int *bb_to_omp_idx, auto_vec<basic_block> *bbs, bool computed_goto) argument
6962 vec<basic_block> bbs, dom_bbs; local
[all...]
H A Dmodulo-sched.c1237 basic_block *bbs = get_loop_body (loop);
1240 bbs[i]->flags |= BB_DISABLE_SCHEDULE;
1242 free (bbs);
1251 basic_block *bbs = get_loop_body (loop);
1258 if (bbs[i] == loop->header)
1263 get_ebb_head_tail (bbs[i], bbs[i], &head, &tail);
1275 free (bbs);
1279 free (bbs);
1234 basic_block *bbs = get_loop_body (loop); local
1248 basic_block *bbs = get_loop_body (loop); local
H A Dsel-sched-ir.c2838 sched_scan (const struct sched_scan_info_def *ssi, bb_vec_t bbs)
2847 FOR_EACH_VEC_ELT (bbs, i, bb)
2854 FOR_EACH_VEC_ELT (bbs, i, bb)
3080 sel_init_global_and_expr (bb_vec_t bbs)
3091 sched_scan (&ssi, bbs);
3130 bb_vec_t bbs;
3133 bbs.create (current_nr_blocks);
3136 bbs.quick_push (BASIC_BLOCK_FOR_FN (cfun, BB_TO_BLOCK (i)));
3148 sched_scan (&ssi, bbs);
3151 bbs
2822 sched_scan(const struct sched_scan_info_def *ssi, bb_vec_t bbs) argument
3064 sel_init_global_and_expr(bb_vec_t bbs) argument
3114 bb_vec_t bbs; local
4672 sel_init_bbs(bb_vec_t bbs) argument
6322 sel_add_loop_preheaders(bb_vec_t *bbs) argument
[all...]
H A Dpredict.c1490 basic_block bb, *bbs; local
1580 bbs = get_loop_body (loop);
1588 bb = bbs[j];
1648 free (bbs);
2659 basic_block *bbs;
2669 bbs = get_loop_body (loop);
2671 bitmap_set_bit (tovisit, bbs[i]->index);
2672 free (bbs);
2655 basic_block *bbs; local
H A Dgraphite-poly.c1007 loop_to_lst (loop_p loop, vec<poly_bb_p> bbs, int *i) argument
1013 for (; bbs.iterate (*i, &pbb); (*i)++)
1027 stmt = loop_to_lst (next, bbs, i);
H A Dtree-ssa-loop-manip.c1313 basic_block *bbs = get_loop_body_in_dom_order (loop); local
1318 basic_block bb = bbs[i];
1328 free (bbs);

Completed in 321 milliseconds

12