mirror of
https://github.com/tiagovignatti/intel-gpu-tools.git
synced 2025-06-09 00:46:17 +00:00
Add a header that includes all the headers for the library. This allows reorganisation of the library without affecting programs using it and also simplifies the headers that need to be included to use the library. Signed-off-by: Thomas Wood <thomas.wood@intel.com>
236 lines
6.9 KiB
C
236 lines
6.9 KiB
C
/*
|
|
* 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 nop batch which is really big
|
|
*
|
|
* Mostly useful to stress-test the error-capture code
|
|
*/
|
|
|
|
#include "igt.h"
|
|
#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"
|
|
|
|
IGT_TEST_DESCRIPTION("Run a large nop batch to stress test the error capture"
|
|
" code.");
|
|
|
|
#define FORCE_PREAD_PWRITE 0
|
|
|
|
static int use_64bit_relocs;
|
|
|
|
static void exec1(int fd, uint32_t handle, uint64_t reloc_ofs, unsigned flags, char *ptr)
|
|
{
|
|
struct drm_i915_gem_execbuffer2 execbuf;
|
|
struct drm_i915_gem_exec_object2 gem_exec[1];
|
|
struct drm_i915_gem_relocation_entry gem_reloc[1];
|
|
|
|
gem_reloc[0].offset = reloc_ofs;
|
|
gem_reloc[0].delta = 0;
|
|
gem_reloc[0].target_handle = handle;
|
|
gem_reloc[0].read_domains = I915_GEM_DOMAIN_RENDER;
|
|
gem_reloc[0].write_domain = 0;
|
|
gem_reloc[0].presumed_offset = 0;
|
|
|
|
gem_exec[0].handle = handle;
|
|
gem_exec[0].relocation_count = 1;
|
|
gem_exec[0].relocs_ptr = (uintptr_t) gem_reloc;
|
|
gem_exec[0].alignment = 0;
|
|
gem_exec[0].offset = 0;
|
|
gem_exec[0].flags = 0;
|
|
gem_exec[0].rsvd1 = 0;
|
|
gem_exec[0].rsvd2 = 0;
|
|
|
|
execbuf.buffers_ptr = (uintptr_t)gem_exec;
|
|
execbuf.buffer_count = 1;
|
|
execbuf.batch_start_offset = 0;
|
|
execbuf.batch_len = 8;
|
|
execbuf.cliprects_ptr = 0;
|
|
execbuf.num_cliprects = 0;
|
|
execbuf.DR1 = 0;
|
|
execbuf.DR4 = 0;
|
|
execbuf.flags = flags;
|
|
i915_execbuffer2_set_context_id(execbuf, 0);
|
|
execbuf.rsvd2 = 0;
|
|
|
|
/* Avoid hitting slowpaths in the reloc processing which might yield a
|
|
* presumed_offset of -1. Happens when the batch is still busy from the
|
|
* last round. */
|
|
gem_sync(fd, handle);
|
|
|
|
gem_execbuf(fd, &execbuf);
|
|
|
|
igt_warn_on(gem_reloc[0].presumed_offset == -1);
|
|
|
|
if (use_64bit_relocs) {
|
|
uint64_t tmp;
|
|
if (ptr)
|
|
tmp = *(uint64_t *)(ptr+reloc_ofs);
|
|
else
|
|
gem_read(fd, handle, reloc_ofs, &tmp, sizeof(tmp));
|
|
igt_assert_eq(tmp, gem_reloc[0].presumed_offset);
|
|
} else {
|
|
uint32_t tmp;
|
|
if (ptr)
|
|
tmp = *(uint32_t *)(ptr+reloc_ofs);
|
|
else
|
|
gem_read(fd, handle, reloc_ofs, &tmp, sizeof(tmp));
|
|
igt_assert_eq(tmp, gem_reloc[0].presumed_offset);
|
|
}
|
|
}
|
|
|
|
static void execN(int fd, uint32_t handle, uint64_t batch_size, unsigned flags, char *ptr)
|
|
{
|
|
#define reloc_ofs(N, T) ((((N)+1) << 12) - 4*(1 + ((N) == ((T)-1))))
|
|
struct drm_i915_gem_execbuffer2 execbuf;
|
|
struct drm_i915_gem_exec_object2 gem_exec[1];
|
|
struct drm_i915_gem_relocation_entry *gem_reloc;
|
|
uint64_t n, nreloc = batch_size >> 12;
|
|
|
|
gem_reloc = calloc(nreloc, sizeof(*gem_reloc));
|
|
igt_assert(gem_reloc);
|
|
|
|
for (n = 0; n < nreloc; n++) {
|
|
gem_reloc[n].offset = reloc_ofs(n, nreloc);
|
|
gem_reloc[n].target_handle = handle;
|
|
gem_reloc[n].read_domains = I915_GEM_DOMAIN_RENDER;
|
|
gem_reloc[n].presumed_offset = n ^ 0xbeefdeaddeadbeef;
|
|
if (ptr) {
|
|
if (use_64bit_relocs)
|
|
*(uint64_t *)(ptr + gem_reloc[n].offset) = gem_reloc[n].presumed_offset;
|
|
else
|
|
*(uint32_t *)(ptr + gem_reloc[n].offset) = gem_reloc[n].presumed_offset;
|
|
} else
|
|
gem_write(fd, handle, gem_reloc[n].offset, &gem_reloc[n].presumed_offset, 4*(1+use_64bit_relocs));
|
|
}
|
|
|
|
memset(gem_exec, 0, sizeof(gem_exec));
|
|
gem_exec[0].handle = handle;
|
|
gem_exec[0].relocation_count = nreloc;
|
|
gem_exec[0].relocs_ptr = (uintptr_t)gem_reloc;
|
|
|
|
memset(&execbuf, 0, sizeof(execbuf));
|
|
execbuf.buffers_ptr = (uintptr_t)gem_exec;
|
|
execbuf.buffer_count = 1;
|
|
execbuf.batch_start_offset = 0;
|
|
execbuf.batch_len = 8;
|
|
execbuf.flags = flags;
|
|
|
|
/* Avoid hitting slowpaths in the reloc processing which might yield a
|
|
* presumed_offset of -1. Happens when the batch is still busy from the
|
|
* last round. */
|
|
gem_sync(fd, handle);
|
|
|
|
gem_execbuf(fd, &execbuf);
|
|
for (n = 0; n < nreloc; n++)
|
|
igt_warn_on(gem_reloc[n].presumed_offset == -1);
|
|
|
|
if (use_64bit_relocs) {
|
|
for (n = 0; n < nreloc; n++) {
|
|
uint64_t tmp;
|
|
if (ptr)
|
|
tmp = *(uint64_t *)(ptr+reloc_ofs(n, nreloc));
|
|
else
|
|
gem_read(fd, handle, reloc_ofs(n, nreloc), &tmp, sizeof(tmp));
|
|
igt_assert_eq(tmp, gem_reloc[n].presumed_offset);
|
|
}
|
|
} else {
|
|
for (n = 0; n < nreloc; n++) {
|
|
uint32_t tmp;
|
|
if (ptr)
|
|
tmp = *(uint32_t *)(ptr+reloc_ofs(n, nreloc));
|
|
else
|
|
gem_read(fd, handle, reloc_ofs(n, nreloc), &tmp, sizeof(tmp));
|
|
igt_assert_eq(tmp, gem_reloc[n].presumed_offset);
|
|
}
|
|
}
|
|
|
|
free(gem_reloc);
|
|
#undef reloc_ofs
|
|
}
|
|
|
|
igt_simple_main
|
|
{
|
|
uint32_t batch[2] = {MI_BATCH_BUFFER_END};
|
|
uint64_t batch_size, max, reloc_ofs;
|
|
int fd;
|
|
|
|
fd = drm_open_any();
|
|
use_64bit_relocs = intel_gen(intel_get_drm_devid(fd)) >= 8;
|
|
|
|
max = 3 * gem_aperture_size(fd) / 4;
|
|
intel_require_memory(1, max, CHECK_RAM);
|
|
|
|
for (batch_size = 4096; batch_size <= max; ) {
|
|
uint32_t handle;
|
|
void *ptr;
|
|
|
|
handle = gem_create(fd, batch_size);
|
|
gem_write(fd, handle, 0, batch, sizeof(batch));
|
|
|
|
if (!FORCE_PREAD_PWRITE && gem_has_llc(fd))
|
|
ptr = gem_mmap__cpu(fd, handle, 0, batch_size, PROT_READ);
|
|
else if (!FORCE_PREAD_PWRITE && gem_mmap__has_wc(fd))
|
|
ptr = gem_mmap__wc(fd, handle, 0, batch_size, PROT_READ);
|
|
else
|
|
ptr = NULL;
|
|
|
|
for (reloc_ofs = 4096; reloc_ofs < batch_size; reloc_ofs += 4096) {
|
|
igt_debug("batch_size %llu, reloc_ofs %llu\n",
|
|
(long long)batch_size, (long long)reloc_ofs);
|
|
exec1(fd, handle, reloc_ofs, 0, ptr);
|
|
exec1(fd, handle, reloc_ofs, I915_EXEC_SECURE, ptr);
|
|
}
|
|
|
|
igt_debug("batch_size %llu, all %ld relocs\n",
|
|
(long long)batch_size, (long)(batch_size >> 12));
|
|
execN(fd, handle, batch_size, 0, ptr);
|
|
execN(fd, handle, batch_size, I915_EXEC_SECURE, ptr);
|
|
|
|
if (ptr)
|
|
munmap(ptr, batch_size);
|
|
gem_madvise(fd, handle, I915_MADV_DONTNEED);
|
|
|
|
if (batch_size < max && 2*batch_size > max)
|
|
batch_size = max;
|
|
else
|
|
batch_size *= 2;
|
|
}
|
|
|
|
close(fd);
|
|
}
|