Home
last modified time | relevance | path

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

12

/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()
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()
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()
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);
/external/llvm-project/llvm/lib/Target/Hexagon/
DRDFDeadCode.cpp82 void DeadCodeElimination::scanInstr(NodeAddr<InstrNode*> IA, in scanInstr()
96 NodeAddr<InstrNode*> IA = DA.Addr->getOwner(DFG); in processDef()
129 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) in collect()
150 auto IsDead = [this] (NodeAddr<InstrNode*> IA) -> bool { in collect()
158 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) { in collect()
168 dbgs() << "Dead instr: " << PrintNode<InstrNode*>(IA, DFG) << "\n"; in collect()
200 DINs.push_back(DFG.addr<InstrNode*>(I)); in erase()
231 for (NodeAddr<InstrNode*> IA : DINs) { in erase()
DRDFCopy.cpp72 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) { in scanBlock()
89 NodeAddr<InstrNode*> IA) { in getLocalReachingDef()
138 auto SA = DFG.addr<InstrNode*>(C); in run()
164 NodeAddr<InstrNode*> IA = UA.Addr->getOwner(DFG); in run()
DHexagonRDFOpt.cpp95 bool rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> &Remove);
96 void removeOperand(NodeAddr<InstrNode*> IA, unsigned OpNum);
189 void HexagonDCE::removeOperand(NodeAddr<InstrNode*> IA, unsigned OpNum) { in removeOperand()
215 bool HexagonDCE::rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> &Remove) { in rewrite()
DRDFCopy.h54 NodeId getLocalReachingDef(RegisterRef RefRR, NodeAddr<InstrNode*> IA);
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
DRDFDeadCode.cpp82 void DeadCodeElimination::scanInstr(NodeAddr<InstrNode*> IA, in scanInstr()
96 NodeAddr<InstrNode*> IA = DA.Addr->getOwner(DFG); in processDef()
129 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) in collect()
150 auto IsDead = [this] (NodeAddr<InstrNode*> IA) -> bool { in collect()
158 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) { in collect()
168 dbgs() << "Dead instr: " << PrintNode<InstrNode*>(IA, DFG) << "\n"; in collect()
200 DINs.push_back(DFG.addr<InstrNode*>(I)); in erase()
231 for (NodeAddr<InstrNode*> IA : DINs) { in erase()
DRDFGraph.h610 struct InstrNode : public CodeNode { struct
614 struct PhiNode : public InstrNode {
620 struct StmtNode : public InstrNode {
736 void pushAllDefs(NodeAddr<InstrNode*> IA, DefStackMap &DM);
754 NodeAddr<RefNode*> getNextRelated(NodeAddr<InstrNode*> IA,
756 NodeAddr<RefNode*> getNextImp(NodeAddr<InstrNode*> IA,
758 NodeAddr<RefNode*> getNextImp(NodeAddr<InstrNode*> IA,
760 NodeAddr<RefNode*> getNextShadow(NodeAddr<InstrNode*> IA,
762 NodeAddr<RefNode*> getNextShadow(NodeAddr<InstrNode*> IA,
765 NodeList getRelatedRefs(NodeAddr<InstrNode*> IA,
[all …]
DRDFCopy.cpp72 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) { in scanBlock()
89 NodeAddr<InstrNode*> IA) { in getLocalReachingDef()
138 auto SA = DFG.addr<InstrNode*>(C); in run()
164 NodeAddr<InstrNode*> IA = UA.Addr->getOwner(DFG); in run()
DRDFGraph.cpp250 const Print<NodeAddr<InstrNode*>> &P) { in operator <<()
294 OS << PrintNode<InstrNode*>(I, P.G) << '\n'; in operator <<()
533 NodeAddr<NodeBase*> InstrNode::getOwner(const DataFlowGraph &G) { in getOwner()
806 NodeAddr<UseNode*> DataFlowGraph::newUse(NodeAddr<InstrNode*> Owner, in newUse()
822 NodeAddr<DefNode*> DataFlowGraph::newDef(NodeAddr<InstrNode*> Owner, in newDef()
829 NodeAddr<DefNode*> DataFlowGraph::newDef(NodeAddr<InstrNode*> Owner, in newDef()
889 for (NodeAddr<InstrNode*> IA : BA.Addr->members(*this)) in build()
1023 void DataFlowGraph::pushAllDefs(NodeAddr<InstrNode*> IA, DefStackMap &DefM) { in pushAllDefs()
1030 void DataFlowGraph::pushClobbers(NodeAddr<InstrNode*> IA, DefStackMap &DefM) { in pushClobbers()
1074 void DataFlowGraph::pushDefs(NodeAddr<InstrNode*> IA, DefStackMap &DefM) { in pushDefs()
[all …]
DHexagonRDFOpt.cpp95 bool rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> &Remove);
96 void removeOperand(NodeAddr<InstrNode*> IA, unsigned OpNum);
189 void HexagonDCE::removeOperand(NodeAddr<InstrNode*> IA, unsigned OpNum) { in removeOperand()
215 bool HexagonDCE::rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> &Remove) { in rewrite()
DRDFLiveness.cpp169 auto Block = [this] (NodeAddr<InstrNode*> IA) -> MachineBasicBlock* { in getAllReachingDefs()
181 auto OA = DFG.addr<InstrNode*>(A), OB = DFG.addr<InstrNode*>(B); in getAllReachingDefs()
233 auto TA = DFG.addr<InstrNode*>(T); in getAllReachingDefs()
323 NodeAddr<InstrNode*> IA) { in getNearestAliasedRef()
329 [FindId] (const NodeAddr<InstrNode*> T) { in getNearestAliasedRef()
338 for (NodeAddr<InstrNode*> I : make_range(B, E)) { in getNearestAliasedRef()
688 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) { in computeLiveIns()
1001 NodeAddr<InstrNode*> IA = DA.Addr->getOwner(DFG); in traverse()
1035 NodeAddr<InstrNode*> ITA = TA.Addr->getOwner(DFG); in traverse()
1070 NodeAddr<InstrNode*> IA = I; in traverse()
DRDFCopy.h54 NodeId getLocalReachingDef(RegisterRef RefRR, NodeAddr<InstrNode*> IA);
DRDFDeadCode.h59 void scanInstr(NodeAddr<InstrNode*> IA, SetQueue<NodeId> &WorkQ);
/external/llvm-project/llvm/utils/TableGen/GlobalISel/
DGIMatchTree.h205 const GIMatchDagInstr *InstrNode; variable
208 GIMatchTreeInstrInfo(unsigned ID, const GIMatchDagInstr *InstrNode) in GIMatchTreeInstrInfo() argument
209 : ID(ID), InstrNode(InstrNode) {} in GIMatchTreeInstrInfo()
212 const GIMatchDagInstr *getInstrNode() const { return InstrNode; } in getInstrNode()
225 const GIMatchDagInstr *InstrNode; variable
229 GIMatchTreeOperandInfo(const GIMatchDagInstr *InstrNode, unsigned OpIdx) in GIMatchTreeOperandInfo() argument
230 : InstrNode(InstrNode), OpIdx(OpIdx) {} in GIMatchTreeOperandInfo()
232 const GIMatchDagInstr *getInstrNode() const { return InstrNode; } in getInstrNode()
/external/llvm-project/llvm/include/llvm/CodeGen/
DRDFGraph.h610 struct InstrNode : public CodeNode { struct
614 struct PhiNode : public InstrNode {
620 struct StmtNode : public InstrNode {
736 void pushAllDefs(NodeAddr<InstrNode*> IA, DefStackMap &DM);
754 NodeAddr<RefNode*> getNextRelated(NodeAddr<InstrNode*> IA,
756 NodeAddr<RefNode*> getNextShadow(NodeAddr<InstrNode*> IA,
758 NodeAddr<RefNode*> getNextShadow(NodeAddr<InstrNode*> IA,
761 NodeList getRelatedRefs(NodeAddr<InstrNode*> IA,
820 NodeAddr<UseNode*> newUse(NodeAddr<InstrNode*> Owner,
825 NodeAddr<DefNode*> newDef(NodeAddr<InstrNode*> Owner,
[all …]
/external/llvm-project/llvm/lib/CodeGen/
DRDFLiveness.cpp163 auto Block = [this] (NodeAddr<InstrNode*> IA) -> MachineBasicBlock* { in getAllReachingDefs()
176 std::map<NodeId, NodeAddr<InstrNode*>> Owners; in getAllReachingDefs()
184 NodeAddr<InstrNode*> IA = TA.Addr->getOwner(DFG); in getAllReachingDefs()
192 NodeAddr<InstrNode*> OA = DFG.addr<InstrNode*>(A); in getAllReachingDefs()
193 NodeAddr<InstrNode*> OB = DFG.addr<InstrNode*>(B); in getAllReachingDefs()
273 auto TA = DFG.addr<InstrNode*>(T); in getAllReachingDefs()
363 NodeAddr<InstrNode*> IA) { in getNearestAliasedRef()
369 [FindId] (const NodeAddr<InstrNode*> T) { in getNearestAliasedRef()
378 for (NodeAddr<InstrNode*> I : make_range(B, E)) { in getNearestAliasedRef()
745 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) { in computeLiveIns()
[all …]
DRDFGraph.cpp250 const Print<NodeAddr<InstrNode*>> &P) { in operator <<()
294 OS << PrintNode<InstrNode*>(I, P.G) << '\n'; in operator <<()
533 NodeAddr<NodeBase*> InstrNode::getOwner(const DataFlowGraph &G) { in getOwner()
808 NodeAddr<UseNode*> DataFlowGraph::newUse(NodeAddr<InstrNode*> Owner, in newUse()
824 NodeAddr<DefNode*> DataFlowGraph::newDef(NodeAddr<InstrNode*> Owner, in newDef()
831 NodeAddr<DefNode*> DataFlowGraph::newDef(NodeAddr<InstrNode*> Owner, in newDef()
891 for (NodeAddr<InstrNode*> IA : BA.Addr->members(*this)) in build()
1020 void DataFlowGraph::pushAllDefs(NodeAddr<InstrNode*> IA, DefStackMap &DefM) { in pushAllDefs()
1027 void DataFlowGraph::pushClobbers(NodeAddr<InstrNode*> IA, DefStackMap &DefM) { in pushClobbers()
1071 void DataFlowGraph::pushDefs(NodeAddr<InstrNode*> IA, DefStackMap &DefM) { in pushDefs()
[all …]

12