| /external/llvm/lib/Transforms/Scalar/ |
| D | Reassociate.cpp | 1009 Value *VB = Sub->user_back(); in ShouldBreakUpSubtract()
1962 while (Op->hasOneUse() && Op->user_back()->getOpcode() == Opcode && in EraseInst()
1964 Op = Op->user_back(); in EraseInst()
2001 Instruction *User = I->user_back(); in canonicalizeNegConstExpr()
2073 (isReassociableOp(I->user_back(), Instruction::Mul) || in OptimizeInst()
2074 isReassociableOp(I->user_back(), Instruction::Add)))) { in OptimizeInst()
2122 !isReassociableOp(I->user_back(), Instruction::Mul))) { in OptimizeInst()
2140 !isReassociableOp(I->user_back(), Instruction::FMul))) { in OptimizeInst()
2156 if (BO->hasOneUse() && BO->user_back()->getOpcode() == Opcode) in OptimizeInst()
2162 cast<Instruction>(BO->user_back())->getOpcode() == Instruction::Sub) 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 | 547 if (!I->hasOneUse() || !isa<ReturnInst>(I->user_back())) in CanTransformAccumulatorRecursion()
553 return getCommonReturnValue(cast<ReturnInst>(I->user_back()), CI); in CanTransformAccumulatorRecursion()
|
| D | ScalarReplAggregates.cpp | 607 Instruction *User = cast<Instruction>(Ptr->user_back()); in ConvertUsesToScalar()
1330 LoadInst *LI = cast<LoadInst>(SI->user_back()); in tryToMakeAllocaBePromotable()
1374 LoadInst *SomeLoad = cast<LoadInst>(PN->user_back()); in tryToMakeAllocaBePromotable()
1382 LoadInst *LI = cast<LoadInst>(PN->user_back()); in tryToMakeAllocaBePromotable()
|
| D | IndVarSimplify.cpp | 286 !isa<BranchInst>(Compare->user_back())) in HandleFloatingPointIV()
289 BranchInst *TheBr = cast<BranchInst>(Compare->user_back()); in HandleFloatingPointIV()
|
| D | LICM.cpp | 593 Instruction *User = I.user_back(); in sink()
|
| /external/llvm/include/llvm/IR/ |
| D | Instruction.h | 69 Instruction *user_back() { return cast<Instruction>(*user_begin());}
70 const Instruction *user_back() const { return cast<Instruction>(*user_begin());}
|
| D | Value.h | 282 User *user_back() { return *user_begin(); } in user_back() function
283 const User *user_back() const { return *user_begin(); } in user_back() function
|
| /external/llvm/lib/Transforms/InstCombine/ |
| D | InstCombinePHI.cpp | 521 if (PHINode *PU = dyn_cast<PHINode>(PN->user_back())) in DeadPHICycle()
670 !UserI->hasOneUse() || !isa<TruncInst>(UserI->user_back()) || in SliceUpIllegalIntegerPHI()
675 PHIUsers.push_back(PHIUsageRecord(PHIId, Shift, UserI->user_back())); in SliceUpIllegalIntegerPHI()
810 Instruction *PHIUser = cast<Instruction>(PN.user_back()); in visitPHINode()
826 PHIUser->user_back() == &PN) { in visitPHINode()
|
| D | InstCombineVectorOps.cpp | 132 if (!PHIUser->hasOneUse() || !(PHIUser->user_back() == PN) || in scalarizePHI()
512 User *U = V->user_back(); in visitInsertValueInst()
562 if (!IE.hasOneUse() || !isa<InsertElementInst>(IE.user_back())) { in visitInsertElementInst()
|
| D | InstCombineCasts.cpp | 760 if (CI.hasOneUse() && isa<TruncInst>(CI.user_back())) in visitZExt()
1047 if (CI.hasOneUse() && isa<TruncInst>(CI.user_back())) in visitSExt()
|
| D | InstCombineLoadStoreAlloca.cpp | 486 if (auto *BC = dyn_cast<BitCastInst>(LI.user_back())) { in combineLoadToOperationType()
|
| /external/llvm/lib/Transforms/Utils/ |
| D | LCSSA.cpp | 244 (I->hasOneUse() && I->user_back()->getParent() == BB && in formLCSSA()
245 !isa<PHINode>(I->user_back()))) in formLCSSA()
|
| D | DemoteRegToStack.cpp | 57 Instruction *U = cast<Instruction>(I.user_back()); in DemoteRegToStack()
|
| D | SimplifyIndVar.cpp | 352 Branch = dyn_cast<BranchInst>(ExtractInst->user_back()); in splitOverflowIntrinsic()
|
| D | PromoteMemoryToRegister.cpp | 501 StoreInst *SI = cast<StoreInst>(AI->user_back()); in promoteSingleBlockAlloca()
|
| /external/llvm/lib/Transforms/IPO/ |
| D | ArgumentPromotion.cpp | 670 OrigLoad = cast<LoadInst>(UI->user_back()); in DoPromotion()
743 CallSite CS(F->user_back()); in DoPromotion()
945 if (LoadInst *LI = dyn_cast<LoadInst>(I->user_back())) { in DoPromotion()
955 GetElementPtrInst *GEP = cast<GetElementPtrInst>(I->user_back()); in DoPromotion()
985 LoadInst *L = cast<LoadInst>(GEP->user_back()); in DoPromotion()
|
| D | GlobalOpt.cpp | 555 User *GEP = GV->user_back(); in SRAGlobal()
856 Instruction *User = cast<Instruction>(CI->user_back()); in OptimizeGlobalAddressOfMalloc()
887 if (StoreInst *SI = dyn_cast<StoreInst>(GV->user_back())) { in OptimizeGlobalAddressOfMalloc()
895 LoadInst *LI = cast<LoadInst>(GV->user_back()); in OptimizeGlobalAddressOfMalloc()
937 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 | StripSymbols.cpp | 251 CallInst *CI = cast<CallInst>(Declare->user_back()); in runOnModule()
|
| D | DeadArgumentElimination.cpp | 896 CallSite CS(F->user_back()); in RemoveDeadStuffFromFunction()
|
| /external/llvm/lib/IR/ |
| D | DebugInfo.cpp | 330 CallInst *CI = cast<CallInst>(Declare->user_back()); in StripDebugInfo()
339 CallInst *CI = cast<CallInst>(DbgVal->user_back()); in StripDebugInfo()
|
| D | BasicBlock.cpp | 76 BlockAddress *BA = cast<BlockAddress>(user_back()); in ~BasicBlock()
|
| /external/llvm/lib/CodeGen/ |
| D | SjLjEHPrepare.cpp | 288 cast<Instruction>(Inst->user_back())->getParent() == BB && in lowerAcrossUnwindEdges()
289 !isa<PHINode>(Inst->user_back())) in lowerAcrossUnwindEdges()
|
| D | WinEHPrepare.cpp | 1604 (Inst->user_back() != Insert1 && Inst->user_back() != Insert2)) { in findCleanupHandlers()
|
| /external/llvm/lib/Target/NVPTX/ |
| D | NVPTXLowerAggrCopies.cpp | 153 User *use = load->user_back(); in runOnFunction()
|