Lines Matching defs:cb
1883 dma_fence_add_callback(struct dma_fence *fence, struct dma_fence_cb *cb,
1893 INIT_LIST_HEAD(&cb->node);
1911 cb->func = func;
1912 list_add_tail(&cb->node, &fence->cb_list);
1914 INIT_LIST_HEAD(&cb->node);
1921 dma_fence_remove_callback(struct dma_fence *fence, struct dma_fence_cb *cb)
1927 ret = !list_empty(&cb->node);
1929 list_del_init(&cb->node);
1950 dma_fence_default_wait_cb(struct dma_fence *fence, struct dma_fence_cb *cb)
1953 container_of(cb, struct default_wait_cb, base);
1963 struct default_wait_cb cb;
1991 cb.base.func = dma_fence_default_wait_cb;
1992 cb.proc = curproc;
1993 list_add(&cb.base.node, &fence->cb_list);
2007 if (!list_empty(&cb.base.node))
2008 list_del(&cb.base.node);
2036 struct default_wait_cb *cb;
2054 cb = mallocarray(count, sizeof(*cb), M_DRM, M_WAITOK|M_CANFAIL|M_ZERO);
2055 if (cb == NULL)
2060 cb[i].proc = curproc;
2061 if (dma_fence_add_callback(fence, &cb[i].base,
2082 dma_fence_remove_callback(fences[i], &cb[i].base);
2083 free(cb, M_DRM, count * sizeof(*cb));
2157 dma_fence_array_cb_func(struct dma_fence *f, struct dma_fence_cb *cb)
2160 container_of(cb, struct dma_fence_array_cb, cb);
2173 struct dma_fence_array_cb *cb = (void *)(&dfa[1]);
2177 cb[i].array = dfa;
2179 if (dma_fence_add_callback(dfa->fences[i], &cb[i].cb,
2358 dma_fence_chain_cb(struct dma_fence *f, struct dma_fence_cb *cb)
2361 container_of(cb, struct dma_fence_chain, cb);
2383 if (!dma_fence_add_callback(f, &h->cb, dma_fence_chain_cb)) {