radeon_cs.c 9.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342
  1. /*
  2. * Copyright 2008 Jerome Glisse.
  3. * All Rights Reserved.
  4. *
  5. * Permission is hereby granted, free of charge, to any person obtaining a
  6. * copy of this software and associated documentation files (the "Software"),
  7. * to deal in the Software without restriction, including without limitation
  8. * the rights to use, copy, modify, merge, publish, distribute, sublicense,
  9. * and/or sell copies of the Software, and to permit persons to whom the
  10. * Software is furnished to do so, subject to the following conditions:
  11. *
  12. * The above copyright notice and this permission notice (including the next
  13. * paragraph) shall be included in all copies or substantial portions of the
  14. * Software.
  15. *
  16. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  17. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  18. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
  19. * PRECISION INSIGHT AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
  20. * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
  21. * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
  22. * DEALINGS IN THE SOFTWARE.
  23. *
  24. * Authors:
  25. * Jerome Glisse <glisse@freedesktop.org>
  26. */
  27. #include "drmP.h"
  28. #include "radeon_drm.h"
  29. #include "radeon_reg.h"
  30. #include "radeon.h"
  31. void r100_cs_dump_packet(struct radeon_cs_parser *p,
  32. struct radeon_cs_packet *pkt);
  33. int radeon_cs_parser_relocs(struct radeon_cs_parser *p)
  34. {
  35. struct drm_device *ddev = p->rdev->ddev;
  36. struct radeon_cs_chunk *chunk;
  37. unsigned i, j;
  38. bool duplicate;
  39. if (p->chunk_relocs_idx == -1) {
  40. return 0;
  41. }
  42. chunk = &p->chunks[p->chunk_relocs_idx];
  43. /* FIXME: we assume that each relocs use 4 dwords */
  44. p->nrelocs = chunk->length_dw / 4;
  45. p->relocs_ptr = kcalloc(p->nrelocs, sizeof(void *), GFP_KERNEL);
  46. if (p->relocs_ptr == NULL) {
  47. return -ENOMEM;
  48. }
  49. p->relocs = kcalloc(p->nrelocs, sizeof(struct radeon_cs_reloc), GFP_KERNEL);
  50. if (p->relocs == NULL) {
  51. return -ENOMEM;
  52. }
  53. for (i = 0; i < p->nrelocs; i++) {
  54. struct drm_radeon_cs_reloc *r;
  55. duplicate = false;
  56. r = (struct drm_radeon_cs_reloc *)&chunk->kdata[i*4];
  57. for (j = 0; j < p->nrelocs; j++) {
  58. if (r->handle == p->relocs[j].handle) {
  59. p->relocs_ptr[i] = &p->relocs[j];
  60. duplicate = true;
  61. break;
  62. }
  63. }
  64. if (!duplicate) {
  65. p->relocs[i].gobj = drm_gem_object_lookup(ddev,
  66. p->filp,
  67. r->handle);
  68. if (p->relocs[i].gobj == NULL) {
  69. DRM_ERROR("gem object lookup failed 0x%x\n",
  70. r->handle);
  71. return -ENOENT;
  72. }
  73. p->relocs_ptr[i] = &p->relocs[i];
  74. p->relocs[i].robj = gem_to_radeon_bo(p->relocs[i].gobj);
  75. p->relocs[i].lobj.bo = p->relocs[i].robj;
  76. p->relocs[i].lobj.wdomain = r->write_domain;
  77. p->relocs[i].lobj.rdomain = r->read_domains;
  78. p->relocs[i].lobj.tv.bo = &p->relocs[i].robj->tbo;
  79. p->relocs[i].lobj.tv.usage = TTM_USAGE_READWRITE;
  80. p->relocs[i].handle = r->handle;
  81. p->relocs[i].flags = r->flags;
  82. radeon_bo_list_add_object(&p->relocs[i].lobj,
  83. &p->validated);
  84. }
  85. }
  86. return radeon_bo_list_validate(&p->validated);
  87. }
  88. int radeon_cs_parser_init(struct radeon_cs_parser *p, void *data)
  89. {
  90. struct drm_radeon_cs *cs = data;
  91. uint64_t *chunk_array_ptr;
  92. unsigned size, i;
  93. if (!cs->num_chunks) {
  94. return 0;
  95. }
  96. /* get chunks */
  97. INIT_LIST_HEAD(&p->validated);
  98. p->idx = 0;
  99. p->chunk_ib_idx = -1;
  100. p->chunk_relocs_idx = -1;
  101. p->chunks_array = kcalloc(cs->num_chunks, sizeof(uint64_t), GFP_KERNEL);
  102. if (p->chunks_array == NULL) {
  103. return -ENOMEM;
  104. }
  105. chunk_array_ptr = (uint64_t *)(unsigned long)(cs->chunks);
  106. if (DRM_COPY_FROM_USER(p->chunks_array, chunk_array_ptr,
  107. sizeof(uint64_t)*cs->num_chunks)) {
  108. return -EFAULT;
  109. }
  110. p->nchunks = cs->num_chunks;
  111. p->chunks = kcalloc(p->nchunks, sizeof(struct radeon_cs_chunk), GFP_KERNEL);
  112. if (p->chunks == NULL) {
  113. return -ENOMEM;
  114. }
  115. for (i = 0; i < p->nchunks; i++) {
  116. struct drm_radeon_cs_chunk __user **chunk_ptr = NULL;
  117. struct drm_radeon_cs_chunk user_chunk;
  118. uint32_t __user *cdata;
  119. chunk_ptr = (void __user*)(unsigned long)p->chunks_array[i];
  120. if (DRM_COPY_FROM_USER(&user_chunk, chunk_ptr,
  121. sizeof(struct drm_radeon_cs_chunk))) {
  122. return -EFAULT;
  123. }
  124. p->chunks[i].length_dw = user_chunk.length_dw;
  125. p->chunks[i].kdata = NULL;
  126. p->chunks[i].chunk_id = user_chunk.chunk_id;
  127. if (p->chunks[i].chunk_id == RADEON_CHUNK_ID_RELOCS) {
  128. p->chunk_relocs_idx = i;
  129. }
  130. if (p->chunks[i].chunk_id == RADEON_CHUNK_ID_IB) {
  131. p->chunk_ib_idx = i;
  132. /* zero length IB isn't useful */
  133. if (p->chunks[i].length_dw == 0)
  134. return -EINVAL;
  135. }
  136. p->chunks[i].length_dw = user_chunk.length_dw;
  137. p->chunks[i].user_ptr = (void __user *)(unsigned long)user_chunk.chunk_data;
  138. cdata = (uint32_t *)(unsigned long)user_chunk.chunk_data;
  139. if (p->chunks[i].chunk_id != RADEON_CHUNK_ID_IB) {
  140. size = p->chunks[i].length_dw * sizeof(uint32_t);
  141. p->chunks[i].kdata = kmalloc(size, GFP_KERNEL);
  142. if (p->chunks[i].kdata == NULL) {
  143. return -ENOMEM;
  144. }
  145. if (DRM_COPY_FROM_USER(p->chunks[i].kdata,
  146. p->chunks[i].user_ptr, size)) {
  147. return -EFAULT;
  148. }
  149. } else {
  150. p->chunks[i].kpage[0] = kmalloc(PAGE_SIZE, GFP_KERNEL);
  151. p->chunks[i].kpage[1] = kmalloc(PAGE_SIZE, GFP_KERNEL);
  152. if (p->chunks[i].kpage[0] == NULL || p->chunks[i].kpage[1] == NULL) {
  153. kfree(p->chunks[i].kpage[0]);
  154. kfree(p->chunks[i].kpage[1]);
  155. return -ENOMEM;
  156. }
  157. p->chunks[i].kpage_idx[0] = -1;
  158. p->chunks[i].kpage_idx[1] = -1;
  159. p->chunks[i].last_copied_page = -1;
  160. p->chunks[i].last_page_index = ((p->chunks[i].length_dw * 4) - 1) / PAGE_SIZE;
  161. }
  162. }
  163. if (p->chunks[p->chunk_ib_idx].length_dw > (16 * 1024)) {
  164. DRM_ERROR("cs IB too big: %d\n",
  165. p->chunks[p->chunk_ib_idx].length_dw);
  166. return -EINVAL;
  167. }
  168. return 0;
  169. }
  170. /**
  171. * cs_parser_fini() - clean parser states
  172. * @parser: parser structure holding parsing context.
  173. * @error: error number
  174. *
  175. * If error is set than unvalidate buffer, otherwise just free memory
  176. * used by parsing context.
  177. **/
  178. static void radeon_cs_parser_fini(struct radeon_cs_parser *parser, int error)
  179. {
  180. unsigned i;
  181. if (!error && parser->ib)
  182. ttm_eu_fence_buffer_objects(&parser->validated,
  183. parser->ib->fence);
  184. else
  185. ttm_eu_backoff_reservation(&parser->validated);
  186. if (parser->relocs != NULL) {
  187. for (i = 0; i < parser->nrelocs; i++) {
  188. if (parser->relocs[i].gobj)
  189. drm_gem_object_unreference_unlocked(parser->relocs[i].gobj);
  190. }
  191. }
  192. kfree(parser->track);
  193. kfree(parser->relocs);
  194. kfree(parser->relocs_ptr);
  195. for (i = 0; i < parser->nchunks; i++) {
  196. kfree(parser->chunks[i].kdata);
  197. kfree(parser->chunks[i].kpage[0]);
  198. kfree(parser->chunks[i].kpage[1]);
  199. }
  200. kfree(parser->chunks);
  201. kfree(parser->chunks_array);
  202. radeon_ib_free(parser->rdev, &parser->ib);
  203. }
  204. int radeon_cs_ioctl(struct drm_device *dev, void *data, struct drm_file *filp)
  205. {
  206. struct radeon_device *rdev = dev->dev_private;
  207. struct radeon_cs_parser parser;
  208. struct radeon_cs_chunk *ib_chunk;
  209. int r;
  210. mutex_lock(&rdev->cs_mutex);
  211. /* initialize parser */
  212. memset(&parser, 0, sizeof(struct radeon_cs_parser));
  213. parser.filp = filp;
  214. parser.rdev = rdev;
  215. parser.dev = rdev->dev;
  216. parser.family = rdev->family;
  217. r = radeon_cs_parser_init(&parser, data);
  218. if (r) {
  219. DRM_ERROR("Failed to initialize parser !\n");
  220. radeon_cs_parser_fini(&parser, r);
  221. mutex_unlock(&rdev->cs_mutex);
  222. return r;
  223. }
  224. r = radeon_ib_get(rdev, &parser.ib);
  225. if (r) {
  226. DRM_ERROR("Failed to get ib !\n");
  227. radeon_cs_parser_fini(&parser, r);
  228. mutex_unlock(&rdev->cs_mutex);
  229. return r;
  230. }
  231. r = radeon_cs_parser_relocs(&parser);
  232. if (r) {
  233. if (r != -ERESTARTSYS)
  234. DRM_ERROR("Failed to parse relocation %d!\n", r);
  235. radeon_cs_parser_fini(&parser, r);
  236. mutex_unlock(&rdev->cs_mutex);
  237. return r;
  238. }
  239. /* Copy the packet into the IB, the parser will read from the
  240. * input memory (cached) and write to the IB (which can be
  241. * uncached). */
  242. ib_chunk = &parser.chunks[parser.chunk_ib_idx];
  243. parser.ib->length_dw = ib_chunk->length_dw;
  244. r = radeon_cs_parse(&parser);
  245. if (r || parser.parser_error) {
  246. DRM_ERROR("Invalid command stream !\n");
  247. radeon_cs_parser_fini(&parser, r);
  248. mutex_unlock(&rdev->cs_mutex);
  249. return r;
  250. }
  251. r = radeon_cs_finish_pages(&parser);
  252. if (r) {
  253. DRM_ERROR("Invalid command stream !\n");
  254. radeon_cs_parser_fini(&parser, r);
  255. mutex_unlock(&rdev->cs_mutex);
  256. return r;
  257. }
  258. r = radeon_ib_schedule(rdev, parser.ib);
  259. if (r) {
  260. DRM_ERROR("Failed to schedule IB !\n");
  261. }
  262. radeon_cs_parser_fini(&parser, r);
  263. mutex_unlock(&rdev->cs_mutex);
  264. return r;
  265. }
  266. int radeon_cs_finish_pages(struct radeon_cs_parser *p)
  267. {
  268. struct radeon_cs_chunk *ibc = &p->chunks[p->chunk_ib_idx];
  269. int i;
  270. int size = PAGE_SIZE;
  271. for (i = ibc->last_copied_page + 1; i <= ibc->last_page_index; i++) {
  272. if (i == ibc->last_page_index) {
  273. size = (ibc->length_dw * 4) % PAGE_SIZE;
  274. if (size == 0)
  275. size = PAGE_SIZE;
  276. }
  277. if (DRM_COPY_FROM_USER(p->ib->ptr + (i * (PAGE_SIZE/4)),
  278. ibc->user_ptr + (i * PAGE_SIZE),
  279. size))
  280. return -EFAULT;
  281. }
  282. return 0;
  283. }
  284. int radeon_cs_update_pages(struct radeon_cs_parser *p, int pg_idx)
  285. {
  286. int new_page;
  287. struct radeon_cs_chunk *ibc = &p->chunks[p->chunk_ib_idx];
  288. int i;
  289. int size = PAGE_SIZE;
  290. for (i = ibc->last_copied_page + 1; i < pg_idx; i++) {
  291. if (DRM_COPY_FROM_USER(p->ib->ptr + (i * (PAGE_SIZE/4)),
  292. ibc->user_ptr + (i * PAGE_SIZE),
  293. PAGE_SIZE)) {
  294. p->parser_error = -EFAULT;
  295. return 0;
  296. }
  297. }
  298. new_page = ibc->kpage_idx[0] < ibc->kpage_idx[1] ? 0 : 1;
  299. if (pg_idx == ibc->last_page_index) {
  300. size = (ibc->length_dw * 4) % PAGE_SIZE;
  301. if (size == 0)
  302. size = PAGE_SIZE;
  303. }
  304. if (DRM_COPY_FROM_USER(ibc->kpage[new_page],
  305. ibc->user_ptr + (pg_idx * PAGE_SIZE),
  306. size)) {
  307. p->parser_error = -EFAULT;
  308. return 0;
  309. }
  310. /* copy to IB here */
  311. memcpy((void *)(p->ib->ptr+(pg_idx*(PAGE_SIZE/4))), ibc->kpage[new_page], size);
  312. ibc->last_copied_page = pg_idx;
  313. ibc->kpage_idx[new_page] = pg_idx;
  314. return new_page;
  315. }