qxl_release.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443
  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 <linux/delay.h>
  23. #include <drm/drm_print.h>
  24. #include <trace/events/dma_fence.h>
  25. #include "qxl_drv.h"
  26. #include "qxl_object.h"
  27. /*
  28. * drawable cmd cache - allocate a bunch of VRAM pages, suballocate
  29. * into 256 byte chunks for now - gives 16 cmds per page.
  30. *
  31. * use an ida to index into the chunks?
  32. */
  33. /* manage releaseables */
  34. /* stack them 16 high for now -drawable object is 191 */
  35. #define RELEASE_SIZE 256
  36. #define RELEASES_PER_BO (PAGE_SIZE / RELEASE_SIZE)
  37. /* put an alloc/dealloc surface cmd into one bo and round up to 128 */
  38. #define SURFACE_RELEASE_SIZE 128
  39. #define SURFACE_RELEASES_PER_BO (PAGE_SIZE / SURFACE_RELEASE_SIZE)
  40. static const int release_size_per_bo[] = { RELEASE_SIZE, SURFACE_RELEASE_SIZE, RELEASE_SIZE };
  41. static const int releases_per_bo[] = { RELEASES_PER_BO, SURFACE_RELEASES_PER_BO, RELEASES_PER_BO };
  42. static const char *qxl_get_driver_name(struct dma_fence *fence)
  43. {
  44. return "qxl";
  45. }
  46. static const char *qxl_get_timeline_name(struct dma_fence *fence)
  47. {
  48. return "release";
  49. }
  50. static long qxl_fence_wait(struct dma_fence *fence, bool intr,
  51. signed long timeout)
  52. {
  53. struct qxl_device *qdev;
  54. unsigned long cur, end = jiffies + timeout;
  55. qdev = container_of(fence->lock, struct qxl_device, release_lock);
  56. if (!wait_event_timeout(qdev->release_event,
  57. (dma_fence_is_signaled(fence) ||
  58. (qxl_io_notify_oom(qdev), 0)),
  59. timeout))
  60. return 0;
  61. cur = jiffies;
  62. if (time_after(cur, end))
  63. return 0;
  64. return end - cur;
  65. }
  66. static const struct dma_fence_ops qxl_fence_ops = {
  67. .get_driver_name = qxl_get_driver_name,
  68. .get_timeline_name = qxl_get_timeline_name,
  69. .wait = qxl_fence_wait,
  70. };
  71. static int
  72. qxl_release_alloc(struct qxl_device *qdev, int type,
  73. struct qxl_release **ret)
  74. {
  75. struct qxl_release *release;
  76. int handle;
  77. size_t size = sizeof(*release);
  78. release = kmalloc(size, GFP_KERNEL);
  79. if (!release) {
  80. DRM_ERROR("Out of memory\n");
  81. return -ENOMEM;
  82. }
  83. release->base.ops = NULL;
  84. release->type = type;
  85. release->release_offset = 0;
  86. release->surface_release_id = 0;
  87. INIT_LIST_HEAD(&release->bos);
  88. idr_preload(GFP_KERNEL);
  89. spin_lock(&qdev->release_idr_lock);
  90. handle = idr_alloc(&qdev->release_idr, release, 1, 0, GFP_NOWAIT);
  91. release->base.seqno = ++qdev->release_seqno;
  92. spin_unlock(&qdev->release_idr_lock);
  93. idr_preload_end();
  94. if (handle < 0) {
  95. kfree(release);
  96. *ret = NULL;
  97. return handle;
  98. }
  99. *ret = release;
  100. DRM_DEBUG_DRIVER("allocated release %d\n", handle);
  101. release->id = handle;
  102. return handle;
  103. }
  104. static void
  105. qxl_release_free_list(struct qxl_release *release)
  106. {
  107. while (!list_empty(&release->bos)) {
  108. struct qxl_bo_list *entry;
  109. entry = container_of(release->bos.next,
  110. struct qxl_bo_list, list);
  111. qxl_bo_unref(&entry->bo);
  112. list_del(&entry->list);
  113. kfree(entry);
  114. }
  115. release->release_bo = NULL;
  116. }
  117. void
  118. qxl_release_free(struct qxl_device *qdev,
  119. struct qxl_release *release)
  120. {
  121. DRM_DEBUG_DRIVER("release %d, type %d\n", release->id, release->type);
  122. if (release->surface_release_id)
  123. qxl_surface_id_dealloc(qdev, release->surface_release_id);
  124. spin_lock(&qdev->release_idr_lock);
  125. idr_remove(&qdev->release_idr, release->id);
  126. spin_unlock(&qdev->release_idr_lock);
  127. if (release->base.ops) {
  128. WARN_ON(list_empty(&release->bos));
  129. qxl_release_free_list(release);
  130. dma_fence_signal(&release->base);
  131. dma_fence_put(&release->base);
  132. } else {
  133. qxl_release_free_list(release);
  134. kfree(release);
  135. }
  136. atomic_dec(&qdev->release_count);
  137. }
  138. static int qxl_release_bo_alloc(struct qxl_device *qdev,
  139. struct qxl_bo **bo,
  140. u32 priority)
  141. {
  142. /* pin releases bo's they are too messy to evict */
  143. return qxl_bo_create(qdev, PAGE_SIZE, false, true,
  144. QXL_GEM_DOMAIN_VRAM, priority, NULL, bo);
  145. }
  146. int qxl_release_list_add(struct qxl_release *release, struct qxl_bo *bo)
  147. {
  148. struct qxl_bo_list *entry;
  149. list_for_each_entry(entry, &release->bos, list) {
  150. if (entry->bo == bo)
  151. return 0;
  152. }
  153. entry = kmalloc_obj(struct qxl_bo_list);
  154. if (!entry)
  155. return -ENOMEM;
  156. qxl_bo_ref(bo);
  157. entry->bo = bo;
  158. list_add_tail(&entry->list, &release->bos);
  159. return 0;
  160. }
  161. static int qxl_release_validate_bo(struct qxl_bo *bo)
  162. {
  163. struct ttm_operation_ctx ctx = { true, false };
  164. int ret;
  165. if (!bo->tbo.pin_count) {
  166. qxl_ttm_placement_from_domain(bo, bo->type);
  167. ret = ttm_bo_validate(&bo->tbo, &bo->placement, &ctx);
  168. if (ret)
  169. return ret;
  170. }
  171. ret = dma_resv_reserve_fences(bo->tbo.base.resv, 1);
  172. if (ret)
  173. return ret;
  174. /* allocate a surface for reserved + validated buffers */
  175. ret = qxl_bo_check_id(to_qxl(bo->tbo.base.dev), bo);
  176. if (ret)
  177. return ret;
  178. return 0;
  179. }
  180. int qxl_release_reserve_list(struct qxl_release *release, bool no_intr)
  181. {
  182. int ret;
  183. struct qxl_bo_list *entry;
  184. /* if only one object on the release its the release itself
  185. since these objects are pinned no need to reserve */
  186. if (list_is_singular(&release->bos))
  187. return 0;
  188. drm_exec_init(&release->exec, no_intr ? 0 :
  189. DRM_EXEC_INTERRUPTIBLE_WAIT, 0);
  190. drm_exec_until_all_locked(&release->exec) {
  191. list_for_each_entry(entry, &release->bos, list) {
  192. ret = drm_exec_prepare_obj(&release->exec,
  193. &entry->bo->tbo.base,
  194. 1);
  195. drm_exec_retry_on_contention(&release->exec);
  196. if (ret)
  197. goto error;
  198. }
  199. }
  200. list_for_each_entry(entry, &release->bos, list) {
  201. ret = qxl_release_validate_bo(entry->bo);
  202. if (ret)
  203. goto error;
  204. }
  205. return 0;
  206. error:
  207. drm_exec_fini(&release->exec);
  208. return ret;
  209. }
  210. void qxl_release_backoff_reserve_list(struct qxl_release *release)
  211. {
  212. /* if only one object on the release its the release itself
  213. since these objects are pinned no need to reserve */
  214. if (list_is_singular(&release->bos))
  215. return;
  216. drm_exec_fini(&release->exec);
  217. }
  218. int qxl_alloc_surface_release_reserved(struct qxl_device *qdev,
  219. enum qxl_surface_cmd_type surface_cmd_type,
  220. struct qxl_release *create_rel,
  221. struct qxl_release **release)
  222. {
  223. if (surface_cmd_type == QXL_SURFACE_CMD_DESTROY && create_rel) {
  224. int idr_ret;
  225. struct qxl_bo *bo;
  226. union qxl_release_info *info;
  227. /* stash the release after the create command */
  228. idr_ret = qxl_release_alloc(qdev, QXL_RELEASE_SURFACE_CMD, release);
  229. if (idr_ret < 0)
  230. return idr_ret;
  231. bo = create_rel->release_bo;
  232. (*release)->release_bo = bo;
  233. (*release)->release_offset = create_rel->release_offset + 64;
  234. qxl_release_list_add(*release, bo);
  235. info = qxl_release_map(qdev, *release);
  236. info->id = idr_ret;
  237. qxl_release_unmap(qdev, *release, info);
  238. return 0;
  239. }
  240. return qxl_alloc_release_reserved(qdev, sizeof(struct qxl_surface_cmd),
  241. QXL_RELEASE_SURFACE_CMD, release, NULL);
  242. }
  243. int qxl_alloc_release_reserved(struct qxl_device *qdev, unsigned long size,
  244. int type, struct qxl_release **release,
  245. struct qxl_bo **rbo)
  246. {
  247. struct qxl_bo *bo, *free_bo = NULL;
  248. int idr_ret;
  249. int ret = 0;
  250. union qxl_release_info *info;
  251. int cur_idx;
  252. u32 priority;
  253. if (type == QXL_RELEASE_DRAWABLE) {
  254. cur_idx = 0;
  255. priority = 0;
  256. } else if (type == QXL_RELEASE_SURFACE_CMD) {
  257. cur_idx = 1;
  258. priority = 1;
  259. } else if (type == QXL_RELEASE_CURSOR_CMD) {
  260. cur_idx = 2;
  261. priority = 1;
  262. }
  263. else {
  264. DRM_ERROR("got illegal type: %d\n", type);
  265. return -EINVAL;
  266. }
  267. idr_ret = qxl_release_alloc(qdev, type, release);
  268. if (idr_ret < 0) {
  269. if (rbo)
  270. *rbo = NULL;
  271. return idr_ret;
  272. }
  273. atomic_inc(&qdev->release_count);
  274. mutex_lock(&qdev->release_mutex);
  275. if (qdev->current_release_bo_offset[cur_idx] + 1 >= releases_per_bo[cur_idx]) {
  276. free_bo = qdev->current_release_bo[cur_idx];
  277. qdev->current_release_bo_offset[cur_idx] = 0;
  278. qdev->current_release_bo[cur_idx] = NULL;
  279. }
  280. if (!qdev->current_release_bo[cur_idx]) {
  281. ret = qxl_release_bo_alloc(qdev, &qdev->current_release_bo[cur_idx], priority);
  282. if (ret) {
  283. mutex_unlock(&qdev->release_mutex);
  284. if (free_bo) {
  285. qxl_bo_unpin(free_bo);
  286. qxl_bo_unref(&free_bo);
  287. }
  288. qxl_release_free(qdev, *release);
  289. return ret;
  290. }
  291. }
  292. bo = qxl_bo_ref(qdev->current_release_bo[cur_idx]);
  293. (*release)->release_bo = bo;
  294. (*release)->release_offset = qdev->current_release_bo_offset[cur_idx] * release_size_per_bo[cur_idx];
  295. qdev->current_release_bo_offset[cur_idx]++;
  296. if (rbo)
  297. *rbo = bo;
  298. mutex_unlock(&qdev->release_mutex);
  299. if (free_bo) {
  300. qxl_bo_unpin(free_bo);
  301. qxl_bo_unref(&free_bo);
  302. }
  303. ret = qxl_release_list_add(*release, bo);
  304. qxl_bo_unref(&bo);
  305. if (ret) {
  306. qxl_release_free(qdev, *release);
  307. return ret;
  308. }
  309. info = qxl_release_map(qdev, *release);
  310. info->id = idr_ret;
  311. qxl_release_unmap(qdev, *release, info);
  312. return ret;
  313. }
  314. struct qxl_release *qxl_release_from_id_locked(struct qxl_device *qdev,
  315. uint64_t id)
  316. {
  317. struct qxl_release *release;
  318. spin_lock(&qdev->release_idr_lock);
  319. release = idr_find(&qdev->release_idr, id);
  320. spin_unlock(&qdev->release_idr_lock);
  321. if (!release) {
  322. DRM_ERROR("failed to find id in release_idr\n");
  323. return NULL;
  324. }
  325. return release;
  326. }
  327. union qxl_release_info *qxl_release_map(struct qxl_device *qdev,
  328. struct qxl_release *release)
  329. {
  330. void *ptr;
  331. union qxl_release_info *info;
  332. struct qxl_bo *bo = release->release_bo;
  333. ptr = qxl_bo_kmap_atomic_page(qdev, bo, release->release_offset & PAGE_MASK);
  334. if (!ptr)
  335. return NULL;
  336. info = ptr + (release->release_offset & ~PAGE_MASK);
  337. return info;
  338. }
  339. void qxl_release_unmap(struct qxl_device *qdev,
  340. struct qxl_release *release,
  341. union qxl_release_info *info)
  342. {
  343. struct qxl_bo *bo = release->release_bo;
  344. void *ptr;
  345. ptr = ((void *)info) - (release->release_offset & ~PAGE_MASK);
  346. qxl_bo_kunmap_atomic_page(qdev, bo, ptr);
  347. }
  348. void qxl_release_fence_buffer_objects(struct qxl_release *release)
  349. {
  350. struct ttm_device *bdev;
  351. struct qxl_bo_list *entry;
  352. struct qxl_device *qdev;
  353. struct qxl_bo *bo;
  354. /* if only one object on the release its the release itself
  355. since these objects are pinned no need to reserve */
  356. if (list_is_singular(&release->bos) || list_empty(&release->bos))
  357. return;
  358. bo = list_first_entry(&release->bos, struct qxl_bo_list, list)->bo;
  359. bdev = bo->tbo.bdev;
  360. qdev = container_of(bdev, struct qxl_device, mman.bdev);
  361. /*
  362. * Since we never really allocated a context and we don't want to conflict,
  363. * set the highest bits. This will break if we really allow exporting of dma-bufs.
  364. */
  365. dma_fence_init(&release->base, &qxl_fence_ops, &qdev->release_lock,
  366. release->id | 0xf0000000, release->base.seqno);
  367. trace_dma_fence_emit(&release->base);
  368. list_for_each_entry(entry, &release->bos, list) {
  369. bo = entry->bo;
  370. dma_resv_add_fence(bo->tbo.base.resv, &release->base,
  371. DMA_RESV_USAGE_READ);
  372. ttm_bo_move_to_lru_tail_unlocked(&bo->tbo);
  373. }
  374. drm_exec_fini(&release->exec);
  375. }