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
|
/*
* Copyright © 2011,2012 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.
*
* Authors:
* Chris Wilson <chris@chris-wilson.co.uk>
* Daniel Vetter <daniel.vetter@ffwll.ch>
*
*/
/*
* Testcase: run a couple of big batches to force the eviction code.
*/
#include <unistd.h>
#include <stdlib.h>
#include <stdint.h>
#include <stdio.h>
#include <string.h>
#include <fcntl.h>
#include <inttypes.h>
#include <errno.h>
#include <sys/stat.h>
#include <sys/ioctl.h>
#include <sys/time.h>
#include "drm.h"
#include "i915_drm.h"
#include "drmtest.h"
#define HEIGHT 256
#define WIDTH 1024
static void
copy(int fd, uint32_t dst, uint32_t src, uint32_t *all_bo, int n_bo, int error)
{
uint32_t batch[12];
struct drm_i915_gem_relocation_entry reloc[2];
struct drm_i915_gem_exec_object2 *obj;
struct drm_i915_gem_execbuffer2 exec;
uint32_t handle;
int n, ret, i=0;
batch[i++] = (XY_SRC_COPY_BLT_CMD |
XY_SRC_COPY_BLT_WRITE_ALPHA |
XY_SRC_COPY_BLT_WRITE_RGB);
batch[i++] = (3 << 24) | /* 32 bits */
(0xcc << 16) | /* copy ROP */
WIDTH*4;
batch[i++] = 0; /* dst x1,y1 */
batch[i++] = (HEIGHT << 16) | WIDTH; /* dst x2,y2 */
batch[i++] = 0; /* dst reloc */
if (intel_gen(intel_get_drm_devid(fd)) >= 8)
batch[i++] = 0; /* FIXME */
batch[i++] = 0; /* src x1,y1 */
batch[i++] = WIDTH*4;
batch[i++] = 0; /* src reloc */
if (intel_gen(intel_get_drm_devid(fd)) >= 8)
batch[i++] = 0; /* FIXME */
batch[i++] = MI_BATCH_BUFFER_END;
batch[i++] = MI_NOOP;
handle = gem_create(fd, 4096);
gem_write(fd, handle, 0, batch, sizeof(batch));
reloc[0].target_handle = dst;
reloc[0].delta = 0;
reloc[0].offset = 4 * sizeof(batch[0]);
reloc[0].presumed_offset = 0;
reloc[0].read_domains = I915_GEM_DOMAIN_RENDER;
reloc[0].write_domain = I915_GEM_DOMAIN_RENDER;
reloc[1].target_handle = src;
reloc[1].delta = 0;
reloc[1].offset = 7 * sizeof(batch[0]);
if (intel_gen(intel_get_drm_devid(fd)) >= 8)
reloc[1].offset += sizeof(batch[0]);
reloc[1].presumed_offset = 0;
reloc[1].read_domains = I915_GEM_DOMAIN_RENDER;
reloc[1].write_domain = 0;
obj = calloc(n_bo + 1, sizeof(*obj));
for (n = 0; n < n_bo; n++)
obj[n].handle = all_bo[n];
obj[n].handle = handle;
obj[n].relocation_count = 2;
obj[n].relocs_ptr = (uintptr_t)reloc;
exec.buffers_ptr = (uintptr_t)obj;
exec.buffer_count = n_bo + 1;
exec.batch_start_offset = 0;
exec.batch_len = i * 4;
exec.DR1 = exec.DR4 = 0;
exec.num_cliprects = 0;
exec.cliprects_ptr = 0;
exec.flags = HAS_BLT_RING(intel_get_drm_devid(fd)) ? I915_EXEC_BLT : 0;
i915_execbuffer2_set_context_id(exec, 0);
exec.rsvd2 = 0;
ret = drmIoctl(fd, DRM_IOCTL_I915_GEM_EXECBUFFER2, &exec);
if (ret)
ret = errno;
igt_assert(ret == error);
gem_close(fd, handle);
free(obj);
}
static void exchange_uint32_t(void *array, unsigned i, unsigned j)
{
uint32_t *i_arr = array;
uint32_t i_tmp;
i_tmp = i_arr[i];
i_arr[i] = i_arr[j];
i_arr[j] = i_tmp;
}
#define min(a, b) ((a) < (b) ? (a) : (b))
#define INTERRUPTIBLE (1 << 0)
#define SWAPPING (1 << 1)
#define DUP_DRMFD (1 << 2)
#define MEMORY_PRESSURE (1 << 3)
#define ALL_FLAGS (INTERRUPTIBLE | SWAPPING | DUP_DRMFD | MEMORY_PRESSURE)
static void forked_evictions(int fd, int size, int count,
unsigned flags)
{
uint32_t *bo;
int n, pass, l;
int num_threads = sysconf(_SC_NPROCESSORS_ONLN);
int bo_count;
igt_require((uint64_t)count * size / (1024 * 1024) < intel_get_total_ram_mb() * 9 / 10);
if (flags & SWAPPING) {
igt_require(intel_get_total_ram_mb() / 4 < intel_get_total_swap_mb());
bo_count = intel_get_total_ram_mb() * 11 / 10;
if (bo_count < count)
bo_count = count;
} else
bo_count = count;
bo = malloc(bo_count*sizeof(*bo));
igt_assert(bo);
for (n = 0; n < bo_count; n++)
bo[n] = gem_create(fd, size);
igt_fork(i, min(count, min(num_threads * 5, 12))) {
int realfd = fd;
int num_passes = flags & SWAPPING ? 10 : 100;
/* Every fork should have a different permutation! */
srand(i * 63);
if (flags & INTERRUPTIBLE)
igt_fork_signal_helper();
igt_permute_array(bo, bo_count, exchange_uint32_t);
if (flags & DUP_DRMFD) {
realfd = drm_open_any();
/* We can overwrite the bo array since we're forked. */
for (l = 0; l < count; l++) {
uint32_t flink;
flink = gem_flink(fd, bo[l]);
bo[l] = gem_open(realfd, flink);
}
}
for (pass = 0; pass < num_passes; pass++) {
copy(realfd, bo[0], bo[1], bo, count, 0);
for (l = 0; l < count && (flags & MEMORY_PRESSURE); l++) {
uint32_t *base = gem_mmap__cpu(realfd, bo[l],
size,
PROT_READ | PROT_WRITE);
memset(base, 0, size);
munmap(base, size);
}
}
if (flags & INTERRUPTIBLE)
igt_stop_signal_helper();
/* drmfd closing will take care of additional bo refs */
if (flags & DUP_DRMFD)
close(realfd);
}
igt_waitchildren();
for (n = 0; n < bo_count; n++)
gem_close(fd, bo[n]);
free(bo);
}
static void swapping_evictions(int fd, int size, int count)
{
uint32_t *bo;
int i, n, pass;
int bo_count;
igt_require((uint64_t)count * size / (1024 * 1024) < intel_get_total_ram_mb() * 9 / 10);
igt_require(intel_get_total_ram_mb() / 4 < intel_get_total_swap_mb());
bo_count = intel_get_total_ram_mb() * 11 / 10;
if (bo_count < count)
bo_count = count;
bo = malloc(bo_count*sizeof(*bo));
igt_assert(bo);
for (n = 0; n < bo_count; n++)
bo[n] = gem_create(fd, size);
for (i = 0; i < bo_count/32; i++) {
igt_permute_array(bo, bo_count, exchange_uint32_t);
for (pass = 0; pass < 100; pass++) {
copy(fd, bo[0], bo[1], bo, count, 0);
}
}
for (n = 0; n < bo_count; n++)
gem_close(fd, bo[n]);
free(bo);
}
static void minor_evictions(int fd, int size, int count)
{
uint32_t *bo, *sel;
int n, m, pass, fail;
igt_require((uint64_t)count * size / (1024 * 1024) < intel_get_total_ram_mb() * 9 / 10);
bo = malloc(3*count*sizeof(*bo));
igt_assert(bo);
for (n = 0; n < 2*count; n++)
bo[n] = gem_create(fd, size);
sel = bo + n;
for (fail = 0, m = 0; fail < 10; fail++) {
for (pass = 0; pass < 100; pass++) {
for (n = 0; n < count; n++, m += 7)
sel[n] = bo[m%(2*count)];
copy(fd, sel[0], sel[1], sel, count, 0);
}
copy(fd, bo[0], bo[0], bo, 2*count, ENOSPC);
}
for (n = 0; n < 2*count; n++)
gem_close(fd, bo[n]);
free(bo);
}
static void major_evictions(int fd, int size, int count)
{
int n, m, loop;
uint32_t *bo;
igt_require((uint64_t)count * size / (1024 * 1024) < intel_get_total_ram_mb() * 9 / 10);
bo = malloc(count*sizeof(*bo));
igt_assert(bo);
for (n = 0; n < count; n++)
bo[n] = gem_create(fd, size);
for (loop = 0, m = 0; loop < 100; loop++, m += 17) {
n = m % count;
copy(fd, bo[n], bo[n], &bo[n], 1, 0);
}
for (n = 0; n < count; n++)
gem_close(fd, bo[n]);
free(bo);
}
igt_main
{
int size, count, fd;
size = count = 0;
fd = -1;
igt_skip_on_simulation();
igt_fixture {
fd = drm_open_any();
size = 1024 * 1024;
count = 3*gem_aperture_size(fd) / size / 4;
}
for (unsigned flags = 0; flags < ALL_FLAGS + 1; flags++) {
igt_subtest_f("forked%s%s%s-%s",
flags & SWAPPING ? "-swapping" : "",
flags & DUP_DRMFD ? "-multifd" : "",
flags & MEMORY_PRESSURE ? "-mempressure" : "",
flags & INTERRUPTIBLE ? "interruptible" : "normal") {
forked_evictions(fd, size, count, flags);
}
}
igt_subtest("swapping-normal")
swapping_evictions(fd, size, count);
igt_subtest("minor-normal")
minor_evictions(fd, size, count);
igt_subtest("major-normal") {
size = 3*gem_aperture_size(fd) / 4;
count = 4;
major_evictions(fd, size, count);
}
igt_fixture {
size = 1024 * 1024;
count = 3*gem_aperture_size(fd) / size / 4;
}
igt_fork_signal_helper();
igt_subtest("swapping-interruptible")
swapping_evictions(fd, size, count);
igt_subtest("minor-interruptible")
minor_evictions(fd, size, count);
igt_subtest("major-interruptible") {
size = 3*gem_aperture_size(fd) / 4;
count = 4;
major_evictions(fd, size, count);
}
igt_stop_signal_helper();
igt_fixture {
close(fd);
}
}
|