| /dports/security/clamav-lts/clamav-0.103.5/libclamav/c++/llvm/include/llvm/Analysis/ |
| H A D | ScalarEvolutionExpressions.h | 45 virtual bool isLoopInvariant(const Loop *L) const { in isLoopInvariant() function
91 virtual bool isLoopInvariant(const Loop *L) const { in isLoopInvariant() function
92 return Op->isLoopInvariant(L); in isLoopInvariant()
205 virtual bool isLoopInvariant(const Loop *L) const;
331 virtual bool isLoopInvariant(const Loop *L) const { in isLoopInvariant() function
332 return LHS->isLoopInvariant(L) && RHS->isLoopInvariant(L); in isLoopInvariant()
378 assert(Operands[i]->isLoopInvariant(l) && in SCEVAddRecExpr()
400 virtual bool isLoopInvariant(const Loop *QueryLoop) const;
537 virtual bool isLoopInvariant(const Loop *L) const;
|
| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/lib/Analysis/ |
| H A D | LoopCacheAnalysis.cpp | 91 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isOneDimensionalArray()
269 if (isLoopInvariant(L)) { in computeRefCost()
386 bool IndexedReference::isLoopInvariant(const Loop &L) const { in isLoopInvariant() function in IndexedReference
391 if (SE.isLoopInvariant(SE.getSCEV(Addr), &L)) in isLoopInvariant()
436 : SE.isLoopInvariant(&Subscript, &L); in isCoeffForLoopZeroOrInvariant()
453 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isSimpleAddRecurrence()
|
| /dports/devel/llvm10/llvm-10.0.1.src/lib/Analysis/ |
| H A D | LoopCacheAnalysis.cpp | 90 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isOneDimensionalArray()
264 if (isLoopInvariant(L)) { in computeRefCost()
365 bool IndexedReference::isLoopInvariant(const Loop &L) const { in isLoopInvariant() function in IndexedReference
370 if (SE.isLoopInvariant(SE.getSCEV(Addr), &L)) in isLoopInvariant()
414 : SE.isLoopInvariant(&Subscript, &L); in isCoeffForLoopZeroOrInvariant()
431 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isSimpleAddRecurrence()
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/lib/Analysis/ |
| H A D | LoopCacheAnalysis.cpp | 95 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isOneDimensionalArray()
271 if (isLoopInvariant(L)) { in computeRefCost()
388 bool IndexedReference::isLoopInvariant(const Loop &L) const { in isLoopInvariant() function in IndexedReference
393 if (SE.isLoopInvariant(SE.getSCEV(Addr), &L)) in isLoopInvariant()
438 : SE.isLoopInvariant(&Subscript, &L); in isCoeffForLoopZeroOrInvariant()
455 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isSimpleAddRecurrence()
|
| /dports/graphics/llvm-mesa/llvm-13.0.1.src/lib/Analysis/ |
| H A D | LoopCacheAnalysis.cpp | 95 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isOneDimensionalArray()
271 if (isLoopInvariant(L)) { in computeRefCost()
388 bool IndexedReference::isLoopInvariant(const Loop &L) const { in isLoopInvariant() function in IndexedReference
393 if (SE.isLoopInvariant(SE.getSCEV(Addr), &L)) in isLoopInvariant()
438 : SE.isLoopInvariant(&Subscript, &L); in isCoeffForLoopZeroOrInvariant()
455 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isSimpleAddRecurrence()
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/llvm/lib/Analysis/ |
| H A D | LoopCacheAnalysis.cpp | 95 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isOneDimensionalArray()
273 if (isLoopInvariant(L)) { in computeRefCost()
390 bool IndexedReference::isLoopInvariant(const Loop &L) const { in isLoopInvariant() function in IndexedReference
395 if (SE.isLoopInvariant(SE.getSCEV(Addr), &L)) in isLoopInvariant()
440 : SE.isLoopInvariant(&Subscript, &L); in isCoeffForLoopZeroOrInvariant()
457 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isSimpleAddRecurrence()
|
| /dports/devel/llvm11/llvm-11.0.1.src/lib/Analysis/ |
| H A D | LoopCacheAnalysis.cpp | 91 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isOneDimensionalArray()
269 if (isLoopInvariant(L)) { in computeRefCost()
386 bool IndexedReference::isLoopInvariant(const Loop &L) const { in isLoopInvariant() function in IndexedReference
391 if (SE.isLoopInvariant(SE.getSCEV(Addr), &L)) in isLoopInvariant()
436 : SE.isLoopInvariant(&Subscript, &L); in isCoeffForLoopZeroOrInvariant()
453 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isSimpleAddRecurrence()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| H A D | LoopCacheAnalysis.cpp | 90 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isOneDimensionalArray()
264 if (isLoopInvariant(L)) { in computeRefCost()
365 bool IndexedReference::isLoopInvariant(const Loop &L) const { in isLoopInvariant() function in IndexedReference
370 if (SE.isLoopInvariant(SE.getSCEV(Addr), &L)) in isLoopInvariant()
414 : SE.isLoopInvariant(&Subscript, &L); in isCoeffForLoopZeroOrInvariant()
431 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isSimpleAddRecurrence()
|
| /dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/lib/Analysis/ |
| H A D | LoopCacheAnalysis.cpp | 95 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isOneDimensionalArray()
271 if (isLoopInvariant(L)) { in computeRefCost()
388 bool IndexedReference::isLoopInvariant(const Loop &L) const { in isLoopInvariant() function in IndexedReference
393 if (SE.isLoopInvariant(SE.getSCEV(Addr), &L)) in isLoopInvariant()
438 : SE.isLoopInvariant(&Subscript, &L); in isCoeffForLoopZeroOrInvariant()
455 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isSimpleAddRecurrence()
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/lib/Analysis/ |
| H A D | LoopCacheAnalysis.cpp | 96 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isOneDimensionalArray()
272 if (isLoopInvariant(L)) { in computeRefCost()
389 bool IndexedReference::isLoopInvariant(const Loop &L) const { in isLoopInvariant() function in IndexedReference
394 if (SE.isLoopInvariant(SE.getSCEV(Addr), &L)) in isLoopInvariant()
439 : SE.isLoopInvariant(&Subscript, &L); in isCoeffForLoopZeroOrInvariant()
456 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isSimpleAddRecurrence()
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/lib/Analysis/ |
| H A D | LoopCacheAnalysis.cpp | 95 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isOneDimensionalArray()
271 if (isLoopInvariant(L)) { in computeRefCost()
388 bool IndexedReference::isLoopInvariant(const Loop &L) const { in isLoopInvariant() function in IndexedReference
393 if (SE.isLoopInvariant(SE.getSCEV(Addr), &L)) in isLoopInvariant()
438 : SE.isLoopInvariant(&Subscript, &L); in isCoeffForLoopZeroOrInvariant()
455 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isSimpleAddRecurrence()
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/lib/Analysis/ |
| H A D | LoopCacheAnalysis.cpp | 95 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isOneDimensionalArray()
273 if (isLoopInvariant(L)) { in computeRefCost()
390 bool IndexedReference::isLoopInvariant(const Loop &L) const { in isLoopInvariant() function in IndexedReference
395 if (SE.isLoopInvariant(SE.getSCEV(Addr), &L)) in isLoopInvariant()
440 : SE.isLoopInvariant(&Subscript, &L); in isCoeffForLoopZeroOrInvariant()
457 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isSimpleAddRecurrence()
|
| /dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/lib/Analysis/ |
| H A D | LoopCacheAnalysis.cpp | 90 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isOneDimensionalArray()
264 if (isLoopInvariant(L)) { in computeRefCost()
365 bool IndexedReference::isLoopInvariant(const Loop &L) const { in isLoopInvariant() function in IndexedReference
370 if (SE.isLoopInvariant(SE.getSCEV(Addr), &L)) in isLoopInvariant()
414 : SE.isLoopInvariant(&Subscript, &L); in isCoeffForLoopZeroOrInvariant()
431 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isSimpleAddRecurrence()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/lib/Analysis/ |
| H A D | LoopCacheAnalysis.cpp | 95 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isOneDimensionalArray()
273 if (isLoopInvariant(L)) { in computeRefCost()
390 bool IndexedReference::isLoopInvariant(const Loop &L) const { in isLoopInvariant() function in IndexedReference
395 if (SE.isLoopInvariant(SE.getSCEV(Addr), &L)) in isLoopInvariant()
440 : SE.isLoopInvariant(&Subscript, &L); in isCoeffForLoopZeroOrInvariant()
457 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isSimpleAddRecurrence()
|
| /dports/devel/llvm13/llvm-project-13.0.1.src/llvm/lib/Analysis/ |
| H A D | LoopCacheAnalysis.cpp | 95 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isOneDimensionalArray()
271 if (isLoopInvariant(L)) { in computeRefCost()
388 bool IndexedReference::isLoopInvariant(const Loop &L) const { in isLoopInvariant() function in IndexedReference
393 if (SE.isLoopInvariant(SE.getSCEV(Addr), &L)) in isLoopInvariant()
438 : SE.isLoopInvariant(&Subscript, &L); in isCoeffForLoopZeroOrInvariant()
455 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isSimpleAddRecurrence()
|
| /dports/security/clamav-lts/clamav-0.103.5/libclamav/c++/llvm/lib/Analysis/ |
| H A D | LoopDependenceAnalysis.cpp | 131 if (!S->isLoopInvariant(L)) in getLoops()
135 bool LoopDependenceAnalysis::isLoopInvariant(const SCEV *S) const { in isLoopInvariant() function in LoopDependenceAnalysis
143 return isLoopInvariant(S) || (rec && rec->isAffine()); in isAffine()
147 return isLoopInvariant(A) && isLoopInvariant(B); in isZIVPair()
|
| H A D | LoopInfo.cpp | 49 bool Loop::isLoopInvariant(Value *V) const { in isLoopInvariant() function in Loop
51 return isLoopInvariant(I); in isLoopInvariant()
58 bool Loop::isLoopInvariant(Instruction *I) const { in isLoopInvariant() function in Loop
90 if (isLoopInvariant(I)) in makeLoopInvariant()
|
| /dports/security/clamav-lts/clamav-0.103.5/libclamav/c++/llvm/lib/Transforms/Scalar/ |
| H A D | LoopIndexSplit.cpp | 259 if (!L->isLoopInvariant(IVExitValue)) in runOnLoop()
261 if (!L->isLoopInvariant(IVExitValue)) in runOnLoop()
361 if (!L->isLoopInvariant(SplitValue)) in processOneIterationLoop()
363 if (!L->isLoopInvariant(SplitValue)) in processOneIterationLoop()
946 if (!L->isLoopInvariant(SplitValue)) in splitLoop()
1206 && L->isLoopInvariant(Op.getOperand(1))) in IVisLT()
1211 && L->isLoopInvariant(Op.getOperand(0))) in IVisLT()
1224 && L->isLoopInvariant(Op.getOperand(1))) in IVisLE()
1229 && L->isLoopInvariant(Op.getOperand(0))) in IVisLE()
1242 && L->isLoopInvariant(Op.getOperand(1))) in IVisGT()
[all …]
|
| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/lib/Transforms/Scalar/ |
| H A D | LoopPredication.cpp | 387 if (SE->isLoopInvariant(LHSS, L)) { in parseLoopICmp()
407 if (SE->isLoopInvariant(LHS, L) && SE->isLoopInvariant(RHS, L)) { in expandCheck()
508 if (!L->isLoopInvariant(Op)) in findInsertPt()
519 if (!SE->isLoopInvariant(Op, L) || in findInsertPt()
545 if (SE->isLoopInvariant(S, L)) in isLoopInvariantValue()
1104 !SE->isLoopInvariant(MinEC, L) || in predicateLoopExits()
|
| /dports/devel/llvm11/llvm-11.0.1.src/lib/Transforms/Scalar/ |
| H A D | LoopPredication.cpp | 387 if (SE->isLoopInvariant(LHSS, L)) { in parseLoopICmp()
407 if (SE->isLoopInvariant(LHS, L) && SE->isLoopInvariant(RHS, L)) { in expandCheck()
508 if (!L->isLoopInvariant(Op)) in findInsertPt()
519 if (!SE->isLoopInvariant(Op, L) || in findInsertPt()
545 if (SE->isLoopInvariant(S, L)) in isLoopInvariantValue()
1104 !SE->isLoopInvariant(MinEC, L) || in predicateLoopExits()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/lib/Transforms/Scalar/ |
| H A D | LoopPredication.cpp | 387 if (SE->isLoopInvariant(LHSS, L)) { in parseLoopICmp()
407 if (SE->isLoopInvariant(LHS, L) && SE->isLoopInvariant(RHS, L)) { in expandCheck()
509 if (!L->isLoopInvariant(Op)) in findInsertPt()
520 if (!SE->isLoopInvariant(Op, L) || in findInsertPt()
546 if (SE->isLoopInvariant(S, L)) in isLoopInvariantValue()
1105 !SE->isLoopInvariant(MinEC, L) || in predicateLoopExits()
|
| /dports/devel/llvm90/llvm-9.0.1.src/lib/Transforms/Scalar/ |
| H A D | LoopPredication.cpp | 376 if (SE->isLoopInvariant(LHSS, L)) { in parseLoopICmp()
396 if (SE->isLoopInvariant(LHS, L) && SE->isLoopInvariant(RHS, L)) { in expandCheck()
497 if (!L->isLoopInvariant(Op)) in findInsertPt()
508 if (!SE->isLoopInvariant(Op, L) || in findInsertPt()
534 if (SE->isLoopInvariant(S, L)) in isLoopInvariantValue()
|
| /dports/devel/intel-graphics-compiler/intel-graphics-compiler-igc-1.0.9636/IGC/Compiler/CISACodeGen/ |
| H A D | GenIRLowering.cpp | 534 if (loop->isLoopInvariant(LHS)) in rearrangeAdd()
537 if (!loop->isLoopInvariant(newRHS)) in rearrangeAdd()
560 if (loop->isLoopInvariant(RHSofLHS)) in rearrangeAdd()
729 … if (loop != nullptr && loop->isLoopInvariant(PtrOp) && binaryOp->getOpcode() == Instruction::Add) in lowerGetElementPtrInst()
734 bool isLHSLI = loop->isLoopInvariant(LHS); in lowerGetElementPtrInst()
735 bool isRHSLI = loop->isLoopInvariant(RHS); in lowerGetElementPtrInst()
780 if (loop && loop->isLoopInvariant(PtrOp)) in lowerGetElementPtrInst()
|
| /dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LoopPredication.cpp | 386 if (SE->isLoopInvariant(LHSS, L)) { in parseLoopICmp()
406 if (SE->isLoopInvariant(LHS, L) && SE->isLoopInvariant(RHS, L)) { in expandCheck()
507 if (!L->isLoopInvariant(Op)) in findInsertPt()
518 if (!SE->isLoopInvariant(Op, L) || in findInsertPt()
544 if (SE->isLoopInvariant(S, L)) in isLoopInvariantValue()
1114 !SE->isLoopInvariant(MinEC, L) || in predicateLoopExits()
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/lib/Transforms/Scalar/ |
| H A D | LoopPredication.cpp | 387 if (SE->isLoopInvariant(LHSS, L)) { in parseLoopICmp()
407 if (SE->isLoopInvariant(LHS, L) && SE->isLoopInvariant(RHS, L)) { in expandCheck()
509 if (!L->isLoopInvariant(Op)) in findInsertPt()
520 if (!SE->isLoopInvariant(Op, L) || in findInsertPt()
546 if (SE->isLoopInvariant(S, L)) in isLoopInvariantValue()
1105 !SE->isLoopInvariant(MinEC, L) || in predicateLoopExits()
|