25   if (Chunk && Chunk->Next)  in clear()
26     std::free(Chunk->Next);  in clear()
27   if (Chunk)  in clear()
28     std::free(Chunk);  in clear()
29   Chunk = nullptr;  in clear()
39   if (!Chunk || sizeof(StackChunk) + Chunk->size() + Size > ChunkSize) {  in grow()
40     if (Chunk && Chunk->Next) {  in grow()
41       Chunk = Chunk->Next;  in grow()
43       StackChunk *Next = new (std::malloc(ChunkSize)) StackChunk(Chunk);  in grow()
44       if (Chunk)  in grow()
45         Chunk->Next = Next;  in grow()
46       Chunk = Next;  in grow()
50   auto *Object = reinterpret_cast<void *>(Chunk->End);  in grow()
51   Chunk->End += Size;  in grow()
57   assert(Chunk && "Stack is empty!");  in peekData()
59   StackChunk *Ptr = Chunk;  in peekData()
70   assert(Chunk && "Chunk is empty!");  in shrink()
72   while (Size > Chunk->size()) {  in shrink()
73     Size -= Chunk->size();  in shrink()
74     if (Chunk->Next) {  in shrink()
75       std::free(Chunk->Next);  in shrink()
76       Chunk->Next = nullptr;  in shrink()
78     Chunk->End = Chunk->start();  in shrink()
79     Chunk = Chunk->Prev;  in shrink()
80     assert(Chunk && "Offset too large");  in shrink()
83   Chunk->End -= Size;  in shrink()