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
|
/*
* 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_tiled_blits.c
*
* This is a test of doing many tiled blits, with a working set
* larger than the aperture size.
*
* The goal is to catch a couple types of failure;
* - Fence management problems on pre-965.
* - A17 or L-shaped memory tiling workaround problems in acceleration.
*
* The model is to fill a collection of 1MB objects in a way that can't trip
* over A6 swizzling -- upload data to a non-tiled object, blit to the tiled
* object. Then, copy the 1MB objects randomly between each other for a while.
* Finally, download their data through linear objects again and see what
* resulted.
*/
#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 "igt.h"
/**
* TEST: gem tiled blits
* Description: Test doing many tiled blits, with a working set larger than the aperture size.
* Category: Core
* Mega feature: General Core features
* Sub-category: Memory management tests
* Functionality: tiled blits
* Feature: gtt, mapping
*
* SUBTEST: basic
* Description: Check basic functionality.
*
* SUBTEST: interruptible
* Description: Check with interrupts in parallel execution.
*
* SUBTEST: normal
* Description: Check with parallel execution.
*/
IGT_TEST_DESCRIPTION("Test doing many tiled blits, with a working set larger"
" than the aperture size.");
static int width = 512, height = 512;
static void
copy_buf(struct intel_bb *ibb, struct intel_buf *src, struct intel_buf *dst)
{
intel_bb_blt_copy(ibb,
src, 0, 0, src->surface[0].stride,
dst, 0, 0, dst->surface[0].stride,
width, height, 32);
}
static struct intel_buf *
create_bo(struct buf_ops *bops, struct intel_bb *ibb, uint32_t x)
{
struct intel_buf *buf, *linear_buf;
uint32_t *linear;
int i;
buf = intel_buf_create(bops, width, height, 32, 0,
I915_TILING_X, I915_COMPRESSION_NONE);
linear_buf = intel_buf_create(bops, width, height, 32, 0,
I915_TILING_NONE, I915_COMPRESSION_NONE);
/* Fill the BO with dwords starting at start_val */
linear = intel_buf_cpu_map(linear_buf, 1);
for (i = 0; i < width * height; i++)
linear[i] = x++;
intel_buf_unmap(linear_buf);
copy_buf(ibb, linear_buf, buf);
intel_buf_destroy(linear_buf);
return buf;
}
static void
check_bo(struct intel_buf *buf, uint32_t val, struct intel_bb *ibb)
{
struct intel_buf *linear_buf;
uint32_t *linear;
int num_errors;
int i;
linear_buf = intel_buf_create(buf->bops, width, height, 32, 0,
I915_TILING_NONE, I915_COMPRESSION_NONE);
copy_buf(ibb, buf, linear_buf);
linear = intel_buf_cpu_map(linear_buf, 0);
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);
intel_buf_unmap(linear_buf);
intel_buf_destroy(linear_buf);
}
static void run_test(int fd, int count)
{
struct intel_bb *ibb;
struct buf_ops *bops;
struct intel_buf **bo;
uint32_t *bo_start_val;
int i;
bops = buf_ops_create(fd);
ibb = intel_bb_create(fd, 4096);
bo = malloc(sizeof(struct intel_buf *)*count);
bo_start_val = malloc(sizeof(uint32_t)*count);
for (i = 0; i < count; i++) {
bo_start_val[i] = rand();
bo[i] = create_bo(bops, ibb, bo_start_val[i]);
}
for (i = 0; i < count + 1; i++) {
int src = random() % count;
int dst = random() % count;
if (src == dst)
continue;
copy_buf(ibb, bo[src], bo[dst]);
bo_start_val[dst] = bo_start_val[src];
}
for (i = 0; i < count; i++) {
check_bo(bo[i], bo_start_val[i], ibb);
intel_buf_destroy(bo[i]);
}
free(bo_start_val);
free(bo);
intel_bb_destroy(ibb);
buf_ops_destroy(bops);
}
#define MAX_32b ((1ull << 32) - 4096)
igt_main
{
const int ncpus = sysconf(_SC_NPROCESSORS_ONLN);
uint64_t count = 0;
int fd = -1;
igt_fixture {
fd = drm_open_driver(DRIVER_INTEL);
igt_require_gem(fd);
gem_require_blitter(fd);
gem_require_mappable_ggtt(fd);
count = gem_aperture_size(fd);
if (count >> 32)
count = MAX_32b;
count = 3 + count / (1024 * 1024);
igt_require(count > 1);
igt_require_memory(count, 1024 * 1024 , CHECK_RAM);
igt_debug("Using %'"PRIu64" 1MiB buffers\n", count);
count = (count + ncpus - 1) / ncpus;
}
igt_describe("Check basic functionality.");
igt_subtest("basic")
run_test(fd, 2);
igt_subtest_group {
igt_fixture {
intel_allocator_multiprocess_start();
}
igt_describe("Check with parallel execution.");
igt_subtest("normal") {
igt_fork(child, ncpus)
run_test(fd, count);
igt_waitchildren();
}
igt_describe("Check with interrupts in parallel execution.");
igt_subtest("interruptible") {
igt_fork_signal_helper();
igt_fork(child, ncpus)
run_test(fd, count);
igt_waitchildren();
igt_stop_signal_helper();
}
igt_fixture {
intel_allocator_multiprocess_stop();
}
}
igt_fixture {
drm_close_driver(fd);
}
}
|