msm_fence.c 4.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /*
  3. * Copyright (C) 2013-2016 Red Hat
  4. * Author: Rob Clark <robdclark@gmail.com>
  5. */
  6. #include <linux/dma-fence.h>
  7. #include "msm_drv.h"
  8. #include "msm_fence.h"
  9. #include "msm_gpu.h"
  10. static struct msm_gpu *fctx2gpu(struct msm_fence_context *fctx)
  11. {
  12. struct msm_drm_private *priv = fctx->dev->dev_private;
  13. return priv->gpu;
  14. }
  15. static enum hrtimer_restart deadline_timer(struct hrtimer *t)
  16. {
  17. struct msm_fence_context *fctx = container_of(t,
  18. struct msm_fence_context, deadline_timer);
  19. kthread_queue_work(fctx2gpu(fctx)->worker, &fctx->deadline_work);
  20. return HRTIMER_NORESTART;
  21. }
  22. static void deadline_work(struct kthread_work *work)
  23. {
  24. struct msm_fence_context *fctx = container_of(work,
  25. struct msm_fence_context, deadline_work);
  26. /* If deadline fence has already passed, nothing to do: */
  27. if (msm_fence_completed(fctx, fctx->next_deadline_fence))
  28. return;
  29. msm_devfreq_boost(fctx2gpu(fctx), 2);
  30. }
  31. struct msm_fence_context *
  32. msm_fence_context_alloc(struct drm_device *dev, volatile uint32_t *fenceptr,
  33. const char *name)
  34. {
  35. struct msm_fence_context *fctx;
  36. static int index = 0;
  37. fctx = kzalloc(sizeof(*fctx), GFP_KERNEL);
  38. if (!fctx)
  39. return ERR_PTR(-ENOMEM);
  40. fctx->dev = dev;
  41. strscpy(fctx->name, name, sizeof(fctx->name));
  42. fctx->context = dma_fence_context_alloc(1);
  43. fctx->index = index++;
  44. fctx->fenceptr = fenceptr;
  45. spin_lock_init(&fctx->spinlock);
  46. /*
  47. * Start out close to the 32b fence rollover point, so we can
  48. * catch bugs with fence comparisons.
  49. */
  50. fctx->last_fence = 0xffffff00;
  51. fctx->completed_fence = fctx->last_fence;
  52. *fctx->fenceptr = fctx->last_fence;
  53. hrtimer_init(&fctx->deadline_timer, CLOCK_MONOTONIC, HRTIMER_MODE_ABS);
  54. fctx->deadline_timer.function = deadline_timer;
  55. kthread_init_work(&fctx->deadline_work, deadline_work);
  56. fctx->next_deadline = ktime_get();
  57. return fctx;
  58. }
  59. void msm_fence_context_free(struct msm_fence_context *fctx)
  60. {
  61. kfree(fctx);
  62. }
  63. bool msm_fence_completed(struct msm_fence_context *fctx, uint32_t fence)
  64. {
  65. /*
  66. * Note: Check completed_fence first, as fenceptr is in a write-combine
  67. * mapping, so it will be more expensive to read.
  68. */
  69. return (int32_t)(fctx->completed_fence - fence) >= 0 ||
  70. (int32_t)(*fctx->fenceptr - fence) >= 0;
  71. }
  72. /* called from irq handler and workqueue (in recover path) */
  73. void msm_update_fence(struct msm_fence_context *fctx, uint32_t fence)
  74. {
  75. unsigned long flags;
  76. spin_lock_irqsave(&fctx->spinlock, flags);
  77. if (fence_after(fence, fctx->completed_fence))
  78. fctx->completed_fence = fence;
  79. if (msm_fence_completed(fctx, fctx->next_deadline_fence))
  80. hrtimer_cancel(&fctx->deadline_timer);
  81. spin_unlock_irqrestore(&fctx->spinlock, flags);
  82. }
  83. struct msm_fence {
  84. struct dma_fence base;
  85. struct msm_fence_context *fctx;
  86. };
  87. static inline struct msm_fence *to_msm_fence(struct dma_fence *fence)
  88. {
  89. return container_of(fence, struct msm_fence, base);
  90. }
  91. static const char *msm_fence_get_driver_name(struct dma_fence *fence)
  92. {
  93. return "msm";
  94. }
  95. static const char *msm_fence_get_timeline_name(struct dma_fence *fence)
  96. {
  97. struct msm_fence *f = to_msm_fence(fence);
  98. return f->fctx->name;
  99. }
  100. static bool msm_fence_signaled(struct dma_fence *fence)
  101. {
  102. struct msm_fence *f = to_msm_fence(fence);
  103. return msm_fence_completed(f->fctx, f->base.seqno);
  104. }
  105. static void msm_fence_set_deadline(struct dma_fence *fence, ktime_t deadline)
  106. {
  107. struct msm_fence *f = to_msm_fence(fence);
  108. struct msm_fence_context *fctx = f->fctx;
  109. unsigned long flags;
  110. ktime_t now;
  111. spin_lock_irqsave(&fctx->spinlock, flags);
  112. now = ktime_get();
  113. if (ktime_after(now, fctx->next_deadline) ||
  114. ktime_before(deadline, fctx->next_deadline)) {
  115. fctx->next_deadline = deadline;
  116. fctx->next_deadline_fence =
  117. max(fctx->next_deadline_fence, (uint32_t)fence->seqno);
  118. /*
  119. * Set timer to trigger boost 3ms before deadline, or
  120. * if we are already less than 3ms before the deadline
  121. * schedule boost work immediately.
  122. */
  123. deadline = ktime_sub(deadline, ms_to_ktime(3));
  124. if (ktime_after(now, deadline)) {
  125. kthread_queue_work(fctx2gpu(fctx)->worker,
  126. &fctx->deadline_work);
  127. } else {
  128. hrtimer_start(&fctx->deadline_timer, deadline,
  129. HRTIMER_MODE_ABS);
  130. }
  131. }
  132. spin_unlock_irqrestore(&fctx->spinlock, flags);
  133. }
  134. static const struct dma_fence_ops msm_fence_ops = {
  135. .get_driver_name = msm_fence_get_driver_name,
  136. .get_timeline_name = msm_fence_get_timeline_name,
  137. .signaled = msm_fence_signaled,
  138. .set_deadline = msm_fence_set_deadline,
  139. };
  140. struct dma_fence *
  141. msm_fence_alloc(void)
  142. {
  143. struct msm_fence *f;
  144. f = kzalloc(sizeof(*f), GFP_KERNEL);
  145. if (!f)
  146. return ERR_PTR(-ENOMEM);
  147. return &f->base;
  148. }
  149. void
  150. msm_fence_init(struct dma_fence *fence, struct msm_fence_context *fctx)
  151. {
  152. struct msm_fence *f = to_msm_fence(fence);
  153. f->fctx = fctx;
  154. /*
  155. * Until this point, the fence was just some pre-allocated memory,
  156. * no-one should have taken a reference to it yet.
  157. */
  158. WARN_ON(kref_read(&fence->refcount));
  159. dma_fence_init(&f->base, &msm_fence_ops, &fctx->spinlock,
  160. fctx->context, ++fctx->last_fence);
  161. }