radeon_cs.c 9.7 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].handle = r->handle;
  80. p->relocs[i].flags = r->flags;
  81. radeon_bo_list_add_object(&p->relocs[i].lobj,
  82. &p->validated);
  83. }
  84. }
  85. return radeon_bo_list_validate(&p->validated);
  86. }
  87. int radeon_cs_parser_init(struct radeon_cs_parser *p, void *data)
  88. {
  89. struct drm_radeon_cs *cs = data;
  90. uint64_t *chunk_array_ptr;
  91. unsigned size, i;
  92. if (!cs->num_chunks) {
  93. return 0;
  94. }
  95. /* get chunks */
  96. INIT_LIST_HEAD(&p->validated);
  97. p->idx = 0;
  98. p->chunk_ib_idx = -1;
  99. p->chunk_relocs_idx = -1;
  100. p->chunks_array = kcalloc(cs->num_chunks, sizeof(uint64_t), GFP_KERNEL);
  101. if (p->chunks_array == NULL) {
  102. return -ENOMEM;
  103. }
  104. chunk_array_ptr = (uint64_t *)(unsigned long)(cs->chunks);
  105. if (DRM_COPY_FROM_USER(p->chunks_array, chunk_array_ptr,
  106. sizeof(uint64_t)*cs->num_chunks)) {
  107. return -EFAULT;
  108. }
  109. p->nchunks = cs->num_chunks;
  110. p->chunks = kcalloc(p->nchunks, sizeof(struct radeon_cs_chunk), GFP_KERNEL);
  111. if (p->chunks == NULL) {
  112. return -ENOMEM;
  113. }
  114. for (i = 0; i < p->nchunks; i++) {
  115. struct drm_radeon_cs_chunk __user **chunk_ptr = NULL;
  116. struct drm_radeon_cs_chunk user_chunk;
  117. uint32_t __user *cdata;
  118. chunk_ptr = (void __user*)(unsigned long)p->chunks_array[i];
  119. if (DRM_COPY_FROM_USER(&user_chunk, chunk_ptr,
  120. sizeof(struct drm_radeon_cs_chunk))) {
  121. return -EFAULT;
  122. }
  123. p->chunks[i].length_dw = user_chunk.length_dw;
  124. p->chunks[i].kdata = NULL;
  125. p->chunks[i].chunk_id = user_chunk.chunk_id;
  126. if (p->chunks[i].chunk_id == RADEON_CHUNK_ID_RELOCS) {
  127. p->chunk_relocs_idx = i;
  128. }
  129. if (p->chunks[i].chunk_id == RADEON_CHUNK_ID_IB) {
  130. p->chunk_ib_idx = i;
  131. /* zero length IB isn't useful */
  132. if (p->chunks[i].length_dw == 0)
  133. return -EINVAL;
  134. }
  135. p->chunks[i].length_dw = user_chunk.length_dw;
  136. p->chunks[i].user_ptr = (void __user *)(unsigned long)user_chunk.chunk_data;
  137. cdata = (uint32_t *)(unsigned long)user_chunk.chunk_data;
  138. if (p->chunks[i].chunk_id != RADEON_CHUNK_ID_IB) {
  139. size = p->chunks[i].length_dw * sizeof(uint32_t);
  140. p->chunks[i].kdata = kmalloc(size, GFP_KERNEL);
  141. if (p->chunks[i].kdata == NULL) {
  142. return -ENOMEM;
  143. }
  144. if (DRM_COPY_FROM_USER(p->chunks[i].kdata,
  145. p->chunks[i].user_ptr, size)) {
  146. return -EFAULT;
  147. }
  148. } else {
  149. p->chunks[i].kpage[0] = kmalloc(PAGE_SIZE, GFP_KERNEL);
  150. p->chunks[i].kpage[1] = kmalloc(PAGE_SIZE, GFP_KERNEL);
  151. if (p->chunks[i].kpage[0] == NULL || p->chunks[i].kpage[1] == NULL) {
  152. kfree(p->chunks[i].kpage[0]);
  153. kfree(p->chunks[i].kpage[1]);
  154. return -ENOMEM;
  155. }
  156. p->chunks[i].kpage_idx[0] = -1;
  157. p->chunks[i].kpage_idx[1] = -1;
  158. p->chunks[i].last_copied_page = -1;
  159. p->chunks[i].last_page_index = ((p->chunks[i].length_dw * 4) - 1) / PAGE_SIZE;
  160. }
  161. }
  162. if (p->chunks[p->chunk_ib_idx].length_dw > (16 * 1024)) {
  163. DRM_ERROR("cs IB too big: %d\n",
  164. p->chunks[p->chunk_ib_idx].length_dw);
  165. return -EINVAL;
  166. }
  167. return 0;
  168. }
  169. /**
  170. * cs_parser_fini() - clean parser states
  171. * @parser: parser structure holding parsing context.
  172. * @error: error number
  173. *
  174. * If error is set than unvalidate buffer, otherwise just free memory
  175. * used by parsing context.
  176. **/
  177. static void radeon_cs_parser_fini(struct radeon_cs_parser *parser, int error)
  178. {
  179. unsigned i;
  180. if (!error && parser->ib)
  181. ttm_eu_fence_buffer_objects(&parser->validated,
  182. parser->ib->fence);
  183. else
  184. ttm_eu_backoff_reservation(&parser->validated);
  185. if (parser->relocs != NULL) {
  186. for (i = 0; i < parser->nrelocs; i++) {
  187. if (parser->relocs[i].gobj)
  188. drm_gem_object_unreference_unlocked(parser->relocs[i].gobj);
  189. }
  190. }
  191. kfree(parser->track);
  192. kfree(parser->relocs);
  193. kfree(parser->relocs_ptr);
  194. for (i = 0; i < parser->nchunks; i++) {
  195. kfree(parser->chunks[i].kdata);
  196. kfree(parser->chunks[i].kpage[0]);
  197. kfree(parser->chunks[i].kpage[1]);
  198. }
  199. kfree(parser->chunks);
  200. kfree(parser->chunks_array);
  201. radeon_ib_free(parser->rdev, &parser->ib);
  202. }
  203. int radeon_cs_ioctl(struct drm_device *dev, void *data, struct drm_file *filp)
  204. {
  205. struct radeon_device *rdev = dev->dev_private;
  206. struct radeon_cs_parser parser;
  207. struct radeon_cs_chunk *ib_chunk;
  208. int r;
  209. mutex_lock(&rdev->cs_mutex);
  210. /* initialize parser */
  211. memset(&parser, 0, sizeof(struct radeon_cs_parser));
  212. parser.filp = filp;
  213. parser.rdev = rdev;
  214. parser.dev = rdev->dev;
  215. parser.family = rdev->family;
  216. r = radeon_cs_parser_init(&parser, data);
  217. if (r) {
  218. DRM_ERROR("Failed to initialize parser !\n");
  219. radeon_cs_parser_fini(&parser, r);
  220. mutex_unlock(&rdev->cs_mutex);
  221. return r;
  222. }
  223. r = radeon_ib_get(rdev, &parser.ib);
  224. if (r) {
  225. DRM_ERROR("Failed to get ib !\n");
  226. radeon_cs_parser_fini(&parser, r);
  227. mutex_unlock(&rdev->cs_mutex);
  228. return r;
  229. }
  230. r = radeon_cs_parser_relocs(&parser);
  231. if (r) {
  232. if (r != -ERESTARTSYS)
  233. DRM_ERROR("Failed to parse relocation %d!\n", r);
  234. radeon_cs_parser_fini(&parser, r);
  235. mutex_unlock(&rdev->cs_mutex);
  236. return r;
  237. }
  238. /* Copy the packet into the IB, the parser will read from the
  239. * input memory (cached) and write to the IB (which can be
  240. * uncached). */
  241. ib_chunk = &parser.chunks[parser.chunk_ib_idx];
  242. parser.ib->length_dw = ib_chunk->length_dw;
  243. r = radeon_cs_parse(&parser);
  244. if (r || parser.parser_error) {
  245. DRM_ERROR("Invalid command stream !\n");
  246. radeon_cs_parser_fini(&parser, r);
  247. mutex_unlock(&rdev->cs_mutex);
  248. return r;
  249. }
  250. r = radeon_cs_finish_pages(&parser);
  251. if (r) {
  252. DRM_ERROR("Invalid command stream !\n");
  253. radeon_cs_parser_fini(&parser, r);
  254. mutex_unlock(&rdev->cs_mutex);
  255. return r;
  256. }
  257. r = radeon_ib_schedule(rdev, parser.ib);
  258. if (r) {
  259. DRM_ERROR("Failed to schedule IB !\n");
  260. }
  261. radeon_cs_parser_fini(&parser, r);
  262. mutex_unlock(&rdev->cs_mutex);
  263. return r;
  264. }
  265. int radeon_cs_finish_pages(struct radeon_cs_parser *p)
  266. {
  267. struct radeon_cs_chunk *ibc = &p->chunks[p->chunk_ib_idx];
  268. int i;
  269. int size = PAGE_SIZE;
  270. for (i = ibc->last_copied_page + 1; i <= ibc->last_page_index; i++) {
  271. if (i == ibc->last_page_index) {
  272. size = (ibc->length_dw * 4) % PAGE_SIZE;
  273. if (size == 0)
  274. size = PAGE_SIZE;
  275. }
  276. if (DRM_COPY_FROM_USER(p->ib->ptr + (i * (PAGE_SIZE/4)),
  277. ibc->user_ptr + (i * PAGE_SIZE),
  278. size))
  279. return -EFAULT;
  280. }
  281. return 0;
  282. }
  283. int radeon_cs_update_pages(struct radeon_cs_parser *p, int pg_idx)
  284. {
  285. int new_page;
  286. struct radeon_cs_chunk *ibc = &p->chunks[p->chunk_ib_idx];
  287. int i;
  288. int size = PAGE_SIZE;
  289. for (i = ibc->last_copied_page + 1; i < pg_idx; i++) {
  290. if (DRM_COPY_FROM_USER(p->ib->ptr + (i * (PAGE_SIZE/4)),
  291. ibc->user_ptr + (i * PAGE_SIZE),
  292. PAGE_SIZE)) {
  293. p->parser_error = -EFAULT;
  294. return 0;
  295. }
  296. }
  297. new_page = ibc->kpage_idx[0] < ibc->kpage_idx[1] ? 0 : 1;
  298. if (pg_idx == ibc->last_page_index) {
  299. size = (ibc->length_dw * 4) % PAGE_SIZE;
  300. if (size == 0)
  301. size = PAGE_SIZE;
  302. }
  303. if (DRM_COPY_FROM_USER(ibc->kpage[new_page],
  304. ibc->user_ptr + (pg_idx * PAGE_SIZE),
  305. size)) {
  306. p->parser_error = -EFAULT;
  307. return 0;
  308. }
  309. /* copy to IB here */
  310. memcpy((void *)(p->ib->ptr+(pg_idx*(PAGE_SIZE/4))), ibc->kpage[new_page], size);
  311. ibc->last_copied_page = pg_idx;
  312. ibc->kpage_idx[new_page] = pg_idx;
  313. return new_page;
  314. }