Home
last modified time | relevance | path

Searched refs:getUse (Results 1 – 25 of 30) sorted by relevance

12

/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonOptimizeSZextends.cpp130 const Use &TheUse = UI.getUse(); in runOnFunction()
H A DHexagonCommonGEP.cpp377 Us.insert(&UI.getUse()); in processGepInst()
H A DHexagonLoopIdiomRecognition.cpp675 Use &TheUse = UI.getUse(); in replaceAllUsesOfWithIn()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/IR/
H A DCFG.h99 Use &getUse() const { in getUse() function
100 return It.getUse(); in getUse()
H A DAbstractCallSite.h133 return isCallee(&UI.getUse()); in isCallee()
H A DInstrTypes.h1384 return isDataOperand(&UI.getUse());
1390 return getDataOperandNo(&UI.getUse());
1452 return isArgOperand(&UI.getUse());
1465 return getArgOperandNo(&UI.getUse());
1493 return isCallee(&UI.getUse());
2075 return isBundleOperand(&UI.getUse());
H A DValue.h211 Use &getUse() const { return *UI; } in getUse() function
H A DInstructions.h2839 return getIncomingBlock(I.getUse());
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DSROA.cpp555 bool isDead() const { return getUse() == nullptr; } in isDead()
1287 assert(AS.Slices[PrevIdx].getUse()->getUser() == &II && in visitMemTransferInst()
1519 Use *U = I->getUse(); in findCommonType()
2096 Use *U = S.getUse(); in isVectorPromotionViableForSlice()
2347 if (auto *LI = dyn_cast<LoadInst>(S.getUse()->getUser())) in isVectorPromotionViable()
2395 Use *U = S.getUse(); in isIntegerWideningViableForSlice()
2777 OldUse = I->getUse(); in visit()
5007 if (isa<LoadInst>(S.getUse()->getUser()) || in splitAlloca()
5008 isa<StoreInst>(S.getUse()->getUser())) { in splitAlloca()
5024 if (isa<LoadInst>(S.getUse()->getUser()) || in splitAlloca()
[all …]
H A DDFAJumpThreading.cpp123 PHINode *getUse() { return SIUse; } in getUse() function in __anon320b88660111::SelectInstToUnfold
201 PHINode *SIUse = SIToUnfold.getUse(); in unfold()
H A DLoopStrengthReduce.cpp2032 std::pair<size_t, int64_t> getUse(const SCEV *&Expr, LSRUse::KindType Kind,
2612 std::pair<size_t, int64_t> LSRInstance::getUse(const SCEV *&Expr, in getUse() function in LSRInstance
3380 std::pair<size_t, int64_t> P = getUse(S, Kind, AccessTy); in CollectFixupsAndInitialFormulae()
3572 std::pair<size_t, int64_t> P = getUse( in CollectLoopInvariantFixupsAndFormulae()
H A DLICM.cpp1628 Use &U = UI.getUse(); in sink()
/freebsd-14.2/contrib/llvm-project/llvm/lib/IR/
H A DSafepointIRVerifier.cpp77 auto &PU = PredIt.getUse(); in getEdge()
117 auto &PU = PredIt.getUse(); in hasLiveIncomingEdges()
/freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DLegalizeTypes.cpp93 if (UI.getUse().getResNo() == i) in PerformExpensiveChecks()
H A DScheduleDAGSDNodes.cpp240 if (I.getUse().getResNo() != Chain.getResNo()) in ClusterNeighboringLoads()
H A DSelectionDAGISel.cpp2179 SDUse &Use = I.getUse(); in findGlueUse()
3609 if (UI.getUse().getValueType() != MVT::Other) in SelectCodeCommon()
H A DSelectionDAG.cpp11016 SDUse &Use = UI.getUse(); in ReplaceAllUsesWith()
11074 SDUse &Use = UI.getUse(); in ReplaceAllUsesWith()
11123 SDUse &Use = UI.getUse(); in ReplaceAllUsesWith()
11174 SDUse &Use = UI.getUse(); in ReplaceAllUsesOfValueWith()
11323 SDUse &Use = UI.getUse(); in ReplaceAllUsesOfValuesWith()
11815 if (UI.getUse().getResNo() == Value) { in hasNUsesOfValue()
11832 if (UI.getUse().getResNo() == Value) in hasAnyUseOfValue()
H A DDAGCombiner.cpp12817 if (UI.getUse().getResNo() != N0.getResNo()) in ExtendUsesToFormExtLoad()
12851 SDUse &Use = UI.getUse(); in ExtendUsesToFormExtLoad()
13317 if (UI.getUse().getResNo() != 0 || User == N0.getNode()) in foldSextSetcc()
18188 SDUse &Use = UI.getUse(); in CombineToPreIndexedLoadStore()
19318 if (UI.getUse().getResNo() != 0) in SliceUpLoad()
26466 SDUse &U = I.getUse(); in visitGET_FPENV_MEM()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DMemorySSA.h552 return getIncomingBlock(I.getUse());
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86ISelDAGToDAG.cpp3220 if (UI.getUse().getResNo() != Flags.getResNo()) in onlyUsesZeroFlag()
3230 if (FlagUI.getUse().getResNo() != 1) continue; in onlyUsesZeroFlag()
3256 if (UI.getUse().getResNo() != Flags.getResNo()) in hasNoSignFlagUses()
3266 if (FlagUI.getUse().getResNo() != 1) continue; in hasNoSignFlagUses()
3312 if (UI.getUse().getResNo() != Flags.getResNo()) in hasNoCarryFlagUses()
3325 if (FlagUI.getUse().getResNo() != 1) in hasNoCarryFlagUses()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DSelectionDAGNodes.h804 SDUse &getUse() const { return *Op; }
987 if (UI.getUse().get().getValueType() == MVT::Glue)
/freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/
H A DCodeGenPrepare.cpp1401 Use &TheUse = UI.getUse(); in SinkCast()
1783 Use &TheUse = UI.getUse(); in sinkCmpExpression()
2014 Use &TheUse = UI.getUse(); in sinkAndCmp0Expression()
2075 Use &TruncTheUse = TruncUI.getUse(); in SinkShiftAndTruncate()
2169 Use &TheUse = UI.getUse(); in OptimizeExtractBits()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUISelDAGToDAG.cpp917 if (UI.getUse().getResNo() == 1) { in SelectUADDO_USUBO()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCISelLowering.cpp3032 if (UI.getUse().get().getResNo() == 0 && in usePartialVectorLoads()
8505 if (UI.getUse().get().getResNo() != 0) in directMoveIsProfitable()
15521 if (UI.getUse().getResNo() == 0 && UI->getOpcode() != ISD::VECTOR_SHUFFLE) in combineVReverseMemOP()
15770 while (UI.getUse().getResNo() != 0) ++UI; in PerformDAGCombine()
15772 while (UI.getUse().getResNo() != 0) ++UI; in PerformDAGCombine()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMISelLowering.cpp16159 if (UI.getUse().getResNo() != Addr.getResNo() || in CombineBaseUpdate()
16182 if (UI.getUse().getResNo() != Base.getResNo() || User == Addr.getNode() || in CombineBaseUpdate()
16264 UI.getUse().getResNo() != Addr.getResNo()) in PerformMVEVLDCombine()
16397 if (UI.getUse().getResNo() == NumVecs) in CombineVLDDUP()
16421 unsigned ResNo = UI.getUse().getResNo(); in CombineVLDDUP()

12