pvr_sync.c 6.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289
  1. // SPDX-License-Identifier: GPL-2.0-only OR MIT
  2. /* Copyright (c) 2023 Imagination Technologies Ltd. */
  3. #include <uapi/drm/pvr_drm.h>
  4. #include <drm/drm_syncobj.h>
  5. #include <drm/gpu_scheduler.h>
  6. #include <linux/xarray.h>
  7. #include <linux/dma-fence-unwrap.h>
  8. #include "pvr_device.h"
  9. #include "pvr_queue.h"
  10. #include "pvr_sync.h"
  11. static int
  12. pvr_check_sync_op(const struct drm_pvr_sync_op *sync_op)
  13. {
  14. u8 handle_type;
  15. if (sync_op->flags & ~DRM_PVR_SYNC_OP_FLAGS_MASK)
  16. return -EINVAL;
  17. handle_type = sync_op->flags & DRM_PVR_SYNC_OP_FLAG_HANDLE_TYPE_MASK;
  18. if (handle_type != DRM_PVR_SYNC_OP_FLAG_HANDLE_TYPE_SYNCOBJ &&
  19. handle_type != DRM_PVR_SYNC_OP_FLAG_HANDLE_TYPE_TIMELINE_SYNCOBJ)
  20. return -EINVAL;
  21. if (handle_type == DRM_PVR_SYNC_OP_FLAG_HANDLE_TYPE_SYNCOBJ &&
  22. sync_op->value != 0)
  23. return -EINVAL;
  24. return 0;
  25. }
  26. static void
  27. pvr_sync_signal_free(struct pvr_sync_signal *sig_sync)
  28. {
  29. if (!sig_sync)
  30. return;
  31. drm_syncobj_put(sig_sync->syncobj);
  32. dma_fence_chain_free(sig_sync->chain);
  33. dma_fence_put(sig_sync->fence);
  34. kfree(sig_sync);
  35. }
  36. void
  37. pvr_sync_signal_array_cleanup(struct xarray *array)
  38. {
  39. struct pvr_sync_signal *sig_sync;
  40. unsigned long i;
  41. xa_for_each(array, i, sig_sync)
  42. pvr_sync_signal_free(sig_sync);
  43. xa_destroy(array);
  44. }
  45. static struct pvr_sync_signal *
  46. pvr_sync_signal_array_add(struct xarray *array, struct drm_file *file, u32 handle, u64 point)
  47. {
  48. struct pvr_sync_signal *sig_sync;
  49. struct dma_fence *cur_fence;
  50. int err;
  51. u32 id;
  52. sig_sync = kzalloc(sizeof(*sig_sync), GFP_KERNEL);
  53. if (!sig_sync)
  54. return ERR_PTR(-ENOMEM);
  55. sig_sync->handle = handle;
  56. sig_sync->point = point;
  57. if (point > 0) {
  58. sig_sync->chain = dma_fence_chain_alloc();
  59. if (!sig_sync->chain) {
  60. err = -ENOMEM;
  61. goto err_free_sig_sync;
  62. }
  63. }
  64. sig_sync->syncobj = drm_syncobj_find(file, handle);
  65. if (!sig_sync->syncobj) {
  66. err = -EINVAL;
  67. goto err_free_sig_sync;
  68. }
  69. /* Retrieve the current fence attached to that point. It's
  70. * perfectly fine to get a NULL fence here, it just means there's
  71. * no fence attached to that point yet.
  72. */
  73. if (!drm_syncobj_find_fence(file, handle, point, 0, &cur_fence))
  74. sig_sync->fence = cur_fence;
  75. err = xa_alloc(array, &id, sig_sync, xa_limit_32b, GFP_KERNEL);
  76. if (err)
  77. goto err_free_sig_sync;
  78. return sig_sync;
  79. err_free_sig_sync:
  80. pvr_sync_signal_free(sig_sync);
  81. return ERR_PTR(err);
  82. }
  83. static struct pvr_sync_signal *
  84. pvr_sync_signal_array_search(struct xarray *array, u32 handle, u64 point)
  85. {
  86. struct pvr_sync_signal *sig_sync;
  87. unsigned long i;
  88. xa_for_each(array, i, sig_sync) {
  89. if (handle == sig_sync->handle && point == sig_sync->point)
  90. return sig_sync;
  91. }
  92. return NULL;
  93. }
  94. static struct pvr_sync_signal *
  95. pvr_sync_signal_array_get(struct xarray *array, struct drm_file *file, u32 handle, u64 point)
  96. {
  97. struct pvr_sync_signal *sig_sync;
  98. sig_sync = pvr_sync_signal_array_search(array, handle, point);
  99. if (sig_sync)
  100. return sig_sync;
  101. return pvr_sync_signal_array_add(array, file, handle, point);
  102. }
  103. int
  104. pvr_sync_signal_array_collect_ops(struct xarray *array,
  105. struct drm_file *file,
  106. u32 sync_op_count,
  107. const struct drm_pvr_sync_op *sync_ops)
  108. {
  109. for (u32 i = 0; i < sync_op_count; i++) {
  110. struct pvr_sync_signal *sig_sync;
  111. int ret;
  112. if (!(sync_ops[i].flags & DRM_PVR_SYNC_OP_FLAG_SIGNAL))
  113. continue;
  114. ret = pvr_check_sync_op(&sync_ops[i]);
  115. if (ret)
  116. return ret;
  117. sig_sync = pvr_sync_signal_array_get(array, file,
  118. sync_ops[i].handle,
  119. sync_ops[i].value);
  120. if (IS_ERR(sig_sync))
  121. return PTR_ERR(sig_sync);
  122. }
  123. return 0;
  124. }
  125. int
  126. pvr_sync_signal_array_update_fences(struct xarray *array,
  127. u32 sync_op_count,
  128. const struct drm_pvr_sync_op *sync_ops,
  129. struct dma_fence *done_fence)
  130. {
  131. for (u32 i = 0; i < sync_op_count; i++) {
  132. struct dma_fence *old_fence;
  133. struct pvr_sync_signal *sig_sync;
  134. if (!(sync_ops[i].flags & DRM_PVR_SYNC_OP_FLAG_SIGNAL))
  135. continue;
  136. sig_sync = pvr_sync_signal_array_search(array, sync_ops[i].handle,
  137. sync_ops[i].value);
  138. if (WARN_ON(!sig_sync))
  139. return -EINVAL;
  140. old_fence = sig_sync->fence;
  141. sig_sync->fence = dma_fence_get(done_fence);
  142. dma_fence_put(old_fence);
  143. if (WARN_ON(!sig_sync->fence))
  144. return -EINVAL;
  145. }
  146. return 0;
  147. }
  148. void
  149. pvr_sync_signal_array_push_fences(struct xarray *array)
  150. {
  151. struct pvr_sync_signal *sig_sync;
  152. unsigned long i;
  153. xa_for_each(array, i, sig_sync) {
  154. if (sig_sync->chain) {
  155. drm_syncobj_add_point(sig_sync->syncobj, sig_sync->chain,
  156. sig_sync->fence, sig_sync->point);
  157. sig_sync->chain = NULL;
  158. } else {
  159. drm_syncobj_replace_fence(sig_sync->syncobj, sig_sync->fence);
  160. }
  161. }
  162. }
  163. static int
  164. pvr_sync_add_dep_to_job(struct drm_sched_job *job, struct dma_fence *f)
  165. {
  166. struct dma_fence_unwrap iter;
  167. u32 native_fence_count = 0;
  168. struct dma_fence *uf;
  169. int err = 0;
  170. dma_fence_unwrap_for_each(uf, &iter, f) {
  171. if (pvr_queue_fence_is_ufo_backed(uf))
  172. native_fence_count++;
  173. }
  174. /* No need to unwrap the fence if it's fully non-native. */
  175. if (!native_fence_count)
  176. return drm_sched_job_add_dependency(job, f);
  177. dma_fence_unwrap_for_each(uf, &iter, f) {
  178. /* There's no dma_fence_unwrap_stop() helper cleaning up the refs
  179. * owned by dma_fence_unwrap(), so let's just iterate over all
  180. * entries without doing anything when something failed.
  181. */
  182. if (err)
  183. continue;
  184. if (pvr_queue_fence_is_ufo_backed(uf)) {
  185. struct drm_sched_fence *s_fence = to_drm_sched_fence(uf);
  186. /* If this is a native dependency, we wait for the scheduled fence,
  187. * and we will let pvr_queue_run_job() issue FW waits.
  188. */
  189. err = drm_sched_job_add_dependency(job,
  190. dma_fence_get(&s_fence->scheduled));
  191. } else {
  192. err = drm_sched_job_add_dependency(job, dma_fence_get(uf));
  193. }
  194. }
  195. dma_fence_put(f);
  196. return err;
  197. }
  198. int
  199. pvr_sync_add_deps_to_job(struct pvr_file *pvr_file, struct drm_sched_job *job,
  200. u32 sync_op_count,
  201. const struct drm_pvr_sync_op *sync_ops,
  202. struct xarray *signal_array)
  203. {
  204. int err = 0;
  205. if (!sync_op_count)
  206. return 0;
  207. for (u32 i = 0; i < sync_op_count; i++) {
  208. struct pvr_sync_signal *sig_sync;
  209. struct dma_fence *fence;
  210. if (sync_ops[i].flags & DRM_PVR_SYNC_OP_FLAG_SIGNAL)
  211. continue;
  212. err = pvr_check_sync_op(&sync_ops[i]);
  213. if (err)
  214. return err;
  215. sig_sync = pvr_sync_signal_array_search(signal_array, sync_ops[i].handle,
  216. sync_ops[i].value);
  217. if (sig_sync) {
  218. if (WARN_ON(!sig_sync->fence))
  219. return -EINVAL;
  220. fence = dma_fence_get(sig_sync->fence);
  221. } else {
  222. err = drm_syncobj_find_fence(from_pvr_file(pvr_file), sync_ops[i].handle,
  223. sync_ops[i].value, 0, &fence);
  224. if (err)
  225. return err;
  226. }
  227. err = pvr_sync_add_dep_to_job(job, fence);
  228. if (err)
  229. return err;
  230. }
  231. return 0;
  232. }