| /external/llvm/lib/Target/Hexagon/ |
| RDFGraph.h | 294 template <typename T> struct NodeAddr {
295 NodeAddr() : Addr(nullptr), Id(0) {}
296 NodeAddr(T A, NodeId I) : Addr(A), Id(I) {}
297 NodeAddr(const NodeAddr&) = default;
298 NodeAddr &operator= (const NodeAddr&) = default;
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
[all...] |
| RDFDeadCode.cpp | 71 void DeadCodeElimination::scanInstr(NodeAddr<InstrNode*> IA,
75 if (!isLiveInstr(NodeAddr<StmtNode*>(IA).Addr->getCode()))
77 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG)) {
83 void DeadCodeElimination::processDef(NodeAddr<DefNode*> DA,
85 NodeAddr<InstrNode*> IA = DA.Addr->getOwner(DFG);
86 for (NodeAddr<UseNode*> UA : IA.Addr->members_if(DFG.IsUse, DFG)) {
90 for (NodeAddr<DefNode*> TA : DFG.getRelatedRefs(IA, DA))
94 void DeadCodeElimination::processUse(NodeAddr<UseNode*> UA,
96 for (NodeAddr<DefNode*> DA : LV.getAllReachingDefs(UA)) {
117 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG)
[all...] |
| RDFLiveness.h | 40 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;
|
| RDFGraph.cpp | 87 void printRefHeader(raw_ostream &OS, const NodeAddr<RefNode*> RA,
97 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<DefNode*>> &P) {
115 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<UseNode*>> &P) {
128 const Print<NodeAddr<PhiUseNode*>> &P) {
143 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<RefNode*>> &P) {
192 for (NodeAddr<T> A : P.List) {
202 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<PhiNode*>> &P) {
210 const Print<NodeAddr<StmtNode*>> &P) {
219 const Print<NodeAddr<InstrNode*>> &P) {
236 const Print<NodeAddr<BlockNode*>> &P)
[all...] |
| RDFCopy.h | 47 void recordCopy(NodeAddr<StmtNode*> SA, EqualityMap &EM);
48 void updateMap(NodeAddr<InstrNode*> IA);
|
| RDFDeadCode.h | 60 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);
|
| RDFLiveness.cpp | 88 NodeAddr<RefNode*> RefA, bool FullChain, const RegisterSet &DefRRs) {
120 if (auto RD = NodeAddr<RefNode*>(S).Addr->getReachingDef())
137 auto Block = [this] (NodeAddr<InstrNode*> IA) -> MachineBasicBlock* {
139 return NodeAddr<StmtNode*>(IA).Addr->getCode()->getParent();
141 NodeAddr<PhiNode*> PA = IA;
142 NodeAddr<BlockNode*> BA = PA.Addr->getOwner(DFG);
159 auto CA = NodeAddr<StmtNode*>(OA).Addr->getCode();
160 auto CB = NodeAddr<StmtNode*>(OB).Addr->getCode();
195 auto DefInSet = [&Defs] (NodeAddr<RefNode*> TA) -> bool {
205 for (NodeAddr<DefNode*> DA : TA.Addr->members_if(DefInSet, DFG))
[all...] |
| HexagonOptAddrMode.cpp | 77 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,
150 for (NodeAddr<UseNode *> UA : AddAslSN.Addr->members_if(DFG->IsUse, *DFG)) {
159 NodeAddr<UseNode *> UA = *I
[all...] |
| HexagonRDFOpt.cpp | 89 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)) {
149 NodeAddr<StmtNode*> SA = TA;
150 for (NodeAddr<RefNode*> RA : SA.Addr->members(DFG)) {
175 void HexagonDCE::removeOperand(NodeAddr<InstrNode*> IA, unsigned OpNum) {
176 MachineInstr *MI = NodeAddr<StmtNode*>(IA).Addr->getCode();
186 for (NodeAddr<RefNode*> RA : Refs)
191 for (NodeAddr<RefNode*> RA : Refs) {
201 bool HexagonDCE::rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> &Remove)
[all...] |
| RDFCopy.cpp | 77 void CopyPropagation::recordCopy(NodeAddr<StmtNode*> SA, EqualityMap &EM) {
92 void CopyPropagation::updateMap(NodeAddr<InstrNode*> IA) {
94 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG))
122 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) {
124 NodeAddr<StmtNode*> SA = IA;
182 for (NodeAddr<DefNode*> DA : SA.Addr->members_if(DFG.IsDef, DFG)) {
203 NodeAddr<InstrNode*> IA = UA.Addr->getOwner(DFG);
214 << *NodeAddr<StmtNode*>(IA).Addr->getCode();
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Hexagon/ |
| RDFGraph.h | 335 template <typename T> struct NodeAddr {
336 NodeAddr() = default;
337 NodeAddr(T A, NodeId I) : Addr(A), Id(I) {}
341 template <typename S> NodeAddr(const NodeAddr<S> &NA)
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>
[all...] |
| RDFDeadCode.cpp | 82 void DeadCodeElimination::scanInstr(NodeAddr<InstrNode*> IA,
86 if (!isLiveInstr(NodeAddr<StmtNode*>(IA).Addr->getCode()))
88 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG)) {
94 void DeadCodeElimination::processDef(NodeAddr<DefNode*> DA,
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))
105 void DeadCodeElimination::processUse(NodeAddr<UseNode*> UA,
107 for (NodeAddr<DefNode*> DA : LV.getAllReachingDefs(UA)) {
128 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG)
[all...] |
| RDFGraph.cpp | 111 static void printRefHeader(raw_ostream &OS, const NodeAddr<RefNode*> RA,
120 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<DefNode*>> &P) {
138 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<UseNode*>> &P) {
151 const Print<NodeAddr<PhiUseNode*>> &P) {
166 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<RefNode*>> &P) {
217 for (NodeAddr<T> A : P.List) {
228 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<PhiNode*>> &P) {
236 const Print<NodeAddr<StmtNode*>> &P) {
263 const Print<NodeAddr<InstrNode*>> &P) {
280 const Print<NodeAddr<BlockNode*>> &P)
[all...] |
| RDFLiveness.h | 59 NodeList getAllReachingDefs(RegisterRef RefRR, NodeAddr<RefNode*> RefA,
62 NodeList getAllReachingDefs(NodeAddr<RefNode*> RefA) {
67 NodeList getAllReachingDefs(RegisterRef RefRR, NodeAddr<RefNode*> RefA) {
71 NodeSet getAllReachedUses(RegisterRef RefRR, NodeAddr<DefNode*> DefA,
74 NodeSet getAllReachedUses(RegisterRef RefRR, NodeAddr<DefNode*> DefA) {
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,
|
| HexagonOptAddrMode.cpp | 91 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,
169 for (NodeAddr<UseNode *> UA : AddAslSN.Addr->members_if(DFG->IsUse, *DFG))
[all...] |
| RDFCopy.h | 53 void recordCopy(NodeAddr<StmtNode*> SA, EqualityMap &EM);
55 NodeId getLocalReachingDef(RegisterRef RefRR, NodeAddr<InstrNode*> IA);
|
| RDFDeadCode.h | 60 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);
|
| RDFLiveness.cpp | 109 NodeAddr<RefNode*> RefA, bool TopShadows, bool FullChain,
132 if (NodeId RD = NodeAddr<RefNode*>(S).Addr->getReachingDef())
154 if (NodeId RD = NodeAddr<RefNode*>(S).Addr->getReachingDef())
171 auto Block = [this] (NodeAddr<InstrNode*> IA) -> MachineBasicBlock* {
173 return NodeAddr<StmtNode*>(IA).Addr->getCode()->getParent();
175 NodeAddr<PhiNode*> PA = IA;
176 NodeAddr<BlockNode*> BA = PA.Addr->getOwner(DFG);
193 MachineInstr *CA = NodeAddr<StmtNode*>(OA).Addr->getCode();
194 MachineInstr *CB = NodeAddr<StmtNode*>(OB).Addr->getCode();
228 auto DefInSet = [&Defs] (NodeAddr<RefNode*> TA) -> bool
[all...] |
| HexagonRDFOpt.cpp | 95 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)) {
165 NodeAddr<StmtNode*> SA = TA;
166 for (NodeAddr<RefNode*> RA : SA.Addr->members(DFG)) {
189 void HexagonDCE::removeOperand(NodeAddr<InstrNode*> IA, unsigned OpNum) {
190 MachineInstr *MI = NodeAddr<StmtNode*>(IA).Addr->getCode();
201 for (NodeAddr<RefNode*> RA : Refs)
206 for (NodeAddr<RefNode*> RA : Refs) {
215 bool HexagonDCE::rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> &Remove)
[all...] |
| RDFCopy.cpp | 64 void CopyPropagation::recordCopy(NodeAddr<StmtNode*> SA, EqualityMap &EM) {
71 NodeAddr<BlockNode*> BA = DFG.findBlock(B);
73 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) {
75 NodeAddr<StmtNode*> SA = IA;
90 NodeAddr<InstrNode*> IA) {
91 NodeAddr<RefNode*> RA = L.getNearestAliasedRef(RefRR, IA);
145 for (NodeAddr<DefNode*> DA : SA.Addr->members_if(DFG.IsDef, DFG)) {
165 NodeAddr<InstrNode*> IA = UA.Addr->getOwner(DFG);
177 << *NodeAddr<StmtNode*>(IA).Addr->getCode();
|
