amdgpu_cs.c 27 KB

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