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
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
|
/*
* Copyright © 2016 Intel Corporation
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice (including the next
* paragraph) shall be included in all copies or substantial portions of the
* Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
* IN THE SOFTWARE.
*
*/
/** @file gem_shrink.c
*
* Exercise the shrinker by overallocating GEM objects
*/
#include "igt.h"
#include "igt_gt.h"
#include "igt_debugfs.h"
#include "igt_sysfs.h"
#ifndef MADV_FREE
#define MADV_FREE 8
#endif
static void get_pages(int fd, uint64_t alloc)
{
uint32_t handle = gem_create(fd, alloc);
gem_set_domain(fd, handle, I915_GEM_DOMAIN_GTT, 0);
gem_madvise(fd, handle, I915_MADV_DONTNEED);
}
static void pwrite_(int fd, uint64_t alloc)
{
uint32_t tmp;
uint32_t handle = gem_create(fd, alloc);
for (int page = 0; page < alloc>>12; page++)
gem_write(fd, handle, (page + page % 4095) & ~3, &tmp, 4);
gem_madvise(fd, handle, I915_MADV_DONTNEED);
}
static void pread_(int fd, uint64_t alloc)
{
uint32_t tmp;
uint32_t handle = gem_create(fd, alloc);
for (int page = 0; page < alloc>>12; page++)
gem_read(fd, handle, (page + page % 4095) & ~3, &tmp, 4);
gem_madvise(fd, handle, I915_MADV_DONTNEED);
}
static void mmap_gtt(int fd, uint64_t alloc)
{
uint32_t handle = gem_create(fd, alloc);
uint32_t *ptr = gem_mmap__gtt(fd, handle, alloc, PROT_WRITE);
for (int page = 0; page < alloc>>12; page++)
ptr[page<<10] = 0;
munmap(ptr, alloc);
gem_madvise(fd, handle, I915_MADV_DONTNEED);
}
static void mmap_cpu(int fd, uint64_t alloc)
{
uint32_t handle = gem_create(fd, alloc);
uint32_t *ptr = gem_mmap__cpu(fd, handle, 0, alloc, PROT_WRITE);
for (int page = 0; page < alloc>>12; page++)
ptr[page<<10] = 0;
munmap(ptr, alloc);
gem_madvise(fd, handle, I915_MADV_DONTNEED);
}
static void execbuf1(int fd, uint64_t alloc)
{
const uint32_t bbe = MI_BATCH_BUFFER_END;
struct drm_i915_gem_exec_object2 obj;
struct drm_i915_gem_execbuffer2 execbuf;
memset(&obj, 0, sizeof(obj));
memset(&execbuf, 0, sizeof(execbuf));
execbuf.buffers_ptr = to_user_pointer(&obj);
execbuf.buffer_count = 1;
obj.handle = gem_create(fd, alloc);
gem_write(fd, obj.handle, 0, &bbe, sizeof(bbe));
gem_execbuf(fd, &execbuf);
gem_madvise(fd, obj.handle, I915_MADV_DONTNEED);
}
/* Since we want to trigger oom (SIGKILL), we don't want small allocations
* to fail and generate a false error (SIGSEGV)! So we redirect allocations
* though GEM objects, which should be much more likely to trigger oom. There
* are still small allocations within the kernel, so still a small chance of
* ENOMEM instead of a full oom.
*/
static void *__gem_calloc(int fd, size_t count, size_t size, uint64_t *out_size)
{
uint32_t handle;
uint64_t total;
void *ptr;
total = count * size;
total = (total + 4095) & -4096;
handle = gem_create(fd, total);
ptr = gem_mmap__cpu(fd, handle, 0, total, PROT_WRITE);
gem_set_domain(fd, handle, I915_GEM_DOMAIN_CPU, I915_GEM_DOMAIN_CPU);
gem_close(fd, handle);
*out_size = total;
return ptr;
}
static void execbufN(int fd, uint64_t alloc)
{
const uint32_t bbe = MI_BATCH_BUFFER_END;
struct drm_i915_gem_exec_object2 *obj;
struct drm_i915_gem_execbuffer2 execbuf;
int count = alloc >> 20;
uint64_t obj_size;
obj = __gem_calloc(fd, alloc + 1, sizeof(*obj), &obj_size);
memset(&execbuf, 0, sizeof(execbuf));
obj[count].handle = gem_create(fd, 4096);
gem_write(fd, obj[count].handle, 0, &bbe, sizeof(bbe));
for (int i = 1; i <= count; i++) {
int j = count - i;
obj[j].handle = gem_create(fd, 1 << 20);
execbuf.buffers_ptr = to_user_pointer(&obj[j]);
execbuf.buffer_count = i + 1;
gem_execbuf(fd, &execbuf);
}
for (int i = 0; i <= count; i++)
gem_madvise(fd, obj[i].handle, I915_MADV_DONTNEED);
munmap(obj, obj_size);
}
static void hang(int fd, uint64_t alloc)
{
const uint32_t bbe = MI_BATCH_BUFFER_END;
struct drm_i915_gem_exec_object2 *obj;
struct drm_i915_gem_execbuffer2 execbuf;
int count = alloc >> 20;
uint64_t obj_size;
obj = __gem_calloc(fd, alloc + 1, sizeof(*obj), &obj_size);
memset(&execbuf, 0, sizeof(execbuf));
obj[count].handle = gem_create(fd, 4096);
gem_write(fd, obj[count].handle, 0, &bbe, sizeof(bbe));
for (int i = 1; i <= count; i++) {
int j = count - i;
obj[j].handle = gem_create(fd, 1 << 20);
execbuf.buffers_ptr = to_user_pointer(&obj[j]);
execbuf.buffer_count = i + 1;
gem_execbuf(fd, &execbuf);
}
gem_close(fd, igt_hang_ring(fd, 0).handle);
for (int i = 0; i <= count; i++)
gem_madvise(fd, obj[i].handle, I915_MADV_DONTNEED);
munmap(obj, obj_size);
}
static void userptr(int fd, uint64_t alloc)
{
struct local_i915_gem_userptr userptr;
void *ptr;
igt_assert((alloc & 4095) == 0);
ptr = mmap(NULL, alloc,
PROT_READ | PROT_WRITE, MAP_ANON | MAP_PRIVATE,
-1, 0);
igt_assert(ptr != (void *)-1);
memset(&userptr, 0, sizeof(userptr));
userptr.user_size = alloc;
userptr.user_ptr = to_user_pointer(ptr);
do_ioctl(fd, LOCAL_IOCTL_I915_GEM_USERPTR, &userptr);
gem_set_domain(fd, userptr.handle, I915_GEM_DOMAIN_GTT, 0);
madvise(ptr, alloc, MADV_FREE);
}
static bool has_userptr(void)
{
struct local_i915_gem_userptr userptr;
int fd = drm_open_driver(DRIVER_INTEL);
int err;
memset(&userptr, 0, sizeof(userptr));
userptr.user_size = 8192;
userptr.user_ptr = -4096;
err = 0;
if (drmIoctl(fd, LOCAL_IOCTL_I915_GEM_USERPTR, &userptr))
err = errno;
close(fd);
return err == EFAULT;
}
static void leak(int fd, uint64_t alloc)
{
char *ptr;
ptr = mmap(NULL, alloc, PROT_READ | PROT_WRITE,
MAP_ANON | MAP_PRIVATE | MAP_POPULATE,
-1, 0);
if (ptr != (char *)-1)
return;
while (alloc) {
alloc -= 4096;
ptr[alloc] = 0;
}
}
#define SOLO 1
#define USERPTR 2
#define OOM 4
static void run_test(int nchildren, uint64_t alloc,
void (*func)(int, uint64_t), unsigned flags)
{
const int timeout = flags & SOLO ? 1 : 20;
/* Each pass consumes alloc bytes and doesn't drop
* its reference to object (i.e. calls
* gem_madvise(DONTNEED) instead of gem_close()).
* After nchildren passes we expect each process
* to have enough objects to consume all of memory
* if left unchecked.
*/
if (flags & SOLO)
nchildren = 1;
/* Background load */
if (flags & OOM) {
igt_fork(child, nchildren) {
igt_until_timeout(timeout) {
int fd = drm_open_driver(DRIVER_INTEL);
for (int pass = 0; pass < nchildren; pass++)
leak(fd, alloc);
close(fd);
}
}
}
if (flags & USERPTR) {
igt_require(has_userptr());
igt_fork(child, (nchildren + 1)/2) {
igt_until_timeout(timeout) {
int fd = drm_open_driver(DRIVER_INTEL);
for (int pass = 0; pass < nchildren; pass++)
userptr(fd, alloc);
close(fd);
}
}
nchildren = (nchildren + 1)/2;
}
/* Exercise major ioctls */
igt_fork(child, nchildren) {
igt_until_timeout(timeout) {
int fd = drm_open_driver(DRIVER_INTEL);
for (int pass = 0; pass < nchildren; pass++)
func(fd, alloc);
close(fd);
}
}
igt_waitchildren();
}
static void reclaim(unsigned engine, int timeout)
{
const uint64_t timeout_100ms = 100000000LL;
int fd = drm_open_driver(DRIVER_INTEL);
int debugfs = igt_debugfs_dir(fd);
igt_spin_t *spin;
volatile uint32_t *shared;
shared = mmap(0, 4096, PROT_WRITE, MAP_SHARED | MAP_ANON, -1, 0);
igt_assert(shared != MAP_FAILED);
igt_fork(child, sysconf(_SC_NPROCESSORS_ONLN)) {
do {
igt_sysfs_printf(debugfs, "i915_drop_caches",
"%d", DROP_BOUND | DROP_UNBOUND);
} while (!*shared);
}
spin = igt_spin_batch_new(fd, engine, 0);
igt_until_timeout(timeout) {
igt_spin_t *next = __igt_spin_batch_new(fd, engine, 0);
igt_spin_batch_set_timeout(spin, timeout_100ms);
gem_sync(fd, spin->handle);
igt_spin_batch_free(fd, spin);
spin = next;
}
igt_spin_batch_free(fd, spin);
*shared = 1;
igt_waitchildren();
munmap((void *)shared, 4096);
close(debugfs);
close(fd);
}
igt_main
{
const struct test {
const char *name;
void (*func)(int, uint64_t);
} tests[] = {
{ "get-pages", get_pages },
{ "pwrite", pwrite_ },
{ "pread", pread_ },
{ "mmap-gtt", mmap_gtt },
{ "mmap-cpu", mmap_cpu },
{ "execbuf1", execbuf1 },
{ "execbufN", execbufN },
{ "hang", hang },
{ NULL },
};
const struct mode {
const char *suffix;
unsigned flags;
} modes[] = {
{ "-sanitycheck", SOLO },
{ "", 0 },
{ "-userptr", USERPTR },
{ "-oom", USERPTR | OOM },
{ NULL },
};
uint64_t alloc_size = 0;
int num_processes = 0;
igt_skip_on_simulation();
igt_fixture {
uint64_t mem_size = intel_get_total_ram_mb();
/* Spawn enough processes to use all memory, but each only
* uses half the available mappable aperture ~128MiB.
* Individually the processes would be ok, but en masse
* we expect the shrinker to start purging objects,
* and possibly fail.
*/
alloc_size = gem_mappable_aperture_size() / 2;
num_processes = 1 + (mem_size / (alloc_size >> 20));
igt_info("Using %d processes and %'lluMiB per process\n",
num_processes, (long long)(alloc_size >> 20));
intel_require_memory(num_processes, alloc_size,
CHECK_SWAP | CHECK_RAM);
}
igt_subtest("reclaim")
reclaim(I915_EXEC_DEFAULT, 2);
for(const struct test *t = tests; t->name; t++) {
for(const struct mode *m = modes; m->suffix; m++) {
igt_subtest_f("%s%s", t->name, m->suffix)
run_test(num_processes, alloc_size,
t->func, m->flags);
}
}
}
|