nouveau_dma.c 8.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331
  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. struct nouveau_gpuobj *obj = NULL;
  56. int ret, i;
  57. /* Create NV_MEMORY_TO_MEMORY_FORMAT for buffer moves */
  58. ret = nouveau_gpuobj_gr_new(chan, dev_priv->card_type < NV_50 ?
  59. 0x0039 : 0x5039, &obj);
  60. if (ret)
  61. return ret;
  62. ret = nouveau_ramht_insert(chan, NvM2MF, obj);
  63. nouveau_gpuobj_ref(NULL, &obj);
  64. if (ret)
  65. return ret;
  66. /* NV_MEMORY_TO_MEMORY_FORMAT requires a notifier object */
  67. ret = nouveau_notifier_alloc(chan, NvNotify0, 32, &chan->m2mf_ntfy);
  68. if (ret)
  69. return ret;
  70. /* Map push buffer */
  71. ret = nouveau_bo_map(chan->pushbuf_bo);
  72. if (ret)
  73. return ret;
  74. /* Insert NOPS for NOUVEAU_DMA_SKIPS */
  75. ret = RING_SPACE(chan, NOUVEAU_DMA_SKIPS);
  76. if (ret)
  77. return ret;
  78. for (i = 0; i < NOUVEAU_DMA_SKIPS; i++)
  79. OUT_RING(chan, 0);
  80. /* Initialise NV_MEMORY_TO_MEMORY_FORMAT */
  81. ret = RING_SPACE(chan, 4);
  82. if (ret)
  83. return ret;
  84. BEGIN_RING(chan, NvSubM2MF, NV_MEMORY_TO_MEMORY_FORMAT_NAME, 1);
  85. OUT_RING(chan, NvM2MF);
  86. BEGIN_RING(chan, NvSubM2MF, NV_MEMORY_TO_MEMORY_FORMAT_DMA_NOTIFY, 1);
  87. OUT_RING(chan, NvNotify0);
  88. /* Sit back and pray the channel works.. */
  89. FIRE_RING(chan);
  90. return 0;
  91. }
  92. void
  93. OUT_RINGp(struct nouveau_channel *chan, const void *data, unsigned nr_dwords)
  94. {
  95. bool is_iomem;
  96. u32 *mem = ttm_kmap_obj_virtual(&chan->pushbuf_bo->kmap, &is_iomem);
  97. mem = &mem[chan->dma.cur];
  98. if (is_iomem)
  99. memcpy_toio((void __force __iomem *)mem, data, nr_dwords * 4);
  100. else
  101. memcpy(mem, data, nr_dwords * 4);
  102. chan->dma.cur += nr_dwords;
  103. }
  104. /* Fetch and adjust GPU GET pointer
  105. *
  106. * Returns:
  107. * value >= 0, the adjusted GET pointer
  108. * -EINVAL if GET pointer currently outside main push buffer
  109. * -EBUSY if timeout exceeded
  110. */
  111. static inline int
  112. READ_GET(struct nouveau_channel *chan, uint32_t *prev_get, uint32_t *timeout)
  113. {
  114. uint32_t val;
  115. val = nvchan_rd32(chan, chan->user_get);
  116. /* reset counter as long as GET is still advancing, this is
  117. * to avoid misdetecting a GPU lockup if the GPU happens to
  118. * just be processing an operation that takes a long time
  119. */
  120. if (val != *prev_get) {
  121. *prev_get = val;
  122. *timeout = 0;
  123. }
  124. if ((++*timeout & 0xff) == 0) {
  125. DRM_UDELAY(1);
  126. if (*timeout > 100000)
  127. return -EBUSY;
  128. }
  129. if (val < chan->pushbuf_base ||
  130. val > chan->pushbuf_base + (chan->dma.max << 2))
  131. return -EINVAL;
  132. return (val - chan->pushbuf_base) >> 2;
  133. }
  134. void
  135. nv50_dma_push(struct nouveau_channel *chan, struct nouveau_bo *bo,
  136. int delta, int length)
  137. {
  138. struct nouveau_bo *pb = chan->pushbuf_bo;
  139. uint64_t offset = bo->bo.offset + delta;
  140. int ip = (chan->dma.ib_put * 2) + chan->dma.ib_base;
  141. BUG_ON(chan->dma.ib_free < 1);
  142. nouveau_bo_wr32(pb, ip++, lower_32_bits(offset));
  143. nouveau_bo_wr32(pb, ip++, upper_32_bits(offset) | length << 8);
  144. chan->dma.ib_put = (chan->dma.ib_put + 1) & chan->dma.ib_max;
  145. DRM_MEMORYBARRIER();
  146. /* Flush writes. */
  147. nouveau_bo_rd32(pb, 0);
  148. nvchan_wr32(chan, 0x8c, chan->dma.ib_put);
  149. chan->dma.ib_free--;
  150. }
  151. static int
  152. nv50_dma_push_wait(struct nouveau_channel *chan, int count)
  153. {
  154. uint32_t cnt = 0, prev_get = 0;
  155. while (chan->dma.ib_free < count) {
  156. uint32_t get = nvchan_rd32(chan, 0x88);
  157. if (get != prev_get) {
  158. prev_get = get;
  159. cnt = 0;
  160. }
  161. if ((++cnt & 0xff) == 0) {
  162. DRM_UDELAY(1);
  163. if (cnt > 100000)
  164. return -EBUSY;
  165. }
  166. chan->dma.ib_free = get - chan->dma.ib_put;
  167. if (chan->dma.ib_free <= 0)
  168. chan->dma.ib_free += chan->dma.ib_max;
  169. }
  170. return 0;
  171. }
  172. static int
  173. nv50_dma_wait(struct nouveau_channel *chan, int slots, int count)
  174. {
  175. uint32_t cnt = 0, prev_get = 0;
  176. int ret;
  177. ret = nv50_dma_push_wait(chan, slots + 1);
  178. if (unlikely(ret))
  179. return ret;
  180. while (chan->dma.free < count) {
  181. int get = READ_GET(chan, &prev_get, &cnt);
  182. if (unlikely(get < 0)) {
  183. if (get == -EINVAL)
  184. continue;
  185. return get;
  186. }
  187. if (get <= chan->dma.cur) {
  188. chan->dma.free = chan->dma.max - chan->dma.cur;
  189. if (chan->dma.free >= count)
  190. break;
  191. FIRE_RING(chan);
  192. do {
  193. get = READ_GET(chan, &prev_get, &cnt);
  194. if (unlikely(get < 0)) {
  195. if (get == -EINVAL)
  196. continue;
  197. return get;
  198. }
  199. } while (get == 0);
  200. chan->dma.cur = 0;
  201. chan->dma.put = 0;
  202. }
  203. chan->dma.free = get - chan->dma.cur - 1;
  204. }
  205. return 0;
  206. }
  207. int
  208. nouveau_dma_wait(struct nouveau_channel *chan, int slots, int size)
  209. {
  210. uint32_t prev_get = 0, cnt = 0;
  211. int get;
  212. if (chan->dma.ib_max)
  213. return nv50_dma_wait(chan, slots, size);
  214. while (chan->dma.free < size) {
  215. get = READ_GET(chan, &prev_get, &cnt);
  216. if (unlikely(get == -EBUSY))
  217. return -EBUSY;
  218. /* loop until we have a usable GET pointer. the value
  219. * we read from the GPU may be outside the main ring if
  220. * PFIFO is processing a buffer called from the main ring,
  221. * discard these values until something sensible is seen.
  222. *
  223. * the other case we discard GET is while the GPU is fetching
  224. * from the SKIPS area, so the code below doesn't have to deal
  225. * with some fun corner cases.
  226. */
  227. if (unlikely(get == -EINVAL) || get < NOUVEAU_DMA_SKIPS)
  228. continue;
  229. if (get <= chan->dma.cur) {
  230. /* engine is fetching behind us, or is completely
  231. * idle (GET == PUT) so we have free space up until
  232. * the end of the push buffer
  233. *
  234. * we can only hit that path once per call due to
  235. * looping back to the beginning of the push buffer,
  236. * we'll hit the fetching-ahead-of-us path from that
  237. * point on.
  238. *
  239. * the *one* exception to that rule is if we read
  240. * GET==PUT, in which case the below conditional will
  241. * always succeed and break us out of the wait loop.
  242. */
  243. chan->dma.free = chan->dma.max - chan->dma.cur;
  244. if (chan->dma.free >= size)
  245. break;
  246. /* not enough space left at the end of the push buffer,
  247. * instruct the GPU to jump back to the start right
  248. * after processing the currently pending commands.
  249. */
  250. OUT_RING(chan, chan->pushbuf_base | 0x20000000);
  251. /* wait for GET to depart from the skips area.
  252. * prevents writing GET==PUT and causing a race
  253. * condition that causes us to think the GPU is
  254. * idle when it's not.
  255. */
  256. do {
  257. get = READ_GET(chan, &prev_get, &cnt);
  258. if (unlikely(get == -EBUSY))
  259. return -EBUSY;
  260. if (unlikely(get == -EINVAL))
  261. continue;
  262. } while (get <= NOUVEAU_DMA_SKIPS);
  263. WRITE_PUT(NOUVEAU_DMA_SKIPS);
  264. /* we're now submitting commands at the start of
  265. * the push buffer.
  266. */
  267. chan->dma.cur =
  268. chan->dma.put = NOUVEAU_DMA_SKIPS;
  269. }
  270. /* engine fetching ahead of us, we have space up until the
  271. * current GET pointer. the "- 1" is to ensure there's
  272. * space left to emit a jump back to the beginning of the
  273. * push buffer if we require it. we can never get GET == PUT
  274. * here, so this is safe.
  275. */
  276. chan->dma.free = get - chan->dma.cur - 1;
  277. }
  278. return 0;
  279. }