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
|
/*
* Copyright © 2009 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:
* Eric Anholt <eric@anholt.net>
*
*/
/** @file gem_linear_blits.c
*
* This is a test of doing many blits, with a working set
* larger than the aperture size.
*
* The goal is to simply ensure the basics work.
*/
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <fcntl.h>
#include <inttypes.h>
#include <errno.h>
#include <sys/stat.h>
#include <sys/time.h>
#include <drm.h>
#include "i915/gem.h"
#include "i915/gem_create.h"
#include "igt.h"
#include "igt_types.h"
#include "intel_blt.h"
/**
* TEST: gem linear blits
* Description: Test doing many blits with a working set larger than the aperture size.
* Category: Core
* Mega feature: General Core features
* Sub-category: Blitter tests
* Functionality: linear blits
* Feature: blitter
* Test category: GEM_Legacy
*
* SUBTEST: basic
* Description: Basic blitter functionality check with 2 buffers
*
* SUBTEST: interruptible
* Description: Test with interrupts in between the parent process
*
* SUBTEST: normal
* Description: The intent is to push beyond the working GTT size to force the driver to rebind the buffers
*/
IGT_TEST_DESCRIPTION("Test doing many blits with a working set larger than the"
" aperture size.");
#define WIDTH 512
#define HEIGHT 512
/* We don't have alignment detection yet, so assume worst case scenario */
#define ALIGNMENT (2048*1024)
static uint32_t linear[WIDTH*HEIGHT];
static void copy(int fd, uint64_t ahnd, uint32_t dst, uint32_t src,
uint64_t dst_offset, uint64_t src_offset, bool do_relocs)
{
uint32_t batch[12];
struct drm_i915_gem_relocation_entry reloc[2];
struct drm_i915_gem_exec_object2 obj[3];
struct drm_i915_gem_execbuffer2 exec;
static uint32_t devid;
int i = 0;
memset(obj, 0, sizeof(obj));
obj[0].handle = dst;
obj[0].offset = CANONICAL(dst_offset);
obj[0].flags = EXEC_OBJECT_WRITE | EXEC_OBJECT_SUPPORTS_48B_ADDRESS;
obj[1].handle = src;
obj[1].offset = CANONICAL(src_offset);
obj[1].flags = EXEC_OBJECT_SUPPORTS_48B_ADDRESS;
obj[2].handle = gem_create(fd, 4096);
obj[2].offset = intel_allocator_alloc(ahnd, obj[2].handle,
4096, ALIGNMENT);
obj[2].offset = CANONICAL(obj[2].offset);
obj[2].flags = EXEC_OBJECT_SUPPORTS_48B_ADDRESS;
devid = intel_get_drm_devid(fd);
if (blt_has_xy_src_copy(fd)) {
batch[i++] = XY_SRC_COPY_BLT_CMD |
XY_SRC_COPY_BLT_WRITE_ALPHA |
XY_SRC_COPY_BLT_WRITE_RGB;
if (intel_gen(intel_get_drm_devid(fd)) >= 8)
batch[i - 1] |= 8;
else
batch[i - 1] |= 6;
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++] = obj[0].offset;
if (intel_gen(devid) >= 8)
batch[i++] = obj[0].offset >> 32;
batch[i++] = 0; /* src x1,y1 */
batch[i++] = WIDTH * 4;
batch[i++] = obj[1].offset;
if (intel_gen(devid) >= 8)
batch[i++] = obj[1].offset >> 32;
batch[i++] = MI_BATCH_BUFFER_END;
batch[i++] = MI_NOOP;
} else if (blt_has_fast_copy(fd)) {
batch[i++] = XY_FAST_COPY_BLT;
batch[i++] = XY_FAST_COPY_COLOR_DEPTH_32 | WIDTH * 4;
batch[i++] = 0; /* dst x1,y1 */
batch[i++] = (HEIGHT << 16) | WIDTH; /* dst x2,y2 */
batch[i++] = obj[0].offset; /* dst address lower bits */
batch[i++] = obj[0].offset >> 32; /* dst address upper bits */
batch[i++] = 0; /* src x1,y1 */
batch[i++] = WIDTH * 4; /* src pitch */
batch[i++] = obj[1].offset; /* src address lower bits */
batch[i++] = obj[1].offset >> 32; /* src address upper bits */
batch[i++] = MI_BATCH_BUFFER_END;
batch[i++] = MI_NOOP;
} else {
igt_assert_f(0, "No supported blit command found\n");
}
gem_write(fd, obj[2].handle, 0, batch, i * sizeof(batch[0]));
memset(reloc, 0, sizeof(reloc));
reloc[0].target_handle = dst;
reloc[0].delta = 0;
reloc[0].offset = 4 * sizeof(batch[0]);
reloc[0].presumed_offset = obj[0].offset;
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 = obj[1].offset;
reloc[1].read_domains = I915_GEM_DOMAIN_RENDER;
reloc[1].write_domain = 0;
if (do_relocs) {
obj[2].relocation_count = ARRAY_SIZE(reloc);
obj[2].relocs_ptr = to_user_pointer(reloc);
} else {
obj[0].flags |= EXEC_OBJECT_PINNED;
obj[1].flags |= EXEC_OBJECT_PINNED;
obj[2].flags |= EXEC_OBJECT_PINNED;
}
memset(&exec, 0, sizeof(exec));
exec.buffers_ptr = to_user_pointer(obj);
exec.buffer_count = ARRAY_SIZE(obj);
exec.batch_len = i * sizeof(batch[0]);
exec.flags = gem_has_blt(fd) ? I915_EXEC_BLT : 0;
gem_execbuf(fd, &exec);
intel_allocator_free(ahnd, obj[2].handle);
gem_close(fd, obj[2].handle);
}
static uint32_t
create_bo(int fd, uint32_t val)
{
uint32_t handle;
int i;
handle = gem_create(fd, sizeof(linear));
/* Fill the BO with dwords starting at val */
for (i = 0; i < WIDTH*HEIGHT; i++)
linear[i] = val++;
gem_write(fd, handle, 0, linear, sizeof(linear));
return handle;
}
static void
check_bo(int fd, uint32_t handle, uint32_t val)
{
int num_errors;
int i;
gem_read(fd, handle, 0, linear, sizeof(linear));
num_errors = 0;
for (i = 0; i < WIDTH*HEIGHT; i++) {
igt_warn_on_f(linear[i] != val && num_errors++ < 32,
"[%08x] Expected 0x%08x, found 0x%08x (difference 0x%08x)\n",
i * 4, val, linear[i], val ^ linear[i]);
val++;
}
igt_assert_eq(num_errors, 0);
}
static void run_test(int fd, int count, bool do_relocs)
{
uint32_t *handle, *start_val;
uint64_t *offset, ahnd;
int i;
ahnd = intel_allocator_open(fd, 0, do_relocs ?
INTEL_ALLOCATOR_RELOC :
INTEL_ALLOCATOR_SIMPLE);
handle = malloc(sizeof(uint32_t) * count * 2);
offset = calloc(1, sizeof(uint64_t) * count);
igt_assert_f(handle && offset, "Allocation failed\n");
start_val = handle + count;
for (i = 0; i < count; i++) {
start_val[i] = rand();
handle[i] = create_bo(fd, start_val[i]);
offset[i] = intel_allocator_alloc(ahnd, handle[i],
sizeof(linear), ALIGNMENT);
}
for (i = 0; i < count; i++) {
int src = random() % count;
int dst = random() % count;
if (src == dst)
continue;
copy(fd, ahnd, handle[dst], handle[src],
offset[dst], offset[src], do_relocs);
start_val[dst] = start_val[src];
}
for (i = 0; i < count; i++) {
check_bo(fd, handle[i], start_val[i]);
intel_allocator_free(ahnd, handle[i]);
gem_close(fd, handle[i]);
}
free(handle);
free(offset);
intel_allocator_close(ahnd);
}
#define MAX_32b ((1ull << 32) - 4096)
igt_main
{
const int ncpus = sysconf(_SC_NPROCESSORS_ONLN);
uint64_t count = 0;
bool do_relocs;
igt_fd_t(fd);
igt_fixture {
fd = drm_open_driver(DRIVER_INTEL);
igt_require_gem(fd);
gem_require_blitter(fd);
do_relocs = !gem_uses_ppgtt(fd);
count = gem_aperture_size(fd);
if (count >> 32)
count = MAX_32b;
else
do_relocs = true;
count = 3 + count / (1024*1024);
igt_require(count > 1);
igt_require_memory(count, sizeof(linear), CHECK_RAM);
igt_debug("Using %'"PRIu64" 1MiB buffers\n", count);
count = (count + ncpus - 1) / ncpus;
}
igt_describe("Basic blitter functionality check with 2 buffers");
igt_subtest("basic")
run_test(fd, 2, do_relocs);
igt_subtest_group {
igt_fixture {
intel_allocator_multiprocess_start();
}
igt_describe("The intent is to push beyond the working GTT size to force"
" the driver to rebind the buffers");
igt_subtest("normal") {
igt_fork(child, ncpus)
run_test(fd, count, do_relocs);
igt_waitchildren();
}
igt_describe("Test with interrupts in between the parent process");
igt_subtest("interruptible") {
igt_fork_signal_helper();
igt_fork(child, ncpus)
run_test(fd, count, do_relocs);
igt_waitchildren();
igt_stop_signal_helper();
}
igt_fixture {
intel_allocator_multiprocess_stop();
}
}
}
|