src/gallium/drivers/nouveau/nouveau_fence.c

   1 /*
   2  * Copyright 2010 Christoph Bumiller
   3  *
   4  * Permission is hereby granted, free of charge, to any person obtaining a
   5  * copy of this software and associated documentation files (the "Software"),
   6  * to deal in the Software without restriction, including without limitation
   7  * the rights to use, copy, modify, merge, publish, distribute, sublicense,
   8  * and/or sell copies of the Software, and to permit persons to whom the
   9  * Software is furnished to do so, subject to the following conditions:
  10  *
  11  * The above copyright notice and this permission notice shall be included in
  12  * all copies or substantial portions of the Software.
  13  *
  14  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  15  * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  16  * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL
  17  * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
  18  * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
  19  * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
  20  * OTHER DEALINGS IN THE SOFTWARE.
  21  */
  22
  23 #include "nouveau_screen.h"
  24 #include "nouveau_winsys.h"
  25 #include "nouveau_fence.h"
  26 #include "os/os_time.h"
  27
  28 #ifdef PIPE_OS_UNIX
  29 #include <sched.h>
  30 #endif
  31
  32 bool
  33 nouveau_fence_new(struct nouveau_screen *screen, struct nouveau_fence **fence,
  34                   bool emit)
  35 {
  36    *fence = CALLOC_STRUCT(nouveau_fence);
  37    if (!*fence)
  38       return false;
  39
  40    (*fence)->screen = screen;
  41    (*fence)->ref = 1;
  42    LIST_INITHEAD(&(*fence)->work);
  43
  44    if (emit)
  45       nouveau_fence_emit(*fence);
  46
  47    return true;
  48 }
  49
  50 static void
  51 nouveau_fence_trigger_work(struct nouveau_fence *fence)
  52 {
  53    struct nouveau_fence_work *work, *tmp;
  54
  55    LIST_FOR_EACH_ENTRY_SAFE(work, tmp, &fence->work, list) {
  56       work->func(work->data);
  57       LIST_DEL(&work->list);
  58       FREE(work);
  59    }
  60 }
  61
  62 bool
  63 nouveau_fence_work(struct nouveau_fence *fence,
  64                    void (*func)(void *), void *data)
  65 {
  66    struct nouveau_fence_work *work;
  67
  68    if (!fence || fence->state == NOUVEAU_FENCE_STATE_SIGNALLED) {
  69       func(data);
  70       return true;
  71    }
  72
  73    work = CALLOC_STRUCT(nouveau_fence_work);
  74    if (!work)
  75       return false;
  76    work->func = func;
  77    work->data = data;
  78    LIST_ADD(&work->list, &fence->work);
  79    return true;
  80 }
  81
  82 void
  83 nouveau_fence_emit(struct nouveau_fence *fence)
  84 {
  85    struct nouveau_screen *screen = fence->screen;
  86
  87    assert(fence->state == NOUVEAU_FENCE_STATE_AVAILABLE);
  88
  89    /* set this now, so that if fence.emit triggers a flush we don't recurse */
  90    fence->state = NOUVEAU_FENCE_STATE_EMITTING;
  91
  92    ++fence->ref;
  93
  94    if (screen->fence.tail)
  95       screen->fence.tail->next = fence;
  96    else
  97       screen->fence.head = fence;
  98
  99    screen->fence.tail = fence;
 100
 101    screen->fence.emit(&screen->base, &fence->sequence);
 102
 103    assert(fence->state == NOUVEAU_FENCE_STATE_EMITTING);
 104    fence->state = NOUVEAU_FENCE_STATE_EMITTED;
 105 }
 106
 107 void
 108 nouveau_fence_del(struct nouveau_fence *fence)
 109 {
 110    struct nouveau_fence *it;
 111    struct nouveau_screen *screen = fence->screen;
 112
 113    if (fence->state == NOUVEAU_FENCE_STATE_EMITTED ||
 114        fence->state == NOUVEAU_FENCE_STATE_FLUSHED) {
 115       if (fence == screen->fence.head) {
 116          screen->fence.head = fence->next;
 117          if (!screen->fence.head)
 118             screen->fence.tail = NULL;
 119       } else {
 120          for (it = screen->fence.head; it && it->next != fence; it = it->next);
 121          it->next = fence->next;
 122          if (screen->fence.tail == fence)
 123             screen->fence.tail = it;
 124       }
 125    }
 126
 127    if (!LIST_IS_EMPTY(&fence->work)) {
 128       debug_printf("WARNING: deleting fence with work still pending !\n");
 129       nouveau_fence_trigger_work(fence);
 130    }
 131
 132    FREE(fence);
 133 }
 134
 135 void
 136 nouveau_fence_update(struct nouveau_screen *screen, bool flushed)
 137 {
 138    struct nouveau_fence *fence;
 139    struct nouveau_fence *next = NULL;
 140    u32 sequence = screen->fence.update(&screen->base);
 141
 142    if (screen->fence.sequence_ack == sequence)
 143       return;
 144    screen->fence.sequence_ack = sequence;
 145
 146    for (fence = screen->fence.head; fence; fence = next) {
 147       next = fence->next;
 148       sequence = fence->sequence;
 149
 150       fence->state = NOUVEAU_FENCE_STATE_SIGNALLED;
 151
 152       nouveau_fence_trigger_work(fence);
 153       nouveau_fence_ref(NULL, &fence);
 154
 155       if (sequence == screen->fence.sequence_ack)
 156          break;
 157    }
 158    screen->fence.head = next;
 159    if (!next)
 160       screen->fence.tail = NULL;
 161
 162    if (flushed) {
 163       for (fence = next; fence; fence = fence->next)
 164          if (fence->state == NOUVEAU_FENCE_STATE_EMITTED)
 165             fence->state = NOUVEAU_FENCE_STATE_FLUSHED;
 166    }
 167 }
 168
 169 #define NOUVEAU_FENCE_MAX_SPINS (1 << 31)
 170
 171 bool
 172 nouveau_fence_signalled(struct nouveau_fence *fence)
 173 {
 174    struct nouveau_screen *screen = fence->screen;
 175
 176    if (fence->state == NOUVEAU_FENCE_STATE_SIGNALLED)
 177       return true;
 178
 179    if (fence->state >= NOUVEAU_FENCE_STATE_EMITTED)
 180       nouveau_fence_update(screen, false);
 181
 182    return fence->state == NOUVEAU_FENCE_STATE_SIGNALLED;
 183 }
 184
 185 bool
 186 nouveau_fence_wait(struct nouveau_fence *fence, struct pipe_debug_callback *debug)
 187 {
 188    struct nouveau_screen *screen = fence->screen;
 189    uint32_t spins = 0;
 190    int64_t start = 0;
 191
 192    /* wtf, someone is waiting on a fence in flush_notify handler? */
 193    assert(fence->state != NOUVEAU_FENCE_STATE_EMITTING);
 194
 195    if (fence->state < NOUVEAU_FENCE_STATE_EMITTED) {
 196       PUSH_SPACE(screen->pushbuf, 8);
 197       /* The space allocation might trigger a flush, which could emit the
 198        * current fence. So check again.
 199        */
 200       if (fence->state < NOUVEAU_FENCE_STATE_EMITTED)
 201          nouveau_fence_emit(fence);
 202    }
 203
 204    if (fence->state < NOUVEAU_FENCE_STATE_FLUSHED)
 205       if (nouveau_pushbuf_kick(screen->pushbuf, screen->pushbuf->channel))
 206          return false;
 207
 208    if (fence == screen->fence.current)
 209       nouveau_fence_next(screen);
 210
 211    if (debug && debug->debug_message)
 212       start = os_time_get_nano();
 213
 214    do {
 215       nouveau_fence_update(screen, false);
 216
 217       if (fence->state == NOUVEAU_FENCE_STATE_SIGNALLED) {
 218          if (debug && debug->debug_message)
 219             pipe_debug_message(debug, PERF_INFO,
 220                                "stalled %.3f ms waiting for fence",
 221                                (os_time_get_nano() - start) / 1000000.f);
 222          return true;
 223       }
 224       if (!spins)
 225          NOUVEAU_DRV_STAT(screen, any_non_kernel_fence_sync_count, 1);
 226       spins++;
 227 #ifdef PIPE_OS_UNIX
 228       if (!(spins % 8)) /* donate a few cycles */
 229          sched_yield();
 230 #endif
 231    } while (spins < NOUVEAU_FENCE_MAX_SPINS);
 232
 233    debug_printf("Wait on fence %u (ack = %u, next = %u) timed out !\n",
 234                 fence->sequence,
 235                 screen->fence.sequence_ack, screen->fence.sequence);
 236
 237    return false;
 238 }
 239
 240 void
 241 nouveau_fence_next(struct nouveau_screen *screen)
 242 {
 243    if (screen->fence.current->state < NOUVEAU_FENCE_STATE_EMITTING) {
 244       if (screen->fence.current->ref > 1)
 245          nouveau_fence_emit(screen->fence.current);
 246       else
 247          return;
 248    }
 249
 250    nouveau_fence_ref(NULL, &screen->fence.current);
 251
 252    nouveau_fence_new(screen, &screen->fence.current, false);
 253 }
 254
 255 void
 256 nouveau_fence_unref_bo(void *data)
 257 {
 258    struct nouveau_bo *bo = data;
 259
 260    nouveau_bo_ref(NULL, &bo);
 261 }