/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
H A D | SimplifyIndVar.h | 51 SmallVectorImpl<WeakTrackingVH> &Dead, 58 SmallVectorImpl<WeakTrackingVH> &Dead);
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | LiveRangeEdit.cpp | 173 // DestReg of the cloned instruction cannot be Dead. Set isDead of DestReg 187 SmallVectorImpl<MachineInstr*> &Dead) { 240 Dead.push_back(DefMI); 394 void LiveRangeEdit::eliminateDeadDefs(SmallVectorImpl<MachineInstr *> &Dead, argument 401 while (!Dead.empty()) 402 eliminateDeadDef(Dead.pop_back_val(), ToShrink, AA); 410 if (foldAsLoad(LI, Dead)) 415 if (!LIS.shrinkToUses(LI, &Dead)) 186 foldAsLoad(LiveInterval *LI, SmallVectorImpl<MachineInstr*> &Dead) argument
|
H A D | ReachingDefAnalysis.cpp | 613 InstSet &Dead) const { 614 Dead.insert(MI); 615 auto IsDead = [this, &Dead](MachineInstr *Def, int PhysReg) { 630 if (!Dead.count(Use)) 640 collectKilledOperands(Def, Dead);
|
H A D | RDFLiveness.cpp | 113 // Dead defs will be treated as if they were live, since they are actually 261 return DA.Addr->getFlags() & NodeAttrs::Dead; 390 bool IsDead = DefA.Addr->getFlags() & NodeAttrs::Dead; 471 bool IsDead = DA.Addr->getFlags() & NodeAttrs::Dead;
|
H A D | RegAllocFast.cpp | 858 bool Dead = MO.isDead(); local 862 return MO.isKill() || Dead; 882 return Dead;
|
H A D | RDFGraph.cpp | 85 if (Flags & NodeAttrs::Dead) 1311 Flags |= NodeAttrs::Dead; 1325 NodeAttrs::Dead; 1359 Flags |= NodeAttrs::Dead;
|
H A D | SplitKit.cpp | 1416 SmallVector<MachineInstr*, 8> Dead; local 1420 // Dead defs end at the dead slot. 1433 Dead.push_back(MI); 1437 if (Dead.empty()) 1440 Edit->eliminateDeadDefs(Dead, None, &AA);
|
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | LiveRangeEdit.h | 106 bool foldAsLoad(LiveInterval *LI, SmallVectorImpl<MachineInstr *> &Dead); 245 void eliminateDeadDefs(SmallVectorImpl<MachineInstr *> &Dead,
|
H A D | ReachingDefAnalysis.h | 213 void collectKilledOperands(MachineInstr *MI, InstSet &Dead) const;
|
H A D | MachineInstrBuilder.h | 47 Dead = 0x10, enumerator in enum:llvm::RegState::__anon3158 96 flags & RegState::Dead, 480 return B ? RegState::Dead : 0;
|
H A D | RDFGraph.h | 193 // - Dead: applies only to defs. The value coming out of a "dead" def is 290 Dead = 0x0040 << 5, // 1000000, Does not define a value. member in struct:llvm::rdf::NodeAttrs
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/ARM/ |
H A D | MVETailPredication.cpp | 319 SmallPtrSet<Instruction*, 4> Dead; local 330 Dead.insert(I); 333 for (auto *I : Dead) {
|
H A D | Thumb2SizeReduction.cpp | 597 MIB.addReg(MI->getOperand(0).getReg(), RegState::Define | RegState::Dead);
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | SimplifyIndVar.cpp | 67 SmallVectorImpl<WeakTrackingVH> &Dead) 69 DeadInsts(Dead), Changed(false) { 944 SmallVectorImpl<WeakTrackingVH> &Dead, 947 Rewriter, Dead); 956 SmallVectorImpl<WeakTrackingVH> &Dead) { 964 simplifyUsersOfIV(cast<PHINode>(I), SE, DT, LI, TTI, Dead, Rewriter); 64 SimplifyIndvar(Loop *Loop, ScalarEvolution *SE, DominatorTree *DT, LoopInfo *LI, const TargetTransformInfo *TTI, SCEVExpander &Rewriter, SmallVectorImpl<WeakTrackingVH> &Dead) argument 942 simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, DominatorTree *DT, LoopInfo *LI, const TargetTransformInfo *TTI, SmallVectorImpl<WeakTrackingVH> &Dead, SCEVExpander &Rewriter, IVVisitor *V) argument 954 simplifyLoopIVs(Loop *L, ScalarEvolution *SE, DominatorTree *DT, LoopInfo *LI, const TargetTransformInfo *TTI, SmallVectorImpl<WeakTrackingVH> &Dead) argument
|
H A D | BasicBlockUtils.cpp | 97 SmallPtrSet<BasicBlock *, 4> Dead(BBs.begin(), BBs.end()); 98 assert(Dead.size() == BBs.size() && "Duplicating blocks?"); 99 for (auto *BB : Dead) 101 assert(Dead.count(Pred) && "All predecessors must be dead!");
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | SIFormMemoryClauses.cpp | 141 S |= RegState::Dead; 379 S &= ~(RegState::Undef | RegState::Dead);
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
H A D | GlobalOpt.cpp | 207 // If Dead[n].first is the only use of a malloc result, we can delete its 208 // chain of computation and the store to the global in Dead[n].second. 209 SmallVector<std::pair<Instruction *, Instruction *>, 32> Dead; local 222 Dead.push_back(std::make_pair(I, SI)); 230 Dead.push_back(std::make_pair(I, MSI)); 239 Dead.push_back(std::make_pair(I, MTI)); 250 Dead.clear(); 257 for (int i = 0, e = Dead.size(); i != e; ++i) { 258 if (IsSafeComputationToRemove(Dead[i].first, GetTLI)) { 259 Dead[ [all...] |
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/SystemZ/ |
H A D | SystemZElimCompare.cpp | 236 MIB.addReg(SystemZ::CC, RegState::ImplicitDefine | RegState::Dead); 678 RegState::ImplicitDefine | RegState::Dead);
|
H A D | SystemZShortenInst.cpp | 147 .addReg(SystemZ::CC, RegState::ImplicitDefine | RegState::Dead);
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AArch64/ |
H A D | AArch64ConditionalCompares.cpp | 638 .addReg(DestReg, RegState::Define | RegState::Dead)
|
H A D | AArch64FrameLowering.cpp | 1245 .addReg(AArch64::X16, RegState::Implicit | RegState::Define | RegState::Dead) 1246 .addReg(AArch64::X17, RegState::Implicit | RegState::Define | RegState::Dead) 1247 .addReg(AArch64::NZCV, RegState::Implicit | RegState::Define | RegState::Dead) 1270 .addReg(AArch64::X16, RegState::Implicit | RegState::Define | RegState::Dead) 1271 .addReg(AArch64::X17, RegState::Implicit | RegState::Define | RegState::Dead) 1272 .addReg(AArch64::NZCV, RegState::Implicit | RegState::Define | RegState::Dead)
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/Mips/ |
H A D | MipsISelLowering.cpp | 1576 // The Dead flag is needed as the value in scratch isn't used by any other 1577 // instruction. Kill isn't used as Dead is more precise. 1612 RegState::Implicit | RegState::Dead); 1617 RegState::Implicit | RegState::Dead); 1825 RegState::Dead | RegState::Implicit) 1827 RegState::Dead | RegState::Implicit) 1829 RegState::Dead | RegState::Implicit); 1833 RegState::Dead | RegState::Implicit); 1896 RegState::Dead | RegState::Implicit); 1937 // The scratch registers here with the EarlyClobber | Define | Dead | Implici [all...] |
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | DeadStoreElimination.cpp | 1 //===- DeadStoreElimination.cpp - Fast Dead Store Elimination -------------===// 765 dbgs() << "DSE: Dead Store to soon to be freed memory:\n DEAD: " 875 Instruction *Dead = &*BBI; local 877 LLVM_DEBUG(dbgs() << "DSE: Dead Store at End of Block:\n DEAD: " 878 << *Dead << "\n Objects: "; 890 deleteDeadInstruction(Dead, &BBI, *MD, *TLI, IOL, ThrowableInst, 1012 LLVM_DEBUG(dbgs() << "DSE: Remove Dead Store:\n OW " 1318 LLVM_DEBUG(dbgs() << "DSE: Remove Dead Store:\n DEAD: " << *DepWrite 1409 // Only check non-dead blocks. Dead blocks may have strange pointer 2231 LLVM_DEBUG(dbgs() << "DSE: Remove Dead Stor [all...] |
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | InlineCost.cpp | 2055 BasicBlock *Dead = NewDead.pop_back_val(); local 2056 if (DeadBlocks.insert(Dead)) 2058 for (BasicBlock *S : successors(Dead))
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/BPF/ |
H A D | BPFISelLowering.cpp | 642 // The scratch register here is with the Define | Dead | EarlyClobber flags. 647 // as we anyway is loading memory into it. The Dead flag is needed as the 651 RegState::Define | RegState::Dead | RegState::EarlyClobber);
|