29 void *InterpStack::grow(size_t Size) {  in grow()  argument
30   assert(Size < ChunkSize - sizeof(StackChunk) && "Object too large");  in grow()
32   if (!Chunk || sizeof(StackChunk) + Chunk->size() + Size > ChunkSize) {  in grow()
44   Chunk->End += Size;  in grow()
45   StackSize += Size;  in grow()
49 void *InterpStack::peek(size_t Size) {  in peek()  argument
53   while (Size > Ptr->size()) {  in peek()
54     Size -= Ptr->size();  in peek()
59   return reinterpret_cast<void *>(Ptr->End - Size);  in peek()
62 void InterpStack::shrink(size_t Size) {  in shrink()  argument
65   while (Size > Chunk->size()) {  in shrink()
66     Size -= Chunk->size();  in shrink()
76   Chunk->End -= Size;  in shrink()
77   StackSize -= Size;  in shrink()