bpf: Prevent memory disambiguation attack
[linux/fpc-iii.git] / drivers / gpu / drm / i915 / i915_gem_request.h
blob0d6d39f19506d9cc71d9c228b34708bcef8567be
1 /*
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
13 * Software.
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
21 * IN THE SOFTWARE.
25 #ifndef I915_GEM_REQUEST_H
26 #define I915_GEM_REQUEST_H
28 #include <linux/dma-fence.h>
30 #include "i915_gem.h"
31 #include "i915_sw_fence.h"
33 #include <uapi/drm/i915_drm.h>
35 struct drm_file;
36 struct drm_i915_gem_object;
37 struct drm_i915_gem_request;
39 struct intel_wait {
40 struct rb_node node;
41 struct task_struct *tsk;
42 struct drm_i915_gem_request *request;
43 u32 seqno;
46 struct intel_signal_node {
47 struct rb_node node;
48 struct intel_wait wait;
51 struct i915_dependency {
52 struct i915_priotree *signaler;
53 struct list_head signal_link;
54 struct list_head wait_link;
55 struct list_head dfs_link;
56 unsigned long flags;
57 #define I915_DEPENDENCY_ALLOC BIT(0)
60 /* Requests exist in a complex web of interdependencies. Each request
61 * has to wait for some other request to complete before it is ready to be run
62 * (e.g. we have to wait until the pixels have been rendering into a texture
63 * before we can copy from it). We track the readiness of a request in terms
64 * of fences, but we also need to keep the dependency tree for the lifetime
65 * of the request (beyond the life of an individual fence). We use the tree
66 * at various points to reorder the requests whilst keeping the requests
67 * in order with respect to their various dependencies.
69 struct i915_priotree {
70 struct list_head signalers_list; /* those before us, we depend upon */
71 struct list_head waiters_list; /* those after us, they depend upon us */
72 struct list_head link;
73 int priority;
76 enum {
77 I915_PRIORITY_MIN = I915_CONTEXT_MIN_USER_PRIORITY - 1,
78 I915_PRIORITY_NORMAL = I915_CONTEXT_DEFAULT_PRIORITY,
79 I915_PRIORITY_MAX = I915_CONTEXT_MAX_USER_PRIORITY + 1,
81 I915_PRIORITY_INVALID = INT_MIN
84 struct i915_gem_capture_list {
85 struct i915_gem_capture_list *next;
86 struct i915_vma *vma;
89 /**
90 * Request queue structure.
92 * The request queue allows us to note sequence numbers that have been emitted
93 * and may be associated with active buffers to be retired.
95 * By keeping this list, we can avoid having to do questionable sequence
96 * number comparisons on buffer last_read|write_seqno. It also allows an
97 * emission time to be associated with the request for tracking how far ahead
98 * of the GPU the submission is.
100 * When modifying this structure be very aware that we perform a lockless
101 * RCU lookup of it that may race against reallocation of the struct
102 * from the slab freelist. We intentionally do not zero the structure on
103 * allocation so that the lookup can use the dangling pointers (and is
104 * cogniscent that those pointers may be wrong). Instead, everything that
105 * needs to be initialised must be done so explicitly.
107 * The requests are reference counted.
109 struct drm_i915_gem_request {
110 struct dma_fence fence;
111 spinlock_t lock;
113 /** On Which ring this request was generated */
114 struct drm_i915_private *i915;
117 * Context and ring buffer related to this request
118 * Contexts are refcounted, so when this request is associated with a
119 * context, we must increment the context's refcount, to guarantee that
120 * it persists while any request is linked to it. Requests themselves
121 * are also refcounted, so the request will only be freed when the last
122 * reference to it is dismissed, and the code in
123 * i915_gem_request_free() will then decrement the refcount on the
124 * context.
126 struct i915_gem_context *ctx;
127 struct intel_engine_cs *engine;
128 struct intel_ring *ring;
129 struct intel_timeline *timeline;
130 struct intel_signal_node signaling;
132 /* Fences for the various phases in the request's lifetime.
134 * The submit fence is used to await upon all of the request's
135 * dependencies. When it is signaled, the request is ready to run.
136 * It is used by the driver to then queue the request for execution.
138 struct i915_sw_fence submit;
139 wait_queue_entry_t submitq;
140 wait_queue_head_t execute;
142 /* A list of everyone we wait upon, and everyone who waits upon us.
143 * Even though we will not be submitted to the hardware before the
144 * submit fence is signaled (it waits for all external events as well
145 * as our own requests), the scheduler still needs to know the
146 * dependency tree for the lifetime of the request (from execbuf
147 * to retirement), i.e. bidirectional dependency information for the
148 * request not tied to individual fences.
150 struct i915_priotree priotree;
151 struct i915_dependency dep;
153 /** GEM sequence number associated with this request on the
154 * global execution timeline. It is zero when the request is not
155 * on the HW queue (i.e. not on the engine timeline list).
156 * Its value is guarded by the timeline spinlock.
158 u32 global_seqno;
160 /** Position in the ring of the start of the request */
161 u32 head;
164 * Position in the ring of the start of the postfix.
165 * This is required to calculate the maximum available ring space
166 * without overwriting the postfix.
168 u32 postfix;
170 /** Position in the ring of the end of the whole request */
171 u32 tail;
173 /** Position in the ring of the end of any workarounds after the tail */
174 u32 wa_tail;
176 /** Preallocate space in the ring for the emitting the request */
177 u32 reserved_space;
179 /** Batch buffer related to this request if any (used for
180 * error state dump only).
182 struct i915_vma *batch;
183 /** Additional buffers requested by userspace to be captured upon
184 * a GPU hang. The vma/obj on this list are protected by their
185 * active reference - all objects on this list must also be
186 * on the active_list (of their final request).
188 struct i915_gem_capture_list *capture_list;
189 struct list_head active_list;
191 /** Time at which this request was emitted, in jiffies. */
192 unsigned long emitted_jiffies;
194 bool waitboost;
196 /** engine->request_list entry for this request */
197 struct list_head link;
199 /** ring->request_list entry for this request */
200 struct list_head ring_link;
202 struct drm_i915_file_private *file_priv;
203 /** file_priv list entry for this request */
204 struct list_head client_link;
207 #define I915_FENCE_GFP (GFP_KERNEL | __GFP_RETRY_MAYFAIL | __GFP_NOWARN)
209 extern const struct dma_fence_ops i915_fence_ops;
211 static inline bool dma_fence_is_i915(const struct dma_fence *fence)
213 return fence->ops == &i915_fence_ops;
216 struct drm_i915_gem_request * __must_check
217 i915_gem_request_alloc(struct intel_engine_cs *engine,
218 struct i915_gem_context *ctx);
219 void i915_gem_request_retire_upto(struct drm_i915_gem_request *req);
221 static inline struct drm_i915_gem_request *
222 to_request(struct dma_fence *fence)
224 /* We assume that NULL fence/request are interoperable */
225 BUILD_BUG_ON(offsetof(struct drm_i915_gem_request, fence) != 0);
226 GEM_BUG_ON(fence && !dma_fence_is_i915(fence));
227 return container_of(fence, struct drm_i915_gem_request, fence);
230 static inline struct drm_i915_gem_request *
231 i915_gem_request_get(struct drm_i915_gem_request *req)
233 return to_request(dma_fence_get(&req->fence));
236 static inline struct drm_i915_gem_request *
237 i915_gem_request_get_rcu(struct drm_i915_gem_request *req)
239 return to_request(dma_fence_get_rcu(&req->fence));
242 static inline void
243 i915_gem_request_put(struct drm_i915_gem_request *req)
245 dma_fence_put(&req->fence);
248 static inline void i915_gem_request_assign(struct drm_i915_gem_request **pdst,
249 struct drm_i915_gem_request *src)
251 if (src)
252 i915_gem_request_get(src);
254 if (*pdst)
255 i915_gem_request_put(*pdst);
257 *pdst = src;
261 * i915_gem_request_global_seqno - report the current global seqno
262 * @request - the request
264 * A request is assigned a global seqno only when it is on the hardware
265 * execution queue. The global seqno can be used to maintain a list of
266 * requests on the same engine in retirement order, for example for
267 * constructing a priority queue for waiting. Prior to its execution, or
268 * if it is subsequently removed in the event of preemption, its global
269 * seqno is zero. As both insertion and removal from the execution queue
270 * may operate in IRQ context, it is not guarded by the usual struct_mutex
271 * BKL. Instead those relying on the global seqno must be prepared for its
272 * value to change between reads. Only when the request is complete can
273 * the global seqno be stable (due to the memory barriers on submitting
274 * the commands to the hardware to write the breadcrumb, if the HWS shows
275 * that it has passed the global seqno and the global seqno is unchanged
276 * after the read, it is indeed complete).
278 static u32
279 i915_gem_request_global_seqno(const struct drm_i915_gem_request *request)
281 return READ_ONCE(request->global_seqno);
285 i915_gem_request_await_object(struct drm_i915_gem_request *to,
286 struct drm_i915_gem_object *obj,
287 bool write);
288 int i915_gem_request_await_dma_fence(struct drm_i915_gem_request *req,
289 struct dma_fence *fence);
291 void __i915_add_request(struct drm_i915_gem_request *req, bool flush_caches);
292 #define i915_add_request(req) \
293 __i915_add_request(req, false)
295 void __i915_gem_request_submit(struct drm_i915_gem_request *request);
296 void i915_gem_request_submit(struct drm_i915_gem_request *request);
298 void __i915_gem_request_unsubmit(struct drm_i915_gem_request *request);
299 void i915_gem_request_unsubmit(struct drm_i915_gem_request *request);
301 struct intel_rps_client;
302 #define NO_WAITBOOST ERR_PTR(-1)
303 #define IS_RPS_CLIENT(p) (!IS_ERR(p))
304 #define IS_RPS_USER(p) (!IS_ERR_OR_NULL(p))
306 long i915_wait_request(struct drm_i915_gem_request *req,
307 unsigned int flags,
308 long timeout)
309 __attribute__((nonnull(1)));
310 #define I915_WAIT_INTERRUPTIBLE BIT(0)
311 #define I915_WAIT_LOCKED BIT(1) /* struct_mutex held, handle GPU reset */
312 #define I915_WAIT_ALL BIT(2) /* used by i915_gem_object_wait() */
314 static inline u32 intel_engine_get_seqno(struct intel_engine_cs *engine);
317 * Returns true if seq1 is later than seq2.
319 static inline bool i915_seqno_passed(u32 seq1, u32 seq2)
321 return (s32)(seq1 - seq2) >= 0;
324 static inline bool
325 __i915_gem_request_completed(const struct drm_i915_gem_request *req, u32 seqno)
327 GEM_BUG_ON(!seqno);
328 return i915_seqno_passed(intel_engine_get_seqno(req->engine), seqno) &&
329 seqno == i915_gem_request_global_seqno(req);
332 static inline bool
333 i915_gem_request_completed(const struct drm_i915_gem_request *req)
335 u32 seqno;
337 seqno = i915_gem_request_global_seqno(req);
338 if (!seqno)
339 return false;
341 return __i915_gem_request_completed(req, seqno);
344 /* We treat requests as fences. This is not be to confused with our
345 * "fence registers" but pipeline synchronisation objects ala GL_ARB_sync.
346 * We use the fences to synchronize access from the CPU with activity on the
347 * GPU, for example, we should not rewrite an object's PTE whilst the GPU
348 * is reading them. We also track fences at a higher level to provide
349 * implicit synchronisation around GEM objects, e.g. set-domain will wait
350 * for outstanding GPU rendering before marking the object ready for CPU
351 * access, or a pageflip will wait until the GPU is complete before showing
352 * the frame on the scanout.
354 * In order to use a fence, the object must track the fence it needs to
355 * serialise with. For example, GEM objects want to track both read and
356 * write access so that we can perform concurrent read operations between
357 * the CPU and GPU engines, as well as waiting for all rendering to
358 * complete, or waiting for the last GPU user of a "fence register". The
359 * object then embeds a #i915_gem_active to track the most recent (in
360 * retirement order) request relevant for the desired mode of access.
361 * The #i915_gem_active is updated with i915_gem_active_set() to track the
362 * most recent fence request, typically this is done as part of
363 * i915_vma_move_to_active().
365 * When the #i915_gem_active completes (is retired), it will
366 * signal its completion to the owner through a callback as well as mark
367 * itself as idle (i915_gem_active.request == NULL). The owner
368 * can then perform any action, such as delayed freeing of an active
369 * resource including itself.
371 struct i915_gem_active;
373 typedef void (*i915_gem_retire_fn)(struct i915_gem_active *,
374 struct drm_i915_gem_request *);
376 struct i915_gem_active {
377 struct drm_i915_gem_request __rcu *request;
378 struct list_head link;
379 i915_gem_retire_fn retire;
382 void i915_gem_retire_noop(struct i915_gem_active *,
383 struct drm_i915_gem_request *request);
386 * init_request_active - prepares the activity tracker for use
387 * @active - the active tracker
388 * @func - a callback when then the tracker is retired (becomes idle),
389 * can be NULL
391 * init_request_active() prepares the embedded @active struct for use as
392 * an activity tracker, that is for tracking the last known active request
393 * associated with it. When the last request becomes idle, when it is retired
394 * after completion, the optional callback @func is invoked.
396 static inline void
397 init_request_active(struct i915_gem_active *active,
398 i915_gem_retire_fn retire)
400 INIT_LIST_HEAD(&active->link);
401 active->retire = retire ?: i915_gem_retire_noop;
405 * i915_gem_active_set - updates the tracker to watch the current request
406 * @active - the active tracker
407 * @request - the request to watch
409 * i915_gem_active_set() watches the given @request for completion. Whilst
410 * that @request is busy, the @active reports busy. When that @request is
411 * retired, the @active tracker is updated to report idle.
413 static inline void
414 i915_gem_active_set(struct i915_gem_active *active,
415 struct drm_i915_gem_request *request)
417 list_move(&active->link, &request->active_list);
418 rcu_assign_pointer(active->request, request);
422 * i915_gem_active_set_retire_fn - updates the retirement callback
423 * @active - the active tracker
424 * @fn - the routine called when the request is retired
425 * @mutex - struct_mutex used to guard retirements
427 * i915_gem_active_set_retire_fn() updates the function pointer that
428 * is called when the final request associated with the @active tracker
429 * is retired.
431 static inline void
432 i915_gem_active_set_retire_fn(struct i915_gem_active *active,
433 i915_gem_retire_fn fn,
434 struct mutex *mutex)
436 lockdep_assert_held(mutex);
437 active->retire = fn ?: i915_gem_retire_noop;
440 static inline struct drm_i915_gem_request *
441 __i915_gem_active_peek(const struct i915_gem_active *active)
443 /* Inside the error capture (running with the driver in an unknown
444 * state), we want to bend the rules slightly (a lot).
446 * Work is in progress to make it safer, in the meantime this keeps
447 * the known issue from spamming the logs.
449 return rcu_dereference_protected(active->request, 1);
453 * i915_gem_active_raw - return the active request
454 * @active - the active tracker
456 * i915_gem_active_raw() returns the current request being tracked, or NULL.
457 * It does not obtain a reference on the request for the caller, so the caller
458 * must hold struct_mutex.
460 static inline struct drm_i915_gem_request *
461 i915_gem_active_raw(const struct i915_gem_active *active, struct mutex *mutex)
463 return rcu_dereference_protected(active->request,
464 lockdep_is_held(mutex));
468 * i915_gem_active_peek - report the active request being monitored
469 * @active - the active tracker
471 * i915_gem_active_peek() returns the current request being tracked if
472 * still active, or NULL. It does not obtain a reference on the request
473 * for the caller, so the caller must hold struct_mutex.
475 static inline struct drm_i915_gem_request *
476 i915_gem_active_peek(const struct i915_gem_active *active, struct mutex *mutex)
478 struct drm_i915_gem_request *request;
480 request = i915_gem_active_raw(active, mutex);
481 if (!request || i915_gem_request_completed(request))
482 return NULL;
484 return request;
488 * i915_gem_active_get - return a reference to the active request
489 * @active - the active tracker
491 * i915_gem_active_get() returns a reference to the active request, or NULL
492 * if the active tracker is idle. The caller must hold struct_mutex.
494 static inline struct drm_i915_gem_request *
495 i915_gem_active_get(const struct i915_gem_active *active, struct mutex *mutex)
497 return i915_gem_request_get(i915_gem_active_peek(active, mutex));
501 * __i915_gem_active_get_rcu - return a reference to the active request
502 * @active - the active tracker
504 * __i915_gem_active_get() returns a reference to the active request, or NULL
505 * if the active tracker is idle. The caller must hold the RCU read lock, but
506 * the returned pointer is safe to use outside of RCU.
508 static inline struct drm_i915_gem_request *
509 __i915_gem_active_get_rcu(const struct i915_gem_active *active)
511 /* Performing a lockless retrieval of the active request is super
512 * tricky. SLAB_TYPESAFE_BY_RCU merely guarantees that the backing
513 * slab of request objects will not be freed whilst we hold the
514 * RCU read lock. It does not guarantee that the request itself
515 * will not be freed and then *reused*. Viz,
517 * Thread A Thread B
519 * req = active.request
520 * retire(req) -> free(req);
521 * (req is now first on the slab freelist)
522 * active.request = NULL
524 * req = new submission on a new object
525 * ref(req)
527 * To prevent the request from being reused whilst the caller
528 * uses it, we take a reference like normal. Whilst acquiring
529 * the reference we check that it is not in a destroyed state
530 * (refcnt == 0). That prevents the request being reallocated
531 * whilst the caller holds on to it. To check that the request
532 * was not reallocated as we acquired the reference we have to
533 * check that our request remains the active request across
534 * the lookup, in the same manner as a seqlock. The visibility
535 * of the pointer versus the reference counting is controlled
536 * by using RCU barriers (rcu_dereference and rcu_assign_pointer).
538 * In the middle of all that, we inspect whether the request is
539 * complete. Retiring is lazy so the request may be completed long
540 * before the active tracker is updated. Querying whether the
541 * request is complete is far cheaper (as it involves no locked
542 * instructions setting cachelines to exclusive) than acquiring
543 * the reference, so we do it first. The RCU read lock ensures the
544 * pointer dereference is valid, but does not ensure that the
545 * seqno nor HWS is the right one! However, if the request was
546 * reallocated, that means the active tracker's request was complete.
547 * If the new request is also complete, then both are and we can
548 * just report the active tracker is idle. If the new request is
549 * incomplete, then we acquire a reference on it and check that
550 * it remained the active request.
552 * It is then imperative that we do not zero the request on
553 * reallocation, so that we can chase the dangling pointers!
554 * See i915_gem_request_alloc().
556 do {
557 struct drm_i915_gem_request *request;
559 request = rcu_dereference(active->request);
560 if (!request || i915_gem_request_completed(request))
561 return NULL;
563 /* An especially silly compiler could decide to recompute the
564 * result of i915_gem_request_completed, more specifically
565 * re-emit the load for request->fence.seqno. A race would catch
566 * a later seqno value, which could flip the result from true to
567 * false. Which means part of the instructions below might not
568 * be executed, while later on instructions are executed. Due to
569 * barriers within the refcounting the inconsistency can't reach
570 * past the call to i915_gem_request_get_rcu, but not executing
571 * that while still executing i915_gem_request_put() creates
572 * havoc enough. Prevent this with a compiler barrier.
574 barrier();
576 request = i915_gem_request_get_rcu(request);
578 /* What stops the following rcu_access_pointer() from occurring
579 * before the above i915_gem_request_get_rcu()? If we were
580 * to read the value before pausing to get the reference to
581 * the request, we may not notice a change in the active
582 * tracker.
584 * The rcu_access_pointer() is a mere compiler barrier, which
585 * means both the CPU and compiler are free to perform the
586 * memory read without constraint. The compiler only has to
587 * ensure that any operations after the rcu_access_pointer()
588 * occur afterwards in program order. This means the read may
589 * be performed earlier by an out-of-order CPU, or adventurous
590 * compiler.
592 * The atomic operation at the heart of
593 * i915_gem_request_get_rcu(), see dma_fence_get_rcu(), is
594 * atomic_inc_not_zero() which is only a full memory barrier
595 * when successful. That is, if i915_gem_request_get_rcu()
596 * returns the request (and so with the reference counted
597 * incremented) then the following read for rcu_access_pointer()
598 * must occur after the atomic operation and so confirm
599 * that this request is the one currently being tracked.
601 * The corresponding write barrier is part of
602 * rcu_assign_pointer().
604 if (!request || request == rcu_access_pointer(active->request))
605 return rcu_pointer_handoff(request);
607 i915_gem_request_put(request);
608 } while (1);
612 * i915_gem_active_get_unlocked - return a reference to the active request
613 * @active - the active tracker
615 * i915_gem_active_get_unlocked() returns a reference to the active request,
616 * or NULL if the active tracker is idle. The reference is obtained under RCU,
617 * so no locking is required by the caller.
619 * The reference should be freed with i915_gem_request_put().
621 static inline struct drm_i915_gem_request *
622 i915_gem_active_get_unlocked(const struct i915_gem_active *active)
624 struct drm_i915_gem_request *request;
626 rcu_read_lock();
627 request = __i915_gem_active_get_rcu(active);
628 rcu_read_unlock();
630 return request;
634 * i915_gem_active_isset - report whether the active tracker is assigned
635 * @active - the active tracker
637 * i915_gem_active_isset() returns true if the active tracker is currently
638 * assigned to a request. Due to the lazy retiring, that request may be idle
639 * and this may report stale information.
641 static inline bool
642 i915_gem_active_isset(const struct i915_gem_active *active)
644 return rcu_access_pointer(active->request);
648 * i915_gem_active_wait - waits until the request is completed
649 * @active - the active request on which to wait
650 * @flags - how to wait
651 * @timeout - how long to wait at most
652 * @rps - userspace client to charge for a waitboost
654 * i915_gem_active_wait() waits until the request is completed before
655 * returning, without requiring any locks to be held. Note that it does not
656 * retire any requests before returning.
658 * This function relies on RCU in order to acquire the reference to the active
659 * request without holding any locks. See __i915_gem_active_get_rcu() for the
660 * glory details on how that is managed. Once the reference is acquired, we
661 * can then wait upon the request, and afterwards release our reference,
662 * free of any locking.
664 * This function wraps i915_wait_request(), see it for the full details on
665 * the arguments.
667 * Returns 0 if successful, or a negative error code.
669 static inline int
670 i915_gem_active_wait(const struct i915_gem_active *active, unsigned int flags)
672 struct drm_i915_gem_request *request;
673 long ret = 0;
675 request = i915_gem_active_get_unlocked(active);
676 if (request) {
677 ret = i915_wait_request(request, flags, MAX_SCHEDULE_TIMEOUT);
678 i915_gem_request_put(request);
681 return ret < 0 ? ret : 0;
685 * i915_gem_active_retire - waits until the request is retired
686 * @active - the active request on which to wait
688 * i915_gem_active_retire() waits until the request is completed,
689 * and then ensures that at least the retirement handler for this
690 * @active tracker is called before returning. If the @active
691 * tracker is idle, the function returns immediately.
693 static inline int __must_check
694 i915_gem_active_retire(struct i915_gem_active *active,
695 struct mutex *mutex)
697 struct drm_i915_gem_request *request;
698 long ret;
700 request = i915_gem_active_raw(active, mutex);
701 if (!request)
702 return 0;
704 ret = i915_wait_request(request,
705 I915_WAIT_INTERRUPTIBLE | I915_WAIT_LOCKED,
706 MAX_SCHEDULE_TIMEOUT);
707 if (ret < 0)
708 return ret;
710 list_del_init(&active->link);
711 RCU_INIT_POINTER(active->request, NULL);
713 active->retire(active, request);
715 return 0;
718 #define for_each_active(mask, idx) \
719 for (; mask ? idx = ffs(mask) - 1, 1 : 0; mask &= ~BIT(idx))
721 #endif /* I915_GEM_REQUEST_H */