38   Nodes.resize(1); // Reserve Nodes[0] for the root node (sentinel).  in TimerStack()
84   for (const TimerTreeNode &SrcNode : Src.Nodes) {  in mergeFrom()
93       Nodes[MyIndex].Time += SrcNode.Time;  in mergeFrom()
94       Nodes[MyIndex].UpdateCount += SrcNode.UpdateCount;  in mergeFrom()
112     Path.push_back(Mapping[Nodes[Index].Interior]);  in getPath()
113     assert(Nodes[Index].Parent < Index);  in getPath()
114     Index = Nodes[Index].Parent;  in getPath()
123   if (Nodes[Parent].Children.size() <= ID)  in getChildIndex()
124     Nodes[Parent].Children.resize(ID + 1);  in getChildIndex()
125   if (Nodes[Parent].Children[ID] == 0) {  in getChildIndex()
126     TTindex Size = Nodes.size();  in getChildIndex()
127     Nodes[Parent].Children[ID] = Size;  in getChildIndex()
128     Nodes.resize(Size + 1);  in getChildIndex()
129     Nodes[Size].Parent = Parent;  in getChildIndex()
130     Nodes[Size].Interior = ID;  in getChildIndex()
132   return Nodes[Parent].Children[ID];  in getChildIndex()
166   assert(Nodes[StackTop].Parent < StackTop);  in pop()
168   assert(Nodes[StackTop].Interior == ID);  in pop()
171   assert(Nodes[Nodes[StackTop].Parent].Children[ID] == StackTop);  in pop()
172   StackTop = Nodes[StackTop].Parent;  in pop()
187     TimerIdT Leaf = Nodes[StackTop].Interior;  in update()
198     Nodes[Prefix].Time += Delta;  in update()
201       ++Nodes[Prefix].UpdateCount;  in update()
202     TTindex Next = Nodes[Prefix].Parent;  in update()
220   for (TimerTreeNode &Node : Nodes) {  in reset()
275     for (TTindex i = 1; i < Nodes.size(); ++i) {  in dump()
280           Suffix = IDs[Nodes[Prefix].Interior];  in dump()
282           Suffix = IDs[Nodes[Prefix].Interior] + "." + Suffix;  in dump()
283         assert(Nodes[Prefix].Parent < Prefix);  in dump()
284         Prefix = Nodes[Prefix].Parent;  in dump()
287                Nodes[i].UpdateCount);  in dump()
288       CumulativeMap.insert(std::make_pair(Nodes[i].Time, PrefixStr + Suffix));  in dump()