2021-05-11 16:42:52 +08:00
|
|
|
// SPDX-License-Identifier: MIT
|
2013-06-27 19:48:16 +08:00
|
|
|
/*
|
2014-07-01 18:57:54 +08:00
|
|
|
* Copyright (C) 2012-2014 Canonical Ltd (Maarten Lankhorst)
|
2013-06-27 19:48:16 +08:00
|
|
|
*
|
|
|
|
* Based on bo.c which bears the following copyright notice,
|
|
|
|
* but is dual licensed:
|
|
|
|
*
|
|
|
|
* Copyright (c) 2006-2009 VMware, Inc., Palo Alto, CA., USA
|
|
|
|
* All Rights Reserved.
|
|
|
|
*
|
|
|
|
* 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, sub license, 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 NON-INFRINGEMENT. IN NO EVENT SHALL
|
|
|
|
* THE COPYRIGHT HOLDERS, AUTHORS AND/OR ITS SUPPLIERS 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: Thomas Hellstrom <thellstrom-at-vmware-dot-com>
|
|
|
|
*/
|
|
|
|
|
2019-08-11 16:06:32 +08:00
|
|
|
#include <linux/dma-resv.h>
|
2013-06-27 19:48:16 +08:00
|
|
|
#include <linux/export.h>
|
2020-06-09 12:33:21 +08:00
|
|
|
#include <linux/mm.h>
|
dma_resv: prime lockdep annotations
Full audit of everyone:
- i915, radeon, amdgpu should be clean per their maintainers.
- vram helpers should be fine, they don't do command submission, so
really no business holding struct_mutex while doing copy_*_user. But
I haven't checked them all.
- panfrost seems to dma_resv_lock only in panfrost_job_push, which
looks clean.
- v3d holds dma_resv locks in the tail of its v3d_submit_cl_ioctl(),
copying from/to userspace happens all in v3d_lookup_bos which is
outside of the critical section.
- vmwgfx has a bunch of ioctls that do their own copy_*_user:
- vmw_execbuf_process: First this does some copies in
vmw_execbuf_cmdbuf() and also in the vmw_execbuf_process() itself.
Then comes the usual ttm reserve/validate sequence, then actual
submission/fencing, then unreserving, and finally some more
copy_to_user in vmw_execbuf_copy_fence_user. Glossing over tons of
details, but looks all safe.
- vmw_fence_event_ioctl: No ttm_reserve/dma_resv_lock anywhere to be
seen, seems to only create a fence and copy it out.
- a pile of smaller ioctl in vmwgfx_ioctl.c, no reservations to be
found there.
Summary: vmwgfx seems to be fine too.
- virtio: There's virtio_gpu_execbuffer_ioctl, which does all the
copying from userspace before even looking up objects through their
handles, so safe. Plus the getparam/getcaps ioctl, also both safe.
- qxl only has qxl_execbuffer_ioctl, which calls into
qxl_process_single_command. There's a lovely comment before the
__copy_from_user_inatomic that the slowpath should be copied from
i915, but I guess that never happened. Try not to be unlucky and get
your CS data evicted between when it's written and the kernel tries
to read it. The only other copy_from_user is for relocs, but those
are done before qxl_release_reserve_list(), which seems to be the
only thing reserving buffers (in the ttm/dma_resv sense) in that
code. So looks safe.
- A debugfs file in nouveau_debugfs_pstate_set() and the usif ioctl in
usif_ioctl() look safe. nouveau_gem_ioctl_pushbuf() otoh breaks this
everywhere and needs to be fixed up.
v2: Thomas pointed at that vmwgfx calls dma_resv_init while it holds a
dma_resv lock of a different object already. Christian mentioned that
ttm core does this too for ghost objects. intel-gfx-ci highlighted
that i915 has similar issues.
Unfortunately we can't do this in the usual module init functions,
because kernel threads don't have an ->mm - we have to wait around for
some user thread to do this.
Solution is to spawn a worker (but only once). It's horrible, but it
works.
v3: We can allocate mm! (Chris). Horrible worker hack out, clean
initcall solution in.
v4: Annotate with __init (Rob Herring)
Cc: Rob Herring <robh@kernel.org>
Cc: Alex Deucher <alexander.deucher@amd.com>
Cc: Christian König <christian.koenig@amd.com>
Cc: Chris Wilson <chris@chris-wilson.co.uk>
Cc: Thomas Zimmermann <tzimmermann@suse.de>
Cc: Rob Herring <robh@kernel.org>
Cc: Tomeu Vizoso <tomeu.vizoso@collabora.com>
Cc: Eric Anholt <eric@anholt.net>
Cc: Dave Airlie <airlied@redhat.com>
Cc: Gerd Hoffmann <kraxel@redhat.com>
Cc: Ben Skeggs <bskeggs@redhat.com>
Cc: "VMware Graphics" <linux-graphics-maintainer@vmware.com>
Cc: Thomas Hellstrom <thellstrom@vmware.com>
Reviewed-by: Thomas Hellstrom <thellstrom@vmware.com>
Reviewed-by: Christian König <christian.koenig@amd.com>
Reviewed-by: Chris Wilson <chris@chris-wilson.co.uk>
Tested-by: Chris Wilson <chris@chris-wilson.co.uk>
Signed-off-by: Daniel Vetter <daniel.vetter@intel.com>
Link: https://patchwork.freedesktop.org/patch/msgid/20191104173801.2972-1-daniel.vetter@ffwll.ch
2019-11-05 01:37:59 +08:00
|
|
|
#include <linux/sched/mm.h>
|
dma-fence: prime lockdep annotations
Two in one go:
- it is allowed to call dma_fence_wait() while holding a
dma_resv_lock(). This is fundamental to how eviction works with ttm,
so required.
- it is allowed to call dma_fence_wait() from memory reclaim contexts,
specifically from shrinker callbacks (which i915 does), and from mmu
notifier callbacks (which amdgpu does, and which i915 sometimes also
does, and probably always should, but that's kinda a debate). Also
for stuff like HMM we really need to be able to do this, or things
get real dicey.
Consequence is that any critical path necessary to get to a
dma_fence_signal for a fence must never a) call dma_resv_lock nor b)
allocate memory with GFP_KERNEL. Also by implication of
dma_resv_lock(), no userspace faulting allowed. That's some supremely
obnoxious limitations, which is why we need to sprinkle the right
annotations to all relevant paths.
The one big locking context we're leaving out here is mmu notifiers,
added in
commit 23b68395c7c78a764e8963fc15a7cfd318bf187f
Author: Daniel Vetter <daniel.vetter@ffwll.ch>
Date: Mon Aug 26 22:14:21 2019 +0200
mm/mmu_notifiers: add a lockdep map for invalidate_range_start/end
that one covers a lot of other callsites, and it's also allowed to
wait on dma-fences from mmu notifiers. But there's no ready-made
functions exposed to prime this, so I've left it out for now.
v2: Also track against mmu notifier context.
v3: kerneldoc to spec the cross-driver contract. Note that currently
i915 throws in a hard-coded 10s timeout on foreign fences (not sure
why that was done, but it's there), which is why that rule is worded
with SHOULD instead of MUST.
Also some of the mmu_notifier/shrinker rules might surprise SoC
drivers, I haven't fully audited them all. Which is infeasible anyway,
we'll need to run them with lockdep and dma-fence annotations and see
what goes boom.
v4: A spelling fix from Mika
v5: #ifdef for CONFIG_MMU_NOTIFIER. Reported by 0day. Unfortunately
this means lockdep enforcement is slightly inconsistent, it won't spot
GFP_NOIO and GFP_NOFS allocations in the wrong spot if
CONFIG_MMU_NOTIFIER is disabled in the kernel config. Oh well.
v5: Note that only drivers/gpu has a reasonable (or at least
historical) excuse to use dma_fence_wait() from shrinker and mmu
notifier callbacks. Everyone else should either have a better memory
manager model, or better hardware. This reflects discussions with
Jason Gunthorpe.
Cc: Jason Gunthorpe <jgg@mellanox.com>
Cc: Felix Kuehling <Felix.Kuehling@amd.com>
Cc: kernel test robot <lkp@intel.com>
Acked-by: Christian König <christian.koenig@amd.com>
Acked-by: Dave Airlie <airlied@redhat.com>
Reviewed-by: Maarten Lankhorst <maarten.lankhorst@linux.intel.com>
Reviewed-by: Thomas Hellström <thomas.hellstrom@intel.com> (v4)
Cc: Mika Kuoppala <mika.kuoppala@intel.com>
Cc: Thomas Hellstrom <thomas.hellstrom@intel.com>
Cc: linux-media@vger.kernel.org
Cc: linaro-mm-sig@lists.linaro.org
Cc: linux-rdma@vger.kernel.org
Cc: amd-gfx@lists.freedesktop.org
Cc: intel-gfx@lists.freedesktop.org
Cc: Chris Wilson <chris@chris-wilson.co.uk>
Cc: Maarten Lankhorst <maarten.lankhorst@linux.intel.com>
Cc: Christian König <christian.koenig@amd.com>
Signed-off-by: Daniel Vetter <daniel.vetter@intel.com>
Link: https://patchwork.freedesktop.org/patch/msgid/20200707201229.472834-3-daniel.vetter@ffwll.ch
2020-07-08 04:12:06 +08:00
|
|
|
#include <linux/mmu_notifier.h>
|
2013-06-27 19:48:16 +08:00
|
|
|
|
2016-04-01 04:26:51 +08:00
|
|
|
/**
|
|
|
|
* DOC: Reservation Object Overview
|
|
|
|
*
|
|
|
|
* The reservation object provides a mechanism to manage shared and
|
|
|
|
* exclusive fences associated with a buffer. A reservation object
|
|
|
|
* can have attached one exclusive fence (normally associated with
|
|
|
|
* write operations) or N shared fences (read operations). The RCU
|
|
|
|
* mechanism is used to protect read access to fences from locked
|
|
|
|
* write-side updates.
|
2021-08-05 18:47:05 +08:00
|
|
|
*
|
|
|
|
* See struct dma_resv for more details.
|
2016-04-01 04:26:51 +08:00
|
|
|
*/
|
|
|
|
|
2018-06-15 16:17:38 +08:00
|
|
|
DEFINE_WD_CLASS(reservation_ww_class);
|
2013-06-27 19:48:16 +08:00
|
|
|
EXPORT_SYMBOL(reservation_ww_class);
|
2014-07-01 18:57:54 +08:00
|
|
|
|
2019-08-06 19:33:12 +08:00
|
|
|
/**
|
2019-08-11 16:06:32 +08:00
|
|
|
* dma_resv_list_alloc - allocate fence list
|
2019-08-06 19:33:12 +08:00
|
|
|
* @shared_max: number of fences we need space for
|
|
|
|
*
|
2019-08-11 16:06:32 +08:00
|
|
|
* Allocate a new dma_resv_list and make sure to correctly initialize
|
2019-08-06 19:33:12 +08:00
|
|
|
* shared_max.
|
|
|
|
*/
|
2019-08-11 16:06:32 +08:00
|
|
|
static struct dma_resv_list *dma_resv_list_alloc(unsigned int shared_max)
|
2019-08-06 19:33:12 +08:00
|
|
|
{
|
2019-08-11 16:06:32 +08:00
|
|
|
struct dma_resv_list *list;
|
2019-08-06 19:33:12 +08:00
|
|
|
|
2020-10-08 16:03:22 +08:00
|
|
|
list = kmalloc(struct_size(list, shared, shared_max), GFP_KERNEL);
|
2019-08-06 19:33:12 +08:00
|
|
|
if (!list)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
list->shared_max = (ksize(list) - offsetof(typeof(*list), shared)) /
|
|
|
|
sizeof(*list->shared);
|
|
|
|
|
|
|
|
return list;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2019-08-11 16:06:32 +08:00
|
|
|
* dma_resv_list_free - free fence list
|
2019-08-06 19:33:12 +08:00
|
|
|
* @list: list to free
|
|
|
|
*
|
2019-08-11 16:06:32 +08:00
|
|
|
* Free a dma_resv_list and make sure to drop all references.
|
2019-08-06 19:33:12 +08:00
|
|
|
*/
|
2019-08-11 16:06:32 +08:00
|
|
|
static void dma_resv_list_free(struct dma_resv_list *list)
|
2019-08-06 19:33:12 +08:00
|
|
|
{
|
|
|
|
unsigned int i;
|
|
|
|
|
|
|
|
if (!list)
|
|
|
|
return;
|
|
|
|
|
|
|
|
for (i = 0; i < list->shared_count; ++i)
|
|
|
|
dma_fence_put(rcu_dereference_protected(list->shared[i], true));
|
|
|
|
|
|
|
|
kfree_rcu(list, rcu);
|
|
|
|
}
|
|
|
|
|
2019-06-26 22:31:46 +08:00
|
|
|
/**
|
2019-08-11 16:06:32 +08:00
|
|
|
* dma_resv_init - initialize a reservation object
|
2019-06-26 22:31:46 +08:00
|
|
|
* @obj: the reservation object
|
|
|
|
*/
|
2019-08-11 16:06:32 +08:00
|
|
|
void dma_resv_init(struct dma_resv *obj)
|
2019-06-26 22:31:46 +08:00
|
|
|
{
|
|
|
|
ww_mutex_init(&obj->lock, &reservation_ww_class);
|
2020-07-20 23:55:18 +08:00
|
|
|
seqcount_ww_mutex_init(&obj->seq, &obj->lock);
|
2019-08-15 02:24:01 +08:00
|
|
|
|
2019-06-26 22:31:46 +08:00
|
|
|
RCU_INIT_POINTER(obj->fence, NULL);
|
|
|
|
RCU_INIT_POINTER(obj->fence_excl, NULL);
|
|
|
|
}
|
2019-08-11 16:06:32 +08:00
|
|
|
EXPORT_SYMBOL(dma_resv_init);
|
2019-06-26 22:31:46 +08:00
|
|
|
|
|
|
|
/**
|
2019-08-11 16:06:32 +08:00
|
|
|
* dma_resv_fini - destroys a reservation object
|
2019-06-26 22:31:46 +08:00
|
|
|
* @obj: the reservation object
|
|
|
|
*/
|
2019-08-11 16:06:32 +08:00
|
|
|
void dma_resv_fini(struct dma_resv *obj)
|
2019-06-26 22:31:46 +08:00
|
|
|
{
|
2019-08-11 16:06:32 +08:00
|
|
|
struct dma_resv_list *fobj;
|
2019-06-26 22:31:46 +08:00
|
|
|
struct dma_fence *excl;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This object should be dead and all references must have
|
|
|
|
* been released to it, so no need to be protected with rcu.
|
|
|
|
*/
|
|
|
|
excl = rcu_dereference_protected(obj->fence_excl, 1);
|
|
|
|
if (excl)
|
|
|
|
dma_fence_put(excl);
|
|
|
|
|
|
|
|
fobj = rcu_dereference_protected(obj->fence, 1);
|
2019-08-11 16:06:32 +08:00
|
|
|
dma_resv_list_free(fobj);
|
2019-06-26 22:31:46 +08:00
|
|
|
ww_mutex_destroy(&obj->lock);
|
|
|
|
}
|
2019-08-11 16:06:32 +08:00
|
|
|
EXPORT_SYMBOL(dma_resv_fini);
|
2019-06-26 22:31:46 +08:00
|
|
|
|
2016-04-01 04:26:51 +08:00
|
|
|
/**
|
2019-08-11 16:06:32 +08:00
|
|
|
* dma_resv_reserve_shared - Reserve space to add shared fences to
|
|
|
|
* a dma_resv.
|
2016-04-01 04:26:51 +08:00
|
|
|
* @obj: reservation object
|
2018-09-19 22:12:25 +08:00
|
|
|
* @num_fences: number of fences we want to add
|
2016-04-01 04:26:51 +08:00
|
|
|
*
|
2019-08-11 16:06:32 +08:00
|
|
|
* Should be called before dma_resv_add_shared_fence(). Must
|
2021-08-05 18:47:05 +08:00
|
|
|
* be called with @obj locked through dma_resv_lock().
|
|
|
|
*
|
|
|
|
* Note that the preallocated slots need to be re-reserved if @obj is unlocked
|
|
|
|
* at any time before calling dma_resv_add_shared_fence(). This is validated
|
|
|
|
* when CONFIG_DEBUG_MUTEXES is enabled.
|
2016-04-01 04:26:51 +08:00
|
|
|
*
|
|
|
|
* RETURNS
|
|
|
|
* Zero for success, or -errno
|
2014-07-01 18:57:54 +08:00
|
|
|
*/
|
2019-08-11 16:06:32 +08:00
|
|
|
int dma_resv_reserve_shared(struct dma_resv *obj, unsigned int num_fences)
|
2014-07-01 18:57:54 +08:00
|
|
|
{
|
2019-08-11 16:06:32 +08:00
|
|
|
struct dma_resv_list *old, *new;
|
2018-08-08 22:01:22 +08:00
|
|
|
unsigned int i, j, k, max;
|
2014-07-01 18:57:54 +08:00
|
|
|
|
2019-08-11 16:06:32 +08:00
|
|
|
dma_resv_assert_held(obj);
|
2017-06-13 16:26:46 +08:00
|
|
|
|
2021-05-11 20:11:41 +08:00
|
|
|
old = dma_resv_shared_list(obj);
|
2014-07-01 18:57:54 +08:00
|
|
|
if (old && old->shared_max) {
|
2018-09-19 22:12:25 +08:00
|
|
|
if ((old->shared_count + num_fences) <= old->shared_max)
|
2014-07-01 18:57:54 +08:00
|
|
|
return 0;
|
2021-05-11 16:42:52 +08:00
|
|
|
max = max(old->shared_count + num_fences, old->shared_max * 2);
|
2017-11-14 22:24:36 +08:00
|
|
|
} else {
|
2020-11-24 19:57:07 +08:00
|
|
|
max = max(4ul, roundup_pow_of_two(num_fences));
|
2017-11-14 22:24:36 +08:00
|
|
|
}
|
2014-07-01 18:58:00 +08:00
|
|
|
|
2019-08-11 16:06:32 +08:00
|
|
|
new = dma_resv_list_alloc(max);
|
2018-08-08 22:01:22 +08:00
|
|
|
if (!new)
|
|
|
|
return -ENOMEM;
|
2014-07-01 18:57:54 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* no need to bump fence refcounts, rcu_read access
|
|
|
|
* requires the use of kref_get_unless_zero, and the
|
|
|
|
* references from the old struct are carried over to
|
|
|
|
* the new.
|
|
|
|
*/
|
2018-08-08 22:01:22 +08:00
|
|
|
for (i = 0, j = 0, k = max; i < (old ? old->shared_count : 0); ++i) {
|
|
|
|
struct dma_fence *fence;
|
2014-07-01 18:58:00 +08:00
|
|
|
|
2018-08-08 22:01:22 +08:00
|
|
|
fence = rcu_dereference_protected(old->shared[i],
|
2019-08-11 16:06:32 +08:00
|
|
|
dma_resv_held(obj));
|
2018-08-08 22:01:22 +08:00
|
|
|
if (dma_fence_is_signaled(fence))
|
|
|
|
RCU_INIT_POINTER(new->shared[--k], fence);
|
2017-11-14 22:24:35 +08:00
|
|
|
else
|
2018-08-08 22:01:22 +08:00
|
|
|
RCU_INIT_POINTER(new->shared[j++], fence);
|
2014-07-01 18:57:54 +08:00
|
|
|
}
|
2018-08-08 22:01:22 +08:00
|
|
|
new->shared_count = j;
|
2014-07-01 18:57:54 +08:00
|
|
|
|
2014-07-01 18:58:00 +08:00
|
|
|
/*
|
2019-07-12 16:03:14 +08:00
|
|
|
* We are not changing the effective set of fences here so can
|
|
|
|
* merely update the pointer to the new array; both existing
|
|
|
|
* readers and new readers will see exactly the same set of
|
|
|
|
* active (unsignaled) shared fences. Individual fences and the
|
|
|
|
* old array are protected by RCU and so will not vanish under
|
|
|
|
* the gaze of the rcu_read_lock() readers.
|
2014-07-01 18:58:00 +08:00
|
|
|
*/
|
2019-07-12 16:03:14 +08:00
|
|
|
rcu_assign_pointer(obj->fence, new);
|
2014-07-01 18:58:00 +08:00
|
|
|
|
2017-11-14 22:24:35 +08:00
|
|
|
if (!old)
|
2018-08-08 22:01:22 +08:00
|
|
|
return 0;
|
2014-07-01 18:58:00 +08:00
|
|
|
|
2017-11-14 22:24:35 +08:00
|
|
|
/* Drop the references to the signaled fences */
|
2019-07-12 16:03:13 +08:00
|
|
|
for (i = k; i < max; ++i) {
|
2018-08-08 22:01:22 +08:00
|
|
|
struct dma_fence *fence;
|
2017-11-14 22:24:35 +08:00
|
|
|
|
2018-08-08 22:01:22 +08:00
|
|
|
fence = rcu_dereference_protected(new->shared[i],
|
2019-08-11 16:06:32 +08:00
|
|
|
dma_resv_held(obj));
|
2018-08-08 22:01:22 +08:00
|
|
|
dma_fence_put(fence);
|
2017-11-14 22:24:35 +08:00
|
|
|
}
|
|
|
|
kfree_rcu(old, rcu);
|
2018-08-08 22:01:22 +08:00
|
|
|
|
|
|
|
return 0;
|
2014-07-01 18:57:54 +08:00
|
|
|
}
|
2019-08-11 16:06:32 +08:00
|
|
|
EXPORT_SYMBOL(dma_resv_reserve_shared);
|
2014-07-01 18:57:54 +08:00
|
|
|
|
2021-05-06 20:16:01 +08:00
|
|
|
#ifdef CONFIG_DEBUG_MUTEXES
|
|
|
|
/**
|
|
|
|
* dma_resv_reset_shared_max - reset shared fences for debugging
|
|
|
|
* @obj: the dma_resv object to reset
|
|
|
|
*
|
|
|
|
* Reset the number of pre-reserved shared slots to test that drivers do
|
|
|
|
* correct slot allocation using dma_resv_reserve_shared(). See also
|
|
|
|
* &dma_resv_list.shared_max.
|
|
|
|
*/
|
|
|
|
void dma_resv_reset_shared_max(struct dma_resv *obj)
|
|
|
|
{
|
2021-05-11 20:11:41 +08:00
|
|
|
struct dma_resv_list *fences = dma_resv_shared_list(obj);
|
2021-05-06 20:16:01 +08:00
|
|
|
|
2021-05-11 20:11:41 +08:00
|
|
|
dma_resv_assert_held(obj);
|
|
|
|
|
|
|
|
/* Test shared fence slot reservation */
|
|
|
|
if (fences)
|
|
|
|
fences->shared_max = fences->shared_count;
|
2021-05-06 20:16:01 +08:00
|
|
|
}
|
2021-06-04 23:47:39 +08:00
|
|
|
EXPORT_SYMBOL(dma_resv_reset_shared_max);
|
2021-05-06 20:16:01 +08:00
|
|
|
#endif
|
|
|
|
|
2016-04-01 04:26:51 +08:00
|
|
|
/**
|
2019-08-11 16:06:32 +08:00
|
|
|
* dma_resv_add_shared_fence - Add a fence to a shared slot
|
2016-04-01 04:26:51 +08:00
|
|
|
* @obj: the reservation object
|
|
|
|
* @fence: the shared fence to add
|
|
|
|
*
|
2021-08-05 18:47:05 +08:00
|
|
|
* Add a fence to a shared slot, @obj must be locked with dma_resv_lock(), and
|
2019-08-11 16:06:32 +08:00
|
|
|
* dma_resv_reserve_shared() has been called.
|
2021-08-05 18:47:05 +08:00
|
|
|
*
|
|
|
|
* See also &dma_resv.fence for a discussion of the semantics.
|
2014-07-01 18:57:54 +08:00
|
|
|
*/
|
2019-08-11 16:06:32 +08:00
|
|
|
void dma_resv_add_shared_fence(struct dma_resv *obj, struct dma_fence *fence)
|
2014-07-01 18:57:54 +08:00
|
|
|
{
|
2019-08-11 16:06:32 +08:00
|
|
|
struct dma_resv_list *fobj;
|
2019-08-05 17:14:27 +08:00
|
|
|
struct dma_fence *old;
|
2018-10-26 16:03:02 +08:00
|
|
|
unsigned int i, count;
|
2014-07-01 18:57:54 +08:00
|
|
|
|
2018-08-08 22:01:22 +08:00
|
|
|
dma_fence_get(fence);
|
|
|
|
|
2019-08-11 16:06:32 +08:00
|
|
|
dma_resv_assert_held(obj);
|
2017-06-13 16:26:46 +08:00
|
|
|
|
2021-05-11 20:11:41 +08:00
|
|
|
fobj = dma_resv_shared_list(obj);
|
2018-10-26 16:03:02 +08:00
|
|
|
count = fobj->shared_count;
|
2014-07-01 18:57:54 +08:00
|
|
|
|
2019-08-15 02:24:01 +08:00
|
|
|
write_seqcount_begin(&obj->seq);
|
|
|
|
|
2018-10-26 16:03:02 +08:00
|
|
|
for (i = 0; i < count; ++i) {
|
2018-08-08 22:01:22 +08:00
|
|
|
|
2019-08-05 17:14:27 +08:00
|
|
|
old = rcu_dereference_protected(fobj->shared[i],
|
2019-08-11 16:06:32 +08:00
|
|
|
dma_resv_held(obj));
|
2019-08-05 17:14:27 +08:00
|
|
|
if (old->context == fence->context ||
|
|
|
|
dma_fence_is_signaled(old))
|
2018-08-08 22:01:22 +08:00
|
|
|
goto replace;
|
|
|
|
}
|
|
|
|
|
|
|
|
BUG_ON(fobj->shared_count >= fobj->shared_max);
|
2019-08-05 17:14:27 +08:00
|
|
|
old = NULL;
|
2018-10-26 16:03:02 +08:00
|
|
|
count++;
|
2018-08-08 22:01:22 +08:00
|
|
|
|
|
|
|
replace:
|
|
|
|
RCU_INIT_POINTER(fobj->shared[i], fence);
|
2018-10-26 16:03:02 +08:00
|
|
|
/* pointer update must be visible before we extend the shared_count */
|
|
|
|
smp_store_mb(fobj->shared_count, count);
|
2019-08-15 02:24:01 +08:00
|
|
|
|
|
|
|
write_seqcount_end(&obj->seq);
|
2019-08-05 17:14:27 +08:00
|
|
|
dma_fence_put(old);
|
2014-07-01 18:57:54 +08:00
|
|
|
}
|
2019-08-11 16:06:32 +08:00
|
|
|
EXPORT_SYMBOL(dma_resv_add_shared_fence);
|
2014-07-01 18:57:54 +08:00
|
|
|
|
2016-04-01 04:26:51 +08:00
|
|
|
/**
|
2019-08-11 16:06:32 +08:00
|
|
|
* dma_resv_add_excl_fence - Add an exclusive fence.
|
2016-04-01 04:26:51 +08:00
|
|
|
* @obj: the reservation object
|
2021-08-05 18:47:05 +08:00
|
|
|
* @fence: the exclusive fence to add
|
2016-04-01 04:26:51 +08:00
|
|
|
*
|
2021-08-05 18:47:05 +08:00
|
|
|
* Add a fence to the exclusive slot. @obj must be locked with dma_resv_lock().
|
|
|
|
* Note that this function replaces all fences attached to @obj, see also
|
|
|
|
* &dma_resv.fence_excl for a discussion of the semantics.
|
2016-04-01 04:26:51 +08:00
|
|
|
*/
|
2019-08-11 16:06:32 +08:00
|
|
|
void dma_resv_add_excl_fence(struct dma_resv *obj, struct dma_fence *fence)
|
2014-07-01 18:57:54 +08:00
|
|
|
{
|
2021-05-10 22:14:09 +08:00
|
|
|
struct dma_fence *old_fence = dma_resv_excl_fence(obj);
|
2019-08-11 16:06:32 +08:00
|
|
|
struct dma_resv_list *old;
|
2014-07-01 18:57:54 +08:00
|
|
|
u32 i = 0;
|
|
|
|
|
2019-08-11 16:06:32 +08:00
|
|
|
dma_resv_assert_held(obj);
|
2017-06-13 16:26:46 +08:00
|
|
|
|
2021-05-11 20:11:41 +08:00
|
|
|
old = dma_resv_shared_list(obj);
|
2014-07-01 18:58:00 +08:00
|
|
|
if (old)
|
2014-07-01 18:57:54 +08:00
|
|
|
i = old->shared_count;
|
|
|
|
|
|
|
|
if (fence)
|
2016-10-25 20:00:45 +08:00
|
|
|
dma_fence_get(fence);
|
2014-07-01 18:57:54 +08:00
|
|
|
|
2019-08-15 02:24:01 +08:00
|
|
|
write_seqcount_begin(&obj->seq);
|
|
|
|
/* write_seqcount_begin provides the necessary memory barrier */
|
|
|
|
RCU_INIT_POINTER(obj->fence_excl, fence);
|
2014-07-01 18:58:00 +08:00
|
|
|
if (old)
|
2019-08-15 02:24:01 +08:00
|
|
|
old->shared_count = 0;
|
|
|
|
write_seqcount_end(&obj->seq);
|
2014-07-01 18:57:54 +08:00
|
|
|
|
|
|
|
/* inplace update, no shared fences */
|
|
|
|
while (i--)
|
2016-10-25 20:00:45 +08:00
|
|
|
dma_fence_put(rcu_dereference_protected(old->shared[i],
|
2019-08-11 16:06:32 +08:00
|
|
|
dma_resv_held(obj)));
|
2014-07-01 18:57:54 +08:00
|
|
|
|
2017-08-08 05:32:21 +08:00
|
|
|
dma_fence_put(old_fence);
|
2014-07-01 18:57:54 +08:00
|
|
|
}
|
2019-08-11 16:06:32 +08:00
|
|
|
EXPORT_SYMBOL(dma_resv_add_excl_fence);
|
2014-07-01 18:58:00 +08:00
|
|
|
|
2021-06-15 21:10:03 +08:00
|
|
|
/**
|
|
|
|
* dma_resv_iter_restart_unlocked - restart the unlocked iterator
|
|
|
|
* @cursor: The dma_resv_iter object to restart
|
|
|
|
*
|
|
|
|
* Restart the unlocked iteration by initializing the cursor object.
|
|
|
|
*/
|
|
|
|
static void dma_resv_iter_restart_unlocked(struct dma_resv_iter *cursor)
|
|
|
|
{
|
|
|
|
cursor->seq = read_seqcount_begin(&cursor->obj->seq);
|
|
|
|
cursor->index = -1;
|
2021-10-08 17:50:07 +08:00
|
|
|
cursor->shared_count = 0;
|
|
|
|
if (cursor->all_fences) {
|
2021-06-15 21:10:03 +08:00
|
|
|
cursor->fences = dma_resv_shared_list(cursor->obj);
|
2021-10-08 17:50:07 +08:00
|
|
|
if (cursor->fences)
|
|
|
|
cursor->shared_count = cursor->fences->shared_count;
|
|
|
|
} else {
|
2021-06-15 21:10:03 +08:00
|
|
|
cursor->fences = NULL;
|
2021-10-08 17:50:07 +08:00
|
|
|
}
|
2021-06-15 21:10:03 +08:00
|
|
|
cursor->is_restarted = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* dma_resv_iter_walk_unlocked - walk over fences in a dma_resv obj
|
|
|
|
* @cursor: cursor to record the current position
|
|
|
|
*
|
|
|
|
* Return all the fences in the dma_resv object which are not yet signaled.
|
|
|
|
* The returned fence has an extra local reference so will stay alive.
|
|
|
|
* If a concurrent modify is detected the whole iteration is started over again.
|
|
|
|
*/
|
|
|
|
static void dma_resv_iter_walk_unlocked(struct dma_resv_iter *cursor)
|
|
|
|
{
|
|
|
|
struct dma_resv *obj = cursor->obj;
|
|
|
|
|
|
|
|
do {
|
|
|
|
/* Drop the reference from the previous round */
|
|
|
|
dma_fence_put(cursor->fence);
|
|
|
|
|
|
|
|
if (cursor->index == -1) {
|
|
|
|
cursor->fence = dma_resv_excl_fence(obj);
|
|
|
|
cursor->index++;
|
|
|
|
if (!cursor->fence)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
} else if (!cursor->fences ||
|
2021-10-08 17:50:07 +08:00
|
|
|
cursor->index >= cursor->shared_count) {
|
2021-06-15 21:10:03 +08:00
|
|
|
cursor->fence = NULL;
|
|
|
|
break;
|
|
|
|
|
|
|
|
} else {
|
|
|
|
struct dma_resv_list *fences = cursor->fences;
|
|
|
|
unsigned int idx = cursor->index++;
|
|
|
|
|
|
|
|
cursor->fence = rcu_dereference(fences->shared[idx]);
|
|
|
|
}
|
|
|
|
cursor->fence = dma_fence_get_rcu(cursor->fence);
|
|
|
|
if (!cursor->fence || !dma_fence_is_signaled(cursor->fence))
|
|
|
|
break;
|
|
|
|
} while (true);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* dma_resv_iter_first_unlocked - first fence in an unlocked dma_resv obj.
|
|
|
|
* @cursor: the cursor with the current position
|
|
|
|
*
|
|
|
|
* Returns the first fence from an unlocked dma_resv obj.
|
|
|
|
*/
|
|
|
|
struct dma_fence *dma_resv_iter_first_unlocked(struct dma_resv_iter *cursor)
|
|
|
|
{
|
|
|
|
rcu_read_lock();
|
|
|
|
do {
|
|
|
|
dma_resv_iter_restart_unlocked(cursor);
|
|
|
|
dma_resv_iter_walk_unlocked(cursor);
|
|
|
|
} while (read_seqcount_retry(&cursor->obj->seq, cursor->seq));
|
|
|
|
rcu_read_unlock();
|
|
|
|
|
|
|
|
return cursor->fence;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(dma_resv_iter_first_unlocked);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* dma_resv_iter_next_unlocked - next fence in an unlocked dma_resv obj.
|
|
|
|
* @cursor: the cursor with the current position
|
|
|
|
*
|
|
|
|
* Returns the next fence from an unlocked dma_resv obj.
|
|
|
|
*/
|
|
|
|
struct dma_fence *dma_resv_iter_next_unlocked(struct dma_resv_iter *cursor)
|
|
|
|
{
|
|
|
|
bool restart;
|
|
|
|
|
|
|
|
rcu_read_lock();
|
|
|
|
cursor->is_restarted = false;
|
|
|
|
restart = read_seqcount_retry(&cursor->obj->seq, cursor->seq);
|
|
|
|
do {
|
|
|
|
if (restart)
|
|
|
|
dma_resv_iter_restart_unlocked(cursor);
|
|
|
|
dma_resv_iter_walk_unlocked(cursor);
|
|
|
|
restart = true;
|
|
|
|
} while (read_seqcount_retry(&cursor->obj->seq, cursor->seq));
|
|
|
|
rcu_read_unlock();
|
|
|
|
|
|
|
|
return cursor->fence;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(dma_resv_iter_next_unlocked);
|
|
|
|
|
2021-06-15 21:10:03 +08:00
|
|
|
/**
|
|
|
|
* dma_resv_iter_first - first fence from a locked dma_resv object
|
|
|
|
* @cursor: cursor to record the current position
|
|
|
|
*
|
|
|
|
* Return the first fence in the dma_resv object while holding the
|
|
|
|
* &dma_resv.lock.
|
|
|
|
*/
|
|
|
|
struct dma_fence *dma_resv_iter_first(struct dma_resv_iter *cursor)
|
|
|
|
{
|
|
|
|
struct dma_fence *fence;
|
|
|
|
|
|
|
|
dma_resv_assert_held(cursor->obj);
|
|
|
|
|
|
|
|
cursor->index = 0;
|
|
|
|
if (cursor->all_fences)
|
|
|
|
cursor->fences = dma_resv_shared_list(cursor->obj);
|
|
|
|
else
|
|
|
|
cursor->fences = NULL;
|
|
|
|
|
|
|
|
fence = dma_resv_excl_fence(cursor->obj);
|
|
|
|
if (!fence)
|
|
|
|
fence = dma_resv_iter_next(cursor);
|
|
|
|
|
|
|
|
cursor->is_restarted = true;
|
|
|
|
return fence;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(dma_resv_iter_first);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* dma_resv_iter_next - next fence from a locked dma_resv object
|
|
|
|
* @cursor: cursor to record the current position
|
|
|
|
*
|
|
|
|
* Return the next fences from the dma_resv object while holding the
|
|
|
|
* &dma_resv.lock.
|
|
|
|
*/
|
|
|
|
struct dma_fence *dma_resv_iter_next(struct dma_resv_iter *cursor)
|
|
|
|
{
|
|
|
|
unsigned int idx;
|
|
|
|
|
|
|
|
dma_resv_assert_held(cursor->obj);
|
|
|
|
|
|
|
|
cursor->is_restarted = false;
|
|
|
|
if (!cursor->fences || cursor->index >= cursor->fences->shared_count)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
idx = cursor->index++;
|
|
|
|
return rcu_dereference_protected(cursor->fences->shared[idx],
|
|
|
|
dma_resv_held(cursor->obj));
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(dma_resv_iter_next);
|
|
|
|
|
2017-08-11 01:01:48 +08:00
|
|
|
/**
|
2021-05-11 16:42:52 +08:00
|
|
|
* dma_resv_copy_fences - Copy all fences from src to dst.
|
|
|
|
* @dst: the destination reservation object
|
|
|
|
* @src: the source reservation object
|
|
|
|
*
|
|
|
|
* Copy all fences from src to dst. dst-lock must be held.
|
|
|
|
*/
|
2019-08-11 16:06:32 +08:00
|
|
|
int dma_resv_copy_fences(struct dma_resv *dst, struct dma_resv *src)
|
2017-08-11 01:01:48 +08:00
|
|
|
{
|
2021-06-15 21:15:01 +08:00
|
|
|
struct dma_resv_iter cursor;
|
|
|
|
struct dma_resv_list *list;
|
|
|
|
struct dma_fence *f, *excl;
|
2017-08-11 01:01:48 +08:00
|
|
|
|
2019-08-11 16:06:32 +08:00
|
|
|
dma_resv_assert_held(dst);
|
2017-06-13 16:26:46 +08:00
|
|
|
|
2021-06-15 21:15:01 +08:00
|
|
|
list = NULL;
|
|
|
|
excl = NULL;
|
2017-08-11 01:01:48 +08:00
|
|
|
|
2021-06-15 21:15:01 +08:00
|
|
|
dma_resv_iter_begin(&cursor, src, true);
|
|
|
|
dma_resv_for_each_fence_unlocked(&cursor, f) {
|
2019-08-15 02:24:01 +08:00
|
|
|
|
2021-06-15 21:15:01 +08:00
|
|
|
if (dma_resv_iter_is_restarted(&cursor)) {
|
|
|
|
dma_resv_list_free(list);
|
|
|
|
dma_fence_put(excl);
|
2017-09-05 03:02:45 +08:00
|
|
|
|
2021-10-08 17:50:07 +08:00
|
|
|
if (cursor.shared_count) {
|
|
|
|
list = dma_resv_list_alloc(cursor.shared_count);
|
2021-06-15 21:15:01 +08:00
|
|
|
if (!list) {
|
|
|
|
dma_resv_iter_end(&cursor);
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
2017-09-05 03:02:45 +08:00
|
|
|
|
2021-06-15 21:15:01 +08:00
|
|
|
list->shared_count = 0;
|
2017-09-05 03:02:45 +08:00
|
|
|
|
2021-06-15 21:15:01 +08:00
|
|
|
} else {
|
|
|
|
list = NULL;
|
2017-09-05 03:02:45 +08:00
|
|
|
}
|
2021-06-15 21:15:01 +08:00
|
|
|
excl = NULL;
|
2017-09-05 03:02:45 +08:00
|
|
|
}
|
|
|
|
|
2021-06-15 21:15:01 +08:00
|
|
|
dma_fence_get(f);
|
|
|
|
if (dma_resv_iter_is_exclusive(&cursor))
|
|
|
|
excl = f;
|
|
|
|
else
|
|
|
|
RCU_INIT_POINTER(list->shared[list->shared_count++], f);
|
|
|
|
}
|
|
|
|
dma_resv_iter_end(&cursor);
|
2017-08-11 01:01:48 +08:00
|
|
|
|
2019-08-15 02:24:01 +08:00
|
|
|
write_seqcount_begin(&dst->seq);
|
2021-06-15 21:15:01 +08:00
|
|
|
excl = rcu_replace_pointer(dst->fence_excl, excl, dma_resv_held(dst));
|
|
|
|
list = rcu_replace_pointer(dst->fence, list, dma_resv_held(dst));
|
2019-08-15 02:24:01 +08:00
|
|
|
write_seqcount_end(&dst->seq);
|
2017-08-11 01:01:48 +08:00
|
|
|
|
2021-06-15 21:15:01 +08:00
|
|
|
dma_resv_list_free(list);
|
|
|
|
dma_fence_put(excl);
|
2017-08-11 01:01:48 +08:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
2019-08-11 16:06:32 +08:00
|
|
|
EXPORT_SYMBOL(dma_resv_copy_fences);
|
2017-08-11 01:01:48 +08:00
|
|
|
|
2016-04-01 04:26:51 +08:00
|
|
|
/**
|
2021-06-02 19:01:15 +08:00
|
|
|
* dma_resv_get_fences - Get an object's shared and exclusive
|
2016-04-01 04:26:51 +08:00
|
|
|
* fences without update side lock held
|
|
|
|
* @obj: the reservation object
|
2021-06-15 21:25:22 +08:00
|
|
|
* @fence_excl: the returned exclusive fence (or NULL)
|
|
|
|
* @shared_count: the number of shared fences returned
|
|
|
|
* @shared: the array of shared fence ptrs returned (array is krealloc'd to
|
2016-04-01 04:26:51 +08:00
|
|
|
* the required size, and must be freed by caller)
|
|
|
|
*
|
2018-01-10 20:53:41 +08:00
|
|
|
* Retrieve all fences from the reservation object. If the pointer for the
|
|
|
|
* exclusive fence is not specified the fence is put into the array of the
|
|
|
|
* shared fences as well. Returns either zero or -ENOMEM.
|
2016-04-01 04:26:51 +08:00
|
|
|
*/
|
2021-06-15 21:25:22 +08:00
|
|
|
int dma_resv_get_fences(struct dma_resv *obj, struct dma_fence **fence_excl,
|
|
|
|
unsigned int *shared_count, struct dma_fence ***shared)
|
2014-07-01 18:58:00 +08:00
|
|
|
{
|
2021-06-15 21:25:22 +08:00
|
|
|
struct dma_resv_iter cursor;
|
|
|
|
struct dma_fence *fence;
|
2016-08-29 15:08:30 +08:00
|
|
|
|
2021-06-15 21:25:22 +08:00
|
|
|
*shared_count = 0;
|
|
|
|
*shared = NULL;
|
2014-07-01 18:58:00 +08:00
|
|
|
|
2021-06-15 21:25:22 +08:00
|
|
|
if (fence_excl)
|
|
|
|
*fence_excl = NULL;
|
2018-01-10 20:53:41 +08:00
|
|
|
|
2021-06-15 21:25:22 +08:00
|
|
|
dma_resv_iter_begin(&cursor, obj, true);
|
|
|
|
dma_resv_for_each_fence_unlocked(&cursor, fence) {
|
2018-01-10 20:53:41 +08:00
|
|
|
|
2021-06-15 21:25:22 +08:00
|
|
|
if (dma_resv_iter_is_restarted(&cursor)) {
|
|
|
|
unsigned int count;
|
2014-07-01 18:58:00 +08:00
|
|
|
|
2021-06-15 21:25:22 +08:00
|
|
|
while (*shared_count)
|
|
|
|
dma_fence_put((*shared)[--(*shared_count)]);
|
2019-06-04 20:53:23 +08:00
|
|
|
|
2021-06-15 21:25:22 +08:00
|
|
|
if (fence_excl)
|
|
|
|
dma_fence_put(*fence_excl);
|
2019-06-04 20:53:23 +08:00
|
|
|
|
2021-10-08 17:50:07 +08:00
|
|
|
count = cursor.shared_count;
|
2021-06-15 21:25:22 +08:00
|
|
|
count += fence_excl ? 0 : 1;
|
2014-07-01 18:58:00 +08:00
|
|
|
|
2021-06-15 21:25:22 +08:00
|
|
|
/* Eventually re-allocate the array */
|
|
|
|
*shared = krealloc_array(*shared, count,
|
|
|
|
sizeof(void *),
|
|
|
|
GFP_KERNEL);
|
|
|
|
if (count && !*shared) {
|
|
|
|
dma_resv_iter_end(&cursor);
|
|
|
|
return -ENOMEM;
|
2014-07-01 18:58:00 +08:00
|
|
|
}
|
2016-08-29 15:08:30 +08:00
|
|
|
}
|
2014-07-01 18:58:00 +08:00
|
|
|
|
2021-06-15 21:25:22 +08:00
|
|
|
dma_fence_get(fence);
|
|
|
|
if (dma_resv_iter_is_exclusive(&cursor) && fence_excl)
|
|
|
|
*fence_excl = fence;
|
|
|
|
else
|
|
|
|
(*shared)[(*shared_count)++] = fence;
|
2014-07-01 18:58:00 +08:00
|
|
|
}
|
2021-06-15 21:25:22 +08:00
|
|
|
dma_resv_iter_end(&cursor);
|
2016-08-29 15:08:30 +08:00
|
|
|
|
2021-06-15 21:25:22 +08:00
|
|
|
return 0;
|
2014-07-01 18:58:00 +08:00
|
|
|
}
|
2021-06-02 19:01:15 +08:00
|
|
|
EXPORT_SYMBOL_GPL(dma_resv_get_fences);
|
2014-07-01 18:58:00 +08:00
|
|
|
|
2016-04-01 04:26:51 +08:00
|
|
|
/**
|
2021-06-02 19:01:15 +08:00
|
|
|
* dma_resv_wait_timeout - Wait on reservation's objects
|
2016-04-01 04:26:51 +08:00
|
|
|
* shared and/or exclusive fences.
|
|
|
|
* @obj: the reservation object
|
|
|
|
* @wait_all: if true, wait on all fences, else wait on just exclusive fence
|
|
|
|
* @intr: if true, do interruptible wait
|
|
|
|
* @timeout: timeout value in jiffies or zero to return immediately
|
|
|
|
*
|
2021-06-02 19:01:15 +08:00
|
|
|
* Callers are not required to hold specific locks, but maybe hold
|
|
|
|
* dma_resv_lock() already
|
2016-04-01 04:26:51 +08:00
|
|
|
* RETURNS
|
|
|
|
* Returns -ERESTARTSYS if interrupted, 0 if the wait timed out, or
|
|
|
|
* greater than zer on success.
|
|
|
|
*/
|
2021-06-02 19:01:15 +08:00
|
|
|
long dma_resv_wait_timeout(struct dma_resv *obj, bool wait_all, bool intr,
|
|
|
|
unsigned long timeout)
|
2014-07-01 18:58:00 +08:00
|
|
|
{
|
2016-11-08 05:16:16 +08:00
|
|
|
long ret = timeout ? timeout : 1;
|
2021-06-15 21:28:03 +08:00
|
|
|
struct dma_resv_iter cursor;
|
2021-05-11 16:42:52 +08:00
|
|
|
struct dma_fence *fence;
|
2014-07-01 18:58:00 +08:00
|
|
|
|
2021-06-15 21:28:03 +08:00
|
|
|
dma_resv_iter_begin(&cursor, obj, wait_all);
|
|
|
|
dma_resv_for_each_fence_unlocked(&cursor, fence) {
|
2014-07-01 18:58:00 +08:00
|
|
|
|
2021-06-15 21:28:03 +08:00
|
|
|
ret = dma_fence_wait_timeout(fence, intr, ret);
|
|
|
|
if (ret <= 0) {
|
|
|
|
dma_resv_iter_end(&cursor);
|
|
|
|
return ret;
|
2014-07-01 18:58:00 +08:00
|
|
|
}
|
|
|
|
}
|
2021-06-15 21:28:03 +08:00
|
|
|
dma_resv_iter_end(&cursor);
|
2014-07-01 18:58:00 +08:00
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
2021-06-02 19:01:15 +08:00
|
|
|
EXPORT_SYMBOL_GPL(dma_resv_wait_timeout);
|
2014-07-01 18:58:00 +08:00
|
|
|
|
|
|
|
|
2016-04-01 04:26:51 +08:00
|
|
|
/**
|
2021-06-02 19:01:15 +08:00
|
|
|
* dma_resv_test_signaled - Test if a reservation object's fences have been
|
|
|
|
* signaled.
|
2016-04-01 04:26:51 +08:00
|
|
|
* @obj: the reservation object
|
|
|
|
* @test_all: if true, test all fences, otherwise only test the exclusive
|
|
|
|
* fence
|
|
|
|
*
|
2021-06-02 19:01:15 +08:00
|
|
|
* Callers are not required to hold specific locks, but maybe hold
|
2021-08-05 18:47:05 +08:00
|
|
|
* dma_resv_lock() already.
|
|
|
|
*
|
2016-04-01 04:26:51 +08:00
|
|
|
* RETURNS
|
2021-08-05 18:47:05 +08:00
|
|
|
*
|
|
|
|
* True if all fences signaled, else false.
|
2016-04-01 04:26:51 +08:00
|
|
|
*/
|
2021-06-02 19:01:15 +08:00
|
|
|
bool dma_resv_test_signaled(struct dma_resv *obj, bool test_all)
|
2014-07-01 18:58:00 +08:00
|
|
|
{
|
2021-06-15 21:34:11 +08:00
|
|
|
struct dma_resv_iter cursor;
|
2021-06-06 17:46:33 +08:00
|
|
|
struct dma_fence *fence;
|
2019-08-15 02:24:01 +08:00
|
|
|
|
2021-06-15 21:34:11 +08:00
|
|
|
dma_resv_iter_begin(&cursor, obj, test_all);
|
|
|
|
dma_resv_for_each_fence_unlocked(&cursor, fence) {
|
|
|
|
dma_resv_iter_end(&cursor);
|
|
|
|
return false;
|
2019-08-15 02:24:01 +08:00
|
|
|
}
|
2021-06-15 21:34:11 +08:00
|
|
|
dma_resv_iter_end(&cursor);
|
|
|
|
return true;
|
2014-07-01 18:58:00 +08:00
|
|
|
}
|
2021-06-02 19:01:15 +08:00
|
|
|
EXPORT_SYMBOL_GPL(dma_resv_test_signaled);
|
2021-05-11 16:42:52 +08:00
|
|
|
|
|
|
|
#if IS_ENABLED(CONFIG_LOCKDEP)
|
|
|
|
static int __init dma_resv_lockdep(void)
|
|
|
|
{
|
|
|
|
struct mm_struct *mm = mm_alloc();
|
|
|
|
struct ww_acquire_ctx ctx;
|
|
|
|
struct dma_resv obj;
|
|
|
|
struct address_space mapping;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
if (!mm)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
dma_resv_init(&obj);
|
|
|
|
address_space_init_once(&mapping);
|
|
|
|
|
|
|
|
mmap_read_lock(mm);
|
|
|
|
ww_acquire_init(&ctx, &reservation_ww_class);
|
|
|
|
ret = dma_resv_lock(&obj, &ctx);
|
|
|
|
if (ret == -EDEADLK)
|
|
|
|
dma_resv_lock_slow(&obj, &ctx);
|
|
|
|
fs_reclaim_acquire(GFP_KERNEL);
|
|
|
|
/* for unmap_mapping_range on trylocked buffer objects in shrinkers */
|
|
|
|
i_mmap_lock_write(&mapping);
|
|
|
|
i_mmap_unlock_write(&mapping);
|
|
|
|
#ifdef CONFIG_MMU_NOTIFIER
|
|
|
|
lock_map_acquire(&__mmu_notifier_invalidate_range_start_map);
|
|
|
|
__dma_fence_might_wait();
|
|
|
|
lock_map_release(&__mmu_notifier_invalidate_range_start_map);
|
|
|
|
#else
|
|
|
|
__dma_fence_might_wait();
|
|
|
|
#endif
|
|
|
|
fs_reclaim_release(GFP_KERNEL);
|
|
|
|
ww_mutex_unlock(&obj.lock);
|
|
|
|
ww_acquire_fini(&ctx);
|
|
|
|
mmap_read_unlock(mm);
|
|
|
|
|
|
|
|
mmput(mm);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
subsys_initcall(dma_resv_lockdep);
|
|
|
|
#endif
|