67 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeId> &P) {  in operator <<()
110   OS << Print<NodeId>(RA.Id, G) << '<'  in printRefHeader()
119   if (NodeId N = P.Obj.Addr->getReachingDef())  in operator <<()
120     OS << Print<NodeId>(N, P.G);  in operator <<()
122   if (NodeId N = P.Obj.Addr->getReachedDef())  in operator <<()
123     OS << Print<NodeId>(N, P.G);  in operator <<()
125   if (NodeId N = P.Obj.Addr->getReachedUse())  in operator <<()
126     OS << Print<NodeId>(N, P.G);  in operator <<()
128   if (NodeId N = P.Obj.Addr->getSibling())  in operator <<()
129     OS << Print<NodeId>(N, P.G);  in operator <<()
136   if (NodeId N = P.Obj.Addr->getReachingDef())  in operator <<()
137     OS << Print<NodeId>(N, P.G);  in operator <<()
139   if (NodeId N = P.Obj.Addr->getSibling())  in operator <<()
140     OS << Print<NodeId>(N, P.G);  in operator <<()
148   if (NodeId N = P.Obj.Addr->getReachingDef())  in operator <<()
149     OS << Print<NodeId>(N, P.G);  in operator <<()
151   if (NodeId N = P.Obj.Addr->getPredecessor())  in operator <<()
152     OS << Print<NodeId>(N, P.G);  in operator <<()
154   if (NodeId N = P.Obj.Addr->getSibling())  in operator <<()
155     OS << Print<NodeId>(N, P.G);  in operator <<()
177     OS << Print<NodeId>(I.Id, P.G);  in operator <<()
187     OS << Print<NodeId>(I, P.G);  in operator <<()
219   OS << Print<NodeId>(P.Obj.Id, P.G) << ": phi ["  in operator <<()
227   OS << Print<NodeId>(P.Obj.Id, P.G) << ": " << P.G.getTII().getName(Opc);  in operator <<()
259       OS << "instr? " << Print<NodeId>(P.Obj.Id, P.G);  in operator <<()
279   OS << Print<NodeId>(P.Obj.Id, P.G) << ": --- " << printMBBReference(*BB)  in operator <<()
299   OS << "DFG dump:[\n" << Print<NodeId>(P.Obj.Id, P.G) << ": Function: "  in operator <<()
323     OS << Print<NodeId>(I->Id, P.G)  in operator <<()
351   assert((Blocks.size() < ((size_t)1 << (8*sizeof(NodeId)-BitsPerIndex))) &&  in startNewBlock()
377 NodeId NodeAllocator::id(const NodeBase *P) const {  in id()
397   NodeId Nx = Next;  in append()
446 void DefNode::linkToDef(NodeId Self, NodeAddr<DefNode*> DA) {  in linkToDef()
453 void UseNode::linkToDef(NodeId Self, NodeAddr<DefNode*> DA) {  in linkToDef()
480     NodeId Self = G.id(this);  in addMember()
512     NodeId MX = MA.Addr->getNext();  in removeMember()
695 void DataFlowGraph::DefStack::start_block(NodeId N) {  in start_block()
703 void DataFlowGraph::DefStack::clear_block(NodeId N) {  in clear_block()
766 NodeBase *DataFlowGraph::ptr(NodeId N) const {  in ptr()
773 NodeId DataFlowGraph::id(const NodeBase *P) const {  in id()
995 void DataFlowGraph::markBlock(NodeId B, DefStackMap &DefM) {  in markBlock()
1002 void DataFlowGraph::releaseBlock(NodeId B, DefStackMap &DefM) {  in releaseBlock()
1130   NodeId Start = RA.Id;  in getRelatedRefs()
1195   NodeId Start = RA.Id;  in locateNextRef()
1516   SetVector<NodeId> PhiQ;  in removeUnusedPhis()
1543       if (NodeId RD = RA.Addr->getReachingDef()) {  in removeUnusedPhis()
1719   NodeId RD = UA.Addr->getReachingDef();  in unlinkUseDF()
1720   NodeId Sib = UA.Addr->getSibling();  in unlinkUseDF()
1735     NodeId S = TA.Addr->getSibling();  in unlinkUseDF()
1764   NodeId RD = DA.Addr->getReachingDef();  in unlinkDefDF()
1770   auto getAllNodes = [this] (NodeId N) -> NodeList {  in unlinkDefDF()
1794   NodeId Sib = DA.Addr->getSibling();  in unlinkDefDF()
1811       NodeId S = TA.Addr->getSibling();  in unlinkDefDF()