i915_gem_request.h 23 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688
  1. /*
  2. * Copyright © 2008-2015 Intel Corporation
  3. *
  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:
  10. *
  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.
  14. *
  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.
  22. *
  23. */
  24. #ifndef I915_GEM_REQUEST_H
  25. #define I915_GEM_REQUEST_H
  26. #include <linux/fence.h>
  27. #include "i915_gem.h"
  28. #include "i915_sw_fence.h"
  29. struct intel_wait {
  30. struct rb_node node;
  31. struct task_struct *tsk;
  32. u32 seqno;
  33. };
  34. struct intel_signal_node {
  35. struct rb_node node;
  36. struct intel_wait wait;
  37. };
  38. /**
  39. * Request queue structure.
  40. *
  41. * The request queue allows us to note sequence numbers that have been emitted
  42. * and may be associated with active buffers to be retired.
  43. *
  44. * By keeping this list, we can avoid having to do questionable sequence
  45. * number comparisons on buffer last_read|write_seqno. It also allows an
  46. * emission time to be associated with the request for tracking how far ahead
  47. * of the GPU the submission is.
  48. *
  49. * When modifying this structure be very aware that we perform a lockless
  50. * RCU lookup of it that may race against reallocation of the struct
  51. * from the slab freelist. We intentionally do not zero the structure on
  52. * allocation so that the lookup can use the dangling pointers (and is
  53. * cogniscent that those pointers may be wrong). Instead, everything that
  54. * needs to be initialised must be done so explicitly.
  55. *
  56. * The requests are reference counted.
  57. */
  58. struct drm_i915_gem_request {
  59. struct fence fence;
  60. spinlock_t lock;
  61. /** On Which ring this request was generated */
  62. struct drm_i915_private *i915;
  63. /**
  64. * Context and ring buffer related to this request
  65. * Contexts are refcounted, so when this request is associated with a
  66. * context, we must increment the context's refcount, to guarantee that
  67. * it persists while any request is linked to it. Requests themselves
  68. * are also refcounted, so the request will only be freed when the last
  69. * reference to it is dismissed, and the code in
  70. * i915_gem_request_free() will then decrement the refcount on the
  71. * context.
  72. */
  73. struct i915_gem_context *ctx;
  74. struct intel_engine_cs *engine;
  75. struct intel_ring *ring;
  76. struct intel_signal_node signaling;
  77. struct i915_sw_fence submit;
  78. /** GEM sequence number associated with the previous request,
  79. * when the HWS breadcrumb is equal to this the GPU is processing
  80. * this request.
  81. */
  82. u32 previous_seqno;
  83. /** Position in the ring of the start of the request */
  84. u32 head;
  85. /**
  86. * Position in the ring of the start of the postfix.
  87. * This is required to calculate the maximum available ring space
  88. * without overwriting the postfix.
  89. */
  90. u32 postfix;
  91. /** Position in the ring of the end of the whole request */
  92. u32 tail;
  93. /** Position in the ring of the end of any workarounds after the tail */
  94. u32 wa_tail;
  95. /** Preallocate space in the ring for the emitting the request */
  96. u32 reserved_space;
  97. /**
  98. * Context related to the previous request.
  99. * As the contexts are accessed by the hardware until the switch is
  100. * completed to a new context, the hardware may still be writing
  101. * to the context object after the breadcrumb is visible. We must
  102. * not unpin/unbind/prune that object whilst still active and so
  103. * we keep the previous context pinned until the following (this)
  104. * request is retired.
  105. */
  106. struct i915_gem_context *previous_context;
  107. /** Batch buffer related to this request if any (used for
  108. * error state dump only).
  109. */
  110. struct i915_vma *batch;
  111. struct list_head active_list;
  112. /** Time at which this request was emitted, in jiffies. */
  113. unsigned long emitted_jiffies;
  114. /** engine->request_list entry for this request */
  115. struct list_head link;
  116. /** ring->request_list entry for this request */
  117. struct list_head ring_link;
  118. struct drm_i915_file_private *file_priv;
  119. /** file_priv list entry for this request */
  120. struct list_head client_list;
  121. /** Link in the execlist submission queue, guarded by execlist_lock. */
  122. struct list_head execlist_link;
  123. };
  124. extern const struct fence_ops i915_fence_ops;
  125. static inline bool fence_is_i915(struct fence *fence)
  126. {
  127. return fence->ops == &i915_fence_ops;
  128. }
  129. struct drm_i915_gem_request * __must_check
  130. i915_gem_request_alloc(struct intel_engine_cs *engine,
  131. struct i915_gem_context *ctx);
  132. int i915_gem_request_add_to_client(struct drm_i915_gem_request *req,
  133. struct drm_file *file);
  134. void i915_gem_request_retire_upto(struct drm_i915_gem_request *req);
  135. static inline u32
  136. i915_gem_request_get_seqno(struct drm_i915_gem_request *req)
  137. {
  138. return req ? req->fence.seqno : 0;
  139. }
  140. static inline struct intel_engine_cs *
  141. i915_gem_request_get_engine(struct drm_i915_gem_request *req)
  142. {
  143. return req ? req->engine : NULL;
  144. }
  145. static inline struct drm_i915_gem_request *
  146. to_request(struct fence *fence)
  147. {
  148. /* We assume that NULL fence/request are interoperable */
  149. BUILD_BUG_ON(offsetof(struct drm_i915_gem_request, fence) != 0);
  150. GEM_BUG_ON(fence && !fence_is_i915(fence));
  151. return container_of(fence, struct drm_i915_gem_request, fence);
  152. }
  153. static inline struct drm_i915_gem_request *
  154. i915_gem_request_get(struct drm_i915_gem_request *req)
  155. {
  156. return to_request(fence_get(&req->fence));
  157. }
  158. static inline struct drm_i915_gem_request *
  159. i915_gem_request_get_rcu(struct drm_i915_gem_request *req)
  160. {
  161. return to_request(fence_get_rcu(&req->fence));
  162. }
  163. static inline void
  164. i915_gem_request_put(struct drm_i915_gem_request *req)
  165. {
  166. fence_put(&req->fence);
  167. }
  168. static inline void i915_gem_request_assign(struct drm_i915_gem_request **pdst,
  169. struct drm_i915_gem_request *src)
  170. {
  171. if (src)
  172. i915_gem_request_get(src);
  173. if (*pdst)
  174. i915_gem_request_put(*pdst);
  175. *pdst = src;
  176. }
  177. int
  178. i915_gem_request_await_object(struct drm_i915_gem_request *to,
  179. struct drm_i915_gem_object *obj,
  180. bool write);
  181. void __i915_add_request(struct drm_i915_gem_request *req, bool flush_caches);
  182. #define i915_add_request(req) \
  183. __i915_add_request(req, true)
  184. #define i915_add_request_no_flush(req) \
  185. __i915_add_request(req, false)
  186. struct intel_rps_client;
  187. #define NO_WAITBOOST ERR_PTR(-1)
  188. #define IS_RPS_CLIENT(p) (!IS_ERR(p))
  189. #define IS_RPS_USER(p) (!IS_ERR_OR_NULL(p))
  190. int i915_wait_request(struct drm_i915_gem_request *req,
  191. unsigned int flags,
  192. s64 *timeout,
  193. struct intel_rps_client *rps)
  194. __attribute__((nonnull(1)));
  195. #define I915_WAIT_INTERRUPTIBLE BIT(0)
  196. #define I915_WAIT_LOCKED BIT(1) /* struct_mutex held, handle GPU reset */
  197. static inline u32 intel_engine_get_seqno(struct intel_engine_cs *engine);
  198. /**
  199. * Returns true if seq1 is later than seq2.
  200. */
  201. static inline bool i915_seqno_passed(u32 seq1, u32 seq2)
  202. {
  203. return (s32)(seq1 - seq2) >= 0;
  204. }
  205. static inline bool
  206. i915_gem_request_started(const struct drm_i915_gem_request *req)
  207. {
  208. return i915_seqno_passed(intel_engine_get_seqno(req->engine),
  209. req->previous_seqno);
  210. }
  211. static inline bool
  212. i915_gem_request_completed(const struct drm_i915_gem_request *req)
  213. {
  214. return i915_seqno_passed(intel_engine_get_seqno(req->engine),
  215. req->fence.seqno);
  216. }
  217. bool __i915_spin_request(const struct drm_i915_gem_request *request,
  218. int state, unsigned long timeout_us);
  219. static inline bool i915_spin_request(const struct drm_i915_gem_request *request,
  220. int state, unsigned long timeout_us)
  221. {
  222. return (i915_gem_request_started(request) &&
  223. __i915_spin_request(request, state, timeout_us));
  224. }
  225. /* We treat requests as fences. This is not be to confused with our
  226. * "fence registers" but pipeline synchronisation objects ala GL_ARB_sync.
  227. * We use the fences to synchronize access from the CPU with activity on the
  228. * GPU, for example, we should not rewrite an object's PTE whilst the GPU
  229. * is reading them. We also track fences at a higher level to provide
  230. * implicit synchronisation around GEM objects, e.g. set-domain will wait
  231. * for outstanding GPU rendering before marking the object ready for CPU
  232. * access, or a pageflip will wait until the GPU is complete before showing
  233. * the frame on the scanout.
  234. *
  235. * In order to use a fence, the object must track the fence it needs to
  236. * serialise with. For example, GEM objects want to track both read and
  237. * write access so that we can perform concurrent read operations between
  238. * the CPU and GPU engines, as well as waiting for all rendering to
  239. * complete, or waiting for the last GPU user of a "fence register". The
  240. * object then embeds a #i915_gem_active to track the most recent (in
  241. * retirement order) request relevant for the desired mode of access.
  242. * The #i915_gem_active is updated with i915_gem_active_set() to track the
  243. * most recent fence request, typically this is done as part of
  244. * i915_vma_move_to_active().
  245. *
  246. * When the #i915_gem_active completes (is retired), it will
  247. * signal its completion to the owner through a callback as well as mark
  248. * itself as idle (i915_gem_active.request == NULL). The owner
  249. * can then perform any action, such as delayed freeing of an active
  250. * resource including itself.
  251. */
  252. struct i915_gem_active;
  253. typedef void (*i915_gem_retire_fn)(struct i915_gem_active *,
  254. struct drm_i915_gem_request *);
  255. struct i915_gem_active {
  256. struct drm_i915_gem_request __rcu *request;
  257. struct list_head link;
  258. i915_gem_retire_fn retire;
  259. };
  260. void i915_gem_retire_noop(struct i915_gem_active *,
  261. struct drm_i915_gem_request *request);
  262. /**
  263. * init_request_active - prepares the activity tracker for use
  264. * @active - the active tracker
  265. * @func - a callback when then the tracker is retired (becomes idle),
  266. * can be NULL
  267. *
  268. * init_request_active() prepares the embedded @active struct for use as
  269. * an activity tracker, that is for tracking the last known active request
  270. * associated with it. When the last request becomes idle, when it is retired
  271. * after completion, the optional callback @func is invoked.
  272. */
  273. static inline void
  274. init_request_active(struct i915_gem_active *active,
  275. i915_gem_retire_fn retire)
  276. {
  277. INIT_LIST_HEAD(&active->link);
  278. active->retire = retire ?: i915_gem_retire_noop;
  279. }
  280. /**
  281. * i915_gem_active_set - updates the tracker to watch the current request
  282. * @active - the active tracker
  283. * @request - the request to watch
  284. *
  285. * i915_gem_active_set() watches the given @request for completion. Whilst
  286. * that @request is busy, the @active reports busy. When that @request is
  287. * retired, the @active tracker is updated to report idle.
  288. */
  289. static inline void
  290. i915_gem_active_set(struct i915_gem_active *active,
  291. struct drm_i915_gem_request *request)
  292. {
  293. list_move(&active->link, &request->active_list);
  294. rcu_assign_pointer(active->request, request);
  295. }
  296. static inline struct drm_i915_gem_request *
  297. __i915_gem_active_peek(const struct i915_gem_active *active)
  298. {
  299. /* Inside the error capture (running with the driver in an unknown
  300. * state), we want to bend the rules slightly (a lot).
  301. *
  302. * Work is in progress to make it safer, in the meantime this keeps
  303. * the known issue from spamming the logs.
  304. */
  305. return rcu_dereference_protected(active->request, 1);
  306. }
  307. /**
  308. * i915_gem_active_raw - return the active request
  309. * @active - the active tracker
  310. *
  311. * i915_gem_active_raw() returns the current request being tracked, or NULL.
  312. * It does not obtain a reference on the request for the caller, so the caller
  313. * must hold struct_mutex.
  314. */
  315. static inline struct drm_i915_gem_request *
  316. i915_gem_active_raw(const struct i915_gem_active *active, struct mutex *mutex)
  317. {
  318. return rcu_dereference_protected(active->request,
  319. lockdep_is_held(mutex));
  320. }
  321. /**
  322. * i915_gem_active_peek - report the active request being monitored
  323. * @active - the active tracker
  324. *
  325. * i915_gem_active_peek() returns the current request being tracked if
  326. * still active, or NULL. It does not obtain a reference on the request
  327. * for the caller, so the caller must hold struct_mutex.
  328. */
  329. static inline struct drm_i915_gem_request *
  330. i915_gem_active_peek(const struct i915_gem_active *active, struct mutex *mutex)
  331. {
  332. struct drm_i915_gem_request *request;
  333. request = i915_gem_active_raw(active, mutex);
  334. if (!request || i915_gem_request_completed(request))
  335. return NULL;
  336. return request;
  337. }
  338. /**
  339. * i915_gem_active_get - return a reference to the active request
  340. * @active - the active tracker
  341. *
  342. * i915_gem_active_get() returns a reference to the active request, or NULL
  343. * if the active tracker is idle. The caller must hold struct_mutex.
  344. */
  345. static inline struct drm_i915_gem_request *
  346. i915_gem_active_get(const struct i915_gem_active *active, struct mutex *mutex)
  347. {
  348. return i915_gem_request_get(i915_gem_active_peek(active, mutex));
  349. }
  350. /**
  351. * __i915_gem_active_get_rcu - return a reference to the active request
  352. * @active - the active tracker
  353. *
  354. * __i915_gem_active_get() returns a reference to the active request, or NULL
  355. * if the active tracker is idle. The caller must hold the RCU read lock, but
  356. * the returned pointer is safe to use outside of RCU.
  357. */
  358. static inline struct drm_i915_gem_request *
  359. __i915_gem_active_get_rcu(const struct i915_gem_active *active)
  360. {
  361. /* Performing a lockless retrieval of the active request is super
  362. * tricky. SLAB_DESTROY_BY_RCU merely guarantees that the backing
  363. * slab of request objects will not be freed whilst we hold the
  364. * RCU read lock. It does not guarantee that the request itself
  365. * will not be freed and then *reused*. Viz,
  366. *
  367. * Thread A Thread B
  368. *
  369. * req = active.request
  370. * retire(req) -> free(req);
  371. * (req is now first on the slab freelist)
  372. * active.request = NULL
  373. *
  374. * req = new submission on a new object
  375. * ref(req)
  376. *
  377. * To prevent the request from being reused whilst the caller
  378. * uses it, we take a reference like normal. Whilst acquiring
  379. * the reference we check that it is not in a destroyed state
  380. * (refcnt == 0). That prevents the request being reallocated
  381. * whilst the caller holds on to it. To check that the request
  382. * was not reallocated as we acquired the reference we have to
  383. * check that our request remains the active request across
  384. * the lookup, in the same manner as a seqlock. The visibility
  385. * of the pointer versus the reference counting is controlled
  386. * by using RCU barriers (rcu_dereference and rcu_assign_pointer).
  387. *
  388. * In the middle of all that, we inspect whether the request is
  389. * complete. Retiring is lazy so the request may be completed long
  390. * before the active tracker is updated. Querying whether the
  391. * request is complete is far cheaper (as it involves no locked
  392. * instructions setting cachelines to exclusive) than acquiring
  393. * the reference, so we do it first. The RCU read lock ensures the
  394. * pointer dereference is valid, but does not ensure that the
  395. * seqno nor HWS is the right one! However, if the request was
  396. * reallocated, that means the active tracker's request was complete.
  397. * If the new request is also complete, then both are and we can
  398. * just report the active tracker is idle. If the new request is
  399. * incomplete, then we acquire a reference on it and check that
  400. * it remained the active request.
  401. *
  402. * It is then imperative that we do not zero the request on
  403. * reallocation, so that we can chase the dangling pointers!
  404. * See i915_gem_request_alloc().
  405. */
  406. do {
  407. struct drm_i915_gem_request *request;
  408. request = rcu_dereference(active->request);
  409. if (!request || i915_gem_request_completed(request))
  410. return NULL;
  411. /* An especially silly compiler could decide to recompute the
  412. * result of i915_gem_request_completed, more specifically
  413. * re-emit the load for request->fence.seqno. A race would catch
  414. * a later seqno value, which could flip the result from true to
  415. * false. Which means part of the instructions below might not
  416. * be executed, while later on instructions are executed. Due to
  417. * barriers within the refcounting the inconsistency can't reach
  418. * past the call to i915_gem_request_get_rcu, but not executing
  419. * that while still executing i915_gem_request_put() creates
  420. * havoc enough. Prevent this with a compiler barrier.
  421. */
  422. barrier();
  423. request = i915_gem_request_get_rcu(request);
  424. /* What stops the following rcu_access_pointer() from occurring
  425. * before the above i915_gem_request_get_rcu()? If we were
  426. * to read the value before pausing to get the reference to
  427. * the request, we may not notice a change in the active
  428. * tracker.
  429. *
  430. * The rcu_access_pointer() is a mere compiler barrier, which
  431. * means both the CPU and compiler are free to perform the
  432. * memory read without constraint. The compiler only has to
  433. * ensure that any operations after the rcu_access_pointer()
  434. * occur afterwards in program order. This means the read may
  435. * be performed earlier by an out-of-order CPU, or adventurous
  436. * compiler.
  437. *
  438. * The atomic operation at the heart of
  439. * i915_gem_request_get_rcu(), see fence_get_rcu(), is
  440. * atomic_inc_not_zero() which is only a full memory barrier
  441. * when successful. That is, if i915_gem_request_get_rcu()
  442. * returns the request (and so with the reference counted
  443. * incremented) then the following read for rcu_access_pointer()
  444. * must occur after the atomic operation and so confirm
  445. * that this request is the one currently being tracked.
  446. *
  447. * The corresponding write barrier is part of
  448. * rcu_assign_pointer().
  449. */
  450. if (!request || request == rcu_access_pointer(active->request))
  451. return rcu_pointer_handoff(request);
  452. i915_gem_request_put(request);
  453. } while (1);
  454. }
  455. /**
  456. * i915_gem_active_get_unlocked - return a reference to the active request
  457. * @active - the active tracker
  458. *
  459. * i915_gem_active_get_unlocked() returns a reference to the active request,
  460. * or NULL if the active tracker is idle. The reference is obtained under RCU,
  461. * so no locking is required by the caller.
  462. *
  463. * The reference should be freed with i915_gem_request_put().
  464. */
  465. static inline struct drm_i915_gem_request *
  466. i915_gem_active_get_unlocked(const struct i915_gem_active *active)
  467. {
  468. struct drm_i915_gem_request *request;
  469. rcu_read_lock();
  470. request = __i915_gem_active_get_rcu(active);
  471. rcu_read_unlock();
  472. return request;
  473. }
  474. /**
  475. * i915_gem_active_isset - report whether the active tracker is assigned
  476. * @active - the active tracker
  477. *
  478. * i915_gem_active_isset() returns true if the active tracker is currently
  479. * assigned to a request. Due to the lazy retiring, that request may be idle
  480. * and this may report stale information.
  481. */
  482. static inline bool
  483. i915_gem_active_isset(const struct i915_gem_active *active)
  484. {
  485. return rcu_access_pointer(active->request);
  486. }
  487. /**
  488. * i915_gem_active_is_idle - report whether the active tracker is idle
  489. * @active - the active tracker
  490. *
  491. * i915_gem_active_is_idle() returns true if the active tracker is currently
  492. * unassigned or if the request is complete (but not yet retired). Requires
  493. * the caller to hold struct_mutex (but that can be relaxed if desired).
  494. */
  495. static inline bool
  496. i915_gem_active_is_idle(const struct i915_gem_active *active,
  497. struct mutex *mutex)
  498. {
  499. return !i915_gem_active_peek(active, mutex);
  500. }
  501. /**
  502. * i915_gem_active_wait - waits until the request is completed
  503. * @active - the active request on which to wait
  504. *
  505. * i915_gem_active_wait() waits until the request is completed before
  506. * returning. Note that it does not guarantee that the request is
  507. * retired first, see i915_gem_active_retire().
  508. *
  509. * i915_gem_active_wait() returns immediately if the active
  510. * request is already complete.
  511. */
  512. static inline int __must_check
  513. i915_gem_active_wait(const struct i915_gem_active *active, struct mutex *mutex)
  514. {
  515. struct drm_i915_gem_request *request;
  516. request = i915_gem_active_peek(active, mutex);
  517. if (!request)
  518. return 0;
  519. return i915_wait_request(request,
  520. I915_WAIT_INTERRUPTIBLE | I915_WAIT_LOCKED,
  521. NULL, NULL);
  522. }
  523. /**
  524. * i915_gem_active_wait_unlocked - waits until the request is completed
  525. * @active - the active request on which to wait
  526. * @flags - how to wait
  527. * @timeout - how long to wait at most
  528. * @rps - userspace client to charge for a waitboost
  529. *
  530. * i915_gem_active_wait_unlocked() waits until the request is completed before
  531. * returning, without requiring any locks to be held. Note that it does not
  532. * retire any requests before returning.
  533. *
  534. * This function relies on RCU in order to acquire the reference to the active
  535. * request without holding any locks. See __i915_gem_active_get_rcu() for the
  536. * glory details on how that is managed. Once the reference is acquired, we
  537. * can then wait upon the request, and afterwards release our reference,
  538. * free of any locking.
  539. *
  540. * This function wraps i915_wait_request(), see it for the full details on
  541. * the arguments.
  542. *
  543. * Returns 0 if successful, or a negative error code.
  544. */
  545. static inline int
  546. i915_gem_active_wait_unlocked(const struct i915_gem_active *active,
  547. unsigned int flags,
  548. s64 *timeout,
  549. struct intel_rps_client *rps)
  550. {
  551. struct drm_i915_gem_request *request;
  552. int ret = 0;
  553. request = i915_gem_active_get_unlocked(active);
  554. if (request) {
  555. ret = i915_wait_request(request, flags, timeout, rps);
  556. i915_gem_request_put(request);
  557. }
  558. return ret;
  559. }
  560. /**
  561. * i915_gem_active_retire - waits until the request is retired
  562. * @active - the active request on which to wait
  563. *
  564. * i915_gem_active_retire() waits until the request is completed,
  565. * and then ensures that at least the retirement handler for this
  566. * @active tracker is called before returning. If the @active
  567. * tracker is idle, the function returns immediately.
  568. */
  569. static inline int __must_check
  570. i915_gem_active_retire(struct i915_gem_active *active,
  571. struct mutex *mutex)
  572. {
  573. struct drm_i915_gem_request *request;
  574. int ret;
  575. request = i915_gem_active_raw(active, mutex);
  576. if (!request)
  577. return 0;
  578. ret = i915_wait_request(request,
  579. I915_WAIT_INTERRUPTIBLE | I915_WAIT_LOCKED,
  580. NULL, NULL);
  581. if (ret)
  582. return ret;
  583. list_del_init(&active->link);
  584. RCU_INIT_POINTER(active->request, NULL);
  585. active->retire(active, request);
  586. return 0;
  587. }
  588. /* Convenience functions for peeking at state inside active's request whilst
  589. * guarded by the struct_mutex.
  590. */
  591. static inline uint32_t
  592. i915_gem_active_get_seqno(const struct i915_gem_active *active,
  593. struct mutex *mutex)
  594. {
  595. return i915_gem_request_get_seqno(i915_gem_active_peek(active, mutex));
  596. }
  597. static inline struct intel_engine_cs *
  598. i915_gem_active_get_engine(const struct i915_gem_active *active,
  599. struct mutex *mutex)
  600. {
  601. return i915_gem_request_get_engine(i915_gem_active_peek(active, mutex));
  602. }
  603. #define for_each_active(mask, idx) \
  604. for (; mask ? idx = ffs(mask) - 1, 1 : 0; mask &= ~BIT(idx))
  605. #endif /* I915_GEM_REQUEST_H */