eviction_common.c 8.22 KB
Newer Older
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
/*
 * Copyright © 2007, 2011, 2013, 2014 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>
 *    Daniel Vetter <daniel.vetter@ffwll.ch>
 *    Tvrtko Ursulin <tvrtko.ursulin@intel.com>
 *
 */

30
#include "igt.h"
31 32 33
#include <stdlib.h>


34
struct igt_eviction_test_ops {
35
	uint32_t (*create)(int fd, uint64_t size);
36
	void (*flink)(uint32_t old_handle, uint32_t new_handle);
37
	void	 (*close)(int fd, uint32_t bo);
38 39
	int	 (*copy)(int fd, uint32_t dst, uint32_t src,
			 uint32_t *all_bo, int nr_bos);
40
	void	 (*clear)(int fd, uint32_t bo, uint64_t size);
41 42 43 44 45 46 47 48 49 50 51 52 53 54 55
};

#define FORKING_EVICTIONS_INTERRUPTIBLE	  (1 << 0)
#define FORKING_EVICTIONS_SWAPPING	  (1 << 1)
#define FORKING_EVICTIONS_DUP_DRMFD	  (1 << 2)
#define FORKING_EVICTIONS_MEMORY_PRESSURE (1 << 3)
#define ALL_FORKING_EVICTIONS	(FORKING_EVICTIONS_INTERRUPTIBLE | \
				 FORKING_EVICTIONS_SWAPPING | \
				 FORKING_EVICTIONS_DUP_DRMFD | \
				 FORKING_EVICTIONS_MEMORY_PRESSURE)

static void exchange_uint32_t(void *array, unsigned i, unsigned j)
{
	uint32_t *i_arr = array;

56
	igt_swap(i_arr[i], i_arr[j]);
57 58 59
}

static int minor_evictions(int fd, struct igt_eviction_test_ops *ops,
60 61
			   uint64_t surface_size,
			   uint64_t nr_surfaces)
62 63
{
	uint32_t *bo, *sel;
64 65
	uint64_t n, m, total_surfaces;
	int pass, fail;
66

67 68 69 70 71 72 73
	/* Make sure nr_surfaces is not divisible by seven
	 * to avoid duplicates in the selection loop below.
	 */
	nr_surfaces /= 7;
	nr_surfaces *= 7;
	nr_surfaces += 3;

74
	total_surfaces = gem_aperture_size(fd) / surface_size + 1;
75
	igt_require(nr_surfaces < total_surfaces);
76
	intel_require_memory(total_surfaces, surface_size, CHECK_RAM);
77

78
	bo = malloc((nr_surfaces + total_surfaces)*sizeof(*bo));
79 80
	igt_assert(bo);

81
	for (n = 0; n < total_surfaces; n++)
82 83 84 85
		bo[n] = ops->create(fd, surface_size);

	sel = bo + n;
	for (fail = 0, m = 0; fail < 10; fail++) {
86
		int ret;
87 88
		for (pass = 0; pass < 100; pass++) {
			for (n = 0; n < nr_surfaces; n++, m += 7)
89
				sel[n] = bo[m%total_surfaces];
90
			ret = ops->copy(fd, sel[0], sel[1], sel, nr_surfaces);
91
			igt_assert_eq(ret, 0);
92
		}
93
		ret = ops->copy(fd, bo[0], bo[0], bo, total_surfaces);
94
		igt_assert_eq(ret, -ENOSPC);
95 96
	}

97
	for (n = 0; n < total_surfaces; n++)
98 99 100 101 102 103 104
		ops->close(fd, bo[n]);
	free(bo);

	return 0;
}

static int major_evictions(int fd, struct igt_eviction_test_ops *ops,
105
			   uint64_t surface_size, uint64_t nr_surfaces)
106
{
107
	uint64_t n, m;
108
	uint32_t *bo;
109
	int ret, loop;
110

111
	intel_require_memory(nr_surfaces, surface_size, CHECK_RAM);
112 113 114 115 116 117 118 119 120

	bo = malloc(nr_surfaces*sizeof(*bo));
	igt_assert(bo);

	for (n = 0; n < nr_surfaces; n++)
		bo[n] = ops->create(fd, surface_size);

	for (loop = 0, m = 0; loop < 100; loop++, m += 17) {
		n = m % nr_surfaces;
121
		ret = ops->copy(fd, bo[n], bo[n], &bo[n], 1);
122
		igt_assert_eq(ret, 0);
123 124 125 126 127 128 129 130 131
	}

	for (n = 0; n < nr_surfaces; n++)
		ops->close(fd, bo[n]);
	free(bo);

	return 0;
}

132
static void mlocked_evictions(int fd, struct igt_eviction_test_ops *ops,
133 134
			      uint64_t surface_size,
			      uint64_t surface_count)
135
{
136
	uint64_t sz, pin, total;
137
	void *mem;
138 139 140

	intel_require_memory(surface_count, surface_size, CHECK_RAM);

141
	mem = intel_get_total_pinnable_mem(&total);
142
	igt_assert(mem != MAP_FAILED);
143 144 145 146 147
	pin = *(uint64_t *)mem;
	igt_assert(!munlock(mem, pin));

	sz = surface_size * surface_count;
	igt_require(pin > sz);
148 149

	igt_fork(child, 1) {
150
		uint32_t *bo;
151 152
		uint64_t n;
		int ret;
153
		size_t lock = pin - sz;
154

155
		bo = malloc(surface_count * sizeof(*bo));
156
		igt_assert(bo);
157
		lock -= ALIGN(surface_count * sizeof(*bo), 4096);
158

Ville Syrjälä's avatar
Ville Syrjälä committed
159
		igt_debug("Locking %'zu B (%'zu MiB)\n",
160 161
			  lock, lock >> 20);
		igt_assert(!mlock(mem, lock));
Ville Syrjälä's avatar
Ville Syrjälä committed
162
		igt_info("Locked %'zu B (%'zu MiB)\n",
163
			 lock, lock >> 20);
164 165 166 167 168 169 170 171

		for (n = 0; n < surface_count; n++)
			bo[n] = ops->create(fd, surface_size);

		for (n = 0; n < surface_count - 2; n++) {
			igt_permute_array(bo, surface_count, exchange_uint32_t);
			ret = ops->copy(fd, bo[0], bo[1], bo, surface_count-n);
			if (ret)
172
				exit(ret);
173 174 175 176 177

			/* Having used the surfaces (and so pulled out of
			 * our pages into memory), start a memory hog to
			 * force evictions.
			 */
178 179
			lock += surface_size;
			igt_assert(!mlock(mem, lock));
Ville Syrjälä's avatar
Ville Syrjälä committed
180
			igt_debug("Total locked %'zu B (%'zu MiB)\n",
181 182
				  lock,
				  lock >> 20);
183 184 185 186 187 188
		}

		for (n = 0; n < surface_count; n++)
			ops->close(fd, bo[n]);
	}
	igt_waitchildren();
189

190
	munmap(mem, total);
191 192
}

193
static int swapping_evictions(int fd, struct igt_eviction_test_ops *ops,
194 195 196
			      uint64_t surface_size,
			      uint64_t working_surfaces,
			      uint64_t trash_surfaces)
197 198
{
	uint32_t *bo;
199 200
	uint64_t i, n;
	int pass, ret;
201

202
	intel_require_memory(working_surfaces, surface_size, CHECK_RAM);
203 204 205 206

	if (trash_surfaces < working_surfaces)
		trash_surfaces = working_surfaces;

207
	intel_require_memory(trash_surfaces, surface_size, CHECK_RAM | CHECK_SWAP);
208

209 210 211 212 213 214 215 216 217 218
	bo = malloc(trash_surfaces*sizeof(*bo));
	igt_assert(bo);

	for (n = 0; n < trash_surfaces; n++)
		bo[n] = ops->create(fd, surface_size);

	for (i = 0; i < trash_surfaces/32; i++) {
		igt_permute_array(bo, trash_surfaces, exchange_uint32_t);

		for (pass = 0; pass < 100; pass++) {
219
			ret = ops->copy(fd, bo[0], bo[1], bo, working_surfaces);
220
			igt_assert_eq(ret, 0);
221 222 223 224 225 226 227 228 229 230 231
		}
	}

	for (n = 0; n < trash_surfaces; n++)
		ops->close(fd, bo[n]);
	free(bo);

	return 0;
}

static int forking_evictions(int fd, struct igt_eviction_test_ops *ops,
232 233 234 235
			     uint64_t surface_size,
			     uint64_t working_surfaces,
			     uint64_t trash_surfaces,
			     unsigned flags)
236
{
237 238
	const int num_threads = sysconf(_SC_NPROCESSORS_ONLN);
	uint64_t bo_count, n, l;
239
	uint32_t *bo;
240
	int pass, ret;
241

242
	intel_require_memory(working_surfaces, surface_size, CHECK_RAM);
243 244 245 246 247

	if (flags & FORKING_EVICTIONS_SWAPPING) {
		bo_count = trash_surfaces;
		if (bo_count < working_surfaces)
			bo_count = working_surfaces;
248

249 250 251
	} else
		bo_count = working_surfaces;

252
	igt_assert_lte(working_surfaces, bo_count);
253
	intel_require_memory(bo_count, surface_size, CHECK_RAM | CHECK_SWAP);
254

255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273
	bo = malloc(bo_count*sizeof(*bo));
	igt_assert(bo);

	for (n = 0; n < bo_count; n++)
		bo[n] = ops->create(fd, surface_size);

	igt_fork(i, min(num_threads * 4, 12)) {
		int realfd = fd;
		int num_passes = flags & FORKING_EVICTIONS_SWAPPING ? 10 : 100;

		/* Every fork should have a different permutation! */
		srand(i * 63);

		if (flags & FORKING_EVICTIONS_INTERRUPTIBLE)
			igt_fork_signal_helper();

		igt_permute_array(bo, bo_count, exchange_uint32_t);

		if (flags & FORKING_EVICTIONS_DUP_DRMFD) {
274
			realfd = drm_open_driver(DRIVER_INTEL);
275 276 277

			/* We can overwrite the bo array since we're forked. */
			for (l = 0; l < bo_count; l++) {
278 279
				uint32_t handle = bo[l];
				uint32_t flink = gem_flink(fd, bo[l]);
280 281

				bo[l] = gem_open(realfd, flink);
282 283
				if (ops->flink)
					ops->flink(handle, bo[l]);
284 285 286 287
			}
		}

		for (pass = 0; pass < num_passes; pass++) {
288
			ret = ops->copy(realfd, bo[0], bo[1], bo, working_surfaces);
289
			igt_assert_eq(ret, 0);
290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313

			for (l = 0; l < working_surfaces &&
			  (flags & FORKING_EVICTIONS_MEMORY_PRESSURE);
			    l++) {
				ops->clear(realfd, bo[l], surface_size);
			}
		}

		if (flags & FORKING_EVICTIONS_INTERRUPTIBLE)
			igt_stop_signal_helper();

		/* drmfd closing will take care of additional bo refs */
		if (flags & FORKING_EVICTIONS_DUP_DRMFD)
			close(realfd);
	}

	igt_waitchildren();

	for (n = 0; n < bo_count; n++)
		ops->close(fd, bo[n]);
	free(bo);

	return 0;
}