Home | History | Annotate | Download | only in linux

Lines Matching defs:chain

35 #include <linux/dma-fence-chain.h>
44  * dma_fence_chain_init(chain, prev, fence, seqno)
46  *	Initialize a fence chain node.  If prev was already a chain,
47  *	extend it; otherwise; create a new chain context.
50 dma_fence_chain_init(struct dma_fence_chain *chain, struct dma_fence *prev,
56 	spin_lock_init(&chain->dfc_lock);
57 	chain->dfc_prev = prev;	  /* consume caller's reference */
58 	chain->dfc_fence = fence; /* consume caller's reference */
59 	init_irq_work(&chain->dfc_irq_work, &dma_fence_chain_irq_work);
66 		chain->prev_seqno = 0;
69 		chain->prev_seqno = prev->seqno;
72 	dma_fence_init(&chain->base, &dma_fence_chain_ops, &chain->dfc_lock,
93 	struct dma_fence_chain *chain = container_of(work,
96 	if (!dma_fence_chain_enable_signaling(&chain->base))
97 		dma_fence_signal(&chain->base);
98 	dma_fence_put(&chain->base);
104 	struct dma_fence_chain *chain = container_of(cb,
107 	irq_work_queue(&chain->dfc_irq_work);
114 	struct dma_fence_chain *chain = to_dma_fence_chain(fence);
118 	KASSERT(chain);
120 	dma_fence_get(&chain->base);
121 	dma_fence_chain_for_each(f, &chain->base) {
125 		if (dma_fence_add_callback(f, &chain->dfc_callback,
132 	dma_fence_put(&chain->base);
158 	struct dma_fence_chain *chain = to_dma_fence_chain(fence);
162 	KASSERT(chain);
166 	 * exclusive access to chain, so no need for atomics here.
168 	while ((prev = chain->dfc_prev) != NULL) {
171 		 * previous fence, or if it's not a chain, stop here.
184 		chain->dfc_prev = prev_chain->dfc_prev;
190 	dma_fence_put(chain->dfc_fence);
191 	spin_lock_destroy(&chain->dfc_lock);
192 	dma_fence_free(&chain->base);
207  *	If fence is nonnull and in a chain, return the chain.
220  * get_prev(chain)
222  *	Get the previous fence of the chain and add a reference, if
226 get_prev(struct dma_fence_chain *chain)
231 	prev = dma_fence_get_rcu_safe(&chain->dfc_prev);
240  *	Find the first unsignalled fence in the chain, or NULL if fence
241  *	is not a chain node or the chain's fences are all signalled.
247 	struct dma_fence_chain *chain, *prev_chain;
250 	if ((chain = to_dma_fence_chain(fence)) == NULL) {
255 	while ((prev = get_prev(chain)) != NULL) {
266 		if (atomic_cas_ptr(&chain->dfc_prev, prev, splice) == prev)
282  *	Otherwise, if fence is not on a chain or if its sequence
285  *	Otherwise, set fence to the first fence in the chain which
291 	struct dma_fence_chain *chain;
296 	chain = to_dma_fence_chain(*fencep);
297 	if (chain == NULL || chain->base.seqno < seqno)
300 	dma_fence_chain_for_each(*fencep, &chain->base) {
301 		if ((*fencep)->context != chain->base.context ||
307 	dma_fence_put(&chain->base);