Lines Matching defs:fence
188 fd_bo_add_fence(fd_submit->bos[i], submit->pipe, submit->fence);
210 assert(fd_fence_before(pipe->last_submit_fence, fd_submit->base.fence));
211 pipe->last_submit_fence = fd_submit->base.fence;
215 DEBUG_MSG("finish: %u", submit->fence);
234 struct util_queue_fence *fence;
236 fence = &fd_submit->out_fence->ready;
238 util_queue_fence_init(&fd_submit->fence);
239 fence = &fd_submit->fence;
242 DEBUG_MSG("enqueue: %u", submit->fence);
245 submit, fence,
304 assert(fd_fence_before(pipe->last_enqueue_fence, submit->fence));
305 pipe->last_enqueue_fence = submit->fence;
307 /* If we don't need an out-fence, we can defer the submit.
309 * TODO we could defer submits with in-fence as well.. if we took our own
310 * reference to the fd, and merged all the in-fence-fd's when we flush the
314 DEBUG_MSG("defer: %u", submit->fence);
334 fd_pipe_sp_flush(struct fd_pipe *pipe, uint32_t fence)
339 DEBUG_MSG("flush: %u", fence);
345 assert(!fd_fence_after(fence, pipe->last_enqueue_fence));
349 * list. If we did, we couldn't compare their fence to our fence,
355 if (fd_fence_after(deferred_submit->fence, fence))
378 while (fd_fence_before(pipe->last_submit_fence, fence)) {