/external/llvm/lib/Transforms/Scalar/ |
D | Reassociate.cpp | 995 Value *VB = Sub->user_back(); in ShouldBreakUpSubtract() 1944 while (Op->hasOneUse() && Op->user_back()->getOpcode() == Opcode && in EraseInst() 1946 Op = Op->user_back(); in EraseInst() 1981 Instruction *User = I->user_back(); in canonicalizeNegConstExpr() 2041 (isReassociableOp(I->user_back(), Instruction::Mul) || in OptimizeInst() 2042 isReassociableOp(I->user_back(), Instruction::Add)))) { in OptimizeInst() 2090 !isReassociableOp(I->user_back(), Instruction::Mul))) { in OptimizeInst() 2114 !isReassociableOp(I->user_back(), Instruction::FMul))) { in OptimizeInst() 2136 if (BO->hasOneUse() && BO->user_back()->getOpcode() == Opcode) { in OptimizeInst() 2140 if (BO->user_back() != BO) in OptimizeInst() [all …]
|
D | ConstantHoisting.cpp | 562 assert(isa<Instruction>(Base->user_back()) && in emitBaseConstants() 564 Base->setDebugLoc(cast<Instruction>(Base->user_back())->getDebugLoc()); in emitBaseConstants()
|
D | TailRecursionElimination.cpp | 554 if (!I->hasOneUse() || !isa<ReturnInst>(I->user_back())) in CanTransformAccumulatorRecursion() 560 return getCommonReturnValue(cast<ReturnInst>(I->user_back()), CI); in CanTransformAccumulatorRecursion()
|
D | ScalarReplAggregates.cpp | 608 Instruction *User = cast<Instruction>(Ptr->user_back()); in ConvertUsesToScalar() 1331 LoadInst *LI = cast<LoadInst>(SI->user_back()); in tryToMakeAllocaBePromotable() 1375 LoadInst *SomeLoad = cast<LoadInst>(PN->user_back()); in tryToMakeAllocaBePromotable() 1383 LoadInst *LI = cast<LoadInst>(PN->user_back()); in tryToMakeAllocaBePromotable()
|
D | IndVarSimplify.cpp | 318 !isa<BranchInst>(Compare->user_back())) in handleFloatingPointIV() 321 BranchInst *TheBr = cast<BranchInst>(Compare->user_back()); in handleFloatingPointIV()
|
/external/llvm/lib/Transforms/Utils/ |
D | LCSSA.cpp | 245 (I.hasOneUse() && I.user_back()->getParent() == BB && in formLCSSA() 246 !isa<PHINode>(I.user_back()))) in formLCSSA()
|
D | DemoteRegToStack.cpp | 57 Instruction *U = cast<Instruction>(I.user_back()); in DemoteRegToStack()
|
D | SimplifyIndVar.cpp | 432 Branch = dyn_cast<BranchInst>(ExtractInst->user_back()); in splitOverflowIntrinsic()
|
D | PromoteMemoryToRegister.cpp | 492 StoreInst *SI = cast<StoreInst>(AI->user_back()); in promoteSingleBlockAlloca()
|
/external/llvm/include/llvm/IR/ |
D | Instruction.h | 55 Instruction *user_back() { return cast<Instruction>(*user_begin());} 56 const Instruction *user_back() const { return cast<Instruction>(*user_begin());}
|
D | Value.h | 346 User *user_back() { in user_back() function 350 const User *user_back() const { in user_back() function
|
/external/llvm/lib/Transforms/InstCombine/ |
D | InstCombinePHI.cpp | 612 if (PHINode *PU = dyn_cast<PHINode>(PN->user_back())) in DeadPHICycle() 760 !UserI->hasOneUse() || !isa<TruncInst>(UserI->user_back()) || in SliceUpIllegalIntegerPHI() 765 PHIUsers.push_back(PHIUsageRecord(PHIId, Shift, UserI->user_back())); in SliceUpIllegalIntegerPHI() 903 Instruction *PHIUser = cast<Instruction>(PN.user_back()); in visitPHINode() 919 PHIUser->user_back() == &PN) { in visitPHINode()
|
D | InstCombineVectorOps.cpp | 84 if (!PHIUser->hasOneUse() || !(PHIUser->user_back() == PN) || in scalarizePHI() 463 User *U = V->user_back(); in visitInsertValueInst() 513 if (!IE.hasOneUse() || !isa<InsertElementInst>(IE.user_back())) { in visitInsertElementInst()
|
D | InstCombineCasts.cpp | 835 if (CI.hasOneUse() && isa<TruncInst>(CI.user_back())) in visitZExt() 1120 if (CI.hasOneUse() && isa<TruncInst>(CI.user_back())) in visitSExt()
|
/external/llvm/lib/Transforms/IPO/ |
D | ArgumentPromotion.cpp | 698 OrigLoad = cast<LoadInst>(UI->user_back()); in DoPromotion() 760 CallSite CS(F->user_back()); in DoPromotion() 952 if (LoadInst *LI = dyn_cast<LoadInst>(I->user_back())) { in DoPromotion() 961 GetElementPtrInst *GEP = cast<GetElementPtrInst>(I->user_back()); in DoPromotion() 991 LoadInst *L = cast<LoadInst>(GEP->user_back()); in DoPromotion()
|
D | StripSymbols.cpp | 251 CallInst *CI = cast<CallInst>(Declare->user_back()); in runOnModule()
|
D | GlobalOpt.cpp | 559 User *GEP = GV->user_back(); in SRAGlobal() 858 Instruction *User = cast<Instruction>(CI->user_back()); in OptimizeGlobalAddressOfMalloc() 889 if (StoreInst *SI = dyn_cast<StoreInst>(GV->user_back())) { in OptimizeGlobalAddressOfMalloc() 897 LoadInst *LI = cast<LoadInst>(GV->user_back()); in OptimizeGlobalAddressOfMalloc() 939 cast<StoreInst>(InitBool->user_back())->eraseFromParent(); in OptimizeGlobalAddressOfMalloc() 1032 if (StoreInst *SI = dyn_cast<StoreInst>(GEPI->user_back())) in ReplaceUsesOfMallocWithGlobal() 1638 Instruction *UI = cast<Instruction>(GV->user_back()); in TryToShrinkGlobalToBoolean()
|
D | DeadArgumentElimination.cpp | 892 CallSite CS(F->user_back()); in RemoveDeadStuffFromFunction()
|
/external/llvm/lib/IR/ |
D | DebugInfo.cpp | 325 CallInst *CI = cast<CallInst>(Declare->user_back()); in StripDebugInfo() 334 CallInst *CI = cast<CallInst>(DbgVal->user_back()); in StripDebugInfo()
|
D | BasicBlock.cpp | 76 BlockAddress *BA = cast<BlockAddress>(user_back()); in ~BasicBlock()
|
D | Constants.cpp | 320 Value *V = user_back(); in destroyConstant() 332 assert((use_empty() || user_back() != V) && "Constant not removed!"); in destroyConstant() 471 const Constant *User = dyn_cast<Constant>(C->user_back()); in removeDeadUsersOfConstant()
|
/external/llvm/lib/CodeGen/ |
D | SjLjEHPrepare.cpp | 287 cast<Instruction>(Inst->user_back())->getParent() == BB && in lowerAcrossUnwindEdges() 288 !isa<PHINode>(Inst->user_back())) in lowerAcrossUnwindEdges()
|
/external/llvm/lib/Target/NVPTX/ |
D | NVPTXLowerAggrCopies.cpp | 259 if (StoreInst *SI = dyn_cast<StoreInst>(LI->user_back())) { in runOnFunction()
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
D | FastISel.cpp | 2072 const Instruction *TheUser = LI->user_back(); in tryToFoldLoad() 2081 TheUser = TheUser->user_back(); in tryToFoldLoad()
|
/external/clang/lib/CodeGen/ |
D | CGCleanup.cpp | 768 NormalCleanupDestSlot->user_back()->eraseFromParent(); in PopCleanupBlock()
|