/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | RDFDeadCode.cpp | 71 for (unsigned R = 0, RN = DFG.getTRI().getNumRegs(); R != RN; ++R) { 84 if (!DFG.IsCode<NodeAttrs::Stmt>(IA)) 88 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG)) { 96 NodeAddr<InstrNode*> IA = DA.Addr->getOwner(DFG); 97 for (NodeAddr<UseNode*> UA : IA.Addr->members_if(DFG.IsUse, DFG)) { 101 for (NodeAddr<DefNode*> TA : DFG.getRelatedRefs(IA, DA)) 113 // Traverse the DFG and collect the set dead RefNodes and the set of 128 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG)) [all...] |
H A D | RDFCopy.cpp | 46 RegisterRef DstR = DFG.makeRegRef(Dst.getReg(), Dst.getSubReg()); 47 RegisterRef SrcR = DFG.makeRegRef(Src.getReg(), Src.getSubReg()); 50 const TargetRegisterInfo &TRI = DFG.getTRI(); 70 NodeAddr<BlockNode*> BA = DFG.findBlock(B); 72 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) { 73 if (DFG.IsCode<NodeAttrs::Stmt>(IA)) { 102 scanBlock(&DFG.getMF().front()); 107 dbgs() << "Instr: " << *DFG.addr<StmtNode*>(I).Addr->getCode(); 110 dbgs() << ' ' << Print<RegisterRef>(J.first, DFG) << '=' 111 << Print<RegisterRef>(J.second, DFG); [all...] |
H A D | HexagonRDFOpt.cpp | 117 DataFlowGraph &DFG = getDFG(); local 125 mapRegs(DFG.makeRegRef(DstOp.getReg(), Hexagon::isub_hi), 126 DFG.makeRegRef(HiOp.getReg(), HiOp.getSubReg())); 127 mapRegs(DFG.makeRegRef(DstOp.getReg(), Hexagon::isub_lo), 128 DFG.makeRegRef(LoOp.getReg(), LoOp.getSubReg())); 140 mapRegs(DFG.makeRegRef(DstOp.getReg(), DstOp.getSubReg()), 141 DFG.makeRegRef(SrcOp.getReg(), SrcOp.getSubReg())); 161 DataFlowGraph &DFG = getDFG(); local 163 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG)) { 199 DataFlowGraph &DFG = getDFG(); local [all...] |
H A D | RDFCopy.h | 28 CopyPropagation(DataFlowGraph &dfg) : MDT(dfg.getDT()), DFG(dfg), 36 DataFlowGraph &getDFG() { return DFG; } 44 DataFlowGraph &DFG; member in struct:llvm::rdf::CopyPropagation
|
H A D | RDFDeadCode.h | 36 : Trace(false), DFG(dfg), MRI(mri), LV(mri, dfg) {} 45 DataFlowGraph &getDFG() { return DFG; } 52 DataFlowGraph &DFG; member in struct:llvm::rdf::DeadCodeElimination
|
H A D | HexagonOptAddrMode.cpp | 86 DataFlowGraph *DFG = nullptr; member in class:__anon5179::HexagonOptAddrMode 169 for (NodeAddr<UseNode *> UA : AddAslSN.Addr->members_if(DFG->IsUse, *DFG)) { 170 RegisterRef RR = UA.Addr->getRegRef(*DFG); 179 NodeAddr<InstrNode *> IA = UA.Addr->getOwner(*DFG); 183 if ((DFG->IsDef(AA) && AA.Id != OffsetRegRD) || 188 NodeAddr<DefNode *> OffsetRegDN = DFG->addr<DefNode *>(OffsetRegRD); 216 RegisterRef UR = UN.Addr->getRegRef(*DFG); 222 << PrintNode<UseNode*>(UN, *DFG) << '\n' 232 NodeAddr<UseNode *> DA = DFG [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | RDFLiveness.cpp | 125 auto SNA = DFG.addr<RefNode*>(Start); 129 for (auto S : DFG.getRelatedRefs(RefA.Addr->getOwner(DFG), RefA)) 141 auto TA = DFG.addr<DefNode*>(DefQ[i]); 145 RegisterRef RR = TA.Addr->getRegRef(DFG); 146 if (!DFG.IsPreservingDef(TA)) 151 for (auto S : DFG.getRelatedRefs(TA.Addr->getOwner(DFG), TA)) 160 auto TA = DFG.addr<DefNode*>(N); 162 if (!IsPhi && !PRI.alias(RefRR, TA.Addr->getRegRef(DFG))) [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/X86/ |
H A D | X86LoadValueInjectionLoadHardening.cpp | 334 DataFlowGraph DFG{MF, *TII, *TRI, MDT, MDF, TOI}; 335 DFG.build(); 336 Liveness L{MF.getRegInfo(), DFG}; 370 RegisterRef DefReg = DFG.getPRI().normalize(Def.Addr->getRegRef(DFG)); 372 auto Use = DFG.addr<UseNode *>(UseID); 374 NodeAddr<PhiNode *> Phi = Use.Addr->getOwner(DFG); 376 if (DFG.getPRI().alias(RegisterRef(I.first), DefReg)) { 393 auto Use = DFG.addr<UseNode *>(UseID); 410 Transmitters[Def.Id].push_back(Use.Addr->getOwner(DFG) [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | RDFLiveness.h | 55 : DFG(g), TRI(g.getTRI()), PRI(g.getPRI()), MDT(g.getDT()), 62 return getAllReachingDefs(RefA.Addr->getRegRef(DFG), RefA, false, 100 const DataFlowGraph &DFG; member in struct:llvm::rdf::Liveness
|