2 * Copyright (C) 2012-2014 Canonical Ltd (Maarten Lankhorst)
4 * Based on bo.c which bears the following copyright notice,
5 * but is dual licensed:
7 * Copyright (c) 2006-2009 VMware, Inc., Palo Alto, CA., USA
10 * Permission is hereby granted, free of charge, to any person obtaining a
11 * copy of this software and associated documentation files (the
12 * "Software"), to deal in the Software without restriction, including
13 * without limitation the rights to use, copy, modify, merge, publish,
14 * distribute, sub license, and/or sell copies of the Software, and to
15 * permit persons to whom the Software is furnished to do so, subject to
16 * the following conditions:
18 * The above copyright notice and this permission notice (including the
19 * next paragraph) shall be included in all copies or substantial portions
22 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
23 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
24 * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
25 * THE COPYRIGHT HOLDERS, AUTHORS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM,
26 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
27 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
28 * USE OR OTHER DEALINGS IN THE SOFTWARE.
30 **************************************************************************/
32 * Authors: Thomas Hellstrom <thellstrom-at-vmware-dot-com>
35 #include <linux/dma-resv.h>
36 #include <linux/export.h>
38 #include <linux/sched/mm.h>
41 * DOC: Reservation Object Overview
43 * The reservation object provides a mechanism to manage shared and
44 * exclusive fences associated with a buffer. A reservation object
45 * can have attached one exclusive fence (normally associated with
46 * write operations) or N shared fences (read operations). The RCU
47 * mechanism is used to protect read access to fences from locked
51 DEFINE_WD_CLASS(reservation_ww_class);
52 EXPORT_SYMBOL(reservation_ww_class);
54 struct lock_class_key reservation_seqcount_class;
55 EXPORT_SYMBOL(reservation_seqcount_class);
57 const char reservation_seqcount_string[] = "reservation_seqcount";
58 EXPORT_SYMBOL(reservation_seqcount_string);
61 * dma_resv_list_alloc - allocate fence list
62 * @shared_max: number of fences we need space for
64 * Allocate a new dma_resv_list and make sure to correctly initialize
67 static struct dma_resv_list *dma_resv_list_alloc(unsigned int shared_max)
69 struct dma_resv_list *list;
71 list = kmalloc(offsetof(typeof(*list), shared[shared_max]), GFP_KERNEL);
75 list->shared_max = (ksize(list) - offsetof(typeof(*list), shared)) /
76 sizeof(*list->shared);
82 * dma_resv_list_free - free fence list
85 * Free a dma_resv_list and make sure to drop all references.
87 static void dma_resv_list_free(struct dma_resv_list *list)
94 for (i = 0; i < list->shared_count; ++i)
95 dma_fence_put(rcu_dereference_protected(list->shared[i], true));
100 #if IS_ENABLED(CONFIG_LOCKDEP)
101 static int __init dma_resv_lockdep(void)
103 struct mm_struct *mm = mm_alloc();
104 struct ww_acquire_ctx ctx;
114 ww_acquire_init(&ctx, &reservation_ww_class);
115 ret = dma_resv_lock(&obj, &ctx);
117 dma_resv_lock_slow(&obj, &ctx);
118 fs_reclaim_acquire(GFP_KERNEL);
119 fs_reclaim_release(GFP_KERNEL);
120 ww_mutex_unlock(&obj.lock);
121 ww_acquire_fini(&ctx);
122 mmap_read_unlock(mm);
128 subsys_initcall(dma_resv_lockdep);
132 * dma_resv_init - initialize a reservation object
133 * @obj: the reservation object
135 void dma_resv_init(struct dma_resv *obj)
137 ww_mutex_init(&obj->lock, &reservation_ww_class);
139 __seqcount_init(&obj->seq, reservation_seqcount_string,
140 &reservation_seqcount_class);
141 RCU_INIT_POINTER(obj->fence, NULL);
142 RCU_INIT_POINTER(obj->fence_excl, NULL);
144 EXPORT_SYMBOL(dma_resv_init);
147 * dma_resv_fini - destroys a reservation object
148 * @obj: the reservation object
150 void dma_resv_fini(struct dma_resv *obj)
152 struct dma_resv_list *fobj;
153 struct dma_fence *excl;
156 * This object should be dead and all references must have
157 * been released to it, so no need to be protected with rcu.
159 excl = rcu_dereference_protected(obj->fence_excl, 1);
163 fobj = rcu_dereference_protected(obj->fence, 1);
164 dma_resv_list_free(fobj);
165 ww_mutex_destroy(&obj->lock);
167 EXPORT_SYMBOL(dma_resv_fini);
170 * dma_resv_reserve_shared - Reserve space to add shared fences to
172 * @obj: reservation object
173 * @num_fences: number of fences we want to add
175 * Should be called before dma_resv_add_shared_fence(). Must
176 * be called with obj->lock held.
179 * Zero for success, or -errno
181 int dma_resv_reserve_shared(struct dma_resv *obj, unsigned int num_fences)
183 struct dma_resv_list *old, *new;
184 unsigned int i, j, k, max;
186 dma_resv_assert_held(obj);
188 old = dma_resv_get_list(obj);
190 if (old && old->shared_max) {
191 if ((old->shared_count + num_fences) <= old->shared_max)
194 max = max(old->shared_count + num_fences,
195 old->shared_max * 2);
200 new = dma_resv_list_alloc(max);
205 * no need to bump fence refcounts, rcu_read access
206 * requires the use of kref_get_unless_zero, and the
207 * references from the old struct are carried over to
210 for (i = 0, j = 0, k = max; i < (old ? old->shared_count : 0); ++i) {
211 struct dma_fence *fence;
213 fence = rcu_dereference_protected(old->shared[i],
215 if (dma_fence_is_signaled(fence))
216 RCU_INIT_POINTER(new->shared[--k], fence);
218 RCU_INIT_POINTER(new->shared[j++], fence);
220 new->shared_count = j;
223 * We are not changing the effective set of fences here so can
224 * merely update the pointer to the new array; both existing
225 * readers and new readers will see exactly the same set of
226 * active (unsignaled) shared fences. Individual fences and the
227 * old array are protected by RCU and so will not vanish under
228 * the gaze of the rcu_read_lock() readers.
230 rcu_assign_pointer(obj->fence, new);
235 /* Drop the references to the signaled fences */
236 for (i = k; i < max; ++i) {
237 struct dma_fence *fence;
239 fence = rcu_dereference_protected(new->shared[i],
241 dma_fence_put(fence);
247 EXPORT_SYMBOL(dma_resv_reserve_shared);
250 * dma_resv_add_shared_fence - Add a fence to a shared slot
251 * @obj: the reservation object
252 * @fence: the shared fence to add
254 * Add a fence to a shared slot, obj->lock must be held, and
255 * dma_resv_reserve_shared() has been called.
257 void dma_resv_add_shared_fence(struct dma_resv *obj, struct dma_fence *fence)
259 struct dma_resv_list *fobj;
260 struct dma_fence *old;
261 unsigned int i, count;
263 dma_fence_get(fence);
265 dma_resv_assert_held(obj);
267 fobj = dma_resv_get_list(obj);
268 count = fobj->shared_count;
271 write_seqcount_begin(&obj->seq);
273 for (i = 0; i < count; ++i) {
275 old = rcu_dereference_protected(fobj->shared[i],
277 if (old->context == fence->context ||
278 dma_fence_is_signaled(old))
282 BUG_ON(fobj->shared_count >= fobj->shared_max);
287 RCU_INIT_POINTER(fobj->shared[i], fence);
288 /* pointer update must be visible before we extend the shared_count */
289 smp_store_mb(fobj->shared_count, count);
291 write_seqcount_end(&obj->seq);
295 EXPORT_SYMBOL(dma_resv_add_shared_fence);
298 * dma_resv_add_excl_fence - Add an exclusive fence.
299 * @obj: the reservation object
300 * @fence: the shared fence to add
302 * Add a fence to the exclusive slot. The obj->lock must be held.
304 void dma_resv_add_excl_fence(struct dma_resv *obj, struct dma_fence *fence)
306 struct dma_fence *old_fence = dma_resv_get_excl(obj);
307 struct dma_resv_list *old;
310 dma_resv_assert_held(obj);
312 old = dma_resv_get_list(obj);
314 i = old->shared_count;
317 dma_fence_get(fence);
320 write_seqcount_begin(&obj->seq);
321 /* write_seqcount_begin provides the necessary memory barrier */
322 RCU_INIT_POINTER(obj->fence_excl, fence);
324 old->shared_count = 0;
325 write_seqcount_end(&obj->seq);
328 /* inplace update, no shared fences */
330 dma_fence_put(rcu_dereference_protected(old->shared[i],
331 dma_resv_held(obj)));
333 dma_fence_put(old_fence);
335 EXPORT_SYMBOL(dma_resv_add_excl_fence);
338 * dma_resv_copy_fences - Copy all fences from src to dst.
339 * @dst: the destination reservation object
340 * @src: the source reservation object
342 * Copy all fences from src to dst. dst-lock must be held.
344 int dma_resv_copy_fences(struct dma_resv *dst, struct dma_resv *src)
346 struct dma_resv_list *src_list, *dst_list;
347 struct dma_fence *old, *new;
350 dma_resv_assert_held(dst);
353 src_list = rcu_dereference(src->fence);
357 unsigned shared_count = src_list->shared_count;
361 dst_list = dma_resv_list_alloc(shared_count);
366 src_list = rcu_dereference(src->fence);
367 if (!src_list || src_list->shared_count > shared_count) {
372 dst_list->shared_count = 0;
373 for (i = 0; i < src_list->shared_count; ++i) {
374 struct dma_fence *fence;
376 fence = rcu_dereference(src_list->shared[i]);
377 if (test_bit(DMA_FENCE_FLAG_SIGNALED_BIT,
381 if (!dma_fence_get_rcu(fence)) {
382 dma_resv_list_free(dst_list);
383 src_list = rcu_dereference(src->fence);
387 if (dma_fence_is_signaled(fence)) {
388 dma_fence_put(fence);
392 rcu_assign_pointer(dst_list->shared[dst_list->shared_count++], fence);
398 new = dma_fence_get_rcu_safe(&src->fence_excl);
401 src_list = dma_resv_get_list(dst);
402 old = dma_resv_get_excl(dst);
405 write_seqcount_begin(&dst->seq);
406 /* write_seqcount_begin provides the necessary memory barrier */
407 RCU_INIT_POINTER(dst->fence_excl, new);
408 RCU_INIT_POINTER(dst->fence, dst_list);
409 write_seqcount_end(&dst->seq);
412 dma_resv_list_free(src_list);
417 EXPORT_SYMBOL(dma_resv_copy_fences);
420 * dma_resv_get_fences_rcu - Get an object's shared and exclusive
421 * fences without update side lock held
422 * @obj: the reservation object
423 * @pfence_excl: the returned exclusive fence (or NULL)
424 * @pshared_count: the number of shared fences returned
425 * @pshared: the array of shared fence ptrs returned (array is krealloc'd to
426 * the required size, and must be freed by caller)
428 * Retrieve all fences from the reservation object. If the pointer for the
429 * exclusive fence is not specified the fence is put into the array of the
430 * shared fences as well. Returns either zero or -ENOMEM.
432 int dma_resv_get_fences_rcu(struct dma_resv *obj,
433 struct dma_fence **pfence_excl,
434 unsigned *pshared_count,
435 struct dma_fence ***pshared)
437 struct dma_fence **shared = NULL;
438 struct dma_fence *fence_excl;
439 unsigned int shared_count;
443 struct dma_resv_list *fobj;
447 shared_count = i = 0;
450 seq = read_seqcount_begin(&obj->seq);
452 fence_excl = rcu_dereference(obj->fence_excl);
453 if (fence_excl && !dma_fence_get_rcu(fence_excl))
456 fobj = rcu_dereference(obj->fence);
458 sz += sizeof(*shared) * fobj->shared_max;
460 if (!pfence_excl && fence_excl)
461 sz += sizeof(*shared);
464 struct dma_fence **nshared;
466 nshared = krealloc(shared, sz,
467 GFP_NOWAIT | __GFP_NOWARN);
471 dma_fence_put(fence_excl);
474 nshared = krealloc(shared, sz, GFP_KERNEL);
484 shared_count = fobj ? fobj->shared_count : 0;
485 for (i = 0; i < shared_count; ++i) {
486 shared[i] = rcu_dereference(fobj->shared[i]);
487 if (!dma_fence_get_rcu(shared[i]))
492 if (i != shared_count || read_seqcount_retry(&obj->seq, seq)) {
494 dma_fence_put(shared[i]);
495 dma_fence_put(fence_excl);
505 *pfence_excl = fence_excl;
507 shared[shared_count++] = fence_excl;
514 *pshared_count = shared_count;
518 EXPORT_SYMBOL_GPL(dma_resv_get_fences_rcu);
521 * dma_resv_wait_timeout_rcu - Wait on reservation's objects
522 * shared and/or exclusive fences.
523 * @obj: the reservation object
524 * @wait_all: if true, wait on all fences, else wait on just exclusive fence
525 * @intr: if true, do interruptible wait
526 * @timeout: timeout value in jiffies or zero to return immediately
529 * Returns -ERESTARTSYS if interrupted, 0 if the wait timed out, or
530 * greater than zer on success.
532 long dma_resv_wait_timeout_rcu(struct dma_resv *obj,
533 bool wait_all, bool intr,
534 unsigned long timeout)
536 struct dma_fence *fence;
537 unsigned seq, shared_count;
538 long ret = timeout ? timeout : 1;
543 seq = read_seqcount_begin(&obj->seq);
547 fence = rcu_dereference(obj->fence_excl);
548 if (fence && !test_bit(DMA_FENCE_FLAG_SIGNALED_BIT, &fence->flags)) {
549 if (!dma_fence_get_rcu(fence))
552 if (dma_fence_is_signaled(fence)) {
553 dma_fence_put(fence);
562 struct dma_resv_list *fobj = rcu_dereference(obj->fence);
565 shared_count = fobj->shared_count;
567 for (i = 0; !fence && i < shared_count; ++i) {
568 struct dma_fence *lfence = rcu_dereference(fobj->shared[i]);
570 if (test_bit(DMA_FENCE_FLAG_SIGNALED_BIT,
574 if (!dma_fence_get_rcu(lfence))
577 if (dma_fence_is_signaled(lfence)) {
578 dma_fence_put(lfence);
589 if (read_seqcount_retry(&obj->seq, seq)) {
590 dma_fence_put(fence);
594 ret = dma_fence_wait_timeout(fence, intr, ret);
595 dma_fence_put(fence);
596 if (ret > 0 && wait_all && (i + 1 < shared_count))
605 EXPORT_SYMBOL_GPL(dma_resv_wait_timeout_rcu);
608 static inline int dma_resv_test_signaled_single(struct dma_fence *passed_fence)
610 struct dma_fence *fence, *lfence = passed_fence;
613 if (!test_bit(DMA_FENCE_FLAG_SIGNALED_BIT, &lfence->flags)) {
614 fence = dma_fence_get_rcu(lfence);
618 ret = !!dma_fence_is_signaled(fence);
619 dma_fence_put(fence);
625 * dma_resv_test_signaled_rcu - Test if a reservation object's
626 * fences have been signaled.
627 * @obj: the reservation object
628 * @test_all: if true, test all fences, otherwise only test the exclusive
632 * true if all fences signaled, else false
634 bool dma_resv_test_signaled_rcu(struct dma_resv *obj, bool test_all)
636 unsigned seq, shared_count;
643 seq = read_seqcount_begin(&obj->seq);
648 struct dma_resv_list *fobj = rcu_dereference(obj->fence);
651 shared_count = fobj->shared_count;
653 for (i = 0; i < shared_count; ++i) {
654 struct dma_fence *fence = rcu_dereference(fobj->shared[i]);
656 ret = dma_resv_test_signaled_single(fence);
663 if (read_seqcount_retry(&obj->seq, seq))
668 struct dma_fence *fence_excl = rcu_dereference(obj->fence_excl);
671 ret = dma_resv_test_signaled_single(fence_excl);
675 if (read_seqcount_retry(&obj->seq, seq))
683 EXPORT_SYMBOL_GPL(dma_resv_test_signaled_rcu);