Home
last modified time | relevance | path

Searched refs:UseI (Results 1 – 14 of 14) sorted by relevance

/freebsd-12.1/contrib/llvm/lib/Target/AMDGPU/
H A DR600EmitClauseMarkers.cpp211 for (MachineBasicBlock::iterator UseI = Def; UseI != BBEnd; ++UseI) { in canClauseLocalKillFitInClause() local
212 AluInstCount += OccupiedDwords(*UseI); in canClauseLocalKillFitInClause()
214 if (!SubstituteKCacheBank(*UseI, KCacheBanks, false)) in canClauseLocalKillFitInClause()
229 if (UseI->readsRegister(MOI->getReg(), &TRI)) in canClauseLocalKillFitInClause()
233 if (UseI != Def && UseI->killsRegister(MOI->getReg(), &TRI)) in canClauseLocalKillFitInClause()
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DMIRCanonicalizerPass.cpp262 MachineBasicBlock::iterator UseI = BBE; in rescheduleCanonically() local
266 if (DefI != BBE && UseI != BBE) in rescheduleCanonically()
275 UseI = BBI; in rescheduleCanonically()
280 if (DefI == BBE || UseI == BBE) in rescheduleCanonically()
287 UseI->dump(); in rescheduleCanonically()
292 MBB->splice(UseI, MBB, DefI); in rescheduleCanonically()
298 auto UseI = in rescheduleCanonically() local
302 if (UseI == MBB->instr_end()) in rescheduleCanonically()
308 E.second, MBB, [&]() -> MachineBasicBlock::iterator { return UseI; }); in rescheduleCanonically()
H A DMachineCopyPropagation.cpp215 const MachineInstr &UseI, unsigned UseIdx);
308 const MachineInstr &UseI, in isForwardableRegClassCopy() argument
316 UseI.getRegClassConstraint(UseIdx, TII, TRI)) in isForwardableRegClassCopy()
319 if (!UseI.isCopy()) in isForwardableRegClassCopy()
339 TRI->getMinimalPhysRegClass(UseI.getOperand(0).getReg()); in isForwardableRegClassCopy()
H A DSplitKit.cpp221 SmallVectorImpl<SlotIndex>::const_iterator UseI, UseE; in calcLiveBlockInfo() local
222 UseI = UseSlots.begin(); in calcLiveBlockInfo()
237 if (UseI == UseE || *UseI >= Stop) { in calcLiveBlockInfo()
246 BI.FirstInstr = *UseI; in calcLiveBlockInfo()
248 do ++UseI; in calcLiveBlockInfo()
249 while (UseI != UseE && *UseI < Stop); in calcLiveBlockInfo()
250 BI.LastInstr = UseI[-1]; in calcLiveBlockInfo()
/freebsd-12.1/contrib/llvm/lib/Target/Hexagon/
H A DHexagonSplitDouble.cpp254 MachineInstr *UseI = Op.getParent(); in partitionRegisters() local
255 if (isFixedInstr(UseI)) in partitionRegisters()
258 MachineOperand &MO = UseI->getOperand(i); in partitionRegisters()
439 MachineInstr *UseI = U->getParent(); in isProfitable() local
440 if (isFixedInstr(UseI)) { in isProfitable()
443 for (auto &Op : UseI->operands()) { in isProfitable()
454 if (UseI->isPHI()) { in isProfitable()
461 int32_t P = profit(UseI); in isProfitable()
549 const MachineInstr *UseI = I->getParent(); in collectIndRegsForLoop() local
550 if (UseI->getOpcode() != Hexagon::A2_addp) in collectIndRegsForLoop()
[all …]
H A DBitTracker.cpp985 for (MachineInstr &UseI : MRI.use_nodbg_instructions(Reg)) in visitUsesOf()
986 UseQ.push(&UseI); in visitUsesOf()
1104 MachineInstr &UseI = *UseQ.front(); in runUseQueue() local
1107 if (!InstrExec.count(&UseI)) in runUseQueue()
1109 if (UseI.isPHI()) in runUseQueue()
1110 visitPHI(UseI); in runUseQueue()
1111 else if (!UseI.isBranch()) in runUseQueue()
1112 visitNonBranch(UseI); in runUseQueue()
1114 visitBranchesFrom(UseI); in runUseQueue()
H A DHexagonBitSimplify.cpp978 MachineInstr *UseI = I->getParent(); in isDead() local
979 if (UseI->isDebugValue()) in isDead()
981 if (UseI->isPHI()) { in isDead()
1222 MachineInstr &UseI = *I->getParent(); in computeUsedBits() local
1223 if (UseI.isPHI() || UseI.isCopy()) { in computeUsedBits()
3120 MachineInstr *UseI = UI->getParent(); in processLoop() local
3121 if (UseI->getParent() != C.LB) { in processLoop()
3125 if (isBitShuffle(UseI, PR) || isStoreInput(UseI, PR)) in processLoop()
3174 if (UseI->getParent() == C.LB) { in processLoop()
3175 if (UseI->isPHI()) { in processLoop()
[all …]
H A DHexagonLoopIdiomRecognition.cpp1185 if (UseI->getOpcode() == Instruction::Select) { in classifyInst()
1186 Value *TV = UseI->getOperand(1), *FV = UseI->getOperand(2); in classifyInst()
1190 Early.insert(UseI); in classifyInst()
1194 Late.insert(UseI); in classifyInst()
1201 if (UseI->getNumOperands() == 0) in classifyInst()
1205 for (auto &I : UseI->operands()) { in classifyInst()
1226 Early.insert(UseI); in classifyInst()
1228 Late.insert(UseI); in classifyInst()
2340 Instruction *UseI = dyn_cast<Instruction>(K); in coverLoop() local
2341 if (!UseI) in coverLoop()
[all …]
H A DHexagonGenPredicate.cpp237 MachineInstr *UseI = I->getParent(); in processPredicateGPR() local
238 if (isConvertibleToPredForm(UseI)) in processPredicateGPR()
239 PUsers.insert(UseI); in processPredicateGPR()
/freebsd-12.1/contrib/llvm/lib/Transforms/Utils/
H A DLoopRotationUtils.cpp563 for (User *UseI : IVOpnd->users()) { in shouldSpeculateInstrs()
564 auto *UserInst = cast<Instruction>(UseI); in shouldSpeculateInstrs()
/freebsd-12.1/contrib/llvm/lib/Target/X86/
H A DX86CmovConversion.cpp324 [&](MachineInstr &UseI) { in collectCmovCandidates() argument
325 return UseI.getOpcode() == X86::SUBREG_TO_REG; in collectCmovCandidates()
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DLazyValueInfo.cpp1885 if (auto *UseI = dyn_cast<Instruction>(U)) in emitInstructionAnnot() local
1886 if (!isa<PHINode>(UseI) || DT.dominates(ParentBB, UseI->getParent())) in emitInstructionAnnot()
1887 printResult(UseI->getParent()); in emitInstructionAnnot()
/freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/
H A DIndVarSimplify.cpp964 Instruction *UseI) { in getPostIncRangeInfo() argument
965 DefUserPair Key(Def, UseI); in getPostIncRangeInfo()
975 void updatePostIncRangeInfo(Value *Def, Instruction *UseI, ConstantRange R) { in updatePostIncRangeInfo() argument
976 DefUserPair Key(Def, UseI); in updatePostIncRangeInfo()
H A DLoopStrengthReduce.cpp3084 auto UseI = find(Inc.UserInst->operands(), Inc.IVOperand); in FinalizeChain() local
3085 assert(UseI != Inc.UserInst->op_end() && "cannot find IV operand"); in FinalizeChain()
3086 IVIncSet.insert(UseI); in FinalizeChain()
3216 User::op_iterator UseI = in CollectFixupsAndInitialFormulae() local
3218 assert(UseI != UserInst->op_end() && "cannot find IV operand"); in CollectFixupsAndInitialFormulae()
3219 if (IVIncSet.count(UseI)) { in CollectFixupsAndInitialFormulae()
3220 LLVM_DEBUG(dbgs() << "Use is in profitable chain: " << **UseI << '\n'); in CollectFixupsAndInitialFormulae()