1 /* SPDX-License-Identifier: MIT */
4 * Copyright © 2019 Intel Corporation
5 * Copyright © 2021 Advanced Micro Devices, Inc.
8 #include <linux/slab.h>
9 #include <linux/spinlock.h>
10 #include <linux/dma-resv.h>
14 static struct spinlock fence_lock;
16 static const char *fence_name(struct dma_fence *f)
21 static const struct dma_fence_ops fence_ops = {
22 .get_driver_name = fence_name,
23 .get_timeline_name = fence_name,
26 static struct dma_fence *alloc_fence(void)
30 f = kmalloc(sizeof(*f), GFP_KERNEL);
34 dma_fence_init(f, &fence_ops, &fence_lock, 0, 0);
38 static int sanitycheck(void *arg)
52 r = dma_resv_lock(&resv, NULL);
54 pr_err("Resv locking failed\n");
56 dma_resv_unlock(&resv);
61 static int test_signaling(void *arg)
63 enum dma_resv_usage usage = (unsigned long)arg;
73 r = dma_resv_lock(&resv, NULL);
75 pr_err("Resv locking failed\n");
79 r = dma_resv_reserve_fences(&resv, 1);
81 pr_err("Resv shared slot allocation failed\n");
85 dma_resv_add_fence(&resv, f, usage);
86 if (dma_resv_test_signaled(&resv, usage)) {
87 pr_err("Resv unexpectedly signaled\n");
92 if (!dma_resv_test_signaled(&resv, usage)) {
93 pr_err("Resv not reporting signaled\n");
98 dma_resv_unlock(&resv);
100 dma_resv_fini(&resv);
105 static int test_for_each(void *arg)
107 enum dma_resv_usage usage = (unsigned long)arg;
108 struct dma_resv_iter cursor;
109 struct dma_fence *f, *fence;
110 struct dma_resv resv;
117 dma_resv_init(&resv);
118 r = dma_resv_lock(&resv, NULL);
120 pr_err("Resv locking failed\n");
124 r = dma_resv_reserve_fences(&resv, 1);
126 pr_err("Resv shared slot allocation failed\n");
130 dma_resv_add_fence(&resv, f, usage);
133 dma_resv_for_each_fence(&cursor, &resv, usage, fence) {
135 pr_err("More than one fence found\n");
140 pr_err("Unexpected fence\n");
144 if (dma_resv_iter_usage(&cursor) != usage) {
145 pr_err("Unexpected fence usage\n");
152 pr_err("No fence found\n");
157 dma_resv_unlock(&resv);
159 dma_resv_fini(&resv);
164 static int test_for_each_unlocked(void *arg)
166 enum dma_resv_usage usage = (unsigned long)arg;
167 struct dma_resv_iter cursor;
168 struct dma_fence *f, *fence;
169 struct dma_resv resv;
176 dma_resv_init(&resv);
177 r = dma_resv_lock(&resv, NULL);
179 pr_err("Resv locking failed\n");
183 r = dma_resv_reserve_fences(&resv, 1);
185 pr_err("Resv shared slot allocation failed\n");
186 dma_resv_unlock(&resv);
190 dma_resv_add_fence(&resv, f, usage);
191 dma_resv_unlock(&resv);
194 dma_resv_iter_begin(&cursor, &resv, usage);
195 dma_resv_for_each_fence_unlocked(&cursor, fence) {
197 pr_err("More than one fence found\n");
201 if (!dma_resv_iter_is_restarted(&cursor)) {
202 pr_err("No restart flag\n");
206 pr_err("Unexpected fence\n");
210 if (dma_resv_iter_usage(&cursor) != usage) {
211 pr_err("Unexpected fence usage\n");
216 /* We use r as state here */
219 /* That should trigger an restart */
220 cursor.fences = (void*)~0;
221 } else if (r == -EINVAL) {
226 pr_err("No fence found\n");
228 dma_resv_iter_end(&cursor);
231 dma_resv_fini(&resv);
236 static int test_get_fences(void *arg)
238 enum dma_resv_usage usage = (unsigned long)arg;
239 struct dma_fence *f, **fences = NULL;
240 struct dma_resv resv;
247 dma_resv_init(&resv);
248 r = dma_resv_lock(&resv, NULL);
250 pr_err("Resv locking failed\n");
254 r = dma_resv_reserve_fences(&resv, 1);
256 pr_err("Resv shared slot allocation failed\n");
257 dma_resv_unlock(&resv);
261 dma_resv_add_fence(&resv, f, usage);
262 dma_resv_unlock(&resv);
264 r = dma_resv_get_fences(&resv, usage, &i, &fences);
266 pr_err("get_fences failed\n");
270 if (i != 1 || fences[0] != f) {
271 pr_err("get_fences returned unexpected fence\n");
278 dma_fence_put(fences[i]);
281 dma_resv_fini(&resv);
288 static const struct subtest tests[] = {
289 SUBTEST(sanitycheck),
290 SUBTEST(test_signaling),
291 SUBTEST(test_for_each),
292 SUBTEST(test_for_each_unlocked),
293 SUBTEST(test_get_fences),
295 enum dma_resv_usage usage;
298 spin_lock_init(&fence_lock);
299 for (usage = DMA_RESV_USAGE_KERNEL; usage <= DMA_RESV_USAGE_BOOKKEEP;
301 r = subtests(tests, (void *)(unsigned long)usage);