1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
|
//===--- InterpStack.cpp - Stack implementation for the VM ------*- C++ -*-===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
#include "InterpStack.h"
#include "Boolean.h"
#include "Floating.h"
#include "Integral.h"
#include <cassert>
#include <cstdlib>
using namespace clang;
using namespace clang::interp;
InterpStack::~InterpStack() {
clear();
}
void InterpStack::clear() {
if (Chunk && Chunk->Next)
std::free(Chunk->Next);
if (Chunk)
std::free(Chunk);
Chunk = nullptr;
StackSize = 0;
#ifndef NDEBUG
ItemTypes.clear();
#endif
}
void *InterpStack::grow(size_t Size) {
assert(Size < ChunkSize - sizeof(StackChunk) && "Object too large");
if (!Chunk || sizeof(StackChunk) + Chunk->size() + Size > ChunkSize) {
if (Chunk && Chunk->Next) {
Chunk = Chunk->Next;
} else {
StackChunk *Next = new (std::malloc(ChunkSize)) StackChunk(Chunk);
if (Chunk)
Chunk->Next = Next;
Chunk = Next;
}
}
auto *Object = reinterpret_cast<void *>(Chunk->End);
Chunk->End += Size;
StackSize += Size;
return Object;
}
void *InterpStack::peekData(size_t Size) const {
assert(Chunk && "Stack is empty!");
StackChunk *Ptr = Chunk;
while (Size > Ptr->size()) {
Size -= Ptr->size();
Ptr = Ptr->Prev;
assert(Ptr && "Offset too large");
}
return reinterpret_cast<void *>(Ptr->End - Size);
}
void InterpStack::shrink(size_t Size) {
assert(Chunk && "Chunk is empty!");
while (Size > Chunk->size()) {
Size -= Chunk->size();
if (Chunk->Next) {
std::free(Chunk->Next);
Chunk->Next = nullptr;
}
Chunk->End = Chunk->start();
Chunk = Chunk->Prev;
assert(Chunk && "Offset too large");
}
Chunk->End -= Size;
StackSize -= Size;
}
void InterpStack::dump() const {
#ifndef NDEBUG
llvm::errs() << "Items: " << ItemTypes.size() << ". Size: " << size() << "\n";
if (ItemTypes.empty())
return;
size_t Index = 0;
size_t Offset = align(primSize(ItemTypes[0]));
for (PrimType Ty : ItemTypes) {
llvm::errs() << Index << "/" << Offset << ": ";
TYPE_SWITCH(Ty, {
const T &V = peek<T>(Offset);
llvm::errs() << V;
});
llvm::errs() << "\n";
Offset += align(primSize(Ty));
++Index;
}
#endif
}
|
