kfd_mqd_manager.c 9.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312
  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 "kfd_mqd_manager.h"
  25. #include "amdgpu_amdkfd.h"
  26. #include "kfd_device_queue_manager.h"
  27. /* Mapping queue priority to pipe priority, indexed by queue priority */
  28. int pipe_priority_map[] = {
  29. KFD_PIPE_PRIORITY_CS_LOW,
  30. KFD_PIPE_PRIORITY_CS_LOW,
  31. KFD_PIPE_PRIORITY_CS_LOW,
  32. KFD_PIPE_PRIORITY_CS_LOW,
  33. KFD_PIPE_PRIORITY_CS_LOW,
  34. KFD_PIPE_PRIORITY_CS_LOW,
  35. KFD_PIPE_PRIORITY_CS_LOW,
  36. KFD_PIPE_PRIORITY_CS_MEDIUM,
  37. KFD_PIPE_PRIORITY_CS_MEDIUM,
  38. KFD_PIPE_PRIORITY_CS_MEDIUM,
  39. KFD_PIPE_PRIORITY_CS_MEDIUM,
  40. KFD_PIPE_PRIORITY_CS_HIGH,
  41. KFD_PIPE_PRIORITY_CS_HIGH,
  42. KFD_PIPE_PRIORITY_CS_HIGH,
  43. KFD_PIPE_PRIORITY_CS_HIGH,
  44. KFD_PIPE_PRIORITY_CS_HIGH
  45. };
  46. struct kfd_mem_obj *allocate_hiq_mqd(struct kfd_node *dev, struct queue_properties *q)
  47. {
  48. struct kfd_mem_obj *mqd_mem_obj;
  49. mqd_mem_obj = kzalloc(sizeof(struct kfd_mem_obj), GFP_KERNEL);
  50. if (!mqd_mem_obj)
  51. return NULL;
  52. mqd_mem_obj->gtt_mem = dev->dqm->hiq_sdma_mqd.gtt_mem;
  53. mqd_mem_obj->gpu_addr = dev->dqm->hiq_sdma_mqd.gpu_addr;
  54. mqd_mem_obj->cpu_ptr = dev->dqm->hiq_sdma_mqd.cpu_ptr;
  55. return mqd_mem_obj;
  56. }
  57. struct kfd_mem_obj *allocate_sdma_mqd(struct kfd_node *dev,
  58. struct queue_properties *q)
  59. {
  60. struct kfd_mem_obj *mqd_mem_obj;
  61. uint64_t offset;
  62. mqd_mem_obj = kzalloc(sizeof(struct kfd_mem_obj), GFP_KERNEL);
  63. if (!mqd_mem_obj)
  64. return NULL;
  65. offset = (q->sdma_engine_id *
  66. dev->kfd->device_info.num_sdma_queues_per_engine +
  67. q->sdma_queue_id) *
  68. dev->dqm->mqd_mgrs[KFD_MQD_TYPE_SDMA]->mqd_size;
  69. offset += dev->dqm->mqd_mgrs[KFD_MQD_TYPE_HIQ]->mqd_size *
  70. NUM_XCC(dev->xcc_mask);
  71. mqd_mem_obj->gtt_mem = (void *)((uint64_t)dev->dqm->hiq_sdma_mqd.gtt_mem
  72. + offset);
  73. mqd_mem_obj->gpu_addr = dev->dqm->hiq_sdma_mqd.gpu_addr + offset;
  74. mqd_mem_obj->cpu_ptr = (uint32_t *)((uint64_t)
  75. dev->dqm->hiq_sdma_mqd.cpu_ptr + offset);
  76. return mqd_mem_obj;
  77. }
  78. void free_mqd_hiq_sdma(struct mqd_manager *mm, void *mqd,
  79. struct kfd_mem_obj *mqd_mem_obj)
  80. {
  81. WARN_ON(!mqd_mem_obj->gtt_mem);
  82. kfree(mqd_mem_obj);
  83. }
  84. void mqd_symmetrically_map_cu_mask(struct mqd_manager *mm,
  85. const uint32_t *cu_mask, uint32_t cu_mask_count,
  86. uint32_t *se_mask, uint32_t inst)
  87. {
  88. struct amdgpu_cu_info *cu_info = &mm->dev->adev->gfx.cu_info;
  89. struct amdgpu_gfx_config *gfx_info = &mm->dev->adev->gfx.config;
  90. uint32_t cu_per_sh[KFD_MAX_NUM_SE][KFD_MAX_NUM_SH_PER_SE] = {0};
  91. bool wgp_mode_req = KFD_GC_VERSION(mm->dev) >= IP_VERSION(10, 0, 0);
  92. uint32_t en_mask = wgp_mode_req ? 0x3 : 0x1;
  93. int i, se, sh, cu, cu_bitmap_sh_mul, cu_inc = wgp_mode_req ? 2 : 1;
  94. uint32_t cu_active_per_node;
  95. int inc = cu_inc * NUM_XCC(mm->dev->xcc_mask);
  96. int xcc_inst = inst + ffs(mm->dev->xcc_mask) - 1;
  97. cu_active_per_node = cu_info->number / mm->dev->kfd->num_nodes;
  98. if (cu_mask_count > cu_active_per_node)
  99. cu_mask_count = cu_active_per_node;
  100. /* Exceeding these bounds corrupts the stack and indicates a coding error.
  101. * Returning with no CU's enabled will hang the queue, which should be
  102. * attention grabbing.
  103. */
  104. if (gfx_info->max_shader_engines > KFD_MAX_NUM_SE) {
  105. dev_err(mm->dev->adev->dev,
  106. "Exceeded KFD_MAX_NUM_SE, chip reports %d\n",
  107. gfx_info->max_shader_engines);
  108. return;
  109. }
  110. if (gfx_info->max_sh_per_se > KFD_MAX_NUM_SH_PER_SE) {
  111. dev_err(mm->dev->adev->dev,
  112. "Exceeded KFD_MAX_NUM_SH, chip reports %d\n",
  113. gfx_info->max_sh_per_se * gfx_info->max_shader_engines);
  114. return;
  115. }
  116. cu_bitmap_sh_mul = (KFD_GC_VERSION(mm->dev) >= IP_VERSION(11, 0, 0) &&
  117. KFD_GC_VERSION(mm->dev) < IP_VERSION(13, 0, 0)) ? 2 : 1;
  118. /* Count active CUs per SH.
  119. *
  120. * Some CUs in an SH may be disabled. HW expects disabled CUs to be
  121. * represented in the high bits of each SH's enable mask (the upper and lower
  122. * 16 bits of se_mask) and will take care of the actual distribution of
  123. * disabled CUs within each SH automatically.
  124. * Each half of se_mask must be filled only on bits 0-cu_per_sh[se][sh]-1.
  125. *
  126. * See note on Arcturus cu_bitmap layout in gfx_v9_0_get_cu_info.
  127. * See note on GFX11 cu_bitmap layout in gfx_v11_0_get_cu_info.
  128. */
  129. for (se = 0; se < gfx_info->max_shader_engines; se++)
  130. for (sh = 0; sh < gfx_info->max_sh_per_se; sh++)
  131. cu_per_sh[se][sh] = hweight32(
  132. cu_info->bitmap[xcc_inst][se % 4][sh + (se / 4) *
  133. cu_bitmap_sh_mul]);
  134. /* Symmetrically map cu_mask to all SEs & SHs:
  135. * se_mask programs up to 2 SH in the upper and lower 16 bits.
  136. *
  137. * Examples
  138. * Assuming 1 SH/SE, 4 SEs:
  139. * cu_mask[0] bit0 -> se_mask[0] bit0
  140. * cu_mask[0] bit1 -> se_mask[1] bit0
  141. * ...
  142. * cu_mask[0] bit4 -> se_mask[0] bit1
  143. * ...
  144. *
  145. * Assuming 2 SH/SE, 4 SEs
  146. * cu_mask[0] bit0 -> se_mask[0] bit0 (SE0,SH0,CU0)
  147. * cu_mask[0] bit1 -> se_mask[1] bit0 (SE1,SH0,CU0)
  148. * ...
  149. * cu_mask[0] bit4 -> se_mask[0] bit16 (SE0,SH1,CU0)
  150. * cu_mask[0] bit5 -> se_mask[1] bit16 (SE1,SH1,CU0)
  151. * ...
  152. * cu_mask[0] bit8 -> se_mask[0] bit1 (SE0,SH0,CU1)
  153. * ...
  154. *
  155. * For GFX 9.4.3, the following code only looks at a
  156. * subset of the cu_mask corresponding to the inst parameter.
  157. * If we have n XCCs under one GPU node
  158. * cu_mask[0] bit0 -> XCC0 se_mask[0] bit0 (XCC0,SE0,SH0,CU0)
  159. * cu_mask[0] bit1 -> XCC1 se_mask[0] bit0 (XCC1,SE0,SH0,CU0)
  160. * ..
  161. * cu_mask[0] bitn -> XCCn se_mask[0] bit0 (XCCn,SE0,SH0,CU0)
  162. * cu_mask[0] bit n+1 -> XCC0 se_mask[1] bit0 (XCC0,SE1,SH0,CU0)
  163. *
  164. * For example, if there are 6 XCCs under 1 KFD node, this code
  165. * running for each inst, will look at the bits as:
  166. * inst, inst + 6, inst + 12...
  167. *
  168. * First ensure all CUs are disabled, then enable user specified CUs.
  169. */
  170. for (i = 0; i < gfx_info->max_shader_engines; i++)
  171. se_mask[i] = 0;
  172. i = inst;
  173. for (cu = 0; cu < 16; cu += cu_inc) {
  174. for (sh = 0; sh < gfx_info->max_sh_per_se; sh++) {
  175. for (se = 0; se < gfx_info->max_shader_engines; se++) {
  176. if (cu_per_sh[se][sh] > cu) {
  177. if (cu_mask[i / 32] & (en_mask << (i % 32)))
  178. se_mask[se] |= en_mask << (cu + sh * 16);
  179. i += inc;
  180. if (i >= cu_mask_count)
  181. return;
  182. }
  183. }
  184. }
  185. }
  186. }
  187. int kfd_hiq_load_mqd_kiq(struct mqd_manager *mm, void *mqd,
  188. uint32_t pipe_id, uint32_t queue_id,
  189. struct queue_properties *p, struct mm_struct *mms)
  190. {
  191. return mm->dev->kfd2kgd->hiq_mqd_load(mm->dev->adev, mqd, pipe_id,
  192. queue_id, p->doorbell_off, 0);
  193. }
  194. int kfd_destroy_mqd_cp(struct mqd_manager *mm, void *mqd,
  195. enum kfd_preempt_type type, unsigned int timeout,
  196. uint32_t pipe_id, uint32_t queue_id)
  197. {
  198. return mm->dev->kfd2kgd->hqd_destroy(mm->dev->adev, mqd, type, timeout,
  199. pipe_id, queue_id, 0);
  200. }
  201. void kfd_free_mqd_cp(struct mqd_manager *mm, void *mqd,
  202. struct kfd_mem_obj *mqd_mem_obj)
  203. {
  204. if (mqd_mem_obj->gtt_mem) {
  205. amdgpu_amdkfd_free_gtt_mem(mm->dev->adev, &mqd_mem_obj->gtt_mem);
  206. kfree(mqd_mem_obj);
  207. } else {
  208. kfd_gtt_sa_free(mm->dev, mqd_mem_obj);
  209. }
  210. }
  211. bool kfd_is_occupied_cp(struct mqd_manager *mm, void *mqd,
  212. uint64_t queue_address, uint32_t pipe_id,
  213. uint32_t queue_id)
  214. {
  215. return mm->dev->kfd2kgd->hqd_is_occupied(mm->dev->adev, queue_address,
  216. pipe_id, queue_id, 0);
  217. }
  218. int kfd_load_mqd_sdma(struct mqd_manager *mm, void *mqd,
  219. uint32_t pipe_id, uint32_t queue_id,
  220. struct queue_properties *p, struct mm_struct *mms)
  221. {
  222. return mm->dev->kfd2kgd->hqd_sdma_load(mm->dev->adev, mqd,
  223. (uint32_t __user *)p->write_ptr,
  224. mms);
  225. }
  226. /*
  227. * preempt type here is ignored because there is only one way
  228. * to preempt sdma queue
  229. */
  230. int kfd_destroy_mqd_sdma(struct mqd_manager *mm, void *mqd,
  231. enum kfd_preempt_type type,
  232. unsigned int timeout, uint32_t pipe_id,
  233. uint32_t queue_id)
  234. {
  235. return mm->dev->kfd2kgd->hqd_sdma_destroy(mm->dev->adev, mqd, timeout);
  236. }
  237. bool kfd_is_occupied_sdma(struct mqd_manager *mm, void *mqd,
  238. uint64_t queue_address, uint32_t pipe_id,
  239. uint32_t queue_id)
  240. {
  241. return mm->dev->kfd2kgd->hqd_sdma_is_occupied(mm->dev->adev, mqd);
  242. }
  243. uint64_t kfd_hiq_mqd_stride(struct kfd_node *dev)
  244. {
  245. return dev->dqm->mqd_mgrs[KFD_MQD_TYPE_HIQ]->mqd_size;
  246. }
  247. void kfd_get_hiq_xcc_mqd(struct kfd_node *dev, struct kfd_mem_obj *mqd_mem_obj,
  248. uint32_t virtual_xcc_id)
  249. {
  250. uint64_t offset;
  251. offset = kfd_hiq_mqd_stride(dev) * virtual_xcc_id;
  252. mqd_mem_obj->gtt_mem = (virtual_xcc_id == 0) ?
  253. dev->dqm->hiq_sdma_mqd.gtt_mem : NULL;
  254. mqd_mem_obj->gpu_addr = dev->dqm->hiq_sdma_mqd.gpu_addr + offset;
  255. mqd_mem_obj->cpu_ptr = (uint32_t *)((uintptr_t)
  256. dev->dqm->hiq_sdma_mqd.cpu_ptr + offset);
  257. }
  258. uint64_t kfd_mqd_stride(struct mqd_manager *mm,
  259. struct queue_properties *q)
  260. {
  261. return mm->mqd_size;
  262. }
  263. bool kfd_check_hiq_mqd_doorbell_id(struct kfd_node *node, uint32_t doorbell_id,
  264. uint32_t inst)
  265. {
  266. if (doorbell_id) {
  267. struct device *dev = node->adev->dev;
  268. if (node->adev->xcp_mgr && node->adev->xcp_mgr->num_xcps > 0)
  269. dev_err(dev, "XCC %d: Queue preemption failed for queue with doorbell_id: %x\n",
  270. inst, doorbell_id);
  271. else
  272. dev_err(dev, "Queue preemption failed for queue with doorbell_id: %x\n",
  273. doorbell_id);
  274. return true;
  275. }
  276. return false;
  277. }