qxl_release.c 8.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307
  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. /*
  25. * drawable cmd cache - allocate a bunch of VRAM pages, suballocate
  26. * into 256 byte chunks for now - gives 16 cmds per page.
  27. *
  28. * use an ida to index into the chunks?
  29. */
  30. /* manage releaseables */
  31. /* stack them 16 high for now -drawable object is 191 */
  32. #define RELEASE_SIZE 256
  33. #define RELEASES_PER_BO (4096 / RELEASE_SIZE)
  34. /* put an alloc/dealloc surface cmd into one bo and round up to 128 */
  35. #define SURFACE_RELEASE_SIZE 128
  36. #define SURFACE_RELEASES_PER_BO (4096 / SURFACE_RELEASE_SIZE)
  37. static const int release_size_per_bo[] = { RELEASE_SIZE, SURFACE_RELEASE_SIZE, RELEASE_SIZE };
  38. static const int releases_per_bo[] = { RELEASES_PER_BO, SURFACE_RELEASES_PER_BO, RELEASES_PER_BO };
  39. uint64_t
  40. qxl_release_alloc(struct qxl_device *qdev, int type,
  41. struct qxl_release **ret)
  42. {
  43. struct qxl_release *release;
  44. int handle = 0;
  45. size_t size = sizeof(*release);
  46. int idr_ret;
  47. release = kmalloc(size, GFP_KERNEL);
  48. if (!release) {
  49. DRM_ERROR("Out of memory\n");
  50. return 0;
  51. }
  52. release->type = type;
  53. release->bo_count = 0;
  54. release->release_offset = 0;
  55. release->surface_release_id = 0;
  56. again:
  57. if (idr_pre_get(&qdev->release_idr, GFP_KERNEL) == 0) {
  58. DRM_ERROR("Out of memory for release idr\n");
  59. kfree(release);
  60. goto release_fail;
  61. }
  62. spin_lock(&qdev->release_idr_lock);
  63. idr_ret = idr_get_new_above(&qdev->release_idr, release, 1, &handle);
  64. spin_unlock(&qdev->release_idr_lock);
  65. if (idr_ret == -EAGAIN)
  66. goto again;
  67. if (ret)
  68. *ret = release;
  69. QXL_INFO(qdev, "allocated release %lld\n", handle);
  70. release->id = handle;
  71. release_fail:
  72. return handle;
  73. }
  74. void
  75. qxl_release_free(struct qxl_device *qdev,
  76. struct qxl_release *release)
  77. {
  78. int i;
  79. QXL_INFO(qdev, "release %d, type %d, %d bos\n", release->id,
  80. release->type, release->bo_count);
  81. if (release->surface_release_id)
  82. qxl_surface_id_dealloc(qdev, release->surface_release_id);
  83. for (i = 0 ; i < release->bo_count; ++i) {
  84. QXL_INFO(qdev, "release %llx\n",
  85. release->bos[i]->tbo.addr_space_offset
  86. - DRM_FILE_OFFSET);
  87. qxl_fence_remove_release(&release->bos[i]->fence, release->id);
  88. qxl_bo_unref(&release->bos[i]);
  89. }
  90. spin_lock(&qdev->release_idr_lock);
  91. idr_remove(&qdev->release_idr, release->id);
  92. spin_unlock(&qdev->release_idr_lock);
  93. kfree(release);
  94. }
  95. void
  96. qxl_release_add_res(struct qxl_device *qdev, struct qxl_release *release,
  97. struct qxl_bo *bo)
  98. {
  99. int i;
  100. for (i = 0; i < release->bo_count; i++)
  101. if (release->bos[i] == bo)
  102. return;
  103. if (release->bo_count >= QXL_MAX_RES) {
  104. DRM_ERROR("exceeded max resource on a qxl_release item\n");
  105. return;
  106. }
  107. release->bos[release->bo_count++] = qxl_bo_ref(bo);
  108. }
  109. int qxl_release_bo_alloc(struct qxl_device *qdev,
  110. struct qxl_bo **bo)
  111. {
  112. int ret;
  113. ret = qxl_bo_create(qdev, PAGE_SIZE, false, QXL_GEM_DOMAIN_VRAM, NULL,
  114. bo);
  115. return ret;
  116. }
  117. int qxl_release_reserve(struct qxl_device *qdev,
  118. struct qxl_release *release, bool no_wait)
  119. {
  120. int ret;
  121. if (atomic_inc_return(&release->bos[0]->reserve_count) == 1) {
  122. ret = qxl_bo_reserve(release->bos[0], no_wait);
  123. if (ret)
  124. return ret;
  125. }
  126. return 0;
  127. }
  128. void qxl_release_unreserve(struct qxl_device *qdev,
  129. struct qxl_release *release)
  130. {
  131. if (atomic_dec_and_test(&release->bos[0]->reserve_count))
  132. qxl_bo_unreserve(release->bos[0]);
  133. }
  134. int qxl_alloc_surface_release_reserved(struct qxl_device *qdev,
  135. enum qxl_surface_cmd_type surface_cmd_type,
  136. struct qxl_release *create_rel,
  137. struct qxl_release **release)
  138. {
  139. int ret;
  140. if (surface_cmd_type == QXL_SURFACE_CMD_DESTROY && create_rel) {
  141. int idr_ret;
  142. struct qxl_bo *bo;
  143. union qxl_release_info *info;
  144. /* stash the release after the create command */
  145. idr_ret = qxl_release_alloc(qdev, QXL_RELEASE_SURFACE_CMD, release);
  146. bo = qxl_bo_ref(create_rel->bos[0]);
  147. (*release)->release_offset = create_rel->release_offset + 64;
  148. qxl_release_add_res(qdev, *release, bo);
  149. ret = qxl_release_reserve(qdev, *release, false);
  150. if (ret) {
  151. DRM_ERROR("release reserve failed\n");
  152. goto out_unref;
  153. }
  154. info = qxl_release_map(qdev, *release);
  155. info->id = idr_ret;
  156. qxl_release_unmap(qdev, *release, info);
  157. out_unref:
  158. qxl_bo_unref(&bo);
  159. return ret;
  160. }
  161. return qxl_alloc_release_reserved(qdev, sizeof(struct qxl_surface_cmd),
  162. QXL_RELEASE_SURFACE_CMD, release, NULL);
  163. }
  164. int qxl_alloc_release_reserved(struct qxl_device *qdev, unsigned long size,
  165. int type, struct qxl_release **release,
  166. struct qxl_bo **rbo)
  167. {
  168. struct qxl_bo *bo;
  169. int idr_ret;
  170. int ret;
  171. union qxl_release_info *info;
  172. int cur_idx;
  173. if (type == QXL_RELEASE_DRAWABLE)
  174. cur_idx = 0;
  175. else if (type == QXL_RELEASE_SURFACE_CMD)
  176. cur_idx = 1;
  177. else if (type == QXL_RELEASE_CURSOR_CMD)
  178. cur_idx = 2;
  179. else {
  180. DRM_ERROR("got illegal type: %d\n", type);
  181. return -EINVAL;
  182. }
  183. idr_ret = qxl_release_alloc(qdev, type, release);
  184. mutex_lock(&qdev->release_mutex);
  185. if (qdev->current_release_bo_offset[cur_idx] + 1 >= releases_per_bo[cur_idx]) {
  186. qxl_bo_unref(&qdev->current_release_bo[cur_idx]);
  187. qdev->current_release_bo_offset[cur_idx] = 0;
  188. qdev->current_release_bo[cur_idx] = NULL;
  189. }
  190. if (!qdev->current_release_bo[cur_idx]) {
  191. ret = qxl_release_bo_alloc(qdev, &qdev->current_release_bo[cur_idx]);
  192. if (ret) {
  193. mutex_unlock(&qdev->release_mutex);
  194. return ret;
  195. }
  196. /* pin releases bo's they are too messy to evict */
  197. ret = qxl_bo_reserve(qdev->current_release_bo[cur_idx], false);
  198. qxl_bo_pin(qdev->current_release_bo[cur_idx], QXL_GEM_DOMAIN_VRAM, NULL);
  199. qxl_bo_unreserve(qdev->current_release_bo[cur_idx]);
  200. }
  201. bo = qxl_bo_ref(qdev->current_release_bo[cur_idx]);
  202. (*release)->release_offset = qdev->current_release_bo_offset[cur_idx] * release_size_per_bo[cur_idx];
  203. qdev->current_release_bo_offset[cur_idx]++;
  204. if (rbo)
  205. *rbo = bo;
  206. qxl_release_add_res(qdev, *release, bo);
  207. ret = qxl_release_reserve(qdev, *release, false);
  208. mutex_unlock(&qdev->release_mutex);
  209. if (ret)
  210. goto out_unref;
  211. info = qxl_release_map(qdev, *release);
  212. info->id = idr_ret;
  213. qxl_release_unmap(qdev, *release, info);
  214. out_unref:
  215. qxl_bo_unref(&bo);
  216. return ret;
  217. }
  218. int qxl_fence_releaseable(struct qxl_device *qdev,
  219. struct qxl_release *release)
  220. {
  221. int i, ret;
  222. for (i = 0; i < release->bo_count; i++) {
  223. if (!release->bos[i]->tbo.sync_obj)
  224. release->bos[i]->tbo.sync_obj = &release->bos[i]->fence;
  225. ret = qxl_fence_add_release(&release->bos[i]->fence, release->id);
  226. if (ret)
  227. return ret;
  228. }
  229. return 0;
  230. }
  231. struct qxl_release *qxl_release_from_id_locked(struct qxl_device *qdev,
  232. uint64_t id)
  233. {
  234. struct qxl_release *release;
  235. spin_lock(&qdev->release_idr_lock);
  236. release = idr_find(&qdev->release_idr, id);
  237. spin_unlock(&qdev->release_idr_lock);
  238. if (!release) {
  239. DRM_ERROR("failed to find id in release_idr\n");
  240. return NULL;
  241. }
  242. if (release->bo_count < 1) {
  243. DRM_ERROR("read a released resource with 0 bos\n");
  244. return NULL;
  245. }
  246. return release;
  247. }
  248. union qxl_release_info *qxl_release_map(struct qxl_device *qdev,
  249. struct qxl_release *release)
  250. {
  251. void *ptr;
  252. union qxl_release_info *info;
  253. struct qxl_bo *bo = release->bos[0];
  254. ptr = qxl_bo_kmap_atomic_page(qdev, bo, release->release_offset & PAGE_SIZE);
  255. info = ptr + (release->release_offset & ~PAGE_SIZE);
  256. return info;
  257. }
  258. void qxl_release_unmap(struct qxl_device *qdev,
  259. struct qxl_release *release,
  260. union qxl_release_info *info)
  261. {
  262. struct qxl_bo *bo = release->bos[0];
  263. void *ptr;
  264. ptr = ((void *)info) - (release->release_offset & ~PAGE_SIZE);
  265. qxl_bo_kunmap_atomic_page(qdev, bo, ptr);
  266. }