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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
|
//===- MCJITMemoryManagerTest.cpp - Unit tests for the JIT memory manager -===//
//
// 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 "llvm/ExecutionEngine/SectionMemoryManager.h"
#include "gtest/gtest.h"
using namespace llvm;
namespace {
TEST(MCJITMemoryManagerTest, BasicAllocations) {
std::unique_ptr<SectionMemoryManager> MemMgr(new SectionMemoryManager());
uint8_t *code1 = MemMgr->allocateCodeSection(256, 0, 1, "");
uint8_t *data1 = MemMgr->allocateDataSection(256, 0, 2, "", true);
uint8_t *code2 = MemMgr->allocateCodeSection(256, 0, 3, "");
uint8_t *data2 = MemMgr->allocateDataSection(256, 0, 4, "", false);
EXPECT_NE((uint8_t*)nullptr, code1);
EXPECT_NE((uint8_t*)nullptr, code2);
EXPECT_NE((uint8_t*)nullptr, data1);
EXPECT_NE((uint8_t*)nullptr, data2);
// Initialize the data
for (unsigned i = 0; i < 256; ++i) {
code1[i] = 1;
code2[i] = 2;
data1[i] = 3;
data2[i] = 4;
}
// Verify the data (this is checking for overlaps in the addresses)
for (unsigned i = 0; i < 256; ++i) {
EXPECT_EQ(1, code1[i]);
EXPECT_EQ(2, code2[i]);
EXPECT_EQ(3, data1[i]);
EXPECT_EQ(4, data2[i]);
}
std::string Error;
EXPECT_FALSE(MemMgr->finalizeMemory(&Error));
}
TEST(MCJITMemoryManagerTest, LargeAllocations) {
std::unique_ptr<SectionMemoryManager> MemMgr(new SectionMemoryManager());
uint8_t *code1 = MemMgr->allocateCodeSection(0x100000, 0, 1, "");
uint8_t *data1 = MemMgr->allocateDataSection(0x100000, 0, 2, "", true);
uint8_t *code2 = MemMgr->allocateCodeSection(0x100000, 0, 3, "");
uint8_t *data2 = MemMgr->allocateDataSection(0x100000, 0, 4, "", false);
EXPECT_NE((uint8_t*)nullptr, code1);
EXPECT_NE((uint8_t*)nullptr, code2);
EXPECT_NE((uint8_t*)nullptr, data1);
EXPECT_NE((uint8_t*)nullptr, data2);
// Initialize the data
for (unsigned i = 0; i < 0x100000; ++i) {
code1[i] = 1;
code2[i] = 2;
data1[i] = 3;
data2[i] = 4;
}
// Verify the data (this is checking for overlaps in the addresses)
for (unsigned i = 0; i < 0x100000; ++i) {
EXPECT_EQ(1, code1[i]);
EXPECT_EQ(2, code2[i]);
EXPECT_EQ(3, data1[i]);
EXPECT_EQ(4, data2[i]);
}
std::string Error;
EXPECT_FALSE(MemMgr->finalizeMemory(&Error));
}
TEST(MCJITMemoryManagerTest, ManyAllocations) {
std::unique_ptr<SectionMemoryManager> MemMgr(new SectionMemoryManager());
uint8_t* code[10000];
uint8_t* data[10000];
for (unsigned i = 0; i < 10000; ++i) {
const bool isReadOnly = i % 2 == 0;
code[i] = MemMgr->allocateCodeSection(32, 0, 1, "");
data[i] = MemMgr->allocateDataSection(32, 0, 2, "", isReadOnly);
for (unsigned j = 0; j < 32; j++) {
code[i][j] = 1 + (i % 254);
data[i][j] = 2 + (i % 254);
}
EXPECT_NE((uint8_t *)nullptr, code[i]);
EXPECT_NE((uint8_t *)nullptr, data[i]);
}
// Verify the data (this is checking for overlaps in the addresses)
for (unsigned i = 0; i < 10000; ++i) {
for (unsigned j = 0; j < 32;j++ ) {
uint8_t ExpectedCode = 1 + (i % 254);
uint8_t ExpectedData = 2 + (i % 254);
EXPECT_EQ(ExpectedCode, code[i][j]);
EXPECT_EQ(ExpectedData, data[i][j]);
}
}
std::string Error;
EXPECT_FALSE(MemMgr->finalizeMemory(&Error));
}
TEST(MCJITMemoryManagerTest, ManyVariedAllocations) {
std::unique_ptr<SectionMemoryManager> MemMgr(new SectionMemoryManager());
uint8_t* code[10000];
uint8_t* data[10000];
for (unsigned i = 0; i < 10000; ++i) {
uintptr_t CodeSize = i % 16 + 1;
uintptr_t DataSize = i % 8 + 1;
bool isReadOnly = i % 3 == 0;
unsigned Align = 8 << (i % 4);
code[i] = MemMgr->allocateCodeSection(CodeSize, Align, i, "");
data[i] = MemMgr->allocateDataSection(DataSize, Align, i + 10000, "",
isReadOnly);
for (unsigned j = 0; j < CodeSize; j++) {
code[i][j] = 1 + (i % 254);
}
for (unsigned j = 0; j < DataSize; j++) {
data[i][j] = 2 + (i % 254);
}
EXPECT_NE((uint8_t *)nullptr, code[i]);
EXPECT_NE((uint8_t *)nullptr, data[i]);
uintptr_t CodeAlign = Align ? (uintptr_t)code[i] % Align : 0;
uintptr_t DataAlign = Align ? (uintptr_t)data[i] % Align : 0;
EXPECT_EQ((uintptr_t)0, CodeAlign);
EXPECT_EQ((uintptr_t)0, DataAlign);
}
for (unsigned i = 0; i < 10000; ++i) {
uintptr_t CodeSize = i % 16 + 1;
uintptr_t DataSize = i % 8 + 1;
for (unsigned j = 0; j < CodeSize; j++) {
uint8_t ExpectedCode = 1 + (i % 254);
EXPECT_EQ(ExpectedCode, code[i][j]);
}
for (unsigned j = 0; j < DataSize; j++) {
uint8_t ExpectedData = 2 + (i % 254);
EXPECT_EQ(ExpectedData, data[i][j]);
}
}
}
} // Namespace
|
