/openbsd/gnu/llvm/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblySortRegion.h | 37 virtual unsigned getNumBlocks() const = 0; 52 unsigned getNumBlocks() const override { return Unit->getNumBlocks(); } in getNumBlocks() function
|
H A D | WebAssemblyExceptionInfo.h | 84 unsigned getNumBlocks() const { return Blocks.size(); } in getNumBlocks() function
|
H A D | WebAssemblyCFGSort.cpp | 179 : TheRegion(R), NumBlocksLeft(R->getNumBlocks()) {} in Entry()
|
/openbsd/gnu/llvm/llvm/include/llvm/Analysis/ |
H A D | LoopIterator.h | 116 L(Container), PostNumbers(NextPowerOf2(Container->getNumBlocks())) { in LoopBlocksDFS() 117 PostBlocks.reserve(Container->getNumBlocks()); in LoopBlocksDFS() 126 bool isComplete() const { return PostBlocks.size() == L->getNumBlocks(); } in isComplete() 218 assert(DFS.L->getNumBlocks() && "po_iterator cannot handle an empty graph"); in begin()
|
H A D | LoopInfoImpl.h | 353 if (VisitedBBs.size() != getNumBlocks()) { in verifyLoop()
|
H A D | LoopInfo.h | 202 unsigned getNumBlocks() const { in getNumBlocks() function
|
/openbsd/gnu/llvm/llvm/include/llvm/DebugInfo/MSF/ |
H A D | MappedBlockStream.h | 73 uint32_t getNumBlocks() const { return StreamLayout.Blocks.size(); } in getNumBlocks() function 143 uint32_t getNumBlocks() const { return ReadInterface.getNumBlocks(); } in getNumBlocks() function
|
/openbsd/gnu/llvm/llvm/lib/CodeGen/ |
H A D | ExpandMemCmp.cpp | 137 unsigned getNumBlocks(); 260 unsigned MemCmpExpansion::getNumBlocks() { in getNumBlocks() function in __anondd4e65600111::MemCmpExpansion 268 for (unsigned i = 0; i < getNumBlocks(); i++) { in createLoadCmpBlocks() 575 for (unsigned I = 0; I < getNumBlocks(); ++I) { in getMemCmpExpansionZeroCase() 627 if (getNumBlocks() != 1) { in getMemCmpExpansion() 654 return getNumBlocks() == 1 ? getMemCmpEqZeroOneBlock() in getMemCmpExpansion() 657 if (getNumBlocks() == 1) in getMemCmpExpansion() 660 for (unsigned I = 0; I < getNumBlocks(); ++I) { in getMemCmpExpansion()
|
H A D | MachinePipeliner.cpp | 336 if (L.getNumBlocks() != 1) { in canPipelineLoop() 341 << ore::NV("NumBlocks", L.getNumBlocks()); in canPipelineLoop()
|
H A D | MachineBlockPlacement.cpp | 2274 if (L.getNumBlocks() == 1) { in findBestLoopExit()
|
/openbsd/gnu/llvm/llvm/lib/Target/Hexagon/ |
H A D | HexagonVectorLoopCarriedReuse.cpp | 253 if (CurLoop->getNumBlocks() != 1) in run() 577 assert((CurLoop->getNumBlocks() == 1) && in doVLCR()
|
/openbsd/gnu/llvm/llvm/lib/Transforms/Scalar/ |
H A D | LoopSimplifyCFG.cpp | 255 assert(L.getNumBlocks() == LiveLoopBlocks.size() + DeadLoopBlocks.size() && in analyze() 573 L.getNumBlocks()) { in run()
|
H A D | LoopIdiomRecognize.cpp | 1553 if (ApplyCodeSizeHeuristics && CurLoop->getNumBlocks() > 1) { in avoidLIRForMultiBlockLoop() 1851 if (CurLoop->getNumBackEdges() != 1 || CurLoop->getNumBlocks() != 1) in recognizeAndInsertFFS() 1954 if (CurLoop->getNumBackEdges() != 1 || CurLoop->getNumBlocks() != 1) in recognizePopcount() 2293 if (CurLoop->getNumBlocks() != 1 || CurLoop->getNumBackEdges() != 1) { in detectShiftUntilBitTestIdiom() 2632 if (CurLoop->getNumBlocks() != 1 || CurLoop->getNumBackEdges() != 1) { in detectShiftUntilZeroIdiom()
|
H A D | LoopRerollPass.cpp | 1656 << Header->getName() << " (" << L->getNumBlocks() in runOnLoop() 1660 if (L->getNumBlocks() > 1) in runOnLoop()
|
H A D | SimpleLoopUnswitch.cpp | 1121 NewBlocks.reserve(L.getNumBlocks() + ExitBlocks.size()); in buildClonedLoopBlocks() 1304 ClonedL.reserveBlocks(OrigL.getNumBlocks()); in cloneLoopNest()
|
/openbsd/gnu/llvm/llvm/include/llvm/ADT/ |
H A D | GenericCycleInfo.h | 182 size_t getNumBlocks() const { return Blocks.size(); } in getNumBlocks() function
|
/openbsd/gnu/llvm/llvm/lib/Transforms/Vectorize/ |
H A D | LoopVectorizationLegality.cpp | 1160 assert(TheLoop->getNumBlocks() > 1 && "Single block loops are vectorizable"); in canVectorizeWithIfConvert() 1329 unsigned NumBlocks = TheLoop->getNumBlocks(); in canVectorize()
|
/openbsd/gnu/llvm/llvm/lib/Analysis/ |
H A D | LoopInfo.cpp | 714 if (Unloop.getNumBlocks()) { in updateBlockParents() 739 assert(NIters < Unloop.getNumBlocks() && "runaway iterative algorithm"); in updateBlockParents()
|
/openbsd/gnu/llvm/llvm/lib/DebugInfo/MSF/ |
H A D | MappedBlockStream.cpp | 174 while (Last < getNumBlocks() - 1) { in readLongestContiguousChunk()
|
/openbsd/gnu/llvm/llvm/lib/Target/ARM/ |
H A D | ARMTargetTransformInfo.cpp | 115 L->getNumBlocks() == 1) in getPreferredAddressingMode() 2257 if (L->getNumBlocks() > 1) { in preferPredicateOverEpilogue() 2319 << "Blocks: " << L->getNumBlocks() << "\n" in getUnrollingPreferences() 2329 if (ST->hasBranchPredictor() && L->getNumBlocks() > 4) in getUnrollingPreferences()
|
H A D | ARMLowOverheadLoops.cpp | 414 !CannotTailPredicate && ML.getNumBlocks() == 1; in IsTailPredicationLegal() 1036 assert(ML.getNumBlocks() == 1 && "Expected single block loop!"); in ValidateLiveOuts()
|
/openbsd/gnu/llvm/llvm/lib/Target/RISCV/ |
H A D | RISCVTargetTransformInfo.cpp | 1395 << "Blocks: " << L->getNumBlocks() << "\n" in getUnrollingPreferences() 1405 if (L->getNumBlocks() > 4) in getUnrollingPreferences()
|
/openbsd/gnu/llvm/llvm/lib/Target/AMDGPU/ |
H A D | R600MachineCFGStructurizer.cpp | 995 if (ExaminedLoop->getNumBlocks() == 0 || Visited[ExaminedLoop]) in loopendPatternMatch()
|