amdgpu_cs.c 26 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019
  1. /*
  2. * Copyright 2008 Jerome Glisse.
  3. * All Rights Reserved.
  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 (including the next
  13. * paragraph) shall be included in all copies or substantial portions of the
  14. * Software.
  15. *
  16. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  17. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  18. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
  19. * PRECISION INSIGHT AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
  20. * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
  21. * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
  22. * DEALINGS IN THE SOFTWARE.
  23. *
  24. * Authors:
  25. * Jerome Glisse <glisse@freedesktop.org>
  26. */
  27. #include <linux/list_sort.h>
  28. #include <drm/drmP.h>
  29. #include <drm/amdgpu_drm.h>
  30. #include "amdgpu.h"
  31. #include "amdgpu_trace.h"
  32. #define AMDGPU_CS_MAX_PRIORITY 32u
  33. #define AMDGPU_CS_NUM_BUCKETS (AMDGPU_CS_MAX_PRIORITY + 1)
  34. /* This is based on the bucket sort with O(n) time complexity.
  35. * An item with priority "i" is added to bucket[i]. The lists are then
  36. * concatenated in descending order.
  37. */
  38. struct amdgpu_cs_buckets {
  39. struct list_head bucket[AMDGPU_CS_NUM_BUCKETS];
  40. };
  41. static void amdgpu_cs_buckets_init(struct amdgpu_cs_buckets *b)
  42. {
  43. unsigned i;
  44. for (i = 0; i < AMDGPU_CS_NUM_BUCKETS; i++)
  45. INIT_LIST_HEAD(&b->bucket[i]);
  46. }
  47. static void amdgpu_cs_buckets_add(struct amdgpu_cs_buckets *b,
  48. struct list_head *item, unsigned priority)
  49. {
  50. /* Since buffers which appear sooner in the relocation list are
  51. * likely to be used more often than buffers which appear later
  52. * in the list, the sort mustn't change the ordering of buffers
  53. * with the same priority, i.e. it must be stable.
  54. */
  55. list_add_tail(item, &b->bucket[min(priority, AMDGPU_CS_MAX_PRIORITY)]);
  56. }
  57. static void amdgpu_cs_buckets_get_list(struct amdgpu_cs_buckets *b,
  58. struct list_head *out_list)
  59. {
  60. unsigned i;
  61. /* Connect the sorted buckets in the output list. */
  62. for (i = 0; i < AMDGPU_CS_NUM_BUCKETS; i++) {
  63. list_splice(&b->bucket[i], out_list);
  64. }
  65. }
  66. int amdgpu_cs_get_ring(struct amdgpu_device *adev, u32 ip_type,
  67. u32 ip_instance, u32 ring,
  68. struct amdgpu_ring **out_ring)
  69. {
  70. /* Right now all IPs have only one instance - multiple rings. */
  71. if (ip_instance != 0) {
  72. DRM_ERROR("invalid ip instance: %d\n", ip_instance);
  73. return -EINVAL;
  74. }
  75. switch (ip_type) {
  76. default:
  77. DRM_ERROR("unknown ip type: %d\n", ip_type);
  78. return -EINVAL;
  79. case AMDGPU_HW_IP_GFX:
  80. if (ring < adev->gfx.num_gfx_rings) {
  81. *out_ring = &adev->gfx.gfx_ring[ring];
  82. } else {
  83. DRM_ERROR("only %d gfx rings are supported now\n",
  84. adev->gfx.num_gfx_rings);
  85. return -EINVAL;
  86. }
  87. break;
  88. case AMDGPU_HW_IP_COMPUTE:
  89. if (ring < adev->gfx.num_compute_rings) {
  90. *out_ring = &adev->gfx.compute_ring[ring];
  91. } else {
  92. DRM_ERROR("only %d compute rings are supported now\n",
  93. adev->gfx.num_compute_rings);
  94. return -EINVAL;
  95. }
  96. break;
  97. case AMDGPU_HW_IP_DMA:
  98. if (ring < adev->sdma.num_instances) {
  99. *out_ring = &adev->sdma.instance[ring].ring;
  100. } else {
  101. DRM_ERROR("only %d SDMA rings are supported\n",
  102. adev->sdma.num_instances);
  103. return -EINVAL;
  104. }
  105. break;
  106. case AMDGPU_HW_IP_UVD:
  107. *out_ring = &adev->uvd.ring;
  108. break;
  109. case AMDGPU_HW_IP_VCE:
  110. if (ring < 2){
  111. *out_ring = &adev->vce.ring[ring];
  112. } else {
  113. DRM_ERROR("only two VCE rings are supported\n");
  114. return -EINVAL;
  115. }
  116. break;
  117. }
  118. return 0;
  119. }
  120. struct amdgpu_cs_parser *amdgpu_cs_parser_create(struct amdgpu_device *adev,
  121. struct drm_file *filp,
  122. struct amdgpu_ctx *ctx,
  123. struct amdgpu_ib *ibs,
  124. uint32_t num_ibs)
  125. {
  126. struct amdgpu_cs_parser *parser;
  127. int i;
  128. parser = kzalloc(sizeof(struct amdgpu_cs_parser), GFP_KERNEL);
  129. if (!parser)
  130. return NULL;
  131. parser->adev = adev;
  132. parser->filp = filp;
  133. parser->ctx = ctx;
  134. parser->ibs = ibs;
  135. parser->num_ibs = num_ibs;
  136. for (i = 0; i < num_ibs; i++)
  137. ibs[i].ctx = ctx;
  138. return parser;
  139. }
  140. int amdgpu_cs_parser_init(struct amdgpu_cs_parser *p, void *data)
  141. {
  142. union drm_amdgpu_cs *cs = data;
  143. uint64_t *chunk_array_user;
  144. uint64_t *chunk_array;
  145. struct amdgpu_fpriv *fpriv = p->filp->driver_priv;
  146. unsigned size;
  147. int i;
  148. int ret;
  149. if (cs->in.num_chunks == 0)
  150. return 0;
  151. chunk_array = kmalloc_array(cs->in.num_chunks, sizeof(uint64_t), GFP_KERNEL);
  152. if (!chunk_array)
  153. return -ENOMEM;
  154. p->ctx = amdgpu_ctx_get(fpriv, cs->in.ctx_id);
  155. if (!p->ctx) {
  156. ret = -EINVAL;
  157. goto free_chunk;
  158. }
  159. p->bo_list = amdgpu_bo_list_get(fpriv, cs->in.bo_list_handle);
  160. /* get chunks */
  161. INIT_LIST_HEAD(&p->validated);
  162. chunk_array_user = (uint64_t __user *)(unsigned long)(cs->in.chunks);
  163. if (copy_from_user(chunk_array, chunk_array_user,
  164. sizeof(uint64_t)*cs->in.num_chunks)) {
  165. ret = -EFAULT;
  166. goto put_bo_list;
  167. }
  168. p->nchunks = cs->in.num_chunks;
  169. p->chunks = kmalloc_array(p->nchunks, sizeof(struct amdgpu_cs_chunk),
  170. GFP_KERNEL);
  171. if (!p->chunks) {
  172. ret = -ENOMEM;
  173. goto put_bo_list;
  174. }
  175. for (i = 0; i < p->nchunks; i++) {
  176. struct drm_amdgpu_cs_chunk __user **chunk_ptr = NULL;
  177. struct drm_amdgpu_cs_chunk user_chunk;
  178. uint32_t __user *cdata;
  179. chunk_ptr = (void __user *)(unsigned long)chunk_array[i];
  180. if (copy_from_user(&user_chunk, chunk_ptr,
  181. sizeof(struct drm_amdgpu_cs_chunk))) {
  182. ret = -EFAULT;
  183. i--;
  184. goto free_partial_kdata;
  185. }
  186. p->chunks[i].chunk_id = user_chunk.chunk_id;
  187. p->chunks[i].length_dw = user_chunk.length_dw;
  188. size = p->chunks[i].length_dw;
  189. cdata = (void __user *)(unsigned long)user_chunk.chunk_data;
  190. p->chunks[i].user_ptr = cdata;
  191. p->chunks[i].kdata = drm_malloc_ab(size, sizeof(uint32_t));
  192. if (p->chunks[i].kdata == NULL) {
  193. ret = -ENOMEM;
  194. i--;
  195. goto free_partial_kdata;
  196. }
  197. size *= sizeof(uint32_t);
  198. if (copy_from_user(p->chunks[i].kdata, cdata, size)) {
  199. ret = -EFAULT;
  200. goto free_partial_kdata;
  201. }
  202. switch (p->chunks[i].chunk_id) {
  203. case AMDGPU_CHUNK_ID_IB:
  204. p->num_ibs++;
  205. break;
  206. case AMDGPU_CHUNK_ID_FENCE:
  207. size = sizeof(struct drm_amdgpu_cs_chunk_fence);
  208. if (p->chunks[i].length_dw * sizeof(uint32_t) >= size) {
  209. uint32_t handle;
  210. struct drm_gem_object *gobj;
  211. struct drm_amdgpu_cs_chunk_fence *fence_data;
  212. fence_data = (void *)p->chunks[i].kdata;
  213. handle = fence_data->handle;
  214. gobj = drm_gem_object_lookup(p->adev->ddev,
  215. p->filp, handle);
  216. if (gobj == NULL) {
  217. ret = -EINVAL;
  218. goto free_partial_kdata;
  219. }
  220. p->uf.bo = gem_to_amdgpu_bo(gobj);
  221. p->uf.offset = fence_data->offset;
  222. } else {
  223. ret = -EINVAL;
  224. goto free_partial_kdata;
  225. }
  226. break;
  227. case AMDGPU_CHUNK_ID_DEPENDENCIES:
  228. break;
  229. default:
  230. ret = -EINVAL;
  231. goto free_partial_kdata;
  232. }
  233. }
  234. p->ibs = kcalloc(p->num_ibs, sizeof(struct amdgpu_ib), GFP_KERNEL);
  235. if (!p->ibs) {
  236. ret = -ENOMEM;
  237. goto free_all_kdata;
  238. }
  239. kfree(chunk_array);
  240. return 0;
  241. free_all_kdata:
  242. i = p->nchunks - 1;
  243. free_partial_kdata:
  244. for (; i >= 0; i--)
  245. drm_free_large(p->chunks[i].kdata);
  246. kfree(p->chunks);
  247. put_bo_list:
  248. if (p->bo_list)
  249. amdgpu_bo_list_put(p->bo_list);
  250. amdgpu_ctx_put(p->ctx);
  251. free_chunk:
  252. kfree(chunk_array);
  253. return ret;
  254. }
  255. /* Returns how many bytes TTM can move per IB.
  256. */
  257. static u64 amdgpu_cs_get_threshold_for_moves(struct amdgpu_device *adev)
  258. {
  259. u64 real_vram_size = adev->mc.real_vram_size;
  260. u64 vram_usage = atomic64_read(&adev->vram_usage);
  261. /* This function is based on the current VRAM usage.
  262. *
  263. * - If all of VRAM is free, allow relocating the number of bytes that
  264. * is equal to 1/4 of the size of VRAM for this IB.
  265. * - If more than one half of VRAM is occupied, only allow relocating
  266. * 1 MB of data for this IB.
  267. *
  268. * - From 0 to one half of used VRAM, the threshold decreases
  269. * linearly.
  270. * __________________
  271. * 1/4 of -|\ |
  272. * VRAM | \ |
  273. * | \ |
  274. * | \ |
  275. * | \ |
  276. * | \ |
  277. * | \ |
  278. * | \________|1 MB
  279. * |----------------|
  280. * VRAM 0 % 100 %
  281. * used used
  282. *
  283. * Note: It's a threshold, not a limit. The threshold must be crossed
  284. * for buffer relocations to stop, so any buffer of an arbitrary size
  285. * can be moved as long as the threshold isn't crossed before
  286. * the relocation takes place. We don't want to disable buffer
  287. * relocations completely.
  288. *
  289. * The idea is that buffers should be placed in VRAM at creation time
  290. * and TTM should only do a minimum number of relocations during
  291. * command submission. In practice, you need to submit at least
  292. * a dozen IBs to move all buffers to VRAM if they are in GTT.
  293. *
  294. * Also, things can get pretty crazy under memory pressure and actual
  295. * VRAM usage can change a lot, so playing safe even at 50% does
  296. * consistently increase performance.
  297. */
  298. u64 half_vram = real_vram_size >> 1;
  299. u64 half_free_vram = vram_usage >= half_vram ? 0 : half_vram - vram_usage;
  300. u64 bytes_moved_threshold = half_free_vram >> 1;
  301. return max(bytes_moved_threshold, 1024*1024ull);
  302. }
  303. int amdgpu_cs_list_validate(struct amdgpu_device *adev,
  304. struct amdgpu_vm *vm,
  305. struct list_head *validated)
  306. {
  307. struct amdgpu_bo_list_entry *lobj;
  308. struct amdgpu_bo *bo;
  309. u64 bytes_moved = 0, initial_bytes_moved;
  310. u64 bytes_moved_threshold = amdgpu_cs_get_threshold_for_moves(adev);
  311. int r;
  312. list_for_each_entry(lobj, validated, tv.head) {
  313. bo = lobj->robj;
  314. if (!bo->pin_count) {
  315. u32 domain = lobj->prefered_domains;
  316. u32 current_domain =
  317. amdgpu_mem_type_to_domain(bo->tbo.mem.mem_type);
  318. /* Check if this buffer will be moved and don't move it
  319. * if we have moved too many buffers for this IB already.
  320. *
  321. * Note that this allows moving at least one buffer of
  322. * any size, because it doesn't take the current "bo"
  323. * into account. We don't want to disallow buffer moves
  324. * completely.
  325. */
  326. if ((lobj->allowed_domains & current_domain) != 0 &&
  327. (domain & current_domain) == 0 && /* will be moved */
  328. bytes_moved > bytes_moved_threshold) {
  329. /* don't move it */
  330. domain = current_domain;
  331. }
  332. retry:
  333. amdgpu_ttm_placement_from_domain(bo, domain);
  334. initial_bytes_moved = atomic64_read(&adev->num_bytes_moved);
  335. r = ttm_bo_validate(&bo->tbo, &bo->placement, true, false);
  336. bytes_moved += atomic64_read(&adev->num_bytes_moved) -
  337. initial_bytes_moved;
  338. if (unlikely(r)) {
  339. if (r != -ERESTARTSYS && domain != lobj->allowed_domains) {
  340. domain = lobj->allowed_domains;
  341. goto retry;
  342. }
  343. return r;
  344. }
  345. }
  346. lobj->bo_va = amdgpu_vm_bo_find(vm, bo);
  347. }
  348. return 0;
  349. }
  350. static int amdgpu_cs_parser_relocs(struct amdgpu_cs_parser *p)
  351. {
  352. struct amdgpu_fpriv *fpriv = p->filp->driver_priv;
  353. struct amdgpu_cs_buckets buckets;
  354. struct list_head duplicates;
  355. bool need_mmap_lock = false;
  356. int i, r;
  357. if (p->bo_list) {
  358. need_mmap_lock = p->bo_list->has_userptr;
  359. amdgpu_cs_buckets_init(&buckets);
  360. for (i = 0; i < p->bo_list->num_entries; i++)
  361. amdgpu_cs_buckets_add(&buckets, &p->bo_list->array[i].tv.head,
  362. p->bo_list->array[i].priority);
  363. amdgpu_cs_buckets_get_list(&buckets, &p->validated);
  364. }
  365. p->vm_bos = amdgpu_vm_get_bos(p->adev, &fpriv->vm,
  366. &p->validated);
  367. if (need_mmap_lock)
  368. down_read(&current->mm->mmap_sem);
  369. INIT_LIST_HEAD(&duplicates);
  370. r = ttm_eu_reserve_buffers(&p->ticket, &p->validated, true, &duplicates);
  371. if (unlikely(r != 0))
  372. goto error_reserve;
  373. r = amdgpu_cs_list_validate(p->adev, &fpriv->vm, &p->validated);
  374. if (r)
  375. goto error_validate;
  376. r = amdgpu_cs_list_validate(p->adev, &fpriv->vm, &duplicates);
  377. error_validate:
  378. if (r)
  379. ttm_eu_backoff_reservation(&p->ticket, &p->validated);
  380. error_reserve:
  381. if (need_mmap_lock)
  382. up_read(&current->mm->mmap_sem);
  383. return r;
  384. }
  385. static int amdgpu_cs_sync_rings(struct amdgpu_cs_parser *p)
  386. {
  387. struct amdgpu_bo_list_entry *e;
  388. int r;
  389. list_for_each_entry(e, &p->validated, tv.head) {
  390. struct reservation_object *resv = e->robj->tbo.resv;
  391. r = amdgpu_sync_resv(p->adev, &p->ibs[0].sync, resv, p->filp);
  392. if (r)
  393. return r;
  394. }
  395. return 0;
  396. }
  397. static int cmp_size_smaller_first(void *priv, struct list_head *a,
  398. struct list_head *b)
  399. {
  400. struct amdgpu_bo_list_entry *la = list_entry(a, struct amdgpu_bo_list_entry, tv.head);
  401. struct amdgpu_bo_list_entry *lb = list_entry(b, struct amdgpu_bo_list_entry, tv.head);
  402. /* Sort A before B if A is smaller. */
  403. return (int)la->robj->tbo.num_pages - (int)lb->robj->tbo.num_pages;
  404. }
  405. static void amdgpu_cs_parser_fini_early(struct amdgpu_cs_parser *parser, int error, bool backoff)
  406. {
  407. if (!error) {
  408. /* Sort the buffer list from the smallest to largest buffer,
  409. * which affects the order of buffers in the LRU list.
  410. * This assures that the smallest buffers are added first
  411. * to the LRU list, so they are likely to be later evicted
  412. * first, instead of large buffers whose eviction is more
  413. * expensive.
  414. *
  415. * This slightly lowers the number of bytes moved by TTM
  416. * per frame under memory pressure.
  417. */
  418. list_sort(NULL, &parser->validated, cmp_size_smaller_first);
  419. ttm_eu_fence_buffer_objects(&parser->ticket,
  420. &parser->validated,
  421. &parser->ibs[parser->num_ibs-1].fence->base);
  422. } else if (backoff) {
  423. ttm_eu_backoff_reservation(&parser->ticket,
  424. &parser->validated);
  425. }
  426. }
  427. static void amdgpu_cs_parser_fini_late(struct amdgpu_cs_parser *parser)
  428. {
  429. unsigned i;
  430. if (parser->ctx)
  431. amdgpu_ctx_put(parser->ctx);
  432. if (parser->bo_list)
  433. amdgpu_bo_list_put(parser->bo_list);
  434. drm_free_large(parser->vm_bos);
  435. for (i = 0; i < parser->nchunks; i++)
  436. drm_free_large(parser->chunks[i].kdata);
  437. kfree(parser->chunks);
  438. if (!amdgpu_enable_scheduler)
  439. {
  440. if (parser->ibs)
  441. for (i = 0; i < parser->num_ibs; i++)
  442. amdgpu_ib_free(parser->adev, &parser->ibs[i]);
  443. kfree(parser->ibs);
  444. if (parser->uf.bo)
  445. drm_gem_object_unreference_unlocked(&parser->uf.bo->gem_base);
  446. }
  447. kfree(parser);
  448. }
  449. /**
  450. * cs_parser_fini() - clean parser states
  451. * @parser: parser structure holding parsing context.
  452. * @error: error number
  453. *
  454. * If error is set than unvalidate buffer, otherwise just free memory
  455. * used by parsing context.
  456. **/
  457. static void amdgpu_cs_parser_fini(struct amdgpu_cs_parser *parser, int error, bool backoff)
  458. {
  459. amdgpu_cs_parser_fini_early(parser, error, backoff);
  460. amdgpu_cs_parser_fini_late(parser);
  461. }
  462. static int amdgpu_bo_vm_update_pte(struct amdgpu_cs_parser *p,
  463. struct amdgpu_vm *vm)
  464. {
  465. struct amdgpu_device *adev = p->adev;
  466. struct amdgpu_bo_va *bo_va;
  467. struct amdgpu_bo *bo;
  468. int i, r;
  469. r = amdgpu_vm_update_page_directory(adev, vm);
  470. if (r)
  471. return r;
  472. r = amdgpu_sync_fence(adev, &p->ibs[0].sync, vm->page_directory_fence);
  473. if (r)
  474. return r;
  475. r = amdgpu_vm_clear_freed(adev, vm);
  476. if (r)
  477. return r;
  478. if (p->bo_list) {
  479. for (i = 0; i < p->bo_list->num_entries; i++) {
  480. struct fence *f;
  481. /* ignore duplicates */
  482. bo = p->bo_list->array[i].robj;
  483. if (!bo)
  484. continue;
  485. bo_va = p->bo_list->array[i].bo_va;
  486. if (bo_va == NULL)
  487. continue;
  488. r = amdgpu_vm_bo_update(adev, bo_va, &bo->tbo.mem);
  489. if (r)
  490. return r;
  491. f = bo_va->last_pt_update;
  492. r = amdgpu_sync_fence(adev, &p->ibs[0].sync, f);
  493. if (r)
  494. return r;
  495. }
  496. }
  497. r = amdgpu_vm_clear_invalids(adev, vm, &p->ibs[0].sync);
  498. if (amdgpu_vm_debug && p->bo_list) {
  499. /* Invalidate all BOs to test for userspace bugs */
  500. for (i = 0; i < p->bo_list->num_entries; i++) {
  501. /* ignore duplicates */
  502. bo = p->bo_list->array[i].robj;
  503. if (!bo)
  504. continue;
  505. amdgpu_vm_bo_invalidate(adev, bo);
  506. }
  507. }
  508. return r;
  509. }
  510. static int amdgpu_cs_ib_vm_chunk(struct amdgpu_device *adev,
  511. struct amdgpu_cs_parser *parser)
  512. {
  513. struct amdgpu_fpriv *fpriv = parser->filp->driver_priv;
  514. struct amdgpu_vm *vm = &fpriv->vm;
  515. struct amdgpu_ring *ring;
  516. int i, r;
  517. if (parser->num_ibs == 0)
  518. return 0;
  519. /* Only for UVD/VCE VM emulation */
  520. for (i = 0; i < parser->num_ibs; i++) {
  521. ring = parser->ibs[i].ring;
  522. if (ring->funcs->parse_cs) {
  523. r = amdgpu_ring_parse_cs(ring, parser, i);
  524. if (r)
  525. return r;
  526. }
  527. }
  528. r = amdgpu_bo_vm_update_pte(parser, vm);
  529. if (r) {
  530. goto out;
  531. }
  532. amdgpu_cs_sync_rings(parser);
  533. if (!amdgpu_enable_scheduler)
  534. r = amdgpu_ib_schedule(adev, parser->num_ibs, parser->ibs,
  535. parser->filp);
  536. out:
  537. return r;
  538. }
  539. static int amdgpu_cs_handle_lockup(struct amdgpu_device *adev, int r)
  540. {
  541. if (r == -EDEADLK) {
  542. r = amdgpu_gpu_reset(adev);
  543. if (!r)
  544. r = -EAGAIN;
  545. }
  546. return r;
  547. }
  548. static int amdgpu_cs_ib_fill(struct amdgpu_device *adev,
  549. struct amdgpu_cs_parser *parser)
  550. {
  551. struct amdgpu_fpriv *fpriv = parser->filp->driver_priv;
  552. struct amdgpu_vm *vm = &fpriv->vm;
  553. int i, j;
  554. int r;
  555. for (i = 0, j = 0; i < parser->nchunks && j < parser->num_ibs; i++) {
  556. struct amdgpu_cs_chunk *chunk;
  557. struct amdgpu_ib *ib;
  558. struct drm_amdgpu_cs_chunk_ib *chunk_ib;
  559. struct amdgpu_ring *ring;
  560. chunk = &parser->chunks[i];
  561. ib = &parser->ibs[j];
  562. chunk_ib = (struct drm_amdgpu_cs_chunk_ib *)chunk->kdata;
  563. if (chunk->chunk_id != AMDGPU_CHUNK_ID_IB)
  564. continue;
  565. r = amdgpu_cs_get_ring(adev, chunk_ib->ip_type,
  566. chunk_ib->ip_instance, chunk_ib->ring,
  567. &ring);
  568. if (r)
  569. return r;
  570. if (ring->funcs->parse_cs) {
  571. struct amdgpu_bo_va_mapping *m;
  572. struct amdgpu_bo *aobj = NULL;
  573. uint64_t offset;
  574. uint8_t *kptr;
  575. m = amdgpu_cs_find_mapping(parser, chunk_ib->va_start,
  576. &aobj);
  577. if (!aobj) {
  578. DRM_ERROR("IB va_start is invalid\n");
  579. return -EINVAL;
  580. }
  581. if ((chunk_ib->va_start + chunk_ib->ib_bytes) >
  582. (m->it.last + 1) * AMDGPU_GPU_PAGE_SIZE) {
  583. DRM_ERROR("IB va_start+ib_bytes is invalid\n");
  584. return -EINVAL;
  585. }
  586. /* the IB should be reserved at this point */
  587. r = amdgpu_bo_kmap(aobj, (void **)&kptr);
  588. if (r) {
  589. return r;
  590. }
  591. offset = ((uint64_t)m->it.start) * AMDGPU_GPU_PAGE_SIZE;
  592. kptr += chunk_ib->va_start - offset;
  593. r = amdgpu_ib_get(ring, NULL, chunk_ib->ib_bytes, ib);
  594. if (r) {
  595. DRM_ERROR("Failed to get ib !\n");
  596. return r;
  597. }
  598. memcpy(ib->ptr, kptr, chunk_ib->ib_bytes);
  599. amdgpu_bo_kunmap(aobj);
  600. } else {
  601. r = amdgpu_ib_get(ring, vm, 0, ib);
  602. if (r) {
  603. DRM_ERROR("Failed to get ib !\n");
  604. return r;
  605. }
  606. ib->gpu_addr = chunk_ib->va_start;
  607. }
  608. ib->length_dw = chunk_ib->ib_bytes / 4;
  609. ib->flags = chunk_ib->flags;
  610. ib->ctx = parser->ctx;
  611. j++;
  612. }
  613. if (!parser->num_ibs)
  614. return 0;
  615. /* add GDS resources to first IB */
  616. if (parser->bo_list) {
  617. struct amdgpu_bo *gds = parser->bo_list->gds_obj;
  618. struct amdgpu_bo *gws = parser->bo_list->gws_obj;
  619. struct amdgpu_bo *oa = parser->bo_list->oa_obj;
  620. struct amdgpu_ib *ib = &parser->ibs[0];
  621. if (gds) {
  622. ib->gds_base = amdgpu_bo_gpu_offset(gds);
  623. ib->gds_size = amdgpu_bo_size(gds);
  624. }
  625. if (gws) {
  626. ib->gws_base = amdgpu_bo_gpu_offset(gws);
  627. ib->gws_size = amdgpu_bo_size(gws);
  628. }
  629. if (oa) {
  630. ib->oa_base = amdgpu_bo_gpu_offset(oa);
  631. ib->oa_size = amdgpu_bo_size(oa);
  632. }
  633. }
  634. /* wrap the last IB with user fence */
  635. if (parser->uf.bo) {
  636. struct amdgpu_ib *ib = &parser->ibs[parser->num_ibs - 1];
  637. /* UVD & VCE fw doesn't support user fences */
  638. if (ib->ring->type == AMDGPU_RING_TYPE_UVD ||
  639. ib->ring->type == AMDGPU_RING_TYPE_VCE)
  640. return -EINVAL;
  641. ib->user = &parser->uf;
  642. }
  643. return 0;
  644. }
  645. static int amdgpu_cs_dependencies(struct amdgpu_device *adev,
  646. struct amdgpu_cs_parser *p)
  647. {
  648. struct amdgpu_fpriv *fpriv = p->filp->driver_priv;
  649. struct amdgpu_ib *ib;
  650. int i, j, r;
  651. if (!p->num_ibs)
  652. return 0;
  653. /* Add dependencies to first IB */
  654. ib = &p->ibs[0];
  655. for (i = 0; i < p->nchunks; ++i) {
  656. struct drm_amdgpu_cs_chunk_dep *deps;
  657. struct amdgpu_cs_chunk *chunk;
  658. unsigned num_deps;
  659. chunk = &p->chunks[i];
  660. if (chunk->chunk_id != AMDGPU_CHUNK_ID_DEPENDENCIES)
  661. continue;
  662. deps = (struct drm_amdgpu_cs_chunk_dep *)chunk->kdata;
  663. num_deps = chunk->length_dw * 4 /
  664. sizeof(struct drm_amdgpu_cs_chunk_dep);
  665. for (j = 0; j < num_deps; ++j) {
  666. struct amdgpu_ring *ring;
  667. struct amdgpu_ctx *ctx;
  668. struct fence *fence;
  669. r = amdgpu_cs_get_ring(adev, deps[j].ip_type,
  670. deps[j].ip_instance,
  671. deps[j].ring, &ring);
  672. if (r)
  673. return r;
  674. ctx = amdgpu_ctx_get(fpriv, deps[j].ctx_id);
  675. if (ctx == NULL)
  676. return -EINVAL;
  677. fence = amdgpu_ctx_get_fence(ctx, ring,
  678. deps[j].handle);
  679. if (IS_ERR(fence)) {
  680. r = PTR_ERR(fence);
  681. amdgpu_ctx_put(ctx);
  682. return r;
  683. } else if (fence) {
  684. r = amdgpu_sync_fence(adev, &ib->sync, fence);
  685. fence_put(fence);
  686. amdgpu_ctx_put(ctx);
  687. if (r)
  688. return r;
  689. }
  690. }
  691. }
  692. return 0;
  693. }
  694. static int amdgpu_cs_free_job(struct amdgpu_job *job)
  695. {
  696. int i;
  697. if (job->ibs)
  698. for (i = 0; i < job->num_ibs; i++)
  699. amdgpu_ib_free(job->adev, &job->ibs[i]);
  700. kfree(job->ibs);
  701. if (job->uf.bo)
  702. drm_gem_object_unreference_unlocked(&job->uf.bo->gem_base);
  703. return 0;
  704. }
  705. int amdgpu_cs_ioctl(struct drm_device *dev, void *data, struct drm_file *filp)
  706. {
  707. struct amdgpu_device *adev = dev->dev_private;
  708. union drm_amdgpu_cs *cs = data;
  709. struct amdgpu_fpriv *fpriv = filp->driver_priv;
  710. struct amdgpu_vm *vm = &fpriv->vm;
  711. struct amdgpu_cs_parser *parser;
  712. bool reserved_buffers = false;
  713. int i, r;
  714. if (!adev->accel_working)
  715. return -EBUSY;
  716. parser = amdgpu_cs_parser_create(adev, filp, NULL, NULL, 0);
  717. if (!parser)
  718. return -ENOMEM;
  719. r = amdgpu_cs_parser_init(parser, data);
  720. if (r) {
  721. DRM_ERROR("Failed to initialize parser !\n");
  722. amdgpu_cs_parser_fini(parser, r, false);
  723. r = amdgpu_cs_handle_lockup(adev, r);
  724. return r;
  725. }
  726. mutex_lock(&vm->mutex);
  727. r = amdgpu_cs_parser_relocs(parser);
  728. if (r == -ENOMEM)
  729. DRM_ERROR("Not enough memory for command submission!\n");
  730. else if (r && r != -ERESTARTSYS)
  731. DRM_ERROR("Failed to process the buffer list %d!\n", r);
  732. else if (!r) {
  733. reserved_buffers = true;
  734. r = amdgpu_cs_ib_fill(adev, parser);
  735. }
  736. if (!r) {
  737. r = amdgpu_cs_dependencies(adev, parser);
  738. if (r)
  739. DRM_ERROR("Failed in the dependencies handling %d!\n", r);
  740. }
  741. if (r)
  742. goto out;
  743. for (i = 0; i < parser->num_ibs; i++)
  744. trace_amdgpu_cs(parser, i);
  745. r = amdgpu_cs_ib_vm_chunk(adev, parser);
  746. if (r)
  747. goto out;
  748. if (amdgpu_enable_scheduler && parser->num_ibs) {
  749. struct amdgpu_job *job;
  750. struct amdgpu_ring * ring = parser->ibs->ring;
  751. job = kzalloc(sizeof(struct amdgpu_job), GFP_KERNEL);
  752. if (!job)
  753. return -ENOMEM;
  754. job->base.sched = &ring->sched;
  755. job->base.s_entity = &parser->ctx->rings[ring->idx].entity;
  756. job->adev = parser->adev;
  757. job->ibs = parser->ibs;
  758. job->num_ibs = parser->num_ibs;
  759. job->base.owner = parser->filp;
  760. mutex_init(&job->job_lock);
  761. if (job->ibs[job->num_ibs - 1].user) {
  762. memcpy(&job->uf, &parser->uf,
  763. sizeof(struct amdgpu_user_fence));
  764. job->ibs[job->num_ibs - 1].user = &job->uf;
  765. }
  766. job->free_job = amdgpu_cs_free_job;
  767. mutex_lock(&job->job_lock);
  768. r = amd_sched_entity_push_job(&job->base);
  769. if (r) {
  770. mutex_unlock(&job->job_lock);
  771. amdgpu_cs_free_job(job);
  772. kfree(job);
  773. goto out;
  774. }
  775. cs->out.handle =
  776. amdgpu_ctx_add_fence(parser->ctx, ring,
  777. &job->base.s_fence->base);
  778. parser->ibs[parser->num_ibs - 1].sequence = cs->out.handle;
  779. list_sort(NULL, &parser->validated, cmp_size_smaller_first);
  780. ttm_eu_fence_buffer_objects(&parser->ticket,
  781. &parser->validated,
  782. &job->base.s_fence->base);
  783. mutex_unlock(&job->job_lock);
  784. amdgpu_cs_parser_fini_late(parser);
  785. mutex_unlock(&vm->mutex);
  786. return 0;
  787. }
  788. cs->out.handle = parser->ibs[parser->num_ibs - 1].sequence;
  789. out:
  790. amdgpu_cs_parser_fini(parser, r, reserved_buffers);
  791. mutex_unlock(&vm->mutex);
  792. r = amdgpu_cs_handle_lockup(adev, r);
  793. return r;
  794. }
  795. /**
  796. * amdgpu_cs_wait_ioctl - wait for a command submission to finish
  797. *
  798. * @dev: drm device
  799. * @data: data from userspace
  800. * @filp: file private
  801. *
  802. * Wait for the command submission identified by handle to finish.
  803. */
  804. int amdgpu_cs_wait_ioctl(struct drm_device *dev, void *data,
  805. struct drm_file *filp)
  806. {
  807. union drm_amdgpu_wait_cs *wait = data;
  808. struct amdgpu_device *adev = dev->dev_private;
  809. unsigned long timeout = amdgpu_gem_timeout(wait->in.timeout);
  810. struct amdgpu_ring *ring = NULL;
  811. struct amdgpu_ctx *ctx;
  812. struct fence *fence;
  813. long r;
  814. r = amdgpu_cs_get_ring(adev, wait->in.ip_type, wait->in.ip_instance,
  815. wait->in.ring, &ring);
  816. if (r)
  817. return r;
  818. ctx = amdgpu_ctx_get(filp->driver_priv, wait->in.ctx_id);
  819. if (ctx == NULL)
  820. return -EINVAL;
  821. fence = amdgpu_ctx_get_fence(ctx, ring, wait->in.handle);
  822. if (IS_ERR(fence))
  823. r = PTR_ERR(fence);
  824. else if (fence) {
  825. r = fence_wait_timeout(fence, true, timeout);
  826. fence_put(fence);
  827. } else
  828. r = 1;
  829. amdgpu_ctx_put(ctx);
  830. if (r < 0)
  831. return r;
  832. memset(wait, 0, sizeof(*wait));
  833. wait->out.status = (r == 0);
  834. return 0;
  835. }
  836. /**
  837. * amdgpu_cs_find_bo_va - find bo_va for VM address
  838. *
  839. * @parser: command submission parser context
  840. * @addr: VM address
  841. * @bo: resulting BO of the mapping found
  842. *
  843. * Search the buffer objects in the command submission context for a certain
  844. * virtual memory address. Returns allocation structure when found, NULL
  845. * otherwise.
  846. */
  847. struct amdgpu_bo_va_mapping *
  848. amdgpu_cs_find_mapping(struct amdgpu_cs_parser *parser,
  849. uint64_t addr, struct amdgpu_bo **bo)
  850. {
  851. struct amdgpu_bo_list_entry *reloc;
  852. struct amdgpu_bo_va_mapping *mapping;
  853. addr /= AMDGPU_GPU_PAGE_SIZE;
  854. list_for_each_entry(reloc, &parser->validated, tv.head) {
  855. if (!reloc->bo_va)
  856. continue;
  857. list_for_each_entry(mapping, &reloc->bo_va->valids, list) {
  858. if (mapping->it.start > addr ||
  859. addr > mapping->it.last)
  860. continue;
  861. *bo = reloc->bo_va->bo;
  862. return mapping;
  863. }
  864. list_for_each_entry(mapping, &reloc->bo_va->invalids, list) {
  865. if (mapping->it.start > addr ||
  866. addr > mapping->it.last)
  867. continue;
  868. *bo = reloc->bo_va->bo;
  869. return mapping;
  870. }
  871. }
  872. return NULL;
  873. }