2 * Copyright © 2008-2015 Intel Corporation
4 * Permission is hereby granted, free of charge, to any person obtaining a
5 * copy of this software and associated documentation files (the "Software"),
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
11 * The above copyright notice and this permission notice (including the next
12 * paragraph) shall be included in all copies or substantial portions of the
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
18 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
20 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
25 #include <linux/dma-fence-array.h>
26 #include <linux/dma-fence-chain.h>
27 #include <linux/irq_work.h>
28 #include <linux/prefetch.h>
29 #include <linux/sched.h>
30 #include <linux/sched/clock.h>
31 #include <linux/sched/signal.h>
33 #include "gem/i915_gem_context.h"
34 #include "gt/intel_context.h"
35 #include "gt/intel_ring.h"
36 #include "gt/intel_rps.h"
38 #include "i915_active.h"
40 #include "i915_globals.h"
41 #include "i915_trace.h"
45 struct list_head link;
47 struct i915_sw_fence *fence;
48 void (*hook)(struct i915_request *rq, struct dma_fence *signal);
49 struct i915_request *signal;
52 static struct i915_global_request {
53 struct i915_global base;
54 struct kmem_cache *slab_requests;
55 struct kmem_cache *slab_execute_cbs;
58 static const char *i915_fence_get_driver_name(struct dma_fence *fence)
60 return dev_name(to_request(fence)->i915->drm.dev);
63 static const char *i915_fence_get_timeline_name(struct dma_fence *fence)
65 const struct i915_gem_context *ctx;
68 * The timeline struct (as part of the ppgtt underneath a context)
69 * may be freed when the request is no longer in use by the GPU.
70 * We could extend the life of a context to beyond that of all
71 * fences, possibly keeping the hw resource around indefinitely,
72 * or we just give them a false name. Since
73 * dma_fence_ops.get_timeline_name is a debug feature, the occasional
74 * lie seems justifiable.
76 if (test_bit(DMA_FENCE_FLAG_SIGNALED_BIT, &fence->flags))
79 ctx = i915_request_gem_context(to_request(fence));
81 return "[" DRIVER_NAME "]";
86 static bool i915_fence_signaled(struct dma_fence *fence)
88 return i915_request_completed(to_request(fence));
91 static bool i915_fence_enable_signaling(struct dma_fence *fence)
93 return i915_request_enable_breadcrumb(to_request(fence));
96 static signed long i915_fence_wait(struct dma_fence *fence,
100 return i915_request_wait(to_request(fence),
101 interruptible | I915_WAIT_PRIORITY,
105 struct kmem_cache *i915_request_slab_cache(void)
107 return global.slab_requests;
110 static void i915_fence_release(struct dma_fence *fence)
112 struct i915_request *rq = to_request(fence);
115 * The request is put onto a RCU freelist (i.e. the address
116 * is immediately reused), mark the fences as being freed now.
117 * Otherwise the debugobjects for the fences are only marked as
118 * freed when the slab cache itself is freed, and so we would get
119 * caught trying to reuse dead objects.
121 i915_sw_fence_fini(&rq->submit);
122 i915_sw_fence_fini(&rq->semaphore);
125 * Keep one request on each engine for reserved use under mempressure
127 * We do not hold a reference to the engine here and so have to be
128 * very careful in what rq->engine we poke. The virtual engine is
129 * referenced via the rq->context and we released that ref during
130 * i915_request_retire(), ergo we must not dereference a virtual
131 * engine here. Not that we would want to, as the only consumer of
132 * the reserved engine->request_pool is the power management parking,
133 * which must-not-fail, and that is only run on the physical engines.
135 * Since the request must have been executed to be have completed,
136 * we know that it will have been processed by the HW and will
137 * not be unsubmitted again, so rq->engine and rq->execution_mask
138 * at this point is stable. rq->execution_mask will be a single
139 * bit if the last and _only_ engine it could execution on was a
140 * physical engine, if it's multiple bits then it started on and
141 * could still be on a virtual engine. Thus if the mask is not a
142 * power-of-two we assume that rq->engine may still be a virtual
143 * engine and so a dangling invalid pointer that we cannot dereference
145 * For example, consider the flow of a bonded request through a virtual
146 * engine. The request is created with a wide engine mask (all engines
147 * that we might execute on). On processing the bond, the request mask
148 * is reduced to one or more engines. If the request is subsequently
149 * bound to a single engine, it will then be constrained to only
150 * execute on that engine and never returned to the virtual engine
151 * after timeslicing away, see __unwind_incomplete_requests(). Thus we
152 * know that if the rq->execution_mask is a single bit, rq->engine
153 * can be a physical engine with the exact corresponding mask.
155 if (is_power_of_2(rq->execution_mask) &&
156 !cmpxchg(&rq->engine->request_pool, NULL, rq))
159 kmem_cache_free(global.slab_requests, rq);
162 const struct dma_fence_ops i915_fence_ops = {
163 .get_driver_name = i915_fence_get_driver_name,
164 .get_timeline_name = i915_fence_get_timeline_name,
165 .enable_signaling = i915_fence_enable_signaling,
166 .signaled = i915_fence_signaled,
167 .wait = i915_fence_wait,
168 .release = i915_fence_release,
171 static void irq_execute_cb(struct irq_work *wrk)
173 struct execute_cb *cb = container_of(wrk, typeof(*cb), work);
175 i915_sw_fence_complete(cb->fence);
176 kmem_cache_free(global.slab_execute_cbs, cb);
179 static void irq_execute_cb_hook(struct irq_work *wrk)
181 struct execute_cb *cb = container_of(wrk, typeof(*cb), work);
183 cb->hook(container_of(cb->fence, struct i915_request, submit),
185 i915_request_put(cb->signal);
190 static void __notify_execute_cb(struct i915_request *rq)
192 struct execute_cb *cb;
194 lockdep_assert_held(&rq->lock);
196 if (list_empty(&rq->execute_cb))
199 list_for_each_entry(cb, &rq->execute_cb, link)
200 irq_work_queue(&cb->work);
203 * XXX Rollback on __i915_request_unsubmit()
205 * In the future, perhaps when we have an active time-slicing scheduler,
206 * it will be interesting to unsubmit parallel execution and remove
207 * busywaits from the GPU until their master is restarted. This is
208 * quite hairy, we have to carefully rollback the fence and do a
209 * preempt-to-idle cycle on the target engine, all the while the
210 * master execute_cb may refire.
212 INIT_LIST_HEAD(&rq->execute_cb);
216 remove_from_client(struct i915_request *request)
218 struct drm_i915_file_private *file_priv;
220 if (!READ_ONCE(request->file_priv))
224 file_priv = xchg(&request->file_priv, NULL);
226 spin_lock(&file_priv->mm.lock);
227 list_del(&request->client_link);
228 spin_unlock(&file_priv->mm.lock);
233 static void free_capture_list(struct i915_request *request)
235 struct i915_capture_list *capture;
237 capture = fetch_and_zero(&request->capture_list);
239 struct i915_capture_list *next = capture->next;
246 static void __i915_request_fill(struct i915_request *rq, u8 val)
248 void *vaddr = rq->ring->vaddr;
252 if (rq->postfix < head) {
253 memset(vaddr + head, val, rq->ring->size - head);
256 memset(vaddr + head, val, rq->postfix - head);
259 static void remove_from_engine(struct i915_request *rq)
261 struct intel_engine_cs *engine, *locked;
264 * Virtual engines complicate acquiring the engine timeline lock,
265 * as their rq->engine pointer is not stable until under that
266 * engine lock. The simple ploy we use is to take the lock then
267 * check that the rq still belongs to the newly locked engine.
269 locked = READ_ONCE(rq->engine);
270 spin_lock_irq(&locked->active.lock);
271 while (unlikely(locked != (engine = READ_ONCE(rq->engine)))) {
272 spin_unlock(&locked->active.lock);
273 spin_lock(&engine->active.lock);
276 list_del_init(&rq->sched.link);
277 clear_bit(I915_FENCE_FLAG_PQUEUE, &rq->fence.flags);
278 clear_bit(I915_FENCE_FLAG_HOLD, &rq->fence.flags);
279 spin_unlock_irq(&locked->active.lock);
282 bool i915_request_retire(struct i915_request *rq)
284 if (!i915_request_completed(rq))
289 GEM_BUG_ON(!i915_sw_fence_signaled(&rq->submit));
290 trace_i915_request_retire(rq);
293 * We know the GPU must have read the request to have
294 * sent us the seqno + interrupt, so use the position
295 * of tail of the request to update the last known position
298 * Note this requires that we are always called in request
301 GEM_BUG_ON(!list_is_first(&rq->link,
302 &i915_request_timeline(rq)->requests));
303 if (IS_ENABLED(CONFIG_DRM_I915_DEBUG_GEM))
304 /* Poison before we release our space in the ring */
305 __i915_request_fill(rq, POISON_FREE);
306 rq->ring->head = rq->postfix;
309 * We only loosely track inflight requests across preemption,
310 * and so we may find ourselves attempting to retire a _completed_
311 * request that we have removed from the HW and put back on a run
314 remove_from_engine(rq);
316 spin_lock_irq(&rq->lock);
317 i915_request_mark_complete(rq);
318 if (!i915_request_signaled(rq))
319 dma_fence_signal_locked(&rq->fence);
320 if (test_bit(DMA_FENCE_FLAG_ENABLE_SIGNAL_BIT, &rq->fence.flags))
321 i915_request_cancel_breadcrumb(rq);
322 if (i915_request_has_waitboost(rq)) {
323 GEM_BUG_ON(!atomic_read(&rq->engine->gt->rps.num_waiters));
324 atomic_dec(&rq->engine->gt->rps.num_waiters);
326 if (!test_bit(I915_FENCE_FLAG_ACTIVE, &rq->fence.flags)) {
327 set_bit(I915_FENCE_FLAG_ACTIVE, &rq->fence.flags);
328 __notify_execute_cb(rq);
330 GEM_BUG_ON(!list_empty(&rq->execute_cb));
331 spin_unlock_irq(&rq->lock);
333 remove_from_client(rq);
334 __list_del_entry(&rq->link); /* poison neither prev/next (RCU walks) */
336 intel_context_exit(rq->context);
337 intel_context_unpin(rq->context);
339 free_capture_list(rq);
340 i915_sched_node_fini(&rq->sched);
341 i915_request_put(rq);
346 void i915_request_retire_upto(struct i915_request *rq)
348 struct intel_timeline * const tl = i915_request_timeline(rq);
349 struct i915_request *tmp;
353 GEM_BUG_ON(!i915_request_completed(rq));
356 tmp = list_first_entry(&tl->requests, typeof(*tmp), link);
357 } while (i915_request_retire(tmp) && tmp != rq);
360 static struct i915_request * const *
361 __engine_active(struct intel_engine_cs *engine)
363 return READ_ONCE(engine->execlists.active);
366 static bool __request_in_flight(const struct i915_request *signal)
368 struct i915_request * const *port, *rq;
369 bool inflight = false;
371 if (!i915_request_is_ready(signal))
375 * Even if we have unwound the request, it may still be on
376 * the GPU (preempt-to-busy). If that request is inside an
377 * unpreemptible critical section, it will not be removed. Some
378 * GPU functions may even be stuck waiting for the paired request
379 * (__await_execution) to be submitted and cannot be preempted
380 * until the bond is executing.
382 * As we know that there are always preemption points between
383 * requests, we know that only the currently executing request
384 * may be still active even though we have cleared the flag.
385 * However, we can't rely on our tracking of ELSP[0] to known
386 * which request is currently active and so maybe stuck, as
387 * the tracking maybe an event behind. Instead assume that
388 * if the context is still inflight, then it is still active
389 * even if the active flag has been cleared.
391 if (!intel_context_inflight(signal->context))
395 for (port = __engine_active(signal->engine); (rq = *port); port++) {
396 if (rq->context == signal->context) {
397 inflight = i915_seqno_passed(rq->fence.seqno,
398 signal->fence.seqno);
408 __await_execution(struct i915_request *rq,
409 struct i915_request *signal,
410 void (*hook)(struct i915_request *rq,
411 struct dma_fence *signal),
414 struct execute_cb *cb;
416 if (i915_request_is_active(signal)) {
418 hook(rq, &signal->fence);
422 cb = kmem_cache_alloc(global.slab_execute_cbs, gfp);
426 cb->fence = &rq->submit;
427 i915_sw_fence_await(cb->fence);
428 init_irq_work(&cb->work, irq_execute_cb);
432 cb->signal = i915_request_get(signal);
433 cb->work.func = irq_execute_cb_hook;
436 spin_lock_irq(&signal->lock);
437 if (i915_request_is_active(signal) || __request_in_flight(signal)) {
439 hook(rq, &signal->fence);
440 i915_request_put(signal);
442 i915_sw_fence_complete(cb->fence);
443 kmem_cache_free(global.slab_execute_cbs, cb);
445 list_add_tail(&cb->link, &signal->execute_cb);
447 spin_unlock_irq(&signal->lock);
452 static bool fatal_error(int error)
455 case 0: /* not an error! */
456 case -EAGAIN: /* innocent victim of a GT reset (__i915_request_reset) */
457 case -ETIMEDOUT: /* waiting for Godot (timer_i915_sw_fence_wake) */
464 void __i915_request_skip(struct i915_request *rq)
466 GEM_BUG_ON(!fatal_error(rq->fence.error));
468 if (rq->infix == rq->postfix)
472 * As this request likely depends on state from the lost
473 * context, clear out all the user operations leaving the
474 * breadcrumb at the end (so we get the fence notifications).
476 __i915_request_fill(rq, 0);
477 rq->infix = rq->postfix;
480 void i915_request_set_error_once(struct i915_request *rq, int error)
484 GEM_BUG_ON(!IS_ERR_VALUE((long)error));
486 if (i915_request_signaled(rq))
489 old = READ_ONCE(rq->fence.error);
491 if (fatal_error(old))
493 } while (!try_cmpxchg(&rq->fence.error, &old, error));
496 bool __i915_request_submit(struct i915_request *request)
498 struct intel_engine_cs *engine = request->engine;
501 RQ_TRACE(request, "\n");
503 GEM_BUG_ON(!irqs_disabled());
504 lockdep_assert_held(&engine->active.lock);
507 * With the advent of preempt-to-busy, we frequently encounter
508 * requests that we have unsubmitted from HW, but left running
509 * until the next ack and so have completed in the meantime. On
510 * resubmission of that completed request, we can skip
511 * updating the payload, and execlists can even skip submitting
514 * We must remove the request from the caller's priority queue,
515 * and the caller must only call us when the request is in their
516 * priority queue, under the active.lock. This ensures that the
517 * request has *not* yet been retired and we can safely move
518 * the request into the engine->active.list where it will be
519 * dropped upon retiring. (Otherwise if resubmit a *retired*
520 * request, this would be a horrible use-after-free.)
522 if (i915_request_completed(request))
525 if (unlikely(intel_context_is_banned(request->context)))
526 i915_request_set_error_once(request, -EIO);
527 if (unlikely(fatal_error(request->fence.error)))
528 __i915_request_skip(request);
531 * Are we using semaphores when the gpu is already saturated?
533 * Using semaphores incurs a cost in having the GPU poll a
534 * memory location, busywaiting for it to change. The continual
535 * memory reads can have a noticeable impact on the rest of the
536 * system with the extra bus traffic, stalling the cpu as it too
537 * tries to access memory across the bus (perf stat -e bus-cycles).
539 * If we installed a semaphore on this request and we only submit
540 * the request after the signaler completed, that indicates the
541 * system is overloaded and using semaphores at this time only
542 * increases the amount of work we are doing. If so, we disable
543 * further use of semaphores until we are idle again, whence we
544 * optimistically try again.
546 if (request->sched.semaphores &&
547 i915_sw_fence_signaled(&request->semaphore))
548 engine->saturated |= request->sched.semaphores;
550 engine->emit_fini_breadcrumb(request,
551 request->ring->vaddr + request->postfix);
553 trace_i915_request_execute(request);
557 xfer: /* We may be recursing from the signal callback of another i915 fence */
558 spin_lock_nested(&request->lock, SINGLE_DEPTH_NESTING);
560 if (!test_and_set_bit(I915_FENCE_FLAG_ACTIVE, &request->fence.flags)) {
561 list_move_tail(&request->sched.link, &engine->active.requests);
562 clear_bit(I915_FENCE_FLAG_PQUEUE, &request->fence.flags);
565 if (test_bit(DMA_FENCE_FLAG_ENABLE_SIGNAL_BIT, &request->fence.flags) &&
566 !test_bit(DMA_FENCE_FLAG_SIGNALED_BIT, &request->fence.flags) &&
567 !i915_request_enable_breadcrumb(request))
568 intel_engine_signal_breadcrumbs(engine);
570 __notify_execute_cb(request);
572 spin_unlock(&request->lock);
577 void i915_request_submit(struct i915_request *request)
579 struct intel_engine_cs *engine = request->engine;
582 /* Will be called from irq-context when using foreign fences. */
583 spin_lock_irqsave(&engine->active.lock, flags);
585 __i915_request_submit(request);
587 spin_unlock_irqrestore(&engine->active.lock, flags);
590 void __i915_request_unsubmit(struct i915_request *request)
592 struct intel_engine_cs *engine = request->engine;
594 RQ_TRACE(request, "\n");
596 GEM_BUG_ON(!irqs_disabled());
597 lockdep_assert_held(&engine->active.lock);
600 * Only unwind in reverse order, required so that the per-context list
601 * is kept in seqno/ring order.
604 /* We may be recursing from the signal callback of another i915 fence */
605 spin_lock_nested(&request->lock, SINGLE_DEPTH_NESTING);
607 if (test_bit(DMA_FENCE_FLAG_ENABLE_SIGNAL_BIT, &request->fence.flags))
608 i915_request_cancel_breadcrumb(request);
610 GEM_BUG_ON(!test_bit(I915_FENCE_FLAG_ACTIVE, &request->fence.flags));
611 clear_bit(I915_FENCE_FLAG_ACTIVE, &request->fence.flags);
613 spin_unlock(&request->lock);
615 /* We've already spun, don't charge on resubmitting. */
616 if (request->sched.semaphores && i915_request_started(request))
617 request->sched.semaphores = 0;
620 * We don't need to wake_up any waiters on request->execute, they
621 * will get woken by any other event or us re-adding this request
622 * to the engine timeline (__i915_request_submit()). The waiters
623 * should be quite adapt at finding that the request now has a new
624 * global_seqno to the one they went to sleep on.
628 void i915_request_unsubmit(struct i915_request *request)
630 struct intel_engine_cs *engine = request->engine;
633 /* Will be called from irq-context when using foreign fences. */
634 spin_lock_irqsave(&engine->active.lock, flags);
636 __i915_request_unsubmit(request);
638 spin_unlock_irqrestore(&engine->active.lock, flags);
641 static int __i915_sw_fence_call
642 submit_notify(struct i915_sw_fence *fence, enum i915_sw_fence_notify state)
644 struct i915_request *request =
645 container_of(fence, typeof(*request), submit);
649 trace_i915_request_submit(request);
651 if (unlikely(fence->error))
652 i915_request_set_error_once(request, fence->error);
655 * We need to serialize use of the submit_request() callback
656 * with its hotplugging performed during an emergency
657 * i915_gem_set_wedged(). We use the RCU mechanism to mark the
658 * critical section in order to force i915_gem_set_wedged() to
659 * wait until the submit_request() is completed before
663 request->engine->submit_request(request);
668 i915_request_put(request);
675 static int __i915_sw_fence_call
676 semaphore_notify(struct i915_sw_fence *fence, enum i915_sw_fence_notify state)
678 struct i915_request *rq = container_of(fence, typeof(*rq), semaphore);
685 i915_request_put(rq);
692 static void retire_requests(struct intel_timeline *tl)
694 struct i915_request *rq, *rn;
696 list_for_each_entry_safe(rq, rn, &tl->requests, link)
697 if (!i915_request_retire(rq))
701 static noinline struct i915_request *
702 request_alloc_slow(struct intel_timeline *tl,
703 struct i915_request **rsvd,
706 struct i915_request *rq;
708 /* If we cannot wait, dip into our reserves */
709 if (!gfpflags_allow_blocking(gfp)) {
710 rq = xchg(rsvd, NULL);
711 if (!rq) /* Use the normal failure path for one final WARN */
717 if (list_empty(&tl->requests))
720 /* Move our oldest request to the slab-cache (if not in use!) */
721 rq = list_first_entry(&tl->requests, typeof(*rq), link);
722 i915_request_retire(rq);
724 rq = kmem_cache_alloc(global.slab_requests,
725 gfp | __GFP_RETRY_MAYFAIL | __GFP_NOWARN);
729 /* Ratelimit ourselves to prevent oom from malicious clients */
730 rq = list_last_entry(&tl->requests, typeof(*rq), link);
731 cond_synchronize_rcu(rq->rcustate);
733 /* Retire our old requests in the hope that we free some */
737 return kmem_cache_alloc(global.slab_requests, gfp);
740 static void __i915_request_ctor(void *arg)
742 struct i915_request *rq = arg;
744 spin_lock_init(&rq->lock);
745 i915_sched_node_init(&rq->sched);
746 i915_sw_fence_init(&rq->submit, submit_notify);
747 i915_sw_fence_init(&rq->semaphore, semaphore_notify);
749 dma_fence_init(&rq->fence, &i915_fence_ops, &rq->lock, 0, 0);
751 rq->file_priv = NULL;
752 rq->capture_list = NULL;
754 INIT_LIST_HEAD(&rq->execute_cb);
757 struct i915_request *
758 __i915_request_create(struct intel_context *ce, gfp_t gfp)
760 struct intel_timeline *tl = ce->timeline;
761 struct i915_request *rq;
765 might_sleep_if(gfpflags_allow_blocking(gfp));
767 /* Check that the caller provided an already pinned context */
768 __intel_context_pin(ce);
771 * Beware: Dragons be flying overhead.
773 * We use RCU to look up requests in flight. The lookups may
774 * race with the request being allocated from the slab freelist.
775 * That is the request we are writing to here, may be in the process
776 * of being read by __i915_active_request_get_rcu(). As such,
777 * we have to be very careful when overwriting the contents. During
778 * the RCU lookup, we change chase the request->engine pointer,
779 * read the request->global_seqno and increment the reference count.
781 * The reference count is incremented atomically. If it is zero,
782 * the lookup knows the request is unallocated and complete. Otherwise,
783 * it is either still in use, or has been reallocated and reset
784 * with dma_fence_init(). This increment is safe for release as we
785 * check that the request we have a reference to and matches the active
788 * Before we increment the refcount, we chase the request->engine
789 * pointer. We must not call kmem_cache_zalloc() or else we set
790 * that pointer to NULL and cause a crash during the lookup. If
791 * we see the request is completed (based on the value of the
792 * old engine and seqno), the lookup is complete and reports NULL.
793 * If we decide the request is not completed (new engine or seqno),
794 * then we grab a reference and double check that it is still the
795 * active request - which it won't be and restart the lookup.
797 * Do not use kmem_cache_zalloc() here!
799 rq = kmem_cache_alloc(global.slab_requests,
800 gfp | __GFP_RETRY_MAYFAIL | __GFP_NOWARN);
802 rq = request_alloc_slow(tl, &ce->engine->request_pool, gfp);
809 rq->i915 = ce->engine->i915;
811 rq->engine = ce->engine;
813 rq->execution_mask = ce->engine->mask;
815 kref_init(&rq->fence.refcount);
818 INIT_LIST_HEAD(&rq->fence.cb_list);
820 ret = intel_timeline_get_seqno(tl, rq, &seqno);
824 rq->fence.context = tl->fence_context;
825 rq->fence.seqno = seqno;
827 RCU_INIT_POINTER(rq->timeline, tl);
828 RCU_INIT_POINTER(rq->hwsp_cacheline, tl->hwsp_cacheline);
829 rq->hwsp_seqno = tl->hwsp_seqno;
830 GEM_BUG_ON(i915_request_completed(rq));
832 rq->rcustate = get_state_synchronize_rcu(); /* acts as smp_mb() */
834 /* We bump the ref for the fence chain */
835 i915_sw_fence_reinit(&i915_request_get(rq)->submit);
836 i915_sw_fence_reinit(&i915_request_get(rq)->semaphore);
838 i915_sched_node_reinit(&rq->sched);
840 /* No zalloc, everything must be cleared after use */
842 GEM_BUG_ON(rq->file_priv);
843 GEM_BUG_ON(rq->capture_list);
844 GEM_BUG_ON(!list_empty(&rq->execute_cb));
847 * Reserve space in the ring buffer for all the commands required to
848 * eventually emit this request. This is to guarantee that the
849 * i915_request_add() call can't fail. Note that the reserve may need
850 * to be redone if the request is not actually submitted straight
851 * away, e.g. because a GPU scheduler has deferred it.
853 * Note that due to how we add reserved_space to intel_ring_begin()
854 * we need to double our request to ensure that if we need to wrap
855 * around inside i915_request_add() there is sufficient space at
856 * the beginning of the ring as well.
859 2 * rq->engine->emit_fini_breadcrumb_dw * sizeof(u32);
862 * Record the position of the start of the request so that
863 * should we detect the updated seqno part-way through the
864 * GPU processing the request, we never over-estimate the
865 * position of the head.
867 rq->head = rq->ring->emit;
869 ret = rq->engine->request_alloc(rq);
873 rq->infix = rq->ring->emit; /* end of header; start of user payload */
875 intel_context_mark_active(ce);
876 list_add_tail_rcu(&rq->link, &tl->requests);
881 ce->ring->emit = rq->head;
883 /* Make sure we didn't add ourselves to external state before freeing */
884 GEM_BUG_ON(!list_empty(&rq->sched.signalers_list));
885 GEM_BUG_ON(!list_empty(&rq->sched.waiters_list));
888 kmem_cache_free(global.slab_requests, rq);
890 intel_context_unpin(ce);
894 struct i915_request *
895 i915_request_create(struct intel_context *ce)
897 struct i915_request *rq;
898 struct intel_timeline *tl;
900 tl = intel_context_timeline_lock(ce);
904 /* Move our oldest request to the slab-cache (if not in use!) */
905 rq = list_first_entry(&tl->requests, typeof(*rq), link);
906 if (!list_is_last(&rq->link, &tl->requests))
907 i915_request_retire(rq);
909 intel_context_enter(ce);
910 rq = __i915_request_create(ce, GFP_KERNEL);
911 intel_context_exit(ce); /* active reference transferred to request */
915 /* Check that we do not interrupt ourselves with a new request */
916 rq->cookie = lockdep_pin_lock(&tl->mutex);
921 intel_context_timeline_unlock(tl);
926 i915_request_await_start(struct i915_request *rq, struct i915_request *signal)
928 struct dma_fence *fence;
931 if (i915_request_timeline(rq) == rcu_access_pointer(signal->timeline))
934 if (i915_request_started(signal))
939 spin_lock_irq(&signal->lock);
941 struct list_head *pos = READ_ONCE(signal->link.prev);
942 struct i915_request *prev;
944 /* Confirm signal has not been retired, the link is valid */
945 if (unlikely(i915_request_started(signal)))
948 /* Is signal the earliest request on its timeline? */
949 if (pos == &rcu_dereference(signal->timeline)->requests)
953 * Peek at the request before us in the timeline. That
954 * request will only be valid before it is retired, so
955 * after acquiring a reference to it, confirm that it is
956 * still part of the signaler's timeline.
958 prev = list_entry(pos, typeof(*prev), link);
959 if (!i915_request_get_rcu(prev))
962 /* After the strong barrier, confirm prev is still attached */
963 if (unlikely(READ_ONCE(prev->link.next) != &signal->link)) {
964 i915_request_put(prev);
968 fence = &prev->fence;
970 spin_unlock_irq(&signal->lock);
976 if (!intel_timeline_sync_is_later(i915_request_timeline(rq), fence))
977 err = i915_sw_fence_await_dma_fence(&rq->submit,
980 dma_fence_put(fence);
985 static intel_engine_mask_t
986 already_busywaiting(struct i915_request *rq)
989 * Polling a semaphore causes bus traffic, delaying other users of
990 * both the GPU and CPU. We want to limit the impact on others,
991 * while taking advantage of early submission to reduce GPU
992 * latency. Therefore we restrict ourselves to not using more
993 * than one semaphore from each source, and not using a semaphore
994 * if we have detected the engine is saturated (i.e. would not be
995 * submitted early and cause bus traffic reading an already passed
998 * See the are-we-too-late? check in __i915_request_submit().
1000 return rq->sched.semaphores | READ_ONCE(rq->engine->saturated);
1004 __emit_semaphore_wait(struct i915_request *to,
1005 struct i915_request *from,
1008 const int has_token = INTEL_GEN(to->i915) >= 12;
1013 GEM_BUG_ON(INTEL_GEN(to->i915) < 8);
1014 GEM_BUG_ON(i915_request_has_initial_breadcrumb(to));
1016 /* We need to pin the signaler's HWSP until we are finished reading. */
1017 err = intel_timeline_read_hwsp(from, to, &hwsp_offset);
1025 cs = intel_ring_begin(to, len);
1030 * Using greater-than-or-equal here means we have to worry
1031 * about seqno wraparound. To side step that issue, we swap
1032 * the timeline HWSP upon wrapping, so that everyone listening
1033 * for the old (pre-wrap) values do not see the much smaller
1034 * (post-wrap) values than they were expecting (and so wait
1037 *cs++ = (MI_SEMAPHORE_WAIT |
1038 MI_SEMAPHORE_GLOBAL_GTT |
1040 MI_SEMAPHORE_SAD_GTE_SDD) +
1043 *cs++ = hwsp_offset;
1050 intel_ring_advance(to, cs);
1055 emit_semaphore_wait(struct i915_request *to,
1056 struct i915_request *from,
1059 const intel_engine_mask_t mask = READ_ONCE(from->engine)->mask;
1060 struct i915_sw_fence *wait = &to->submit;
1062 if (!intel_context_use_semaphores(to->context))
1065 if (i915_request_has_initial_breadcrumb(to))
1068 if (!rcu_access_pointer(from->hwsp_cacheline))
1072 * If this or its dependents are waiting on an external fence
1073 * that may fail catastrophically, then we want to avoid using
1074 * sempahores as they bypass the fence signaling metadata, and we
1075 * lose the fence->error propagation.
1077 if (from->sched.flags & I915_SCHED_HAS_EXTERNAL_CHAIN)
1080 /* Just emit the first semaphore we see as request space is limited. */
1081 if (already_busywaiting(to) & mask)
1084 if (i915_request_await_start(to, from) < 0)
1087 /* Only submit our spinner after the signaler is running! */
1088 if (__await_execution(to, from, NULL, gfp))
1091 if (__emit_semaphore_wait(to, from, from->fence.seqno))
1094 to->sched.semaphores |= mask;
1095 wait = &to->semaphore;
1098 return i915_sw_fence_await_dma_fence(wait,
1103 static bool intel_timeline_sync_has_start(struct intel_timeline *tl,
1104 struct dma_fence *fence)
1106 return __intel_timeline_sync_is_later(tl,
1111 static int intel_timeline_sync_set_start(struct intel_timeline *tl,
1112 const struct dma_fence *fence)
1114 return __intel_timeline_sync_set(tl, fence->context, fence->seqno - 1);
1118 __i915_request_await_execution(struct i915_request *to,
1119 struct i915_request *from,
1120 void (*hook)(struct i915_request *rq,
1121 struct dma_fence *signal))
1125 GEM_BUG_ON(intel_context_is_barrier(from->context));
1127 /* Submit both requests at the same time */
1128 err = __await_execution(to, from, hook, I915_FENCE_GFP);
1132 /* Squash repeated depenendices to the same timelines */
1133 if (intel_timeline_sync_has_start(i915_request_timeline(to),
1138 * Wait until the start of this request.
1140 * The execution cb fires when we submit the request to HW. But in
1141 * many cases this may be long before the request itself is ready to
1142 * run (consider that we submit 2 requests for the same context, where
1143 * the request of interest is behind an indefinite spinner). So we hook
1144 * up to both to reduce our queues and keep the execution lag minimised
1145 * in the worst case, though we hope that the await_start is elided.
1147 err = i915_request_await_start(to, from);
1152 * Ensure both start together [after all semaphores in signal]
1154 * Now that we are queued to the HW at roughly the same time (thanks
1155 * to the execute cb) and are ready to run at roughly the same time
1156 * (thanks to the await start), our signaler may still be indefinitely
1157 * delayed by waiting on a semaphore from a remote engine. If our
1158 * signaler depends on a semaphore, so indirectly do we, and we do not
1159 * want to start our payload until our signaler also starts theirs.
1162 * However, there is also a second condition for which we need to wait
1163 * for the precise start of the signaler. Consider that the signaler
1164 * was submitted in a chain of requests following another context
1165 * (with just an ordinary intra-engine fence dependency between the
1166 * two). In this case the signaler is queued to HW, but not for
1167 * immediate execution, and so we must wait until it reaches the
1170 if (intel_engine_has_semaphores(to->engine) &&
1171 !i915_request_has_initial_breadcrumb(to)) {
1172 err = __emit_semaphore_wait(to, from, from->fence.seqno - 1);
1177 /* Couple the dependency tree for PI on this exposed to->fence */
1178 if (to->engine->schedule) {
1179 err = i915_sched_node_add_dependency(&to->sched,
1181 I915_DEPENDENCY_WEAK);
1186 return intel_timeline_sync_set_start(i915_request_timeline(to),
1190 static void mark_external(struct i915_request *rq)
1193 * The downside of using semaphores is that we lose metadata passing
1194 * along the signaling chain. This is particularly nasty when we
1195 * need to pass along a fatal error such as EFAULT or EDEADLK. For
1196 * fatal errors we want to scrub the request before it is executed,
1197 * which means that we cannot preload the request onto HW and have
1198 * it wait upon a semaphore.
1200 rq->sched.flags |= I915_SCHED_HAS_EXTERNAL_CHAIN;
1204 __i915_request_await_external(struct i915_request *rq, struct dma_fence *fence)
1207 return i915_sw_fence_await_dma_fence(&rq->submit, fence,
1208 i915_fence_context_timeout(rq->i915,
1214 i915_request_await_external(struct i915_request *rq, struct dma_fence *fence)
1216 struct dma_fence *iter;
1219 if (!to_dma_fence_chain(fence))
1220 return __i915_request_await_external(rq, fence);
1222 dma_fence_chain_for_each(iter, fence) {
1223 struct dma_fence_chain *chain = to_dma_fence_chain(iter);
1225 if (!dma_fence_is_i915(chain->fence)) {
1226 err = __i915_request_await_external(rq, iter);
1230 err = i915_request_await_dma_fence(rq, chain->fence);
1235 dma_fence_put(iter);
1240 i915_request_await_execution(struct i915_request *rq,
1241 struct dma_fence *fence,
1242 void (*hook)(struct i915_request *rq,
1243 struct dma_fence *signal))
1245 struct dma_fence **child = &fence;
1246 unsigned int nchild = 1;
1249 if (dma_fence_is_array(fence)) {
1250 struct dma_fence_array *array = to_dma_fence_array(fence);
1252 /* XXX Error for signal-on-any fence arrays */
1254 child = array->fences;
1255 nchild = array->num_fences;
1256 GEM_BUG_ON(!nchild);
1261 if (test_bit(DMA_FENCE_FLAG_SIGNALED_BIT, &fence->flags)) {
1262 i915_sw_fence_set_error_once(&rq->submit, fence->error);
1266 if (fence->context == rq->fence.context)
1270 * We don't squash repeated fence dependencies here as we
1271 * want to run our callback in all cases.
1274 if (dma_fence_is_i915(fence))
1275 ret = __i915_request_await_execution(rq,
1279 ret = i915_request_await_external(rq, fence);
1288 await_request_submit(struct i915_request *to, struct i915_request *from)
1291 * If we are waiting on a virtual engine, then it may be
1292 * constrained to execute on a single engine *prior* to submission.
1293 * When it is submitted, it will be first submitted to the virtual
1294 * engine and then passed to the physical engine. We cannot allow
1295 * the waiter to be submitted immediately to the physical engine
1296 * as it may then bypass the virtual request.
1298 if (to->engine == READ_ONCE(from->engine))
1299 return i915_sw_fence_await_sw_fence_gfp(&to->submit,
1303 return __i915_request_await_execution(to, from, NULL);
1307 i915_request_await_request(struct i915_request *to, struct i915_request *from)
1311 GEM_BUG_ON(to == from);
1312 GEM_BUG_ON(to->timeline == from->timeline);
1314 if (i915_request_completed(from)) {
1315 i915_sw_fence_set_error_once(&to->submit, from->fence.error);
1319 if (to->engine->schedule) {
1320 ret = i915_sched_node_add_dependency(&to->sched,
1322 I915_DEPENDENCY_EXTERNAL);
1327 if (is_power_of_2(to->execution_mask | READ_ONCE(from->execution_mask)))
1328 ret = await_request_submit(to, from);
1330 ret = emit_semaphore_wait(to, from, I915_FENCE_GFP);
1338 i915_request_await_dma_fence(struct i915_request *rq, struct dma_fence *fence)
1340 struct dma_fence **child = &fence;
1341 unsigned int nchild = 1;
1345 * Note that if the fence-array was created in signal-on-any mode,
1346 * we should *not* decompose it into its individual fences. However,
1347 * we don't currently store which mode the fence-array is operating
1348 * in. Fortunately, the only user of signal-on-any is private to
1349 * amdgpu and we should not see any incoming fence-array from
1350 * sync-file being in signal-on-any mode.
1352 if (dma_fence_is_array(fence)) {
1353 struct dma_fence_array *array = to_dma_fence_array(fence);
1355 child = array->fences;
1356 nchild = array->num_fences;
1357 GEM_BUG_ON(!nchild);
1362 if (test_bit(DMA_FENCE_FLAG_SIGNALED_BIT, &fence->flags)) {
1363 i915_sw_fence_set_error_once(&rq->submit, fence->error);
1368 * Requests on the same timeline are explicitly ordered, along
1369 * with their dependencies, by i915_request_add() which ensures
1370 * that requests are submitted in-order through each ring.
1372 if (fence->context == rq->fence.context)
1375 /* Squash repeated waits to the same timelines */
1376 if (fence->context &&
1377 intel_timeline_sync_is_later(i915_request_timeline(rq),
1381 if (dma_fence_is_i915(fence))
1382 ret = i915_request_await_request(rq, to_request(fence));
1384 ret = i915_request_await_external(rq, fence);
1388 /* Record the latest fence used against each timeline */
1390 intel_timeline_sync_set(i915_request_timeline(rq),
1398 * i915_request_await_object - set this request to (async) wait upon a bo
1399 * @to: request we are wishing to use
1400 * @obj: object which may be in use on another ring.
1401 * @write: whether the wait is on behalf of a writer
1403 * This code is meant to abstract object synchronization with the GPU.
1404 * Conceptually we serialise writes between engines inside the GPU.
1405 * We only allow one engine to write into a buffer at any time, but
1406 * multiple readers. To ensure each has a coherent view of memory, we must:
1408 * - If there is an outstanding write request to the object, the new
1409 * request must wait for it to complete (either CPU or in hw, requests
1410 * on the same ring will be naturally ordered).
1412 * - If we are a write request (pending_write_domain is set), the new
1413 * request must wait for outstanding read requests to complete.
1415 * Returns 0 if successful, else propagates up the lower layer error.
1418 i915_request_await_object(struct i915_request *to,
1419 struct drm_i915_gem_object *obj,
1422 struct dma_fence *excl;
1426 struct dma_fence **shared;
1427 unsigned int count, i;
1429 ret = dma_resv_get_fences_rcu(obj->base.resv,
1430 &excl, &count, &shared);
1434 for (i = 0; i < count; i++) {
1435 ret = i915_request_await_dma_fence(to, shared[i]);
1439 dma_fence_put(shared[i]);
1442 for (; i < count; i++)
1443 dma_fence_put(shared[i]);
1446 excl = dma_resv_get_excl_rcu(obj->base.resv);
1451 ret = i915_request_await_dma_fence(to, excl);
1453 dma_fence_put(excl);
1459 static struct i915_request *
1460 __i915_request_add_to_timeline(struct i915_request *rq)
1462 struct intel_timeline *timeline = i915_request_timeline(rq);
1463 struct i915_request *prev;
1466 * Dependency tracking and request ordering along the timeline
1467 * is special cased so that we can eliminate redundant ordering
1468 * operations while building the request (we know that the timeline
1469 * itself is ordered, and here we guarantee it).
1471 * As we know we will need to emit tracking along the timeline,
1472 * we embed the hooks into our request struct -- at the cost of
1473 * having to have specialised no-allocation interfaces (which will
1474 * be beneficial elsewhere).
1476 * A second benefit to open-coding i915_request_await_request is
1477 * that we can apply a slight variant of the rules specialised
1478 * for timelines that jump between engines (such as virtual engines).
1479 * If we consider the case of virtual engine, we must emit a dma-fence
1480 * to prevent scheduling of the second request until the first is
1481 * complete (to maximise our greedy late load balancing) and this
1482 * precludes optimising to use semaphores serialisation of a single
1483 * timeline across engines.
1485 prev = to_request(__i915_active_fence_set(&timeline->last_request,
1487 if (prev && !i915_request_completed(prev)) {
1489 * The requests are supposed to be kept in order. However,
1490 * we need to be wary in case the timeline->last_request
1491 * is used as a barrier for external modification to this
1494 GEM_BUG_ON(prev->context == rq->context &&
1495 i915_seqno_passed(prev->fence.seqno,
1498 if (is_power_of_2(READ_ONCE(prev->engine)->mask | rq->engine->mask))
1499 i915_sw_fence_await_sw_fence(&rq->submit,
1503 __i915_sw_fence_await_dma_fence(&rq->submit,
1506 if (rq->engine->schedule)
1507 __i915_sched_node_add_dependency(&rq->sched,
1514 * Make sure that no request gazumped us - if it was allocated after
1515 * our i915_request_alloc() and called __i915_request_add() before
1516 * us, the timeline will hold its seqno which is later than ours.
1518 GEM_BUG_ON(timeline->seqno != rq->fence.seqno);
1524 * NB: This function is not allowed to fail. Doing so would mean the the
1525 * request is not being tracked for completion but the work itself is
1526 * going to happen on the hardware. This would be a Bad Thing(tm).
1528 struct i915_request *__i915_request_commit(struct i915_request *rq)
1530 struct intel_engine_cs *engine = rq->engine;
1531 struct intel_ring *ring = rq->ring;
1537 * To ensure that this call will not fail, space for its emissions
1538 * should already have been reserved in the ring buffer. Let the ring
1539 * know that it is time to use that space up.
1541 GEM_BUG_ON(rq->reserved_space > ring->space);
1542 rq->reserved_space = 0;
1543 rq->emitted_jiffies = jiffies;
1546 * Record the position of the start of the breadcrumb so that
1547 * should we detect the updated seqno part-way through the
1548 * GPU processing the request, we never over-estimate the
1549 * position of the ring's HEAD.
1551 cs = intel_ring_begin(rq, engine->emit_fini_breadcrumb_dw);
1552 GEM_BUG_ON(IS_ERR(cs));
1553 rq->postfix = intel_ring_offset(rq, cs);
1555 return __i915_request_add_to_timeline(rq);
1558 void __i915_request_queue(struct i915_request *rq,
1559 const struct i915_sched_attr *attr)
1562 * Let the backend know a new request has arrived that may need
1563 * to adjust the existing execution schedule due to a high priority
1564 * request - i.e. we may want to preempt the current request in order
1565 * to run a high priority dependency chain *before* we can execute this
1568 * This is called before the request is ready to run so that we can
1569 * decide whether to preempt the entire chain so that it is ready to
1570 * run at the earliest possible convenience.
1572 if (attr && rq->engine->schedule)
1573 rq->engine->schedule(rq, attr);
1574 i915_sw_fence_commit(&rq->semaphore);
1575 i915_sw_fence_commit(&rq->submit);
1578 void i915_request_add(struct i915_request *rq)
1580 struct intel_timeline * const tl = i915_request_timeline(rq);
1581 struct i915_sched_attr attr = {};
1582 struct i915_gem_context *ctx;
1584 lockdep_assert_held(&tl->mutex);
1585 lockdep_unpin_lock(&tl->mutex, rq->cookie);
1587 trace_i915_request_add(rq);
1588 __i915_request_commit(rq);
1590 /* XXX placeholder for selftests */
1592 ctx = rcu_dereference(rq->context->gem_context);
1597 __i915_request_queue(rq, &attr);
1599 mutex_unlock(&tl->mutex);
1602 static unsigned long local_clock_ns(unsigned int *cpu)
1607 * Cheaply and approximately convert from nanoseconds to microseconds.
1608 * The result and subsequent calculations are also defined in the same
1609 * approximate microseconds units. The principal source of timing
1610 * error here is from the simple truncation.
1612 * Note that local_clock() is only defined wrt to the current CPU;
1613 * the comparisons are no longer valid if we switch CPUs. Instead of
1614 * blocking preemption for the entire busywait, we can detect the CPU
1615 * switch and use that as indicator of system load and a reason to
1616 * stop busywaiting, see busywait_stop().
1625 static bool busywait_stop(unsigned long timeout, unsigned int cpu)
1627 unsigned int this_cpu;
1629 if (time_after(local_clock_ns(&this_cpu), timeout))
1632 return this_cpu != cpu;
1635 static bool __i915_spin_request(const struct i915_request * const rq, int state)
1637 unsigned long timeout_ns;
1641 * Only wait for the request if we know it is likely to complete.
1643 * We don't track the timestamps around requests, nor the average
1644 * request length, so we do not have a good indicator that this
1645 * request will complete within the timeout. What we do know is the
1646 * order in which requests are executed by the context and so we can
1647 * tell if the request has been started. If the request is not even
1648 * running yet, it is a fair assumption that it will not complete
1649 * within our relatively short timeout.
1651 if (!i915_request_is_running(rq))
1655 * When waiting for high frequency requests, e.g. during synchronous
1656 * rendering split between the CPU and GPU, the finite amount of time
1657 * required to set up the irq and wait upon it limits the response
1658 * rate. By busywaiting on the request completion for a short while we
1659 * can service the high frequency waits as quick as possible. However,
1660 * if it is a slow request, we want to sleep as quickly as possible.
1661 * The tradeoff between waiting and sleeping is roughly the time it
1662 * takes to sleep on a request, on the order of a microsecond.
1665 timeout_ns = READ_ONCE(rq->engine->props.max_busywait_duration_ns);
1666 timeout_ns += local_clock_ns(&cpu);
1668 if (i915_request_completed(rq))
1671 if (signal_pending_state(state, current))
1674 if (busywait_stop(timeout_ns, cpu))
1678 } while (!need_resched());
1683 struct request_wait {
1684 struct dma_fence_cb cb;
1685 struct task_struct *tsk;
1688 static void request_wait_wake(struct dma_fence *fence, struct dma_fence_cb *cb)
1690 struct request_wait *wait = container_of(cb, typeof(*wait), cb);
1692 wake_up_process(wait->tsk);
1696 * i915_request_wait - wait until execution of request has finished
1697 * @rq: the request to wait upon
1698 * @flags: how to wait
1699 * @timeout: how long to wait in jiffies
1701 * i915_request_wait() waits for the request to be completed, for a
1702 * maximum of @timeout jiffies (with MAX_SCHEDULE_TIMEOUT implying an
1705 * Returns the remaining time (in jiffies) if the request completed, which may
1706 * be zero or -ETIME if the request is unfinished after the timeout expires.
1707 * May return -EINTR is called with I915_WAIT_INTERRUPTIBLE and a signal is
1708 * pending before the request completes.
1710 long i915_request_wait(struct i915_request *rq,
1714 const int state = flags & I915_WAIT_INTERRUPTIBLE ?
1715 TASK_INTERRUPTIBLE : TASK_UNINTERRUPTIBLE;
1716 struct request_wait wait;
1719 GEM_BUG_ON(timeout < 0);
1721 if (dma_fence_is_signaled(&rq->fence))
1727 trace_i915_request_wait_begin(rq, flags);
1730 * We must never wait on the GPU while holding a lock as we
1731 * may need to perform a GPU reset. So while we don't need to
1732 * serialise wait/reset with an explicit lock, we do want
1733 * lockdep to detect potential dependency cycles.
1735 mutex_acquire(&rq->engine->gt->reset.mutex.dep_map, 0, 0, _THIS_IP_);
1738 * Optimistic spin before touching IRQs.
1740 * We may use a rather large value here to offset the penalty of
1741 * switching away from the active task. Frequently, the client will
1742 * wait upon an old swapbuffer to throttle itself to remain within a
1743 * frame of the gpu. If the client is running in lockstep with the gpu,
1744 * then it should not be waiting long at all, and a sleep now will incur
1745 * extra scheduler latency in producing the next frame. To try to
1746 * avoid adding the cost of enabling/disabling the interrupt to the
1747 * short wait, we first spin to see if the request would have completed
1748 * in the time taken to setup the interrupt.
1750 * We need upto 5us to enable the irq, and upto 20us to hide the
1751 * scheduler latency of a context switch, ignoring the secondary
1752 * impacts from a context switch such as cache eviction.
1754 * The scheme used for low-latency IO is called "hybrid interrupt
1755 * polling". The suggestion there is to sleep until just before you
1756 * expect to be woken by the device interrupt and then poll for its
1757 * completion. That requires having a good predictor for the request
1758 * duration, which we currently lack.
1760 if (IS_ACTIVE(CONFIG_DRM_I915_MAX_REQUEST_BUSYWAIT) &&
1761 __i915_spin_request(rq, state)) {
1762 dma_fence_signal(&rq->fence);
1767 * This client is about to stall waiting for the GPU. In many cases
1768 * this is undesirable and limits the throughput of the system, as
1769 * many clients cannot continue processing user input/output whilst
1770 * blocked. RPS autotuning may take tens of milliseconds to respond
1771 * to the GPU load and thus incurs additional latency for the client.
1772 * We can circumvent that by promoting the GPU frequency to maximum
1773 * before we sleep. This makes the GPU throttle up much more quickly
1774 * (good for benchmarks and user experience, e.g. window animations),
1775 * but at a cost of spending more power processing the workload
1776 * (bad for battery).
1778 if (flags & I915_WAIT_PRIORITY) {
1779 if (!i915_request_started(rq) && INTEL_GEN(rq->i915) >= 6)
1780 intel_rps_boost(rq);
1784 if (dma_fence_add_callback(&rq->fence, &wait.cb, request_wait_wake))
1788 set_current_state(state);
1790 if (i915_request_completed(rq)) {
1791 dma_fence_signal(&rq->fence);
1795 intel_engine_flush_submission(rq->engine);
1797 if (signal_pending_state(state, current)) {
1798 timeout = -ERESTARTSYS;
1807 timeout = io_schedule_timeout(timeout);
1809 __set_current_state(TASK_RUNNING);
1811 dma_fence_remove_callback(&rq->fence, &wait.cb);
1814 mutex_release(&rq->engine->gt->reset.mutex.dep_map, _THIS_IP_);
1815 trace_i915_request_wait_end(rq);
1819 #if IS_ENABLED(CONFIG_DRM_I915_SELFTEST)
1820 #include "selftests/mock_request.c"
1821 #include "selftests/i915_request.c"
1824 static void i915_global_request_shrink(void)
1826 kmem_cache_shrink(global.slab_execute_cbs);
1827 kmem_cache_shrink(global.slab_requests);
1830 static void i915_global_request_exit(void)
1832 kmem_cache_destroy(global.slab_execute_cbs);
1833 kmem_cache_destroy(global.slab_requests);
1836 static struct i915_global_request global = { {
1837 .shrink = i915_global_request_shrink,
1838 .exit = i915_global_request_exit,
1841 int __init i915_global_request_init(void)
1843 global.slab_requests =
1844 kmem_cache_create("i915_request",
1845 sizeof(struct i915_request),
1846 __alignof__(struct i915_request),
1847 SLAB_HWCACHE_ALIGN |
1848 SLAB_RECLAIM_ACCOUNT |
1849 SLAB_TYPESAFE_BY_RCU,
1850 __i915_request_ctor);
1851 if (!global.slab_requests)
1854 global.slab_execute_cbs = KMEM_CACHE(execute_cb,
1855 SLAB_HWCACHE_ALIGN |
1856 SLAB_RECLAIM_ACCOUNT |
1857 SLAB_TYPESAFE_BY_RCU);
1858 if (!global.slab_execute_cbs)
1861 i915_global_register(&global.base);
1865 kmem_cache_destroy(global.slab_requests);