kfd_kernel_queue.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386
  1. // SPDX-License-Identifier: GPL-2.0 OR MIT
  2. /*
  3. * Copyright 2014-2022 Advanced Micro Devices, Inc.
  4. *
  5. * Permission is hereby granted, free of charge, to any person obtaining a
  6. * copy of this software and associated documentation files (the "Software"),
  7. * to deal in the Software without restriction, including without limitation
  8. * the rights to use, copy, modify, merge, publish, distribute, sublicense,
  9. * and/or sell copies of the Software, and to permit persons to whom the
  10. * Software is furnished to do so, subject to the following conditions:
  11. *
  12. * The above copyright notice and this permission notice shall be included in
  13. * all copies or substantial portions of the 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 COPYRIGHT HOLDER(S) OR AUTHOR(S) BE LIABLE FOR ANY CLAIM, DAMAGES OR
  19. * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
  20. * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
  21. * OTHER DEALINGS IN THE SOFTWARE.
  22. *
  23. */
  24. #include <linux/types.h>
  25. #include <linux/mutex.h>
  26. #include <linux/slab.h>
  27. #include <linux/printk.h>
  28. #include <linux/sched.h>
  29. #include "kfd_kernel_queue.h"
  30. #include "kfd_priv.h"
  31. #include "kfd_device_queue_manager.h"
  32. #include "kfd_pm4_headers.h"
  33. #include "kfd_pm4_opcodes.h"
  34. #include "amdgpu_reset.h"
  35. #define PM4_COUNT_ZERO (((1 << 15) - 1) << 16)
  36. /* Initialize a kernel queue, including allocations of GART memory
  37. * needed for the queue.
  38. */
  39. static bool kq_initialize(struct kernel_queue *kq, struct kfd_node *dev,
  40. enum kfd_queue_type type, unsigned int queue_size)
  41. {
  42. struct queue_properties prop;
  43. int retval;
  44. union PM4_MES_TYPE_3_HEADER nop;
  45. if (WARN_ON(type != KFD_QUEUE_TYPE_DIQ && type != KFD_QUEUE_TYPE_HIQ))
  46. return false;
  47. pr_debug("Initializing queue type %d size %d\n", KFD_QUEUE_TYPE_HIQ,
  48. queue_size);
  49. memset(&prop, 0, sizeof(prop));
  50. memset(&nop, 0, sizeof(nop));
  51. nop.opcode = IT_NOP;
  52. nop.type = PM4_TYPE_3;
  53. nop.u32all |= PM4_COUNT_ZERO;
  54. kq->dev = dev;
  55. kq->nop_packet = nop.u32all;
  56. switch (type) {
  57. case KFD_QUEUE_TYPE_DIQ:
  58. kq->mqd_mgr = dev->dqm->mqd_mgrs[KFD_MQD_TYPE_DIQ];
  59. break;
  60. case KFD_QUEUE_TYPE_HIQ:
  61. kq->mqd_mgr = dev->dqm->mqd_mgrs[KFD_MQD_TYPE_HIQ];
  62. break;
  63. default:
  64. dev_err(dev->adev->dev, "Invalid queue type %d\n", type);
  65. return false;
  66. }
  67. if (!kq->mqd_mgr)
  68. return false;
  69. prop.doorbell_ptr = kfd_get_kernel_doorbell(dev->kfd, &prop.doorbell_off);
  70. if (!prop.doorbell_ptr) {
  71. dev_err(dev->adev->dev, "Failed to initialize doorbell");
  72. goto err_get_kernel_doorbell;
  73. }
  74. retval = kfd_gtt_sa_allocate(dev, queue_size, &kq->pq);
  75. if (retval != 0) {
  76. dev_err(dev->adev->dev, "Failed to init pq queues size %d\n",
  77. queue_size);
  78. goto err_pq_allocate_vidmem;
  79. }
  80. kq->pq_kernel_addr = kq->pq->cpu_ptr;
  81. kq->pq_gpu_addr = kq->pq->gpu_addr;
  82. /* For CIK family asics, kq->eop_mem is not needed */
  83. if (dev->adev->asic_type > CHIP_MULLINS) {
  84. retval = kfd_gtt_sa_allocate(dev, PAGE_SIZE, &kq->eop_mem);
  85. if (retval != 0)
  86. goto err_eop_allocate_vidmem;
  87. kq->eop_gpu_addr = kq->eop_mem->gpu_addr;
  88. kq->eop_kernel_addr = kq->eop_mem->cpu_ptr;
  89. memset(kq->eop_kernel_addr, 0, PAGE_SIZE);
  90. }
  91. retval = kfd_gtt_sa_allocate(dev, sizeof(*kq->rptr_kernel),
  92. &kq->rptr_mem);
  93. if (retval != 0)
  94. goto err_rptr_allocate_vidmem;
  95. kq->rptr_kernel = kq->rptr_mem->cpu_ptr;
  96. kq->rptr_gpu_addr = kq->rptr_mem->gpu_addr;
  97. retval = kfd_gtt_sa_allocate(dev, dev->kfd->device_info.doorbell_size,
  98. &kq->wptr_mem);
  99. if (retval != 0)
  100. goto err_wptr_allocate_vidmem;
  101. kq->wptr_kernel = kq->wptr_mem->cpu_ptr;
  102. kq->wptr_gpu_addr = kq->wptr_mem->gpu_addr;
  103. memset(kq->pq_kernel_addr, 0, queue_size);
  104. memset(kq->rptr_kernel, 0, sizeof(*kq->rptr_kernel));
  105. memset(kq->wptr_kernel, 0, dev->kfd->device_info.doorbell_size);
  106. prop.queue_size = queue_size;
  107. prop.is_interop = false;
  108. prop.is_gws = false;
  109. prop.priority = 1;
  110. prop.queue_percent = 100;
  111. prop.type = type;
  112. prop.vmid = 0;
  113. prop.queue_address = kq->pq_gpu_addr;
  114. prop.read_ptr = (uint32_t *) kq->rptr_gpu_addr;
  115. prop.write_ptr = (uint32_t *) kq->wptr_gpu_addr;
  116. prop.eop_ring_buffer_address = kq->eop_gpu_addr;
  117. prop.eop_ring_buffer_size = PAGE_SIZE;
  118. if (init_queue(&kq->queue, &prop) != 0)
  119. goto err_init_queue;
  120. kq->queue->device = dev;
  121. kq->queue->process = kfd_get_process(current);
  122. kq->queue->mqd_mem_obj = kq->mqd_mgr->allocate_mqd(kq->mqd_mgr->dev,
  123. &kq->queue->properties);
  124. if (!kq->queue->mqd_mem_obj)
  125. goto err_allocate_mqd;
  126. kq->mqd_mgr->init_mqd(kq->mqd_mgr, &kq->queue->mqd,
  127. kq->queue->mqd_mem_obj,
  128. &kq->queue->gart_mqd_addr,
  129. &kq->queue->properties);
  130. /* assign HIQ to HQD */
  131. if (type == KFD_QUEUE_TYPE_HIQ) {
  132. pr_debug("Assigning hiq to hqd\n");
  133. kq->queue->pipe = KFD_CIK_HIQ_PIPE;
  134. kq->queue->queue = KFD_CIK_HIQ_QUEUE;
  135. kq->mqd_mgr->load_mqd(kq->mqd_mgr, kq->queue->mqd,
  136. kq->queue->pipe, kq->queue->queue,
  137. &kq->queue->properties, NULL);
  138. } else {
  139. /* allocate fence for DIQ */
  140. retval = kfd_gtt_sa_allocate(dev, sizeof(uint32_t),
  141. &kq->fence_mem_obj);
  142. if (retval != 0)
  143. goto err_alloc_fence;
  144. kq->fence_kernel_address = kq->fence_mem_obj->cpu_ptr;
  145. kq->fence_gpu_addr = kq->fence_mem_obj->gpu_addr;
  146. }
  147. print_queue(kq->queue);
  148. return true;
  149. err_alloc_fence:
  150. kq->mqd_mgr->free_mqd(kq->mqd_mgr, kq->queue->mqd, kq->queue->mqd_mem_obj);
  151. err_allocate_mqd:
  152. uninit_queue(kq->queue);
  153. err_init_queue:
  154. kfd_gtt_sa_free(dev, kq->wptr_mem);
  155. err_wptr_allocate_vidmem:
  156. kfd_gtt_sa_free(dev, kq->rptr_mem);
  157. err_rptr_allocate_vidmem:
  158. kfd_gtt_sa_free(dev, kq->eop_mem);
  159. err_eop_allocate_vidmem:
  160. kfd_gtt_sa_free(dev, kq->pq);
  161. err_pq_allocate_vidmem:
  162. kfd_release_kernel_doorbell(dev->kfd, prop.doorbell_ptr);
  163. err_get_kernel_doorbell:
  164. return false;
  165. }
  166. /* Uninitialize a kernel queue and free all its memory usages. */
  167. static void kq_uninitialize(struct kernel_queue *kq)
  168. {
  169. if (kq->queue->properties.type == KFD_QUEUE_TYPE_HIQ && down_read_trylock(&kq->dev->adev->reset_domain->sem)) {
  170. kq->mqd_mgr->destroy_mqd(kq->mqd_mgr,
  171. kq->queue->mqd,
  172. KFD_PREEMPT_TYPE_WAVEFRONT_RESET,
  173. KFD_UNMAP_LATENCY_MS,
  174. kq->queue->pipe,
  175. kq->queue->queue);
  176. up_read(&kq->dev->adev->reset_domain->sem);
  177. }
  178. else if (kq->queue->properties.type == KFD_QUEUE_TYPE_DIQ)
  179. kfd_gtt_sa_free(kq->dev, kq->fence_mem_obj);
  180. kq->mqd_mgr->free_mqd(kq->mqd_mgr, kq->queue->mqd,
  181. kq->queue->mqd_mem_obj);
  182. kfd_gtt_sa_free(kq->dev, kq->rptr_mem);
  183. kfd_gtt_sa_free(kq->dev, kq->wptr_mem);
  184. /* For CIK family asics, kq->eop_mem is Null, kfd_gtt_sa_free()
  185. * is able to handle NULL properly.
  186. */
  187. kfd_gtt_sa_free(kq->dev, kq->eop_mem);
  188. kfd_gtt_sa_free(kq->dev, kq->pq);
  189. kfd_release_kernel_doorbell(kq->dev->kfd,
  190. kq->queue->properties.doorbell_ptr);
  191. uninit_queue(kq->queue);
  192. }
  193. int kq_acquire_packet_buffer(struct kernel_queue *kq,
  194. size_t packet_size_in_dwords, unsigned int **buffer_ptr)
  195. {
  196. size_t available_size;
  197. size_t queue_size_dwords;
  198. uint32_t wptr, rptr;
  199. uint64_t wptr64;
  200. unsigned int *queue_address;
  201. /* When rptr == wptr, the buffer is empty.
  202. * When rptr == wptr + 1, the buffer is full.
  203. * It is always rptr that advances to the position of wptr, rather than
  204. * the opposite. So we can only use up to queue_size_dwords - 1 dwords.
  205. */
  206. rptr = *kq->rptr_kernel;
  207. wptr = kq->pending_wptr;
  208. wptr64 = kq->pending_wptr64;
  209. queue_address = (unsigned int *)kq->pq_kernel_addr;
  210. queue_size_dwords = kq->queue->properties.queue_size / 4;
  211. pr_debug("rptr: %d\n", rptr);
  212. pr_debug("wptr: %d\n", wptr);
  213. pr_debug("queue_address 0x%p\n", queue_address);
  214. available_size = (rptr + queue_size_dwords - 1 - wptr) %
  215. queue_size_dwords;
  216. if (packet_size_in_dwords > available_size) {
  217. /*
  218. * make sure calling functions know
  219. * acquire_packet_buffer() failed
  220. */
  221. goto err_no_space;
  222. }
  223. if (wptr + packet_size_in_dwords >= queue_size_dwords) {
  224. /* make sure after rolling back to position 0, there is
  225. * still enough space.
  226. */
  227. if (packet_size_in_dwords >= rptr)
  228. goto err_no_space;
  229. /* fill nops, roll back and start at position 0 */
  230. while (wptr > 0) {
  231. queue_address[wptr] = kq->nop_packet;
  232. wptr = (wptr + 1) % queue_size_dwords;
  233. wptr64++;
  234. }
  235. }
  236. *buffer_ptr = &queue_address[wptr];
  237. kq->pending_wptr = wptr + packet_size_in_dwords;
  238. kq->pending_wptr64 = wptr64 + packet_size_in_dwords;
  239. return 0;
  240. err_no_space:
  241. *buffer_ptr = NULL;
  242. return -ENOMEM;
  243. }
  244. int kq_submit_packet(struct kernel_queue *kq)
  245. {
  246. #ifdef DEBUG
  247. int i;
  248. for (i = *kq->wptr_kernel; i < kq->pending_wptr; i++) {
  249. pr_debug("0x%2X ", kq->pq_kernel_addr[i]);
  250. if (i % 15 == 0)
  251. pr_debug("\n");
  252. }
  253. pr_debug("\n");
  254. #endif
  255. /* Fatal err detected, packet submission won't go through */
  256. if (amdgpu_amdkfd_is_fed(kq->dev->adev))
  257. return -EIO;
  258. if (kq->dev->kfd->device_info.doorbell_size == 8) {
  259. *kq->wptr64_kernel = kq->pending_wptr64;
  260. write_kernel_doorbell64(kq->queue->properties.doorbell_ptr,
  261. kq->pending_wptr64);
  262. } else {
  263. *kq->wptr_kernel = kq->pending_wptr;
  264. write_kernel_doorbell(kq->queue->properties.doorbell_ptr,
  265. kq->pending_wptr);
  266. }
  267. return 0;
  268. }
  269. void kq_rollback_packet(struct kernel_queue *kq)
  270. {
  271. if (kq->dev->kfd->device_info.doorbell_size == 8) {
  272. kq->pending_wptr64 = *kq->wptr64_kernel;
  273. kq->pending_wptr = *kq->wptr_kernel %
  274. (kq->queue->properties.queue_size / 4);
  275. } else {
  276. kq->pending_wptr = *kq->wptr_kernel;
  277. }
  278. }
  279. struct kernel_queue *kernel_queue_init(struct kfd_node *dev,
  280. enum kfd_queue_type type)
  281. {
  282. struct kernel_queue *kq;
  283. kq = kzalloc(sizeof(*kq), GFP_KERNEL);
  284. if (!kq)
  285. return NULL;
  286. if (kq_initialize(kq, dev, type, KFD_KERNEL_QUEUE_SIZE))
  287. return kq;
  288. dev_err(dev->adev->dev, "Failed to init kernel queue\n");
  289. kfree(kq);
  290. return NULL;
  291. }
  292. void kernel_queue_uninit(struct kernel_queue *kq)
  293. {
  294. kq_uninitialize(kq);
  295. kfree(kq);
  296. }
  297. /* FIXME: Can this test be removed? */
  298. static __attribute__((unused)) void test_kq(struct kfd_node *dev)
  299. {
  300. struct kernel_queue *kq;
  301. uint32_t *buffer, i;
  302. int retval;
  303. dev_err(dev->adev->dev, "Starting kernel queue test\n");
  304. kq = kernel_queue_init(dev, KFD_QUEUE_TYPE_HIQ);
  305. if (unlikely(!kq)) {
  306. dev_err(dev->adev->dev, " Failed to initialize HIQ\n");
  307. dev_err(dev->adev->dev, "Kernel queue test failed\n");
  308. return;
  309. }
  310. retval = kq_acquire_packet_buffer(kq, 5, &buffer);
  311. if (unlikely(retval != 0)) {
  312. dev_err(dev->adev->dev, " Failed to acquire packet buffer\n");
  313. dev_err(dev->adev->dev, "Kernel queue test failed\n");
  314. return;
  315. }
  316. for (i = 0; i < 5; i++)
  317. buffer[i] = kq->nop_packet;
  318. kq_submit_packet(kq);
  319. dev_err(dev->adev->dev, "Ending kernel queue test\n");
  320. }