amdgpu_cs.c 27 KB

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