nouveau_dma.c 8.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343
  1. /*
  2. * Copyright (C) 2007 Ben Skeggs.
  3. * All Rights Reserved.
  4. *
  5. * Permission is hereby granted, free of charge, to any person obtaining
  6. * a copy of this software and associated documentation files (the
  7. * "Software"), to deal in the Software without restriction, including
  8. * without limitation the rights to use, copy, modify, merge, publish,
  9. * distribute, sublicense, and/or sell copies of the Software, and to
  10. * permit persons to whom the Software is furnished to do so, subject to
  11. * the following conditions:
  12. *
  13. * The above copyright notice and this permission notice (including the
  14. * next paragraph) shall be included in all copies or substantial
  15. * portions of the Software.
  16. *
  17. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  18. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  19. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
  20. * IN NO EVENT SHALL THE COPYRIGHT OWNER(S) AND/OR ITS SUPPLIERS BE
  21. * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
  22. * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
  23. * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
  24. *
  25. */
  26. #include "drmP.h"
  27. #include "drm.h"
  28. #include "nouveau_drv.h"
  29. #include "nouveau_dma.h"
  30. #include "nouveau_ramht.h"
  31. void
  32. nouveau_dma_pre_init(struct nouveau_channel *chan)
  33. {
  34. struct drm_nouveau_private *dev_priv = chan->dev->dev_private;
  35. struct nouveau_bo *pushbuf = chan->pushbuf_bo;
  36. if (dev_priv->card_type >= NV_50) {
  37. const int ib_size = pushbuf->bo.mem.size / 2;
  38. chan->dma.ib_base = (pushbuf->bo.mem.size - ib_size) >> 2;
  39. chan->dma.ib_max = (ib_size / 8) - 1;
  40. chan->dma.ib_put = 0;
  41. chan->dma.ib_free = chan->dma.ib_max - chan->dma.ib_put;
  42. chan->dma.max = (pushbuf->bo.mem.size - ib_size) >> 2;
  43. } else {
  44. chan->dma.max = (pushbuf->bo.mem.size >> 2) - 2;
  45. }
  46. chan->dma.put = 0;
  47. chan->dma.cur = chan->dma.put;
  48. chan->dma.free = chan->dma.max - chan->dma.cur;
  49. }
  50. int
  51. nouveau_dma_init(struct nouveau_channel *chan)
  52. {
  53. struct drm_device *dev = chan->dev;
  54. struct drm_nouveau_private *dev_priv = dev->dev_private;
  55. int ret, i;
  56. if (dev_priv->card_type >= NV_C0) {
  57. ret = nouveau_gpuobj_gr_new(chan, 0x9039, 0x9039);
  58. if (ret)
  59. return ret;
  60. ret = RING_SPACE(chan, 2);
  61. if (ret)
  62. return ret;
  63. BEGIN_NVC0(chan, 2, NvSubM2MF, 0x0000, 1);
  64. OUT_RING (chan, 0x00009039);
  65. FIRE_RING (chan);
  66. return 0;
  67. }
  68. /* Create NV_MEMORY_TO_MEMORY_FORMAT for buffer moves */
  69. ret = nouveau_gpuobj_gr_new(chan, NvM2MF, dev_priv->card_type < NV_50 ?
  70. 0x0039 : 0x5039);
  71. if (ret)
  72. return ret;
  73. /* NV_MEMORY_TO_MEMORY_FORMAT requires a notifier object */
  74. ret = nouveau_notifier_alloc(chan, NvNotify0, 32, 0xfe0, 0x1000,
  75. &chan->m2mf_ntfy);
  76. if (ret)
  77. return ret;
  78. /* Insert NOPS for NOUVEAU_DMA_SKIPS */
  79. ret = RING_SPACE(chan, NOUVEAU_DMA_SKIPS);
  80. if (ret)
  81. return ret;
  82. for (i = 0; i < NOUVEAU_DMA_SKIPS; i++)
  83. OUT_RING(chan, 0);
  84. /* Initialise NV_MEMORY_TO_MEMORY_FORMAT */
  85. ret = RING_SPACE(chan, 6);
  86. if (ret)
  87. return ret;
  88. BEGIN_RING(chan, NvSubM2MF, NV_MEMORY_TO_MEMORY_FORMAT_NAME, 1);
  89. OUT_RING (chan, NvM2MF);
  90. BEGIN_RING(chan, NvSubM2MF, NV_MEMORY_TO_MEMORY_FORMAT_DMA_NOTIFY, 3);
  91. OUT_RING (chan, NvNotify0);
  92. OUT_RING (chan, chan->vram_handle);
  93. OUT_RING (chan, chan->gart_handle);
  94. /* Sit back and pray the channel works.. */
  95. FIRE_RING(chan);
  96. return 0;
  97. }
  98. void
  99. OUT_RINGp(struct nouveau_channel *chan, const void *data, unsigned nr_dwords)
  100. {
  101. bool is_iomem;
  102. u32 *mem = ttm_kmap_obj_virtual(&chan->pushbuf_bo->kmap, &is_iomem);
  103. mem = &mem[chan->dma.cur];
  104. if (is_iomem)
  105. memcpy_toio((void __force __iomem *)mem, data, nr_dwords * 4);
  106. else
  107. memcpy(mem, data, nr_dwords * 4);
  108. chan->dma.cur += nr_dwords;
  109. }
  110. /* Fetch and adjust GPU GET pointer
  111. *
  112. * Returns:
  113. * value >= 0, the adjusted GET pointer
  114. * -EINVAL if GET pointer currently outside main push buffer
  115. * -EBUSY if timeout exceeded
  116. */
  117. static inline int
  118. READ_GET(struct nouveau_channel *chan, uint32_t *prev_get, uint32_t *timeout)
  119. {
  120. uint32_t val;
  121. val = nvchan_rd32(chan, chan->user_get);
  122. /* reset counter as long as GET is still advancing, this is
  123. * to avoid misdetecting a GPU lockup if the GPU happens to
  124. * just be processing an operation that takes a long time
  125. */
  126. if (val != *prev_get) {
  127. *prev_get = val;
  128. *timeout = 0;
  129. }
  130. if ((++*timeout & 0xff) == 0) {
  131. DRM_UDELAY(1);
  132. if (*timeout > 100000)
  133. return -EBUSY;
  134. }
  135. if (val < chan->pushbuf_base ||
  136. val > chan->pushbuf_base + (chan->dma.max << 2))
  137. return -EINVAL;
  138. return (val - chan->pushbuf_base) >> 2;
  139. }
  140. void
  141. nv50_dma_push(struct nouveau_channel *chan, struct nouveau_bo *bo,
  142. int delta, int length)
  143. {
  144. struct nouveau_bo *pb = chan->pushbuf_bo;
  145. struct nouveau_vma *vma;
  146. int ip = (chan->dma.ib_put * 2) + chan->dma.ib_base;
  147. u64 offset;
  148. vma = nouveau_bo_vma_find(bo, chan->vm);
  149. BUG_ON(!vma);
  150. offset = vma->offset + delta;
  151. BUG_ON(chan->dma.ib_free < 1);
  152. nouveau_bo_wr32(pb, ip++, lower_32_bits(offset));
  153. nouveau_bo_wr32(pb, ip++, upper_32_bits(offset) | length << 8);
  154. chan->dma.ib_put = (chan->dma.ib_put + 1) & chan->dma.ib_max;
  155. DRM_MEMORYBARRIER();
  156. /* Flush writes. */
  157. nouveau_bo_rd32(pb, 0);
  158. nvchan_wr32(chan, 0x8c, chan->dma.ib_put);
  159. chan->dma.ib_free--;
  160. }
  161. static int
  162. nv50_dma_push_wait(struct nouveau_channel *chan, int count)
  163. {
  164. uint32_t cnt = 0, prev_get = 0;
  165. while (chan->dma.ib_free < count) {
  166. uint32_t get = nvchan_rd32(chan, 0x88);
  167. if (get != prev_get) {
  168. prev_get = get;
  169. cnt = 0;
  170. }
  171. if ((++cnt & 0xff) == 0) {
  172. DRM_UDELAY(1);
  173. if (cnt > 100000)
  174. return -EBUSY;
  175. }
  176. chan->dma.ib_free = get - chan->dma.ib_put;
  177. if (chan->dma.ib_free <= 0)
  178. chan->dma.ib_free += chan->dma.ib_max;
  179. }
  180. return 0;
  181. }
  182. static int
  183. nv50_dma_wait(struct nouveau_channel *chan, int slots, int count)
  184. {
  185. uint32_t cnt = 0, prev_get = 0;
  186. int ret;
  187. ret = nv50_dma_push_wait(chan, slots + 1);
  188. if (unlikely(ret))
  189. return ret;
  190. while (chan->dma.free < count) {
  191. int get = READ_GET(chan, &prev_get, &cnt);
  192. if (unlikely(get < 0)) {
  193. if (get == -EINVAL)
  194. continue;
  195. return get;
  196. }
  197. if (get <= chan->dma.cur) {
  198. chan->dma.free = chan->dma.max - chan->dma.cur;
  199. if (chan->dma.free >= count)
  200. break;
  201. FIRE_RING(chan);
  202. do {
  203. get = READ_GET(chan, &prev_get, &cnt);
  204. if (unlikely(get < 0)) {
  205. if (get == -EINVAL)
  206. continue;
  207. return get;
  208. }
  209. } while (get == 0);
  210. chan->dma.cur = 0;
  211. chan->dma.put = 0;
  212. }
  213. chan->dma.free = get - chan->dma.cur - 1;
  214. }
  215. return 0;
  216. }
  217. int
  218. nouveau_dma_wait(struct nouveau_channel *chan, int slots, int size)
  219. {
  220. uint32_t prev_get = 0, cnt = 0;
  221. int get;
  222. if (chan->dma.ib_max)
  223. return nv50_dma_wait(chan, slots, size);
  224. while (chan->dma.free < size) {
  225. get = READ_GET(chan, &prev_get, &cnt);
  226. if (unlikely(get == -EBUSY))
  227. return -EBUSY;
  228. /* loop until we have a usable GET pointer. the value
  229. * we read from the GPU may be outside the main ring if
  230. * PFIFO is processing a buffer called from the main ring,
  231. * discard these values until something sensible is seen.
  232. *
  233. * the other case we discard GET is while the GPU is fetching
  234. * from the SKIPS area, so the code below doesn't have to deal
  235. * with some fun corner cases.
  236. */
  237. if (unlikely(get == -EINVAL) || get < NOUVEAU_DMA_SKIPS)
  238. continue;
  239. if (get <= chan->dma.cur) {
  240. /* engine is fetching behind us, or is completely
  241. * idle (GET == PUT) so we have free space up until
  242. * the end of the push buffer
  243. *
  244. * we can only hit that path once per call due to
  245. * looping back to the beginning of the push buffer,
  246. * we'll hit the fetching-ahead-of-us path from that
  247. * point on.
  248. *
  249. * the *one* exception to that rule is if we read
  250. * GET==PUT, in which case the below conditional will
  251. * always succeed and break us out of the wait loop.
  252. */
  253. chan->dma.free = chan->dma.max - chan->dma.cur;
  254. if (chan->dma.free >= size)
  255. break;
  256. /* not enough space left at the end of the push buffer,
  257. * instruct the GPU to jump back to the start right
  258. * after processing the currently pending commands.
  259. */
  260. OUT_RING(chan, chan->pushbuf_base | 0x20000000);
  261. /* wait for GET to depart from the skips area.
  262. * prevents writing GET==PUT and causing a race
  263. * condition that causes us to think the GPU is
  264. * idle when it's not.
  265. */
  266. do {
  267. get = READ_GET(chan, &prev_get, &cnt);
  268. if (unlikely(get == -EBUSY))
  269. return -EBUSY;
  270. if (unlikely(get == -EINVAL))
  271. continue;
  272. } while (get <= NOUVEAU_DMA_SKIPS);
  273. WRITE_PUT(NOUVEAU_DMA_SKIPS);
  274. /* we're now submitting commands at the start of
  275. * the push buffer.
  276. */
  277. chan->dma.cur =
  278. chan->dma.put = NOUVEAU_DMA_SKIPS;
  279. }
  280. /* engine fetching ahead of us, we have space up until the
  281. * current GET pointer. the "- 1" is to ensure there's
  282. * space left to emit a jump back to the beginning of the
  283. * push buffer if we require it. we can never get GET == PUT
  284. * here, so this is safe.
  285. */
  286. chan->dma.free = get - chan->dma.cur - 1;
  287. }
  288. return 0;
  289. }