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

  /external/llvm/lib/Transforms/Utils/
LoopUnroll.cpp 297 std::vector<BasicBlock*> Latches;
299 Latches.push_back(LatchBlock);
382 // Keep track of new headers and latches as we create them, so that
387 Latches.push_back(New);
414 assert(Latches.back() == LastValueMap[LatchBlock] && "bad last latch");
415 PN->addIncoming(InVal, Latches.back());
421 for (unsigned i = 0, e = Latches.size(); i != e; ++i) {
423 BranchInst *Term = cast<BranchInst>(Latches[i]->getTerminator());
455 BasicBlock *BB = Latches[i];
474 for (unsigned i = 0, e = Latches.size(); i != e; ++i)
    [all...]
  /external/llvm/lib/Target/AMDGPU/
SIAnnotateControlFlow.cpp 307 SmallVector <BasicBlock*, 8> Latches;
308 L->getLoopLatches(Latches);
312 if (std::find(Latches.begin(), Latches.end(), *PI) == Latches.end())
  /external/llvm/lib/Transforms/Scalar/
LoopLoadElimination.cpp 101 /// \brief Check if the store dominates all latches, so as long as there is no
105 SmallVector<BasicBlock *, 8> Latches;
106 L->getLoopLatches(Latches);
107 return std::all_of(Latches.begin(), Latches.end(),

Completed in 875 milliseconds