Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/llvm/lib/Target/Hexagon/
H A DRDFGraph.h341 template <typename S> NodeAddr(const NodeAddr<S> &NA) in NodeAddr() argument
757 NodeAddr<RefNode*> getNextImp(NodeAddr<InstrNode*> IA,
759 NodeAddr<RefNode*> getNextImp(NodeAddr<InstrNode*> IA,
761 NodeAddr<RefNode*> getNextShadow(NodeAddr<InstrNode*> IA,
825 NodeAddr<UseNode*> newUse(NodeAddr<InstrNode*> Owner,
830 NodeAddr<DefNode*> newDef(NodeAddr<InstrNode*> Owner,
832 NodeAddr<DefNode*> newDef(NodeAddr<InstrNode*> Owner,
834 NodeAddr<PhiNode*> newPhi(NodeAddr<BlockNode*> Owner);
835 NodeAddr<StmtNode*> newStmt(NodeAddr<BlockNode*> Owner,
837 NodeAddr<BlockNode*> newBlock(NodeAddr<FuncNode*> Owner,
[all …]
H A DRDFGraph.cpp825 NodeAddr<UseNode*> DataFlowGraph::newUse(NodeAddr<InstrNode*> Owner, in newUse()
832 NodeAddr<PhiUseNode*> DataFlowGraph::newPhiUse(NodeAddr<PhiNode*> Owner, in newPhiUse()
841 NodeAddr<DefNode*> DataFlowGraph::newDef(NodeAddr<InstrNode*> Owner, in newDef()
848 NodeAddr<DefNode*> DataFlowGraph::newDef(NodeAddr<InstrNode*> Owner, in newDef()
856 NodeAddr<PhiNode*> DataFlowGraph::newPhi(NodeAddr<BlockNode*> Owner) { in newPhi()
862 NodeAddr<StmtNode*> DataFlowGraph::newStmt(NodeAddr<BlockNode*> Owner, in newStmt()
870 NodeAddr<BlockNode*> DataFlowGraph::newBlock(NodeAddr<FuncNode*> Owner, in newBlock()
1211 std::pair<NodeAddr<RefNode*>,NodeAddr<RefNode*>>
1234 NodeAddr<RefNode*> DataFlowGraph::getNextShadow(NodeAddr<InstrNode*> IA, in getNextShadow()
1585 void DataFlowGraph::linkRefUp(NodeAddr<InstrNode*> IA, NodeAddr<T> TA, in linkRefUp()
[all …]
H A DRDFDeadCode.cpp88 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()
101 for (NodeAddr<DefNode*> TA : DFG.getRelatedRefs(IA, DA)) in processDef()
105 void DeadCodeElimination::processUse(NodeAddr<UseNode*> UA, in processUse()
129 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) in collect()
159 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG)) in collect()
209 auto UsesFirst = [] (NodeAddr<RefNode*> A, NodeAddr<RefNode*> B) -> bool { in erase()
221 for (NodeAddr<RefNode*> RA : DRNs) { in erase()
231 for (NodeAddr<InstrNode*> IA : DINs) { in erase()
[all …]
H A DHexagonOptAddrMode.cpp91 bool processBlock(NodeAddr<BlockNode *> BA);
178 NodeAddr<UseNode *> UA = *I; in canRemoveAddasl()
215 NodeAddr<UseNode *> UN = *I; in allValidCandidates()
300 NodeAddr<UseNode *> UA = *I; in isSafeToExtLR()
354 NodeAddr<UseNode *> UN = *I; in processAddUses()
394 NodeAddr<UseNode *> UseN = *I; in processAddUses()
441 NodeAddr<UseNode *> UN = *I; in analyzeUses()
615 NodeAddr<UseNode *> UseUN = *I; in changeAddAsl()
694 NodeAddr<StmtNode *> SA = IA; in processBlock()
744 NodeAddr<UseNode *> UseN = *I; in processBlock()
[all …]
H A DRDFLiveness.cpp175 NodeAddr<PhiNode*> PA = IA; in getAllReachingDefs()
252 for (NodeAddr<DefNode*> DA : Ds) { in getAllReachingDefs()
296 for (NodeAddr<NodeBase*> R : RDs) in getAllReachingDefsRecImpl()
301 for (NodeAddr<DefNode*> DA : RDs) { in getAllReachingDefsRecImpl()
325 NodeAddr<InstrNode*> IA) { in getNearestAliasedRef()
342 NodeAddr<RefNode*> Clob, Use; in getNearestAliasedRef()
365 BA = NodeAddr<BlockNode*>(); in getNearestAliasedRef()
378 return NodeAddr<RefNode*>(); in getNearestAliasedRef()
557 NodeAddr<PhiUseNode*> PUA = I; in computePhiInfo()
755 NodeAddr<PhiUseNode*> PUA = U; in computeLiveIns()
[all …]
H A 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,
H A 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()
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()
219 MachineInstr &MI = *NodeAddr<StmtNode*>(IA).Addr->getCode(); in rewrite()
253 auto IsDead = [this] (NodeAddr<DefNode*> DA) -> bool { in rewrite()
[all …]
H A 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()
H A 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);
H A DRDFCopy.h53 void recordCopy(NodeAddr<StmtNode*> SA, EqualityMap &EM);
55 NodeId getLocalReachingDef(RegisterRef RefRR, NodeAddr<InstrNode*> IA);