Home
last modified time | relevance | path

Searched refs:NodeAddr (Results 1 – 20 of 20) sorted by relevance

/external/llvm/lib/Target/Hexagon/
DRDFGraph.h294 template <typename T> struct NodeAddr { struct
295 NodeAddr() : Addr(nullptr), Id(0) {} in NodeAddr() function
296 NodeAddr(T A, NodeId I) : Addr(A), Id(I) {} in NodeAddr() argument
297 NodeAddr(const NodeAddr&) = default;
298 NodeAddr &operator= (const NodeAddr&) = default; argument
300 bool operator== (const NodeAddr<T> &NA) const {
304 bool operator!= (const NodeAddr<T> &NA) const {
309 template <typename S> NodeAddr(const NodeAddr<S> &NA) in NodeAddr() function
349 NodeAddr<NodeBase*> New();
427 void append(NodeAddr<NodeBase*> NA);
[all …]
DRDFGraph.cpp87 void printRefHeader(raw_ostream &OS, const NodeAddr<RefNode*> RA, in printRefHeader()
97 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<DefNode*>> &P) { in operator <<()
115 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<UseNode*>> &P) { in operator <<()
128 const Print<NodeAddr<PhiUseNode*>> &P) { in operator <<()
143 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<RefNode*>> &P) { in operator <<()
192 for (NodeAddr<T> A : P.List) { in operator <<()
202 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<PhiNode*>> &P) { in operator <<()
210 const Print<NodeAddr<StmtNode*>> &P) { in operator <<()
219 const Print<NodeAddr<InstrNode*>> &P) { in operator <<()
236 const Print<NodeAddr<BlockNode*>> &P) { in operator <<()
[all …]
DRDFDeadCode.cpp71 void DeadCodeElimination::scanInstr(NodeAddr<InstrNode*> IA, in scanInstr()
75 if (!isLiveInstr(NodeAddr<StmtNode*>(IA).Addr->getCode())) in scanInstr()
77 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG)) { in scanInstr()
83 void DeadCodeElimination::processDef(NodeAddr<DefNode*> DA, in processDef()
85 NodeAddr<InstrNode*> IA = DA.Addr->getOwner(DFG); in processDef()
86 for (NodeAddr<UseNode*> UA : IA.Addr->members_if(DFG.IsUse, DFG)) { in processDef()
90 for (NodeAddr<DefNode*> TA : DFG.getRelatedRefs(IA, DA)) in processDef()
94 void DeadCodeElimination::processUse(NodeAddr<UseNode*> UA, in processUse()
96 for (NodeAddr<DefNode*> DA : LV.getAllReachingDefs(UA)) { in processUse()
117 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG)) in collect()
[all …]
DHexagonOptAddrMode.cpp77 bool processBlock(NodeAddr<BlockNode *> BA);
79 NodeAddr<UseNode *> UseN, unsigned UseMOnum);
83 bool canRemoveAddasl(NodeAddr<StmtNode *> AddAslSN, MachineInstr *MI,
85 void getAllRealUses(NodeAddr<StmtNode *> SN, NodeList &UNodeList);
86 bool allValidCandidates(NodeAddr<StmtNode *> SA, NodeList &UNodeList);
88 void updateMap(NodeAddr<InstrNode *> IA);
93 bool changeAddAsl(NodeAddr<UseNode *> AddAslUN, MachineInstr *AddAslMI,
139 bool HexagonOptAddrMode::canRemoveAddasl(NodeAddr<StmtNode *> AddAslSN, in canRemoveAddasl()
150 for (NodeAddr<UseNode *> UA : AddAslSN.Addr->members_if(DFG->IsUse, *DFG)) { in canRemoveAddasl()
159 NodeAddr<UseNode *> UA = *I; in canRemoveAddasl()
[all …]
DRDFLiveness.cpp88 NodeAddr<RefNode*> RefA, bool FullChain, const RegisterSet &DefRRs) { in getAllReachingDefs()
120 if (auto RD = NodeAddr<RefNode*>(S).Addr->getReachingDef()) in getAllReachingDefs()
137 auto Block = [this] (NodeAddr<InstrNode*> IA) -> MachineBasicBlock* { in getAllReachingDefs()
139 return NodeAddr<StmtNode*>(IA).Addr->getCode()->getParent(); in getAllReachingDefs()
141 NodeAddr<PhiNode*> PA = IA; in getAllReachingDefs()
142 NodeAddr<BlockNode*> BA = PA.Addr->getOwner(DFG); in getAllReachingDefs()
159 auto CA = NodeAddr<StmtNode*>(OA).Addr->getCode(); in getAllReachingDefs()
160 auto CB = NodeAddr<StmtNode*>(OB).Addr->getCode(); in getAllReachingDefs()
195 auto DefInSet = [&Defs] (NodeAddr<RefNode*> TA) -> bool { in getAllReachingDefs()
205 for (NodeAddr<DefNode*> DA : TA.Addr->members_if(DefInSet, DFG)) { in getAllReachingDefs()
[all …]
DRDFLiveness.h40 NodeList getAllReachingDefs(RegisterRef RefRR, NodeAddr<RefNode*> RefA,
42 NodeList getAllReachingDefs(NodeAddr<RefNode*> RefA);
43 NodeSet getAllReachingDefsRec(RegisterRef RefRR, NodeAddr<RefNode*> RefA,
45 NodeSet getAllReachedUses(RegisterRef RefRR, NodeAddr<DefNode*> DefA,
99 bool isRestricted(NodeAddr<InstrNode*> IA, NodeAddr<RefNode*> RA,
101 RegisterRef getRestrictedRegRef(NodeAddr<RefNode*> RA) const;
DHexagonRDFOpt.cpp89 bool rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> &Remove);
90 void removeOperand(NodeAddr<InstrNode*> IA, unsigned OpNum);
147 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG)) { in run()
149 NodeAddr<StmtNode*> SA = TA; in run()
150 for (NodeAddr<RefNode*> RA : SA.Addr->members(DFG)) { in run()
175 void HexagonDCE::removeOperand(NodeAddr<InstrNode*> IA, unsigned OpNum) { in removeOperand()
176 MachineInstr *MI = NodeAddr<StmtNode*>(IA).Addr->getCode(); in removeOperand()
186 for (NodeAddr<RefNode*> RA : Refs) in removeOperand()
191 for (NodeAddr<RefNode*> RA : Refs) { in removeOperand()
201 bool HexagonDCE::rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> &Remove) { in rewrite()
[all …]
DRDFCopy.cpp77 void CopyPropagation::recordCopy(NodeAddr<StmtNode*> SA, EqualityMap &EM) { in recordCopy()
92 void CopyPropagation::updateMap(NodeAddr<InstrNode*> IA) { in updateMap()
94 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG)) in updateMap()
122 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) { in scanBlock()
124 NodeAddr<StmtNode*> SA = IA; in scanBlock()
182 for (NodeAddr<DefNode*> DA : SA.Addr->members_if(DFG.IsDef, DFG)) { in run()
203 NodeAddr<InstrNode*> IA = UA.Addr->getOwner(DFG); in run()
214 << *NodeAddr<StmtNode*>(IA).Addr->getCode(); in run()
DRDFDeadCode.h60 void scanInstr(NodeAddr<InstrNode*> IA, SetQueue<NodeId> &WorkQ);
61 void processDef(NodeAddr<DefNode*> DA, SetQueue<NodeId> &WorkQ);
62 void processUse(NodeAddr<UseNode*> UA, SetQueue<NodeId> &WorkQ);
DRDFCopy.h47 void recordCopy(NodeAddr<StmtNode*> SA, EqualityMap &EM);
48 void updateMap(NodeAddr<InstrNode*> IA);
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Hexagon/
DRDFGraph.h335 template <typename T> struct NodeAddr { struct
336 NodeAddr() = default;
337 NodeAddr(T A, NodeId I) : Addr(A), Id(I) {} in NodeAddr() argument
341 template <typename S> NodeAddr(const NodeAddr<S> &NA) in NodeAddr() argument
344 bool operator== (const NodeAddr<T> &NA) const {
348 bool operator!= (const NodeAddr<T> &NA) const {
392 NodeAddr<NodeBase*> New();
465 void append(NodeAddr<NodeBase*> NA);
513 using NodeList = SmallVector<NodeAddr<NodeBase *>, 4>;
554 NodeAddr<RefNode*> getNextRef(RegisterRef RR, Predicate P, bool NextOnly,
[all …]
DRDFGraph.cpp111 static void printRefHeader(raw_ostream &OS, const NodeAddr<RefNode*> RA, in printRefHeader()
120 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<DefNode*>> &P) { in operator <<()
138 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<UseNode*>> &P) { in operator <<()
151 const Print<NodeAddr<PhiUseNode*>> &P) { in operator <<()
166 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<RefNode*>> &P) { in operator <<()
217 for (NodeAddr<T> A : P.List) { in operator <<()
228 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<PhiNode*>> &P) { in operator <<()
236 const Print<NodeAddr<StmtNode*>> &P) { in operator <<()
263 const Print<NodeAddr<InstrNode*>> &P) { in operator <<()
280 const Print<NodeAddr<BlockNode*>> &P) { in operator <<()
[all …]
DRDFDeadCode.cpp82 void DeadCodeElimination::scanInstr(NodeAddr<InstrNode*> IA, in scanInstr()
86 if (!isLiveInstr(NodeAddr<StmtNode*>(IA).Addr->getCode())) in scanInstr()
88 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG)) { in scanInstr()
94 void DeadCodeElimination::processDef(NodeAddr<DefNode*> DA, in processDef()
96 NodeAddr<InstrNode*> IA = DA.Addr->getOwner(DFG); in processDef()
97 for (NodeAddr<UseNode*> UA : IA.Addr->members_if(DFG.IsUse, DFG)) { in processDef()
101 for (NodeAddr<DefNode*> TA : DFG.getRelatedRefs(IA, DA)) in processDef()
105 void DeadCodeElimination::processUse(NodeAddr<UseNode*> UA, in processUse()
107 for (NodeAddr<DefNode*> DA : LV.getAllReachingDefs(UA)) { in processUse()
128 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG)) in collect()
[all …]
DHexagonOptAddrMode.cpp91 bool processBlock(NodeAddr<BlockNode *> BA);
93 NodeAddr<UseNode *> UseN, unsigned UseMOnum);
94 bool processAddUses(NodeAddr<StmtNode *> AddSN, MachineInstr *AddMI,
100 bool canRemoveAddasl(NodeAddr<StmtNode *> AddAslSN, MachineInstr &MI,
102 bool isSafeToExtLR(NodeAddr<StmtNode *> SN, MachineInstr *MI,
104 void getAllRealUses(NodeAddr<StmtNode *> SN, NodeList &UNodeList);
105 bool allValidCandidates(NodeAddr<StmtNode *> SA, NodeList &UNodeList);
110 bool changeAddAsl(NodeAddr<UseNode *> AddAslUN, MachineInstr *AddAslMI,
158 bool HexagonOptAddrMode::canRemoveAddasl(NodeAddr<StmtNode *> AddAslSN, in canRemoveAddasl()
169 for (NodeAddr<UseNode *> UA : AddAslSN.Addr->members_if(DFG->IsUse, *DFG)) { in canRemoveAddasl()
[all …]
DRDFLiveness.cpp109 NodeAddr<RefNode*> RefA, bool TopShadows, bool FullChain, in getAllReachingDefs()
132 if (NodeId RD = NodeAddr<RefNode*>(S).Addr->getReachingDef()) in getAllReachingDefs()
154 if (NodeId RD = NodeAddr<RefNode*>(S).Addr->getReachingDef()) in getAllReachingDefs()
171 auto Block = [this] (NodeAddr<InstrNode*> IA) -> MachineBasicBlock* { in getAllReachingDefs()
173 return NodeAddr<StmtNode*>(IA).Addr->getCode()->getParent(); in getAllReachingDefs()
175 NodeAddr<PhiNode*> PA = IA; in getAllReachingDefs()
176 NodeAddr<BlockNode*> BA = PA.Addr->getOwner(DFG); in getAllReachingDefs()
193 MachineInstr *CA = NodeAddr<StmtNode*>(OA).Addr->getCode(); in getAllReachingDefs()
194 MachineInstr *CB = NodeAddr<StmtNode*>(OB).Addr->getCode(); in getAllReachingDefs()
228 auto DefInSet = [&Defs] (NodeAddr<RefNode*> TA) -> bool { in getAllReachingDefs()
[all …]
DRDFLiveness.h59 NodeList getAllReachingDefs(RegisterRef RefRR, NodeAddr<RefNode*> RefA,
62 NodeList getAllReachingDefs(NodeAddr<RefNode*> RefA) { in getAllReachingDefs()
67 NodeList getAllReachingDefs(RegisterRef RefRR, NodeAddr<RefNode*> RefA) { in getAllReachingDefs()
71 NodeSet getAllReachedUses(RegisterRef RefRR, NodeAddr<DefNode*> DefA,
74 NodeSet getAllReachedUses(RegisterRef RefRR, NodeAddr<DefNode*> DefA) { in getAllReachedUses()
79 NodeAddr<RefNode*> RefA, NodeSet &Visited, const NodeSet &Defs);
81 NodeAddr<RefNode*> getNearestAliasedRef(RegisterRef RefRR,
82 NodeAddr<InstrNode*> IA);
142 NodeAddr<RefNode*> RefA, NodeSet &Visited, const NodeSet &Defs,
DHexagonRDFOpt.cpp95 bool rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> &Remove);
96 void removeOperand(NodeAddr<InstrNode*> IA, unsigned OpNum);
163 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG)) { in run()
165 NodeAddr<StmtNode*> SA = TA; in run()
166 for (NodeAddr<RefNode*> RA : SA.Addr->members(DFG)) { in run()
189 void HexagonDCE::removeOperand(NodeAddr<InstrNode*> IA, unsigned OpNum) { in removeOperand()
190 MachineInstr *MI = NodeAddr<StmtNode*>(IA).Addr->getCode(); in removeOperand()
201 for (NodeAddr<RefNode*> RA : Refs) in removeOperand()
206 for (NodeAddr<RefNode*> RA : Refs) { in removeOperand()
215 bool HexagonDCE::rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> &Remove) { in rewrite()
[all …]
DRDFCopy.cpp64 void CopyPropagation::recordCopy(NodeAddr<StmtNode*> SA, EqualityMap &EM) { in recordCopy()
71 NodeAddr<BlockNode*> BA = DFG.findBlock(B); in scanBlock()
73 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) { in scanBlock()
75 NodeAddr<StmtNode*> SA = IA; in scanBlock()
90 NodeAddr<InstrNode*> IA) { in getLocalReachingDef()
91 NodeAddr<RefNode*> RA = L.getNearestAliasedRef(RefRR, IA); in getLocalReachingDef()
145 for (NodeAddr<DefNode*> DA : SA.Addr->members_if(DFG.IsDef, DFG)) { in run()
165 NodeAddr<InstrNode*> IA = UA.Addr->getOwner(DFG); in run()
177 << *NodeAddr<StmtNode*>(IA).Addr->getCode(); in run()
DRDFDeadCode.h60 void scanInstr(NodeAddr<InstrNode*> IA, SetQueue<NodeId> &WorkQ);
61 void processDef(NodeAddr<DefNode*> DA, SetQueue<NodeId> &WorkQ);
62 void processUse(NodeAddr<UseNode*> UA, SetQueue<NodeId> &WorkQ);
DRDFCopy.h53 void recordCopy(NodeAddr<StmtNode*> SA, EqualityMap &EM);
55 NodeId getLocalReachingDef(RegisterRef RefRR, NodeAddr<InstrNode*> IA);