Lines Matching defs:fence
8 #include <linux/dma-fence.h>
9 #include <linux/dma-fence-chain.h>
68 struct dma_fence *fence,
79 dma_fence_get(fence),
188 struct dma_fence *fence;
196 fence = dma_fence_get(fc.tail);
197 err = dma_fence_chain_find_seqno(&fence, 0);
198 dma_fence_put(fence);
205 fence = dma_fence_get(fc.tail);
206 err = dma_fence_chain_find_seqno(&fence, i + 1);
207 dma_fence_put(fence);
213 if (fence != fc.chains[i]) {
214 pr_err("Incorrect fence reported by find_seqno(%d:%d)\n",
220 dma_fence_get(fence);
221 err = dma_fence_chain_find_seqno(&fence, i + 1);
222 dma_fence_put(fence);
227 if (fence != fc.chains[i]) {
228 pr_err("Incorrect fence reported by find self\n");
233 dma_fence_get(fence);
234 err = dma_fence_chain_find_seqno(&fence, i + 2);
235 dma_fence_put(fence);
237 pr_err("Error not reported for future fence: find_seqno(%d:%d)!\n",
243 dma_fence_get(fence);
244 err = dma_fence_chain_find_seqno(&fence, i);
245 dma_fence_put(fence);
247 pr_err("Error reported for previous fence!\n");
250 if (i > 0 && fence != fc.chains[i - 1]) {
251 pr_err("Incorrect fence reported by find_seqno(%d:%d)\n",
266 struct dma_fence *fence;
275 fence = dma_fence_get(fc.tail);
276 err = dma_fence_chain_find_seqno(&fence, 1);
277 dma_fence_put(fence);
283 if (fence && fence != fc.chains[0]) {
284 pr_err("Incorrect chain-fence.seqno:%lld reported for completed seqno:1\n",
285 fence->seqno);
287 dma_fence_get(fence);
288 err = dma_fence_chain_find_seqno(&fence, 1);
289 dma_fence_put(fence);
304 struct dma_fence *fence;
313 fence = dma_fence_get(fc.tail);
314 err = dma_fence_chain_find_seqno(&fence, 2);
315 dma_fence_put(fence);
322 * We signaled the middle fence (2) of the 1-2-3 chain. The behavior
323 * of the dma-fence-chain is to make us wait for all the fences up to
324 * the point we want. Since fence 1 is still not signaled, this what
325 * we should get as fence to wait upon (fence 2 being garbage
328 if (fence != fc.chains[0]) {
329 pr_err("Incorrect chain-fence.seqno:%lld reported for completed seqno:2\n",
330 fence ? fence->seqno : 0);
348 struct dma_fence *fence;
357 fence = dma_fence_get(fc.tail);
358 err = dma_fence_chain_find_seqno(&fence, 2 * i + 1);
359 dma_fence_put(fence);
365 if (fence != fc.chains[i]) {
366 pr_err("Incorrect fence.seqno:%lld reported by find_seqno(%d:%d)\n",
367 fence->seqno,
374 dma_fence_get(fence);
375 err = dma_fence_chain_find_seqno(&fence, 2 * i + 2);
376 dma_fence_put(fence);
381 if (fence != fc.chains[i]) {
382 pr_err("Incorrect fence reported by find self\n");
404 struct dma_fence *fence = dma_fence_get(data->fc.tail);
409 err = dma_fence_chain_find_seqno(&fence, seqno);
411 pr_err("Failed to find fence seqno:%d\n",
413 dma_fence_put(fence);
416 if (!fence)
420 * We can only find ourselves if we are on fence we were
423 if (fence->seqno == seqno) {
424 err = dma_fence_chain_find_seqno(&fence, seqno);
426 pr_err("Reported an invalid fence for find-self:%d\n",
428 dma_fence_put(fence);
433 dma_fence_put(fence);