65 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeId> &P) {  in operator <<()
108   OS << Print<NodeId>(RA.Id, G) << '<'  in printRefHeader()
117   if (NodeId N = P.Obj.Addr->getReachingDef())  in operator <<()
118     OS << Print<NodeId>(N, P.G);  in operator <<()
120   if (NodeId N = P.Obj.Addr->getReachedDef())  in operator <<()
121     OS << Print<NodeId>(N, P.G);  in operator <<()
123   if (NodeId N = P.Obj.Addr->getReachedUse())  in operator <<()
124     OS << Print<NodeId>(N, P.G);  in operator <<()
126   if (NodeId N = P.Obj.Addr->getSibling())  in operator <<()
127     OS << Print<NodeId>(N, P.G);  in operator <<()
134   if (NodeId N = P.Obj.Addr->getReachingDef())  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 <<()
146   if (NodeId N = P.Obj.Addr->getReachingDef())  in operator <<()
147     OS << Print<NodeId>(N, P.G);  in operator <<()
149   if (NodeId N = P.Obj.Addr->getPredecessor())  in operator <<()
150     OS << Print<NodeId>(N, P.G);  in operator <<()
152   if (NodeId N = P.Obj.Addr->getSibling())  in operator <<()
153     OS << Print<NodeId>(N, P.G);  in operator <<()
175     OS << Print<NodeId>(I.Id, P.G);  in operator <<()
185     OS << Print<NodeId>(I, P.G);  in operator <<()
217   OS << Print<NodeId>(P.Obj.Id, P.G) << ": phi ["  in operator <<()
225   OS << Print<NodeId>(P.Obj.Id, P.G) << ": " << P.G.getTII().getName(Opc);  in operator <<()
257       OS << "instr? " << Print<NodeId>(P.Obj.Id, P.G);  in operator <<()
277   OS << Print<NodeId>(P.Obj.Id, P.G) << ": --- " << printMBBReference(*BB)  in operator <<()
297   OS << "DFG dump:[\n" << Print<NodeId>(P.Obj.Id, P.G) << ": Function: "  in operator <<()
321     OS << Print<NodeId>(I->Id, P.G)  in operator <<()
349   assert((Blocks.size() < ((size_t)1 << (8*sizeof(NodeId)-BitsPerIndex))) &&  in startNewBlock()
375 NodeId NodeAllocator::id(const NodeBase *P) const {  in id()
395   NodeId Nx = Next;  in append()
444 void DefNode::linkToDef(NodeId Self, NodeAddr<DefNode*> DA) {  in linkToDef()
451 void UseNode::linkToDef(NodeId Self, NodeAddr<DefNode*> DA) {  in linkToDef()
478     NodeId Self = G.id(this);  in addMember()
510     NodeId MX = MA.Addr->getNext();  in removeMember()
693 void DataFlowGraph::DefStack::start_block(NodeId N) {  in start_block()
701 void DataFlowGraph::DefStack::clear_block(NodeId N) {  in clear_block()
764 NodeBase *DataFlowGraph::ptr(NodeId N) const {  in ptr()
771 NodeId DataFlowGraph::id(const NodeBase *P) const {  in id()
981 void DataFlowGraph::markBlock(NodeId B, DefStackMap &DefM) {  in markBlock()
988 void DataFlowGraph::releaseBlock(NodeId B, DefStackMap &DefM) {  in releaseBlock()
1116   NodeId Start = RA.Id;  in getRelatedRefs()
1181   NodeId Start = RA.Id;  in locateNextRef()
1502   SetVector<NodeId> PhiQ;  in removeUnusedPhis()
1529       if (NodeId RD = RA.Addr->getReachingDef()) {  in removeUnusedPhis()
1705   NodeId RD = UA.Addr->getReachingDef();  in unlinkUseDF()
1706   NodeId Sib = UA.Addr->getSibling();  in unlinkUseDF()
1721     NodeId S = TA.Addr->getSibling();  in unlinkUseDF()
1750   NodeId RD = DA.Addr->getReachingDef();  in unlinkDefDF()
1756   auto getAllNodes = [this] (NodeId N) -> NodeList {  in unlinkDefDF()
1780   NodeId Sib = DA.Addr->getSibling();  in unlinkDefDF()
1797       NodeId S = TA.Addr->getSibling();  in unlinkDefDF()