Home
last modified time | relevance | path

Searched refs:InstrNode (Results 1 – 10 of 10) sorted by relevance

/external/llvm/lib/Target/Hexagon/
DRDFDeadCode.cpp71 void DeadCodeElimination::scanInstr(NodeAddr<InstrNode*> IA, in scanInstr()
85 NodeAddr<InstrNode*> IA = DA.Addr->getOwner(DFG); in processDef()
118 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) in collect()
139 auto IsDead = [this] (NodeAddr<InstrNode*> IA) -> bool { in collect()
147 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) { in collect()
157 dbgs() << "Dead instr: " << PrintNode<InstrNode*>(IA, DFG) << "\n"; in collect()
189 DINs.push_back(DFG.addr<InstrNode*>(I)); in erase()
220 for (NodeAddr<InstrNode*> IA : DINs) { in erase()
DRDFGraph.h564 struct InstrNode : public CodeNode { struct
568 struct PhiNode : public InstrNode {
574 struct StmtNode : public InstrNode {
685 void pushDefs(NodeAddr<InstrNode*> IA, DefStackMap &DM);
689 NodeAddr<RefNode*> getNextRelated(NodeAddr<InstrNode*> IA,
691 NodeAddr<RefNode*> getNextImp(NodeAddr<InstrNode*> IA,
693 NodeAddr<RefNode*> getNextImp(NodeAddr<InstrNode*> IA,
695 NodeAddr<RefNode*> getNextShadow(NodeAddr<InstrNode*> IA,
697 NodeAddr<RefNode*> getNextShadow(NodeAddr<InstrNode*> IA,
700 NodeList getRelatedRefs(NodeAddr<InstrNode*> IA,
[all …]
DRDFCopy.cpp92 void CopyPropagation::updateMap(NodeAddr<InstrNode*> IA) { in updateMap()
122 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) { in scanBlock()
176 auto SA = DFG.addr<InstrNode*>(C); in run()
203 NodeAddr<InstrNode*> IA = UA.Addr->getOwner(DFG); in run()
DHexagonOptAddrMode.cpp88 void updateMap(NodeAddr<InstrNode *> IA);
160 NodeAddr<InstrNode *> IA = UA.Addr->getOwner(*DFG); in canRemoveAddasl()
204 << Print<NodeAddr<InstrNode *>>(TempIA, *DFG) << "\n"; in allValidCandidates()
226 << Print<NodeAddr<InstrNode *>>(TempIA, *DFG) << "\n"; in getAllRealUses()
439 DEBUG(dbgs() << "[InstrNode]: " << Print<NodeAddr<InstrNode *>>(UseIA, *DFG) in changeAddAsl()
520 DEBUG(dbgs() << "\t[InstrNode]: " << Print<NodeAddr<InstrNode *>>(IA, *DFG) in processBlock()
575 void HexagonOptAddrMode::updateMap(NodeAddr<InstrNode *> IA) { in updateMap()
602 for (NodeAddr<InstrNode *> IA : BA.Addr->members(*DFG)) { in constructDefMap()
DHexagonRDFOpt.cpp89 bool rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> &Remove);
90 void removeOperand(NodeAddr<InstrNode*> IA, unsigned OpNum);
175 void HexagonDCE::removeOperand(NodeAddr<InstrNode*> IA, unsigned OpNum) { in removeOperand()
201 bool HexagonDCE::rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> &Remove) { in rewrite()
DRDFGraph.cpp219 const Print<NodeAddr<InstrNode*>> &P) { in operator <<()
264 OS << PrintNode<InstrNode*>(I, P.G) << '\n'; in operator <<()
503 NodeAddr<NodeBase*> InstrNode::getOwner(const DataFlowGraph &G) { in getOwner()
870 NodeAddr<UseNode*> DataFlowGraph::newUse(NodeAddr<InstrNode*> Owner, in newUse()
886 NodeAddr<DefNode*> DataFlowGraph::newDef(NodeAddr<InstrNode*> Owner, in newDef()
893 NodeAddr<DefNode*> DataFlowGraph::newDef(NodeAddr<InstrNode*> Owner, in newDef()
1005 void DataFlowGraph::pushDefs(NodeAddr<InstrNode*> IA, DefStackMap &DefM) { in pushDefs()
1055 NodeList DataFlowGraph::getRelatedRefs(NodeAddr<InstrNode*> IA, in getRelatedRefs()
1082 NodeAddr<RefNode*> DataFlowGraph::getNextRelated(NodeAddr<InstrNode*> IA, in getNextRelated()
1121 DataFlowGraph::locateNextRef(NodeAddr<InstrNode*> IA, NodeAddr<RefNode*> RA, in locateNextRef()
[all …]
DRDFLiveness.cpp137 auto Block = [this] (NodeAddr<InstrNode*> IA) -> MachineBasicBlock* { in getAllReachingDefs()
149 auto OA = DFG.addr<InstrNode*>(A), OB = DFG.addr<InstrNode*>(B); in getAllReachingDefs()
202 auto TA = DFG.addr<InstrNode*>(T); in getAllReachingDefs()
532 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) { in computeLiveIns()
732 bool Liveness::isRestricted(NodeAddr<InstrNode*> IA, NodeAddr<RefNode*> RA, in isRestricted()
842 NodeAddr<InstrNode*> IA = DA.Addr->getOwner(DFG); in traverse()
872 NodeAddr<InstrNode*> IA = TA.Addr->getOwner(DFG); in traverse()
896 NodeAddr<InstrNode*> IA = I; in traverse()
DRDFCopy.h48 void updateMap(NodeAddr<InstrNode*> IA);
DRDFDeadCode.h60 void scanInstr(NodeAddr<InstrNode*> IA, SetQueue<NodeId> &WorkQ);
DRDFLiveness.h99 bool isRestricted(NodeAddr<InstrNode*> IA, NodeAddr<RefNode*> RA,