70 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeId> &P) {  in operator <<()
113   OS << Print<NodeId>(RA.Id, G) << '<'  in printRefHeader()
123   if (NodeId N = P.Obj.Addr->getReachingDef())  in operator <<()
124     OS << Print<NodeId>(N, P.G);  in operator <<()
126   if (NodeId N = P.Obj.Addr->getReachedDef())  in operator <<()
127     OS << Print<NodeId>(N, P.G);  in operator <<()
129   if (NodeId N = P.Obj.Addr->getReachedUse())  in operator <<()
130     OS << Print<NodeId>(N, P.G);  in operator <<()
132   if (NodeId N = P.Obj.Addr->getSibling())  in operator <<()
133     OS << Print<NodeId>(N, P.G);  in operator <<()
141   if (NodeId N = P.Obj.Addr->getReachingDef())  in operator <<()
142     OS << Print<NodeId>(N, P.G);  in operator <<()
144   if (NodeId N = P.Obj.Addr->getSibling())  in operator <<()
145     OS << Print<NodeId>(N, P.G);  in operator <<()
154   if (NodeId N = P.Obj.Addr->getReachingDef())  in operator <<()
155     OS << Print<NodeId>(N, P.G);  in operator <<()
157   if (NodeId N = P.Obj.Addr->getPredecessor())  in operator <<()
158     OS << Print<NodeId>(N, P.G);  in operator <<()
160   if (NodeId N = P.Obj.Addr->getSibling())  in operator <<()
161     OS << Print<NodeId>(N, P.G);  in operator <<()
185     OS << Print<NodeId>(I.Id, P.G);  in operator <<()
196     OS << Print<NodeId>(I, P.G);  in operator <<()
229   OS << Print<NodeId>(P.Obj.Id, P.G) << ": phi ["  in operator <<()
239   OS << Print<NodeId>(P.Obj.Id, P.G) << ": " << P.G.getTII().getName(Opc);  in operator <<()
272       OS << "instr? " << Print<NodeId>(P.Obj.Id, P.G);  in operator <<()
293   OS << Print<NodeId>(P.Obj.Id, P.G) << ": --- " << printMBBReference(*BB)  in operator <<()
315   OS << "DFG dump:[\n" << Print<NodeId>(P.Obj.Id, P.G) << ": Function: "  in operator <<()
342     OS << Print<NodeId>(I->Id, P.G)  in operator <<()
370   assert((Blocks.size() < ((size_t)1 << (8*sizeof(NodeId)-BitsPerIndex))) &&  in startNewBlock()
396 NodeId NodeAllocator::id(const NodeBase *P) const {  in id()
416   NodeId Nx = Next;  in append()
465 void DefNode::linkToDef(NodeId Self, NodeAddr<DefNode*> DA) {  in linkToDef()
472 void UseNode::linkToDef(NodeId Self, NodeAddr<DefNode*> DA) {  in linkToDef()
499     NodeId Self = G.id(this);  in addMember()
531     NodeId MX = MA.Addr->getNext();  in removeMember()
714 void DataFlowGraph::DefStack::start_block(NodeId N) {  in start_block()
722 void DataFlowGraph::DefStack::clear_block(NodeId N) {  in clear_block()
783 NodeBase *DataFlowGraph::ptr(NodeId N) const {  in ptr()
790 NodeId DataFlowGraph::id(const NodeBase *P) const {  in id()
1017 void DataFlowGraph::markBlock(NodeId B, DefStackMap &DefM) {  in markBlock()
1024 void DataFlowGraph::releaseBlock(NodeId B, DefStackMap &DefM) {  in releaseBlock()
1152   NodeId Start = RA.Id;  in getRelatedRefs()
1217   NodeId Start = RA.Id;  in locateNextRef()
1538   SetVector<NodeId> PhiQ;  in removeUnusedPhis()
1565       if (NodeId RD = RA.Addr->getReachingDef()) {  in removeUnusedPhis()
1741   NodeId RD = UA.Addr->getReachingDef();  in unlinkUseDF()
1742   NodeId Sib = UA.Addr->getSibling();  in unlinkUseDF()
1757     NodeId S = TA.Addr->getSibling();  in unlinkUseDF()
1786   NodeId RD = DA.Addr->getReachingDef();  in unlinkDefDF()
1792   auto getAllNodes = [this] (NodeId N) -> NodeList {  in unlinkDefDF()
1816   NodeId Sib = DA.Addr->getSibling();  in unlinkDefDF()
1833       NodeId S = TA.Addr->getSibling();  in unlinkDefDF()