| /src/external/gpl3/gcc/dist/gcc/ |
| tree-scalar-evolution.h | 55 edge preheader = loop_preheader_edge (loop); local
56 return (preheader ? preheader->src : ENTRY_BLOCK_PTR_FOR_FN (cfun));
|
| loop-doloop.cc | 534 basic_block preheader = loop_preheader_edge (loop)->src; local
541 redirect_edge_and_branch_force (single_succ_edge (preheader), new_preheader);
542 set_immediate_dominator (CDI_DOMINATORS, new_preheader, preheader);
546 te = single_succ_edge (preheader);
559 set_zero->count = preheader->count;
|
| loop-unroll.cc | 162 basic_block loop_preheader; /* The loop preheader basic block. */
884 basic_block preheader, *body, swtch, ezc_swtch = NULL; local
1008 preheader = split_edge (loop_preheader_edge (loop));
1010 preheader->count += iter_count;
1013 block_label (preheader), p, NULL);
1020 set_immediate_dominator (CDI_DOMINATORS, preheader, swtch);
1024 e = make_edge (swtch, preheader,
1034 preheader = split_edge (loop_preheader_edge (loop));
1039 preheader->count += iter_count;
1041 block_label (preheader), p
[all...] |
| tree-vect-loop-manip.cc | 278 /* Add SEQ to the end of LOOP's preheader block. */
467 when the loop needs to iterate. Add any new preheader statements to
1536 basic_block preheader = split_edge (loop_preheader_edge (scalar_loop));
1537 edge entry_e = single_pred_edge (preheader);
1538 bbs[0] = preheader;
1558 if (single_succ_edge (preheader)->dest_idx
1583 /* Skip new preheader since it's deleted if copy loop is added at entry. */
1649 where in the new preheader we need merge PHIs for
1851 redirect_edge_pred (single_succ_edge (preheader),
1852 single_pred (preheader));
[all...] |
| loop-invariant.cc | 1190 basic_block preheader = loop_preheader_edge (loop)->src; local
1192 /* Don't move insn of cold BB out of loop to preheader to reduce calculations
1194 if (!always_executed && preheader->count > bb->count)
1788 basic_block preheader = loop_preheader_edge (loop)->src; local
1840 if (JUMP_P (BB_END (preheader)))
1841 preheader = split_edge (loop_preheader_edge (loop));
1842 reorder_insns (inv->insn, inv->insn, BB_END (preheader));
1843 df_recompute_luids (preheader);
|
| tree-ssa-loop-im.cc | 463 /* Compare the profile count inequality of bb and loop's preheader, it is
2065 edge preheader, hash_set <basic_block> *flag_bbs,
2109 && preheader->count () >= count_sum && preheader->count ().nonzero_p ())
2111 flag_probability = count_sum.probability_in (preheader->count ());
2269 temporary variable is put to the preheader of the loop, and assignments
3466 /* Find the coldest loop preheader for LOOP, also find the nearest hotter loop
|
| tree-vect-loop.cc | 1166 computations in the LOOP_VINFO loop preheader. */
4297 because that tries to walk the PHI arg from the preheader edge which
5517 preheader edge. */
9139 scalar.preheader:
9143 i = PHI <0(scalar.preheader), i+1(scalar.body)>
9144 _2 = PHI <(init(scalar.preheader), <_1(scalar.body)>
9152 vector.preheader:
9156 i = PHI <0(vector.preheader), i+4(vector.body)>
9157 vect_1 = PHI <vect_init(vector.preheader), v2(vector.body)>
9278 tree preheader = PHI_ARG_DEF_FROM_EDGE (phi, pe) local
11958 basic_block preheader local
[all...] |
| tree-loop-distribution.cc | 961 edge preheader = loop_preheader_edge (loop); local
965 NULL, preheader, NULL, false);
|
| tree-parloops.cc | 479 because that tries to walk the PHI arg from the preheader edge which
1278 for reduction described in SLOT, and place it at the preheader of
1290 /* Create initialization in preheader:
1294 from the preheader with the reduction initialization value. */
2242 <bb preheader>:
2247 ivtmp_a = PHI <ivtmp_init (preheader), ivtmp_b (latch)>
2248 sum_a = PHI <sum_init (preheader), sum_b (latch)>
2271 <bb preheader>:
2286 ivtmp_c = PHI <ivtmp_init (preheader), ivtmp_b (latch)>
2287 sum_c = PHI <sum_init (preheader), sum_b (latch)
3103 basic_block preheader = loop_preheader_edge (loop)->src; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-scalar-evolution.h | 52 edge preheader = loop_preheader_edge (loop); local
53 return (preheader ? preheader->src : ENTRY_BLOCK_PTR_FOR_FN (cfun));
|
| loop-doloop.cc | 534 basic_block preheader = loop_preheader_edge (loop)->src; local
541 redirect_edge_and_branch_force (single_succ_edge (preheader), new_preheader);
542 set_immediate_dominator (CDI_DOMINATORS, new_preheader, preheader);
546 te = single_succ_edge (preheader);
559 set_zero->count = preheader->count;
|
| loop-unroll.cc | 162 basic_block loop_preheader; /* The loop preheader basic block. */
876 basic_block preheader, *body, swtch, ezc_swtch = NULL; local
1000 preheader = split_edge (loop_preheader_edge (loop));
1002 preheader->count += iter_count;
1005 block_label (preheader), p, NULL);
1012 set_immediate_dominator (CDI_DOMINATORS, preheader, swtch);
1016 e = make_edge (swtch, preheader,
1026 preheader = split_edge (loop_preheader_edge (loop));
1031 preheader->count += iter_count;
1033 block_label (preheader), p
[all...] |
| loop-invariant.cc | 1190 basic_block preheader = loop_preheader_edge (loop)->src; local
1192 /* Don't move insn of cold BB out of loop to preheader to reduce calculations
1194 if (!always_executed && preheader->count > bb->count)
1788 basic_block preheader = loop_preheader_edge (loop)->src; local
1840 if (JUMP_P (BB_END (preheader)))
1841 preheader = split_edge (loop_preheader_edge (loop));
1842 reorder_insns (inv->insn, inv->insn, BB_END (preheader));
1843 df_recompute_luids (preheader);
|
| tree-vect-loop-manip.cc | 272 /* Add SEQ to the end of LOOP's preheader block. */
389 when the loop needs to iterate. Add any new preheader statements to
1088 basic_block preheader = split_edge (loop_preheader_edge (scalar_loop)); local
1089 edge entry_e = single_pred_edge (preheader);
1090 bbs[0] = preheader;
1104 if (single_succ_edge (preheader)->dest_idx
1129 /* Skip new preheader since it's deleted if copy loop is added at entry. */
1173 redirect_edge_pred (single_succ_edge (preheader),
1174 single_pred (preheader));
1175 delete_basic_block (preheader);
[all...] |
| tree-ssa-loop-im.cc | 443 /* Compare the profile count inequality of bb and loop's preheader, it is
2017 edge preheader, hash_set <basic_block> *flag_bbs,
2060 && preheader->count () >= count_sum && preheader->count ().nonzero_p ())
2062 flag_probability = count_sum.probability_in (preheader->count ());
2218 temporary variable is put to the preheader of the loop, and assignments
3415 /* Find the coldest loop preheader for LOOP, also find the nearest hotter loop
|
| tree-loop-distribution.cc | 948 edge preheader = loop_preheader_edge (loop); local
951 res = slpeel_tree_duplicate_loop_to_edge_cfg (loop, NULL, preheader);
|
| tree-parloops.cc | 479 because that tries to walk the PHI arg from the preheader edge which
1275 for reduction described in SLOT, and place it at the preheader of
1287 /* Create initialization in preheader:
1291 from the preheader with the reduction initialization value. */
2234 <bb preheader>:
2239 ivtmp_a = PHI <ivtmp_init (preheader), ivtmp_b (latch)>
2240 sum_a = PHI <sum_init (preheader), sum_b (latch)>
2263 <bb preheader>:
2278 ivtmp_c = PHI <ivtmp_init (preheader), ivtmp_b (latch)>
2279 sum_c = PHI <sum_init (preheader), sum_b (latch)
3102 basic_block preheader = loop_preheader_edge (loop)->src; local
[all...] |
| tree-vect-loop.cc | 949 computations in the LOOP_VINFO loop preheader. */
3608 because that tries to walk the PHI arg from the preheader edge which
4717 preheader edge. */
9362 edge preheader = loop_preheader_edge (loop); local
9365 profile_count freq_h = loop->header->count, freq_e = preheader->count ();
9372 in loop's preheader. */
9771 2) Make sure we have a preheader basic block. */
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| HexagonCommonGEP.cpp | 856 static BasicBlock *preheader(DominatorTree *DT, Loop *L) { function
885 // placement. The traversal will also stop when a suitable "preheader"
886 // cannot be found for a given loop. The "preheader" may actually be
897 BasicBlock *NewLoc = preheader(DT, Lp);
|
