36 void *InterpStack::grow(size_t Size) {  in grow()  argument
37   assert(Size < ChunkSize - sizeof(StackChunk) && "Object too large");  in grow()
39   if (!Chunk || sizeof(StackChunk) + Chunk->size() + Size > ChunkSize) {  in grow()
51   Chunk->End += Size;  in grow()
52   StackSize += Size;  in grow()
56 void *InterpStack::peekData(size_t Size) const {  in peekData()
60   while (Size > Ptr->size()) {  in peekData()
61     Size -= Ptr->size();  in peekData()
66   return reinterpret_cast<void *>(Ptr->End - Size);  in peekData()
69 void InterpStack::shrink(size_t Size) {  in shrink()  argument
72   while (Size > Chunk->size()) {  in shrink()
73     Size -= Chunk->size();  in shrink()
83   Chunk->End -= Size;  in shrink()
84   StackSize -= Size;  in shrink()