Home
last modified time | relevance | path

Searched refs:RefNode (Results 1 – 8 of 8) sorted by relevance

/freebsd-12.1/contrib/llvm/lib/Target/Hexagon/
H A DRDFGraph.h516 struct RefNode : public NodeBase { struct
517 RefNode() = default;
559 struct DefNode : public RefNode {
576 struct UseNode : public RefNode {
756 NodeAddr<RefNode*> RA) const;
760 NodeAddr<RefNode*> RA) const;
764 NodeAddr<RefNode*> RA) const;
842 std::pair<NodeAddr<RefNode*>,NodeAddr<RefNode*>>
888 NodeAddr<RefNode*> RefNode::getNextRef(RegisterRef RR, Predicate P, in getNextRef()
896 NodeAddr<RefNode*> RA = NA; in getNextRef()
[all …]
H A DRDFDeadCode.cpp88 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG)) { in scanInstr()
135 auto RA = DFG.addr<RefNode*>(N); in collect()
145 auto RA = DFG.addr<RefNode*>(N); in collect()
146 dbgs() << PrintNode<RefNode*>(RA, DFG) << "\n"; in collect()
159 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG)) in collect()
191 DRNs.push_back(DFG.addr<RefNode*>(I)); in erase()
209 auto UsesFirst = [] (NodeAddr<RefNode*> A, NodeAddr<RefNode*> B) -> bool { in erase()
221 for (NodeAddr<RefNode*> RA : DRNs) { in erase()
223 dbgs() << " " << PrintNode<RefNode*>(RA, DFG) << '\n'; in erase()
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()
79 NodeAddr<RefNode*> RefA, NodeSet &Visited, const NodeSet &Defs);
81 NodeAddr<RefNode*> getNearestAliasedRef(RegisterRef RefRR,
142 NodeAddr<RefNode*> RefA, NodeSet &Visited, const NodeSet &Defs,
H A DRDFGraph.cpp811 NodeAddr<RefNode*> RA = NA; in cloneNode()
1148 NodeAddr<RefNode*> RA) const { in getRelatedRefs()
1174 NodeAddr<RefNode*> RA) const { in getNextRelated()
1211 std::pair<NodeAddr<RefNode*>,NodeAddr<RefNode*>>
1216 NodeAddr<RefNode*> NA; in locateNextRef()
1235 NodeAddr<RefNode*> RA, bool Create) { in getNextShadow()
1247 NodeAddr<RefNode*> NA = cloneNode(RA); in getNextShadow()
1256 NodeAddr<RefNode*> RA) const { in getNextShadow()
1564 for (NodeAddr<RefNode*> RA : Refs) { in removeUnusedPhis()
1795 auto RA = addr<RefNode*>(N); in unlinkDefDF()
[all …]
H A DRDFLiveness.cpp109 NodeAddr<RefNode*> RefA, bool TopShadows, bool FullChain, in getAllReachingDefs()
127 auto SNA = DFG.addr<RefNode*>(Start); in getAllReachingDefs()
132 if (NodeId RD = NodeAddr<RefNode*>(S).Addr->getReachingDef()) in getAllReachingDefs()
154 if (NodeId RD = NodeAddr<RefNode*>(S).Addr->getReachingDef()) in getAllReachingDefs()
228 auto DefInSet = [&Defs] (NodeAddr<RefNode*> TA) -> bool { in getAllReachingDefs()
324 NodeAddr<RefNode*> Liveness::getNearestAliasedRef(RegisterRef RefRR, in getNearestAliasedRef()
342 NodeAddr<RefNode*> Clob, Use; in getNearestAliasedRef()
345 for (NodeAddr<RefNode*> R : Refs) { in getNearestAliasedRef()
378 return NodeAddr<RefNode*>(); in getNearestAliasedRef()
455 for (NodeAddr<RefNode*> R : PhiRefs) { in computePhiInfo()
[all …]
H A DHexagonRDFOpt.cpp166 for (NodeAddr<RefNode*> RA : SA.Addr->members(DFG)) { in run()
201 for (NodeAddr<RefNode*> RA : Refs) in removeOperand()
206 for (NodeAddr<RefNode*> RA : Refs) { in removeOperand()
H A DRDFCopy.cpp91 NodeAddr<RefNode*> RA = L.getNearestAliasedRef(RefRR, IA); in getLocalReachingDef()
H A DHexagonOptAddrMode.cpp182 NodeAddr<RefNode*> AA = LV->getNearestAliasedRef(OffsetRR, IA); in canRemoveAddasl()
306 NodeAddr<RefNode*> AA = LV->getNearestAliasedRef(LRExtRR, IA); in isSafeToExtLR()