qxl_release.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477
  1. /*
  2. * Copyright 2011 Red Hat, Inc.
  3. *
  4. * Permission is hereby granted, free of charge, to any person obtaining a
  5. * copy of this software and associated documentation files (the "Software"),
  6. * to deal in the Software without restriction, including without limitation
  7. * on the rights to use, copy, modify, merge, publish, distribute, sub
  8. * license, and/or sell copies of the Software, and to permit persons to whom
  9. * the Software is furnished to do so, subject to the following conditions:
  10. *
  11. * The above copyright notice and this permission notice (including the next
  12. * paragraph) shall be included in all copies or substantial portions of the
  13. * Software.
  14. *
  15. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  16. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  17. * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
  18. * THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
  19. * IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  20. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
  21. */
  22. #include "qxl_drv.h"
  23. #include "qxl_object.h"
  24. #include <trace/events/dma_fence.h>
  25. /*
  26. * drawable cmd cache - allocate a bunch of VRAM pages, suballocate
  27. * into 256 byte chunks for now - gives 16 cmds per page.
  28. *
  29. * use an ida to index into the chunks?
  30. */
  31. /* manage releaseables */
  32. /* stack them 16 high for now -drawable object is 191 */
  33. #define RELEASE_SIZE 256
  34. #define RELEASES_PER_BO (4096 / RELEASE_SIZE)
  35. /* put an alloc/dealloc surface cmd into one bo and round up to 128 */
  36. #define SURFACE_RELEASE_SIZE 128
  37. #define SURFACE_RELEASES_PER_BO (4096 / SURFACE_RELEASE_SIZE)
  38. static const int release_size_per_bo[] = { RELEASE_SIZE, SURFACE_RELEASE_SIZE, RELEASE_SIZE };
  39. static const int releases_per_bo[] = { RELEASES_PER_BO, SURFACE_RELEASES_PER_BO, RELEASES_PER_BO };
  40. static const char *qxl_get_driver_name(struct dma_fence *fence)
  41. {
  42. return "qxl";
  43. }
  44. static const char *qxl_get_timeline_name(struct dma_fence *fence)
  45. {
  46. return "release";
  47. }
  48. static bool qxl_nop_signaling(struct dma_fence *fence)
  49. {
  50. /* fences are always automatically signaled, so just pretend we did this.. */
  51. return true;
  52. }
  53. static long qxl_fence_wait(struct dma_fence *fence, bool intr,
  54. signed long timeout)
  55. {
  56. struct qxl_device *qdev;
  57. struct qxl_release *release;
  58. int count = 0, sc = 0;
  59. bool have_drawable_releases;
  60. unsigned long cur, end = jiffies + timeout;
  61. qdev = container_of(fence->lock, struct qxl_device, release_lock);
  62. release = container_of(fence, struct qxl_release, base);
  63. have_drawable_releases = release->type == QXL_RELEASE_DRAWABLE;
  64. retry:
  65. sc++;
  66. if (dma_fence_is_signaled(fence))
  67. goto signaled;
  68. qxl_io_notify_oom(qdev);
  69. for (count = 0; count < 11; count++) {
  70. if (!qxl_queue_garbage_collect(qdev, true))
  71. break;
  72. if (dma_fence_is_signaled(fence))
  73. goto signaled;
  74. }
  75. if (dma_fence_is_signaled(fence))
  76. goto signaled;
  77. if (have_drawable_releases || sc < 4) {
  78. if (sc > 2)
  79. /* back off */
  80. usleep_range(500, 1000);
  81. if (time_after(jiffies, end))
  82. return 0;
  83. if (have_drawable_releases && sc > 300) {
  84. DMA_FENCE_WARN(fence, "failed to wait on release %llu "
  85. "after spincount %d\n",
  86. fence->context & ~0xf0000000, sc);
  87. goto signaled;
  88. }
  89. goto retry;
  90. }
  91. /*
  92. * yeah, original sync_obj_wait gave up after 3 spins when
  93. * have_drawable_releases is not set.
  94. */
  95. signaled:
  96. cur = jiffies;
  97. if (time_after(cur, end))
  98. return 0;
  99. return end - cur;
  100. }
  101. static const struct dma_fence_ops qxl_fence_ops = {
  102. .get_driver_name = qxl_get_driver_name,
  103. .get_timeline_name = qxl_get_timeline_name,
  104. .enable_signaling = qxl_nop_signaling,
  105. .wait = qxl_fence_wait,
  106. };
  107. static int
  108. qxl_release_alloc(struct qxl_device *qdev, int type,
  109. struct qxl_release **ret)
  110. {
  111. struct qxl_release *release;
  112. int handle;
  113. size_t size = sizeof(*release);
  114. release = kmalloc(size, GFP_KERNEL);
  115. if (!release) {
  116. DRM_ERROR("Out of memory\n");
  117. return -ENOMEM;
  118. }
  119. release->base.ops = NULL;
  120. release->type = type;
  121. release->release_offset = 0;
  122. release->surface_release_id = 0;
  123. INIT_LIST_HEAD(&release->bos);
  124. idr_preload(GFP_KERNEL);
  125. spin_lock(&qdev->release_idr_lock);
  126. handle = idr_alloc(&qdev->release_idr, release, 1, 0, GFP_NOWAIT);
  127. release->base.seqno = ++qdev->release_seqno;
  128. spin_unlock(&qdev->release_idr_lock);
  129. idr_preload_end();
  130. if (handle < 0) {
  131. kfree(release);
  132. *ret = NULL;
  133. return handle;
  134. }
  135. *ret = release;
  136. QXL_INFO(qdev, "allocated release %d\n", handle);
  137. release->id = handle;
  138. return handle;
  139. }
  140. static void
  141. qxl_release_free_list(struct qxl_release *release)
  142. {
  143. while (!list_empty(&release->bos)) {
  144. struct qxl_bo_list *entry;
  145. struct qxl_bo *bo;
  146. entry = container_of(release->bos.next,
  147. struct qxl_bo_list, tv.head);
  148. bo = to_qxl_bo(entry->tv.bo);
  149. qxl_bo_unref(&bo);
  150. list_del(&entry->tv.head);
  151. kfree(entry);
  152. }
  153. }
  154. void
  155. qxl_release_free(struct qxl_device *qdev,
  156. struct qxl_release *release)
  157. {
  158. QXL_INFO(qdev, "release %d, type %d\n", release->id,
  159. release->type);
  160. if (release->surface_release_id)
  161. qxl_surface_id_dealloc(qdev, release->surface_release_id);
  162. spin_lock(&qdev->release_idr_lock);
  163. idr_remove(&qdev->release_idr, release->id);
  164. spin_unlock(&qdev->release_idr_lock);
  165. if (release->base.ops) {
  166. WARN_ON(list_empty(&release->bos));
  167. qxl_release_free_list(release);
  168. dma_fence_signal(&release->base);
  169. dma_fence_put(&release->base);
  170. } else {
  171. qxl_release_free_list(release);
  172. kfree(release);
  173. }
  174. }
  175. static int qxl_release_bo_alloc(struct qxl_device *qdev,
  176. struct qxl_bo **bo)
  177. {
  178. /* pin releases bo's they are too messy to evict */
  179. return qxl_bo_create(qdev, PAGE_SIZE, false, true,
  180. QXL_GEM_DOMAIN_VRAM, NULL, bo);
  181. }
  182. int qxl_release_list_add(struct qxl_release *release, struct qxl_bo *bo)
  183. {
  184. struct qxl_bo_list *entry;
  185. list_for_each_entry(entry, &release->bos, tv.head) {
  186. if (entry->tv.bo == &bo->tbo)
  187. return 0;
  188. }
  189. entry = kmalloc(sizeof(struct qxl_bo_list), GFP_KERNEL);
  190. if (!entry)
  191. return -ENOMEM;
  192. qxl_bo_ref(bo);
  193. entry->tv.bo = &bo->tbo;
  194. entry->tv.shared = false;
  195. list_add_tail(&entry->tv.head, &release->bos);
  196. return 0;
  197. }
  198. static int qxl_release_validate_bo(struct qxl_bo *bo)
  199. {
  200. int ret;
  201. if (!bo->pin_count) {
  202. qxl_ttm_placement_from_domain(bo, bo->type, false);
  203. ret = ttm_bo_validate(&bo->tbo, &bo->placement,
  204. true, false);
  205. if (ret)
  206. return ret;
  207. }
  208. ret = reservation_object_reserve_shared(bo->tbo.resv);
  209. if (ret)
  210. return ret;
  211. /* allocate a surface for reserved + validated buffers */
  212. ret = qxl_bo_check_id(bo->gem_base.dev->dev_private, bo);
  213. if (ret)
  214. return ret;
  215. return 0;
  216. }
  217. int qxl_release_reserve_list(struct qxl_release *release, bool no_intr)
  218. {
  219. int ret;
  220. struct qxl_bo_list *entry;
  221. /* if only one object on the release its the release itself
  222. since these objects are pinned no need to reserve */
  223. if (list_is_singular(&release->bos))
  224. return 0;
  225. ret = ttm_eu_reserve_buffers(&release->ticket, &release->bos,
  226. !no_intr, NULL);
  227. if (ret)
  228. return ret;
  229. list_for_each_entry(entry, &release->bos, tv.head) {
  230. struct qxl_bo *bo = to_qxl_bo(entry->tv.bo);
  231. ret = qxl_release_validate_bo(bo);
  232. if (ret) {
  233. ttm_eu_backoff_reservation(&release->ticket, &release->bos);
  234. return ret;
  235. }
  236. }
  237. return 0;
  238. }
  239. void qxl_release_backoff_reserve_list(struct qxl_release *release)
  240. {
  241. /* if only one object on the release its the release itself
  242. since these objects are pinned no need to reserve */
  243. if (list_is_singular(&release->bos))
  244. return;
  245. ttm_eu_backoff_reservation(&release->ticket, &release->bos);
  246. }
  247. int qxl_alloc_surface_release_reserved(struct qxl_device *qdev,
  248. enum qxl_surface_cmd_type surface_cmd_type,
  249. struct qxl_release *create_rel,
  250. struct qxl_release **release)
  251. {
  252. if (surface_cmd_type == QXL_SURFACE_CMD_DESTROY && create_rel) {
  253. int idr_ret;
  254. struct qxl_bo_list *entry = list_first_entry(&create_rel->bos, struct qxl_bo_list, tv.head);
  255. struct qxl_bo *bo;
  256. union qxl_release_info *info;
  257. /* stash the release after the create command */
  258. idr_ret = qxl_release_alloc(qdev, QXL_RELEASE_SURFACE_CMD, release);
  259. if (idr_ret < 0)
  260. return idr_ret;
  261. bo = to_qxl_bo(entry->tv.bo);
  262. (*release)->release_offset = create_rel->release_offset + 64;
  263. qxl_release_list_add(*release, bo);
  264. info = qxl_release_map(qdev, *release);
  265. info->id = idr_ret;
  266. qxl_release_unmap(qdev, *release, info);
  267. return 0;
  268. }
  269. return qxl_alloc_release_reserved(qdev, sizeof(struct qxl_surface_cmd),
  270. QXL_RELEASE_SURFACE_CMD, release, NULL);
  271. }
  272. int qxl_alloc_release_reserved(struct qxl_device *qdev, unsigned long size,
  273. int type, struct qxl_release **release,
  274. struct qxl_bo **rbo)
  275. {
  276. struct qxl_bo *bo;
  277. int idr_ret;
  278. int ret = 0;
  279. union qxl_release_info *info;
  280. int cur_idx;
  281. if (type == QXL_RELEASE_DRAWABLE)
  282. cur_idx = 0;
  283. else if (type == QXL_RELEASE_SURFACE_CMD)
  284. cur_idx = 1;
  285. else if (type == QXL_RELEASE_CURSOR_CMD)
  286. cur_idx = 2;
  287. else {
  288. DRM_ERROR("got illegal type: %d\n", type);
  289. return -EINVAL;
  290. }
  291. idr_ret = qxl_release_alloc(qdev, type, release);
  292. if (idr_ret < 0) {
  293. if (rbo)
  294. *rbo = NULL;
  295. return idr_ret;
  296. }
  297. mutex_lock(&qdev->release_mutex);
  298. if (qdev->current_release_bo_offset[cur_idx] + 1 >= releases_per_bo[cur_idx]) {
  299. qxl_bo_unref(&qdev->current_release_bo[cur_idx]);
  300. qdev->current_release_bo_offset[cur_idx] = 0;
  301. qdev->current_release_bo[cur_idx] = NULL;
  302. }
  303. if (!qdev->current_release_bo[cur_idx]) {
  304. ret = qxl_release_bo_alloc(qdev, &qdev->current_release_bo[cur_idx]);
  305. if (ret) {
  306. mutex_unlock(&qdev->release_mutex);
  307. qxl_release_free(qdev, *release);
  308. return ret;
  309. }
  310. }
  311. bo = qxl_bo_ref(qdev->current_release_bo[cur_idx]);
  312. (*release)->release_offset = qdev->current_release_bo_offset[cur_idx] * release_size_per_bo[cur_idx];
  313. qdev->current_release_bo_offset[cur_idx]++;
  314. if (rbo)
  315. *rbo = bo;
  316. mutex_unlock(&qdev->release_mutex);
  317. ret = qxl_release_list_add(*release, bo);
  318. qxl_bo_unref(&bo);
  319. if (ret) {
  320. qxl_release_free(qdev, *release);
  321. return ret;
  322. }
  323. info = qxl_release_map(qdev, *release);
  324. info->id = idr_ret;
  325. qxl_release_unmap(qdev, *release, info);
  326. return ret;
  327. }
  328. struct qxl_release *qxl_release_from_id_locked(struct qxl_device *qdev,
  329. uint64_t id)
  330. {
  331. struct qxl_release *release;
  332. spin_lock(&qdev->release_idr_lock);
  333. release = idr_find(&qdev->release_idr, id);
  334. spin_unlock(&qdev->release_idr_lock);
  335. if (!release) {
  336. DRM_ERROR("failed to find id in release_idr\n");
  337. return NULL;
  338. }
  339. return release;
  340. }
  341. union qxl_release_info *qxl_release_map(struct qxl_device *qdev,
  342. struct qxl_release *release)
  343. {
  344. void *ptr;
  345. union qxl_release_info *info;
  346. struct qxl_bo_list *entry = list_first_entry(&release->bos, struct qxl_bo_list, tv.head);
  347. struct qxl_bo *bo = to_qxl_bo(entry->tv.bo);
  348. ptr = qxl_bo_kmap_atomic_page(qdev, bo, release->release_offset & PAGE_SIZE);
  349. if (!ptr)
  350. return NULL;
  351. info = ptr + (release->release_offset & ~PAGE_SIZE);
  352. return info;
  353. }
  354. void qxl_release_unmap(struct qxl_device *qdev,
  355. struct qxl_release *release,
  356. union qxl_release_info *info)
  357. {
  358. struct qxl_bo_list *entry = list_first_entry(&release->bos, struct qxl_bo_list, tv.head);
  359. struct qxl_bo *bo = to_qxl_bo(entry->tv.bo);
  360. void *ptr;
  361. ptr = ((void *)info) - (release->release_offset & ~PAGE_SIZE);
  362. qxl_bo_kunmap_atomic_page(qdev, bo, ptr);
  363. }
  364. void qxl_release_fence_buffer_objects(struct qxl_release *release)
  365. {
  366. struct ttm_buffer_object *bo;
  367. struct ttm_bo_global *glob;
  368. struct ttm_bo_device *bdev;
  369. struct ttm_bo_driver *driver;
  370. struct qxl_bo *qbo;
  371. struct ttm_validate_buffer *entry;
  372. struct qxl_device *qdev;
  373. /* if only one object on the release its the release itself
  374. since these objects are pinned no need to reserve */
  375. if (list_is_singular(&release->bos) || list_empty(&release->bos))
  376. return;
  377. bo = list_first_entry(&release->bos, struct ttm_validate_buffer, head)->bo;
  378. bdev = bo->bdev;
  379. qdev = container_of(bdev, struct qxl_device, mman.bdev);
  380. /*
  381. * Since we never really allocated a context and we don't want to conflict,
  382. * set the highest bits. This will break if we really allow exporting of dma-bufs.
  383. */
  384. dma_fence_init(&release->base, &qxl_fence_ops, &qdev->release_lock,
  385. release->id | 0xf0000000, release->base.seqno);
  386. trace_dma_fence_emit(&release->base);
  387. driver = bdev->driver;
  388. glob = bo->glob;
  389. spin_lock(&glob->lru_lock);
  390. list_for_each_entry(entry, &release->bos, head) {
  391. bo = entry->bo;
  392. qbo = to_qxl_bo(bo);
  393. reservation_object_add_shared_fence(bo->resv, &release->base);
  394. ttm_bo_add_to_lru(bo);
  395. __ttm_bo_unreserve(bo);
  396. }
  397. spin_unlock(&glob->lru_lock);
  398. ww_acquire_fini(&release->ticket);
  399. }