HomeSort by: relevance | last modified time | path
    Searched defs:hoist (Results 1 - 2 of 2) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
GVNHoist.cpp 1 //===- GVNHoist.cpp - Hoist scalar and load expressions -------------------===//
22 // hoist instructions to a basic block with more than two successors, as well as
25 // Limitations: This pass does not hoist fully redundant expressions because
26 // they are already handled by GVN-PRE. It is advisable to run gvn-hoist before
85 #define DEBUG_TYPE "gvn-hoist"
98 cl::desc("Max number of instructions to hoist "
102 "gvn-hoist-max-bbs", cl::Hidden, cl::init(4),
107 "gvn-hoist-max-depth", cl::Hidden, cl::init(100),
108 cl::desc("Hoist instructions from the beginning of the BB up to the "
112 MaxChainLength("gvn-hoist-max-chain-length", cl::Hidden, cl::init(10)
1097 std::pair<unsigned, unsigned> GVNHoist::hoist(HoistingPointList &HPL) { function in class:llvm::GVNHoist
    [all...]
LICM.cpp 26 // we can hoist it or sink it like any other instruction.
155 static void hoist(Instruction &I, const DominatorTree *DT, const Loop *CurLoop,
344 /// Hoist expressions out of the specified loop. Note, alias info for inner
408 // instructions, we perform another pass to hoist them out of the loop.
594 // This is a helper class for hoistRegion to make it able to hoist control flow
595 // in order to be able to hoist phis. The way this works is that we initially
597 // we make note of this. When we then come to hoist an instruction that's
599 // flow, then hoist the instruction into the block corresponding to its original
613 // The branches that we can hoist, mapped to the block that marks a
623 // We can only hoist conditional branches with loop invariant operands
1770 static void hoist(Instruction &I, const DominatorTree *DT, const Loop *CurLoop, function
    [all...]

Completed in 28 milliseconds