| /freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/ |
| H A D | InstSimplifyPass.cpp | 50 if (Value *V = SimplifyInstruction(I, SQ, ORE)) { in runImpl()
|
| H A D | LoopInstSimplify.cpp | 104 Value *V = SimplifyInstruction(&I, SQ.getWithInstruction(&I)); in simplifyLoopInst()
|
| H A D | TailRecursionElimination.cpp | 803 if (Value *PNV = SimplifyInstruction(PN, F.getParent()->getDataLayout())) { in eliminateTailRecursion()
|
| H A D | CorrelatedValuePropagation.cpp | 240 if (Value *V = SimplifyInstruction(P, SQ)) { in processPHI()
|
| H A D | StructurizeCFG.cpp | 647 if (Value *V = SimplifyInstruction(Phi, Q)) { in setPhiValues()
|
| H A D | EarlyCSE.cpp | 905 if (Value *V = SimplifyInstruction(Inst, SQ)) { in processNode()
|
| H A D | LoopUnswitch.cpp | 1597 if (Value *V = SimplifyInstruction(I, DL)) in SimplifyCode()
|
| H A D | JumpThreading.cpp | 2314 if (Value *IV = SimplifyInstruction( in DuplicateCondBranchOnPHIIntoPred()
|
| H A D | GVN.cpp | 1854 if (Value *V = SimplifyInstruction(I, {DL, TLI, DT, AC})) { in processInstruction()
|
| /freebsd-12.1/contrib/llvm/include/llvm/Analysis/ |
| H A D | InstructionSimplify.h | 255 Value *SimplifyInstruction(Instruction *I, const SimplifyQuery &Q,
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Utils/ |
| H A D | LoopSimplify.cpp | 181 if (Value *V = SimplifyInstruction(PN, {DL, nullptr, DT, AC})) { in findPHIToPartitionLoops()
572 if (Value *V = SimplifyInstruction(PN, {DL, nullptr, DT, AC})) { in simplifyOneLoop()
|
| H A D | CloneFunction.cpp | 334 SimplifyInstruction(NewInst, BB->getModule()->getDataLayout())) { in CloneBlock()
613 Value *SimpleV = SimplifyInstruction(I, DL); in CloneAndPruneIntoFromInst()
|
| H A D | SSAUpdater.cpp | 172 SimplifyInstruction(InsertedPHI, BB->getModule()->getDataLayout())) { in GetValueInMiddleOfBlock()
|
| H A D | LoopRotationUtils.cpp | 358 Value *V = SimplifyInstruction(C, SQ); in rotateLoop()
|
| H A D | LoopUnroll.cpp | 282 if (Value *V = SimplifyInstruction(Inst, {DL, nullptr, DT, AC})) in simplifyLoopAfterUnroll()
|
| H A D | PromoteMemoryToRegister.cpp | 714 if (Value *V = SimplifyInstruction(PN, SQ)) { in run()
|
| H A D | SimplifyCFG.cpp | 2234 if (Value *V = SimplifyInstruction(N, {DL, nullptr, nullptr, AC})) { in FoldCondBranchOnPHI()
2314 if (Value *V = SimplifyInstruction(PN, {DL, PN})) { in FoldTwoEntryPHINode()
3576 if (Value *V = SimplifyInstruction(ICI, {DL, ICI})) { in tryToSimplifyUncondBranchWithICmpInIt()
|
| H A D | InlineFunction.cpp | 2372 if (Value *V = SimplifyInstruction(PHI, {DL, nullptr, nullptr, AC})) { in InlineFunction()
|
| H A D | Local.cpp | 563 if (Value *SimpleV = SimplifyInstruction(I, DL)) { in simplifyAndDCEInstruction()
|
| /freebsd-12.1/contrib/llvm/lib/Target/Hexagon/ |
| H A D | HexagonLoopIdiomRecognition.cpp | 1469 if (Value *SV = SimplifyInstruction(&I, {DL, &TLI, &DT})) in cleanupLoopBody()
2153 if (Value *Simp = SimplifyInstruction(In, {*DL, TLI, DT})) in processCopyingStore()
2266 if (Value *Simp = SimplifyInstruction(In, {*DL, TLI, DT})) in processCopyingStore()
|
| /freebsd-12.1/contrib/llvm/lib/Analysis/ |
| H A D | Lint.cpp | 715 if (Value *W = SimplifyInstruction(Inst, {*DL, TLI, DT, AC})) in findValueImpl()
|
| H A D | BasicAliasAnalysis.cpp | 480 SimplifyInstruction(const_cast<Instruction *>(I), DL)) { in DecomposeGEPExpression()
|
| H A D | ScalarEvolutionExpander.cpp | 1884 if (Value *V = SimplifyInstruction(PN, {DL, &SE.TLI, &SE.DT, &SE.AC})) in replaceCongruentIVs()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombinePHI.cpp | 1123 if (Value *V = SimplifyInstruction(&PN, SQ.getWithInstruction(&PN))) in visitPHINode()
|
| /freebsd-12.1/contrib/llvm/lib/CodeGen/ |
| H A D | CodeGenPrepare.cpp | 2853 if (Value *V = SimplifyInstruction(cast<Instruction>(PI), SQ)) { in Simplify()
6665 if (Value *V = SimplifyInstruction(P, {*DL, TLInfo})) { in optimizeInst()
|