qxl_release.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469
  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 long qxl_fence_wait(struct dma_fence *fence, bool intr,
  49. signed long timeout)
  50. {
  51. struct qxl_device *qdev;
  52. struct qxl_release *release;
  53. int count = 0, sc = 0;
  54. bool have_drawable_releases;
  55. unsigned long cur, end = jiffies + timeout;
  56. qdev = container_of(fence->lock, struct qxl_device, release_lock);
  57. release = container_of(fence, struct qxl_release, base);
  58. have_drawable_releases = release->type == QXL_RELEASE_DRAWABLE;
  59. retry:
  60. sc++;
  61. if (dma_fence_is_signaled(fence))
  62. goto signaled;
  63. qxl_io_notify_oom(qdev);
  64. for (count = 0; count < 11; count++) {
  65. if (!qxl_queue_garbage_collect(qdev, true))
  66. break;
  67. if (dma_fence_is_signaled(fence))
  68. goto signaled;
  69. }
  70. if (dma_fence_is_signaled(fence))
  71. goto signaled;
  72. if (have_drawable_releases || sc < 4) {
  73. if (sc > 2)
  74. /* back off */
  75. usleep_range(500, 1000);
  76. if (time_after(jiffies, end))
  77. return 0;
  78. if (have_drawable_releases && sc > 300) {
  79. DMA_FENCE_WARN(fence, "failed to wait on release %llu "
  80. "after spincount %d\n",
  81. fence->context & ~0xf0000000, sc);
  82. goto signaled;
  83. }
  84. goto retry;
  85. }
  86. /*
  87. * yeah, original sync_obj_wait gave up after 3 spins when
  88. * have_drawable_releases is not set.
  89. */
  90. signaled:
  91. cur = jiffies;
  92. if (time_after(cur, end))
  93. return 0;
  94. return end - cur;
  95. }
  96. static const struct dma_fence_ops qxl_fence_ops = {
  97. .get_driver_name = qxl_get_driver_name,
  98. .get_timeline_name = qxl_get_timeline_name,
  99. .wait = qxl_fence_wait,
  100. };
  101. static int
  102. qxl_release_alloc(struct qxl_device *qdev, int type,
  103. struct qxl_release **ret)
  104. {
  105. struct qxl_release *release;
  106. int handle;
  107. size_t size = sizeof(*release);
  108. release = kmalloc(size, GFP_KERNEL);
  109. if (!release) {
  110. DRM_ERROR("Out of memory\n");
  111. return -ENOMEM;
  112. }
  113. release->base.ops = NULL;
  114. release->type = type;
  115. release->release_offset = 0;
  116. release->surface_release_id = 0;
  117. INIT_LIST_HEAD(&release->bos);
  118. idr_preload(GFP_KERNEL);
  119. spin_lock(&qdev->release_idr_lock);
  120. handle = idr_alloc(&qdev->release_idr, release, 1, 0, GFP_NOWAIT);
  121. release->base.seqno = ++qdev->release_seqno;
  122. spin_unlock(&qdev->release_idr_lock);
  123. idr_preload_end();
  124. if (handle < 0) {
  125. kfree(release);
  126. *ret = NULL;
  127. return handle;
  128. }
  129. *ret = release;
  130. DRM_DEBUG_DRIVER("allocated release %d\n", handle);
  131. release->id = handle;
  132. return handle;
  133. }
  134. static void
  135. qxl_release_free_list(struct qxl_release *release)
  136. {
  137. while (!list_empty(&release->bos)) {
  138. struct qxl_bo_list *entry;
  139. struct qxl_bo *bo;
  140. entry = container_of(release->bos.next,
  141. struct qxl_bo_list, tv.head);
  142. bo = to_qxl_bo(entry->tv.bo);
  143. qxl_bo_unref(&bo);
  144. list_del(&entry->tv.head);
  145. kfree(entry);
  146. }
  147. release->release_bo = NULL;
  148. }
  149. void
  150. qxl_release_free(struct qxl_device *qdev,
  151. struct qxl_release *release)
  152. {
  153. DRM_DEBUG_DRIVER("release %d, type %d\n", release->id, release->type);
  154. if (release->surface_release_id)
  155. qxl_surface_id_dealloc(qdev, release->surface_release_id);
  156. spin_lock(&qdev->release_idr_lock);
  157. idr_remove(&qdev->release_idr, release->id);
  158. spin_unlock(&qdev->release_idr_lock);
  159. if (release->base.ops) {
  160. WARN_ON(list_empty(&release->bos));
  161. qxl_release_free_list(release);
  162. dma_fence_signal(&release->base);
  163. dma_fence_put(&release->base);
  164. } else {
  165. qxl_release_free_list(release);
  166. kfree(release);
  167. }
  168. }
  169. static int qxl_release_bo_alloc(struct qxl_device *qdev,
  170. struct qxl_bo **bo)
  171. {
  172. /* pin releases bo's they are too messy to evict */
  173. return qxl_bo_create(qdev, PAGE_SIZE, false, true,
  174. QXL_GEM_DOMAIN_VRAM, NULL, bo);
  175. }
  176. int qxl_release_list_add(struct qxl_release *release, struct qxl_bo *bo)
  177. {
  178. struct qxl_bo_list *entry;
  179. list_for_each_entry(entry, &release->bos, tv.head) {
  180. if (entry->tv.bo == &bo->tbo)
  181. return 0;
  182. }
  183. entry = kmalloc(sizeof(struct qxl_bo_list), GFP_KERNEL);
  184. if (!entry)
  185. return -ENOMEM;
  186. qxl_bo_ref(bo);
  187. entry->tv.bo = &bo->tbo;
  188. entry->tv.shared = false;
  189. list_add_tail(&entry->tv.head, &release->bos);
  190. return 0;
  191. }
  192. static int qxl_release_validate_bo(struct qxl_bo *bo)
  193. {
  194. struct ttm_operation_ctx ctx = { true, false };
  195. int ret;
  196. if (!bo->pin_count) {
  197. qxl_ttm_placement_from_domain(bo, bo->type, false);
  198. ret = ttm_bo_validate(&bo->tbo, &bo->placement, &ctx);
  199. if (ret)
  200. return ret;
  201. }
  202. ret = reservation_object_reserve_shared(bo->tbo.resv);
  203. if (ret)
  204. return ret;
  205. /* allocate a surface for reserved + validated buffers */
  206. ret = qxl_bo_check_id(bo->gem_base.dev->dev_private, bo);
  207. if (ret)
  208. return ret;
  209. return 0;
  210. }
  211. int qxl_release_reserve_list(struct qxl_release *release, bool no_intr)
  212. {
  213. int ret;
  214. struct qxl_bo_list *entry;
  215. /* if only one object on the release its the release itself
  216. since these objects are pinned no need to reserve */
  217. if (list_is_singular(&release->bos))
  218. return 0;
  219. ret = ttm_eu_reserve_buffers(&release->ticket, &release->bos,
  220. !no_intr, NULL);
  221. if (ret)
  222. return ret;
  223. list_for_each_entry(entry, &release->bos, tv.head) {
  224. struct qxl_bo *bo = to_qxl_bo(entry->tv.bo);
  225. ret = qxl_release_validate_bo(bo);
  226. if (ret) {
  227. ttm_eu_backoff_reservation(&release->ticket, &release->bos);
  228. return ret;
  229. }
  230. }
  231. return 0;
  232. }
  233. void qxl_release_backoff_reserve_list(struct qxl_release *release)
  234. {
  235. /* if only one object on the release its the release itself
  236. since these objects are pinned no need to reserve */
  237. if (list_is_singular(&release->bos))
  238. return;
  239. ttm_eu_backoff_reservation(&release->ticket, &release->bos);
  240. }
  241. int qxl_alloc_surface_release_reserved(struct qxl_device *qdev,
  242. enum qxl_surface_cmd_type surface_cmd_type,
  243. struct qxl_release *create_rel,
  244. struct qxl_release **release)
  245. {
  246. if (surface_cmd_type == QXL_SURFACE_CMD_DESTROY && create_rel) {
  247. int idr_ret;
  248. struct qxl_bo *bo;
  249. union qxl_release_info *info;
  250. /* stash the release after the create command */
  251. idr_ret = qxl_release_alloc(qdev, QXL_RELEASE_SURFACE_CMD, release);
  252. if (idr_ret < 0)
  253. return idr_ret;
  254. bo = create_rel->release_bo;
  255. (*release)->release_bo = bo;
  256. (*release)->release_offset = create_rel->release_offset + 64;
  257. qxl_release_list_add(*release, bo);
  258. info = qxl_release_map(qdev, *release);
  259. info->id = idr_ret;
  260. qxl_release_unmap(qdev, *release, info);
  261. return 0;
  262. }
  263. return qxl_alloc_release_reserved(qdev, sizeof(struct qxl_surface_cmd),
  264. QXL_RELEASE_SURFACE_CMD, release, NULL);
  265. }
  266. int qxl_alloc_release_reserved(struct qxl_device *qdev, unsigned long size,
  267. int type, struct qxl_release **release,
  268. struct qxl_bo **rbo)
  269. {
  270. struct qxl_bo *bo;
  271. int idr_ret;
  272. int ret = 0;
  273. union qxl_release_info *info;
  274. int cur_idx;
  275. if (type == QXL_RELEASE_DRAWABLE)
  276. cur_idx = 0;
  277. else if (type == QXL_RELEASE_SURFACE_CMD)
  278. cur_idx = 1;
  279. else if (type == QXL_RELEASE_CURSOR_CMD)
  280. cur_idx = 2;
  281. else {
  282. DRM_ERROR("got illegal type: %d\n", type);
  283. return -EINVAL;
  284. }
  285. idr_ret = qxl_release_alloc(qdev, type, release);
  286. if (idr_ret < 0) {
  287. if (rbo)
  288. *rbo = NULL;
  289. return idr_ret;
  290. }
  291. mutex_lock(&qdev->release_mutex);
  292. if (qdev->current_release_bo_offset[cur_idx] + 1 >= releases_per_bo[cur_idx]) {
  293. qxl_bo_unref(&qdev->current_release_bo[cur_idx]);
  294. qdev->current_release_bo_offset[cur_idx] = 0;
  295. qdev->current_release_bo[cur_idx] = NULL;
  296. }
  297. if (!qdev->current_release_bo[cur_idx]) {
  298. ret = qxl_release_bo_alloc(qdev, &qdev->current_release_bo[cur_idx]);
  299. if (ret) {
  300. mutex_unlock(&qdev->release_mutex);
  301. qxl_release_free(qdev, *release);
  302. return ret;
  303. }
  304. }
  305. bo = qxl_bo_ref(qdev->current_release_bo[cur_idx]);
  306. (*release)->release_bo = bo;
  307. (*release)->release_offset = qdev->current_release_bo_offset[cur_idx] * release_size_per_bo[cur_idx];
  308. qdev->current_release_bo_offset[cur_idx]++;
  309. if (rbo)
  310. *rbo = bo;
  311. mutex_unlock(&qdev->release_mutex);
  312. ret = qxl_release_list_add(*release, bo);
  313. qxl_bo_unref(&bo);
  314. if (ret) {
  315. qxl_release_free(qdev, *release);
  316. return ret;
  317. }
  318. info = qxl_release_map(qdev, *release);
  319. info->id = idr_ret;
  320. qxl_release_unmap(qdev, *release, info);
  321. return ret;
  322. }
  323. struct qxl_release *qxl_release_from_id_locked(struct qxl_device *qdev,
  324. uint64_t id)
  325. {
  326. struct qxl_release *release;
  327. spin_lock(&qdev->release_idr_lock);
  328. release = idr_find(&qdev->release_idr, id);
  329. spin_unlock(&qdev->release_idr_lock);
  330. if (!release) {
  331. DRM_ERROR("failed to find id in release_idr\n");
  332. return NULL;
  333. }
  334. return release;
  335. }
  336. union qxl_release_info *qxl_release_map(struct qxl_device *qdev,
  337. struct qxl_release *release)
  338. {
  339. void *ptr;
  340. union qxl_release_info *info;
  341. struct qxl_bo *bo = release->release_bo;
  342. ptr = qxl_bo_kmap_atomic_page(qdev, bo, release->release_offset & PAGE_MASK);
  343. if (!ptr)
  344. return NULL;
  345. info = ptr + (release->release_offset & ~PAGE_MASK);
  346. return info;
  347. }
  348. void qxl_release_unmap(struct qxl_device *qdev,
  349. struct qxl_release *release,
  350. union qxl_release_info *info)
  351. {
  352. struct qxl_bo *bo = release->release_bo;
  353. void *ptr;
  354. ptr = ((void *)info) - (release->release_offset & ~PAGE_MASK);
  355. qxl_bo_kunmap_atomic_page(qdev, bo, ptr);
  356. }
  357. void qxl_release_fence_buffer_objects(struct qxl_release *release)
  358. {
  359. struct ttm_buffer_object *bo;
  360. struct ttm_bo_global *glob;
  361. struct ttm_bo_device *bdev;
  362. struct ttm_bo_driver *driver;
  363. struct qxl_bo *qbo;
  364. struct ttm_validate_buffer *entry;
  365. struct qxl_device *qdev;
  366. /* if only one object on the release its the release itself
  367. since these objects are pinned no need to reserve */
  368. if (list_is_singular(&release->bos) || list_empty(&release->bos))
  369. return;
  370. bo = list_first_entry(&release->bos, struct ttm_validate_buffer, head)->bo;
  371. bdev = bo->bdev;
  372. qdev = container_of(bdev, struct qxl_device, mman.bdev);
  373. /*
  374. * Since we never really allocated a context and we don't want to conflict,
  375. * set the highest bits. This will break if we really allow exporting of dma-bufs.
  376. */
  377. dma_fence_init(&release->base, &qxl_fence_ops, &qdev->release_lock,
  378. release->id | 0xf0000000, release->base.seqno);
  379. trace_dma_fence_emit(&release->base);
  380. driver = bdev->driver;
  381. glob = bdev->glob;
  382. spin_lock(&glob->lru_lock);
  383. list_for_each_entry(entry, &release->bos, head) {
  384. bo = entry->bo;
  385. qbo = to_qxl_bo(bo);
  386. reservation_object_add_shared_fence(bo->resv, &release->base);
  387. ttm_bo_add_to_lru(bo);
  388. reservation_object_unlock(bo->resv);
  389. }
  390. spin_unlock(&glob->lru_lock);
  391. ww_acquire_fini(&release->ticket);
  392. }