| /llvm-project-15.0.7/llvm/include/llvm/Analysis/ |
| H A D | InstSimplifyFolder.h | 36 SimplifyQuery SQ; variable
52 return simplifyBinOp(Opc, LHS, RHS, SQ); in FoldBinOp()
57 return simplifyBinOp(Opc, LHS, RHS, SQ); in FoldExactBinOp()
62 return simplifyBinOp(Opc, LHS, RHS, SQ); in FoldNoWrapBinOp()
67 return simplifyBinOp(Opc, LHS, RHS, FMF, SQ); in FoldBinOpFMF()
72 return simplifyUnOp(Opc, V, FMF, SQ); in FoldUnOpFMF()
76 return simplifyICmpInst(P, LHS, RHS, SQ); in FoldICmp()
85 return simplifySelectInst(C, True, False, SQ); in FoldSelect()
90 return simplifyExtractValueInst(Agg, IdxList, SQ); in FoldExtractValue()
95 return simplifyInsertValueInst(Agg, Val, IdxList, SQ); in FoldInsertValue()
[all …]
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Scalar/ |
| H A D | InstSimplifyPass.cpp | 29 static bool runImpl(Function &F, const SimplifyQuery &SQ, in runImpl() argument
38 if (!SQ.DT->isReachableFromEntry(&BB)) in runImpl()
54 if (Value *V = simplifyInstruction(&I, SQ, ORE)) { in runImpl()
67 RecursivelyDeleteTriviallyDeadInstructions(DeadInstsInBB, SQ.TLI); in runImpl()
108 const SimplifyQuery SQ(DL, TLI, DT, AC); in runOnFunction() local
109 return runImpl(F, SQ, ORE); in runOnFunction()
136 const SimplifyQuery SQ(DL, &TLI, &DT, &AC); in run() local
137 bool Changed = runImpl(F, SQ, &ORE); in run()
|
| H A D | LoopDeletion.cpp | 181 const SimplifyQuery &SQ) { in getValueOnFirstIteration() argument
192 getValueOnFirstIteration(BO->getOperand(0), FirstIterValue, SQ); in getValueOnFirstIteration()
194 getValueOnFirstIteration(BO->getOperand(1), FirstIterValue, SQ); in getValueOnFirstIteration()
195 FirstIterV = simplifyBinOp(BO->getOpcode(), LHS, RHS, SQ); in getValueOnFirstIteration()
198 getValueOnFirstIteration(Cmp->getOperand(0), FirstIterValue, SQ); in getValueOnFirstIteration()
200 getValueOnFirstIteration(Cmp->getOperand(1), FirstIterValue, SQ); in getValueOnFirstIteration()
201 FirstIterV = simplifyICmpInst(Cmp->getPredicate(), LHS, RHS, SQ); in getValueOnFirstIteration()
208 FirstIterV = getValueOnFirstIteration(Selected, FirstIterValue, SQ); in getValueOnFirstIteration()
306 const SimplifyQuery SQ(DL); in canProveExitOnFirstIteration() local
327 getValueOnFirstIteration(Incoming, FirstIterValue, SQ); in canProveExitOnFirstIteration()
[all …]
|
| H A D | LoopRotation.cpp | 56 const SimplifyQuery SQ = getBestSimplifyQuery(AR, DL); in run() local
63 MSSAU ? MSSAU.getPointer() : nullptr, SQ, false, Threshold, in run()
119 const SimplifyQuery SQ = getBestSimplifyQuery(*this, F); in runOnLoop() local
134 MSSAU ? MSSAU.getPointer() : nullptr, SQ, false, in runOnLoop()
|
| H A D | LoopInstSimplify.cpp | 50 SimplifyQuery SQ(DL, &TLI, &DT, &AC); in simplifyLoopInst() local
99 Value *V = simplifyInstruction(&I, SQ.getWithInstruction(&I)); in simplifyLoopInst()
|
| /llvm-project-15.0.7/llvm/unittests/Transforms/Utils/ |
| H A D | LoopRotationUtilsTest.cpp | 84 SimplifyQuery SQ(M->getDataLayout()); in TEST() local
91 SQ, true, -1, false); in TEST()
155 SimplifyQuery SQ(M->getDataLayout()); in TEST() local
162 SQ, true, -1, false); in TEST()
|
| /llvm-project-15.0.7/llvm/lib/Support/ |
| H A D | YAMLTraits.cpp | 218 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) in beginSequence() local
219 return SQ->Entries.size(); in beginSequence()
240 CurrentNode = SQ->Entries[Index].get(); in preflightElement()
257 CurrentNode = SQ->Entries[index].get(); in preflightFlowElement()
302 BitValuesUsed.resize(SQ->Entries.size()); in beginBitSetScalar()
315 for (auto &N : SQ->Entries) { in bitSetMatch()
336 assert(BitValuesUsed.size() == SQ->Entries.size()); in endBitSetScalar()
337 for (unsigned i = 0; i < SQ->Entries.size(); ++i) { in endBitSetScalar()
339 setError(SQ->Entries[i].get(), "unknown bit value"); in endBitSetScalar()
410 } else if (SequenceNode *SQ = dyn_cast<SequenceNode>(N)) { in createHNodes() local
[all …]
|
| /llvm-project-15.0.7/llvm/test/Transforms/InstCombine/ |
| H A D | opaque.ll | 5 %SQ = type <{ [8 x i8] }>
8 …t8, %Vs4Int8, %Vs4Int8, %Vs4Int8, %Vs4Int8, %Vs4Int8, %Vs4Int8 }>, %Si, %SQ, %SQ, %Si, %swift.opaq…
|
| /llvm-project-15.0.7/llvm/include/llvm/MCA/HardwareUnits/ |
| H A D | LSUnit.h | 448 LSUnit(const MCSchedModel &SM, unsigned LQ, unsigned SQ) in LSUnit() argument
449 : LSUnit(SM, LQ, SQ, /* NoAlias */ false) {} in LSUnit()
450 LSUnit(const MCSchedModel &SM, unsigned LQ, unsigned SQ, bool AssumeNoAlias) in LSUnit() argument
451 : LSUnitBase(SM, LQ, SQ, AssumeNoAlias), CurrentLoadGroupID(0), in LSUnit()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Utils/ |
| H A D | LoopRotationUtils.cpp | 63 const SimplifyQuery &SQ; member in __anon14c277390111::LoopRotate
72 const SimplifyQuery &SQ, bool RotationOnly, bool IsUtilMode, in LoopRotate() argument
75 MSSAU(MSSAU), SQ(SQ), RotationOnly(RotationOnly), in LoopRotate()
448 Value *V = simplifyInstruction(C, SQ); in rotateLoop()
828 const SimplifyQuery &SQ, bool RotationOnly = true, in LoopRotation() argument
831 LoopRotate LR(Threshold, LI, TTI, AC, DT, SE, MSSAU, SQ, RotationOnly, in LoopRotation()
|
| H A D | PromoteMemoryToRegister.cpp | 232 const SimplifyQuery SQ; member
269 AC(AC), SQ(DT.getRoot()->getParent()->getParent()->getDataLayout(), in PromoteMem2Reg()
582 if (rewriteSingleStoreAlloca(AI, Info, LBI, SQ.DL, DT, AC)) { in run()
593 promoteSingleBlockAlloca(AI, Info, LBI, SQ.DL, DT, AC)) { in run()
707 if (Value *V = simplifyInstruction(PN, SQ)) { in run()
964 !isKnownNonZero(V, SQ.DL, 0, AC, LI, &DT)) in RenamePass()
|
| /llvm-project-15.0.7/llvm/include/llvm/Transforms/Utils/ |
| H A D | LoopRotationUtils.h | 35 MemorySSAUpdater *MSSAU, const SimplifyQuery &SQ,
|
| /llvm-project-15.0.7/llvm/lib/MCA/HardwareUnits/ |
| H A D | LSUnit.cpp | 24 LSUnitBase::LSUnitBase(const MCSchedModel &SM, unsigned LQ, unsigned SQ, in LSUnitBase() argument
26 : LQSize(LQ), SQSize(SQ), UsedLQEntries(0), UsedSQEntries(0), in LSUnitBase()
|
| /llvm-project-15.0.7/llvm/test/Analysis/ScalarEvolution/ |
| H A D | SolveQuadraticEquation.ll | 20 %SQ = mul i32 %i.0, %i.0
22 %tmp5 = sub i32 %SQ, %tmp4
|
| /llvm-project-15.0.7/llvm/include/llvm/Transforms/InstCombine/ |
| H A D | InstCombiner.h | 74 const SimplifyQuery SQ; variable
94 SQ(DL, &TLI, &DT, &AC), ORE(ORE), BFI(BFI), PSI(PSI), LI(LI) {} in InstCombiner()
372 const SimplifyQuery &getSimplifyQuery() const { return SQ; } in getSimplifyQuery()
|
| /llvm-project-15.0.7/llvm/test/tools/llvm-mca/X86/BdVer2/ |
| H A D | store-throughput.s | 84 # CHECK-NEXT: SQ - Store queue full: 371 (92.1%)
314 # CHECK-NEXT: SQ - Store queue full: 371 (92.1%)
544 # CHECK-NEXT: SQ - Store queue full: 560 (92.9%)
776 # CHECK-NEXT: SQ - Store queue full: 561 (7.8%)
|
| H A D | load-throughput.s | 84 # CHECK-NEXT: SQ - Store queue full: 0
314 # CHECK-NEXT: SQ - Store queue full: 0
544 # CHECK-NEXT: SQ - Store queue full: 0
776 # CHECK-NEXT: SQ - Store queue full: 0
|
| /llvm-project-15.0.7/llvm/test/tools/llvm-mca/X86/ |
| H A D | option-all-stats-1.s | 35 # FULLREPORT-NEXT: SQ - Store queue full: 0
|
| /llvm-project-15.0.7/llvm/test/tools/llvm-mca/AArch64/Cortex/ |
| H A D | A55-all-stats.s | 42 # CHECK-NEXT: SQ - Store queue full: 0
|
| H A D | A55-all-views.s | 42 # CHECK-NEXT: SQ - Store queue full: 0
|
| H A D | A55-out-of-order-retire.s | 42 # CHECK-NEXT: SQ - Store queue full: 0
|
| H A D | A55-in-order-retire.s | 42 # CHECK-NEXT: SQ - Store queue full: 0
|
| /llvm-project-15.0.7/llvm/test/tools/llvm-mca/X86/Barcelona/ |
| H A D | load-store-throughput.s | 77 # CHECK-NEXT: SQ - Store queue full: 0
271 # CHECK-NEXT: SQ - Store queue full: 0
465 # CHECK-NEXT: SQ - Store queue full: 0
|
| H A D | store-throughput.s | 77 # CHECK-NEXT: SQ - Store queue full: 0
273 # CHECK-NEXT: SQ - Store queue full: 0
469 # CHECK-NEXT: SQ - Store queue full: 0
|
| H A D | load-throughput.s | 77 # CHECK-NEXT: SQ - Store queue full: 0
271 # CHECK-NEXT: SQ - Store queue full: 0
465 # CHECK-NEXT: SQ - Store queue full: 0
|