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
|
/*
* Copyright © 2017 Broadcom
*
* 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.
*/
#include "igt.h"
#include "igt_vc4.h"
#include <signal.h>
struct igt_vc4_bo {
struct igt_list_head node;
int handle;
void *map;
size_t size;
};
static jmp_buf jmp;
__noreturn static void sigtrap(int sig)
{
longjmp(jmp, sig);
}
static void igt_vc4_alloc_mmap_max_bo(int fd, struct igt_list_head *list,
size_t size)
{
struct igt_vc4_bo *bo;
struct drm_vc4_create_bo create = {
.size = size,
};
while (true) {
if (igt_ioctl(fd, DRM_IOCTL_VC4_CREATE_BO, &create))
break;
bo = malloc(sizeof(*bo));
igt_assert(bo);
bo->handle = create.handle;
bo->size = create.size;
bo->map = igt_vc4_mmap_bo(fd, bo->handle, bo->size,
PROT_READ | PROT_WRITE);
igt_list_add_tail(&bo->node, list);
}
}
static void igt_vc4_unmap_free_bo_pool(int fd, struct igt_list_head *list)
{
struct igt_vc4_bo *bo;
while (!igt_list_empty(list)) {
bo = igt_list_first_entry(list, bo, node);
igt_assert(bo);
igt_list_del(&bo->node);
munmap(bo->map, bo->size);
gem_close(fd, bo->handle);
free(bo);
}
}
static void igt_vc4_trigger_purge(int fd)
{
struct igt_list_head list;
IGT_INIT_LIST_HEAD(&list);
/* Try to allocate as much as we can to trigger a purge. */
igt_vc4_alloc_mmap_max_bo(fd, &list, 64 * 1024);
igt_assert(!igt_list_empty(&list));
igt_vc4_unmap_free_bo_pool(fd, &list);
}
static void igt_vc4_purgeable_subtest_prepare(int fd, struct igt_list_head *list)
{
igt_vc4_unmap_free_bo_pool(fd, list);
igt_vc4_alloc_mmap_max_bo(fd, list, 64 * 1024);
igt_assert(!igt_list_empty(list));
}
igt_main
{
struct igt_vc4_bo *bo;
struct igt_list_head list;
uint32_t *map;
int fd, ret;
igt_fixture {
fd = drm_open_driver(DRIVER_VC4);
igt_require(igt_vc4_get_param(fd, DRM_VC4_PARAM_SUPPORTS_MADVISE));
IGT_INIT_LIST_HEAD(&list);
}
igt_subtest("mark-willneed") {
igt_vc4_purgeable_subtest_prepare(fd, &list);
igt_list_for_each_entry(bo, &list, node)
igt_assert(igt_vc4_purgeable_bo(fd, bo->handle,
false));
}
igt_subtest("mark-purgeable") {
igt_vc4_purgeable_subtest_prepare(fd, &list);
igt_list_for_each_entry(bo, &list, node)
igt_vc4_purgeable_bo(fd, bo->handle, true);
igt_list_for_each_entry(bo, &list, node)
igt_vc4_purgeable_bo(fd, bo->handle, false);
}
igt_subtest("mark-purgeable-twice") {
igt_vc4_purgeable_subtest_prepare(fd, &list);
bo = igt_list_first_entry(&list, bo, node);
igt_vc4_purgeable_bo(fd, bo->handle, true);
igt_vc4_purgeable_bo(fd, bo->handle, true);
igt_vc4_purgeable_bo(fd, bo->handle, false);
}
igt_subtest("mark-unpurgeable-twice") {
igt_vc4_purgeable_subtest_prepare(fd, &list);
bo = igt_list_first_entry(&list, bo, node);
igt_vc4_purgeable_bo(fd, bo->handle, true);
igt_vc4_purgeable_bo(fd, bo->handle, false);
igt_vc4_purgeable_bo(fd, bo->handle, false);
}
igt_subtest("access-purgeable-bo-mem") {
igt_vc4_purgeable_subtest_prepare(fd, &list);
bo = igt_list_first_entry(&list, bo, node);
map = (uint32_t *)bo->map;
/* Mark the BO as purgeable, but do not try to allocate a new
* BO. This should leave the BO in a non-purged state unless
* someone else tries to allocated a new BO.
*/
igt_vc4_purgeable_bo(fd, bo->handle, true);
/* Accessing a purgeable BO should generate a SIGBUS event if
* the BO has been purged by the system in the meantime.
*/
signal(SIGSEGV, sigtrap);
signal(SIGBUS, sigtrap);
ret = setjmp(jmp);
if (!ret)
*map = 0xdeadbeef;
else
igt_assert(ret == SIGBUS);
signal(SIGBUS, SIG_DFL);
signal(SIGSEGV, SIG_DFL);
}
igt_subtest("access-purged-bo-mem") {
igt_vc4_purgeable_subtest_prepare(fd, &list);
/* Mark the first BO in our list as purgeable and try to
* allocate a new one. This should trigger a purge and render
* the first BO inaccessible.
*/
bo = igt_list_first_entry(&list, bo, node);
map = (uint32_t *)bo->map;
igt_vc4_purgeable_bo(fd, bo->handle, true);
/* Trigger a purge. */
igt_vc4_trigger_purge(fd);
/* Accessing a purged BO should generate a SIGBUS event. */
signal(SIGSEGV, sigtrap);
signal(SIGBUS, sigtrap);
ret = setjmp(jmp);
if (!ret)
*map = 0;
else
igt_assert(ret == SIGBUS);
signal(SIGBUS, SIG_DFL);
signal(SIGSEGV, SIG_DFL);
igt_vc4_purgeable_bo(fd, bo->handle, false);
}
igt_subtest("mark-unpurgeable-check-retained") {
igt_vc4_purgeable_subtest_prepare(fd, &list);
igt_list_for_each_entry(bo, &list, node) {
map = (uint32_t *)bo->map;
*map = 0xdeadbeef;
igt_vc4_purgeable_bo(fd, bo->handle, true);
}
igt_list_for_each_entry(bo, &list, node) {
map = (uint32_t *)bo->map;
if (igt_vc4_purgeable_bo(fd, bo->handle, false))
igt_assert(*map == 0xdeadbeef);
}
}
igt_subtest("mark-unpurgeable-purged") {
igt_vc4_purgeable_subtest_prepare(fd, &list);
igt_list_for_each_entry(bo, &list, node)
igt_vc4_purgeable_bo(fd, bo->handle, true);
/* Trigger a purge. */
igt_vc4_trigger_purge(fd);
bo = igt_list_first_entry(&list, bo, node);
map = (uint32_t *)bo->map;
igt_assert(!igt_vc4_purgeable_bo(fd, bo->handle, false));
/* Purged BOs are unusable and any access to their
* mmap-ed region should trigger a SIGBUS.
*/
signal(SIGSEGV, sigtrap);
signal(SIGBUS, sigtrap);
ret = setjmp(jmp);
if (!ret)
*map = 0;
else
igt_assert(ret == SIGBUS);
signal(SIGBUS, SIG_DFL);
signal(SIGSEGV, SIG_DFL);
}
igt_subtest("free-purged-bo") {
igt_vc4_purgeable_subtest_prepare(fd, &list);
bo = igt_list_first_entry(&list, bo, node);
igt_vc4_purgeable_bo(fd, bo->handle, true);
/* Trigger a purge. */
igt_vc4_trigger_purge(fd);
igt_list_del(&bo->node);
munmap(bo->map, bo->size);
gem_close(fd, bo->handle);
free(bo);
}
igt_fixture
drm_close_driver(fd);
}
|