/*
* Copyright 2010 Christoph Bumiller
*
* 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 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.
*/
#include "util/u_double_list.h"
#include "nouveau_screen.h"
#include "nouveau_winsys.h"
#include "nouveau_fence.h"
#ifdef PIPE_OS_UNIX
#include <sched.h>
#endif
boolean
nouveau_fence_new(struct nouveau_screen *screen, struct nouveau_fence **fence,
boolean emit)
{
*fence = CALLOC_STRUCT(nouveau_fence);
if (!*fence)
return FALSE;
(*fence)->screen = screen;
(*fence)->ref = 1;
LIST_INITHEAD(&(*fence)->work);
if (emit)
nouveau_fence_emit(*fence);
return TRUE;
}
static void
nouveau_fence_trigger_work(struct nouveau_fence *fence)
{
struct nouveau_fence_work *work, *tmp;
LIST_FOR_EACH_ENTRY_SAFE(work, tmp, &fence->work, list) {
work->func(work->data);
LIST_DEL(&work->list);
FREE(work);
}
}
boolean
nouveau_fence_work(struct nouveau_fence *fence,
void (*func)(void *), void *data)
{
struct nouveau_fence_work *work;
if (!fence || fence->state == NOUVEAU_FENCE_STATE_SIGNALLED) {
func(data);
return TRUE;
}
work = CALLOC_STRUCT(nouveau_fence_work);
if (!work)
return FALSE;
work->func = func;
work->data = data;
LIST_ADD(&work->list, &fence->work);
return TRUE;
}
void
nouveau_fence_emit(struct nouveau_fence *fence)
{
struct nouveau_screen *screen = fence->screen;
assert(fence
->state
== NOUVEAU_FENCE_STATE_AVAILABLE
);
/* set this now, so that if fence.emit triggers a flush we don't recurse */
fence->state = NOUVEAU_FENCE_STATE_EMITTING;
++fence->ref;
if (screen->fence.tail)
screen->fence.tail->next = fence;
else
screen->fence.head = fence;
screen->fence.tail = fence;
screen->fence.emit(&screen->base, &fence->sequence);
assert(fence
->state
== NOUVEAU_FENCE_STATE_EMITTING
); fence->state = NOUVEAU_FENCE_STATE_EMITTED;
}
void
nouveau_fence_del(struct nouveau_fence *fence)
{
struct nouveau_fence *it;
struct nouveau_screen *screen = fence->screen;
if (fence->state == NOUVEAU_FENCE_STATE_EMITTED ||
fence->state == NOUVEAU_FENCE_STATE_FLUSHED) {
if (fence == screen->fence.head) {
screen->fence.head = fence->next;
if (!screen->fence.head)
screen->fence.tail = NULL;
} else {
for (it = screen->fence.head; it && it->next != fence; it = it->next);
it->next = fence->next;
if (screen->fence.tail == fence)
screen->fence.tail = it;
}
}
if (!LIST_IS_EMPTY(&fence->work)) {
debug_printf("WARNING: deleting fence with work still pending !\n");
nouveau_fence_trigger_work(fence);
}
FREE(fence);
}
void
nouveau_fence_update(struct nouveau_screen *screen, boolean flushed)
{
struct nouveau_fence *fence;
struct nouveau_fence *next = NULL;
u32 sequence = screen->fence.update(&screen->base);
if (screen->fence.sequence_ack == sequence)
return;
screen->fence.sequence_ack = sequence;
for (fence = screen->fence.head; fence; fence = next) {
next = fence->next;
sequence = fence->sequence;
fence->state = NOUVEAU_FENCE_STATE_SIGNALLED;
nouveau_fence_trigger_work(fence);
nouveau_fence_ref(NULL, &fence);
if (sequence == screen->fence.sequence_ack)
break;
}
screen->fence.head = next;
if (!next)
screen->fence.tail = NULL;
if (flushed) {
for (fence = next; fence; fence = fence->next)
if (fence->state == NOUVEAU_FENCE_STATE_EMITTED)
fence->state = NOUVEAU_FENCE_STATE_FLUSHED;
}
}
#define NOUVEAU_FENCE_MAX_SPINS (1 << 31)
boolean
nouveau_fence_signalled(struct nouveau_fence *fence)
{
struct nouveau_screen *screen = fence->screen;
if (fence->state >= NOUVEAU_FENCE_STATE_EMITTED)
nouveau_fence_update(screen, FALSE);
return fence->state == NOUVEAU_FENCE_STATE_SIGNALLED;
}
boolean
nouveau_fence_wait(struct nouveau_fence *fence)
{
struct nouveau_screen *screen = fence->screen;
uint32_t spins = 0;
/* wtf, someone is waiting on a fence in flush_notify handler? */
assert(fence
->state
!= NOUVEAU_FENCE_STATE_EMITTING
);
if (fence->state < NOUVEAU_FENCE_STATE_EMITTED) {
nouveau_fence_emit(fence);
if (fence == screen->fence.current)
nouveau_fence_new(screen, &screen->fence.current, FALSE);
}
if (fence->state < NOUVEAU_FENCE_STATE_FLUSHED) {
if (nouveau_pushbuf_kick(screen->pushbuf, screen->pushbuf->channel))
return FALSE;
}
do {
nouveau_fence_update(screen, FALSE);
if (fence->state == NOUVEAU_FENCE_STATE_SIGNALLED)
return TRUE;
if (!spins)
NOUVEAU_DRV_STAT(screen, any_non_kernel_fence_sync_count, 1);
spins++;
#ifdef PIPE_OS_UNIX
if (!(spins % 8)) /* donate a few cycles */
sched_yield();
#endif
} while (spins < NOUVEAU_FENCE_MAX_SPINS);
debug_printf("Wait on fence %u (ack = %u, next = %u) timed out !\n",
fence->sequence,
screen->fence.sequence_ack, screen->fence.sequence);
return FALSE;
}
void
nouveau_fence_next(struct nouveau_screen *screen)
{
if (screen->fence.current->state < NOUVEAU_FENCE_STATE_EMITTING)
nouveau_fence_emit(screen->fence.current);
nouveau_fence_ref(NULL, &screen->fence.current);
nouveau_fence_new(screen, &screen->fence.current, FALSE);
}