1 /* 2 * Copyright 2014 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 24 #include <linux/slab.h> 25 #include <linux/mutex.h> 26 #include "kfd_device_queue_manager.h" 27 #include "kfd_kernel_queue.h" 28 #include "kfd_priv.h" 29 30 static inline void inc_wptr(unsigned int *wptr, unsigned int increment_bytes, 31 unsigned int buffer_size_bytes) 32 { 33 unsigned int temp = *wptr + increment_bytes / sizeof(uint32_t); 34 35 WARN((temp * sizeof(uint32_t)) > buffer_size_bytes, 36 "Runlist IB overflow"); 37 *wptr = temp; 38 } 39 40 static void pm_calc_rlib_size(struct packet_manager *pm, 41 unsigned int *rlib_size, 42 bool *over_subscription) 43 { 44 unsigned int process_count, queue_count, compute_queue_count; 45 unsigned int map_queue_size; 46 unsigned int max_proc_per_quantum = 1; 47 struct kfd_dev *dev = pm->dqm->dev; 48 49 process_count = pm->dqm->processes_count; 50 queue_count = pm->dqm->queue_count; 51 compute_queue_count = queue_count - pm->dqm->sdma_queue_count - 52 pm->dqm->xgmi_sdma_queue_count; 53 54 /* check if there is over subscription 55 * Note: the arbitration between the number of VMIDs and 56 * hws_max_conc_proc has been done in 57 * kgd2kfd_device_init(). 58 */ 59 *over_subscription = false; 60 61 if (dev->max_proc_per_quantum > 1) 62 max_proc_per_quantum = dev->max_proc_per_quantum; 63 64 if ((process_count > max_proc_per_quantum) || 65 compute_queue_count > get_queues_num(pm->dqm)) { 66 *over_subscription = true; 67 pr_debug("Over subscribed runlist\n"); 68 } 69 70 map_queue_size = pm->pmf->map_queues_size; 71 /* calculate run list ib allocation size */ 72 *rlib_size = process_count * pm->pmf->map_process_size + 73 queue_count * map_queue_size; 74 75 /* 76 * Increase the allocation size in case we need a chained run list 77 * when over subscription 78 */ 79 if (*over_subscription) 80 *rlib_size += pm->pmf->runlist_size; 81 82 pr_debug("runlist ib size %d\n", *rlib_size); 83 } 84 85 static int pm_allocate_runlist_ib(struct packet_manager *pm, 86 unsigned int **rl_buffer, 87 uint64_t *rl_gpu_buffer, 88 unsigned int *rl_buffer_size, 89 bool *is_over_subscription) 90 { 91 int retval; 92 93 if (WARN_ON(pm->allocated)) 94 return -EINVAL; 95 96 pm_calc_rlib_size(pm, rl_buffer_size, is_over_subscription); 97 98 mutex_lock(&pm->lock); 99 100 retval = kfd_gtt_sa_allocate(pm->dqm->dev, *rl_buffer_size, 101 &pm->ib_buffer_obj); 102 103 if (retval) { 104 pr_err("Failed to allocate runlist IB\n"); 105 goto out; 106 } 107 108 *(void **)rl_buffer = pm->ib_buffer_obj->cpu_ptr; 109 *rl_gpu_buffer = pm->ib_buffer_obj->gpu_addr; 110 111 memset(*rl_buffer, 0, *rl_buffer_size); 112 pm->allocated = true; 113 114 out: 115 mutex_unlock(&pm->lock); 116 return retval; 117 } 118 119 static int pm_create_runlist_ib(struct packet_manager *pm, 120 struct list_head *queues, 121 uint64_t *rl_gpu_addr, 122 size_t *rl_size_bytes) 123 { 124 unsigned int alloc_size_bytes; 125 unsigned int *rl_buffer, rl_wptr, i; 126 int retval, proccesses_mapped; 127 struct device_process_node *cur; 128 struct qcm_process_device *qpd; 129 struct queue *q; 130 struct kernel_queue *kq; 131 bool is_over_subscription; 132 133 rl_wptr = retval = proccesses_mapped = 0; 134 135 retval = pm_allocate_runlist_ib(pm, &rl_buffer, rl_gpu_addr, 136 &alloc_size_bytes, &is_over_subscription); 137 if (retval) 138 return retval; 139 140 *rl_size_bytes = alloc_size_bytes; 141 pm->ib_size_bytes = alloc_size_bytes; 142 143 pr_debug("Building runlist ib process count: %d queues count %d\n", 144 pm->dqm->processes_count, pm->dqm->queue_count); 145 146 /* build the run list ib packet */ 147 list_for_each_entry(cur, queues, list) { 148 qpd = cur->qpd; 149 /* build map process packet */ 150 if (proccesses_mapped >= pm->dqm->processes_count) { 151 pr_debug("Not enough space left in runlist IB\n"); 152 pm_release_ib(pm); 153 return -ENOMEM; 154 } 155 156 retval = pm->pmf->map_process(pm, &rl_buffer[rl_wptr], qpd); 157 if (retval) 158 return retval; 159 160 proccesses_mapped++; 161 inc_wptr(&rl_wptr, pm->pmf->map_process_size, 162 alloc_size_bytes); 163 164 list_for_each_entry(kq, &qpd->priv_queue_list, list) { 165 if (!kq->queue->properties.is_active) 166 continue; 167 168 pr_debug("static_queue, mapping kernel q %d, is debug status %d\n", 169 kq->queue->queue, qpd->is_debug); 170 171 retval = pm->pmf->map_queues(pm, 172 &rl_buffer[rl_wptr], 173 kq->queue, 174 qpd->is_debug); 175 if (retval) 176 return retval; 177 178 inc_wptr(&rl_wptr, 179 pm->pmf->map_queues_size, 180 alloc_size_bytes); 181 } 182 183 list_for_each_entry(q, &qpd->queues_list, list) { 184 if (!q->properties.is_active) 185 continue; 186 187 pr_debug("static_queue, mapping user queue %d, is debug status %d\n", 188 q->queue, qpd->is_debug); 189 190 retval = pm->pmf->map_queues(pm, 191 &rl_buffer[rl_wptr], 192 q, 193 qpd->is_debug); 194 195 if (retval) 196 return retval; 197 198 inc_wptr(&rl_wptr, 199 pm->pmf->map_queues_size, 200 alloc_size_bytes); 201 } 202 } 203 204 pr_debug("Finished map process and queues to runlist\n"); 205 206 if (is_over_subscription) { 207 if (!pm->is_over_subscription) 208 pr_warn("Runlist is getting oversubscribed. Expect reduced ROCm performance.\n"); 209 retval = pm->pmf->runlist(pm, &rl_buffer[rl_wptr], 210 *rl_gpu_addr, 211 alloc_size_bytes / sizeof(uint32_t), 212 true); 213 } 214 pm->is_over_subscription = is_over_subscription; 215 216 for (i = 0; i < alloc_size_bytes / sizeof(uint32_t); i++) 217 pr_debug("0x%2X ", rl_buffer[i]); 218 pr_debug("\n"); 219 220 return retval; 221 } 222 223 int pm_init(struct packet_manager *pm, struct device_queue_manager *dqm) 224 { 225 switch (dqm->dev->device_info->asic_family) { 226 case CHIP_KAVERI: 227 case CHIP_HAWAII: 228 /* PM4 packet structures on CIK are the same as on VI */ 229 case CHIP_CARRIZO: 230 case CHIP_TONGA: 231 case CHIP_FIJI: 232 case CHIP_POLARIS10: 233 case CHIP_POLARIS11: 234 case CHIP_POLARIS12: 235 case CHIP_VEGAM: 236 pm->pmf = &kfd_vi_pm_funcs; 237 break; 238 case CHIP_VEGA10: 239 case CHIP_VEGA12: 240 case CHIP_VEGA20: 241 case CHIP_RAVEN: 242 case CHIP_RENOIR: 243 case CHIP_ARCTURUS: 244 case CHIP_NAVI10: 245 case CHIP_NAVI12: 246 case CHIP_NAVI14: 247 pm->pmf = &kfd_v9_pm_funcs; 248 break; 249 default: 250 WARN(1, "Unexpected ASIC family %u", 251 dqm->dev->device_info->asic_family); 252 return -EINVAL; 253 } 254 255 pm->dqm = dqm; 256 mutex_init(&pm->lock); 257 pm->priv_queue = kernel_queue_init(dqm->dev, KFD_QUEUE_TYPE_HIQ); 258 if (!pm->priv_queue) { 259 mutex_destroy(&pm->lock); 260 return -ENOMEM; 261 } 262 pm->allocated = false; 263 264 return 0; 265 } 266 267 void pm_uninit(struct packet_manager *pm, bool hanging) 268 { 269 mutex_destroy(&pm->lock); 270 kernel_queue_uninit(pm->priv_queue, hanging); 271 } 272 273 int pm_send_set_resources(struct packet_manager *pm, 274 struct scheduling_resources *res) 275 { 276 uint32_t *buffer, size; 277 int retval = 0; 278 279 size = pm->pmf->set_resources_size; 280 mutex_lock(&pm->lock); 281 kq_acquire_packet_buffer(pm->priv_queue, 282 size / sizeof(uint32_t), 283 (unsigned int **)&buffer); 284 if (!buffer) { 285 pr_err("Failed to allocate buffer on kernel queue\n"); 286 retval = -ENOMEM; 287 goto out; 288 } 289 290 retval = pm->pmf->set_resources(pm, buffer, res); 291 if (!retval) 292 kq_submit_packet(pm->priv_queue); 293 else 294 kq_rollback_packet(pm->priv_queue); 295 296 out: 297 mutex_unlock(&pm->lock); 298 299 return retval; 300 } 301 302 int pm_send_runlist(struct packet_manager *pm, struct list_head *dqm_queues) 303 { 304 uint64_t rl_gpu_ib_addr; 305 uint32_t *rl_buffer; 306 size_t rl_ib_size, packet_size_dwords; 307 int retval; 308 309 retval = pm_create_runlist_ib(pm, dqm_queues, &rl_gpu_ib_addr, 310 &rl_ib_size); 311 if (retval) 312 goto fail_create_runlist_ib; 313 314 pr_debug("runlist IB address: 0x%llX\n", rl_gpu_ib_addr); 315 316 packet_size_dwords = pm->pmf->runlist_size / sizeof(uint32_t); 317 mutex_lock(&pm->lock); 318 319 retval = kq_acquire_packet_buffer(pm->priv_queue, 320 packet_size_dwords, &rl_buffer); 321 if (retval) 322 goto fail_acquire_packet_buffer; 323 324 retval = pm->pmf->runlist(pm, rl_buffer, rl_gpu_ib_addr, 325 rl_ib_size / sizeof(uint32_t), false); 326 if (retval) 327 goto fail_create_runlist; 328 329 kq_submit_packet(pm->priv_queue); 330 331 mutex_unlock(&pm->lock); 332 333 return retval; 334 335 fail_create_runlist: 336 kq_rollback_packet(pm->priv_queue); 337 fail_acquire_packet_buffer: 338 mutex_unlock(&pm->lock); 339 fail_create_runlist_ib: 340 pm_release_ib(pm); 341 return retval; 342 } 343 344 int pm_send_query_status(struct packet_manager *pm, uint64_t fence_address, 345 uint32_t fence_value) 346 { 347 uint32_t *buffer, size; 348 int retval = 0; 349 350 if (WARN_ON(!fence_address)) 351 return -EFAULT; 352 353 size = pm->pmf->query_status_size; 354 mutex_lock(&pm->lock); 355 kq_acquire_packet_buffer(pm->priv_queue, 356 size / sizeof(uint32_t), (unsigned int **)&buffer); 357 if (!buffer) { 358 pr_err("Failed to allocate buffer on kernel queue\n"); 359 retval = -ENOMEM; 360 goto out; 361 } 362 363 retval = pm->pmf->query_status(pm, buffer, fence_address, fence_value); 364 if (!retval) 365 kq_submit_packet(pm->priv_queue); 366 else 367 kq_rollback_packet(pm->priv_queue); 368 369 out: 370 mutex_unlock(&pm->lock); 371 return retval; 372 } 373 374 int pm_send_unmap_queue(struct packet_manager *pm, enum kfd_queue_type type, 375 enum kfd_unmap_queues_filter filter, 376 uint32_t filter_param, bool reset, 377 unsigned int sdma_engine) 378 { 379 uint32_t *buffer, size; 380 int retval = 0; 381 382 size = pm->pmf->unmap_queues_size; 383 mutex_lock(&pm->lock); 384 kq_acquire_packet_buffer(pm->priv_queue, 385 size / sizeof(uint32_t), (unsigned int **)&buffer); 386 if (!buffer) { 387 pr_err("Failed to allocate buffer on kernel queue\n"); 388 retval = -ENOMEM; 389 goto out; 390 } 391 392 retval = pm->pmf->unmap_queues(pm, buffer, type, filter, filter_param, 393 reset, sdma_engine); 394 if (!retval) 395 kq_submit_packet(pm->priv_queue); 396 else 397 kq_rollback_packet(pm->priv_queue); 398 399 out: 400 mutex_unlock(&pm->lock); 401 return retval; 402 } 403 404 void pm_release_ib(struct packet_manager *pm) 405 { 406 mutex_lock(&pm->lock); 407 if (pm->allocated) { 408 kfd_gtt_sa_free(pm->dqm->dev, pm->ib_buffer_obj); 409 pm->allocated = false; 410 } 411 mutex_unlock(&pm->lock); 412 } 413 414 #if defined(CONFIG_DEBUG_FS) 415 416 int pm_debugfs_runlist(struct seq_file *m, void *data) 417 { 418 struct packet_manager *pm = data; 419 420 mutex_lock(&pm->lock); 421 422 if (!pm->allocated) { 423 seq_puts(m, " No active runlist\n"); 424 goto out; 425 } 426 427 seq_hex_dump(m, " ", DUMP_PREFIX_OFFSET, 32, 4, 428 pm->ib_buffer_obj->cpu_ptr, pm->ib_size_bytes, false); 429 430 out: 431 mutex_unlock(&pm->lock); 432 return 0; 433 } 434 435 int pm_debugfs_hang_hws(struct packet_manager *pm) 436 { 437 uint32_t *buffer, size; 438 int r = 0; 439 440 size = pm->pmf->query_status_size; 441 mutex_lock(&pm->lock); 442 kq_acquire_packet_buffer(pm->priv_queue, 443 size / sizeof(uint32_t), (unsigned int **)&buffer); 444 if (!buffer) { 445 pr_err("Failed to allocate buffer on kernel queue\n"); 446 r = -ENOMEM; 447 goto out; 448 } 449 memset(buffer, 0x55, size); 450 kq_submit_packet(pm->priv_queue); 451 452 pr_info("Submitting %x %x %x %x %x %x %x to HIQ to hang the HWS.", 453 buffer[0], buffer[1], buffer[2], buffer[3], 454 buffer[4], buffer[5], buffer[6]); 455 out: 456 mutex_unlock(&pm->lock); 457 return r; 458 } 459 460 461 #endif 462