amdgpu_sa.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437
  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_SA_NUM_FENCE_LISTS; ++i)
  61. INIT_LIST_HEAD(&sa_manager->flist[i]);
  62. r = amdgpu_bo_create(adev, size, align, true, domain,
  63. 0, NULL, NULL, &sa_manager->bo);
  64. if (r) {
  65. dev_err(adev->dev, "(%d) failed to allocate bo for manager\n", r);
  66. return r;
  67. }
  68. return r;
  69. }
  70. void amdgpu_sa_bo_manager_fini(struct amdgpu_device *adev,
  71. struct amdgpu_sa_manager *sa_manager)
  72. {
  73. struct amdgpu_sa_bo *sa_bo, *tmp;
  74. if (!list_empty(&sa_manager->olist)) {
  75. sa_manager->hole = &sa_manager->olist,
  76. amdgpu_sa_bo_try_free(sa_manager);
  77. if (!list_empty(&sa_manager->olist)) {
  78. dev_err(adev->dev, "sa_manager is not empty, clearing anyway\n");
  79. }
  80. }
  81. list_for_each_entry_safe(sa_bo, tmp, &sa_manager->olist, olist) {
  82. amdgpu_sa_bo_remove_locked(sa_bo);
  83. }
  84. amdgpu_bo_unref(&sa_manager->bo);
  85. sa_manager->size = 0;
  86. }
  87. int amdgpu_sa_bo_manager_start(struct amdgpu_device *adev,
  88. struct amdgpu_sa_manager *sa_manager)
  89. {
  90. int r;
  91. if (sa_manager->bo == NULL) {
  92. dev_err(adev->dev, "no bo for sa manager\n");
  93. return -EINVAL;
  94. }
  95. /* map the buffer */
  96. r = amdgpu_bo_reserve(sa_manager->bo, false);
  97. if (r) {
  98. dev_err(adev->dev, "(%d) failed to reserve manager bo\n", r);
  99. return r;
  100. }
  101. r = amdgpu_bo_pin(sa_manager->bo, sa_manager->domain, &sa_manager->gpu_addr);
  102. if (r) {
  103. amdgpu_bo_unreserve(sa_manager->bo);
  104. dev_err(adev->dev, "(%d) failed to pin manager bo\n", r);
  105. return r;
  106. }
  107. r = amdgpu_bo_kmap(sa_manager->bo, &sa_manager->cpu_ptr);
  108. amdgpu_bo_unreserve(sa_manager->bo);
  109. return r;
  110. }
  111. int amdgpu_sa_bo_manager_suspend(struct amdgpu_device *adev,
  112. struct amdgpu_sa_manager *sa_manager)
  113. {
  114. int r;
  115. if (sa_manager->bo == NULL) {
  116. dev_err(adev->dev, "no bo for sa manager\n");
  117. return -EINVAL;
  118. }
  119. r = amdgpu_bo_reserve(sa_manager->bo, false);
  120. if (!r) {
  121. amdgpu_bo_kunmap(sa_manager->bo);
  122. amdgpu_bo_unpin(sa_manager->bo);
  123. amdgpu_bo_unreserve(sa_manager->bo);
  124. }
  125. return r;
  126. }
  127. static void amdgpu_sa_bo_remove_locked(struct amdgpu_sa_bo *sa_bo)
  128. {
  129. struct amdgpu_sa_manager *sa_manager = sa_bo->manager;
  130. if (sa_manager->hole == &sa_bo->olist) {
  131. sa_manager->hole = sa_bo->olist.prev;
  132. }
  133. list_del_init(&sa_bo->olist);
  134. list_del_init(&sa_bo->flist);
  135. fence_put(sa_bo->fence);
  136. kfree(sa_bo);
  137. }
  138. static void amdgpu_sa_bo_try_free(struct amdgpu_sa_manager *sa_manager)
  139. {
  140. struct amdgpu_sa_bo *sa_bo, *tmp;
  141. if (sa_manager->hole->next == &sa_manager->olist)
  142. return;
  143. sa_bo = list_entry(sa_manager->hole->next, struct amdgpu_sa_bo, olist);
  144. list_for_each_entry_safe_from(sa_bo, tmp, &sa_manager->olist, olist) {
  145. if (sa_bo->fence == NULL ||
  146. !fence_is_signaled(sa_bo->fence)) {
  147. return;
  148. }
  149. amdgpu_sa_bo_remove_locked(sa_bo);
  150. }
  151. }
  152. static inline unsigned amdgpu_sa_bo_hole_soffset(struct amdgpu_sa_manager *sa_manager)
  153. {
  154. struct list_head *hole = sa_manager->hole;
  155. if (hole != &sa_manager->olist) {
  156. return list_entry(hole, struct amdgpu_sa_bo, olist)->eoffset;
  157. }
  158. return 0;
  159. }
  160. static inline unsigned amdgpu_sa_bo_hole_eoffset(struct amdgpu_sa_manager *sa_manager)
  161. {
  162. struct list_head *hole = sa_manager->hole;
  163. if (hole->next != &sa_manager->olist) {
  164. return list_entry(hole->next, struct amdgpu_sa_bo, olist)->soffset;
  165. }
  166. return sa_manager->size;
  167. }
  168. static bool amdgpu_sa_bo_try_alloc(struct amdgpu_sa_manager *sa_manager,
  169. struct amdgpu_sa_bo *sa_bo,
  170. unsigned size, unsigned align)
  171. {
  172. unsigned soffset, eoffset, wasted;
  173. soffset = amdgpu_sa_bo_hole_soffset(sa_manager);
  174. eoffset = amdgpu_sa_bo_hole_eoffset(sa_manager);
  175. wasted = (align - (soffset % align)) % align;
  176. if ((eoffset - soffset) >= (size + wasted)) {
  177. soffset += wasted;
  178. sa_bo->manager = sa_manager;
  179. sa_bo->soffset = soffset;
  180. sa_bo->eoffset = soffset + size;
  181. list_add(&sa_bo->olist, sa_manager->hole);
  182. INIT_LIST_HEAD(&sa_bo->flist);
  183. sa_manager->hole = &sa_bo->olist;
  184. return true;
  185. }
  186. return false;
  187. }
  188. /**
  189. * amdgpu_sa_event - Check if we can stop waiting
  190. *
  191. * @sa_manager: pointer to the sa_manager
  192. * @size: number of bytes we want to allocate
  193. * @align: alignment we need to match
  194. *
  195. * Check if either there is a fence we can wait for or
  196. * enough free memory to satisfy the allocation directly
  197. */
  198. static bool amdgpu_sa_event(struct amdgpu_sa_manager *sa_manager,
  199. unsigned size, unsigned align)
  200. {
  201. unsigned soffset, eoffset, wasted;
  202. int i;
  203. for (i = 0; i < AMDGPU_SA_NUM_FENCE_LISTS; ++i)
  204. if (!list_empty(&sa_manager->flist[i]))
  205. return true;
  206. soffset = amdgpu_sa_bo_hole_soffset(sa_manager);
  207. eoffset = amdgpu_sa_bo_hole_eoffset(sa_manager);
  208. wasted = (align - (soffset % align)) % align;
  209. if ((eoffset - soffset) >= (size + wasted)) {
  210. return true;
  211. }
  212. return false;
  213. }
  214. static bool amdgpu_sa_bo_next_hole(struct amdgpu_sa_manager *sa_manager,
  215. struct fence **fences,
  216. unsigned *tries)
  217. {
  218. struct amdgpu_sa_bo *best_bo = NULL;
  219. unsigned i, soffset, best, tmp;
  220. /* if hole points to the end of the buffer */
  221. if (sa_manager->hole->next == &sa_manager->olist) {
  222. /* try again with its beginning */
  223. sa_manager->hole = &sa_manager->olist;
  224. return true;
  225. }
  226. soffset = amdgpu_sa_bo_hole_soffset(sa_manager);
  227. /* to handle wrap around we add sa_manager->size */
  228. best = sa_manager->size * 2;
  229. /* go over all fence list and try to find the closest sa_bo
  230. * of the current last
  231. */
  232. for (i = 0; i < AMDGPU_SA_NUM_FENCE_LISTS; ++i) {
  233. struct amdgpu_sa_bo *sa_bo;
  234. if (list_empty(&sa_manager->flist[i]))
  235. continue;
  236. sa_bo = list_first_entry(&sa_manager->flist[i],
  237. struct amdgpu_sa_bo, flist);
  238. if (!fence_is_signaled(sa_bo->fence)) {
  239. fences[i] = sa_bo->fence;
  240. continue;
  241. }
  242. /* limit the number of tries each ring gets */
  243. if (tries[i] > 2) {
  244. continue;
  245. }
  246. tmp = sa_bo->soffset;
  247. if (tmp < soffset) {
  248. /* wrap around, pretend it's after */
  249. tmp += sa_manager->size;
  250. }
  251. tmp -= soffset;
  252. if (tmp < best) {
  253. /* this sa bo is the closest one */
  254. best = tmp;
  255. best_bo = sa_bo;
  256. }
  257. }
  258. if (best_bo) {
  259. uint32_t idx = best_bo->fence->context;
  260. idx %= AMDGPU_SA_NUM_FENCE_LISTS;
  261. ++tries[idx];
  262. sa_manager->hole = best_bo->olist.prev;
  263. /* we knew that this one is signaled,
  264. so it's save to remote it */
  265. amdgpu_sa_bo_remove_locked(best_bo);
  266. return true;
  267. }
  268. return false;
  269. }
  270. int amdgpu_sa_bo_new(struct amdgpu_sa_manager *sa_manager,
  271. struct amdgpu_sa_bo **sa_bo,
  272. unsigned size, unsigned align)
  273. {
  274. struct fence *fences[AMDGPU_SA_NUM_FENCE_LISTS];
  275. unsigned tries[AMDGPU_SA_NUM_FENCE_LISTS];
  276. unsigned count;
  277. int i, r;
  278. signed long t;
  279. if (WARN_ON_ONCE(align > sa_manager->align))
  280. return -EINVAL;
  281. if (WARN_ON_ONCE(size > sa_manager->size))
  282. return -EINVAL;
  283. *sa_bo = kmalloc(sizeof(struct amdgpu_sa_bo), GFP_KERNEL);
  284. if ((*sa_bo) == NULL) {
  285. return -ENOMEM;
  286. }
  287. (*sa_bo)->manager = sa_manager;
  288. (*sa_bo)->fence = NULL;
  289. INIT_LIST_HEAD(&(*sa_bo)->olist);
  290. INIT_LIST_HEAD(&(*sa_bo)->flist);
  291. spin_lock(&sa_manager->wq.lock);
  292. do {
  293. for (i = 0; i < AMDGPU_SA_NUM_FENCE_LISTS; ++i) {
  294. fences[i] = NULL;
  295. tries[i] = 0;
  296. }
  297. do {
  298. amdgpu_sa_bo_try_free(sa_manager);
  299. if (amdgpu_sa_bo_try_alloc(sa_manager, *sa_bo,
  300. size, align)) {
  301. spin_unlock(&sa_manager->wq.lock);
  302. return 0;
  303. }
  304. /* see if we can skip over some allocations */
  305. } while (amdgpu_sa_bo_next_hole(sa_manager, fences, tries));
  306. for (i = 0, count = 0; i < AMDGPU_SA_NUM_FENCE_LISTS; ++i)
  307. if (fences[i])
  308. fences[count++] = fence_get(fences[i]);
  309. if (count) {
  310. spin_unlock(&sa_manager->wq.lock);
  311. t = fence_wait_any_timeout(fences, count, false,
  312. MAX_SCHEDULE_TIMEOUT);
  313. for (i = 0; i < count; ++i)
  314. fence_put(fences[i]);
  315. r = (t > 0) ? 0 : t;
  316. spin_lock(&sa_manager->wq.lock);
  317. } else {
  318. /* if we have nothing to wait for block */
  319. r = wait_event_interruptible_locked(
  320. sa_manager->wq,
  321. amdgpu_sa_event(sa_manager, size, align)
  322. );
  323. }
  324. } while (!r);
  325. spin_unlock(&sa_manager->wq.lock);
  326. kfree(*sa_bo);
  327. *sa_bo = NULL;
  328. return r;
  329. }
  330. void amdgpu_sa_bo_free(struct amdgpu_device *adev, struct amdgpu_sa_bo **sa_bo,
  331. struct fence *fence)
  332. {
  333. struct amdgpu_sa_manager *sa_manager;
  334. if (sa_bo == NULL || *sa_bo == NULL) {
  335. return;
  336. }
  337. sa_manager = (*sa_bo)->manager;
  338. spin_lock(&sa_manager->wq.lock);
  339. if (fence && !fence_is_signaled(fence)) {
  340. uint32_t idx;
  341. (*sa_bo)->fence = fence_get(fence);
  342. idx = fence->context % AMDGPU_SA_NUM_FENCE_LISTS;
  343. list_add_tail(&(*sa_bo)->flist, &sa_manager->flist[idx]);
  344. } else {
  345. amdgpu_sa_bo_remove_locked(*sa_bo);
  346. }
  347. wake_up_all_locked(&sa_manager->wq);
  348. spin_unlock(&sa_manager->wq.lock);
  349. *sa_bo = NULL;
  350. }
  351. #if defined(CONFIG_DEBUG_FS)
  352. void amdgpu_sa_bo_dump_debug_info(struct amdgpu_sa_manager *sa_manager,
  353. struct seq_file *m)
  354. {
  355. struct amdgpu_sa_bo *i;
  356. spin_lock(&sa_manager->wq.lock);
  357. list_for_each_entry(i, &sa_manager->olist, olist) {
  358. uint64_t soffset = i->soffset + sa_manager->gpu_addr;
  359. uint64_t eoffset = i->eoffset + sa_manager->gpu_addr;
  360. if (&i->olist == sa_manager->hole) {
  361. seq_printf(m, ">");
  362. } else {
  363. seq_printf(m, " ");
  364. }
  365. seq_printf(m, "[0x%010llx 0x%010llx] size %8lld",
  366. soffset, eoffset, eoffset - soffset);
  367. if (i->fence)
  368. seq_printf(m, " protected by 0x%08x on context %d",
  369. i->fence->seqno, i->fence->context);
  370. seq_printf(m, "\n");
  371. }
  372. spin_unlock(&sa_manager->wq.lock);
  373. }
  374. #endif