49 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeId> &P) {  in operator <<()
89     OS << Print<NodeId>(RA.Id, G) << '<'  in printRefHeader()
100   if (NodeId N = P.Obj.Addr->getReachingDef())  in operator <<()
101     OS << Print<NodeId>(N, P.G);  in operator <<()
103   if (NodeId N = P.Obj.Addr->getReachedDef())  in operator <<()
104     OS << Print<NodeId>(N, P.G);  in operator <<()
106   if (NodeId N = P.Obj.Addr->getReachedUse())  in operator <<()
107     OS << Print<NodeId>(N, P.G);  in operator <<()
109   if (NodeId N = P.Obj.Addr->getSibling())  in operator <<()
110     OS << Print<NodeId>(N, P.G);  in operator <<()
118   if (NodeId N = P.Obj.Addr->getReachingDef())  in operator <<()
119     OS << Print<NodeId>(N, P.G);  in operator <<()
121   if (NodeId N = P.Obj.Addr->getSibling())  in operator <<()
122     OS << Print<NodeId>(N, P.G);  in operator <<()
131   if (NodeId N = P.Obj.Addr->getReachingDef())  in operator <<()
132     OS << Print<NodeId>(N, P.G);  in operator <<()
134   if (NodeId N = P.Obj.Addr->getPredecessor())  in operator <<()
135     OS << Print<NodeId>(N, P.G);  in operator <<()
137   if (NodeId N = P.Obj.Addr->getSibling())  in operator <<()
138     OS << Print<NodeId>(N, P.G);  in operator <<()
162     OS << Print<NodeId>(I.Id, P.G);  in operator <<()
173     OS << Print<NodeId>(I, P.G);  in operator <<()
203   OS << Print<NodeId>(P.Obj.Id, P.G) << ": phi ["  in operator <<()
212   OS << Print<NodeId>(P.Obj.Id, P.G) << ": " << P.G.getTII().getName(Opc)  in operator <<()
228       OS << "instr? " << Print<NodeId>(P.Obj.Id, P.G);  in operator <<()
249   OS << Print<NodeId>(P.Obj.Id, P.G) << ": === BB#" << BB->getNumber()  in operator <<()
271   OS << "DFG dump:[\n" << Print<NodeId>(P.Obj.Id, P.G) << ": Function: "  in operator <<()
292     OS << Print<NodeId>(I->Id, P.G)  in operator <<()
320   assert((Blocks.size() < ((size_t)1 << (8*sizeof(NodeId)-BitsPerIndex))) &&  in startNewBlock()
346 NodeId NodeAllocator::id(const NodeBase *P) const {  in id()
367   NodeId Nx = Next;  in append()
416 void DefNode::linkToDef(NodeId Self, NodeAddr<DefNode*> DA) {  in linkToDef()
423 void UseNode::linkToDef(NodeId Self, NodeAddr<DefNode*> DA) {  in linkToDef()
450     NodeId Self = G.id(this);  in addMember()
482     NodeId MX = MA.Addr->getNext();  in removeMember()
773 void DataFlowGraph::DefStack::start_block(NodeId N) {  in start_block()
781 void DataFlowGraph::DefStack::clear_block(NodeId N) {  in clear_block()
827 NodeBase *DataFlowGraph::ptr(NodeId N) const {  in ptr()
834 NodeId DataFlowGraph::id(const NodeBase *P) const {  in id()
980 void DataFlowGraph::markBlock(NodeId B, DefStackMap &DefM) {  in markBlock()
987 void DataFlowGraph::releaseBlock(NodeId B, DefStackMap &DefM) {  in releaseBlock()
1060   NodeId Start = RA.Id;  in getRelatedRefs()
1126   NodeId Start = RA.Id;  in locateNextRef()
1392   std::vector<NodeId> PredList;  in buildPhis()
1445   SetVector<NodeId> PhiQ;  in removeUnusedPhis()
1472       if (NodeId RD = RA.Addr->getReachingDef()) {  in removeUnusedPhis()
1618   NodeId RD = UA.Addr->getReachingDef();  in unlinkUseDF()
1619   NodeId Sib = UA.Addr->getSibling();  in unlinkUseDF()
1634     NodeId S = TA.Addr->getSibling();  in unlinkUseDF()
1663   NodeId RD = DA.Addr->getReachingDef();  in unlinkDefDF()
1669   auto getAllNodes = [this] (NodeId N) -> NodeList {  in unlinkDefDF()
1693   NodeId Sib = DA.Addr->getSibling();  in unlinkDefDF()
1710       NodeId S = TA.Addr->getSibling();  in unlinkDefDF()