HomeSort by relevance Sort by last modified time
    Searched refs:LCSSA (Results 1 - 13 of 13) sorted by null

  /external/llvm/lib/Transforms/Utils/
LCSSA.cpp 1 //===-- LCSSA.cpp - Convert loops into loop-closed SSA form ---------------===//
48 #define DEBUG_TYPE "lcssa"
62 /// outside the current loop. If so, insert LCSSA PHI nodes and rewrite the
110 // Insert the LCSSA phi's into all of the exit blocks dominated by the
121 Inst.getName() + ".lcssa", &ExitBB->front());
129 // rewritten in terms of a different LCSSA PHI.
145 // This could break LCSSA form for L2 because these inserted PHIs can also
278 struct LCSSA : public FunctionPass {
280 LCSSA() : FunctionPass(ID) {
308 char LCSSA::ID = 0
    [all...]
Android.mk 20 LCSSA.cpp \
  /external/llvm/lib/Transforms/Scalar/
LoopInstSimplify.cpp 64 INITIALIZE_PASS_DEPENDENCY(LCSSA)
LoopDeletion.cpp 71 INITIALIZE_PASS_DEPENDENCY(LCSSA)
80 /// checked for unique exit and exiting blocks, and that the code is in LCSSA
89 // Because the code is in LCSSA form, any values used outside of the loop
133 /// NOTE: This entire process relies pretty heavily on LoopSimplify and LCSSA
LoopRotation.cpp 351 Exit->removePredecessor(OrigPreheader, true /*preserve LCSSA*/);
574 // LCSSA form makes instruction renaming easier.
616 INITIALIZE_PASS_DEPENDENCY(LCSSA)
LICM.cpp 172 INITIALIZE_PASS_DEPENDENCY(LCSSA)
200 assert(L->isLCSSAForm(*DT) && "Loop is not in LCSSA form.");
271 // reform LCSSA as any nested loop may now have values defined within the
274 // SSAUpdater strategy during promotion that was LCSSA aware and reformed
282 // Check that neither this loop nor its parent have had LCSSA broken. LICM is
285 assert(L->isLCSSAForm(*DT) && "Loop not left in LCSSA form after LICM!");
287 "Parent loop not left in LCSSA form after LICM!");
523 /// This pattern occurs most often with LCSSA PHI nodes.
544 // special case because it is the pattern found in LCSSA form.
576 // Build LCSSA PHI nodes for any in-loop operands. Note that this i
    [all...]
LoopIdiomRecognize.cpp 154 INITIALIZE_PASS_DEPENDENCY(LCSSA)
    [all...]
LoopUnrollPass.cpp 151 // FIXME: Loop unroll requires LCSSA. And LCSSA requires dom info.
152 // If loop unroll does not preserve dom info then LCSSA pass on next
245 INITIALIZE_PASS_DEPENDENCY(LCSSA)
554 "Must have loops in LCSSA form to track live-out values.");
    [all...]
InductiveRangeCheckElimination.cpp 231 INITIALIZE_PASS_DEPENDENCY(LCSSA)
    [all...]
LoopInterchange.cpp 533 // Since we currently do not handle LCSSA PHI's any failure in loop
535 // TODO: This should be removed once we handle LCSSA PHI nodes.
724 // Reduction lcssa phi will have only 1 incoming block that from loop latch.
730 // Incoming value for lcssa phi's in outer loop exit can only be inner loop
731 // exits lcssa phi else it would not be tightly nested.
796 // TODO: We only handle LCSSA PHI's corresponding to reduction for now.
    [all...]
LoopUnswitch.cpp 389 INITIALIZE_PASS_DEPENDENCY(LCSSA)
822 // unreachable. LCSSA form might also not be preserved after deleting
    [all...]
IndVarSimplify.cpp 154 INITIALIZE_PASS_DEPENDENCY(LCSSA)
176 // because it understands lcssa phis while SCEV does not.
544 assert(L->isRecursivelyLCSSAForm(*DT) && "Indvars did not preserve LCSSA!");
551 // Because of LCSSA, these values will only occur in LCSSA PHI Nodes. Scan
564 // have to be certain this is safe even when this is an LCSSA PHI node.
568 // require an LCSSA PHI node. The safe case is when this is
569 // single-predecessor PHI node (LCSSA) and the exit block containing it is
573 // an enclosing loop it will only be via a separate LCSSA node.
639 // Do not count the Phi as a use. LCSSA may have inserte
    [all...]
  /external/llvm/lib/Transforms/Vectorize/
LoopVectorize.cpp     [all...]

Completed in 259 milliseconds