sched_fence.c 7.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242
  1. /*
  2. * Copyright 2015 Advanced Micro Devices, Inc.
  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 shall be included in
  12. * all copies or substantial portions of the Software.
  13. *
  14. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  15. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  16. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
  17. * THE COPYRIGHT HOLDER(S) OR AUTHOR(S) BE LIABLE FOR ANY CLAIM, DAMAGES OR
  18. * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
  19. * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
  20. * OTHER DEALINGS IN THE SOFTWARE.
  21. *
  22. */
  23. #include <linux/export.h>
  24. #include <linux/module.h>
  25. #include <linux/sched.h>
  26. #include <linux/slab.h>
  27. #include <linux/wait.h>
  28. #include <drm/gpu_scheduler.h>
  29. #include "sched_internal.h"
  30. static struct kmem_cache *sched_fence_slab;
  31. static int __init drm_sched_fence_slab_init(void)
  32. {
  33. sched_fence_slab = KMEM_CACHE(drm_sched_fence, SLAB_HWCACHE_ALIGN);
  34. if (!sched_fence_slab)
  35. return -ENOMEM;
  36. return 0;
  37. }
  38. static void __exit drm_sched_fence_slab_fini(void)
  39. {
  40. rcu_barrier();
  41. kmem_cache_destroy(sched_fence_slab);
  42. }
  43. static void drm_sched_fence_set_parent(struct drm_sched_fence *s_fence,
  44. struct dma_fence *fence)
  45. {
  46. /*
  47. * smp_store_release() to ensure another thread racing us
  48. * in drm_sched_fence_set_deadline_finished() sees the
  49. * fence's parent set before test_bit()
  50. */
  51. smp_store_release(&s_fence->parent, dma_fence_get(fence));
  52. if (test_bit(DRM_SCHED_FENCE_FLAG_HAS_DEADLINE_BIT,
  53. &s_fence->finished.flags))
  54. dma_fence_set_deadline(fence, s_fence->deadline);
  55. }
  56. void drm_sched_fence_scheduled(struct drm_sched_fence *fence,
  57. struct dma_fence *parent)
  58. {
  59. /* Set the parent before signaling the scheduled fence, such that,
  60. * any waiter expecting the parent to be filled after the job has
  61. * been scheduled (which is the case for drivers delegating waits
  62. * to some firmware) doesn't have to busy wait for parent to show
  63. * up.
  64. */
  65. if (!IS_ERR_OR_NULL(parent))
  66. drm_sched_fence_set_parent(fence, parent);
  67. dma_fence_signal(&fence->scheduled);
  68. }
  69. void drm_sched_fence_finished(struct drm_sched_fence *fence, int result)
  70. {
  71. if (result)
  72. dma_fence_set_error(&fence->finished, result);
  73. dma_fence_signal(&fence->finished);
  74. }
  75. static const char *drm_sched_fence_get_driver_name(struct dma_fence *fence)
  76. {
  77. return "drm_sched";
  78. }
  79. static const char *drm_sched_fence_get_timeline_name(struct dma_fence *f)
  80. {
  81. struct drm_sched_fence *fence = to_drm_sched_fence(f);
  82. return (const char *)fence->sched->name;
  83. }
  84. static void drm_sched_fence_free_rcu(struct rcu_head *rcu)
  85. {
  86. struct dma_fence *f = container_of(rcu, struct dma_fence, rcu);
  87. struct drm_sched_fence *fence = to_drm_sched_fence(f);
  88. if (!WARN_ON_ONCE(!fence))
  89. kmem_cache_free(sched_fence_slab, fence);
  90. }
  91. /**
  92. * drm_sched_fence_free - free up an uninitialized fence
  93. *
  94. * @fence: fence to free
  95. *
  96. * Free up the fence memory. Should only be used if drm_sched_fence_init()
  97. * has not been called yet.
  98. */
  99. void drm_sched_fence_free(struct drm_sched_fence *fence)
  100. {
  101. /* This function should not be called if the fence has been initialized. */
  102. if (!WARN_ON_ONCE(fence->sched))
  103. kmem_cache_free(sched_fence_slab, fence);
  104. }
  105. /**
  106. * drm_sched_fence_release_scheduled - callback that fence can be freed
  107. *
  108. * @f: fence
  109. *
  110. * This function is called when the reference count becomes zero.
  111. * It just RCU schedules freeing up the fence.
  112. */
  113. static void drm_sched_fence_release_scheduled(struct dma_fence *f)
  114. {
  115. struct drm_sched_fence *fence = to_drm_sched_fence(f);
  116. dma_fence_put(fence->parent);
  117. call_rcu(&fence->finished.rcu, drm_sched_fence_free_rcu);
  118. }
  119. /**
  120. * drm_sched_fence_release_finished - drop extra reference
  121. *
  122. * @f: fence
  123. *
  124. * Drop the extra reference from the scheduled fence to the base fence.
  125. */
  126. static void drm_sched_fence_release_finished(struct dma_fence *f)
  127. {
  128. struct drm_sched_fence *fence = to_drm_sched_fence(f);
  129. dma_fence_put(&fence->scheduled);
  130. }
  131. static void drm_sched_fence_set_deadline_finished(struct dma_fence *f,
  132. ktime_t deadline)
  133. {
  134. struct drm_sched_fence *fence = to_drm_sched_fence(f);
  135. struct dma_fence *parent;
  136. unsigned long flags;
  137. spin_lock_irqsave(&fence->lock, flags);
  138. /* If we already have an earlier deadline, keep it: */
  139. if (test_bit(DRM_SCHED_FENCE_FLAG_HAS_DEADLINE_BIT, &f->flags) &&
  140. ktime_before(fence->deadline, deadline)) {
  141. spin_unlock_irqrestore(&fence->lock, flags);
  142. return;
  143. }
  144. fence->deadline = deadline;
  145. set_bit(DRM_SCHED_FENCE_FLAG_HAS_DEADLINE_BIT, &f->flags);
  146. spin_unlock_irqrestore(&fence->lock, flags);
  147. /*
  148. * smp_load_aquire() to ensure that if we are racing another
  149. * thread calling drm_sched_fence_set_parent(), that we see
  150. * the parent set before it calls test_bit(HAS_DEADLINE_BIT)
  151. */
  152. parent = smp_load_acquire(&fence->parent);
  153. if (parent)
  154. dma_fence_set_deadline(parent, deadline);
  155. }
  156. static const struct dma_fence_ops drm_sched_fence_ops_scheduled = {
  157. .get_driver_name = drm_sched_fence_get_driver_name,
  158. .get_timeline_name = drm_sched_fence_get_timeline_name,
  159. .release = drm_sched_fence_release_scheduled,
  160. };
  161. static const struct dma_fence_ops drm_sched_fence_ops_finished = {
  162. .get_driver_name = drm_sched_fence_get_driver_name,
  163. .get_timeline_name = drm_sched_fence_get_timeline_name,
  164. .release = drm_sched_fence_release_finished,
  165. .set_deadline = drm_sched_fence_set_deadline_finished,
  166. };
  167. struct drm_sched_fence *to_drm_sched_fence(struct dma_fence *f)
  168. {
  169. if (f->ops == &drm_sched_fence_ops_scheduled)
  170. return container_of(f, struct drm_sched_fence, scheduled);
  171. if (f->ops == &drm_sched_fence_ops_finished)
  172. return container_of(f, struct drm_sched_fence, finished);
  173. return NULL;
  174. }
  175. EXPORT_SYMBOL(to_drm_sched_fence);
  176. struct drm_sched_fence *drm_sched_fence_alloc(struct drm_sched_entity *entity,
  177. void *owner,
  178. u64 drm_client_id)
  179. {
  180. struct drm_sched_fence *fence = NULL;
  181. fence = kmem_cache_zalloc(sched_fence_slab, GFP_KERNEL);
  182. if (fence == NULL)
  183. return NULL;
  184. fence->owner = owner;
  185. fence->drm_client_id = drm_client_id;
  186. spin_lock_init(&fence->lock);
  187. return fence;
  188. }
  189. void drm_sched_fence_init(struct drm_sched_fence *fence,
  190. struct drm_sched_entity *entity)
  191. {
  192. unsigned seq;
  193. fence->sched = entity->rq->sched;
  194. seq = atomic_inc_return(&entity->fence_seq);
  195. dma_fence_init(&fence->scheduled, &drm_sched_fence_ops_scheduled,
  196. &fence->lock, entity->fence_context, seq);
  197. dma_fence_init(&fence->finished, &drm_sched_fence_ops_finished,
  198. &fence->lock, entity->fence_context + 1, seq);
  199. }
  200. module_init(drm_sched_fence_slab_init);
  201. module_exit(drm_sched_fence_slab_fini);
  202. MODULE_DESCRIPTION("DRM GPU scheduler");
  203. MODULE_LICENSE("GPL and additional rights");