Searched refs:ENTRY_BLOCK_PTR (Results 1 - 25 of 67) sorted by relevance

123

/freebsd-10.1-release/contrib/gcc/
H A Dcfganal.c90 if (bb == EXIT_BLOCK_PTR || bb == ENTRY_BLOCK_PTR
186 stack[sp++] = ei_start (ENTRY_BLOCK_PTR->succs);
218 if (dest != EXIT_BLOCK_PTR && src != ENTRY_BLOCK_PTR
223 if (ei_one_before_end_p (ei) && src != ENTRY_BLOCK_PTR)
298 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
357 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb)
370 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb)
402 if (INDEX_EDGE_PRED_BB (elist, x) == ENTRY_BLOCK_PTR)
426 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb)
451 FOR_BB_BETWEEN (p, ENTRY_BLOCK_PTR, EXIT_BLOCK_PT
[all...]
H A Dprofile.c140 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb)
238 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb)
297 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb)
312 BB_INFO (ENTRY_BLOCK_PTR)->pred_count = 2;
320 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb)
491 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb)
820 && e->src != ENTRY_BLOCK_PTR)
822 if (e->src == ENTRY_BLOCK_PTR)
838 make_edge (ENTRY_BLOCK_PTR, bb, EDGE_FAKE);
857 && e->src != ENTRY_BLOCK_PTR
[all...]
H A Dlcm.c163 if (!e->src->aux && e->src != ENTRY_BLOCK_PTR)
198 if (pred == ENTRY_BLOCK_PTR)
286 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
508 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
509 e->dest->aux = ENTRY_BLOCK_PTR;
524 if (bb->aux == ENTRY_BLOCK_PTR)
582 if (pred == ENTRY_BLOCK_PTR)
664 && e->src != ENTRY_BLOCK_PTR && e->src->aux == 0)
675 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
701 if (b == ENTRY_BLOCK_PTR)
[all...]
H A Dcfg.c89 ENTRY_BLOCK_PTR = ggc_alloc_cleared (sizeof (struct basic_block_def));
90 ENTRY_BLOCK_PTR->index = ENTRY_BLOCK;
93 ENTRY_BLOCK_PTR->next_bb = EXIT_BLOCK_PTR;
94 EXIT_BLOCK_PTR->prev_bb = ENTRY_BLOCK_PTR;
125 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
128 VEC_truncate (edge, ENTRY_BLOCK_PTR->succs, 0);
171 SET_BASIC_BLOCK (ENTRY_BLOCK, ENTRY_BLOCK_PTR);
293 || src == ENTRY_BLOCK_PTR
422 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb)
459 if (bb != ENTRY_BLOCK_PTR)
[all...]
H A Dcfgbuild.c266 /* By nature of the way these get numbered, ENTRY_BLOCK_PTR->next_bb block
268 if (min == ENTRY_BLOCK_PTR->next_bb)
269 make_edge (ENTRY_BLOCK_PTR, min, EDGE_FALLTHRU);
295 cached_make_edge (NULL, ENTRY_BLOCK_PTR, bb, 0);
437 basic_block prev = ENTRY_BLOCK_PTR;
542 ENTRY_BLOCK_PTR->next_bb = EXIT_BLOCK_PTR;
543 EXIT_BLOCK_PTR->prev_bb = ENTRY_BLOCK_PTR;
558 SET_BASIC_BLOCK (ENTRY_BLOCK, ENTRY_BLOCK_PTR);
570 make_edges (ENTRY_BLOCK_PTR->next_bb, EXIT_BLOCK_PTR->prev_bb, 0);
671 make_edge (ENTRY_BLOCK_PTR, b
[all...]
H A Dcfghooks.c84 last_bb_seen = ENTRY_BLOCK_PTR;
85 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR->next_bb, NULL, next_bb)
204 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
211 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb)
218 last_bb_seen = ENTRY_BLOCK_PTR;
638 if (ENTRY_BLOCK_PTR->next_bb == EXIT_BLOCK_PTR)
641 FOR_BB_BETWEEN (b, ENTRY_BLOCK_PTR->next_bb, EXIT_BLOCK_PTR->prev_bb, next_bb)
681 if (bb == EXIT_BLOCK_PTR || bb == ENTRY_BLOCK_PTR)
H A Dcfgloop.c255 if (ancestor != ENTRY_BLOCK_PTR
308 loop->single_exit = single_succ_edge (ENTRY_BLOCK_PTR);
321 if (loop->single_exit == single_succ_edge (ENTRY_BLOCK_PTR))
484 if (latch != ENTRY_BLOCK_PTR
497 if (HEADER_BLOCK (single_succ (ENTRY_BLOCK_PTR)))
503 bb = split_edge (single_succ_edge (ENTRY_BLOCK_PTR));
657 if (latch != ENTRY_BLOCK_PTR
681 loops->parray[0]->header = ENTRY_BLOCK_PTR;
682 ENTRY_BLOCK_PTR->loop_father = loops->parray[0];
730 if (latch != ENTRY_BLOCK_PTR
[all...]
H A Dtree-ssa-dce.c145 if (bb == ENTRY_BLOCK_PTR)
181 if (INDEX_EDGE_PRED_BB (el, edge_index) == ENTRY_BLOCK_PTR)
182 ending_block = single_succ (ENTRY_BLOCK_PTR);
208 gcc_assert (block != ENTRY_BLOCK_PTR);
452 if (bb == ENTRY_BLOCK_PTR)
504 if (bb != ENTRY_BLOCK_PTR
533 if (arg_bb != ENTRY_BLOCK_PTR
H A Dregs.h95 && !ENTRY_BLOCK_PTR->count) \
H A Dcfgrtl.c447 BB_HEAD (ENTRY_BLOCK_PTR->next_bb) : get_insns ());
455 edge_iterator ei = ei_start (ENTRY_BLOCK_PTR->succs);
665 && a != ENTRY_BLOCK_PTR && b != EXIT_BLOCK_PTR
1011 if (e->src != ENTRY_BLOCK_PTR && e->dest != EXIT_BLOCK_PTR
1052 if (e->src == ENTRY_BLOCK_PTR)
1061 basic_block bb = create_basic_block (BB_HEAD (e->dest), NULL, ENTRY_BLOCK_PTR);
1066 for (ei = ei_start (ENTRY_BLOCK_PTR->succs); (tmp = ei_safe_edge (ei)); )
1070 VEC_unordered_remove (edge, ENTRY_BLOCK_PTR->succs, ei.index);
1081 make_single_succ_edge (ENTRY_BLOCK_PTR, bb, EDGE_FALLTHRU);
1372 && e->src != ENTRY_BLOCK_PTR
[all...]
H A Dcfgexpand.c1416 gcc_assert (EDGE_COUNT (ENTRY_BLOCK_PTR->succs) == 1);
1417 init_rtl_bb_info (ENTRY_BLOCK_PTR);
1419 ENTRY_BLOCK_PTR->flags |= BB_RTL;
1422 e = EDGE_SUCC (ENTRY_BLOCK_PTR, 0);
1426 if (e && e->dest != ENTRY_BLOCK_PTR->next_bb)
1438 ENTRY_BLOCK_PTR);
1439 init_block->frequency = ENTRY_BLOCK_PTR->frequency;
1440 init_block->count = ENTRY_BLOCK_PTR->count;
1450 e->count = ENTRY_BLOCK_PTR->count;
1645 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR
[all...]
H A Dcfglayout.c607 for (bb = ENTRY_BLOCK_PTR->next_bb, index = NUM_FIXED_BLOCKS;
655 for (bb = ENTRY_BLOCK_PTR->next_bb; bb ; bb = bb->aux)
796 for (bb = ENTRY_BLOCK_PTR->next_bb, index = NUM_FIXED_BLOCKS;
813 prev_bb = ENTRY_BLOCK_PTR;
814 bb = ENTRY_BLOCK_PTR->next_bb;
893 basic_block c = ENTRY_BLOCK_PTR->next_bb;
1155 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb)
H A Dcfgloopanal.c282 FOR_BB_BETWEEN (act, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb)
292 FOR_BB_BETWEEN (act, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb)
338 FOR_BB_BETWEEN (act, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb)
H A Ddomwalk.c155 if (EDGE_COUNT (bb->preds) > 0 || bb == ENTRY_BLOCK_PTR)
H A Dtree-ssa-loop-unswitch.c170 if (e->src == ENTRY_BLOCK_PTR)
H A Dtree-tailcall.c739 first = single_succ (ENTRY_BLOCK_PTR);
761 decrease_profile (ENTRY_BLOCK_PTR, e->count, EDGE_FREQUENCY (e));
875 basic_block first = single_succ (ENTRY_BLOCK_PTR);
906 first = split_edge (single_succ_edge (ENTRY_BLOCK_PTR));
H A Dcfgcleanup.c784 return b->prev_bb == ENTRY_BLOCK_PTR ? b : b->prev_bb;
829 return next == ENTRY_BLOCK_PTR ? next->next_bb : next;
841 if (b_fallthru_edge->src == ENTRY_BLOCK_PTR)
849 return next == ENTRY_BLOCK_PTR ? next->next_bb : next;
1643 if (src1 == ENTRY_BLOCK_PTR || src2 == ENTRY_BLOCK_PTR)
1996 for (b = ENTRY_BLOCK_PTR->next_bb; b != EXIT_BLOCK_PTR;)
2027 && (single_pred (b) == ENTRY_BLOCK_PTR
2065 c = b->prev_bb == ENTRY_BLOCK_PTR ? b->next_bb : b->prev_bb;
2185 for (b = ENTRY_BLOCK_PTR
[all...]
H A Dpredict.c274 if ((e->src != ENTRY_BLOCK_PTR && EDGE_COUNT (e->src->succs) > 1)
1255 heads[ENTRY_BLOCK_PTR->next_bb->index] = last_basic_block;
1739 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb)
1763 if (ENTRY_BLOCK_PTR->frequency == 0)
1767 limit = ENTRY_BLOCK_PTR->frequency * threshold;
1812 single_succ_edge (ENTRY_BLOCK_PTR)->probability = REG_BR_PROB_BASE;
1818 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb)
1842 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb)
H A Dtracer.c325 basic_block end = single_succ (ENTRY_BLOCK_PTR);
337 && e->dest != single_succ (ENTRY_BLOCK_PTR)
H A Ddominance.c211 /* Start block (ENTRY_BLOCK_PTR for forward problem, EXIT_BLOCK for backward
225 ex_block = ENTRY_BLOCK_PTR;
230 en_block = ENTRY_BLOCK_PTR;
317 basic_block begin = reverse ? EXIT_BLOCK_PTR : ENTRY_BLOCK_PTR;
483 en_block = ENTRY_BLOCK_PTR;
965 if (!dominated_by_p (dir, bb, ENTRY_BLOCK_PTR))
996 if (!dominated_by_p (dir, e->src, ENTRY_BLOCK_PTR))
H A Dtree-cfgcleanup.c256 ENTRY_BLOCK_PTR. */
280 gcc_assert (bb != ENTRY_BLOCK_PTR);
301 if (find_edge (ENTRY_BLOCK_PTR, bb))
H A Dsbitmap.c581 if (e->src == ENTRY_BLOCK_PTR)
597 if (e->src == ENTRY_BLOCK_PTR)
661 if (e->src== ENTRY_BLOCK_PTR)
677 if (e->src == ENTRY_BLOCK_PTR)
H A Dbb-reorder.c243 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
632 if (best_edge->dest != ENTRY_BLOCK_PTR->next_bb)
826 if ((e->src != ENTRY_BLOCK_PTR && bbd[e->src->index].end_of_trace >= 0)
965 if (e->src != ENTRY_BLOCK_PTR
1250 if (e->src != ENTRY_BLOCK_PTR
1298 if (src && (src != ENTRY_BLOCK_PTR))
H A Dtree-into-ssa.c393 if (pred != ENTRY_BLOCK_PTR
2055 walk_dominator_tree (&walk_data, ENTRY_BLOCK_PTR);
2116 rewrite_blocks (ENTRY_BLOCK_PTR, REWRITE_ALL, interesting_blocks);
2769 if (entry != ENTRY_BLOCK_PTR)
3033 start_bb = ENTRY_BLOCK_PTR;
3091 if (start_bb != ENTRY_BLOCK_PTR)
H A Dtree-cfg.c145 SET_BASIC_BLOCK (ENTRY_BLOCK, ENTRY_BLOCK_PTR);
147 ENTRY_BLOCK_PTR->next_bb = EXIT_BLOCK_PTR;
148 EXIT_BLOCK_PTR->prev_bb = ENTRY_BLOCK_PTR;
181 create_empty_bb (ENTRY_BLOCK_PTR);
337 basic_block bb = ENTRY_BLOCK_PTR;
464 make_edge (ENTRY_BLOCK_PTR, BASIC_BLOCK (NUM_FIXED_BLOCKS), EDGE_FALLTHRU);
2402 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
3033 && src != ENTRY_BLOCK_PTR)
3078 bsi_commit_one_edge_insert (single_succ_edge (ENTRY_BLOCK_PTR), NULL);
3685 if (ENTRY_BLOCK_PTR
[all...]

Completed in 495 milliseconds

123