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
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
|
/*
* Copyright (C) 2013 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <stdlib.h>
#include <string.h>
#include <sys/mman.h>
#include <gtest/gtest.h>
#include "buffer_tests.h"
#define FENCEPOST_LENGTH 8
static int g_single_aligns[][2] = {
// Both buffers at same alignment.
{ 1, 0 },
{ 2, 0 },
{ 4, 0 },
{ 8, 0 },
{ 16, 0 },
{ 32, 0 },
{ 64, 0 },
{ 128, 0 },
// General unaligned cases.
{ 4, 1 },
{ 4, 2 },
{ 4, 3 },
{ 8, 1 },
{ 8, 2 },
{ 8, 3 },
{ 8, 4 },
{ 8, 5 },
{ 8, 6 },
{ 8, 7 },
{ 128, 1 },
{ 128, 4 },
{ 128, 8 },
{ 128, 12 },
{ 128, 16 },
};
static const size_t g_single_aligns_len = sizeof(g_single_aligns)/sizeof(int[2]);
// Set of multiple buffer alignment combinations to be used for string/memory
// testing routines.
static int g_double_aligns[][4] = {
// Both buffers at same alignment.
{ 1, 0, 1, 0 },
{ 2, 0, 2, 0 },
{ 4, 0, 4, 0 },
{ 8, 0, 8, 0 },
{ 16, 0, 16, 0 },
{ 32, 0, 32, 0 },
{ 64, 0, 64, 0 },
{ 128, 0, 128, 0 },
// Different word alignments between buffers.
{ 8, 0, 4, 0 },
{ 4, 0, 8, 0 },
{ 16, 0, 4, 0 },
{ 4, 0, 16, 0 },
// General unaligned cases.
{ 4, 0, 4, 1 },
{ 4, 0, 4, 2 },
{ 4, 0, 4, 3 },
{ 4, 1, 4, 0 },
{ 4, 1, 4, 1 },
{ 4, 1, 4, 2 },
{ 4, 1, 4, 3 },
{ 4, 2, 4, 0 },
{ 4, 2, 4, 1 },
{ 4, 2, 4, 2 },
{ 4, 2, 4, 3 },
{ 4, 3, 4, 0 },
{ 4, 3, 4, 1 },
{ 4, 3, 4, 2 },
{ 4, 3, 4, 3 },
{ 8, 0, 8, 1 },
{ 8, 0, 8, 2 },
{ 8, 0, 8, 3 },
{ 8, 0, 8, 4 },
{ 8, 0, 8, 5 },
{ 8, 0, 8, 6 },
{ 8, 0, 8, 7 },
{ 8, 1, 8, 0 },
{ 8, 1, 8, 1 },
{ 8, 1, 8, 2 },
{ 8, 1, 8, 3 },
{ 8, 1, 8, 4 },
{ 8, 1, 8, 5 },
{ 8, 1, 8, 6 },
{ 8, 1, 8, 7 },
{ 8, 2, 8, 0 },
{ 8, 2, 8, 1 },
{ 8, 2, 8, 2 },
{ 8, 2, 8, 3 },
{ 8, 2, 8, 4 },
{ 8, 2, 8, 5 },
{ 8, 2, 8, 6 },
{ 8, 2, 8, 7 },
{ 8, 3, 8, 0 },
{ 8, 3, 8, 1 },
{ 8, 3, 8, 2 },
{ 8, 3, 8, 3 },
{ 8, 3, 8, 4 },
{ 8, 3, 8, 5 },
{ 8, 3, 8, 6 },
{ 8, 3, 8, 7 },
{ 8, 4, 8, 0 },
{ 8, 4, 8, 1 },
{ 8, 4, 8, 2 },
{ 8, 4, 8, 3 },
{ 8, 4, 8, 4 },
{ 8, 4, 8, 5 },
{ 8, 4, 8, 6 },
{ 8, 4, 8, 7 },
{ 8, 5, 8, 0 },
{ 8, 5, 8, 1 },
{ 8, 5, 8, 2 },
{ 8, 5, 8, 3 },
{ 8, 5, 8, 4 },
{ 8, 5, 8, 5 },
{ 8, 5, 8, 6 },
{ 8, 5, 8, 7 },
{ 8, 6, 8, 0 },
{ 8, 6, 8, 1 },
{ 8, 6, 8, 2 },
{ 8, 6, 8, 3 },
{ 8, 6, 8, 4 },
{ 8, 6, 8, 5 },
{ 8, 6, 8, 6 },
{ 8, 6, 8, 7 },
{ 8, 7, 8, 0 },
{ 8, 7, 8, 1 },
{ 8, 7, 8, 2 },
{ 8, 7, 8, 3 },
{ 8, 7, 8, 4 },
{ 8, 7, 8, 5 },
{ 8, 7, 8, 6 },
{ 8, 7, 8, 7 },
{ 128, 1, 128, 4 },
{ 128, 1, 128, 8 },
{ 128, 1, 128, 12 },
{ 128, 1, 128, 16 },
{ 128, 4, 128, 1 },
{ 128, 8, 128, 1 },
{ 128, 12, 128, 1 },
{ 128, 16, 128, 1 },
};
static const size_t g_double_aligns_len = sizeof(g_double_aligns)/sizeof(int[4]);
static size_t SetIncrement(size_t len) {
if (len >= 4096) {
return 1024;
} else if (len >= 1024) {
return 256;
}
return 1;
}
// Return a pointer into the current buffer with the specified alignment.
static void *GetAlignedPtr(void *orig_ptr, int alignment, int or_mask) {
uint64_t ptr = reinterpret_cast<uint64_t>(orig_ptr);
if (alignment > 0) {
// When setting the alignment, set it to exactly the alignment chosen.
// The pointer returned will be guaranteed not to be aligned to anything
// more than that.
ptr += alignment - (ptr & (alignment - 1));
ptr |= alignment | or_mask;
}
return reinterpret_cast<void*>(ptr);
}
static void SetFencepost(uint8_t *buffer) {
for (int i = 0; i < FENCEPOST_LENGTH; i += 2) {
buffer[i] = 0xde;
buffer[i+1] = 0xad;
}
}
static void VerifyFencepost(uint8_t *buffer) {
for (int i = 0; i < FENCEPOST_LENGTH; i += 2) {
if (buffer[i] != 0xde || buffer[i+1] != 0xad) {
uint8_t expected_value;
if (buffer[i] == 0xde) {
i++;
expected_value = 0xad;
} else {
expected_value = 0xde;
}
ASSERT_EQ(expected_value, buffer[i]);
}
}
}
void RunSingleBufferAlignTest(
size_t max_test_size, void (*test_func)(uint8_t*, size_t),
size_t (*set_incr)(size_t)) {
if (!set_incr) {
set_incr = SetIncrement;
}
// Allocate one large buffer with lots of extra space so that we can
// guarantee that the all possible alignments will fit.
uint8_t *buf = new uint8_t[3*max_test_size];
uint8_t *buf_align;
for (size_t i = 0; i < g_single_aligns_len; i++) {
size_t incr = 1;
for (size_t len = 0; len <= max_test_size; len += incr) {
incr = set_incr(len);
buf_align = reinterpret_cast<uint8_t*>(GetAlignedPtr(
buf+FENCEPOST_LENGTH, g_single_aligns[i][0], g_single_aligns[i][1]));
SetFencepost(&buf_align[-FENCEPOST_LENGTH]);
SetFencepost(&buf_align[len]);
test_func(buf_align, len);
if (buf_align != buf) {
VerifyFencepost(&buf_align[-FENCEPOST_LENGTH]);
}
VerifyFencepost(&buf_align[len]);
}
}
delete buf;
}
void RunSrcDstBufferAlignTest(
size_t max_test_size, void (*test_func)(uint8_t*, uint8_t*, size_t),
size_t (*set_incr)(size_t)) {
if (!set_incr) {
set_incr = SetIncrement;
}
// Allocate two large buffers for all of the testing.
uint8_t* src = new uint8_t[3*max_test_size];
uint8_t* dst = new uint8_t[3*max_test_size];
uint8_t* src_align;
uint8_t* dst_align;
for (size_t i = 0; i < g_double_aligns_len; i++) {
size_t incr = 1;
for (size_t len = 0; len <= max_test_size; len += incr) {
incr = set_incr(len);
src_align =
reinterpret_cast<uint8_t*>(GetAlignedPtr(
src+FENCEPOST_LENGTH, g_double_aligns[i][0], g_double_aligns[i][1]));
dst_align =
reinterpret_cast<uint8_t*>(GetAlignedPtr(
dst+FENCEPOST_LENGTH, g_double_aligns[i][2], g_double_aligns[i][3]));
SetFencepost(&dst_align[-FENCEPOST_LENGTH]);
SetFencepost(&dst_align[len]);
test_func(src_align, dst_align, len);
if (dst_align != dst) {
VerifyFencepost(&dst_align[-FENCEPOST_LENGTH]);
}
VerifyFencepost(&dst_align[len]);
}
}
delete src;
delete dst;
}
void RunSingleBufferOverreadTest(void (*test_func)(uint8_t*, size_t)) {
// In order to verify that functions are not reading past the end of the
// src, create data that ends exactly at an unreadable memory boundary.
size_t pagesize = static_cast<size_t>(sysconf(_SC_PAGE_SIZE));
uint8_t* memory;
ASSERT_TRUE(posix_memalign(reinterpret_cast<void**>(&memory), pagesize,
2*pagesize) == 0);
memset(memory, 0x23, 2*pagesize);
// Make the second page unreadable and unwritable.
ASSERT_TRUE(mprotect(&memory[pagesize], pagesize, PROT_NONE) == 0);
for (size_t i = 0; i < pagesize; i++) {
uint8_t* buf = &memory[pagesize-i];
test_func(buf, i);
}
ASSERT_TRUE(mprotect(&memory[pagesize], pagesize, PROT_READ | PROT_WRITE) == 0);
free(memory);
}
void RunSrcDstBufferOverreadTest(void (*test_func)(uint8_t*, uint8_t*, size_t)) {
// In order to verify that functions are not reading past the end of the
// src, create data that ends exactly at an unreadable memory boundary.
size_t pagesize = static_cast<size_t>(sysconf(_SC_PAGE_SIZE));
uint8_t* memory;
ASSERT_TRUE(posix_memalign(reinterpret_cast<void**>(&memory), pagesize,
2*pagesize) == 0);
memset(memory, 0x23, 2*pagesize);
// Make the second page unreadable and unwritable.
ASSERT_TRUE(mprotect(&memory[pagesize], pagesize, PROT_NONE) == 0);
uint8_t* dst = new uint8_t[pagesize];
for (size_t i = 0; i < pagesize; i++) {
uint8_t* src = &memory[pagesize-i];
test_func(src, dst, i);
}
ASSERT_TRUE(mprotect(&memory[pagesize], pagesize, PROT_READ | PROT_WRITE) == 0);
free(memory);
delete dst;
}
|