Home
last modified time | relevance | path

Searched refs:getNumBlocks (Results 1 – 23 of 23) sorted by relevance

/openbsd/gnu/llvm/llvm/lib/Target/WebAssembly/
H A DWebAssemblySortRegion.h37 virtual unsigned getNumBlocks() const = 0;
52 unsigned getNumBlocks() const override { return Unit->getNumBlocks(); } in getNumBlocks() function
H A DWebAssemblyExceptionInfo.h84 unsigned getNumBlocks() const { return Blocks.size(); } in getNumBlocks() function
H A DWebAssemblyCFGSort.cpp179 : TheRegion(R), NumBlocksLeft(R->getNumBlocks()) {} in Entry()
/openbsd/gnu/llvm/llvm/include/llvm/Analysis/
H A DLoopIterator.h116 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 DLoopInfoImpl.h353 if (VisitedBBs.size() != getNumBlocks()) { in verifyLoop()
H A DLoopInfo.h202 unsigned getNumBlocks() const { in getNumBlocks() function
/openbsd/gnu/llvm/llvm/include/llvm/DebugInfo/MSF/
H A DMappedBlockStream.h73 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 DExpandMemCmp.cpp137 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 DMachinePipeliner.cpp336 if (L.getNumBlocks() != 1) { in canPipelineLoop()
341 << ore::NV("NumBlocks", L.getNumBlocks()); in canPipelineLoop()
H A DMachineBlockPlacement.cpp2274 if (L.getNumBlocks() == 1) { in findBestLoopExit()
/openbsd/gnu/llvm/llvm/lib/Target/Hexagon/
H A DHexagonVectorLoopCarriedReuse.cpp253 if (CurLoop->getNumBlocks() != 1) in run()
577 assert((CurLoop->getNumBlocks() == 1) && in doVLCR()
/openbsd/gnu/llvm/llvm/lib/Transforms/Scalar/
H A DLoopSimplifyCFG.cpp255 assert(L.getNumBlocks() == LiveLoopBlocks.size() + DeadLoopBlocks.size() && in analyze()
573 L.getNumBlocks()) { in run()
H A DLoopIdiomRecognize.cpp1553 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 DLoopRerollPass.cpp1656 << Header->getName() << " (" << L->getNumBlocks() in runOnLoop()
1660 if (L->getNumBlocks() > 1) in runOnLoop()
H A DSimpleLoopUnswitch.cpp1121 NewBlocks.reserve(L.getNumBlocks() + ExitBlocks.size()); in buildClonedLoopBlocks()
1304 ClonedL.reserveBlocks(OrigL.getNumBlocks()); in cloneLoopNest()
/openbsd/gnu/llvm/llvm/include/llvm/ADT/
H A DGenericCycleInfo.h182 size_t getNumBlocks() const { return Blocks.size(); } in getNumBlocks() function
/openbsd/gnu/llvm/llvm/lib/Transforms/Vectorize/
H A DLoopVectorizationLegality.cpp1160 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 DLoopInfo.cpp714 if (Unloop.getNumBlocks()) { in updateBlockParents()
739 assert(NIters < Unloop.getNumBlocks() && "runaway iterative algorithm"); in updateBlockParents()
/openbsd/gnu/llvm/llvm/lib/DebugInfo/MSF/
H A DMappedBlockStream.cpp174 while (Last < getNumBlocks() - 1) { in readLongestContiguousChunk()
/openbsd/gnu/llvm/llvm/lib/Target/ARM/
H A DARMTargetTransformInfo.cpp115 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 DARMLowOverheadLoops.cpp414 !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 DRISCVTargetTransformInfo.cpp1395 << "Blocks: " << L->getNumBlocks() << "\n" in getUnrollingPreferences()
1405 if (L->getNumBlocks() > 4) in getUnrollingPreferences()
/openbsd/gnu/llvm/llvm/lib/Target/AMDGPU/
H A DR600MachineCFGStructurizer.cpp995 if (ExaminedLoop->getNumBlocks() == 0 || Visited[ExaminedLoop]) in loopendPatternMatch()