267     NodeChain.resize(Cg.numNodes(), nullptr);  in initialize()
274       NodeChain[F] = &AllChains.back();  in initialize()
296         Edge *CurEdge = NodeChain[F]->getEdge(NodeChain[Succ]);  in initialize()
299           assert(NodeChain[Succ]->getEdge(NodeChain[F]) != nullptr);  in initialize()
303           AllEdges.emplace_back(NodeChain[F], NodeChain[Succ], &Arc);  in initialize()
304           NodeChain[F]->addEdge(NodeChain[Succ], &AllEdges.back());  in initialize()
305           NodeChain[Succ]->addEdge(NodeChain[F], &AllEdges.back());  in initialize()
368       Chain *SrcChain = NodeChain[Arc->src()];  in shortCalls()
462       Chain *ChainPred = NodeChain[Arc->src()];  in runPassOne()
463       Chain *ChainSucc = NodeChain[Arc->dst()];  in runPassOne()
556       NodeChain[F] = Into;  in mergeChains()
587   std::vector<Chain *> NodeChain;  member in llvm::bolt::__anonbf028ece0111::HFSortPlus