mirror of
https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git
synced 2024-09-14 06:35:12 +00:00
245a4a7b53
Introduce a dma_fence_unwrap_merge() macro which allows to unwrap fences
which potentially can be containers as well and then merge them back
together into a flat dma_fence_array.
v2: rename the function, add some more comments about how the wrapper is
used, move filtering of signaled fences into the unwrap iterator,
add complex selftest which covers more cases.
v3: fix signaled fence filtering once more
Signed-off-by: Christian König <christian.koenig@amd.com>
Reviewed-by: Daniel Vetter <daniel.vetter@ffwll.ch>
Link: https://patchwork.freedesktop.org/patch/msgid/20220518135844.3338-5-christian.koenig@amd.com
79 lines
2.4 KiB
C
79 lines
2.4 KiB
C
/* SPDX-License-Identifier: GPL-2.0-only */
|
|
/*
|
|
* Copyright (C) 2022 Advanced Micro Devices, Inc.
|
|
* Authors:
|
|
* Christian König <christian.koenig@amd.com>
|
|
*/
|
|
|
|
#ifndef __LINUX_DMA_FENCE_UNWRAP_H
|
|
#define __LINUX_DMA_FENCE_UNWRAP_H
|
|
|
|
struct dma_fence;
|
|
|
|
/**
|
|
* struct dma_fence_unwrap - cursor into the container structure
|
|
*
|
|
* Should be used with dma_fence_unwrap_for_each() iterator macro.
|
|
*/
|
|
struct dma_fence_unwrap {
|
|
/**
|
|
* @chain: potential dma_fence_chain, but can be other fence as well
|
|
*/
|
|
struct dma_fence *chain;
|
|
/**
|
|
* @array: potential dma_fence_array, but can be other fence as well
|
|
*/
|
|
struct dma_fence *array;
|
|
/**
|
|
* @index: last returned index if @array is really a dma_fence_array
|
|
*/
|
|
unsigned int index;
|
|
};
|
|
|
|
struct dma_fence *dma_fence_unwrap_first(struct dma_fence *head,
|
|
struct dma_fence_unwrap *cursor);
|
|
struct dma_fence *dma_fence_unwrap_next(struct dma_fence_unwrap *cursor);
|
|
|
|
/**
|
|
* dma_fence_unwrap_for_each - iterate over all fences in containers
|
|
* @fence: current fence
|
|
* @cursor: current position inside the containers
|
|
* @head: starting point for the iterator
|
|
*
|
|
* Unwrap dma_fence_chain and dma_fence_array containers and deep dive into all
|
|
* potential fences in them. If @head is just a normal fence only that one is
|
|
* returned.
|
|
*
|
|
* Note that signalled fences are opportunistically filtered out, which
|
|
* means the iteration is potentially over no fence at all.
|
|
*/
|
|
#define dma_fence_unwrap_for_each(fence, cursor, head) \
|
|
for (fence = dma_fence_unwrap_first(head, cursor); fence; \
|
|
fence = dma_fence_unwrap_next(cursor)) \
|
|
if (!dma_fence_is_signaled(fence))
|
|
|
|
struct dma_fence *__dma_fence_unwrap_merge(unsigned int num_fences,
|
|
struct dma_fence **fences,
|
|
struct dma_fence_unwrap *cursors);
|
|
|
|
/**
|
|
* dma_fence_unwrap_merge - unwrap and merge fences
|
|
*
|
|
* All fences given as parameters are unwrapped and merged back together as flat
|
|
* dma_fence_array. Useful if multiple containers need to be merged together.
|
|
*
|
|
* Implemented as a macro to allocate the necessary arrays on the stack and
|
|
* account the stack frame size to the caller.
|
|
*
|
|
* Returns NULL on memory allocation failure, a dma_fence object representing
|
|
* all the given fences otherwise.
|
|
*/
|
|
#define dma_fence_unwrap_merge(...) \
|
|
({ \
|
|
struct dma_fence *__f[] = { __VA_ARGS__ }; \
|
|
struct dma_fence_unwrap __c[ARRAY_SIZE(__f)]; \
|
|
\
|
|
__dma_fence_unwrap_merge(ARRAY_SIZE(__f), __f, __c); \
|
|
})
|
|
|
|
#endif
|