791   uint32_t NumNodes;  member
844     NumNodes = 0;  in Graph()
849   NumNodes = static_cast<uint32_t>(MaxNodes);  in Graph()
922   for (int I = NumNodes - 1; I >= 0; --I) {  in ~Graph()
939   reportNumber("Dumping graph with number of nodes: ", NumNodes, 10);  in dump()
941   for (int I = 0; I < NumNodes; ++I) {  in dump()
953   for (int I = 0; I < NumNodes; ++I) {  in dump()
985   const uint32_t NumNodes;  member
988                  uint32_t NumNodes)  in NodeToCallsMap()
989       : Alloc(Alloc), NumNodes(NumNodes) {  in NodeToCallsMap()
990     Entries = new (Alloc, 0) MapEntry[NumNodes];  in NodeToCallsMap()
995     for (int I = 0; I < NumNodes; ++I) {  in NodeToCallsMap()
1042     for (int I = NumNodes - 1; I >= 0; --I)  in ~NodeToCallsMap()
1053   if (NumNodes == 0)  in computeEdgeFrequencies()
1060   NodeToCallsMap *CallMap = new (Alloc) NodeToCallsMap(Alloc, D, NumNodes);  in computeEdgeFrequencies()
1066   uint32_t *Stack = new (Alloc) uint32_t [NumNodes];  in computeEdgeFrequencies()
1069   Status *Visited = new (Alloc, 0) Status[NumNodes];  in computeEdgeFrequencies()
1070   uint64_t *LeafFrequency = new (Alloc, 0) uint64_t[NumNodes];  in computeEdgeFrequencies()
1071   uint64_t *EntryAddress = new (Alloc, 0) uint64_t[NumNodes];  in computeEdgeFrequencies()
1092   for (int I = 0; I < NumNodes; ++I)  in computeEdgeFrequencies()
1136       assert(StackTop <= NumNodes, "stack grew too large");  in computeEdgeFrequencies()
1140         assert(StackTop <= NumNodes, "stack grew too large");  in computeEdgeFrequencies()