| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | Reassociate.cpp | 944 Value *VB = Or->user_back(); in shouldConvertOrWithNoCommonBitsToAdd() 989 Value *VB = Sub->user_back(); in ShouldBreakUpSubtract() 1997 while (Op->hasOneUse() && Op->user_back()->getOpcode() == Opcode && in EraseInst() 1999 Op = Op->user_back(); in EraseInst() 2153 (isReassociableOp(I->user_back(), Instruction::Mul) || in OptimizeInst() 2154 isReassociableOp(I->user_back(), Instruction::Add)))) { in OptimizeInst() 2213 !isReassociableOp(I->user_back(), Instruction::Mul))) { in OptimizeInst() 2240 !isReassociableOp(I->user_back(), Instruction::FMul))) { in OptimizeInst() 2262 if (BO->hasOneUse() && BO->user_back()->getOpcode() == Opcode) { in OptimizeInst() 2266 if (BO->user_back() != BO && in OptimizeInst() [all …]
|
| H A D | DFAJumpThreading.cpp | 482 if (auto *SelIUse = dyn_cast<PHINode>(SelI->user_back())) in isCandidate() 523 Instruction *SIUse = dyn_cast<Instruction>(SI->user_back()); in isValidSelectInst()
|
| H A D | IndVarSimplify.cpp | 243 !isa<BranchInst>(Compare->user_back())) in handleFloatingPointIV() 246 BranchInst *TheBr = cast<BranchInst>(Compare->user_back()); in handleFloatingPointIV()
|
| H A D | TailRecursionElimination.cpp | 397 if (!I->hasOneUse() || !isa<ReturnInst>(I->user_back())) in canTransformAccumulatorRecursion()
|
| H A D | ConstantHoisting.cpp | 889 assert(isa<Instruction>(Base->user_back()) && in emitBaseConstants()
|
| H A D | LoopPredication.cpp | 1086 WC->user_back()->replaceUsesOfWith( in predicateLoopExits()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/NVPTX/ |
| H A D | NVPTXLowerAggrCopies.cpp | 77 if (StoreInst *SI = dyn_cast<StoreInst>(LI->user_back())) { in runOnFunction()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombinePHI.cpp | 140 auto *IntToPtr = dyn_cast<IntToPtrInst>(PN.user_back()); in foldIntegerTypedPHI() 1163 !UserI->hasOneUse() || !isa<TruncInst>(UserI->user_back()) || in SliceUpIllegalIntegerPHI() 1173 PHIUsers.push_back(PHIUsageRecord(PHIId, Shift, UserI->user_back())); in SliceUpIllegalIntegerPHI() 1491 Instruction *PHIUser = cast<Instruction>(PN.user_back()); in visitPHINode() 1495 PHIUser->user_back() == &PN) { in visitPHINode() 1521 CmpInst = dyn_cast<ICmpInst>(U->user_back()); in visitPHINode()
|
| H A D | InstCombineVectorOps.cpp | 127 if (!PHIUser->hasOneUse() || !(PHIUser->user_back() == PN) || in scalarizePHI() 752 if (InsElt->hasOneUse() && isa<InsertElementInst>(InsElt->user_back())) in replaceExtractElements() 1242 User *U = V->user_back(); in visitInsertValueInst() 1294 if (InsElt.hasOneUse() && isa<InsertElementInst>(InsElt.user_back())) in foldInsSequenceIntoSplat() 1773 auto *InsertUser = dyn_cast<InsertElementInst>(Insert.user_back()); in visitInsertElementInst() 3051 auto *BC2 = dyn_cast<BitCastInst>(BC->user_back()); in visitShuffleVectorInst()
|
| H A D | InstCombineLoadStoreAlloca.cpp | 684 if (auto *BC = dyn_cast<BitCastInst>(Load.user_back())) { in combineLoadToOperationType() 690 if (auto *CastUser = dyn_cast<CastInst>(Load.user_back())) { in combineLoadToOperationType()
|
| H A D | InstCombineCasts.cpp | 330 if (auto *Trunc = dyn_cast<TruncInst>(V->user_back())) { in canEvaluateTruncated() 1195 if (Zext.hasOneUse() && isa<TruncInst>(Zext.user_back()) && in visitZExt() 1331 match(Zext.user_back(), m_Shift(m_Value(), m_Specific(&Zext)))) { in visitZExt() 1482 if (Sext.hasOneUse() && isa<TruncInst>(Sext.user_back())) in visitSExt()
|
| H A D | InstCombineSimplifyDemanded.cpp | 658 auto *Inst = dyn_cast<Instruction>(I->user_back()); in SimplifyDemandedUseBits() 740 auto *Inst = dyn_cast<Instruction>(I->user_back()); in SimplifyDemandedUseBits()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/ARM/ |
| H A D | ARMParallelDSP.cpp | 353 !Ld->hasOneUse() || !isa<SExtInst>(Ld->user_back())) in RecordMemoryOps() 741 Instruction *BaseSExt = dyn_cast<SExtInst>(Base->user_back()); in CreateWideLoad() 742 Instruction *OffsetSExt = dyn_cast<SExtInst>(Offset->user_back()); in CreateWideLoad()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | LCSSA.cpp | 421 (I.hasOneUse() && I.user_back()->getParent() == BB && in formLCSSAImpl() 422 !isa<PHINode>(I.user_back()))) in formLCSSAImpl()
|
| H A D | DemoteRegToStack.cpp | 67 Instruction *U = cast<Instruction>(I.user_back()); in DemoteRegToStack()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | SjLjEHPrepare.cpp | 294 cast<Instruction>(Inst.user_back())->getParent() == &BB && in lowerAcrossUnwindEdges() 295 !isa<PHINode>(Inst.user_back())) in lowerAcrossUnwindEdges()
|
| H A D | InterleavedAccessPass.cpp | 681 Value *StoredBy = II->user_back(); in lowerInterleaveIntrinsic()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | Instruction.h | 171 Instruction *user_back() { return cast<Instruction>(*user_begin());} 172 const Instruction *user_back() const { return cast<Instruction>(*user_begin());}
|
| H A D | Value.h | 412 User *user_back() { in user_back() function 416 const User *user_back() const { in user_back() function
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | StripSymbols.cpp | 153 CallInst *CI = cast<CallInst>(Declare->user_back()); in stripDebugDeclareImpl()
|
| H A D | ArgumentPromotion.cpp | 227 CallBase &CB = cast<CallBase>(*F->user_back()); in doPromotion()
|
| H A D | DeadArgumentElimination.cpp | 891 CallBase &CB = cast<CallBase>(*F->user_back()); in removeDeadStuffFromFunction()
|
| H A D | GlobalOpt.cpp | 1026 cast<StoreInst>(InitBool->user_back())->eraseFromParent(); in OptimizeGlobalAddressOfAllocation() 1263 Instruction *UI = cast<Instruction>(GV->user_back()); in TryToShrinkGlobalToBoolean()
|
| /freebsd/contrib/llvm-project/llvm/lib/IR/ |
| H A D | BasicBlock.cpp | 179 BlockAddress *BA = cast<BlockAddress>(user_back()); in ~BasicBlock()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Coroutines/ |
| H A D | CoroFrame.cpp | 1797 if (isLifetimeStart(U->user_back())) { in sinkLifetimeStartMarkers() 1798 Lifetimes.push_back(U->user_back()); in sinkLifetimeStartMarkers()
|