nouveau_dma.c 5.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206
  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. int
  31. nouveau_dma_init(struct nouveau_channel *chan)
  32. {
  33. struct drm_device *dev = chan->dev;
  34. struct drm_nouveau_private *dev_priv = dev->dev_private;
  35. struct nouveau_gpuobj *m2mf = NULL;
  36. int ret, i;
  37. /* Create NV_MEMORY_TO_MEMORY_FORMAT for buffer moves */
  38. ret = nouveau_gpuobj_gr_new(chan, dev_priv->card_type < NV_50 ?
  39. 0x0039 : 0x5039, &m2mf);
  40. if (ret)
  41. return ret;
  42. ret = nouveau_gpuobj_ref_add(dev, chan, NvM2MF, m2mf, NULL);
  43. if (ret)
  44. return ret;
  45. /* NV_MEMORY_TO_MEMORY_FORMAT requires a notifier object */
  46. ret = nouveau_notifier_alloc(chan, NvNotify0, 32, &chan->m2mf_ntfy);
  47. if (ret)
  48. return ret;
  49. /* Map push buffer */
  50. ret = nouveau_bo_map(chan->pushbuf_bo);
  51. if (ret)
  52. return ret;
  53. /* Map M2MF notifier object - fbcon. */
  54. if (drm_core_check_feature(dev, DRIVER_MODESET)) {
  55. ret = nouveau_bo_map(chan->notifier_bo);
  56. if (ret)
  57. return ret;
  58. }
  59. /* Initialise DMA vars */
  60. chan->dma.max = (chan->pushbuf_bo->bo.mem.size >> 2) - 2;
  61. chan->dma.put = 0;
  62. chan->dma.cur = chan->dma.put;
  63. chan->dma.free = chan->dma.max - chan->dma.cur;
  64. /* Insert NOPS for NOUVEAU_DMA_SKIPS */
  65. ret = RING_SPACE(chan, NOUVEAU_DMA_SKIPS);
  66. if (ret)
  67. return ret;
  68. for (i = 0; i < NOUVEAU_DMA_SKIPS; i++)
  69. OUT_RING(chan, 0);
  70. /* Initialise NV_MEMORY_TO_MEMORY_FORMAT */
  71. ret = RING_SPACE(chan, 4);
  72. if (ret)
  73. return ret;
  74. BEGIN_RING(chan, NvSubM2MF, NV_MEMORY_TO_MEMORY_FORMAT_NAME, 1);
  75. OUT_RING(chan, NvM2MF);
  76. BEGIN_RING(chan, NvSubM2MF, NV_MEMORY_TO_MEMORY_FORMAT_DMA_NOTIFY, 1);
  77. OUT_RING(chan, NvNotify0);
  78. /* Sit back and pray the channel works.. */
  79. FIRE_RING(chan);
  80. return 0;
  81. }
  82. void
  83. OUT_RINGp(struct nouveau_channel *chan, const void *data, unsigned nr_dwords)
  84. {
  85. bool is_iomem;
  86. u32 *mem = ttm_kmap_obj_virtual(&chan->pushbuf_bo->kmap, &is_iomem);
  87. mem = &mem[chan->dma.cur];
  88. if (is_iomem)
  89. memcpy_toio((void __force __iomem *)mem, data, nr_dwords * 4);
  90. else
  91. memcpy(mem, data, nr_dwords * 4);
  92. chan->dma.cur += nr_dwords;
  93. }
  94. static inline bool
  95. READ_GET(struct nouveau_channel *chan, uint32_t *get)
  96. {
  97. uint32_t val;
  98. val = nvchan_rd32(chan, chan->user_get);
  99. if (val < chan->pushbuf_base ||
  100. val >= chan->pushbuf_base + chan->pushbuf_bo->bo.mem.size) {
  101. /* meaningless to dma_wait() except to know whether the
  102. * GPU has stalled or not
  103. */
  104. *get = val;
  105. return false;
  106. }
  107. *get = (val - chan->pushbuf_base) >> 2;
  108. return true;
  109. }
  110. int
  111. nouveau_dma_wait(struct nouveau_channel *chan, int size)
  112. {
  113. uint32_t get, prev_get = 0, cnt = 0;
  114. bool get_valid;
  115. while (chan->dma.free < size) {
  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. get_valid = READ_GET(chan, &get);
  121. if (get != prev_get) {
  122. prev_get = get;
  123. cnt = 0;
  124. }
  125. if ((++cnt & 0xff) == 0) {
  126. DRM_UDELAY(1);
  127. if (cnt > 100000)
  128. return -EBUSY;
  129. }
  130. /* loop until we have a usable GET pointer. the value
  131. * we read from the GPU may be outside the main ring if
  132. * PFIFO is processing a buffer called from the main ring,
  133. * discard these values until something sensible is seen.
  134. *
  135. * the other case we discard GET is while the GPU is fetching
  136. * from the SKIPS area, so the code below doesn't have to deal
  137. * with some fun corner cases.
  138. */
  139. if (!get_valid || get < NOUVEAU_DMA_SKIPS)
  140. continue;
  141. if (get <= chan->dma.cur) {
  142. /* engine is fetching behind us, or is completely
  143. * idle (GET == PUT) so we have free space up until
  144. * the end of the push buffer
  145. *
  146. * we can only hit that path once per call due to
  147. * looping back to the beginning of the push buffer,
  148. * we'll hit the fetching-ahead-of-us path from that
  149. * point on.
  150. *
  151. * the *one* exception to that rule is if we read
  152. * GET==PUT, in which case the below conditional will
  153. * always succeed and break us out of the wait loop.
  154. */
  155. chan->dma.free = chan->dma.max - chan->dma.cur;
  156. if (chan->dma.free >= size)
  157. break;
  158. /* not enough space left at the end of the push buffer,
  159. * instruct the GPU to jump back to the start right
  160. * after processing the currently pending commands.
  161. */
  162. OUT_RING(chan, chan->pushbuf_base | 0x20000000);
  163. WRITE_PUT(NOUVEAU_DMA_SKIPS);
  164. /* we're now submitting commands at the start of
  165. * the push buffer.
  166. */
  167. chan->dma.cur =
  168. chan->dma.put = NOUVEAU_DMA_SKIPS;
  169. }
  170. /* engine fetching ahead of us, we have space up until the
  171. * current GET pointer. the "- 1" is to ensure there's
  172. * space left to emit a jump back to the beginning of the
  173. * push buffer if we require it. we can never get GET == PUT
  174. * here, so this is safe.
  175. */
  176. chan->dma.free = get - chan->dma.cur - 1;
  177. }
  178. return 0;
  179. }