nouveau_dma.c 8.7 KB

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