amdgpu_cs.c 26 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020
  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 (parser->ibs)
  439. for (i = 0; i < parser->num_ibs; i++)
  440. amdgpu_ib_free(parser->adev, &parser->ibs[i]);
  441. kfree(parser->ibs);
  442. if (parser->uf.bo)
  443. drm_gem_object_unreference_unlocked(&parser->uf.bo->gem_base);
  444. kfree(parser);
  445. }
  446. /**
  447. * cs_parser_fini() - clean parser states
  448. * @parser: parser structure holding parsing context.
  449. * @error: error number
  450. *
  451. * If error is set than unvalidate buffer, otherwise just free memory
  452. * used by parsing context.
  453. **/
  454. static void amdgpu_cs_parser_fini(struct amdgpu_cs_parser *parser, int error, bool backoff)
  455. {
  456. amdgpu_cs_parser_fini_early(parser, error, backoff);
  457. amdgpu_cs_parser_fini_late(parser);
  458. }
  459. static int amdgpu_bo_vm_update_pte(struct amdgpu_cs_parser *p,
  460. struct amdgpu_vm *vm)
  461. {
  462. struct amdgpu_device *adev = p->adev;
  463. struct amdgpu_bo_va *bo_va;
  464. struct amdgpu_bo *bo;
  465. int i, r;
  466. r = amdgpu_vm_update_page_directory(adev, vm);
  467. if (r)
  468. return r;
  469. r = amdgpu_sync_fence(adev, &p->ibs[0].sync, vm->page_directory_fence);
  470. if (r)
  471. return r;
  472. r = amdgpu_vm_clear_freed(adev, vm);
  473. if (r)
  474. return r;
  475. if (p->bo_list) {
  476. for (i = 0; i < p->bo_list->num_entries; i++) {
  477. struct fence *f;
  478. /* ignore duplicates */
  479. bo = p->bo_list->array[i].robj;
  480. if (!bo)
  481. continue;
  482. bo_va = p->bo_list->array[i].bo_va;
  483. if (bo_va == NULL)
  484. continue;
  485. r = amdgpu_vm_bo_update(adev, bo_va, &bo->tbo.mem);
  486. if (r)
  487. return r;
  488. f = bo_va->last_pt_update;
  489. r = amdgpu_sync_fence(adev, &p->ibs[0].sync, f);
  490. if (r)
  491. return r;
  492. }
  493. }
  494. r = amdgpu_vm_clear_invalids(adev, vm, &p->ibs[0].sync);
  495. if (amdgpu_vm_debug && p->bo_list) {
  496. /* Invalidate all BOs to test for userspace bugs */
  497. for (i = 0; i < p->bo_list->num_entries; i++) {
  498. /* ignore duplicates */
  499. bo = p->bo_list->array[i].robj;
  500. if (!bo)
  501. continue;
  502. amdgpu_vm_bo_invalidate(adev, bo);
  503. }
  504. }
  505. return r;
  506. }
  507. static int amdgpu_cs_ib_vm_chunk(struct amdgpu_device *adev,
  508. struct amdgpu_cs_parser *parser)
  509. {
  510. struct amdgpu_fpriv *fpriv = parser->filp->driver_priv;
  511. struct amdgpu_vm *vm = &fpriv->vm;
  512. struct amdgpu_ring *ring;
  513. int i, r;
  514. if (parser->num_ibs == 0)
  515. return 0;
  516. /* Only for UVD/VCE VM emulation */
  517. for (i = 0; i < parser->num_ibs; i++) {
  518. ring = parser->ibs[i].ring;
  519. if (ring->funcs->parse_cs) {
  520. r = amdgpu_ring_parse_cs(ring, parser, i);
  521. if (r)
  522. return r;
  523. }
  524. }
  525. r = amdgpu_bo_vm_update_pte(parser, vm);
  526. if (r) {
  527. goto out;
  528. }
  529. amdgpu_cs_sync_rings(parser);
  530. if (!amdgpu_enable_scheduler)
  531. r = amdgpu_ib_schedule(adev, parser->num_ibs, parser->ibs,
  532. parser->filp);
  533. out:
  534. return r;
  535. }
  536. static int amdgpu_cs_handle_lockup(struct amdgpu_device *adev, int r)
  537. {
  538. if (r == -EDEADLK) {
  539. r = amdgpu_gpu_reset(adev);
  540. if (!r)
  541. r = -EAGAIN;
  542. }
  543. return r;
  544. }
  545. static int amdgpu_cs_ib_fill(struct amdgpu_device *adev,
  546. struct amdgpu_cs_parser *parser)
  547. {
  548. struct amdgpu_fpriv *fpriv = parser->filp->driver_priv;
  549. struct amdgpu_vm *vm = &fpriv->vm;
  550. int i, j;
  551. int r;
  552. for (i = 0, j = 0; i < parser->nchunks && j < parser->num_ibs; i++) {
  553. struct amdgpu_cs_chunk *chunk;
  554. struct amdgpu_ib *ib;
  555. struct drm_amdgpu_cs_chunk_ib *chunk_ib;
  556. struct amdgpu_ring *ring;
  557. chunk = &parser->chunks[i];
  558. ib = &parser->ibs[j];
  559. chunk_ib = (struct drm_amdgpu_cs_chunk_ib *)chunk->kdata;
  560. if (chunk->chunk_id != AMDGPU_CHUNK_ID_IB)
  561. continue;
  562. r = amdgpu_cs_get_ring(adev, chunk_ib->ip_type,
  563. chunk_ib->ip_instance, chunk_ib->ring,
  564. &ring);
  565. if (r)
  566. return r;
  567. if (ring->funcs->parse_cs) {
  568. struct amdgpu_bo_va_mapping *m;
  569. struct amdgpu_bo *aobj = NULL;
  570. uint64_t offset;
  571. uint8_t *kptr;
  572. m = amdgpu_cs_find_mapping(parser, chunk_ib->va_start,
  573. &aobj);
  574. if (!aobj) {
  575. DRM_ERROR("IB va_start is invalid\n");
  576. return -EINVAL;
  577. }
  578. if ((chunk_ib->va_start + chunk_ib->ib_bytes) >
  579. (m->it.last + 1) * AMDGPU_GPU_PAGE_SIZE) {
  580. DRM_ERROR("IB va_start+ib_bytes is invalid\n");
  581. return -EINVAL;
  582. }
  583. /* the IB should be reserved at this point */
  584. r = amdgpu_bo_kmap(aobj, (void **)&kptr);
  585. if (r) {
  586. return r;
  587. }
  588. offset = ((uint64_t)m->it.start) * AMDGPU_GPU_PAGE_SIZE;
  589. kptr += chunk_ib->va_start - offset;
  590. r = amdgpu_ib_get(ring, NULL, chunk_ib->ib_bytes, ib);
  591. if (r) {
  592. DRM_ERROR("Failed to get ib !\n");
  593. return r;
  594. }
  595. memcpy(ib->ptr, kptr, chunk_ib->ib_bytes);
  596. amdgpu_bo_kunmap(aobj);
  597. } else {
  598. r = amdgpu_ib_get(ring, vm, 0, ib);
  599. if (r) {
  600. DRM_ERROR("Failed to get ib !\n");
  601. return r;
  602. }
  603. ib->gpu_addr = chunk_ib->va_start;
  604. }
  605. ib->length_dw = chunk_ib->ib_bytes / 4;
  606. ib->flags = chunk_ib->flags;
  607. ib->ctx = parser->ctx;
  608. j++;
  609. }
  610. if (!parser->num_ibs)
  611. return 0;
  612. /* add GDS resources to first IB */
  613. if (parser->bo_list) {
  614. struct amdgpu_bo *gds = parser->bo_list->gds_obj;
  615. struct amdgpu_bo *gws = parser->bo_list->gws_obj;
  616. struct amdgpu_bo *oa = parser->bo_list->oa_obj;
  617. struct amdgpu_ib *ib = &parser->ibs[0];
  618. if (gds) {
  619. ib->gds_base = amdgpu_bo_gpu_offset(gds);
  620. ib->gds_size = amdgpu_bo_size(gds);
  621. }
  622. if (gws) {
  623. ib->gws_base = amdgpu_bo_gpu_offset(gws);
  624. ib->gws_size = amdgpu_bo_size(gws);
  625. }
  626. if (oa) {
  627. ib->oa_base = amdgpu_bo_gpu_offset(oa);
  628. ib->oa_size = amdgpu_bo_size(oa);
  629. }
  630. }
  631. /* wrap the last IB with user fence */
  632. if (parser->uf.bo) {
  633. struct amdgpu_ib *ib = &parser->ibs[parser->num_ibs - 1];
  634. /* UVD & VCE fw doesn't support user fences */
  635. if (ib->ring->type == AMDGPU_RING_TYPE_UVD ||
  636. ib->ring->type == AMDGPU_RING_TYPE_VCE)
  637. return -EINVAL;
  638. ib->user = &parser->uf;
  639. }
  640. return 0;
  641. }
  642. static int amdgpu_cs_dependencies(struct amdgpu_device *adev,
  643. struct amdgpu_cs_parser *p)
  644. {
  645. struct amdgpu_fpriv *fpriv = p->filp->driver_priv;
  646. struct amdgpu_ib *ib;
  647. int i, j, r;
  648. if (!p->num_ibs)
  649. return 0;
  650. /* Add dependencies to first IB */
  651. ib = &p->ibs[0];
  652. for (i = 0; i < p->nchunks; ++i) {
  653. struct drm_amdgpu_cs_chunk_dep *deps;
  654. struct amdgpu_cs_chunk *chunk;
  655. unsigned num_deps;
  656. chunk = &p->chunks[i];
  657. if (chunk->chunk_id != AMDGPU_CHUNK_ID_DEPENDENCIES)
  658. continue;
  659. deps = (struct drm_amdgpu_cs_chunk_dep *)chunk->kdata;
  660. num_deps = chunk->length_dw * 4 /
  661. sizeof(struct drm_amdgpu_cs_chunk_dep);
  662. for (j = 0; j < num_deps; ++j) {
  663. struct amdgpu_ring *ring;
  664. struct amdgpu_ctx *ctx;
  665. struct fence *fence;
  666. r = amdgpu_cs_get_ring(adev, deps[j].ip_type,
  667. deps[j].ip_instance,
  668. deps[j].ring, &ring);
  669. if (r)
  670. return r;
  671. ctx = amdgpu_ctx_get(fpriv, deps[j].ctx_id);
  672. if (ctx == NULL)
  673. return -EINVAL;
  674. fence = amdgpu_ctx_get_fence(ctx, ring,
  675. deps[j].handle);
  676. if (IS_ERR(fence)) {
  677. r = PTR_ERR(fence);
  678. amdgpu_ctx_put(ctx);
  679. return r;
  680. } else if (fence) {
  681. r = amdgpu_sync_fence(adev, &ib->sync, fence);
  682. fence_put(fence);
  683. amdgpu_ctx_put(ctx);
  684. if (r)
  685. return r;
  686. }
  687. }
  688. }
  689. return 0;
  690. }
  691. static int amdgpu_cs_free_job(struct amdgpu_job *job)
  692. {
  693. int i;
  694. if (job->ibs)
  695. for (i = 0; i < job->num_ibs; i++)
  696. amdgpu_ib_free(job->adev, &job->ibs[i]);
  697. kfree(job->ibs);
  698. if (job->uf.bo)
  699. drm_gem_object_unreference_unlocked(&job->uf.bo->gem_base);
  700. return 0;
  701. }
  702. int amdgpu_cs_ioctl(struct drm_device *dev, void *data, struct drm_file *filp)
  703. {
  704. struct amdgpu_device *adev = dev->dev_private;
  705. union drm_amdgpu_cs *cs = data;
  706. struct amdgpu_fpriv *fpriv = filp->driver_priv;
  707. struct amdgpu_vm *vm = &fpriv->vm;
  708. struct amdgpu_cs_parser *parser;
  709. bool reserved_buffers = false;
  710. int i, r;
  711. if (!adev->accel_working)
  712. return -EBUSY;
  713. parser = amdgpu_cs_parser_create(adev, filp, NULL, NULL, 0);
  714. if (!parser)
  715. return -ENOMEM;
  716. r = amdgpu_cs_parser_init(parser, data);
  717. if (r) {
  718. DRM_ERROR("Failed to initialize parser !\n");
  719. amdgpu_cs_parser_fini(parser, r, false);
  720. r = amdgpu_cs_handle_lockup(adev, r);
  721. return r;
  722. }
  723. mutex_lock(&vm->mutex);
  724. r = amdgpu_cs_parser_relocs(parser);
  725. if (r == -ENOMEM)
  726. DRM_ERROR("Not enough memory for command submission!\n");
  727. else if (r && r != -ERESTARTSYS)
  728. DRM_ERROR("Failed to process the buffer list %d!\n", r);
  729. else if (!r) {
  730. reserved_buffers = true;
  731. r = amdgpu_cs_ib_fill(adev, parser);
  732. }
  733. if (!r) {
  734. r = amdgpu_cs_dependencies(adev, parser);
  735. if (r)
  736. DRM_ERROR("Failed in the dependencies handling %d!\n", r);
  737. }
  738. if (r)
  739. goto out;
  740. for (i = 0; i < parser->num_ibs; i++)
  741. trace_amdgpu_cs(parser, i);
  742. r = amdgpu_cs_ib_vm_chunk(adev, parser);
  743. if (r)
  744. goto out;
  745. if (amdgpu_enable_scheduler && parser->num_ibs) {
  746. struct amdgpu_job *job;
  747. struct amdgpu_ring * ring = parser->ibs->ring;
  748. job = kzalloc(sizeof(struct amdgpu_job), GFP_KERNEL);
  749. if (!job) {
  750. r = -ENOMEM;
  751. goto out;
  752. }
  753. job->base.sched = &ring->sched;
  754. job->base.s_entity = &parser->ctx->rings[ring->idx].entity;
  755. job->adev = parser->adev;
  756. job->ibs = parser->ibs;
  757. job->num_ibs = parser->num_ibs;
  758. job->base.owner = parser->filp;
  759. mutex_init(&job->job_lock);
  760. if (job->ibs[job->num_ibs - 1].user) {
  761. job->uf = parser->uf;
  762. job->ibs[job->num_ibs - 1].user = &job->uf;
  763. parser->uf.bo = NULL;
  764. }
  765. parser->ibs = NULL;
  766. parser->num_ibs = 0;
  767. job->free_job = amdgpu_cs_free_job;
  768. mutex_lock(&job->job_lock);
  769. r = amd_sched_entity_push_job(&job->base);
  770. if (r) {
  771. mutex_unlock(&job->job_lock);
  772. amdgpu_cs_free_job(job);
  773. kfree(job);
  774. goto out;
  775. }
  776. cs->out.handle =
  777. amdgpu_ctx_add_fence(parser->ctx, ring,
  778. &job->base.s_fence->base);
  779. job->ibs[job->num_ibs - 1].sequence = cs->out.handle;
  780. list_sort(NULL, &parser->validated, cmp_size_smaller_first);
  781. ttm_eu_fence_buffer_objects(&parser->ticket,
  782. &parser->validated,
  783. &job->base.s_fence->base);
  784. mutex_unlock(&job->job_lock);
  785. amdgpu_cs_parser_fini_late(parser);
  786. mutex_unlock(&vm->mutex);
  787. return 0;
  788. }
  789. cs->out.handle = parser->ibs[parser->num_ibs - 1].sequence;
  790. out:
  791. amdgpu_cs_parser_fini(parser, r, reserved_buffers);
  792. mutex_unlock(&vm->mutex);
  793. r = amdgpu_cs_handle_lockup(adev, r);
  794. return r;
  795. }
  796. /**
  797. * amdgpu_cs_wait_ioctl - wait for a command submission to finish
  798. *
  799. * @dev: drm device
  800. * @data: data from userspace
  801. * @filp: file private
  802. *
  803. * Wait for the command submission identified by handle to finish.
  804. */
  805. int amdgpu_cs_wait_ioctl(struct drm_device *dev, void *data,
  806. struct drm_file *filp)
  807. {
  808. union drm_amdgpu_wait_cs *wait = data;
  809. struct amdgpu_device *adev = dev->dev_private;
  810. unsigned long timeout = amdgpu_gem_timeout(wait->in.timeout);
  811. struct amdgpu_ring *ring = NULL;
  812. struct amdgpu_ctx *ctx;
  813. struct fence *fence;
  814. long r;
  815. r = amdgpu_cs_get_ring(adev, wait->in.ip_type, wait->in.ip_instance,
  816. wait->in.ring, &ring);
  817. if (r)
  818. return r;
  819. ctx = amdgpu_ctx_get(filp->driver_priv, wait->in.ctx_id);
  820. if (ctx == NULL)
  821. return -EINVAL;
  822. fence = amdgpu_ctx_get_fence(ctx, ring, wait->in.handle);
  823. if (IS_ERR(fence))
  824. r = PTR_ERR(fence);
  825. else if (fence) {
  826. r = fence_wait_timeout(fence, true, timeout);
  827. fence_put(fence);
  828. } else
  829. r = 1;
  830. amdgpu_ctx_put(ctx);
  831. if (r < 0)
  832. return r;
  833. memset(wait, 0, sizeof(*wait));
  834. wait->out.status = (r == 0);
  835. return 0;
  836. }
  837. /**
  838. * amdgpu_cs_find_bo_va - find bo_va for VM address
  839. *
  840. * @parser: command submission parser context
  841. * @addr: VM address
  842. * @bo: resulting BO of the mapping found
  843. *
  844. * Search the buffer objects in the command submission context for a certain
  845. * virtual memory address. Returns allocation structure when found, NULL
  846. * otherwise.
  847. */
  848. struct amdgpu_bo_va_mapping *
  849. amdgpu_cs_find_mapping(struct amdgpu_cs_parser *parser,
  850. uint64_t addr, struct amdgpu_bo **bo)
  851. {
  852. struct amdgpu_bo_list_entry *reloc;
  853. struct amdgpu_bo_va_mapping *mapping;
  854. addr /= AMDGPU_GPU_PAGE_SIZE;
  855. list_for_each_entry(reloc, &parser->validated, tv.head) {
  856. if (!reloc->bo_va)
  857. continue;
  858. list_for_each_entry(mapping, &reloc->bo_va->valids, list) {
  859. if (mapping->it.start > addr ||
  860. addr > mapping->it.last)
  861. continue;
  862. *bo = reloc->bo_va->bo;
  863. return mapping;
  864. }
  865. list_for_each_entry(mapping, &reloc->bo_va->invalids, list) {
  866. if (mapping->it.start > addr ||
  867. addr > mapping->it.last)
  868. continue;
  869. *bo = reloc->bo_va->bo;
  870. return mapping;
  871. }
  872. }
  873. return NULL;
  874. }