/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | LoopVectorize.cpp | 1 //===- LoopVectorize.cpp - A Loop Vectorizer ------------------------------===// 292 cl::desc("Enable loop interleaving in Loop vectorization passes")); 295 cl::desc("Run the Loop vectorization passes")); 365 static Optional<unsigned> getSmallBestKnownTC(ScalarEvolution &SE, Loop *L) { 400 InnerLoopVectorizer(Loop *OrigLoop, PredicatedScalarEvolution &PSE, 525 PHINode *createInductionVariable(Loop *L, Value *Start, Value *End, 542 /// The Loop exit block may have single value PHI nodes with some 621 Value *getOrCreateTripCount(Loop *NewLoop); 624 Value *getOrCreateVectorTripCount(Loop *NewLoop); 633 void emitMinimumIterationCountCheck(Loop * [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonInstrInfo.cpp | 176 if (MachineInstr *Loop = findLoopInstr(PB, EndLoopOp, TargetBB, Visited)) 177 return Loop; 619 MachineInstr *Loop = findLoopInstr(TBB, EndLoopOp, Cond[1].getMBB(), local 621 assert(Loop != nullptr && "Inserting an ENDLOOP without a LOOP"); 622 Loop->getOperand(0).setMBB(TBB); 661 MachineInstr *Loop = findLoopInstr(TBB, EndLoopOp, Cond[1].getMBB(), local 663 assert(Loop != nullptr && "Inserting an ENDLOOP without a LOOP"); 664 Loop->getOperand(0).setMBB(TBB); 679 MachineInstr *Loop, *EndLoop; member in class:__anon5174::HexagonPipelinerLoopInfo 687 HexagonPipelinerLoopInfo(MachineInstr *Loop, MachineInst argument [all...] |
H A D | HexagonVectorLoopCarriedReuse.cpp | 17 // Loop: 26 // cond_branch <Loop> 32 // Loop: 39 // cond_branch <Loop> 46 // Loop: 47 // X2 = PHI<(X0, LoopPreheader), (X1, Loop)> 55 // cond_branch <Loop> 58 // from the Loop Preheader and over the backedge and additionaly, both these 76 // Loop: 77 // X2 = PHI<(X0, LoopPreheader), (X1, Loop)> [all...] |
H A D | HexagonCommonGEP.cpp | 133 bool isInvariantIn(Value *Val, Loop *L); 134 bool isInvariantIn(GepNode *Node, Loop *L); 135 bool isInMainPath(BasicBlock *B, Loop *L); 838 bool HexagonCommonGEP::isInvariantIn(Value *Val, Loop *L) { 848 bool HexagonCommonGEP::isInvariantIn(GepNode *Node, Loop *L) { 855 bool HexagonCommonGEP::isInMainPath(BasicBlock *B, Loop *L) { 866 static BasicBlock *preheader(DominatorTree *DT, Loop *L) { 903 Loop *Lp = LI->getLoopFor(LocB);
|
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | TargetTransformInfoImpl.h | 209 bool isHardwareLoopProfitable(Loop *L, ScalarEvolution &SE, 216 bool preferPredicateOverEpilogue(Loop *L, LoopInfo *LI, ScalarEvolution &SE, 223 void getUnrollingPreferences(Loop *, ScalarEvolution &, 247 bool canSaveCmp(Loop *L, BranchInst **BI, ScalarEvolution *SE, LoopInfo *LI, 255 bool shouldFavorBackedgeIndex(const Loop *L) const { return false; }
|
H A D | DDG.h | 315 DataDependenceGraph(Loop &L, LoopInfo &LI, DependenceInfo &DI); 408 Result run(Loop &L, LoopAnalysisManager &AM, LoopStandardAnalysisResults &AR); 419 PreservedAnalyses run(Loop &L, LoopAnalysisManager &AM,
|
H A D | ValueTracking.h | 38 class Loop; 538 const Loop *L);
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | SeparateConstOffsetFromGEP.cpp | 9 // Loop unrolling may create many similar GEPs for array accesses. 148 // LICM (Loop Invariant Code Motion) can not hoist/sink a GEP of multiple 439 bool hasMoreThanOneUseInLoop(Value *v, Loop *L); 446 Loop *CurLoop); 822 Loop *L = LI->getLoopFor(Variadic->getParent()); 1226 GetElementPtrInst *FirstGEP, GetElementPtrInst *SecondGEP, Loop *CurLoop) { 1281 bool SeparateConstOffsetFromGEP::hasMoreThanOneUseInLoop(Value *V, Loop *L) {
|
H A D | GuardWidening.cpp | 407 Loop *DominatedInstrLoop = LI.getLoopFor(DominatedInstr->getParent()); 408 Loop *DominatingGuardLoop = LI.getLoopFor(DominatingGuard->getParent()); 782 PreservedAnalyses GuardWideningPass::run(Loop &L, LoopAnalysisManager &AM, 833 bool runOnLoop(Loop *L, LPPassManager &LPM) override {
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
H A D | PPCTargetTransformInfo.cpp | 243 // Loop through the inline asm constraints and look for something that 479 bool PPCTTIImpl::isHardwareLoopProfitable(Loop *L, ScalarEvolution &SE, 503 for (Loop::block_iterator I = L->block_begin(), IE = L->block_end(); 557 void PPCTTIImpl::getUnrollingPreferences(Loop *L, ScalarEvolution &SE, 968 bool PPCTTIImpl::canSaveCmp(Loop *L, BranchInst **BI, ScalarEvolution *SE, 972 for (Loop::iterator I = L->begin(), E = L->end(); I != E; ++I)
|
/freebsd-12-stable/crypto/openssl/crypto/sha/asm/ |
H A D | keccak1600-x86_64.pl | 93 jmp .Loop 96 .Loop: 342 jnz .Loop
|
H A D | sha1-mips.pl | 383 b .Loop 386 .Loop: 431 bne $inp,$num,.Loop
|
H A D | sha512-mips.pl | 366 b .Loop 369 .Loop: 420 bne $inp,@X[15],.Loop
|
H A D | sha512p8-ppc.pl | 218 b Loop 220 Loop: label 264 bne Loop
|
/freebsd-12-stable/crypto/openssl/crypto/ |
H A D | x86_64cpuid.pl | 389 jmp .Loop 391 .Loop: rdtsc 401 jnz .Loop
|
H A D | ppccpuid.pl | 224 Loop: mftb $tick label 233 bdnz Loop
|
H A D | s390xcpuid.pl | 204 .Loop: stg %r0,0(%r2) 206 brctg %r4,.Loop
|
H A D | ia64cpuid.S | 235 .Loop: 248 (p6) br.cond.dptk .Loop };;
|
/freebsd-12-stable/secure/lib/libcrypto/amd64/ |
H A D | keccak1600-x86_64.S | 14 jmp .Loop 17 .Loop: 257 jnz .Loop
|
H A D | x86_64cpuid.S | 319 jmp .Loop 321 .Loop: rdtsc 331 jnz .Loop
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/ |
H A D | AsmPrinter.cpp | 2898 static void PrintParentLoopComment(raw_ostream &OS, const MachineLoop *Loop, argument 2900 if (!Loop) return; 2901 PrintParentLoopComment(OS, Loop->getParentLoop(), FunctionNumber); 2902 OS.indent(Loop->getLoopDepth()*2) 2903 << "Parent Loop BB" << FunctionNumber << "_" 2904 << Loop->getHeader()->getNumber() 2905 << " Depth=" << Loop->getLoopDepth() << '\n'; 2910 static void PrintChildLoopComment(raw_ostream &OS, const MachineLoop *Loop, argument 2913 for (const MachineLoop *CL : *Loop) { 2915 << "Child Loop B 2927 const MachineLoop *Loop = LI->getLoopFor(&MBB); local [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/SystemZ/ |
H A D | SystemZSelectionDAGInfo.cpp | 23 // (such as MVC) and Loop is the opcode to use for loops (such as MVC_LOOP). 26 unsigned Loop, SDValue Chain, SDValue Dst, 41 return DAG.getNode(Loop, DL, MVT::Other, Chain, Dst, Src, 25 emitMemMem(SelectionDAG &DAG, const SDLoc &DL, unsigned Sequence, unsigned Loop, SDValue Chain, SDValue Dst, SDValue Src, uint64_t Size) argument
|
/freebsd-12-stable/crypto/openssl/crypto/poly1305/asm/ |
H A D | poly1305-mips.pl | 213 .Loop: 326 bnez $len,.Loop
|
/freebsd-12-stable/contrib/llvm-project/llvm/tools/opt/ |
H A D | PassPrinters.cpp | 146 bool runOnLoop(Loop *L, LPPassManager &LPM) override {
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/AsmParser/ |
H A D | WebAssemblyAsmParser.cpp | 188 Loop, enumerator in enum:__anon5376::final::NestingType 236 case Loop: 465 push(Loop); variable 488 if (pop(Name, Loop))
|