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