mirror of
https://github.com/tiagovignatti/intel-gpu-tools.git
synced 2025-06-08 08:26:10 +00:00
Apply the new API to all call sites within the test suite using the following semantic patch: // Semantic patch for replacing drm_open_any* with arch-specific drm_open_driver* calls @@ identifier i =~ "\bdrm_open_any\b"; @@ - i() + drm_open_driver(DRIVER_INTEL) @@ identifier i =~ "\bdrm_open_any_master\b"; @@ - i() + drm_open_driver_master(DRIVER_INTEL) @@ identifier i =~ "\bdrm_open_any_render\b"; @@ - i() + drm_open_driver_render(DRIVER_INTEL) @@ identifier i =~ "\b__drm_open_any\b"; @@ - i() + __drm_open_driver(DRIVER_INTEL) Signed-off-by: Micah Fedke <micah.fedke@collabora.co.uk> Signed-off-by: Thomas Wood <thomas.wood@intel.com>
253 lines
6.3 KiB
C
253 lines
6.3 KiB
C
/*
|
|
* Copyright © 2011 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>
|
|
*
|
|
*/
|
|
|
|
#define _GNU_SOURCE
|
|
|
|
#include "igt.h"
|
|
#include <stdlib.h>
|
|
#include <sys/ioctl.h>
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <fcntl.h>
|
|
#include <inttypes.h>
|
|
#include <errno.h>
|
|
|
|
#include <drm.h>
|
|
|
|
|
|
IGT_TEST_DESCRIPTION("Test execbuf fence accounting.");
|
|
|
|
#define WIDTH 1024
|
|
#define HEIGHT 1024
|
|
#define OBJECT_SIZE (4*WIDTH*HEIGHT)
|
|
|
|
#define BATCH_SIZE 4096
|
|
|
|
#define MAX_FENCES 32
|
|
|
|
/*
|
|
* Testcase: execbuf fence accounting
|
|
*
|
|
* We had a bug where we were falsely accounting upon reservation already
|
|
* fenced buffers as occupying a fence register even if they did not require
|
|
* one for the batch.
|
|
*
|
|
* We aim to exercise this by performing a sequence of fenced BLT
|
|
* with 2*num_avail_fence buffers, but alternating which half are fenced in
|
|
* each command.
|
|
*/
|
|
|
|
static drm_intel_bufmgr *bufmgr;
|
|
struct intel_batchbuffer *batch;
|
|
uint32_t devid;
|
|
|
|
static void emit_dummy_load(void)
|
|
{
|
|
int i;
|
|
uint32_t tile_flags = 0;
|
|
uint32_t tiling_mode = I915_TILING_X;
|
|
unsigned long pitch;
|
|
drm_intel_bo *dummy_bo;
|
|
|
|
dummy_bo = drm_intel_bo_alloc_tiled(bufmgr, "tiled dummy_bo", 2048, 2048,
|
|
4, &tiling_mode, &pitch, 0);
|
|
|
|
if (IS_965(devid)) {
|
|
pitch /= 4;
|
|
tile_flags = XY_SRC_COPY_BLT_SRC_TILED |
|
|
XY_SRC_COPY_BLT_DST_TILED;
|
|
}
|
|
|
|
for (i = 0; i < 5; i++) {
|
|
BLIT_COPY_BATCH_START(tile_flags);
|
|
OUT_BATCH((3 << 24) | /* 32 bits */
|
|
(0xcc << 16) | /* copy ROP */
|
|
pitch);
|
|
OUT_BATCH(0 << 16 | 1024);
|
|
OUT_BATCH((2048) << 16 | (2048));
|
|
OUT_RELOC_FENCED(dummy_bo, I915_GEM_DOMAIN_RENDER, I915_GEM_DOMAIN_RENDER, 0);
|
|
OUT_BATCH(0 << 16 | 0);
|
|
OUT_BATCH(pitch);
|
|
OUT_RELOC_FENCED(dummy_bo, I915_GEM_DOMAIN_RENDER, 0, 0);
|
|
ADVANCE_BATCH();
|
|
|
|
if (batch->gen >= 6) {
|
|
BEGIN_BATCH(3, 0);
|
|
OUT_BATCH(XY_SETUP_CLIP_BLT_CMD);
|
|
OUT_BATCH(0);
|
|
OUT_BATCH(0);
|
|
ADVANCE_BATCH();
|
|
}
|
|
}
|
|
intel_batchbuffer_flush(batch);
|
|
|
|
drm_intel_bo_unreference(dummy_bo);
|
|
}
|
|
|
|
static uint32_t
|
|
tiled_bo_create (int fd)
|
|
{
|
|
uint32_t handle;
|
|
|
|
handle = gem_create(fd, OBJECT_SIZE);
|
|
|
|
gem_set_tiling(fd, handle, I915_TILING_X, WIDTH*4);
|
|
|
|
return handle;
|
|
}
|
|
|
|
static uint32_t
|
|
batch_create (int fd)
|
|
{
|
|
uint32_t buf[] = { MI_BATCH_BUFFER_END, 0 };
|
|
uint32_t batch_handle;
|
|
|
|
batch_handle = gem_create(fd, BATCH_SIZE);
|
|
|
|
gem_write(fd, batch_handle, 0, buf, sizeof(buf));
|
|
|
|
return batch_handle;
|
|
}
|
|
|
|
static void fill_reloc(struct drm_i915_gem_relocation_entry *reloc, uint32_t handle)
|
|
{
|
|
reloc->offset = 2 * sizeof(uint32_t);
|
|
reloc->target_handle = handle;
|
|
reloc->read_domains = I915_GEM_DOMAIN_RENDER;
|
|
reloc->write_domain = 0;
|
|
}
|
|
|
|
static int __gem_execbuf(int fd, struct drm_i915_gem_execbuffer2 *eb)
|
|
{
|
|
int err = 0;
|
|
if (drmIoctl(fd, DRM_IOCTL_I915_GEM_EXECBUFFER2, eb))
|
|
err = errno;
|
|
return err;
|
|
}
|
|
|
|
#define BUSY_LOAD (1 << 0)
|
|
#define INTERRUPTIBLE (1 << 1)
|
|
|
|
static void run_test(int fd, int num_fences, int expected_errno,
|
|
unsigned flags)
|
|
{
|
|
struct drm_i915_gem_execbuffer2 execbuf[2];
|
|
struct drm_i915_gem_exec_object2 exec[2][2*MAX_FENCES+3];
|
|
struct drm_i915_gem_relocation_entry reloc[2*MAX_FENCES+2];
|
|
|
|
int i, n;
|
|
int loop = 1000;
|
|
|
|
if (flags & BUSY_LOAD) {
|
|
bufmgr = drm_intel_bufmgr_gem_init(fd, 4096);
|
|
batch = intel_batchbuffer_alloc(bufmgr, devid);
|
|
|
|
/* Takes forever otherwise. */
|
|
loop = 50;
|
|
}
|
|
|
|
if (flags & INTERRUPTIBLE)
|
|
igt_fork_signal_helper();
|
|
|
|
memset(execbuf, 0, sizeof(execbuf));
|
|
memset(exec, 0, sizeof(exec));
|
|
memset(reloc, 0, sizeof(reloc));
|
|
|
|
for (n = 0; n < 2*num_fences; n++) {
|
|
uint32_t handle = tiled_bo_create(fd);
|
|
exec[1][2*num_fences - n-1].handle = exec[0][n].handle = handle;
|
|
fill_reloc(&reloc[n], handle);
|
|
}
|
|
|
|
for (i = 0; i < 2; i++) {
|
|
for (n = 0; n < num_fences; n++)
|
|
exec[i][n].flags = EXEC_OBJECT_NEEDS_FENCE;
|
|
|
|
exec[i][2*num_fences].handle = batch_create(fd);
|
|
exec[i][2*num_fences].relocs_ptr = (uintptr_t)reloc;
|
|
exec[i][2*num_fences].relocation_count = 2*num_fences;
|
|
|
|
execbuf[i].buffers_ptr = (uintptr_t)exec[i];
|
|
execbuf[i].buffer_count = 2*num_fences+1;
|
|
execbuf[i].batch_len = 2*sizeof(uint32_t);
|
|
}
|
|
|
|
do {
|
|
if (flags & BUSY_LOAD)
|
|
emit_dummy_load();
|
|
|
|
igt_assert_eq(__gem_execbuf(fd, &execbuf[0]), expected_errno);
|
|
igt_assert_eq(__gem_execbuf(fd, &execbuf[1]), expected_errno);
|
|
} while (--loop);
|
|
|
|
if (flags & INTERRUPTIBLE)
|
|
igt_stop_signal_helper();
|
|
|
|
/* Cleanup */
|
|
for (n = 0; n < 2*num_fences; n++)
|
|
gem_close(fd, exec[0][n].handle);
|
|
|
|
for (i = 0; i < 2; i++)
|
|
gem_close(fd, exec[i][2*num_fences].handle);
|
|
|
|
if (flags & BUSY_LOAD) {
|
|
intel_batchbuffer_free(batch);
|
|
drm_intel_bufmgr_destroy(bufmgr);
|
|
}
|
|
}
|
|
|
|
int fd;
|
|
int num_fences;
|
|
|
|
igt_main
|
|
{
|
|
igt_skip_on_simulation();
|
|
|
|
igt_fixture {
|
|
fd = drm_open_driver(DRIVER_INTEL);
|
|
num_fences = gem_available_fences(fd);
|
|
igt_assert(num_fences > 4);
|
|
devid = intel_get_drm_devid(fd);
|
|
|
|
igt_assert(num_fences <= MAX_FENCES);
|
|
}
|
|
|
|
igt_subtest("2-spare-fences")
|
|
run_test(fd, num_fences - 2, 0, 0);
|
|
for (unsigned flags = 0; flags < 4; flags++) {
|
|
igt_subtest_f("no-spare-fences%s%s",
|
|
flags & BUSY_LOAD ? "-busy" : "",
|
|
flags & INTERRUPTIBLE ? "-interruptible" : "")
|
|
run_test(fd, num_fences, 0, flags);
|
|
}
|
|
igt_subtest("too-many-fences")
|
|
run_test(fd, num_fences + 1, intel_gen(devid) >= 4 ? 0 : EDEADLK, 0);
|
|
|
|
igt_fixture
|
|
close(fd);
|
|
}
|