amdgpu_sa.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447
  1. /*
  2. * Copyright 2011 Red Hat Inc.
  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
  7. * "Software"), to deal in the Software without restriction, including
  8. * without limitation the rights to use, copy, modify, merge, publish,
  9. * distribute, sub license, and/or sell copies of the Software, and to
  10. * permit persons to whom the Software is furnished to do so, subject to
  11. * the following conditions:
  12. *
  13. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  14. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  15. * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
  16. * THE COPYRIGHT HOLDERS, AUTHORS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM,
  17. * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
  18. * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
  19. * USE OR OTHER DEALINGS IN THE SOFTWARE.
  20. *
  21. * The above copyright notice and this permission notice (including the
  22. * next paragraph) shall be included in all copies or substantial portions
  23. * of the Software.
  24. *
  25. */
  26. /*
  27. * Authors:
  28. * Jerome Glisse <glisse@freedesktop.org>
  29. */
  30. /* Algorithm:
  31. *
  32. * We store the last allocated bo in "hole", we always try to allocate
  33. * after the last allocated bo. Principle is that in a linear GPU ring
  34. * progression was is after last is the oldest bo we allocated and thus
  35. * the first one that should no longer be in use by the GPU.
  36. *
  37. * If it's not the case we skip over the bo after last to the closest
  38. * done bo if such one exist. If none exist and we are not asked to
  39. * block we report failure to allocate.
  40. *
  41. * If we are asked to block we wait on all the oldest fence of all
  42. * rings. We just wait for any of those fence to complete.
  43. */
  44. #include <drm/drmP.h>
  45. #include "amdgpu.h"
  46. static void amdgpu_sa_bo_remove_locked(struct amdgpu_sa_bo *sa_bo);
  47. static void amdgpu_sa_bo_try_free(struct amdgpu_sa_manager *sa_manager);
  48. int amdgpu_sa_bo_manager_init(struct amdgpu_device *adev,
  49. struct amdgpu_sa_manager *sa_manager,
  50. unsigned size, u32 align, u32 domain)
  51. {
  52. int i, r;
  53. init_waitqueue_head(&sa_manager->wq);
  54. sa_manager->bo = NULL;
  55. sa_manager->size = size;
  56. sa_manager->domain = domain;
  57. sa_manager->align = align;
  58. sa_manager->hole = &sa_manager->olist;
  59. INIT_LIST_HEAD(&sa_manager->olist);
  60. for (i = 0; i < AMDGPU_MAX_RINGS; ++i) {
  61. INIT_LIST_HEAD(&sa_manager->flist[i]);
  62. }
  63. r = amdgpu_bo_create(adev, size, align, true,
  64. domain, 0, NULL, &sa_manager->bo);
  65. if (r) {
  66. dev_err(adev->dev, "(%d) failed to allocate bo for manager\n", r);
  67. return r;
  68. }
  69. return r;
  70. }
  71. void amdgpu_sa_bo_manager_fini(struct amdgpu_device *adev,
  72. struct amdgpu_sa_manager *sa_manager)
  73. {
  74. struct amdgpu_sa_bo *sa_bo, *tmp;
  75. if (!list_empty(&sa_manager->olist)) {
  76. sa_manager->hole = &sa_manager->olist,
  77. amdgpu_sa_bo_try_free(sa_manager);
  78. if (!list_empty(&sa_manager->olist)) {
  79. dev_err(adev->dev, "sa_manager is not empty, clearing anyway\n");
  80. }
  81. }
  82. list_for_each_entry_safe(sa_bo, tmp, &sa_manager->olist, olist) {
  83. amdgpu_sa_bo_remove_locked(sa_bo);
  84. }
  85. amdgpu_bo_unref(&sa_manager->bo);
  86. sa_manager->size = 0;
  87. }
  88. int amdgpu_sa_bo_manager_start(struct amdgpu_device *adev,
  89. struct amdgpu_sa_manager *sa_manager)
  90. {
  91. int r;
  92. if (sa_manager->bo == NULL) {
  93. dev_err(adev->dev, "no bo for sa manager\n");
  94. return -EINVAL;
  95. }
  96. /* map the buffer */
  97. r = amdgpu_bo_reserve(sa_manager->bo, false);
  98. if (r) {
  99. dev_err(adev->dev, "(%d) failed to reserve manager bo\n", r);
  100. return r;
  101. }
  102. r = amdgpu_bo_pin(sa_manager->bo, sa_manager->domain, &sa_manager->gpu_addr);
  103. if (r) {
  104. amdgpu_bo_unreserve(sa_manager->bo);
  105. dev_err(adev->dev, "(%d) failed to pin manager bo\n", r);
  106. return r;
  107. }
  108. r = amdgpu_bo_kmap(sa_manager->bo, &sa_manager->cpu_ptr);
  109. amdgpu_bo_unreserve(sa_manager->bo);
  110. return r;
  111. }
  112. int amdgpu_sa_bo_manager_suspend(struct amdgpu_device *adev,
  113. struct amdgpu_sa_manager *sa_manager)
  114. {
  115. int r;
  116. if (sa_manager->bo == NULL) {
  117. dev_err(adev->dev, "no bo for sa manager\n");
  118. return -EINVAL;
  119. }
  120. r = amdgpu_bo_reserve(sa_manager->bo, false);
  121. if (!r) {
  122. amdgpu_bo_kunmap(sa_manager->bo);
  123. amdgpu_bo_unpin(sa_manager->bo);
  124. amdgpu_bo_unreserve(sa_manager->bo);
  125. }
  126. return r;
  127. }
  128. static uint32_t amdgpu_sa_get_ring_from_fence(struct fence *f)
  129. {
  130. struct amdgpu_fence *a_fence;
  131. struct amd_sched_fence *s_fence;
  132. s_fence = to_amd_sched_fence(f);
  133. if (s_fence)
  134. return s_fence->scheduler->ring_id;
  135. a_fence = to_amdgpu_fence(f);
  136. if (a_fence)
  137. return a_fence->ring->idx;
  138. return 0;
  139. }
  140. static void amdgpu_sa_bo_remove_locked(struct amdgpu_sa_bo *sa_bo)
  141. {
  142. struct amdgpu_sa_manager *sa_manager = sa_bo->manager;
  143. if (sa_manager->hole == &sa_bo->olist) {
  144. sa_manager->hole = sa_bo->olist.prev;
  145. }
  146. list_del_init(&sa_bo->olist);
  147. list_del_init(&sa_bo->flist);
  148. fence_put(sa_bo->fence);
  149. kfree(sa_bo);
  150. }
  151. static void amdgpu_sa_bo_try_free(struct amdgpu_sa_manager *sa_manager)
  152. {
  153. struct amdgpu_sa_bo *sa_bo, *tmp;
  154. if (sa_manager->hole->next == &sa_manager->olist)
  155. return;
  156. sa_bo = list_entry(sa_manager->hole->next, struct amdgpu_sa_bo, olist);
  157. list_for_each_entry_safe_from(sa_bo, tmp, &sa_manager->olist, olist) {
  158. if (sa_bo->fence == NULL ||
  159. !fence_is_signaled(sa_bo->fence)) {
  160. return;
  161. }
  162. amdgpu_sa_bo_remove_locked(sa_bo);
  163. }
  164. }
  165. static inline unsigned amdgpu_sa_bo_hole_soffset(struct amdgpu_sa_manager *sa_manager)
  166. {
  167. struct list_head *hole = sa_manager->hole;
  168. if (hole != &sa_manager->olist) {
  169. return list_entry(hole, struct amdgpu_sa_bo, olist)->eoffset;
  170. }
  171. return 0;
  172. }
  173. static inline unsigned amdgpu_sa_bo_hole_eoffset(struct amdgpu_sa_manager *sa_manager)
  174. {
  175. struct list_head *hole = sa_manager->hole;
  176. if (hole->next != &sa_manager->olist) {
  177. return list_entry(hole->next, struct amdgpu_sa_bo, olist)->soffset;
  178. }
  179. return sa_manager->size;
  180. }
  181. static bool amdgpu_sa_bo_try_alloc(struct amdgpu_sa_manager *sa_manager,
  182. struct amdgpu_sa_bo *sa_bo,
  183. unsigned size, unsigned align)
  184. {
  185. unsigned soffset, eoffset, wasted;
  186. soffset = amdgpu_sa_bo_hole_soffset(sa_manager);
  187. eoffset = amdgpu_sa_bo_hole_eoffset(sa_manager);
  188. wasted = (align - (soffset % align)) % align;
  189. if ((eoffset - soffset) >= (size + wasted)) {
  190. soffset += wasted;
  191. sa_bo->manager = sa_manager;
  192. sa_bo->soffset = soffset;
  193. sa_bo->eoffset = soffset + size;
  194. list_add(&sa_bo->olist, sa_manager->hole);
  195. INIT_LIST_HEAD(&sa_bo->flist);
  196. sa_manager->hole = &sa_bo->olist;
  197. return true;
  198. }
  199. return false;
  200. }
  201. /**
  202. * amdgpu_sa_event - Check if we can stop waiting
  203. *
  204. * @sa_manager: pointer to the sa_manager
  205. * @size: number of bytes we want to allocate
  206. * @align: alignment we need to match
  207. *
  208. * Check if either there is a fence we can wait for or
  209. * enough free memory to satisfy the allocation directly
  210. */
  211. static bool amdgpu_sa_event(struct amdgpu_sa_manager *sa_manager,
  212. unsigned size, unsigned align)
  213. {
  214. unsigned soffset, eoffset, wasted;
  215. int i;
  216. for (i = 0; i < AMDGPU_MAX_RINGS; ++i) {
  217. if (!list_empty(&sa_manager->flist[i])) {
  218. return true;
  219. }
  220. }
  221. soffset = amdgpu_sa_bo_hole_soffset(sa_manager);
  222. eoffset = amdgpu_sa_bo_hole_eoffset(sa_manager);
  223. wasted = (align - (soffset % align)) % align;
  224. if ((eoffset - soffset) >= (size + wasted)) {
  225. return true;
  226. }
  227. return false;
  228. }
  229. static bool amdgpu_sa_bo_next_hole(struct amdgpu_sa_manager *sa_manager,
  230. struct fence **fences,
  231. unsigned *tries)
  232. {
  233. struct amdgpu_sa_bo *best_bo = NULL;
  234. unsigned i, soffset, best, tmp;
  235. /* if hole points to the end of the buffer */
  236. if (sa_manager->hole->next == &sa_manager->olist) {
  237. /* try again with its beginning */
  238. sa_manager->hole = &sa_manager->olist;
  239. return true;
  240. }
  241. soffset = amdgpu_sa_bo_hole_soffset(sa_manager);
  242. /* to handle wrap around we add sa_manager->size */
  243. best = sa_manager->size * 2;
  244. /* go over all fence list and try to find the closest sa_bo
  245. * of the current last
  246. */
  247. for (i = 0; i < AMDGPU_MAX_RINGS; ++i) {
  248. struct amdgpu_sa_bo *sa_bo;
  249. if (list_empty(&sa_manager->flist[i])) {
  250. continue;
  251. }
  252. sa_bo = list_first_entry(&sa_manager->flist[i],
  253. struct amdgpu_sa_bo, flist);
  254. if (!fence_is_signaled(sa_bo->fence)) {
  255. fences[i] = sa_bo->fence;
  256. continue;
  257. }
  258. /* limit the number of tries each ring gets */
  259. if (tries[i] > 2) {
  260. continue;
  261. }
  262. tmp = sa_bo->soffset;
  263. if (tmp < soffset) {
  264. /* wrap around, pretend it's after */
  265. tmp += sa_manager->size;
  266. }
  267. tmp -= soffset;
  268. if (tmp < best) {
  269. /* this sa bo is the closest one */
  270. best = tmp;
  271. best_bo = sa_bo;
  272. }
  273. }
  274. if (best_bo) {
  275. uint32_t idx = amdgpu_sa_get_ring_from_fence(best_bo->fence);
  276. ++tries[idx];
  277. sa_manager->hole = best_bo->olist.prev;
  278. /* we knew that this one is signaled,
  279. so it's save to remote it */
  280. amdgpu_sa_bo_remove_locked(best_bo);
  281. return true;
  282. }
  283. return false;
  284. }
  285. int amdgpu_sa_bo_new(struct amdgpu_device *adev,
  286. struct amdgpu_sa_manager *sa_manager,
  287. struct amdgpu_sa_bo **sa_bo,
  288. unsigned size, unsigned align)
  289. {
  290. struct fence *fences[AMDGPU_MAX_RINGS];
  291. unsigned tries[AMDGPU_MAX_RINGS];
  292. int i, r;
  293. signed long t;
  294. BUG_ON(align > sa_manager->align);
  295. BUG_ON(size > sa_manager->size);
  296. *sa_bo = kmalloc(sizeof(struct amdgpu_sa_bo), GFP_KERNEL);
  297. if ((*sa_bo) == NULL) {
  298. return -ENOMEM;
  299. }
  300. (*sa_bo)->manager = sa_manager;
  301. (*sa_bo)->fence = NULL;
  302. INIT_LIST_HEAD(&(*sa_bo)->olist);
  303. INIT_LIST_HEAD(&(*sa_bo)->flist);
  304. spin_lock(&sa_manager->wq.lock);
  305. do {
  306. for (i = 0; i < AMDGPU_MAX_RINGS; ++i) {
  307. fences[i] = NULL;
  308. tries[i] = 0;
  309. }
  310. do {
  311. amdgpu_sa_bo_try_free(sa_manager);
  312. if (amdgpu_sa_bo_try_alloc(sa_manager, *sa_bo,
  313. size, align)) {
  314. spin_unlock(&sa_manager->wq.lock);
  315. return 0;
  316. }
  317. /* see if we can skip over some allocations */
  318. } while (amdgpu_sa_bo_next_hole(sa_manager, fences, tries));
  319. spin_unlock(&sa_manager->wq.lock);
  320. t = amdgpu_fence_wait_any(adev, fences, AMDGPU_MAX_RINGS,
  321. false, MAX_SCHEDULE_TIMEOUT);
  322. r = (t > 0) ? 0 : t;
  323. spin_lock(&sa_manager->wq.lock);
  324. /* if we have nothing to wait for block */
  325. if (r == -ENOENT) {
  326. r = wait_event_interruptible_locked(
  327. sa_manager->wq,
  328. amdgpu_sa_event(sa_manager, size, align)
  329. );
  330. }
  331. } while (!r);
  332. spin_unlock(&sa_manager->wq.lock);
  333. kfree(*sa_bo);
  334. *sa_bo = NULL;
  335. return r;
  336. }
  337. void amdgpu_sa_bo_free(struct amdgpu_device *adev, struct amdgpu_sa_bo **sa_bo,
  338. struct fence *fence)
  339. {
  340. struct amdgpu_sa_manager *sa_manager;
  341. if (sa_bo == NULL || *sa_bo == NULL) {
  342. return;
  343. }
  344. sa_manager = (*sa_bo)->manager;
  345. spin_lock(&sa_manager->wq.lock);
  346. if (fence && !fence_is_signaled(fence)) {
  347. uint32_t idx;
  348. (*sa_bo)->fence = fence_get(fence);
  349. idx = amdgpu_sa_get_ring_from_fence(fence);
  350. list_add_tail(&(*sa_bo)->flist, &sa_manager->flist[idx]);
  351. } else {
  352. amdgpu_sa_bo_remove_locked(*sa_bo);
  353. }
  354. wake_up_all_locked(&sa_manager->wq);
  355. spin_unlock(&sa_manager->wq.lock);
  356. *sa_bo = NULL;
  357. }
  358. #if defined(CONFIG_DEBUG_FS)
  359. void amdgpu_sa_bo_dump_debug_info(struct amdgpu_sa_manager *sa_manager,
  360. struct seq_file *m)
  361. {
  362. struct amdgpu_sa_bo *i;
  363. spin_lock(&sa_manager->wq.lock);
  364. list_for_each_entry(i, &sa_manager->olist, olist) {
  365. uint64_t soffset = i->soffset + sa_manager->gpu_addr;
  366. uint64_t eoffset = i->eoffset + sa_manager->gpu_addr;
  367. if (&i->olist == sa_manager->hole) {
  368. seq_printf(m, ">");
  369. } else {
  370. seq_printf(m, " ");
  371. }
  372. seq_printf(m, "[0x%010llx 0x%010llx] size %8lld",
  373. soffset, eoffset, eoffset - soffset);
  374. if (i->fence) {
  375. struct amdgpu_fence *a_fence = to_amdgpu_fence(i->fence);
  376. struct amd_sched_fence *s_fence = to_amd_sched_fence(i->fence);
  377. if (a_fence)
  378. seq_printf(m, " protected by 0x%016llx on ring %d",
  379. a_fence->seq, a_fence->ring->idx);
  380. if (s_fence)
  381. seq_printf(m, " protected by 0x%016x on ring %d",
  382. s_fence->base.seqno,
  383. s_fence->scheduler->ring_id);
  384. }
  385. seq_printf(m, "\n");
  386. }
  387. spin_unlock(&sa_manager->wq.lock);
  388. }
  389. #endif