2017-04-04 03:26:24 +00:00
|
|
|
/*
|
|
|
|
* Copyright 2017 Red Hat
|
2017-08-25 17:52:22 +00:00
|
|
|
* Parts ported from amdgpu (fence wait code).
|
|
|
|
* Copyright 2016 Advanced Micro Devices, Inc.
|
2017-04-04 03:26:24 +00:00
|
|
|
*
|
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining a
|
|
|
|
* copy of this software and associated documentation files (the "Software"),
|
|
|
|
* to deal in the Software without restriction, including without limitation
|
|
|
|
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
|
|
|
|
* and/or sell copies of the Software, and to permit persons to whom the
|
|
|
|
* Software is furnished to do so, subject to the following conditions:
|
|
|
|
*
|
|
|
|
* The above copyright notice and this permission notice (including the next
|
|
|
|
* paragraph) shall be included in all copies or substantial portions of the
|
|
|
|
* Software.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
|
|
|
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
|
|
|
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
|
|
|
|
* IN THE SOFTWARE.
|
|
|
|
*
|
|
|
|
* Authors:
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
/**
|
|
|
|
* DOC: Overview
|
|
|
|
*
|
2019-08-12 14:22:11 +00:00
|
|
|
* DRM synchronisation objects (syncobj, see struct &drm_syncobj) provide a
|
|
|
|
* container for a synchronization primitive which can be used by userspace
|
|
|
|
* to explicitly synchronize GPU commands, can be shared between userspace
|
|
|
|
* processes, and can be shared between different DRM drivers.
|
|
|
|
* Their primary use-case is to implement Vulkan fences and semaphores.
|
|
|
|
* The syncobj userspace API provides ioctls for several operations:
|
2017-04-04 03:26:24 +00:00
|
|
|
*
|
2019-08-12 14:22:11 +00:00
|
|
|
* - Creation and destruction of syncobjs
|
|
|
|
* - Import and export of syncobjs to/from a syncobj file descriptor
|
|
|
|
* - Import and export a syncobj's underlying fence to/from a sync file
|
|
|
|
* - Reset a syncobj (set its fence to NULL)
|
|
|
|
* - Signal a syncobj (set a trivially signaled fence)
|
|
|
|
* - Wait for a syncobj's fence to appear and be signaled
|
2017-08-25 17:52:22 +00:00
|
|
|
*
|
2019-08-12 14:22:11 +00:00
|
|
|
* At it's core, a syncobj is simply a wrapper around a pointer to a struct
|
|
|
|
* &dma_fence which may be NULL.
|
|
|
|
* When a syncobj is first created, its pointer is either NULL or a pointer
|
|
|
|
* to an already signaled fence depending on whether the
|
|
|
|
* &DRM_SYNCOBJ_CREATE_SIGNALED flag is passed to
|
|
|
|
* &DRM_IOCTL_SYNCOBJ_CREATE.
|
|
|
|
* When GPU work which signals a syncobj is enqueued in a DRM driver,
|
|
|
|
* the syncobj fence is replaced with a fence which will be signaled by the
|
|
|
|
* completion of that work.
|
|
|
|
* When GPU work which waits on a syncobj is enqueued in a DRM driver, the
|
|
|
|
* driver retrieves syncobj's current fence at the time the work is enqueued
|
|
|
|
* waits on that fence before submitting the work to hardware.
|
|
|
|
* If the syncobj's fence is NULL, the enqueue operation is expected to fail.
|
|
|
|
* All manipulation of the syncobjs's fence happens in terms of the current
|
|
|
|
* fence at the time the ioctl is called by userspace regardless of whether
|
|
|
|
* that operation is an immediate host-side operation (signal or reset) or
|
|
|
|
* or an operation which is enqueued in some driver queue.
|
|
|
|
* &DRM_IOCTL_SYNCOBJ_RESET and &DRM_IOCTL_SYNCOBJ_SIGNAL can be used to
|
|
|
|
* manipulate a syncobj from the host by resetting its pointer to NULL or
|
|
|
|
* setting its pointer to a fence which is already signaled.
|
2017-04-04 03:26:24 +00:00
|
|
|
*
|
|
|
|
*
|
2019-08-12 14:22:11 +00:00
|
|
|
* Host-side wait on syncobjs
|
|
|
|
* --------------------------
|
|
|
|
*
|
|
|
|
* &DRM_IOCTL_SYNCOBJ_WAIT takes an array of syncobj handles and does a
|
|
|
|
* host-side wait on all of the syncobj fences simultaneously.
|
|
|
|
* If &DRM_SYNCOBJ_WAIT_FLAGS_WAIT_ALL is set, the wait ioctl will wait on
|
|
|
|
* all of the syncobj fences to be signaled before it returns.
|
|
|
|
* Otherwise, it returns once at least one syncobj fence has been signaled
|
|
|
|
* and the index of a signaled fence is written back to the client.
|
|
|
|
*
|
|
|
|
* Unlike the enqueued GPU work dependencies which fail if they see a NULL
|
|
|
|
* fence in a syncobj, if &DRM_SYNCOBJ_WAIT_FLAGS_WAIT_FOR_SUBMIT is set,
|
|
|
|
* the host-side wait will first wait for the syncobj to receive a non-NULL
|
|
|
|
* fence and then wait on that fence.
|
|
|
|
* If &DRM_SYNCOBJ_WAIT_FLAGS_WAIT_FOR_SUBMIT is not set and any one of the
|
|
|
|
* syncobjs in the array has a NULL fence, -EINVAL will be returned.
|
|
|
|
* Assuming the syncobj starts off with a NULL fence, this allows a client
|
|
|
|
* to do a host wait in one thread (or process) which waits on GPU work
|
|
|
|
* submitted in another thread (or process) without having to manually
|
|
|
|
* synchronize between the two.
|
|
|
|
* This requirement is inherited from the Vulkan fence API.
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* Import/export of syncobjs
|
|
|
|
* -------------------------
|
|
|
|
*
|
|
|
|
* &DRM_IOCTL_SYNCOBJ_FD_TO_HANDLE and &DRM_IOCTL_SYNCOBJ_HANDLE_TO_FD
|
|
|
|
* provide two mechanisms for import/export of syncobjs.
|
|
|
|
*
|
|
|
|
* The first lets the client import or export an entire syncobj to a file
|
|
|
|
* descriptor.
|
|
|
|
* These fd's are opaque and have no other use case, except passing the
|
|
|
|
* syncobj between processes.
|
|
|
|
* All exported file descriptors and any syncobj handles created as a
|
|
|
|
* result of importing those file descriptors own a reference to the
|
|
|
|
* same underlying struct &drm_syncobj and the syncobj can be used
|
|
|
|
* persistently across all the processes with which it is shared.
|
|
|
|
* The syncobj is freed only once the last reference is dropped.
|
|
|
|
* Unlike dma-buf, importing a syncobj creates a new handle (with its own
|
|
|
|
* reference) for every import instead of de-duplicating.
|
|
|
|
* The primary use-case of this persistent import/export is for shared
|
|
|
|
* Vulkan fences and semaphores.
|
|
|
|
*
|
|
|
|
* The second import/export mechanism, which is indicated by
|
|
|
|
* &DRM_SYNCOBJ_FD_TO_HANDLE_FLAGS_IMPORT_SYNC_FILE or
|
|
|
|
* &DRM_SYNCOBJ_HANDLE_TO_FD_FLAGS_EXPORT_SYNC_FILE lets the client
|
|
|
|
* import/export the syncobj's current fence from/to a &sync_file.
|
|
|
|
* When a syncobj is exported to a sync file, that sync file wraps the
|
|
|
|
* sycnobj's fence at the time of export and any later signal or reset
|
|
|
|
* operations on the syncobj will not affect the exported sync file.
|
|
|
|
* When a sync file is imported into a syncobj, the syncobj's fence is set
|
|
|
|
* to the fence wrapped by that sync file.
|
|
|
|
* Because sync files are immutable, resetting or signaling the syncobj
|
|
|
|
* will not affect any sync files whose fences have been imported into the
|
|
|
|
* syncobj.
|
2017-04-04 03:26:24 +00:00
|
|
|
*/
|
|
|
|
|
2019-05-26 17:35:35 +00:00
|
|
|
#include <linux/anon_inodes.h>
|
2017-04-04 03:26:24 +00:00
|
|
|
#include <linux/file.h>
|
|
|
|
#include <linux/fs.h>
|
2017-08-25 17:52:24 +00:00
|
|
|
#include <linux/sched/signal.h>
|
2019-05-26 17:35:35 +00:00
|
|
|
#include <linux/sync_file.h>
|
|
|
|
#include <linux/uaccess.h>
|
2017-04-04 03:26:24 +00:00
|
|
|
|
2019-07-18 16:15:05 +00:00
|
|
|
#include <drm/drm.h>
|
2019-05-26 17:35:35 +00:00
|
|
|
#include <drm/drm_drv.h>
|
|
|
|
#include <drm/drm_file.h>
|
|
|
|
#include <drm/drm_gem.h>
|
|
|
|
#include <drm/drm_print.h>
|
2017-04-04 03:26:24 +00:00
|
|
|
#include <drm/drm_syncobj.h>
|
|
|
|
|
2019-05-26 17:35:35 +00:00
|
|
|
#include "drm_internal.h"
|
|
|
|
|
2018-12-11 10:34:41 +00:00
|
|
|
struct syncobj_wait_entry {
|
|
|
|
struct list_head node;
|
|
|
|
struct task_struct *task;
|
|
|
|
struct dma_fence *fence;
|
|
|
|
struct dma_fence_cb fence_cb;
|
2019-04-01 09:50:57 +00:00
|
|
|
u64 point;
|
2018-12-11 10:34:41 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
static void syncobj_wait_syncobj_func(struct drm_syncobj *syncobj,
|
|
|
|
struct syncobj_wait_entry *wait);
|
|
|
|
|
2017-04-04 03:26:24 +00:00
|
|
|
/**
|
|
|
|
* drm_syncobj_find - lookup and reference a sync object.
|
|
|
|
* @file_private: drm file private pointer
|
|
|
|
* @handle: sync object handle to lookup.
|
|
|
|
*
|
2017-12-14 20:30:52 +00:00
|
|
|
* Returns a reference to the syncobj pointed to by handle or NULL. The
|
|
|
|
* reference must be released by calling drm_syncobj_put().
|
2017-04-04 03:26:24 +00:00
|
|
|
*/
|
|
|
|
struct drm_syncobj *drm_syncobj_find(struct drm_file *file_private,
|
|
|
|
u32 handle)
|
|
|
|
{
|
|
|
|
struct drm_syncobj *syncobj;
|
|
|
|
|
|
|
|
spin_lock(&file_private->syncobj_table_lock);
|
|
|
|
|
|
|
|
/* Check if we currently have a reference on the object */
|
|
|
|
syncobj = idr_find(&file_private->syncobj_idr, handle);
|
|
|
|
if (syncobj)
|
|
|
|
drm_syncobj_get(syncobj);
|
|
|
|
|
|
|
|
spin_unlock(&file_private->syncobj_table_lock);
|
|
|
|
|
|
|
|
return syncobj;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(drm_syncobj_find);
|
|
|
|
|
2018-12-11 10:34:41 +00:00
|
|
|
static void drm_syncobj_fence_add_wait(struct drm_syncobj *syncobj,
|
|
|
|
struct syncobj_wait_entry *wait)
|
2017-08-28 14:39:25 +00:00
|
|
|
{
|
2019-04-01 09:50:57 +00:00
|
|
|
struct dma_fence *fence;
|
|
|
|
|
2018-12-11 10:34:41 +00:00
|
|
|
if (wait->fence)
|
|
|
|
return;
|
2018-10-23 09:37:45 +00:00
|
|
|
|
2018-11-08 16:04:22 +00:00
|
|
|
spin_lock(&syncobj->lock);
|
|
|
|
/* We've already tried once to get a fence and failed. Now that we
|
|
|
|
* have the lock, try one more time just to be sure we don't add a
|
|
|
|
* callback when a fence has already been set.
|
|
|
|
*/
|
2019-04-01 09:50:57 +00:00
|
|
|
fence = dma_fence_get(rcu_dereference_protected(syncobj->fence, 1));
|
|
|
|
if (!fence || dma_fence_chain_find_seqno(&fence, wait->point)) {
|
|
|
|
dma_fence_put(fence);
|
2018-12-11 10:34:41 +00:00
|
|
|
list_add_tail(&wait->node, &syncobj->cb_list);
|
2019-04-01 09:50:57 +00:00
|
|
|
} else if (!fence) {
|
|
|
|
wait->fence = dma_fence_get_stub();
|
|
|
|
} else {
|
|
|
|
wait->fence = fence;
|
|
|
|
}
|
2018-11-08 16:04:22 +00:00
|
|
|
spin_unlock(&syncobj->lock);
|
drm: add syncobj timeline support v9
This patch is for VK_KHR_timeline_semaphore extension, semaphore is called syncobj in kernel side:
This extension introduces a new type of syncobj that has an integer payload
identifying a point in a timeline. Such timeline syncobjs support the
following operations:
* CPU query - A host operation that allows querying the payload of the
timeline syncobj.
* CPU wait - A host operation that allows a blocking wait for a
timeline syncobj to reach a specified value.
* Device wait - A device operation that allows waiting for a
timeline syncobj to reach a specified value.
* Device signal - A device operation that allows advancing the
timeline syncobj to a specified value.
v1:
Since it's a timeline, that means the front time point(PT) always is signaled before the late PT.
a. signal PT design:
Signal PT fence N depends on PT[N-1] fence and signal opertion fence, when PT[N] fence is signaled,
the timeline will increase to value of PT[N].
b. wait PT design:
Wait PT fence is signaled by reaching timeline point value, when timeline is increasing, will compare
wait PTs value with new timeline value, if PT value is lower than timeline value, then wait PT will be
signaled, otherwise keep in list. syncobj wait operation can wait on any point of timeline,
so need a RB tree to order them. And wait PT could ahead of signal PT, we need a sumission fence to
perform that.
v2:
1. remove unused DRM_SYNCOBJ_CREATE_TYPE_NORMAL. (Christian)
2. move unexposed denitions to .c file. (Daniel Vetter)
3. split up the change to drm_syncobj_find_fence() in a separate patch. (Christian)
4. split up the change to drm_syncobj_replace_fence() in a separate patch.
5. drop the submission_fence implementation and instead use wait_event() for that. (Christian)
6. WARN_ON(point != 0) for NORMAL type syncobj case. (Daniel Vetter)
v3:
1. replace normal syncobj with timeline implemenation. (Vetter and Christian)
a. normal syncobj signal op will create a signal PT to tail of signal pt list.
b. normal syncobj wait op will create a wait pt with last signal point, and this wait PT is only signaled by related signal point PT.
2. many bug fix and clean up
3. stub fence moving is moved to other patch.
v4:
1. fix RB tree loop with while(node=rb_first(...)). (Christian)
2. fix syncobj lifecycle. (Christian)
3. only enable_signaling when there is wait_pt. (Christian)
4. fix timeline path issues.
5. write a timeline test in libdrm
v5: (Christian)
1. semaphore is called syncobj in kernel side.
2. don't need 'timeline' characters in some function name.
3. keep syncobj cb.
v6: (Christian)
1. merge syncobj_timeline to syncobj structure.
2. simplify some check sentences.
3. some misc change.
4. fix CTS failed issue.
v7: (Christian)
1. error handling when creating signal pt.
2. remove timeline naming in func.
3. export flags in find_fence.
4. allow reset timeline.
v8:
1. use wait_event_interruptible without timeout
2. rename _TYPE_INDIVIDUAL to _TYPE_BINARY
v9:
1. rename signal_pt->base to signal_pt->fence_array to avoid misleading
2. improve kerneldoc
individual syncobj is tested by ./deqp-vk -n dEQP-VK*semaphore*
timeline syncobj is tested by ./amdgpu_test -s 9
Signed-off-by: Chunming Zhou <david1.zhou@amd.com>
Signed-off-by: Christian König <christian.koenig@amd.com>
Cc: Christian Konig <christian.koenig@amd.com>
Cc: Dave Airlie <airlied@redhat.com>
Cc: Daniel Rakos <Daniel.Rakos@amd.com>
Cc: Daniel Vetter <daniel@ffwll.ch>
Cc: Bas Nieuwenhuizen <bas@basnieuwenhuizen.nl>
Cc: Jason Ekstrand <jason@jlekstrand.net>
Reviewed-by: Christian König <christian.koenig@amd.com>
Acked-by: Daniel Vetter <daniel.vetter@ffwll.ch>
Link: https://patchwork.freedesktop.org/patch/257258/
2018-10-18 06:18:36 +00:00
|
|
|
}
|
|
|
|
|
2018-12-11 10:34:41 +00:00
|
|
|
static void drm_syncobj_remove_wait(struct drm_syncobj *syncobj,
|
|
|
|
struct syncobj_wait_entry *wait)
|
drm: add syncobj timeline support v9
This patch is for VK_KHR_timeline_semaphore extension, semaphore is called syncobj in kernel side:
This extension introduces a new type of syncobj that has an integer payload
identifying a point in a timeline. Such timeline syncobjs support the
following operations:
* CPU query - A host operation that allows querying the payload of the
timeline syncobj.
* CPU wait - A host operation that allows a blocking wait for a
timeline syncobj to reach a specified value.
* Device wait - A device operation that allows waiting for a
timeline syncobj to reach a specified value.
* Device signal - A device operation that allows advancing the
timeline syncobj to a specified value.
v1:
Since it's a timeline, that means the front time point(PT) always is signaled before the late PT.
a. signal PT design:
Signal PT fence N depends on PT[N-1] fence and signal opertion fence, when PT[N] fence is signaled,
the timeline will increase to value of PT[N].
b. wait PT design:
Wait PT fence is signaled by reaching timeline point value, when timeline is increasing, will compare
wait PTs value with new timeline value, if PT value is lower than timeline value, then wait PT will be
signaled, otherwise keep in list. syncobj wait operation can wait on any point of timeline,
so need a RB tree to order them. And wait PT could ahead of signal PT, we need a sumission fence to
perform that.
v2:
1. remove unused DRM_SYNCOBJ_CREATE_TYPE_NORMAL. (Christian)
2. move unexposed denitions to .c file. (Daniel Vetter)
3. split up the change to drm_syncobj_find_fence() in a separate patch. (Christian)
4. split up the change to drm_syncobj_replace_fence() in a separate patch.
5. drop the submission_fence implementation and instead use wait_event() for that. (Christian)
6. WARN_ON(point != 0) for NORMAL type syncobj case. (Daniel Vetter)
v3:
1. replace normal syncobj with timeline implemenation. (Vetter and Christian)
a. normal syncobj signal op will create a signal PT to tail of signal pt list.
b. normal syncobj wait op will create a wait pt with last signal point, and this wait PT is only signaled by related signal point PT.
2. many bug fix and clean up
3. stub fence moving is moved to other patch.
v4:
1. fix RB tree loop with while(node=rb_first(...)). (Christian)
2. fix syncobj lifecycle. (Christian)
3. only enable_signaling when there is wait_pt. (Christian)
4. fix timeline path issues.
5. write a timeline test in libdrm
v5: (Christian)
1. semaphore is called syncobj in kernel side.
2. don't need 'timeline' characters in some function name.
3. keep syncobj cb.
v6: (Christian)
1. merge syncobj_timeline to syncobj structure.
2. simplify some check sentences.
3. some misc change.
4. fix CTS failed issue.
v7: (Christian)
1. error handling when creating signal pt.
2. remove timeline naming in func.
3. export flags in find_fence.
4. allow reset timeline.
v8:
1. use wait_event_interruptible without timeout
2. rename _TYPE_INDIVIDUAL to _TYPE_BINARY
v9:
1. rename signal_pt->base to signal_pt->fence_array to avoid misleading
2. improve kerneldoc
individual syncobj is tested by ./deqp-vk -n dEQP-VK*semaphore*
timeline syncobj is tested by ./amdgpu_test -s 9
Signed-off-by: Chunming Zhou <david1.zhou@amd.com>
Signed-off-by: Christian König <christian.koenig@amd.com>
Cc: Christian Konig <christian.koenig@amd.com>
Cc: Dave Airlie <airlied@redhat.com>
Cc: Daniel Rakos <Daniel.Rakos@amd.com>
Cc: Daniel Vetter <daniel@ffwll.ch>
Cc: Bas Nieuwenhuizen <bas@basnieuwenhuizen.nl>
Cc: Jason Ekstrand <jason@jlekstrand.net>
Reviewed-by: Christian König <christian.koenig@amd.com>
Acked-by: Daniel Vetter <daniel.vetter@ffwll.ch>
Link: https://patchwork.freedesktop.org/patch/257258/
2018-10-18 06:18:36 +00:00
|
|
|
{
|
2018-12-11 10:34:41 +00:00
|
|
|
if (!wait->node.next)
|
|
|
|
return;
|
drm: add syncobj timeline support v9
This patch is for VK_KHR_timeline_semaphore extension, semaphore is called syncobj in kernel side:
This extension introduces a new type of syncobj that has an integer payload
identifying a point in a timeline. Such timeline syncobjs support the
following operations:
* CPU query - A host operation that allows querying the payload of the
timeline syncobj.
* CPU wait - A host operation that allows a blocking wait for a
timeline syncobj to reach a specified value.
* Device wait - A device operation that allows waiting for a
timeline syncobj to reach a specified value.
* Device signal - A device operation that allows advancing the
timeline syncobj to a specified value.
v1:
Since it's a timeline, that means the front time point(PT) always is signaled before the late PT.
a. signal PT design:
Signal PT fence N depends on PT[N-1] fence and signal opertion fence, when PT[N] fence is signaled,
the timeline will increase to value of PT[N].
b. wait PT design:
Wait PT fence is signaled by reaching timeline point value, when timeline is increasing, will compare
wait PTs value with new timeline value, if PT value is lower than timeline value, then wait PT will be
signaled, otherwise keep in list. syncobj wait operation can wait on any point of timeline,
so need a RB tree to order them. And wait PT could ahead of signal PT, we need a sumission fence to
perform that.
v2:
1. remove unused DRM_SYNCOBJ_CREATE_TYPE_NORMAL. (Christian)
2. move unexposed denitions to .c file. (Daniel Vetter)
3. split up the change to drm_syncobj_find_fence() in a separate patch. (Christian)
4. split up the change to drm_syncobj_replace_fence() in a separate patch.
5. drop the submission_fence implementation and instead use wait_event() for that. (Christian)
6. WARN_ON(point != 0) for NORMAL type syncobj case. (Daniel Vetter)
v3:
1. replace normal syncobj with timeline implemenation. (Vetter and Christian)
a. normal syncobj signal op will create a signal PT to tail of signal pt list.
b. normal syncobj wait op will create a wait pt with last signal point, and this wait PT is only signaled by related signal point PT.
2. many bug fix and clean up
3. stub fence moving is moved to other patch.
v4:
1. fix RB tree loop with while(node=rb_first(...)). (Christian)
2. fix syncobj lifecycle. (Christian)
3. only enable_signaling when there is wait_pt. (Christian)
4. fix timeline path issues.
5. write a timeline test in libdrm
v5: (Christian)
1. semaphore is called syncobj in kernel side.
2. don't need 'timeline' characters in some function name.
3. keep syncobj cb.
v6: (Christian)
1. merge syncobj_timeline to syncobj structure.
2. simplify some check sentences.
3. some misc change.
4. fix CTS failed issue.
v7: (Christian)
1. error handling when creating signal pt.
2. remove timeline naming in func.
3. export flags in find_fence.
4. allow reset timeline.
v8:
1. use wait_event_interruptible without timeout
2. rename _TYPE_INDIVIDUAL to _TYPE_BINARY
v9:
1. rename signal_pt->base to signal_pt->fence_array to avoid misleading
2. improve kerneldoc
individual syncobj is tested by ./deqp-vk -n dEQP-VK*semaphore*
timeline syncobj is tested by ./amdgpu_test -s 9
Signed-off-by: Chunming Zhou <david1.zhou@amd.com>
Signed-off-by: Christian König <christian.koenig@amd.com>
Cc: Christian Konig <christian.koenig@amd.com>
Cc: Dave Airlie <airlied@redhat.com>
Cc: Daniel Rakos <Daniel.Rakos@amd.com>
Cc: Daniel Vetter <daniel@ffwll.ch>
Cc: Bas Nieuwenhuizen <bas@basnieuwenhuizen.nl>
Cc: Jason Ekstrand <jason@jlekstrand.net>
Reviewed-by: Christian König <christian.koenig@amd.com>
Acked-by: Daniel Vetter <daniel.vetter@ffwll.ch>
Link: https://patchwork.freedesktop.org/patch/257258/
2018-10-18 06:18:36 +00:00
|
|
|
|
2018-11-08 16:04:22 +00:00
|
|
|
spin_lock(&syncobj->lock);
|
2018-12-11 10:34:41 +00:00
|
|
|
list_del_init(&wait->node);
|
2018-11-08 16:04:22 +00:00
|
|
|
spin_unlock(&syncobj->lock);
|
drm: add syncobj timeline support v9
This patch is for VK_KHR_timeline_semaphore extension, semaphore is called syncobj in kernel side:
This extension introduces a new type of syncobj that has an integer payload
identifying a point in a timeline. Such timeline syncobjs support the
following operations:
* CPU query - A host operation that allows querying the payload of the
timeline syncobj.
* CPU wait - A host operation that allows a blocking wait for a
timeline syncobj to reach a specified value.
* Device wait - A device operation that allows waiting for a
timeline syncobj to reach a specified value.
* Device signal - A device operation that allows advancing the
timeline syncobj to a specified value.
v1:
Since it's a timeline, that means the front time point(PT) always is signaled before the late PT.
a. signal PT design:
Signal PT fence N depends on PT[N-1] fence and signal opertion fence, when PT[N] fence is signaled,
the timeline will increase to value of PT[N].
b. wait PT design:
Wait PT fence is signaled by reaching timeline point value, when timeline is increasing, will compare
wait PTs value with new timeline value, if PT value is lower than timeline value, then wait PT will be
signaled, otherwise keep in list. syncobj wait operation can wait on any point of timeline,
so need a RB tree to order them. And wait PT could ahead of signal PT, we need a sumission fence to
perform that.
v2:
1. remove unused DRM_SYNCOBJ_CREATE_TYPE_NORMAL. (Christian)
2. move unexposed denitions to .c file. (Daniel Vetter)
3. split up the change to drm_syncobj_find_fence() in a separate patch. (Christian)
4. split up the change to drm_syncobj_replace_fence() in a separate patch.
5. drop the submission_fence implementation and instead use wait_event() for that. (Christian)
6. WARN_ON(point != 0) for NORMAL type syncobj case. (Daniel Vetter)
v3:
1. replace normal syncobj with timeline implemenation. (Vetter and Christian)
a. normal syncobj signal op will create a signal PT to tail of signal pt list.
b. normal syncobj wait op will create a wait pt with last signal point, and this wait PT is only signaled by related signal point PT.
2. many bug fix and clean up
3. stub fence moving is moved to other patch.
v4:
1. fix RB tree loop with while(node=rb_first(...)). (Christian)
2. fix syncobj lifecycle. (Christian)
3. only enable_signaling when there is wait_pt. (Christian)
4. fix timeline path issues.
5. write a timeline test in libdrm
v5: (Christian)
1. semaphore is called syncobj in kernel side.
2. don't need 'timeline' characters in some function name.
3. keep syncobj cb.
v6: (Christian)
1. merge syncobj_timeline to syncobj structure.
2. simplify some check sentences.
3. some misc change.
4. fix CTS failed issue.
v7: (Christian)
1. error handling when creating signal pt.
2. remove timeline naming in func.
3. export flags in find_fence.
4. allow reset timeline.
v8:
1. use wait_event_interruptible without timeout
2. rename _TYPE_INDIVIDUAL to _TYPE_BINARY
v9:
1. rename signal_pt->base to signal_pt->fence_array to avoid misleading
2. improve kerneldoc
individual syncobj is tested by ./deqp-vk -n dEQP-VK*semaphore*
timeline syncobj is tested by ./amdgpu_test -s 9
Signed-off-by: Chunming Zhou <david1.zhou@amd.com>
Signed-off-by: Christian König <christian.koenig@amd.com>
Cc: Christian Konig <christian.koenig@amd.com>
Cc: Dave Airlie <airlied@redhat.com>
Cc: Daniel Rakos <Daniel.Rakos@amd.com>
Cc: Daniel Vetter <daniel@ffwll.ch>
Cc: Bas Nieuwenhuizen <bas@basnieuwenhuizen.nl>
Cc: Jason Ekstrand <jason@jlekstrand.net>
Reviewed-by: Christian König <christian.koenig@amd.com>
Acked-by: Daniel Vetter <daniel.vetter@ffwll.ch>
Link: https://patchwork.freedesktop.org/patch/257258/
2018-10-18 06:18:36 +00:00
|
|
|
}
|
|
|
|
|
2019-04-01 09:50:56 +00:00
|
|
|
/**
|
|
|
|
* drm_syncobj_add_point - add new timeline point to the syncobj
|
|
|
|
* @syncobj: sync object to add timeline point do
|
|
|
|
* @chain: chain node to use to add the point
|
|
|
|
* @fence: fence to encapsulate in the chain node
|
|
|
|
* @point: sequence number to use for the point
|
|
|
|
*
|
|
|
|
* Add the chain node as new timeline point to the syncobj.
|
|
|
|
*/
|
|
|
|
void drm_syncobj_add_point(struct drm_syncobj *syncobj,
|
|
|
|
struct dma_fence_chain *chain,
|
|
|
|
struct dma_fence *fence,
|
|
|
|
uint64_t point)
|
|
|
|
{
|
|
|
|
struct syncobj_wait_entry *cur, *tmp;
|
|
|
|
struct dma_fence *prev;
|
|
|
|
|
|
|
|
dma_fence_get(fence);
|
|
|
|
|
|
|
|
spin_lock(&syncobj->lock);
|
|
|
|
|
|
|
|
prev = drm_syncobj_fence_get(syncobj);
|
|
|
|
/* You are adding an unorder point to timeline, which could cause payload returned from query_ioctl is 0! */
|
|
|
|
if (prev && prev->seqno >= point)
|
|
|
|
DRM_ERROR("You are adding an unorder point to timeline!\n");
|
|
|
|
dma_fence_chain_init(chain, prev, fence, point);
|
|
|
|
rcu_assign_pointer(syncobj->fence, &chain->base);
|
|
|
|
|
2019-04-01 09:50:57 +00:00
|
|
|
list_for_each_entry_safe(cur, tmp, &syncobj->cb_list, node)
|
2019-04-01 09:50:56 +00:00
|
|
|
syncobj_wait_syncobj_func(syncobj, cur);
|
|
|
|
spin_unlock(&syncobj->lock);
|
|
|
|
|
|
|
|
/* Walk the chain once to trigger garbage collection */
|
|
|
|
dma_fence_chain_for_each(fence, prev);
|
|
|
|
dma_fence_put(prev);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(drm_syncobj_add_point);
|
|
|
|
|
2017-04-04 03:26:24 +00:00
|
|
|
/**
|
|
|
|
* drm_syncobj_replace_fence - replace fence in a sync object.
|
|
|
|
* @syncobj: Sync object to replace fence in
|
|
|
|
* @fence: fence to install in sync file.
|
|
|
|
*
|
2018-11-14 13:24:27 +00:00
|
|
|
* This replaces the fence on a sync object.
|
2017-04-04 03:26:24 +00:00
|
|
|
*/
|
2017-07-05 20:12:44 +00:00
|
|
|
void drm_syncobj_replace_fence(struct drm_syncobj *syncobj,
|
2017-04-04 03:26:24 +00:00
|
|
|
struct dma_fence *fence)
|
|
|
|
{
|
2018-11-08 16:04:22 +00:00
|
|
|
struct dma_fence *old_fence;
|
2018-12-11 10:34:41 +00:00
|
|
|
struct syncobj_wait_entry *cur, *tmp;
|
2018-11-08 16:04:22 +00:00
|
|
|
|
|
|
|
if (fence)
|
|
|
|
dma_fence_get(fence);
|
|
|
|
|
|
|
|
spin_lock(&syncobj->lock);
|
|
|
|
|
|
|
|
old_fence = rcu_dereference_protected(syncobj->fence,
|
|
|
|
lockdep_is_held(&syncobj->lock));
|
|
|
|
rcu_assign_pointer(syncobj->fence, fence);
|
2017-08-28 14:39:25 +00:00
|
|
|
|
2018-11-08 16:04:22 +00:00
|
|
|
if (fence != old_fence) {
|
2019-04-01 09:50:57 +00:00
|
|
|
list_for_each_entry_safe(cur, tmp, &syncobj->cb_list, node)
|
2018-12-11 10:34:41 +00:00
|
|
|
syncobj_wait_syncobj_func(syncobj, cur);
|
2017-08-28 14:39:25 +00:00
|
|
|
}
|
2018-11-08 16:04:22 +00:00
|
|
|
|
|
|
|
spin_unlock(&syncobj->lock);
|
|
|
|
|
|
|
|
dma_fence_put(old_fence);
|
2017-04-04 03:26:24 +00:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(drm_syncobj_replace_fence);
|
|
|
|
|
2018-11-13 13:14:00 +00:00
|
|
|
/**
|
|
|
|
* drm_syncobj_assign_null_handle - assign a stub fence to the sync object
|
|
|
|
* @syncobj: sync object to assign the fence on
|
|
|
|
*
|
|
|
|
* Assign a already signaled stub fence to the sync object.
|
|
|
|
*/
|
|
|
|
static void drm_syncobj_assign_null_handle(struct drm_syncobj *syncobj)
|
2017-08-25 17:52:25 +00:00
|
|
|
{
|
2018-11-13 13:14:00 +00:00
|
|
|
struct dma_fence *fence = dma_fence_get_stub();
|
2017-08-25 17:52:25 +00:00
|
|
|
|
2018-11-14 13:24:27 +00:00
|
|
|
drm_syncobj_replace_fence(syncobj, fence);
|
2018-11-13 13:14:00 +00:00
|
|
|
dma_fence_put(fence);
|
2017-08-25 17:52:25 +00:00
|
|
|
}
|
|
|
|
|
2019-04-01 09:50:59 +00:00
|
|
|
/* 5s default for wait submission */
|
|
|
|
#define DRM_SYNCOBJ_WAIT_FOR_SUBMIT_TIMEOUT 5000000000ULL
|
2017-12-14 20:30:52 +00:00
|
|
|
/**
|
|
|
|
* drm_syncobj_find_fence - lookup and reference the fence in a sync object
|
|
|
|
* @file_private: drm file private pointer
|
|
|
|
* @handle: sync object handle to lookup.
|
2018-08-30 06:48:29 +00:00
|
|
|
* @point: timeline point
|
2018-10-17 07:03:18 +00:00
|
|
|
* @flags: DRM_SYNCOBJ_WAIT_FLAGS_WAIT_FOR_SUBMIT or not
|
2017-12-14 20:30:52 +00:00
|
|
|
* @fence: out parameter for the fence
|
|
|
|
*
|
|
|
|
* This is just a convenience function that combines drm_syncobj_find() and
|
2018-11-08 16:04:22 +00:00
|
|
|
* drm_syncobj_fence_get().
|
2017-12-14 20:30:52 +00:00
|
|
|
*
|
|
|
|
* Returns 0 on success or a negative error value on failure. On success @fence
|
|
|
|
* contains a reference to the fence, which must be released by calling
|
|
|
|
* dma_fence_put().
|
|
|
|
*/
|
2017-08-25 17:52:19 +00:00
|
|
|
int drm_syncobj_find_fence(struct drm_file *file_private,
|
2018-10-15 08:55:47 +00:00
|
|
|
u32 handle, u64 point, u64 flags,
|
2017-08-25 17:52:19 +00:00
|
|
|
struct dma_fence **fence)
|
2017-04-04 03:26:24 +00:00
|
|
|
{
|
|
|
|
struct drm_syncobj *syncobj = drm_syncobj_find(file_private, handle);
|
2019-04-01 09:50:59 +00:00
|
|
|
struct syncobj_wait_entry wait;
|
|
|
|
u64 timeout = nsecs_to_jiffies64(DRM_SYNCOBJ_WAIT_FOR_SUBMIT_TIMEOUT);
|
|
|
|
int ret;
|
2017-04-04 03:26:24 +00:00
|
|
|
|
2018-11-08 16:04:22 +00:00
|
|
|
if (!syncobj)
|
|
|
|
return -ENOENT;
|
|
|
|
|
|
|
|
*fence = drm_syncobj_fence_get(syncobj);
|
2019-04-01 09:50:59 +00:00
|
|
|
drm_syncobj_put(syncobj);
|
|
|
|
|
|
|
|
if (*fence) {
|
|
|
|
ret = dma_fence_chain_find_seqno(fence, point);
|
|
|
|
if (!ret)
|
|
|
|
return 0;
|
|
|
|
dma_fence_put(*fence);
|
|
|
|
} else {
|
2018-11-08 16:04:22 +00:00
|
|
|
ret = -EINVAL;
|
|
|
|
}
|
2019-04-01 09:50:59 +00:00
|
|
|
|
|
|
|
if (!(flags & DRM_SYNCOBJ_WAIT_FLAGS_WAIT_FOR_SUBMIT))
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
memset(&wait, 0, sizeof(wait));
|
|
|
|
wait.task = current;
|
|
|
|
wait.point = point;
|
|
|
|
drm_syncobj_fence_add_wait(syncobj, &wait);
|
|
|
|
|
|
|
|
do {
|
|
|
|
set_current_state(TASK_INTERRUPTIBLE);
|
|
|
|
if (wait.fence) {
|
|
|
|
ret = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (timeout == 0) {
|
|
|
|
ret = -ETIME;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (signal_pending(current)) {
|
|
|
|
ret = -ERESTARTSYS;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
timeout = schedule_timeout(timeout);
|
|
|
|
} while (1);
|
|
|
|
|
|
|
|
__set_current_state(TASK_RUNNING);
|
|
|
|
*fence = wait.fence;
|
|
|
|
|
|
|
|
if (wait.node.next)
|
|
|
|
drm_syncobj_remove_wait(syncobj, &wait);
|
|
|
|
|
2017-04-04 03:26:24 +00:00
|
|
|
return ret;
|
|
|
|
}
|
2017-08-25 17:52:19 +00:00
|
|
|
EXPORT_SYMBOL(drm_syncobj_find_fence);
|
2017-04-04 03:26:24 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* drm_syncobj_free - free a sync object.
|
|
|
|
* @kref: kref to free.
|
|
|
|
*
|
|
|
|
* Only to be called from kref_put in drm_syncobj_put.
|
|
|
|
*/
|
|
|
|
void drm_syncobj_free(struct kref *kref)
|
|
|
|
{
|
|
|
|
struct drm_syncobj *syncobj = container_of(kref,
|
|
|
|
struct drm_syncobj,
|
|
|
|
refcount);
|
2018-11-14 13:24:27 +00:00
|
|
|
drm_syncobj_replace_fence(syncobj, NULL);
|
2017-04-04 03:26:24 +00:00
|
|
|
kfree(syncobj);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(drm_syncobj_free);
|
|
|
|
|
2017-09-12 20:42:12 +00:00
|
|
|
/**
|
|
|
|
* drm_syncobj_create - create a new syncobj
|
|
|
|
* @out_syncobj: returned syncobj
|
|
|
|
* @flags: DRM_SYNCOBJ_* flags
|
|
|
|
* @fence: if non-NULL, the syncobj will represent this fence
|
2017-12-14 20:30:52 +00:00
|
|
|
*
|
|
|
|
* This is the first function to create a sync object. After creating, drivers
|
|
|
|
* probably want to make it available to userspace, either through
|
|
|
|
* drm_syncobj_get_handle() or drm_syncobj_get_fd().
|
|
|
|
*
|
|
|
|
* Returns 0 on success or a negative error value on failure.
|
2017-09-12 20:42:12 +00:00
|
|
|
*/
|
|
|
|
int drm_syncobj_create(struct drm_syncobj **out_syncobj, uint32_t flags,
|
|
|
|
struct dma_fence *fence)
|
2017-04-04 03:26:24 +00:00
|
|
|
{
|
|
|
|
struct drm_syncobj *syncobj;
|
|
|
|
|
|
|
|
syncobj = kzalloc(sizeof(struct drm_syncobj), GFP_KERNEL);
|
|
|
|
if (!syncobj)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
kref_init(&syncobj->refcount);
|
2017-08-28 14:39:25 +00:00
|
|
|
INIT_LIST_HEAD(&syncobj->cb_list);
|
2018-11-08 16:04:22 +00:00
|
|
|
spin_lock_init(&syncobj->lock);
|
2017-04-04 03:26:24 +00:00
|
|
|
|
2018-11-13 13:14:00 +00:00
|
|
|
if (flags & DRM_SYNCOBJ_CREATE_SIGNALED)
|
|
|
|
drm_syncobj_assign_null_handle(syncobj);
|
2017-08-25 17:52:25 +00:00
|
|
|
|
2017-09-12 20:42:12 +00:00
|
|
|
if (fence)
|
2018-11-14 13:24:27 +00:00
|
|
|
drm_syncobj_replace_fence(syncobj, fence);
|
2017-09-12 20:42:12 +00:00
|
|
|
|
|
|
|
*out_syncobj = syncobj;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(drm_syncobj_create);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* drm_syncobj_get_handle - get a handle from a syncobj
|
2017-12-14 20:30:52 +00:00
|
|
|
* @file_private: drm file private pointer
|
|
|
|
* @syncobj: Sync object to export
|
|
|
|
* @handle: out parameter with the new handle
|
|
|
|
*
|
|
|
|
* Exports a sync object created with drm_syncobj_create() as a handle on
|
|
|
|
* @file_private to userspace.
|
|
|
|
*
|
|
|
|
* Returns 0 on success or a negative error value on failure.
|
2017-09-12 20:42:12 +00:00
|
|
|
*/
|
|
|
|
int drm_syncobj_get_handle(struct drm_file *file_private,
|
|
|
|
struct drm_syncobj *syncobj, u32 *handle)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
/* take a reference to put in the idr */
|
|
|
|
drm_syncobj_get(syncobj);
|
|
|
|
|
2017-04-04 03:26:24 +00:00
|
|
|
idr_preload(GFP_KERNEL);
|
|
|
|
spin_lock(&file_private->syncobj_table_lock);
|
|
|
|
ret = idr_alloc(&file_private->syncobj_idr, syncobj, 1, 0, GFP_NOWAIT);
|
|
|
|
spin_unlock(&file_private->syncobj_table_lock);
|
|
|
|
|
|
|
|
idr_preload_end();
|
|
|
|
|
|
|
|
if (ret < 0) {
|
|
|
|
drm_syncobj_put(syncobj);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
*handle = ret;
|
|
|
|
return 0;
|
|
|
|
}
|
2017-09-12 20:42:12 +00:00
|
|
|
EXPORT_SYMBOL(drm_syncobj_get_handle);
|
|
|
|
|
|
|
|
static int drm_syncobj_create_as_handle(struct drm_file *file_private,
|
|
|
|
u32 *handle, uint32_t flags)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
struct drm_syncobj *syncobj;
|
|
|
|
|
|
|
|
ret = drm_syncobj_create(&syncobj, flags, NULL);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
ret = drm_syncobj_get_handle(file_private, syncobj, handle);
|
|
|
|
drm_syncobj_put(syncobj);
|
|
|
|
return ret;
|
|
|
|
}
|
2017-04-04 03:26:24 +00:00
|
|
|
|
|
|
|
static int drm_syncobj_destroy(struct drm_file *file_private,
|
|
|
|
u32 handle)
|
|
|
|
{
|
|
|
|
struct drm_syncobj *syncobj;
|
|
|
|
|
|
|
|
spin_lock(&file_private->syncobj_table_lock);
|
|
|
|
syncobj = idr_remove(&file_private->syncobj_idr, handle);
|
|
|
|
spin_unlock(&file_private->syncobj_table_lock);
|
|
|
|
|
|
|
|
if (!syncobj)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
drm_syncobj_put(syncobj);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int drm_syncobj_file_release(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
struct drm_syncobj *syncobj = file->private_data;
|
|
|
|
|
|
|
|
drm_syncobj_put(syncobj);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static const struct file_operations drm_syncobj_file_fops = {
|
|
|
|
.release = drm_syncobj_file_release,
|
|
|
|
};
|
|
|
|
|
2017-12-14 20:30:52 +00:00
|
|
|
/**
|
|
|
|
* drm_syncobj_get_fd - get a file descriptor from a syncobj
|
|
|
|
* @syncobj: Sync object to export
|
|
|
|
* @p_fd: out parameter with the new file descriptor
|
|
|
|
*
|
|
|
|
* Exports a sync object created with drm_syncobj_create() as a file descriptor.
|
|
|
|
*
|
|
|
|
* Returns 0 on success or a negative error value on failure.
|
|
|
|
*/
|
2017-09-12 20:42:13 +00:00
|
|
|
int drm_syncobj_get_fd(struct drm_syncobj *syncobj, int *p_fd)
|
2017-04-04 03:26:24 +00:00
|
|
|
{
|
2017-12-19 12:07:00 +00:00
|
|
|
struct file *file;
|
2017-04-04 03:26:24 +00:00
|
|
|
int fd;
|
|
|
|
|
|
|
|
fd = get_unused_fd_flags(O_CLOEXEC);
|
2017-09-12 20:42:13 +00:00
|
|
|
if (fd < 0)
|
2017-04-04 03:26:24 +00:00
|
|
|
return fd;
|
|
|
|
|
2017-12-19 12:07:00 +00:00
|
|
|
file = anon_inode_getfile("syncobj_file",
|
|
|
|
&drm_syncobj_file_fops,
|
|
|
|
syncobj, 0);
|
|
|
|
if (IS_ERR(file)) {
|
|
|
|
put_unused_fd(fd);
|
|
|
|
return PTR_ERR(file);
|
2017-04-04 03:26:24 +00:00
|
|
|
}
|
2017-12-19 12:07:00 +00:00
|
|
|
|
|
|
|
drm_syncobj_get(syncobj);
|
|
|
|
fd_install(fd, file);
|
|
|
|
|
2017-04-04 03:26:24 +00:00
|
|
|
*p_fd = fd;
|
|
|
|
return 0;
|
2017-09-12 20:42:13 +00:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(drm_syncobj_get_fd);
|
|
|
|
|
|
|
|
static int drm_syncobj_handle_to_fd(struct drm_file *file_private,
|
|
|
|
u32 handle, int *p_fd)
|
|
|
|
{
|
|
|
|
struct drm_syncobj *syncobj = drm_syncobj_find(file_private, handle);
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
if (!syncobj)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
ret = drm_syncobj_get_fd(syncobj, p_fd);
|
2017-04-04 03:26:24 +00:00
|
|
|
drm_syncobj_put(syncobj);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int drm_syncobj_fd_to_handle(struct drm_file *file_private,
|
|
|
|
int fd, u32 *handle)
|
|
|
|
{
|
2017-12-19 12:07:00 +00:00
|
|
|
struct drm_syncobj *syncobj;
|
2019-04-14 16:50:52 +00:00
|
|
|
struct fd f = fdget(fd);
|
2017-04-04 03:26:24 +00:00
|
|
|
int ret;
|
|
|
|
|
2019-04-14 16:50:52 +00:00
|
|
|
if (!f.file)
|
2017-04-04 03:26:24 +00:00
|
|
|
return -EINVAL;
|
|
|
|
|
2019-04-14 16:50:52 +00:00
|
|
|
if (f.file->f_op != &drm_syncobj_file_fops) {
|
|
|
|
fdput(f);
|
2017-12-19 12:07:00 +00:00
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
2017-04-04 03:26:24 +00:00
|
|
|
/* take a reference to put in the idr */
|
2019-04-14 16:50:52 +00:00
|
|
|
syncobj = f.file->private_data;
|
2017-04-04 03:26:24 +00:00
|
|
|
drm_syncobj_get(syncobj);
|
|
|
|
|
|
|
|
idr_preload(GFP_KERNEL);
|
|
|
|
spin_lock(&file_private->syncobj_table_lock);
|
|
|
|
ret = idr_alloc(&file_private->syncobj_idr, syncobj, 1, 0, GFP_NOWAIT);
|
|
|
|
spin_unlock(&file_private->syncobj_table_lock);
|
|
|
|
idr_preload_end();
|
|
|
|
|
2017-12-19 12:07:00 +00:00
|
|
|
if (ret > 0) {
|
|
|
|
*handle = ret;
|
|
|
|
ret = 0;
|
|
|
|
} else
|
|
|
|
drm_syncobj_put(syncobj);
|
|
|
|
|
2019-04-14 16:50:52 +00:00
|
|
|
fdput(f);
|
2017-12-19 12:07:00 +00:00
|
|
|
return ret;
|
2017-04-04 03:26:24 +00:00
|
|
|
}
|
|
|
|
|
2017-09-01 16:53:25 +00:00
|
|
|
static int drm_syncobj_import_sync_file_fence(struct drm_file *file_private,
|
|
|
|
int fd, int handle)
|
2017-04-26 03:09:02 +00:00
|
|
|
{
|
|
|
|
struct dma_fence *fence = sync_file_get_fence(fd);
|
|
|
|
struct drm_syncobj *syncobj;
|
|
|
|
|
|
|
|
if (!fence)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
syncobj = drm_syncobj_find(file_private, handle);
|
|
|
|
if (!syncobj) {
|
|
|
|
dma_fence_put(fence);
|
|
|
|
return -ENOENT;
|
|
|
|
}
|
|
|
|
|
2018-11-14 13:24:27 +00:00
|
|
|
drm_syncobj_replace_fence(syncobj, fence);
|
2017-04-26 03:09:02 +00:00
|
|
|
dma_fence_put(fence);
|
|
|
|
drm_syncobj_put(syncobj);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-09-01 16:53:25 +00:00
|
|
|
static int drm_syncobj_export_sync_file(struct drm_file *file_private,
|
|
|
|
int handle, int *p_fd)
|
2017-04-26 03:09:02 +00:00
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
struct dma_fence *fence;
|
|
|
|
struct sync_file *sync_file;
|
|
|
|
int fd = get_unused_fd_flags(O_CLOEXEC);
|
|
|
|
|
|
|
|
if (fd < 0)
|
|
|
|
return fd;
|
|
|
|
|
2018-10-15 08:55:47 +00:00
|
|
|
ret = drm_syncobj_find_fence(file_private, handle, 0, 0, &fence);
|
2017-04-26 03:09:02 +00:00
|
|
|
if (ret)
|
|
|
|
goto err_put_fd;
|
|
|
|
|
|
|
|
sync_file = sync_file_create(fence);
|
|
|
|
|
|
|
|
dma_fence_put(fence);
|
|
|
|
|
|
|
|
if (!sync_file) {
|
|
|
|
ret = -EINVAL;
|
|
|
|
goto err_put_fd;
|
|
|
|
}
|
|
|
|
|
|
|
|
fd_install(fd, sync_file->file);
|
|
|
|
|
|
|
|
*p_fd = fd;
|
|
|
|
return 0;
|
|
|
|
err_put_fd:
|
|
|
|
put_unused_fd(fd);
|
|
|
|
return ret;
|
|
|
|
}
|
2017-04-04 03:26:24 +00:00
|
|
|
/**
|
|
|
|
* drm_syncobj_open - initalizes syncobj file-private structures at devnode open time
|
|
|
|
* @file_private: drm file-private structure to set up
|
|
|
|
*
|
|
|
|
* Called at device open time, sets up the structure for handling refcounting
|
|
|
|
* of sync objects.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
drm_syncobj_open(struct drm_file *file_private)
|
|
|
|
{
|
2018-02-12 14:55:33 +00:00
|
|
|
idr_init_base(&file_private->syncobj_idr, 1);
|
2017-04-04 03:26:24 +00:00
|
|
|
spin_lock_init(&file_private->syncobj_table_lock);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
drm_syncobj_release_handle(int id, void *ptr, void *data)
|
|
|
|
{
|
|
|
|
struct drm_syncobj *syncobj = ptr;
|
|
|
|
|
|
|
|
drm_syncobj_put(syncobj);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* drm_syncobj_release - release file-private sync object resources
|
|
|
|
* @file_private: drm file-private structure to clean up
|
|
|
|
*
|
|
|
|
* Called at close time when the filp is going away.
|
|
|
|
*
|
|
|
|
* Releases any remaining references on objects by this filp.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
drm_syncobj_release(struct drm_file *file_private)
|
|
|
|
{
|
|
|
|
idr_for_each(&file_private->syncobj_idr,
|
|
|
|
&drm_syncobj_release_handle, file_private);
|
|
|
|
idr_destroy(&file_private->syncobj_idr);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
drm_syncobj_create_ioctl(struct drm_device *dev, void *data,
|
|
|
|
struct drm_file *file_private)
|
|
|
|
{
|
|
|
|
struct drm_syncobj_create *args = data;
|
|
|
|
|
|
|
|
if (!drm_core_check_feature(dev, DRIVER_SYNCOBJ))
|
2018-09-13 19:20:50 +00:00
|
|
|
return -EOPNOTSUPP;
|
2017-04-04 03:26:24 +00:00
|
|
|
|
|
|
|
/* no valid flags yet */
|
2018-11-08 16:04:22 +00:00
|
|
|
if (args->flags & ~DRM_SYNCOBJ_CREATE_SIGNALED)
|
2017-04-04 03:26:24 +00:00
|
|
|
return -EINVAL;
|
|
|
|
|
2017-09-12 20:42:12 +00:00
|
|
|
return drm_syncobj_create_as_handle(file_private,
|
|
|
|
&args->handle, args->flags);
|
2017-04-04 03:26:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
drm_syncobj_destroy_ioctl(struct drm_device *dev, void *data,
|
|
|
|
struct drm_file *file_private)
|
|
|
|
{
|
|
|
|
struct drm_syncobj_destroy *args = data;
|
|
|
|
|
|
|
|
if (!drm_core_check_feature(dev, DRIVER_SYNCOBJ))
|
2018-09-13 19:20:50 +00:00
|
|
|
return -EOPNOTSUPP;
|
2017-04-04 03:26:24 +00:00
|
|
|
|
|
|
|
/* make sure padding is empty */
|
|
|
|
if (args->pad)
|
|
|
|
return -EINVAL;
|
|
|
|
return drm_syncobj_destroy(file_private, args->handle);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
drm_syncobj_handle_to_fd_ioctl(struct drm_device *dev, void *data,
|
|
|
|
struct drm_file *file_private)
|
|
|
|
{
|
|
|
|
struct drm_syncobj_handle *args = data;
|
|
|
|
|
|
|
|
if (!drm_core_check_feature(dev, DRIVER_SYNCOBJ))
|
2018-09-13 19:20:50 +00:00
|
|
|
return -EOPNOTSUPP;
|
2017-04-04 03:26:24 +00:00
|
|
|
|
2017-04-26 03:09:02 +00:00
|
|
|
if (args->pad)
|
2017-04-04 03:26:24 +00:00
|
|
|
return -EINVAL;
|
|
|
|
|
2017-04-26 03:09:02 +00:00
|
|
|
if (args->flags != 0 &&
|
|
|
|
args->flags != DRM_SYNCOBJ_HANDLE_TO_FD_FLAGS_EXPORT_SYNC_FILE)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
if (args->flags & DRM_SYNCOBJ_HANDLE_TO_FD_FLAGS_EXPORT_SYNC_FILE)
|
|
|
|
return drm_syncobj_export_sync_file(file_private, args->handle,
|
|
|
|
&args->fd);
|
|
|
|
|
2017-04-04 03:26:24 +00:00
|
|
|
return drm_syncobj_handle_to_fd(file_private, args->handle,
|
|
|
|
&args->fd);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
drm_syncobj_fd_to_handle_ioctl(struct drm_device *dev, void *data,
|
|
|
|
struct drm_file *file_private)
|
|
|
|
{
|
|
|
|
struct drm_syncobj_handle *args = data;
|
|
|
|
|
|
|
|
if (!drm_core_check_feature(dev, DRIVER_SYNCOBJ))
|
2018-09-13 19:20:50 +00:00
|
|
|
return -EOPNOTSUPP;
|
2017-04-04 03:26:24 +00:00
|
|
|
|
2017-04-26 03:09:02 +00:00
|
|
|
if (args->pad)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
if (args->flags != 0 &&
|
|
|
|
args->flags != DRM_SYNCOBJ_FD_TO_HANDLE_FLAGS_IMPORT_SYNC_FILE)
|
2017-04-04 03:26:24 +00:00
|
|
|
return -EINVAL;
|
|
|
|
|
2017-04-26 03:09:02 +00:00
|
|
|
if (args->flags & DRM_SYNCOBJ_FD_TO_HANDLE_FLAGS_IMPORT_SYNC_FILE)
|
|
|
|
return drm_syncobj_import_sync_file_fence(file_private,
|
|
|
|
args->fd,
|
|
|
|
args->handle);
|
|
|
|
|
2017-04-04 03:26:24 +00:00
|
|
|
return drm_syncobj_fd_to_handle(file_private, args->fd,
|
|
|
|
&args->handle);
|
|
|
|
}
|
2017-08-25 17:52:22 +00:00
|
|
|
|
2019-04-01 09:51:01 +00:00
|
|
|
static int drm_syncobj_transfer_to_timeline(struct drm_file *file_private,
|
|
|
|
struct drm_syncobj_transfer *args)
|
|
|
|
{
|
|
|
|
struct drm_syncobj *timeline_syncobj = NULL;
|
|
|
|
struct dma_fence *fence;
|
|
|
|
struct dma_fence_chain *chain;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
timeline_syncobj = drm_syncobj_find(file_private, args->dst_handle);
|
|
|
|
if (!timeline_syncobj) {
|
|
|
|
return -ENOENT;
|
|
|
|
}
|
|
|
|
ret = drm_syncobj_find_fence(file_private, args->src_handle,
|
|
|
|
args->src_point, args->flags,
|
|
|
|
&fence);
|
|
|
|
if (ret)
|
|
|
|
goto err;
|
|
|
|
chain = kzalloc(sizeof(struct dma_fence_chain), GFP_KERNEL);
|
|
|
|
if (!chain) {
|
|
|
|
ret = -ENOMEM;
|
|
|
|
goto err1;
|
|
|
|
}
|
|
|
|
drm_syncobj_add_point(timeline_syncobj, chain, fence, args->dst_point);
|
|
|
|
err1:
|
|
|
|
dma_fence_put(fence);
|
|
|
|
err:
|
|
|
|
drm_syncobj_put(timeline_syncobj);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
drm_syncobj_transfer_to_binary(struct drm_file *file_private,
|
|
|
|
struct drm_syncobj_transfer *args)
|
|
|
|
{
|
|
|
|
struct drm_syncobj *binary_syncobj = NULL;
|
|
|
|
struct dma_fence *fence;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
binary_syncobj = drm_syncobj_find(file_private, args->dst_handle);
|
|
|
|
if (!binary_syncobj)
|
|
|
|
return -ENOENT;
|
|
|
|
ret = drm_syncobj_find_fence(file_private, args->src_handle,
|
|
|
|
args->src_point, args->flags, &fence);
|
|
|
|
if (ret)
|
|
|
|
goto err;
|
|
|
|
drm_syncobj_replace_fence(binary_syncobj, fence);
|
|
|
|
dma_fence_put(fence);
|
|
|
|
err:
|
|
|
|
drm_syncobj_put(binary_syncobj);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
int
|
|
|
|
drm_syncobj_transfer_ioctl(struct drm_device *dev, void *data,
|
|
|
|
struct drm_file *file_private)
|
|
|
|
{
|
|
|
|
struct drm_syncobj_transfer *args = data;
|
|
|
|
int ret;
|
|
|
|
|
2019-04-16 12:57:50 +00:00
|
|
|
if (!drm_core_check_feature(dev, DRIVER_SYNCOBJ_TIMELINE))
|
2019-04-16 12:30:47 +00:00
|
|
|
return -EOPNOTSUPP;
|
2019-04-01 09:51:01 +00:00
|
|
|
|
|
|
|
if (args->pad)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
if (args->dst_point)
|
|
|
|
ret = drm_syncobj_transfer_to_timeline(file_private, args);
|
|
|
|
else
|
|
|
|
ret = drm_syncobj_transfer_to_binary(file_private, args);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2017-08-25 17:52:24 +00:00
|
|
|
static void syncobj_wait_fence_func(struct dma_fence *fence,
|
|
|
|
struct dma_fence_cb *cb)
|
|
|
|
{
|
|
|
|
struct syncobj_wait_entry *wait =
|
|
|
|
container_of(cb, struct syncobj_wait_entry, fence_cb);
|
|
|
|
|
|
|
|
wake_up_process(wait->task);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void syncobj_wait_syncobj_func(struct drm_syncobj *syncobj,
|
2018-12-11 10:34:41 +00:00
|
|
|
struct syncobj_wait_entry *wait)
|
2017-08-25 17:52:24 +00:00
|
|
|
{
|
2019-04-01 09:50:57 +00:00
|
|
|
struct dma_fence *fence;
|
|
|
|
|
2018-11-08 16:04:22 +00:00
|
|
|
/* This happens inside the syncobj lock */
|
2019-04-01 09:50:57 +00:00
|
|
|
fence = rcu_dereference_protected(syncobj->fence,
|
|
|
|
lockdep_is_held(&syncobj->lock));
|
|
|
|
dma_fence_get(fence);
|
|
|
|
if (!fence || dma_fence_chain_find_seqno(&fence, wait->point)) {
|
|
|
|
dma_fence_put(fence);
|
|
|
|
return;
|
|
|
|
} else if (!fence) {
|
|
|
|
wait->fence = dma_fence_get_stub();
|
|
|
|
} else {
|
|
|
|
wait->fence = fence;
|
|
|
|
}
|
|
|
|
|
2017-08-25 17:52:24 +00:00
|
|
|
wake_up_process(wait->task);
|
2019-04-01 09:50:57 +00:00
|
|
|
list_del_init(&wait->node);
|
2017-08-25 17:52:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static signed long drm_syncobj_array_wait_timeout(struct drm_syncobj **syncobjs,
|
2019-04-01 09:50:57 +00:00
|
|
|
void __user *user_points,
|
2017-08-25 17:52:24 +00:00
|
|
|
uint32_t count,
|
|
|
|
uint32_t flags,
|
|
|
|
signed long timeout,
|
|
|
|
uint32_t *idx)
|
|
|
|
{
|
|
|
|
struct syncobj_wait_entry *entries;
|
|
|
|
struct dma_fence *fence;
|
2019-04-01 09:50:57 +00:00
|
|
|
uint64_t *points;
|
2017-08-25 17:52:24 +00:00
|
|
|
uint32_t signaled_count, i;
|
|
|
|
|
2019-04-01 09:50:57 +00:00
|
|
|
points = kmalloc_array(count, sizeof(*points), GFP_KERNEL);
|
|
|
|
if (points == NULL)
|
2017-08-25 17:52:24 +00:00
|
|
|
return -ENOMEM;
|
|
|
|
|
2019-04-01 09:50:57 +00:00
|
|
|
if (!user_points) {
|
|
|
|
memset(points, 0, count * sizeof(uint64_t));
|
|
|
|
|
|
|
|
} else if (copy_from_user(points, user_points,
|
|
|
|
sizeof(uint64_t) * count)) {
|
|
|
|
timeout = -EFAULT;
|
|
|
|
goto err_free_points;
|
|
|
|
}
|
|
|
|
|
|
|
|
entries = kcalloc(count, sizeof(*entries), GFP_KERNEL);
|
|
|
|
if (!entries) {
|
|
|
|
timeout = -ENOMEM;
|
|
|
|
goto err_free_points;
|
|
|
|
}
|
2017-08-25 17:52:24 +00:00
|
|
|
/* Walk the list of sync objects and initialize entries. We do
|
|
|
|
* this up-front so that we can properly return -EINVAL if there is
|
|
|
|
* a syncobj with a missing fence and then never have the chance of
|
|
|
|
* returning -EINVAL again.
|
|
|
|
*/
|
|
|
|
signaled_count = 0;
|
|
|
|
for (i = 0; i < count; ++i) {
|
2019-04-01 09:50:57 +00:00
|
|
|
struct dma_fence *fence;
|
|
|
|
|
2017-08-25 17:52:24 +00:00
|
|
|
entries[i].task = current;
|
2019-04-01 09:50:57 +00:00
|
|
|
entries[i].point = points[i];
|
|
|
|
fence = drm_syncobj_fence_get(syncobjs[i]);
|
|
|
|
if (!fence || dma_fence_chain_find_seqno(&fence, points[i])) {
|
|
|
|
dma_fence_put(fence);
|
2017-08-25 17:52:24 +00:00
|
|
|
if (flags & DRM_SYNCOBJ_WAIT_FLAGS_WAIT_FOR_SUBMIT) {
|
|
|
|
continue;
|
|
|
|
} else {
|
2018-09-20 20:05:30 +00:00
|
|
|
timeout = -EINVAL;
|
2017-08-25 17:52:24 +00:00
|
|
|
goto cleanup_entries;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-04-01 09:50:57 +00:00
|
|
|
if (fence)
|
|
|
|
entries[i].fence = fence;
|
|
|
|
else
|
|
|
|
entries[i].fence = dma_fence_get_stub();
|
|
|
|
|
|
|
|
if ((flags & DRM_SYNCOBJ_WAIT_FLAGS_WAIT_AVAILABLE) ||
|
|
|
|
dma_fence_is_signaled(entries[i].fence)) {
|
2017-08-25 17:52:24 +00:00
|
|
|
if (signaled_count == 0 && idx)
|
|
|
|
*idx = i;
|
|
|
|
signaled_count++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (signaled_count == count ||
|
|
|
|
(signaled_count > 0 &&
|
|
|
|
!(flags & DRM_SYNCOBJ_WAIT_FLAGS_WAIT_ALL)))
|
|
|
|
goto cleanup_entries;
|
|
|
|
|
|
|
|
/* There's a very annoying laxness in the dma_fence API here, in
|
|
|
|
* that backends are not required to automatically report when a
|
|
|
|
* fence is signaled prior to fence->ops->enable_signaling() being
|
|
|
|
* called. So here if we fail to match signaled_count, we need to
|
|
|
|
* fallthough and try a 0 timeout wait!
|
|
|
|
*/
|
|
|
|
|
|
|
|
if (flags & DRM_SYNCOBJ_WAIT_FLAGS_WAIT_FOR_SUBMIT) {
|
2018-12-11 10:34:41 +00:00
|
|
|
for (i = 0; i < count; ++i)
|
|
|
|
drm_syncobj_fence_add_wait(syncobjs[i], &entries[i]);
|
2017-08-25 17:52:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
do {
|
|
|
|
set_current_state(TASK_INTERRUPTIBLE);
|
|
|
|
|
|
|
|
signaled_count = 0;
|
|
|
|
for (i = 0; i < count; ++i) {
|
|
|
|
fence = entries[i].fence;
|
|
|
|
if (!fence)
|
|
|
|
continue;
|
|
|
|
|
2019-04-01 09:50:57 +00:00
|
|
|
if ((flags & DRM_SYNCOBJ_WAIT_FLAGS_WAIT_AVAILABLE) ||
|
|
|
|
dma_fence_is_signaled(fence) ||
|
2017-08-25 17:52:24 +00:00
|
|
|
(!entries[i].fence_cb.func &&
|
|
|
|
dma_fence_add_callback(fence,
|
|
|
|
&entries[i].fence_cb,
|
|
|
|
syncobj_wait_fence_func))) {
|
|
|
|
/* The fence has been signaled */
|
|
|
|
if (flags & DRM_SYNCOBJ_WAIT_FLAGS_WAIT_ALL) {
|
|
|
|
signaled_count++;
|
|
|
|
} else {
|
|
|
|
if (idx)
|
|
|
|
*idx = i;
|
|
|
|
goto done_waiting;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (signaled_count == count)
|
|
|
|
goto done_waiting;
|
|
|
|
|
|
|
|
if (timeout == 0) {
|
2018-09-20 20:05:30 +00:00
|
|
|
timeout = -ETIME;
|
2017-08-25 17:52:24 +00:00
|
|
|
goto done_waiting;
|
|
|
|
}
|
|
|
|
|
2018-09-20 20:05:30 +00:00
|
|
|
if (signal_pending(current)) {
|
|
|
|
timeout = -ERESTARTSYS;
|
|
|
|
goto done_waiting;
|
|
|
|
}
|
2017-08-25 17:52:24 +00:00
|
|
|
|
2018-09-20 20:05:30 +00:00
|
|
|
timeout = schedule_timeout(timeout);
|
|
|
|
} while (1);
|
2017-08-25 17:52:24 +00:00
|
|
|
|
|
|
|
done_waiting:
|
|
|
|
__set_current_state(TASK_RUNNING);
|
|
|
|
|
|
|
|
cleanup_entries:
|
|
|
|
for (i = 0; i < count; ++i) {
|
2018-12-11 10:34:41 +00:00
|
|
|
drm_syncobj_remove_wait(syncobjs[i], &entries[i]);
|
2017-08-25 17:52:24 +00:00
|
|
|
if (entries[i].fence_cb.func)
|
|
|
|
dma_fence_remove_callback(entries[i].fence,
|
|
|
|
&entries[i].fence_cb);
|
|
|
|
dma_fence_put(entries[i].fence);
|
|
|
|
}
|
|
|
|
kfree(entries);
|
|
|
|
|
2019-04-01 09:50:57 +00:00
|
|
|
err_free_points:
|
|
|
|
kfree(points);
|
|
|
|
|
2018-09-20 20:05:30 +00:00
|
|
|
return timeout;
|
2017-08-25 17:52:24 +00:00
|
|
|
}
|
|
|
|
|
2017-08-25 17:52:22 +00:00
|
|
|
/**
|
|
|
|
* drm_timeout_abs_to_jiffies - calculate jiffies timeout from absolute value
|
|
|
|
*
|
|
|
|
* @timeout_nsec: timeout nsec component in ns, 0 for poll
|
|
|
|
*
|
|
|
|
* Calculate the timeout in jiffies from an absolute time in sec/nsec.
|
|
|
|
*/
|
2019-02-25 14:07:16 +00:00
|
|
|
signed long drm_timeout_abs_to_jiffies(int64_t timeout_nsec)
|
2017-08-25 17:52:22 +00:00
|
|
|
{
|
|
|
|
ktime_t abs_timeout, now;
|
|
|
|
u64 timeout_ns, timeout_jiffies64;
|
|
|
|
|
|
|
|
/* make 0 timeout means poll - absolute 0 doesn't seem valid */
|
|
|
|
if (timeout_nsec == 0)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
abs_timeout = ns_to_ktime(timeout_nsec);
|
|
|
|
now = ktime_get();
|
|
|
|
|
|
|
|
if (!ktime_after(abs_timeout, now))
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
timeout_ns = ktime_to_ns(ktime_sub(abs_timeout, now));
|
|
|
|
|
|
|
|
timeout_jiffies64 = nsecs_to_jiffies64(timeout_ns);
|
|
|
|
/* clamp timeout to avoid infinite timeout */
|
|
|
|
if (timeout_jiffies64 >= MAX_SCHEDULE_TIMEOUT - 1)
|
|
|
|
return MAX_SCHEDULE_TIMEOUT - 1;
|
|
|
|
|
|
|
|
return timeout_jiffies64 + 1;
|
|
|
|
}
|
2019-02-25 14:07:16 +00:00
|
|
|
EXPORT_SYMBOL(drm_timeout_abs_to_jiffies);
|
2017-08-25 17:52:22 +00:00
|
|
|
|
2017-08-25 17:52:24 +00:00
|
|
|
static int drm_syncobj_array_wait(struct drm_device *dev,
|
|
|
|
struct drm_file *file_private,
|
|
|
|
struct drm_syncobj_wait *wait,
|
2019-04-01 09:50:57 +00:00
|
|
|
struct drm_syncobj_timeline_wait *timeline_wait,
|
|
|
|
struct drm_syncobj **syncobjs, bool timeline)
|
2017-08-25 17:52:22 +00:00
|
|
|
{
|
2019-04-01 09:50:57 +00:00
|
|
|
signed long timeout = 0;
|
2017-08-25 17:52:22 +00:00
|
|
|
uint32_t first = ~0;
|
|
|
|
|
2019-04-01 09:50:57 +00:00
|
|
|
if (!timeline) {
|
|
|
|
timeout = drm_timeout_abs_to_jiffies(wait->timeout_nsec);
|
|
|
|
timeout = drm_syncobj_array_wait_timeout(syncobjs,
|
|
|
|
NULL,
|
|
|
|
wait->count_handles,
|
|
|
|
wait->flags,
|
|
|
|
timeout, &first);
|
|
|
|
if (timeout < 0)
|
|
|
|
return timeout;
|
|
|
|
wait->first_signaled = first;
|
|
|
|
} else {
|
|
|
|
timeout = drm_timeout_abs_to_jiffies(timeline_wait->timeout_nsec);
|
|
|
|
timeout = drm_syncobj_array_wait_timeout(syncobjs,
|
|
|
|
u64_to_user_ptr(timeline_wait->points),
|
|
|
|
timeline_wait->count_handles,
|
|
|
|
timeline_wait->flags,
|
|
|
|
timeout, &first);
|
|
|
|
if (timeout < 0)
|
|
|
|
return timeout;
|
|
|
|
timeline_wait->first_signaled = first;
|
|
|
|
}
|
2017-08-25 17:52:22 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-08-25 17:52:26 +00:00
|
|
|
static int drm_syncobj_array_find(struct drm_file *file_private,
|
2017-09-01 16:53:26 +00:00
|
|
|
void __user *user_handles,
|
|
|
|
uint32_t count_handles,
|
2017-08-25 17:52:26 +00:00
|
|
|
struct drm_syncobj ***syncobjs_out)
|
2017-08-25 17:52:22 +00:00
|
|
|
{
|
2017-08-25 17:52:26 +00:00
|
|
|
uint32_t i, *handles;
|
2017-08-25 17:52:24 +00:00
|
|
|
struct drm_syncobj **syncobjs;
|
2017-08-25 17:52:26 +00:00
|
|
|
int ret;
|
2017-08-25 17:52:22 +00:00
|
|
|
|
2017-08-25 17:52:26 +00:00
|
|
|
handles = kmalloc_array(count_handles, sizeof(*handles), GFP_KERNEL);
|
2017-08-25 17:52:22 +00:00
|
|
|
if (handles == NULL)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
2017-08-25 17:52:26 +00:00
|
|
|
if (copy_from_user(handles, user_handles,
|
|
|
|
sizeof(uint32_t) * count_handles)) {
|
2017-08-25 17:52:22 +00:00
|
|
|
ret = -EFAULT;
|
|
|
|
goto err_free_handles;
|
|
|
|
}
|
|
|
|
|
2017-08-25 17:52:26 +00:00
|
|
|
syncobjs = kmalloc_array(count_handles, sizeof(*syncobjs), GFP_KERNEL);
|
|
|
|
if (syncobjs == NULL) {
|
2017-08-25 17:52:22 +00:00
|
|
|
ret = -ENOMEM;
|
|
|
|
goto err_free_handles;
|
|
|
|
}
|
|
|
|
|
2017-08-25 17:52:26 +00:00
|
|
|
for (i = 0; i < count_handles; i++) {
|
2017-08-25 17:52:24 +00:00
|
|
|
syncobjs[i] = drm_syncobj_find(file_private, handles[i]);
|
|
|
|
if (!syncobjs[i]) {
|
|
|
|
ret = -ENOENT;
|
2017-08-25 17:52:26 +00:00
|
|
|
goto err_put_syncobjs;
|
2017-08-25 17:52:24 +00:00
|
|
|
}
|
2017-08-25 17:52:22 +00:00
|
|
|
}
|
|
|
|
|
2017-08-25 17:52:26 +00:00
|
|
|
kfree(handles);
|
|
|
|
*syncobjs_out = syncobjs;
|
|
|
|
return 0;
|
2017-08-25 17:52:22 +00:00
|
|
|
|
2017-08-25 17:52:26 +00:00
|
|
|
err_put_syncobjs:
|
2017-08-25 17:52:24 +00:00
|
|
|
while (i-- > 0)
|
|
|
|
drm_syncobj_put(syncobjs[i]);
|
|
|
|
kfree(syncobjs);
|
2017-08-25 17:52:22 +00:00
|
|
|
err_free_handles:
|
|
|
|
kfree(handles);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
2017-08-25 17:52:26 +00:00
|
|
|
|
|
|
|
static void drm_syncobj_array_free(struct drm_syncobj **syncobjs,
|
|
|
|
uint32_t count)
|
|
|
|
{
|
|
|
|
uint32_t i;
|
|
|
|
for (i = 0; i < count; i++)
|
|
|
|
drm_syncobj_put(syncobjs[i]);
|
|
|
|
kfree(syncobjs);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
drm_syncobj_wait_ioctl(struct drm_device *dev, void *data,
|
|
|
|
struct drm_file *file_private)
|
|
|
|
{
|
|
|
|
struct drm_syncobj_wait *args = data;
|
|
|
|
struct drm_syncobj **syncobjs;
|
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
if (!drm_core_check_feature(dev, DRIVER_SYNCOBJ))
|
2018-09-13 19:20:50 +00:00
|
|
|
return -EOPNOTSUPP;
|
2017-08-25 17:52:26 +00:00
|
|
|
|
|
|
|
if (args->flags & ~(DRM_SYNCOBJ_WAIT_FLAGS_WAIT_ALL |
|
|
|
|
DRM_SYNCOBJ_WAIT_FLAGS_WAIT_FOR_SUBMIT))
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
if (args->count_handles == 0)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
ret = drm_syncobj_array_find(file_private,
|
|
|
|
u64_to_user_ptr(args->handles),
|
|
|
|
args->count_handles,
|
|
|
|
&syncobjs);
|
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
ret = drm_syncobj_array_wait(dev, file_private,
|
2019-04-01 09:50:57 +00:00
|
|
|
args, NULL, syncobjs, false);
|
2017-08-25 17:52:26 +00:00
|
|
|
|
|
|
|
drm_syncobj_array_free(syncobjs, args->count_handles);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
2017-08-28 21:10:27 +00:00
|
|
|
|
2019-04-01 09:50:57 +00:00
|
|
|
int
|
|
|
|
drm_syncobj_timeline_wait_ioctl(struct drm_device *dev, void *data,
|
|
|
|
struct drm_file *file_private)
|
|
|
|
{
|
|
|
|
struct drm_syncobj_timeline_wait *args = data;
|
|
|
|
struct drm_syncobj **syncobjs;
|
|
|
|
int ret = 0;
|
|
|
|
|
2019-04-16 12:57:50 +00:00
|
|
|
if (!drm_core_check_feature(dev, DRIVER_SYNCOBJ_TIMELINE))
|
2019-04-16 12:30:47 +00:00
|
|
|
return -EOPNOTSUPP;
|
2019-04-01 09:50:57 +00:00
|
|
|
|
|
|
|
if (args->flags & ~(DRM_SYNCOBJ_WAIT_FLAGS_WAIT_ALL |
|
|
|
|
DRM_SYNCOBJ_WAIT_FLAGS_WAIT_FOR_SUBMIT |
|
|
|
|
DRM_SYNCOBJ_WAIT_FLAGS_WAIT_AVAILABLE))
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
if (args->count_handles == 0)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
ret = drm_syncobj_array_find(file_private,
|
|
|
|
u64_to_user_ptr(args->handles),
|
|
|
|
args->count_handles,
|
|
|
|
&syncobjs);
|
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
ret = drm_syncobj_array_wait(dev, file_private,
|
|
|
|
NULL, args, syncobjs, true);
|
2017-08-25 17:52:26 +00:00
|
|
|
|
|
|
|
drm_syncobj_array_free(syncobjs, args->count_handles);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
2017-08-28 21:10:27 +00:00
|
|
|
|
2019-04-01 09:50:57 +00:00
|
|
|
|
2017-08-28 21:10:27 +00:00
|
|
|
int
|
|
|
|
drm_syncobj_reset_ioctl(struct drm_device *dev, void *data,
|
|
|
|
struct drm_file *file_private)
|
|
|
|
{
|
|
|
|
struct drm_syncobj_array *args = data;
|
|
|
|
struct drm_syncobj **syncobjs;
|
|
|
|
uint32_t i;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
if (!drm_core_check_feature(dev, DRIVER_SYNCOBJ))
|
2018-09-13 19:20:50 +00:00
|
|
|
return -EOPNOTSUPP;
|
2017-08-28 21:10:27 +00:00
|
|
|
|
|
|
|
if (args->pad != 0)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
if (args->count_handles == 0)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
ret = drm_syncobj_array_find(file_private,
|
|
|
|
u64_to_user_ptr(args->handles),
|
|
|
|
args->count_handles,
|
|
|
|
&syncobjs);
|
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
|
|
|
|
2018-11-08 16:04:22 +00:00
|
|
|
for (i = 0; i < args->count_handles; i++)
|
2018-11-14 13:24:27 +00:00
|
|
|
drm_syncobj_replace_fence(syncobjs[i], NULL);
|
2018-11-08 16:04:22 +00:00
|
|
|
|
2017-08-28 21:10:27 +00:00
|
|
|
drm_syncobj_array_free(syncobjs, args->count_handles);
|
|
|
|
|
2018-11-08 16:04:22 +00:00
|
|
|
return 0;
|
2017-08-28 21:10:27 +00:00
|
|
|
}
|
2017-08-28 21:10:28 +00:00
|
|
|
|
|
|
|
int
|
|
|
|
drm_syncobj_signal_ioctl(struct drm_device *dev, void *data,
|
|
|
|
struct drm_file *file_private)
|
|
|
|
{
|
|
|
|
struct drm_syncobj_array *args = data;
|
|
|
|
struct drm_syncobj **syncobjs;
|
|
|
|
uint32_t i;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
if (!drm_core_check_feature(dev, DRIVER_SYNCOBJ))
|
2018-09-13 19:20:50 +00:00
|
|
|
return -EOPNOTSUPP;
|
2017-08-28 21:10:28 +00:00
|
|
|
|
|
|
|
if (args->pad != 0)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
if (args->count_handles == 0)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
ret = drm_syncobj_array_find(file_private,
|
|
|
|
u64_to_user_ptr(args->handles),
|
|
|
|
args->count_handles,
|
|
|
|
&syncobjs);
|
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
|
|
|
|
2018-11-13 13:14:00 +00:00
|
|
|
for (i = 0; i < args->count_handles; i++)
|
|
|
|
drm_syncobj_assign_null_handle(syncobjs[i]);
|
2017-08-28 21:10:28 +00:00
|
|
|
|
|
|
|
drm_syncobj_array_free(syncobjs, args->count_handles);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
2019-04-01 09:50:58 +00:00
|
|
|
|
2019-04-01 09:51:02 +00:00
|
|
|
int
|
|
|
|
drm_syncobj_timeline_signal_ioctl(struct drm_device *dev, void *data,
|
|
|
|
struct drm_file *file_private)
|
|
|
|
{
|
|
|
|
struct drm_syncobj_timeline_array *args = data;
|
|
|
|
struct drm_syncobj **syncobjs;
|
|
|
|
struct dma_fence_chain **chains;
|
|
|
|
uint64_t *points;
|
|
|
|
uint32_t i, j;
|
|
|
|
int ret;
|
|
|
|
|
2019-04-16 12:57:50 +00:00
|
|
|
if (!drm_core_check_feature(dev, DRIVER_SYNCOBJ_TIMELINE))
|
2019-04-01 09:51:02 +00:00
|
|
|
return -EOPNOTSUPP;
|
|
|
|
|
|
|
|
if (args->pad != 0)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
if (args->count_handles == 0)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
ret = drm_syncobj_array_find(file_private,
|
|
|
|
u64_to_user_ptr(args->handles),
|
|
|
|
args->count_handles,
|
|
|
|
&syncobjs);
|
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
points = kmalloc_array(args->count_handles, sizeof(*points),
|
|
|
|
GFP_KERNEL);
|
|
|
|
if (!points) {
|
|
|
|
ret = -ENOMEM;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
if (!u64_to_user_ptr(args->points)) {
|
|
|
|
memset(points, 0, args->count_handles * sizeof(uint64_t));
|
|
|
|
} else if (copy_from_user(points, u64_to_user_ptr(args->points),
|
|
|
|
sizeof(uint64_t) * args->count_handles)) {
|
|
|
|
ret = -EFAULT;
|
|
|
|
goto err_points;
|
|
|
|
}
|
|
|
|
|
|
|
|
chains = kmalloc_array(args->count_handles, sizeof(void *), GFP_KERNEL);
|
|
|
|
if (!chains) {
|
|
|
|
ret = -ENOMEM;
|
|
|
|
goto err_points;
|
|
|
|
}
|
|
|
|
for (i = 0; i < args->count_handles; i++) {
|
|
|
|
chains[i] = kzalloc(sizeof(struct dma_fence_chain), GFP_KERNEL);
|
|
|
|
if (!chains[i]) {
|
|
|
|
for (j = 0; j < i; j++)
|
|
|
|
kfree(chains[j]);
|
|
|
|
ret = -ENOMEM;
|
|
|
|
goto err_chains;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < args->count_handles; i++) {
|
|
|
|
struct dma_fence *fence = dma_fence_get_stub();
|
|
|
|
|
|
|
|
drm_syncobj_add_point(syncobjs[i], chains[i],
|
|
|
|
fence, points[i]);
|
|
|
|
dma_fence_put(fence);
|
|
|
|
}
|
|
|
|
err_chains:
|
|
|
|
kfree(chains);
|
|
|
|
err_points:
|
|
|
|
kfree(points);
|
|
|
|
out:
|
|
|
|
drm_syncobj_array_free(syncobjs, args->count_handles);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2019-04-01 09:50:58 +00:00
|
|
|
int drm_syncobj_query_ioctl(struct drm_device *dev, void *data,
|
|
|
|
struct drm_file *file_private)
|
|
|
|
{
|
|
|
|
struct drm_syncobj_timeline_array *args = data;
|
|
|
|
struct drm_syncobj **syncobjs;
|
|
|
|
uint64_t __user *points = u64_to_user_ptr(args->points);
|
|
|
|
uint32_t i;
|
|
|
|
int ret;
|
|
|
|
|
2019-04-16 12:57:50 +00:00
|
|
|
if (!drm_core_check_feature(dev, DRIVER_SYNCOBJ_TIMELINE))
|
|
|
|
return -EOPNOTSUPP;
|
2019-04-01 09:50:58 +00:00
|
|
|
|
|
|
|
if (args->pad != 0)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
if (args->count_handles == 0)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
ret = drm_syncobj_array_find(file_private,
|
|
|
|
u64_to_user_ptr(args->handles),
|
|
|
|
args->count_handles,
|
|
|
|
&syncobjs);
|
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
for (i = 0; i < args->count_handles; i++) {
|
|
|
|
struct dma_fence_chain *chain;
|
|
|
|
struct dma_fence *fence;
|
|
|
|
uint64_t point;
|
|
|
|
|
|
|
|
fence = drm_syncobj_fence_get(syncobjs[i]);
|
|
|
|
chain = to_dma_fence_chain(fence);
|
|
|
|
if (chain) {
|
|
|
|
struct dma_fence *iter, *last_signaled = NULL;
|
|
|
|
|
|
|
|
dma_fence_chain_for_each(iter, fence) {
|
2019-07-22 12:56:25 +00:00
|
|
|
if (iter->context != fence->context) {
|
|
|
|
dma_fence_put(iter);
|
2019-04-01 09:50:58 +00:00
|
|
|
/* It is most likely that timeline has
|
|
|
|
* unorder points. */
|
|
|
|
break;
|
2019-07-22 12:56:25 +00:00
|
|
|
}
|
|
|
|
dma_fence_put(last_signaled);
|
|
|
|
last_signaled = dma_fence_get(iter);
|
2019-04-01 09:50:58 +00:00
|
|
|
}
|
|
|
|
point = dma_fence_is_signaled(last_signaled) ?
|
|
|
|
last_signaled->seqno :
|
|
|
|
to_dma_fence_chain(last_signaled)->prev_seqno;
|
|
|
|
dma_fence_put(last_signaled);
|
|
|
|
} else {
|
|
|
|
point = 0;
|
|
|
|
}
|
|
|
|
ret = copy_to_user(&points[i], &point, sizeof(uint64_t));
|
|
|
|
ret = ret ? -EFAULT : 0;
|
|
|
|
if (ret)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
drm_syncobj_array_free(syncobjs, args->count_handles);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|