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
|
/*
* 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:
* Daniel Vetter <daniel.vetter@ffwll.ch>
*
*/
/** @file gem_tiled_pread_pwrite.c
*
* This is a test of pread's behavior on tiled objects with respect to the
* reported swizzling value.
*
* The goal is to exercise the slow_bit17_copy path for reading on bit17
* machines, but will also be useful for catching swizzling value bugs on
* other systems.
*/
/*
* Testcase: Exercise swizzle code for swapping
*
* The swizzle checks in the swapin path are at a different place than the ones
* for pread/pwrite, so we need to check them separately.
*
* This test obviously needs swap present (and exits if none is detected).
*/
#include "igt.h"
#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 <sys/ioctl.h>
#include <pthread.h>
#include "drm.h"
#include "i915/gem_create.h"
/**
* TEST: gem tiled swapping
* Description: Exercise swizzle code for swapping.
* Category: Core
* Mega feature: General Core features
* Sub-category: Memory management tests
* Functionality: swapping
* Feature: gtt, mapping
*
* SUBTEST: non-threaded
*
* SUBTEST: threaded
*/
IGT_TEST_DESCRIPTION("Exercise swizzle code for swapping.");
#define WIDTH 512
#define HEIGHT 512
#define LINEAR_DWORDS (4 * WIDTH * HEIGHT)
static uint32_t current_tiling_mode;
#define PAGE_SIZE 4096
#define AVAIL_RAM 512ul
static uint32_t
create_bo(int fd)
{
uint32_t handle;
uint32_t *data;
handle = gem_create(fd, LINEAR_DWORDS);
gem_set_tiling(fd, handle, current_tiling_mode, WIDTH * sizeof(uint32_t));
data = __gem_mmap__gtt(fd, handle, LINEAR_DWORDS, PROT_READ | PROT_WRITE);
if (data == NULL) {
gem_close(fd, handle);
return 0;
}
munmap(data, LINEAR_DWORDS);
return handle;
}
static void
fill_bo(int fd, uint32_t handle)
{
uint32_t *data;
int i;
data = gem_mmap__gtt(fd, handle, LINEAR_DWORDS,
PROT_READ | PROT_WRITE);
gem_set_domain(fd, handle, I915_GEM_DOMAIN_GTT, I915_GEM_DOMAIN_GTT);
for (i = 0; i < WIDTH*HEIGHT; i++)
data[i] = i;
munmap(data, LINEAR_DWORDS);
}
static void
check_bo(int fd, uint32_t handle)
{
uint32_t *data;
int j;
data = gem_mmap__gtt(fd, handle, LINEAR_DWORDS, PROT_READ);
gem_set_domain(fd, handle, I915_GEM_DOMAIN_GTT, 0);
j = rand() % (WIDTH * HEIGHT);
igt_assert_f(data[j] == j, "mismatch at %i: %i\n", j, data[j]);
munmap(data, LINEAR_DWORDS);
}
uint32_t *bo_handles;
struct thread {
pthread_t thread;
int *idx_arr;
int fd, count;
};
static void *thread_run(void *data)
{
struct thread *t = data;
int i;
for (i = 0; i < t->count; i++)
check_bo(t->fd, bo_handles[t->idx_arr[i]]);
return NULL;
}
static void thread_init(struct thread *t, int fd, int count)
{
int i;
t->fd = fd;
t->count = count;
t->idx_arr = calloc(count, sizeof(int));
igt_assert(t->idx_arr);
for (i = 0; i < count; i++)
t->idx_arr[i] = i;
igt_permute_array(t->idx_arr, count, igt_exchange_int);
}
static void thread_fini(struct thread *t)
{
free(t->idx_arr);
}
static void check_memory_layout(int fd)
{
igt_skip_on_f(igt_debugfs_search(fd, "i915_swizzle_info", "L-shaped"),
"L-shaped memory configuration detected\n");
igt_debug("normal memory configuration detected, continuing\n");
}
igt_main
{
unsigned long n, count;
struct thread *threads;
int fd, num_threads;
igt_fixture {
size_t lock_size;
current_tiling_mode = I915_TILING_X;
fd = drm_open_driver(DRIVER_INTEL);
gem_require_mappable_ggtt(fd);
igt_purge_vm_caches(fd);
check_memory_layout(fd);
/* lock RAM, leaving only 512MB available */
count = igt_get_total_ram_mb() - igt_get_avail_ram_mb();
count = max(count + 64, AVAIL_RAM);
count = igt_get_total_ram_mb() - count;
lock_size = max_t(long, 0, count);
igt_info("Mlocking %zdMiB of %ld/%ldMiB\n",
lock_size,
(long)igt_get_avail_ram_mb(),
(long)igt_get_total_ram_mb());
igt_lock_mem(lock_size);
/* need slightly more than available memory */
count = igt_get_avail_ram_mb() + 128;
igt_info("Using %lu 1MiB objects (available RAM: %ld/%ld, swap: %ld)\n",
count,
(long)igt_get_avail_ram_mb(),
(long)igt_get_total_ram_mb(),
(long)igt_get_total_swap_mb());
bo_handles = calloc(count, sizeof(uint32_t));
igt_assert(bo_handles);
num_threads = gem_available_fences(fd) + 1;
igt_info("Using up to %d fences/threads\n", num_threads);
threads = calloc(num_threads, sizeof(struct thread));
igt_assert(threads);
igt_require_memory(count, 1024*1024, CHECK_RAM | CHECK_SWAP);
for (n = 0; n < count; n++) {
bo_handles[n] = create_bo(fd);
/* Not enough mmap address space possible. */
igt_require(bo_handles[n]);
}
}
igt_subtest("non-threaded") {
for (n = 0; n < count; n++)
fill_bo(fd, bo_handles[n]);
thread_init(&threads[0], fd, count);
thread_run(&threads[0]);
thread_run(&threads[0]);
thread_run(&threads[0]);
thread_fini(&threads[0]);
}
/* Once more with threads */
igt_subtest("threaded") {
for (n = 0; n < count; n++)
fill_bo(fd, bo_handles[n]);
for (n = 0; n < num_threads; n++)
thread_init(&threads[n], fd, count);
thread_run(&threads[0]);
for (n = 0; n < num_threads; n++)
pthread_create(&threads[n].thread, NULL, thread_run, &threads[n]);
for (n = 0; n < num_threads; n++)
pthread_join(threads[n].thread, NULL);
thread_run(&threads[0]);
for (n = 0; n < num_threads; n++)
thread_fini(&threads[n]);
}
igt_fixture
drm_close_driver(fd);
}
|