2009-06-05 20:42:42 +08:00
|
|
|
/*
|
|
|
|
* Copyright 2009 Jerome Glisse.
|
|
|
|
* 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 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.
|
|
|
|
*
|
|
|
|
* The above copyright notice and this permission notice (including the
|
|
|
|
* next paragraph) shall be included in all copies or substantial portions
|
|
|
|
* of the Software.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
/*
|
|
|
|
* Authors:
|
|
|
|
* Jerome Glisse <glisse@freedesktop.org>
|
|
|
|
* Dave Airlie
|
|
|
|
*/
|
|
|
|
#include <linux/seq_file.h>
|
2011-07-27 07:09:06 +08:00
|
|
|
#include <linux/atomic.h>
|
2009-06-05 20:42:42 +08:00
|
|
|
#include <linux/wait.h>
|
|
|
|
#include <linux/list.h>
|
|
|
|
#include <linux/kref.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 16:04:11 +08:00
|
|
|
#include <linux/slab.h>
|
2009-06-05 20:42:42 +08:00
|
|
|
#include "drmP.h"
|
|
|
|
#include "drm.h"
|
|
|
|
#include "radeon_reg.h"
|
|
|
|
#include "radeon.h"
|
2010-11-23 09:47:49 +08:00
|
|
|
#include "radeon_trace.h"
|
2009-06-05 20:42:42 +08:00
|
|
|
|
2011-08-26 01:39:48 +08:00
|
|
|
static void radeon_fence_write(struct radeon_device *rdev, u32 seq, int ring)
|
2011-06-14 05:39:06 +08:00
|
|
|
{
|
|
|
|
if (rdev->wb.enabled) {
|
2011-11-21 04:45:34 +08:00
|
|
|
*rdev->fence_drv[ring].cpu_addr = cpu_to_le32(seq);
|
|
|
|
} else {
|
2011-08-26 01:39:48 +08:00
|
|
|
WREG32(rdev->fence_drv[ring].scratch_reg, seq);
|
2011-11-21 04:45:34 +08:00
|
|
|
}
|
2011-06-14 05:39:06 +08:00
|
|
|
}
|
|
|
|
|
2011-08-26 01:39:48 +08:00
|
|
|
static u32 radeon_fence_read(struct radeon_device *rdev, int ring)
|
2011-06-14 05:39:06 +08:00
|
|
|
{
|
2011-08-26 01:39:48 +08:00
|
|
|
u32 seq = 0;
|
2011-06-14 05:39:06 +08:00
|
|
|
|
|
|
|
if (rdev->wb.enabled) {
|
2011-11-21 04:45:34 +08:00
|
|
|
seq = le32_to_cpu(*rdev->fence_drv[ring].cpu_addr);
|
|
|
|
} else {
|
2011-08-26 01:39:48 +08:00
|
|
|
seq = RREG32(rdev->fence_drv[ring].scratch_reg);
|
2011-11-21 04:45:34 +08:00
|
|
|
}
|
2011-06-14 05:39:06 +08:00
|
|
|
return seq;
|
|
|
|
}
|
|
|
|
|
2012-05-08 20:24:01 +08:00
|
|
|
int radeon_fence_emit(struct radeon_device *rdev,
|
|
|
|
struct radeon_fence **fence,
|
|
|
|
int ring)
|
2009-06-05 20:42:42 +08:00
|
|
|
{
|
2012-05-09 21:34:47 +08:00
|
|
|
/* we are protected by the ring emission mutex */
|
2012-05-08 20:24:01 +08:00
|
|
|
*fence = kmalloc(sizeof(struct radeon_fence), GFP_KERNEL);
|
|
|
|
if ((*fence) == NULL) {
|
|
|
|
return -ENOMEM;
|
2009-06-05 20:42:42 +08:00
|
|
|
}
|
2012-05-08 20:24:01 +08:00
|
|
|
kref_init(&((*fence)->kref));
|
|
|
|
(*fence)->rdev = rdev;
|
2012-05-10 21:57:31 +08:00
|
|
|
(*fence)->seq = ++rdev->fence_drv[ring].sync_seq[ring];
|
2012-05-08 20:24:01 +08:00
|
|
|
(*fence)->ring = ring;
|
|
|
|
radeon_fence_ring_emit(rdev, ring, *fence);
|
|
|
|
trace_radeon_fence_emit(rdev->ddev, (*fence)->seq);
|
2009-06-05 20:42:42 +08:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-05-09 21:34:47 +08:00
|
|
|
void radeon_fence_process(struct radeon_device *rdev, int ring)
|
2009-06-05 20:42:42 +08:00
|
|
|
{
|
2012-05-09 21:34:46 +08:00
|
|
|
uint64_t seq, last_seq;
|
|
|
|
unsigned count_loop = 0;
|
2009-06-05 20:42:42 +08:00
|
|
|
bool wake = false;
|
|
|
|
|
2012-05-09 21:34:46 +08:00
|
|
|
/* Note there is a scenario here for an infinite loop but it's
|
|
|
|
* very unlikely to happen. For it to happen, the current polling
|
|
|
|
* process need to be interrupted by another process and another
|
|
|
|
* process needs to update the last_seq btw the atomic read and
|
|
|
|
* xchg of the current process.
|
|
|
|
*
|
|
|
|
* More over for this to go in infinite loop there need to be
|
|
|
|
* continuously new fence signaled ie radeon_fence_read needs
|
|
|
|
* to return a different value each time for both the currently
|
|
|
|
* polling process and the other process that xchg the last_seq
|
|
|
|
* btw atomic read and xchg of the current process. And the
|
|
|
|
* value the other process set as last seq must be higher than
|
|
|
|
* the seq value we just read. Which means that current process
|
|
|
|
* need to be interrupted after radeon_fence_read and before
|
|
|
|
* atomic xchg.
|
|
|
|
*
|
|
|
|
* To be even more safe we count the number of time we loop and
|
|
|
|
* we bail after 10 loop just accepting the fact that we might
|
|
|
|
* have temporarly set the last_seq not to the true real last
|
|
|
|
* seq but to an older one.
|
|
|
|
*/
|
|
|
|
last_seq = atomic64_read(&rdev->fence_drv[ring].last_seq);
|
|
|
|
do {
|
|
|
|
seq = radeon_fence_read(rdev, ring);
|
|
|
|
seq |= last_seq & 0xffffffff00000000LL;
|
|
|
|
if (seq < last_seq) {
|
|
|
|
seq += 0x100000000LL;
|
|
|
|
}
|
2012-05-02 21:11:13 +08:00
|
|
|
|
2012-05-09 21:34:47 +08:00
|
|
|
if (seq == last_seq) {
|
|
|
|
break;
|
2012-05-09 21:34:46 +08:00
|
|
|
}
|
|
|
|
/* If we loop over we don't want to return without
|
|
|
|
* checking if a fence is signaled as it means that the
|
|
|
|
* seq we just read is different from the previous on.
|
|
|
|
*/
|
|
|
|
wake = true;
|
2012-05-09 21:34:47 +08:00
|
|
|
last_seq = seq;
|
2012-05-09 21:34:46 +08:00
|
|
|
if ((count_loop++) > 10) {
|
|
|
|
/* We looped over too many time leave with the
|
|
|
|
* fact that we might have set an older fence
|
|
|
|
* seq then the current real last seq as signaled
|
|
|
|
* by the hw.
|
|
|
|
*/
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
} while (atomic64_xchg(&rdev->fence_drv[ring].last_seq, seq) > seq);
|
|
|
|
|
2012-05-09 21:34:47 +08:00
|
|
|
if (wake) {
|
|
|
|
rdev->fence_drv[ring].last_activity = jiffies;
|
2012-05-09 21:34:55 +08:00
|
|
|
wake_up_all(&rdev->fence_queue);
|
2009-06-05 20:42:42 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void radeon_fence_destroy(struct kref *kref)
|
|
|
|
{
|
2012-05-09 21:34:47 +08:00
|
|
|
struct radeon_fence *fence;
|
2009-06-05 20:42:42 +08:00
|
|
|
|
|
|
|
fence = container_of(kref, struct radeon_fence, kref);
|
|
|
|
kfree(fence);
|
|
|
|
}
|
|
|
|
|
2012-05-09 21:34:47 +08:00
|
|
|
static bool radeon_fence_seq_signaled(struct radeon_device *rdev,
|
|
|
|
u64 seq, unsigned ring)
|
2009-06-05 20:42:42 +08:00
|
|
|
{
|
2012-05-09 21:34:47 +08:00
|
|
|
if (atomic64_read(&rdev->fence_drv[ring].last_seq) >= seq) {
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
/* poll new last sequence at least once */
|
|
|
|
radeon_fence_process(rdev, ring);
|
|
|
|
if (atomic64_read(&rdev->fence_drv[ring].last_seq) >= seq) {
|
2009-06-05 20:42:42 +08:00
|
|
|
return true;
|
2012-05-09 21:34:47 +08:00
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
2009-12-30 09:20:05 +08:00
|
|
|
|
2012-05-09 21:34:47 +08:00
|
|
|
bool radeon_fence_signaled(struct radeon_fence *fence)
|
|
|
|
{
|
|
|
|
if (!fence) {
|
|
|
|
return true;
|
2009-06-05 20:42:42 +08:00
|
|
|
}
|
2012-05-09 21:34:47 +08:00
|
|
|
if (fence->seq == RADEON_FENCE_SIGNALED_SEQ) {
|
|
|
|
return true;
|
2009-06-05 20:42:42 +08:00
|
|
|
}
|
2012-05-09 21:34:47 +08:00
|
|
|
if (radeon_fence_seq_signaled(fence->rdev, fence->seq, fence->ring)) {
|
|
|
|
fence->seq = RADEON_FENCE_SIGNALED_SEQ;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
2009-06-05 20:42:42 +08:00
|
|
|
}
|
|
|
|
|
2012-05-09 21:34:47 +08:00
|
|
|
static int radeon_fence_wait_seq(struct radeon_device *rdev, u64 target_seq,
|
2012-05-09 21:34:48 +08:00
|
|
|
unsigned ring, bool intr, bool lock_ring)
|
2009-06-05 20:42:42 +08:00
|
|
|
{
|
2012-05-09 21:34:47 +08:00
|
|
|
unsigned long timeout, last_activity;
|
2012-05-09 21:34:46 +08:00
|
|
|
uint64_t seq;
|
2012-05-09 21:34:47 +08:00
|
|
|
unsigned i;
|
2012-05-02 21:11:13 +08:00
|
|
|
bool signaled;
|
2012-05-09 21:34:47 +08:00
|
|
|
int r;
|
2009-06-05 20:42:42 +08:00
|
|
|
|
2012-05-09 21:34:47 +08:00
|
|
|
while (target_seq > atomic64_read(&rdev->fence_drv[ring].last_seq)) {
|
|
|
|
if (!rdev->ring[ring].ready) {
|
|
|
|
return -EBUSY;
|
|
|
|
}
|
2012-05-02 21:11:13 +08:00
|
|
|
|
|
|
|
timeout = jiffies - RADEON_FENCE_JIFFIES_TIMEOUT;
|
2012-05-09 21:34:47 +08:00
|
|
|
if (time_after(rdev->fence_drv[ring].last_activity, timeout)) {
|
2012-05-02 21:11:13 +08:00
|
|
|
/* the normal case, timeout is somewhere before last_activity */
|
2012-05-09 21:34:47 +08:00
|
|
|
timeout = rdev->fence_drv[ring].last_activity - timeout;
|
2012-05-02 21:11:13 +08:00
|
|
|
} else {
|
|
|
|
/* either jiffies wrapped around, or no fence was signaled in the last 500ms
|
2012-05-09 21:34:47 +08:00
|
|
|
* anyway we will just wait for the minimum amount and then check for a lockup
|
|
|
|
*/
|
2012-05-02 21:11:13 +08:00
|
|
|
timeout = 1;
|
|
|
|
}
|
2012-05-09 21:34:47 +08:00
|
|
|
seq = atomic64_read(&rdev->fence_drv[ring].last_seq);
|
2012-05-09 21:34:46 +08:00
|
|
|
/* Save current last activity valuee, used to check for GPU lockups */
|
2012-05-09 21:34:47 +08:00
|
|
|
last_activity = rdev->fence_drv[ring].last_activity;
|
2012-05-02 21:11:13 +08:00
|
|
|
|
|
|
|
trace_radeon_fence_wait_begin(rdev->ddev, seq);
|
2012-05-09 21:34:47 +08:00
|
|
|
radeon_irq_kms_sw_irq_get(rdev, ring);
|
2012-05-02 21:11:13 +08:00
|
|
|
if (intr) {
|
2012-05-09 21:34:55 +08:00
|
|
|
r = wait_event_interruptible_timeout(rdev->fence_queue,
|
2012-05-09 21:34:47 +08:00
|
|
|
(signaled = radeon_fence_seq_signaled(rdev, target_seq, ring)),
|
|
|
|
timeout);
|
|
|
|
} else {
|
2012-05-09 21:34:55 +08:00
|
|
|
r = wait_event_timeout(rdev->fence_queue,
|
2012-05-09 21:34:47 +08:00
|
|
|
(signaled = radeon_fence_seq_signaled(rdev, target_seq, ring)),
|
|
|
|
timeout);
|
2012-05-02 21:11:13 +08:00
|
|
|
}
|
2012-05-09 21:34:47 +08:00
|
|
|
radeon_irq_kms_sw_irq_put(rdev, ring);
|
2010-03-09 22:45:12 +08:00
|
|
|
if (unlikely(r < 0)) {
|
2009-12-08 01:36:19 +08:00
|
|
|
return r;
|
2010-03-09 22:45:12 +08:00
|
|
|
}
|
2012-05-02 21:11:13 +08:00
|
|
|
trace_radeon_fence_wait_end(rdev->ddev, seq);
|
2012-05-02 21:11:10 +08:00
|
|
|
|
2012-05-02 21:11:13 +08:00
|
|
|
if (unlikely(!signaled)) {
|
|
|
|
/* we were interrupted for some reason and fence
|
|
|
|
* isn't signaled yet, resume waiting */
|
|
|
|
if (r) {
|
|
|
|
continue;
|
|
|
|
}
|
2012-05-02 21:11:10 +08:00
|
|
|
|
2012-05-09 21:34:47 +08:00
|
|
|
/* check if sequence value has changed since last_activity */
|
|
|
|
if (seq != atomic64_read(&rdev->fence_drv[ring].last_seq)) {
|
|
|
|
continue;
|
|
|
|
}
|
2012-05-09 21:34:48 +08:00
|
|
|
|
|
|
|
if (lock_ring) {
|
|
|
|
mutex_lock(&rdev->ring_lock);
|
|
|
|
}
|
|
|
|
|
2012-05-09 21:34:46 +08:00
|
|
|
/* test if somebody else has already decided that this is a lockup */
|
2012-05-09 21:34:47 +08:00
|
|
|
if (last_activity != rdev->fence_drv[ring].last_activity) {
|
2012-05-09 21:34:48 +08:00
|
|
|
if (lock_ring) {
|
|
|
|
mutex_unlock(&rdev->ring_lock);
|
|
|
|
}
|
2012-05-02 21:11:13 +08:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2012-05-09 21:34:47 +08:00
|
|
|
if (radeon_ring_is_lockup(rdev, ring, &rdev->ring[ring])) {
|
2012-05-02 21:11:13 +08:00
|
|
|
/* good news we believe it's a lockup */
|
2012-05-09 21:34:46 +08:00
|
|
|
dev_warn(rdev->dev, "GPU lockup (waiting for 0x%016llx last fence id 0x%016llx)\n",
|
2012-05-09 21:34:47 +08:00
|
|
|
target_seq, seq);
|
|
|
|
|
|
|
|
/* change last activity so nobody else think there is a lockup */
|
|
|
|
for (i = 0; i < RADEON_NUM_RINGS; ++i) {
|
|
|
|
rdev->fence_drv[i].last_activity = jiffies;
|
|
|
|
}
|
2012-05-09 21:34:46 +08:00
|
|
|
|
2012-05-02 21:11:13 +08:00
|
|
|
/* mark the ring as not ready any more */
|
2012-05-09 21:34:47 +08:00
|
|
|
rdev->ring[ring].ready = false;
|
2012-05-09 21:34:48 +08:00
|
|
|
if (lock_ring) {
|
|
|
|
mutex_unlock(&rdev->ring_lock);
|
|
|
|
}
|
2012-05-02 21:11:19 +08:00
|
|
|
return -EDEADLK;
|
2012-05-02 21:11:13 +08:00
|
|
|
}
|
2012-05-09 21:34:48 +08:00
|
|
|
|
|
|
|
if (lock_ring) {
|
|
|
|
mutex_unlock(&rdev->ring_lock);
|
|
|
|
}
|
2009-06-05 20:42:42 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-05-09 21:34:47 +08:00
|
|
|
int radeon_fence_wait(struct radeon_fence *fence, bool intr)
|
2009-06-05 20:42:42 +08:00
|
|
|
{
|
|
|
|
int r;
|
|
|
|
|
2012-05-09 21:34:47 +08:00
|
|
|
if (fence == NULL) {
|
|
|
|
WARN(1, "Querying an invalid fence : %p !\n", fence);
|
|
|
|
return -EINVAL;
|
2012-05-02 21:11:10 +08:00
|
|
|
}
|
2012-05-09 21:34:47 +08:00
|
|
|
|
2012-05-09 21:34:48 +08:00
|
|
|
r = radeon_fence_wait_seq(fence->rdev, fence->seq,
|
|
|
|
fence->ring, intr, true);
|
2012-05-09 21:34:47 +08:00
|
|
|
if (r) {
|
|
|
|
return r;
|
2009-06-05 20:42:42 +08:00
|
|
|
}
|
2012-05-09 21:34:47 +08:00
|
|
|
fence->seq = RADEON_FENCE_SIGNALED_SEQ;
|
|
|
|
return 0;
|
2009-06-05 20:42:42 +08:00
|
|
|
}
|
|
|
|
|
2012-05-09 21:34:55 +08:00
|
|
|
bool radeon_fence_any_seq_signaled(struct radeon_device *rdev, u64 *seq)
|
|
|
|
{
|
|
|
|
unsigned i;
|
|
|
|
|
|
|
|
for (i = 0; i < RADEON_NUM_RINGS; ++i) {
|
|
|
|
if (seq[i] && radeon_fence_seq_signaled(rdev, seq[i], i)) {
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int radeon_fence_wait_any_seq(struct radeon_device *rdev,
|
|
|
|
u64 *target_seq, bool intr)
|
|
|
|
{
|
|
|
|
unsigned long timeout, last_activity, tmp;
|
|
|
|
unsigned i, ring = RADEON_NUM_RINGS;
|
|
|
|
bool signaled;
|
|
|
|
int r;
|
|
|
|
|
|
|
|
for (i = 0, last_activity = 0; i < RADEON_NUM_RINGS; ++i) {
|
|
|
|
if (!target_seq[i]) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* use the most recent one as indicator */
|
|
|
|
if (time_after(rdev->fence_drv[i].last_activity, last_activity)) {
|
|
|
|
last_activity = rdev->fence_drv[i].last_activity;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* For lockup detection just pick the lowest ring we are
|
|
|
|
* actively waiting for
|
|
|
|
*/
|
|
|
|
if (i < ring) {
|
|
|
|
ring = i;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* nothing to wait for ? */
|
|
|
|
if (ring == RADEON_NUM_RINGS) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (!radeon_fence_any_seq_signaled(rdev, target_seq)) {
|
|
|
|
timeout = jiffies - RADEON_FENCE_JIFFIES_TIMEOUT;
|
|
|
|
if (time_after(last_activity, timeout)) {
|
|
|
|
/* the normal case, timeout is somewhere before last_activity */
|
|
|
|
timeout = last_activity - timeout;
|
|
|
|
} else {
|
|
|
|
/* either jiffies wrapped around, or no fence was signaled in the last 500ms
|
|
|
|
* anyway we will just wait for the minimum amount and then check for a lockup
|
|
|
|
*/
|
|
|
|
timeout = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
trace_radeon_fence_wait_begin(rdev->ddev, target_seq[ring]);
|
|
|
|
for (i = 0; i < RADEON_NUM_RINGS; ++i) {
|
|
|
|
if (target_seq[i]) {
|
|
|
|
radeon_irq_kms_sw_irq_get(rdev, i);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (intr) {
|
|
|
|
r = wait_event_interruptible_timeout(rdev->fence_queue,
|
|
|
|
(signaled = radeon_fence_any_seq_signaled(rdev, target_seq)),
|
|
|
|
timeout);
|
|
|
|
} else {
|
|
|
|
r = wait_event_timeout(rdev->fence_queue,
|
|
|
|
(signaled = radeon_fence_any_seq_signaled(rdev, target_seq)),
|
|
|
|
timeout);
|
|
|
|
}
|
|
|
|
for (i = 0; i < RADEON_NUM_RINGS; ++i) {
|
|
|
|
if (target_seq[i]) {
|
|
|
|
radeon_irq_kms_sw_irq_put(rdev, i);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (unlikely(r < 0)) {
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
trace_radeon_fence_wait_end(rdev->ddev, target_seq[ring]);
|
|
|
|
|
|
|
|
if (unlikely(!signaled)) {
|
|
|
|
/* we were interrupted for some reason and fence
|
|
|
|
* isn't signaled yet, resume waiting */
|
|
|
|
if (r) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
mutex_lock(&rdev->ring_lock);
|
|
|
|
for (i = 0, tmp = 0; i < RADEON_NUM_RINGS; ++i) {
|
|
|
|
if (time_after(rdev->fence_drv[i].last_activity, tmp)) {
|
|
|
|
tmp = rdev->fence_drv[i].last_activity;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/* test if somebody else has already decided that this is a lockup */
|
|
|
|
if (last_activity != tmp) {
|
|
|
|
last_activity = tmp;
|
|
|
|
mutex_unlock(&rdev->ring_lock);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (radeon_ring_is_lockup(rdev, ring, &rdev->ring[ring])) {
|
|
|
|
/* good news we believe it's a lockup */
|
|
|
|
dev_warn(rdev->dev, "GPU lockup (waiting for 0x%016llx)\n",
|
|
|
|
target_seq[ring]);
|
|
|
|
|
|
|
|
/* change last activity so nobody else think there is a lockup */
|
|
|
|
for (i = 0; i < RADEON_NUM_RINGS; ++i) {
|
|
|
|
rdev->fence_drv[i].last_activity = jiffies;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* mark the ring as not ready any more */
|
|
|
|
rdev->ring[ring].ready = false;
|
|
|
|
mutex_unlock(&rdev->ring_lock);
|
|
|
|
return -EDEADLK;
|
|
|
|
}
|
|
|
|
mutex_unlock(&rdev->ring_lock);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int radeon_fence_wait_any(struct radeon_device *rdev,
|
|
|
|
struct radeon_fence **fences,
|
|
|
|
bool intr)
|
|
|
|
{
|
|
|
|
uint64_t seq[RADEON_NUM_RINGS];
|
|
|
|
unsigned i;
|
|
|
|
int r;
|
|
|
|
|
|
|
|
for (i = 0; i < RADEON_NUM_RINGS; ++i) {
|
|
|
|
seq[i] = 0;
|
|
|
|
|
|
|
|
if (!fences[i]) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (fences[i]->seq == RADEON_FENCE_SIGNALED_SEQ) {
|
|
|
|
/* something was allready signaled */
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-05-08 20:24:01 +08:00
|
|
|
seq[i] = fences[i]->seq;
|
2012-05-09 21:34:55 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
r = radeon_fence_wait_any_seq(rdev, seq, intr);
|
|
|
|
if (r) {
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-05-09 21:34:48 +08:00
|
|
|
int radeon_fence_wait_next_locked(struct radeon_device *rdev, int ring)
|
2009-06-05 20:42:42 +08:00
|
|
|
{
|
2012-05-09 21:34:47 +08:00
|
|
|
uint64_t seq;
|
2009-06-05 20:42:42 +08:00
|
|
|
|
2012-05-09 21:34:47 +08:00
|
|
|
/* We are not protected by ring lock when reading current seq but
|
|
|
|
* it's ok as worst case is we return to early while we could have
|
|
|
|
* wait.
|
|
|
|
*/
|
|
|
|
seq = atomic64_read(&rdev->fence_drv[ring].last_seq) + 1ULL;
|
2012-05-10 21:57:31 +08:00
|
|
|
if (seq >= rdev->fence_drv[ring].sync_seq[ring]) {
|
2012-05-09 21:34:48 +08:00
|
|
|
/* nothing to wait for, last_seq is
|
|
|
|
already the last emited fence */
|
|
|
|
return -ENOENT;
|
2009-06-05 20:42:42 +08:00
|
|
|
}
|
2012-05-09 21:34:48 +08:00
|
|
|
return radeon_fence_wait_seq(rdev, seq, ring, false, false);
|
2012-05-09 21:34:47 +08:00
|
|
|
}
|
|
|
|
|
2012-05-09 21:34:48 +08:00
|
|
|
int radeon_fence_wait_empty_locked(struct radeon_device *rdev, int ring)
|
2012-05-09 21:34:47 +08:00
|
|
|
{
|
|
|
|
/* We are not protected by ring lock when reading current seq
|
|
|
|
* but it's ok as wait empty is call from place where no more
|
|
|
|
* activity can be scheduled so there won't be concurrent access
|
|
|
|
* to seq value.
|
|
|
|
*/
|
2012-05-10 21:57:31 +08:00
|
|
|
return radeon_fence_wait_seq(rdev, rdev->fence_drv[ring].sync_seq[ring],
|
2012-05-09 21:34:48 +08:00
|
|
|
ring, false, false);
|
2009-06-05 20:42:42 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
struct radeon_fence *radeon_fence_ref(struct radeon_fence *fence)
|
|
|
|
{
|
|
|
|
kref_get(&fence->kref);
|
|
|
|
return fence;
|
|
|
|
}
|
|
|
|
|
|
|
|
void radeon_fence_unref(struct radeon_fence **fence)
|
|
|
|
{
|
|
|
|
struct radeon_fence *tmp = *fence;
|
|
|
|
|
|
|
|
*fence = NULL;
|
|
|
|
if (tmp) {
|
2011-02-27 08:34:08 +08:00
|
|
|
kref_put(&tmp->kref, radeon_fence_destroy);
|
2009-06-05 20:42:42 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-05-09 21:34:47 +08:00
|
|
|
unsigned radeon_fence_count_emitted(struct radeon_device *rdev, int ring)
|
2009-06-05 20:42:42 +08:00
|
|
|
{
|
2012-05-09 21:34:47 +08:00
|
|
|
uint64_t emitted;
|
2009-06-05 20:42:42 +08:00
|
|
|
|
2012-05-09 21:34:47 +08:00
|
|
|
/* We are not protected by ring lock when reading the last sequence
|
|
|
|
* but it's ok to report slightly wrong fence count here.
|
|
|
|
*/
|
2012-05-09 21:34:55 +08:00
|
|
|
radeon_fence_process(rdev, ring);
|
2012-05-10 21:57:31 +08:00
|
|
|
emitted = rdev->fence_drv[ring].sync_seq[ring]
|
|
|
|
- atomic64_read(&rdev->fence_drv[ring].last_seq);
|
2012-05-09 21:34:47 +08:00
|
|
|
/* to avoid 32bits warp around */
|
|
|
|
if (emitted > 0x10000000) {
|
|
|
|
emitted = 0x10000000;
|
2011-10-20 18:38:09 +08:00
|
|
|
}
|
2012-05-09 21:34:47 +08:00
|
|
|
return (unsigned)emitted;
|
2011-10-20 18:38:09 +08:00
|
|
|
}
|
|
|
|
|
2012-05-10 21:57:31 +08:00
|
|
|
bool radeon_fence_need_sync(struct radeon_fence *fence, int dst_ring)
|
|
|
|
{
|
|
|
|
struct radeon_fence_driver *fdrv;
|
|
|
|
|
|
|
|
if (!fence) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (fence->ring == dst_ring) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* we are protected by the ring mutex */
|
|
|
|
fdrv = &fence->rdev->fence_drv[dst_ring];
|
|
|
|
if (fence->seq <= fdrv->sync_seq[fence->ring]) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
void radeon_fence_note_sync(struct radeon_fence *fence, int dst_ring)
|
|
|
|
{
|
|
|
|
struct radeon_fence_driver *dst, *src;
|
|
|
|
unsigned i;
|
|
|
|
|
|
|
|
if (!fence) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (fence->ring == dst_ring) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* we are protected by the ring mutex */
|
|
|
|
src = &fence->rdev->fence_drv[fence->ring];
|
|
|
|
dst = &fence->rdev->fence_drv[dst_ring];
|
|
|
|
for (i = 0; i < RADEON_NUM_RINGS; ++i) {
|
|
|
|
if (i == dst_ring) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
dst->sync_seq[i] = max(dst->sync_seq[i], src->sync_seq[i]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-11-21 04:45:34 +08:00
|
|
|
int radeon_fence_driver_start_ring(struct radeon_device *rdev, int ring)
|
2009-06-05 20:42:42 +08:00
|
|
|
{
|
2011-11-21 04:45:34 +08:00
|
|
|
uint64_t index;
|
|
|
|
int r;
|
2009-06-05 20:42:42 +08:00
|
|
|
|
2011-11-21 04:45:34 +08:00
|
|
|
radeon_scratch_free(rdev, rdev->fence_drv[ring].scratch_reg);
|
|
|
|
if (rdev->wb.use_event) {
|
|
|
|
rdev->fence_drv[ring].scratch_reg = 0;
|
|
|
|
index = R600_WB_EVENT_OFFSET + ring * 4;
|
|
|
|
} else {
|
2011-08-26 01:39:48 +08:00
|
|
|
r = radeon_scratch_get(rdev, &rdev->fence_drv[ring].scratch_reg);
|
|
|
|
if (r) {
|
|
|
|
dev_err(rdev->dev, "fence failed to get scratch register\n");
|
|
|
|
return r;
|
|
|
|
}
|
2011-11-21 04:45:34 +08:00
|
|
|
index = RADEON_WB_SCRATCH_OFFSET +
|
|
|
|
rdev->fence_drv[ring].scratch_reg -
|
|
|
|
rdev->scratch.reg_base;
|
2011-08-26 01:39:48 +08:00
|
|
|
}
|
2011-11-21 04:45:34 +08:00
|
|
|
rdev->fence_drv[ring].cpu_addr = &rdev->wb.wb[index/4];
|
|
|
|
rdev->fence_drv[ring].gpu_addr = rdev->wb.gpu_addr + index;
|
2012-05-10 21:57:31 +08:00
|
|
|
radeon_fence_write(rdev, rdev->fence_drv[ring].sync_seq[ring], ring);
|
2011-11-21 04:45:34 +08:00
|
|
|
rdev->fence_drv[ring].initialized = true;
|
2012-05-09 21:34:47 +08:00
|
|
|
dev_info(rdev->dev, "fence driver on ring %d use gpu addr 0x%016llx and cpu addr 0x%p\n",
|
2011-11-21 04:45:34 +08:00
|
|
|
ring, rdev->fence_drv[ring].gpu_addr, rdev->fence_drv[ring].cpu_addr);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void radeon_fence_driver_init_ring(struct radeon_device *rdev, int ring)
|
|
|
|
{
|
2012-05-10 21:57:31 +08:00
|
|
|
int i;
|
|
|
|
|
2011-11-21 04:45:34 +08:00
|
|
|
rdev->fence_drv[ring].scratch_reg = -1;
|
|
|
|
rdev->fence_drv[ring].cpu_addr = NULL;
|
|
|
|
rdev->fence_drv[ring].gpu_addr = 0;
|
2012-05-10 21:57:31 +08:00
|
|
|
for (i = 0; i < RADEON_NUM_RINGS; ++i)
|
|
|
|
rdev->fence_drv[ring].sync_seq[i] = 0;
|
2012-05-09 21:34:46 +08:00
|
|
|
atomic64_set(&rdev->fence_drv[ring].last_seq, 0);
|
2012-05-09 21:34:47 +08:00
|
|
|
rdev->fence_drv[ring].last_activity = jiffies;
|
2011-11-21 04:45:34 +08:00
|
|
|
rdev->fence_drv[ring].initialized = false;
|
|
|
|
}
|
|
|
|
|
|
|
|
int radeon_fence_driver_init(struct radeon_device *rdev)
|
|
|
|
{
|
|
|
|
int ring;
|
|
|
|
|
2012-05-09 21:34:55 +08:00
|
|
|
init_waitqueue_head(&rdev->fence_queue);
|
2011-11-21 04:45:34 +08:00
|
|
|
for (ring = 0; ring < RADEON_NUM_RINGS; ring++) {
|
|
|
|
radeon_fence_driver_init_ring(rdev, ring);
|
2009-06-05 20:42:42 +08:00
|
|
|
}
|
|
|
|
if (radeon_debugfs_fence_init(rdev)) {
|
2009-12-12 03:36:19 +08:00
|
|
|
dev_err(rdev->dev, "fence debugfs file creation failed\n");
|
2009-06-05 20:42:42 +08:00
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void radeon_fence_driver_fini(struct radeon_device *rdev)
|
|
|
|
{
|
2011-08-26 01:39:48 +08:00
|
|
|
int ring;
|
|
|
|
|
2012-05-09 21:34:48 +08:00
|
|
|
mutex_lock(&rdev->ring_lock);
|
2011-08-26 01:39:48 +08:00
|
|
|
for (ring = 0; ring < RADEON_NUM_RINGS; ring++) {
|
|
|
|
if (!rdev->fence_drv[ring].initialized)
|
|
|
|
continue;
|
2012-05-09 21:34:48 +08:00
|
|
|
radeon_fence_wait_empty_locked(rdev, ring);
|
2012-05-09 21:34:55 +08:00
|
|
|
wake_up_all(&rdev->fence_queue);
|
2011-08-26 01:39:48 +08:00
|
|
|
radeon_scratch_free(rdev, rdev->fence_drv[ring].scratch_reg);
|
|
|
|
rdev->fence_drv[ring].initialized = false;
|
|
|
|
}
|
2012-05-09 21:34:48 +08:00
|
|
|
mutex_unlock(&rdev->ring_lock);
|
2009-06-05 20:42:42 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Fence debugfs
|
|
|
|
*/
|
|
|
|
#if defined(CONFIG_DEBUG_FS)
|
|
|
|
static int radeon_debugfs_fence_info(struct seq_file *m, void *data)
|
|
|
|
{
|
|
|
|
struct drm_info_node *node = (struct drm_info_node *)m->private;
|
|
|
|
struct drm_device *dev = node->minor->dev;
|
|
|
|
struct radeon_device *rdev = dev->dev_private;
|
2012-05-10 21:57:31 +08:00
|
|
|
int i, j;
|
2011-08-26 01:39:48 +08:00
|
|
|
|
|
|
|
for (i = 0; i < RADEON_NUM_RINGS; ++i) {
|
|
|
|
if (!rdev->fence_drv[i].initialized)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
seq_printf(m, "--- ring %d ---\n", i);
|
2012-05-10 00:27:29 +08:00
|
|
|
seq_printf(m, "Last signaled fence 0x%016llx\n",
|
|
|
|
(unsigned long long)atomic64_read(&rdev->fence_drv[i].last_seq));
|
2012-05-10 21:57:31 +08:00
|
|
|
seq_printf(m, "Last emitted 0x%016llx\n",
|
|
|
|
rdev->fence_drv[i].sync_seq[i]);
|
|
|
|
|
|
|
|
for (j = 0; j < RADEON_NUM_RINGS; ++j) {
|
|
|
|
if (i != j && rdev->fence_drv[j].initialized)
|
|
|
|
seq_printf(m, "Last sync to ring %d 0x%016llx\n",
|
|
|
|
j, rdev->fence_drv[i].sync_seq[j]);
|
|
|
|
}
|
2009-06-05 20:42:42 +08:00
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct drm_info_list radeon_debugfs_fence_list[] = {
|
|
|
|
{"radeon_fence_info", &radeon_debugfs_fence_info, 0, NULL},
|
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
|
|
|
int radeon_debugfs_fence_init(struct radeon_device *rdev)
|
|
|
|
{
|
|
|
|
#if defined(CONFIG_DEBUG_FS)
|
|
|
|
return radeon_debugfs_add_files(rdev, radeon_debugfs_fence_list, 1);
|
|
|
|
#else
|
|
|
|
return 0;
|
|
|
|
#endif
|
|
|
|
}
|