^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1) // SPDX-License-Identifier: MIT
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 4) * Copyright © 2019 Intel Corporation
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 5) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 6)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 7) #include <linux/delay.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 8) #include <linux/dma-fence.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 9) #include <linux/dma-fence-chain.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 10) #include <linux/kernel.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 11) #include <linux/kthread.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 12) #include <linux/mm.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 13) #include <linux/sched/signal.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 14) #include <linux/slab.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 15) #include <linux/spinlock.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 16) #include <linux/random.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 17)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 18) #include "selftest.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 19)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 20) #define CHAIN_SZ (4 << 10)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 21)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 22) static struct kmem_cache *slab_fences;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 23)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 24) static inline struct mock_fence {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 25) struct dma_fence base;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 26) spinlock_t lock;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 27) } *to_mock_fence(struct dma_fence *f) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 28) return container_of(f, struct mock_fence, base);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 29) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 30)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 31) static const char *mock_name(struct dma_fence *f)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 32) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 33) return "mock";
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 34) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 35)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 36) static void mock_fence_release(struct dma_fence *f)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 37) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 38) kmem_cache_free(slab_fences, to_mock_fence(f));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 39) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 40)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 41) static const struct dma_fence_ops mock_ops = {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 42) .get_driver_name = mock_name,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 43) .get_timeline_name = mock_name,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 44) .release = mock_fence_release,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 45) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 46)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 47) static struct dma_fence *mock_fence(void)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 48) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 49) struct mock_fence *f;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 50)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 51) f = kmem_cache_alloc(slab_fences, GFP_KERNEL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 52) if (!f)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 53) return NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 54)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 55) spin_lock_init(&f->lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 56) dma_fence_init(&f->base, &mock_ops, &f->lock, 0, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 57)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 58) return &f->base;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 59) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 60)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 61) static inline struct mock_chain {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 62) struct dma_fence_chain base;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 63) } *to_mock_chain(struct dma_fence *f) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 64) return container_of(f, struct mock_chain, base.base);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 65) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 66)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 67) static struct dma_fence *mock_chain(struct dma_fence *prev,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 68) struct dma_fence *fence,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 69) u64 seqno)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 70) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 71) struct mock_chain *f;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 72)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 73) f = kmalloc(sizeof(*f), GFP_KERNEL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 74) if (!f)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 75) return NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 76)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 77) dma_fence_chain_init(&f->base,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 78) dma_fence_get(prev),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 79) dma_fence_get(fence),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 80) seqno);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 81)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 82) return &f->base.base;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 83) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 84)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 85) static int sanitycheck(void *arg)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 86) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 87) struct dma_fence *f, *chain;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 88) int err = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 89)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 90) f = mock_fence();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 91) if (!f)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 92) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 93)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 94) chain = mock_chain(NULL, f, 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 95) if (!chain)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 96) err = -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 97)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 98) dma_fence_signal(f);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 99) dma_fence_put(f);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 100)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 101) dma_fence_put(chain);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 102)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 103) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 104) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 105)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 106) struct fence_chains {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 107) unsigned int chain_length;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 108) struct dma_fence **fences;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 109) struct dma_fence **chains;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 110)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 111) struct dma_fence *tail;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 112) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 113)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 114) static uint64_t seqno_inc(unsigned int i)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 115) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 116) return i + 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 117) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 118)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 119) static int fence_chains_init(struct fence_chains *fc, unsigned int count,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 120) uint64_t (*seqno_fn)(unsigned int))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 121) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 122) unsigned int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 123) int err = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 124)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 125) fc->chains = kvmalloc_array(count, sizeof(*fc->chains),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 126) GFP_KERNEL | __GFP_ZERO);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 127) if (!fc->chains)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 128) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 129)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 130) fc->fences = kvmalloc_array(count, sizeof(*fc->fences),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 131) GFP_KERNEL | __GFP_ZERO);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 132) if (!fc->fences) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 133) err = -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 134) goto err_chains;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 135) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 136)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 137) fc->tail = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 138) for (i = 0; i < count; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 139) fc->fences[i] = mock_fence();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 140) if (!fc->fences[i]) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 141) err = -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 142) goto unwind;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 143) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 144)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 145) fc->chains[i] = mock_chain(fc->tail,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 146) fc->fences[i],
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 147) seqno_fn(i));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 148) if (!fc->chains[i]) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 149) err = -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 150) goto unwind;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 151) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 152)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 153) fc->tail = fc->chains[i];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 154) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 155)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 156) fc->chain_length = i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 157) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 158)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 159) unwind:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 160) for (i = 0; i < count; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 161) dma_fence_put(fc->fences[i]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 162) dma_fence_put(fc->chains[i]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 163) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 164) kvfree(fc->fences);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 165) err_chains:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 166) kvfree(fc->chains);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 167) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 168) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 169)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 170) static void fence_chains_fini(struct fence_chains *fc)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 171) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 172) unsigned int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 173)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 174) for (i = 0; i < fc->chain_length; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 175) dma_fence_signal(fc->fences[i]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 176) dma_fence_put(fc->fences[i]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 177) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 178) kvfree(fc->fences);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 179)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 180) for (i = 0; i < fc->chain_length; i++)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 181) dma_fence_put(fc->chains[i]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 182) kvfree(fc->chains);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 183) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 184)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 185) static int find_seqno(void *arg)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 186) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 187) struct fence_chains fc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 188) struct dma_fence *fence;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 189) int err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 190) int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 191)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 192) err = fence_chains_init(&fc, 64, seqno_inc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 193) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 194) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 195)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 196) fence = dma_fence_get(fc.tail);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 197) err = dma_fence_chain_find_seqno(&fence, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 198) dma_fence_put(fence);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 199) if (err) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 200) pr_err("Reported %d for find_seqno(0)!\n", err);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 201) goto err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 202) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 203)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 204) for (i = 0; i < fc.chain_length; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 205) fence = dma_fence_get(fc.tail);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 206) err = dma_fence_chain_find_seqno(&fence, i + 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 207) dma_fence_put(fence);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 208) if (err) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 209) pr_err("Reported %d for find_seqno(%d:%d)!\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 210) err, fc.chain_length + 1, i + 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 211) goto err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 212) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 213) if (fence != fc.chains[i]) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 214) pr_err("Incorrect fence reported by find_seqno(%d:%d)\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 215) fc.chain_length + 1, i + 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 216) err = -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 217) goto err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 218) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 219)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 220) dma_fence_get(fence);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 221) err = dma_fence_chain_find_seqno(&fence, i + 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 222) dma_fence_put(fence);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 223) if (err) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 224) pr_err("Error reported for finding self\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 225) goto err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 226) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 227) if (fence != fc.chains[i]) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 228) pr_err("Incorrect fence reported by find self\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 229) err = -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 230) goto err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 231) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 232)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 233) dma_fence_get(fence);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 234) err = dma_fence_chain_find_seqno(&fence, i + 2);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 235) dma_fence_put(fence);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 236) if (!err) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 237) pr_err("Error not reported for future fence: find_seqno(%d:%d)!\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 238) i + 1, i + 2);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 239) err = -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 240) goto err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 241) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 242)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 243) dma_fence_get(fence);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 244) err = dma_fence_chain_find_seqno(&fence, i);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 245) dma_fence_put(fence);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 246) if (err) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 247) pr_err("Error reported for previous fence!\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 248) goto err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 249) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 250) if (i > 0 && fence != fc.chains[i - 1]) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 251) pr_err("Incorrect fence reported by find_seqno(%d:%d)\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 252) i + 1, i);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 253) err = -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 254) goto err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 255) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 256) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 257)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 258) err:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 259) fence_chains_fini(&fc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 260) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 261) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 262)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 263) static int find_signaled(void *arg)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 264) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 265) struct fence_chains fc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 266) struct dma_fence *fence;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 267) int err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 268)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 269) err = fence_chains_init(&fc, 2, seqno_inc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 270) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 271) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 272)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 273) dma_fence_signal(fc.fences[0]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 274)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 275) fence = dma_fence_get(fc.tail);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 276) err = dma_fence_chain_find_seqno(&fence, 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 277) dma_fence_put(fence);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 278) if (err) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 279) pr_err("Reported %d for find_seqno()!\n", err);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 280) goto err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 281) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 282)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 283) if (fence && fence != fc.chains[0]) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 284) pr_err("Incorrect chain-fence.seqno:%lld reported for completed seqno:1\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 285) fence->seqno);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 286)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 287) dma_fence_get(fence);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 288) err = dma_fence_chain_find_seqno(&fence, 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 289) dma_fence_put(fence);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 290) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 291) pr_err("Reported %d for finding self!\n", err);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 292)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 293) err = -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 294) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 295)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 296) err:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 297) fence_chains_fini(&fc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 298) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 299) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 300)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 301) static int find_out_of_order(void *arg)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 302) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 303) struct fence_chains fc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 304) struct dma_fence *fence;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 305) int err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 306)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 307) err = fence_chains_init(&fc, 3, seqno_inc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 308) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 309) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 310)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 311) dma_fence_signal(fc.fences[1]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 312)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 313) fence = dma_fence_get(fc.tail);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 314) err = dma_fence_chain_find_seqno(&fence, 2);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 315) dma_fence_put(fence);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 316) if (err) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 317) pr_err("Reported %d for find_seqno()!\n", err);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 318) goto err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 319) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 320)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 321) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 322) * We signaled the middle fence (2) of the 1-2-3 chain. The behavior
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 323) * of the dma-fence-chain is to make us wait for all the fences up to
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 324) * the point we want. Since fence 1 is still not signaled, this what
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 325) * we should get as fence to wait upon (fence 2 being garbage
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 326) * collected during the traversal of the chain).
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 327) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 328) if (fence != fc.chains[0]) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 329) pr_err("Incorrect chain-fence.seqno:%lld reported for completed seqno:2\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 330) fence ? fence->seqno : 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 331)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 332) err = -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 333) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 334)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 335) err:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 336) fence_chains_fini(&fc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 337) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 338) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 339)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 340) static uint64_t seqno_inc2(unsigned int i)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 341) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 342) return 2 * i + 2;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 343) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 344)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 345) static int find_gap(void *arg)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 346) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 347) struct fence_chains fc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 348) struct dma_fence *fence;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 349) int err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 350) int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 351)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 352) err = fence_chains_init(&fc, 64, seqno_inc2);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 353) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 354) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 355)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 356) for (i = 0; i < fc.chain_length; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 357) fence = dma_fence_get(fc.tail);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 358) err = dma_fence_chain_find_seqno(&fence, 2 * i + 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 359) dma_fence_put(fence);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 360) if (err) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 361) pr_err("Reported %d for find_seqno(%d:%d)!\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 362) err, fc.chain_length + 1, 2 * i + 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 363) goto err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 364) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 365) if (fence != fc.chains[i]) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 366) pr_err("Incorrect fence.seqno:%lld reported by find_seqno(%d:%d)\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 367) fence->seqno,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 368) fc.chain_length + 1,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 369) 2 * i + 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 370) err = -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 371) goto err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 372) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 373)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 374) dma_fence_get(fence);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 375) err = dma_fence_chain_find_seqno(&fence, 2 * i + 2);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 376) dma_fence_put(fence);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 377) if (err) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 378) pr_err("Error reported for finding self\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 379) goto err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 380) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 381) if (fence != fc.chains[i]) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 382) pr_err("Incorrect fence reported by find self\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 383) err = -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 384) goto err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 385) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 386) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 387)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 388) err:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 389) fence_chains_fini(&fc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 390) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 391) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 392)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 393) struct find_race {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 394) struct fence_chains fc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 395) atomic_t children;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 396) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 397)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 398) static int __find_race(void *arg)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 399) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 400) struct find_race *data = arg;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 401) int err = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 402)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 403) while (!kthread_should_stop()) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 404) struct dma_fence *fence = dma_fence_get(data->fc.tail);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 405) int seqno;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 406)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 407) seqno = prandom_u32_max(data->fc.chain_length) + 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 408)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 409) err = dma_fence_chain_find_seqno(&fence, seqno);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 410) if (err) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 411) pr_err("Failed to find fence seqno:%d\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 412) seqno);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 413) dma_fence_put(fence);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 414) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 415) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 416) if (!fence)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 417) goto signal;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 418)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 419) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 420) * We can only find ourselves if we are on fence we were
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 421) * looking for.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 422) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 423) if (fence->seqno == seqno) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 424) err = dma_fence_chain_find_seqno(&fence, seqno);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 425) if (err) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 426) pr_err("Reported an invalid fence for find-self:%d\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 427) seqno);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 428) dma_fence_put(fence);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 429) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 430) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 431) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 432)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 433) dma_fence_put(fence);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 434)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 435) signal:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 436) seqno = prandom_u32_max(data->fc.chain_length - 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 437) dma_fence_signal(data->fc.fences[seqno]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 438) cond_resched();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 439) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 440)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 441) if (atomic_dec_and_test(&data->children))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 442) wake_up_var(&data->children);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 443) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 444) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 445)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 446) static int find_race(void *arg)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 447) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 448) struct find_race data;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 449) int ncpus = num_online_cpus();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 450) struct task_struct **threads;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 451) unsigned long count;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 452) int err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 453) int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 454)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 455) err = fence_chains_init(&data.fc, CHAIN_SZ, seqno_inc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 456) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 457) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 458)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 459) threads = kmalloc_array(ncpus, sizeof(*threads), GFP_KERNEL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 460) if (!threads) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 461) err = -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 462) goto err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 463) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 464)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 465) atomic_set(&data.children, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 466) for (i = 0; i < ncpus; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 467) threads[i] = kthread_run(__find_race, &data, "dmabuf/%d", i);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 468) if (IS_ERR(threads[i])) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 469) ncpus = i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 470) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 471) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 472) atomic_inc(&data.children);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 473) get_task_struct(threads[i]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 474) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 475)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 476) wait_var_event_timeout(&data.children,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 477) !atomic_read(&data.children),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 478) 5 * HZ);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 479)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 480) for (i = 0; i < ncpus; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 481) int ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 482)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 483) ret = kthread_stop(threads[i]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 484) if (ret && !err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 485) err = ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 486) put_task_struct(threads[i]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 487) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 488) kfree(threads);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 489)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 490) count = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 491) for (i = 0; i < data.fc.chain_length; i++)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 492) if (dma_fence_is_signaled(data.fc.fences[i]))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 493) count++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 494) pr_info("Completed %lu cycles\n", count);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 495)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 496) err:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 497) fence_chains_fini(&data.fc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 498) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 499) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 500)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 501) static int signal_forward(void *arg)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 502) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 503) struct fence_chains fc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 504) int err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 505) int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 506)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 507) err = fence_chains_init(&fc, 64, seqno_inc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 508) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 509) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 510)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 511) for (i = 0; i < fc.chain_length; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 512) dma_fence_signal(fc.fences[i]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 513)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 514) if (!dma_fence_is_signaled(fc.chains[i])) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 515) pr_err("chain[%d] not signaled!\n", i);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 516) err = -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 517) goto err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 518) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 519)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 520) if (i + 1 < fc.chain_length &&
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 521) dma_fence_is_signaled(fc.chains[i + 1])) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 522) pr_err("chain[%d] is signaled!\n", i);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 523) err = -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 524) goto err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 525) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 526) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 527)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 528) err:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 529) fence_chains_fini(&fc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 530) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 531) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 532)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 533) static int signal_backward(void *arg)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 534) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 535) struct fence_chains fc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 536) int err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 537) int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 538)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 539) err = fence_chains_init(&fc, 64, seqno_inc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 540) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 541) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 542)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 543) for (i = fc.chain_length; i--; ) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 544) dma_fence_signal(fc.fences[i]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 545)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 546) if (i > 0 && dma_fence_is_signaled(fc.chains[i])) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 547) pr_err("chain[%d] is signaled!\n", i);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 548) err = -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 549) goto err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 550) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 551) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 552)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 553) for (i = 0; i < fc.chain_length; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 554) if (!dma_fence_is_signaled(fc.chains[i])) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 555) pr_err("chain[%d] was not signaled!\n", i);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 556) err = -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 557) goto err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 558) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 559) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 560)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 561) err:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 562) fence_chains_fini(&fc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 563) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 564) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 565)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 566) static int __wait_fence_chains(void *arg)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 567) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 568) struct fence_chains *fc = arg;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 569)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 570) if (dma_fence_wait(fc->tail, false))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 571) return -EIO;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 572)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 573) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 574) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 575)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 576) static int wait_forward(void *arg)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 577) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 578) struct fence_chains fc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 579) struct task_struct *tsk;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 580) int err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 581) int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 582)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 583) err = fence_chains_init(&fc, CHAIN_SZ, seqno_inc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 584) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 585) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 586)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 587) tsk = kthread_run(__wait_fence_chains, &fc, "dmabuf/wait");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 588) if (IS_ERR(tsk)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 589) err = PTR_ERR(tsk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 590) goto err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 591) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 592) get_task_struct(tsk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 593) yield_to(tsk, true);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 594)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 595) for (i = 0; i < fc.chain_length; i++)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 596) dma_fence_signal(fc.fences[i]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 597)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 598) err = kthread_stop(tsk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 599) put_task_struct(tsk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 600)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 601) err:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 602) fence_chains_fini(&fc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 603) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 604) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 605)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 606) static int wait_backward(void *arg)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 607) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 608) struct fence_chains fc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 609) struct task_struct *tsk;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 610) int err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 611) int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 612)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 613) err = fence_chains_init(&fc, CHAIN_SZ, seqno_inc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 614) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 615) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 616)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 617) tsk = kthread_run(__wait_fence_chains, &fc, "dmabuf/wait");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 618) if (IS_ERR(tsk)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 619) err = PTR_ERR(tsk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 620) goto err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 621) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 622) get_task_struct(tsk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 623) yield_to(tsk, true);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 624)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 625) for (i = fc.chain_length; i--; )
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 626) dma_fence_signal(fc.fences[i]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 627)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 628) err = kthread_stop(tsk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 629) put_task_struct(tsk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 630)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 631) err:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 632) fence_chains_fini(&fc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 633) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 634) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 635)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 636) static void randomise_fences(struct fence_chains *fc)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 637) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 638) unsigned int count = fc->chain_length;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 639)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 640) /* Fisher-Yates shuffle courtesy of Knuth */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 641) while (--count) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 642) unsigned int swp;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 643)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 644) swp = prandom_u32_max(count + 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 645) if (swp == count)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 646) continue;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 647)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 648) swap(fc->fences[count], fc->fences[swp]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 649) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 650) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 651)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 652) static int wait_random(void *arg)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 653) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 654) struct fence_chains fc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 655) struct task_struct *tsk;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 656) int err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 657) int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 658)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 659) err = fence_chains_init(&fc, CHAIN_SZ, seqno_inc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 660) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 661) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 662)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 663) randomise_fences(&fc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 664)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 665) tsk = kthread_run(__wait_fence_chains, &fc, "dmabuf/wait");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 666) if (IS_ERR(tsk)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 667) err = PTR_ERR(tsk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 668) goto err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 669) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 670) get_task_struct(tsk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 671) yield_to(tsk, true);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 672)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 673) for (i = 0; i < fc.chain_length; i++)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 674) dma_fence_signal(fc.fences[i]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 675)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 676) err = kthread_stop(tsk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 677) put_task_struct(tsk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 678)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 679) err:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 680) fence_chains_fini(&fc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 681) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 682) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 683)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 684) int dma_fence_chain(void)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 685) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 686) static const struct subtest tests[] = {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 687) SUBTEST(sanitycheck),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 688) SUBTEST(find_seqno),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 689) SUBTEST(find_signaled),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 690) SUBTEST(find_out_of_order),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 691) SUBTEST(find_gap),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 692) SUBTEST(find_race),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 693) SUBTEST(signal_forward),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 694) SUBTEST(signal_backward),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 695) SUBTEST(wait_forward),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 696) SUBTEST(wait_backward),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 697) SUBTEST(wait_random),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 698) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 699) int ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 700)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 701) pr_info("sizeof(dma_fence_chain)=%zu\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 702) sizeof(struct dma_fence_chain));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 703)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 704) slab_fences = KMEM_CACHE(mock_fence,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 705) SLAB_TYPESAFE_BY_RCU |
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 706) SLAB_HWCACHE_ALIGN);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 707) if (!slab_fences)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 708) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 709)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 710) ret = subtests(tests, NULL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 711)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 712) kmem_cache_destroy(slab_fences);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 713) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 714) }
Orange Pi5 kernel
Deprecated Linux kernel 5.10.110 for OrangePi 5/5B/5+ boards
3 Commits
0 Branches
0 Tags