| /* |
| * 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> |
| * |
| */ |
| |
| #include <stdlib.h> |
| |
| #include "drmtest.h" |
| #include "igt_aux.h" |
| |
| struct igt_eviction_test_ops |
| { |
| uint32_t (*create)(int fd, int size); |
| void (*close)(int fd, uint32_t bo); |
| void (*copy)(int fd, uint32_t dst, uint32_t src, |
| uint32_t *all_bo, int nr_bos, int error); |
| void (*clear)(int fd, uint32_t bo, int size); |
| }; |
| |
| #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; |
| uint32_t i_tmp; |
| |
| i_tmp = i_arr[i]; |
| i_arr[i] = i_arr[j]; |
| i_arr[j] = i_tmp; |
| } |
| |
| static int minor_evictions(int fd, struct igt_eviction_test_ops *ops, |
| int surface_size, int nr_surfaces) |
| { |
| uint32_t *bo, *sel; |
| int n, m, pass, fail; |
| int total_surfaces; |
| |
| /* 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; |
| |
| total_surfaces = (uint64_t)intel_get_total_ram_mb() * 9 /10 * 1024 *1024 / surface_size; |
| igt_require(nr_surfaces < total_surfaces); |
| |
| bo = malloc((nr_surfaces + total_surfaces)*sizeof(*bo)); |
| igt_assert(bo); |
| |
| for (n = 0; n < total_surfaces; n++) |
| bo[n] = ops->create(fd, surface_size); |
| |
| sel = bo + n; |
| for (fail = 0, m = 0; fail < 10; fail++) { |
| for (pass = 0; pass < 100; pass++) { |
| for (n = 0; n < nr_surfaces; n++, m += 7) |
| sel[n] = bo[m%total_surfaces]; |
| ops->copy(fd, sel[0], sel[1], sel, nr_surfaces, 0); |
| } |
| ops->copy(fd, bo[0], bo[0], bo, total_surfaces, ENOSPC); |
| } |
| |
| for (n = 0; n < total_surfaces; n++) |
| ops->close(fd, bo[n]); |
| free(bo); |
| |
| return 0; |
| } |
| |
| static int major_evictions(int fd, struct igt_eviction_test_ops *ops, |
| int surface_size, int nr_surfaces) |
| { |
| int n, m, loop; |
| uint32_t *bo; |
| |
| igt_require((uint64_t)nr_surfaces * surface_size / (1024 * 1024) |
| < intel_get_total_ram_mb() * 9 / 10); |
| |
| 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; |
| ops->copy(fd, bo[n], bo[n], &bo[n], 1, 0); |
| } |
| |
| for (n = 0; n < nr_surfaces; n++) |
| ops->close(fd, bo[n]); |
| free(bo); |
| |
| return 0; |
| } |
| |
| static int swapping_evictions(int fd, struct igt_eviction_test_ops *ops, |
| int surface_size, |
| int working_surfaces, |
| int trash_surfaces) |
| { |
| uint32_t *bo; |
| int i, n, pass; |
| |
| igt_require((uint64_t)working_surfaces * surface_size / (1024 * 1024) |
| < intel_get_total_ram_mb() * 9 / 10); |
| |
| if (trash_surfaces < working_surfaces) |
| trash_surfaces = working_surfaces; |
| |
| 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++) { |
| ops->copy(fd, bo[0], bo[1], bo, working_surfaces, 0); |
| } |
| } |
| |
| for (n = 0; n < trash_surfaces; n++) |
| ops->close(fd, bo[n]); |
| free(bo); |
| |
| return 0; |
| } |
| |
| #define min(a, b) ((a) < (b) ? (a) : (b)) |
| |
| static int forking_evictions(int fd, struct igt_eviction_test_ops *ops, |
| int surface_size, int working_surfaces, |
| int trash_surfaces, unsigned flags) |
| { |
| uint32_t *bo; |
| int n, pass, l; |
| int num_threads = sysconf(_SC_NPROCESSORS_ONLN); |
| int bo_count; |
| |
| igt_require((uint64_t)working_surfaces * surface_size / (1024 * 1024) |
| < intel_get_total_ram_mb() * 9 / 10); |
| |
| if (flags & FORKING_EVICTIONS_SWAPPING) { |
| igt_require(intel_get_total_ram_mb() / 4 |
| < intel_get_total_swap_mb()); |
| bo_count = trash_surfaces; |
| |
| if (bo_count < working_surfaces) |
| bo_count = working_surfaces; |
| } else |
| bo_count = working_surfaces; |
| |
| 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) { |
| realfd = drm_open_any(); |
| |
| /* We can overwrite the bo array since we're forked. */ |
| for (l = 0; l < bo_count; l++) { |
| uint32_t flink; |
| |
| flink = gem_flink(fd, bo[l]); |
| bo[l] = gem_open(realfd, flink); |
| } |
| } |
| |
| for (pass = 0; pass < num_passes; pass++) { |
| ops->copy(realfd, bo[0], bo[1], bo, working_surfaces, 0); |
| |
| 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; |
| } |