HomeSort by: relevance | last modified time | path
    Searched refs:InsertPts (Results 1 - 4 of 4) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/
AArch64PromoteConstant.cpp 161 /// \param InsertPts existing insertion points
162 /// \pre NewPt and all instruction in InsertPts belong to the same function
163 /// \return true if one of the insertion point in InsertPts dominates NewPt,
166 InsertionPoints &InsertPts);
175 /// \param InsertPts existing insertion points
176 /// \pre NewPt and all instruction in InsertPts belong to the same function
178 /// \return true if it exists an insertion point in InsertPts that could
182 InsertionPoints &InsertPts);
190 /// \param[out] InsertPts output storage of the analysis
192 InsertionPoints &InsertPts);
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
ConstantHoisting.cpp 277 auto &InsertPts = InsertPtsMap[Node].first;
284 (InsertPtsFreq == BFI.getBlockFreq(Node) && InsertPts.size() > 1))
287 BBs.insert(InsertPts.begin(), InsertPts.end());
299 // If the total frequency of InsertPts is the same as the frequency of the
300 // target Node, and InsertPts contains more than one nodes, choose hoisting
305 (InsertPtsFreq == BFI.getBlockFreq(Node) && InsertPts.size() > 1)))) {
309 ParentInsertPts.insert(InsertPts.begin(), InsertPts.end());
321 SetVector<Instruction *> InsertPts;
    [all...]
LICM.cpp 438 SmallVector<Instruction *, 8> InsertPts;
440 InsertPts.reserve(ExitBlocks.size());
444 InsertPts.push_back(&*ExitBlock->getFirstInsertionPt());
471 PointerMustAliases, ExitBlocks, InsertPts, MSSAInsertPts, PIC, LI,
484 PointerMustAliases, ExitBlocks, InsertPts, MSSAInsertPts, PIC,
1991 SmallVectorImpl<Instruction *> &InsertPts,
2227 InsertPts, MSSAInsertPts, PIC, CurAST, MSSAU, *LI, DL,
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/
InstrProfiling.cpp 183 ArrayRef<Instruction *> InsertPts,
187 InsertPts(InsertPts), LoopToCandidates(LoopToCands), LI(LI) {
196 Instruction *InsertPos = InsertPts[i];
228 ArrayRef<Instruction *> InsertPts;
241 : LoopToCandidates(LoopToCands), ExitBlocks(), InsertPts(), L(CurLoop),
244 // Skip collection of ExitBlocks and InsertPts for loops that will not be
256 InsertPts.push_back(&*ExitBlock->getFirstInsertionPt());
304 InsertPts, LoopToCandidates, LI);
394 SmallVector<Instruction *, 8> InsertPts;
    [all...]

Completed in 22 milliseconds