blob: 6ff77cedc00836442bebaf0bb1cd28d3fd62d163 [file] [log] [blame]
Ben Skeggs6ee73862009-12-11 19:24:15 +10001/*
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
27#include "drmP.h"
28#include "drm.h"
29#include "nouveau_drv.h"
30#include "nouveau_dma.h"
Ben Skeggsa8eaebc2010-09-01 15:24:31 +100031#include "nouveau_ramht.h"
Ben Skeggs6ee73862009-12-11 19:24:15 +100032
Ben Skeggs75c99da2010-01-08 10:57:39 +100033void
34nouveau_dma_pre_init(struct nouveau_channel *chan)
35{
Ben Skeggs9a391ad2010-02-11 16:37:26 +100036 struct drm_nouveau_private *dev_priv = chan->dev->dev_private;
37 struct nouveau_bo *pushbuf = chan->pushbuf_bo;
38
39 if (dev_priv->card_type == NV_50) {
40 const int ib_size = pushbuf->bo.mem.size / 2;
41
42 chan->dma.ib_base = (pushbuf->bo.mem.size - ib_size) >> 2;
43 chan->dma.ib_max = (ib_size / 8) - 1;
44 chan->dma.ib_put = 0;
45 chan->dma.ib_free = chan->dma.ib_max - chan->dma.ib_put;
46
47 chan->dma.max = (pushbuf->bo.mem.size - ib_size) >> 2;
48 } else {
49 chan->dma.max = (pushbuf->bo.mem.size >> 2) - 2;
50 }
51
Ben Skeggs75c99da2010-01-08 10:57:39 +100052 chan->dma.put = 0;
53 chan->dma.cur = chan->dma.put;
54 chan->dma.free = chan->dma.max - chan->dma.cur;
55}
56
Ben Skeggs6ee73862009-12-11 19:24:15 +100057int
58nouveau_dma_init(struct nouveau_channel *chan)
59{
60 struct drm_device *dev = chan->dev;
61 struct drm_nouveau_private *dev_priv = dev->dev_private;
Ben Skeggs6ee73862009-12-11 19:24:15 +100062 int ret, i;
63
64 /* Create NV_MEMORY_TO_MEMORY_FORMAT for buffer moves */
Ben Skeggsceac3092010-11-23 10:10:24 +100065 ret = nouveau_gpuobj_gr_new(chan, NvM2MF, dev_priv->card_type < NV_50 ?
66 0x0039 : 0x5039);
Ben Skeggs6ee73862009-12-11 19:24:15 +100067 if (ret)
68 return ret;
69
70 /* NV_MEMORY_TO_MEMORY_FORMAT requires a notifier object */
71 ret = nouveau_notifier_alloc(chan, NvNotify0, 32, &chan->m2mf_ntfy);
72 if (ret)
73 return ret;
74
75 /* Map push buffer */
76 ret = nouveau_bo_map(chan->pushbuf_bo);
77 if (ret)
78 return ret;
79
Ben Skeggs6ee73862009-12-11 19:24:15 +100080 /* Insert NOPS for NOUVEAU_DMA_SKIPS */
81 ret = RING_SPACE(chan, NOUVEAU_DMA_SKIPS);
82 if (ret)
83 return ret;
84
85 for (i = 0; i < NOUVEAU_DMA_SKIPS; i++)
86 OUT_RING(chan, 0);
87
88 /* Initialise NV_MEMORY_TO_MEMORY_FORMAT */
89 ret = RING_SPACE(chan, 4);
90 if (ret)
91 return ret;
92 BEGIN_RING(chan, NvSubM2MF, NV_MEMORY_TO_MEMORY_FORMAT_NAME, 1);
93 OUT_RING(chan, NvM2MF);
94 BEGIN_RING(chan, NvSubM2MF, NV_MEMORY_TO_MEMORY_FORMAT_DMA_NOTIFY, 1);
95 OUT_RING(chan, NvNotify0);
96
Ben Skeggs6ee73862009-12-11 19:24:15 +100097 /* Sit back and pray the channel works.. */
98 FIRE_RING(chan);
99
100 return 0;
101}
102
103void
104OUT_RINGp(struct nouveau_channel *chan, const void *data, unsigned nr_dwords)
105{
106 bool is_iomem;
107 u32 *mem = ttm_kmap_obj_virtual(&chan->pushbuf_bo->kmap, &is_iomem);
108 mem = &mem[chan->dma.cur];
109 if (is_iomem)
110 memcpy_toio((void __force __iomem *)mem, data, nr_dwords * 4);
111 else
112 memcpy(mem, data, nr_dwords * 4);
113 chan->dma.cur += nr_dwords;
114}
115
Ben Skeggsba599532010-01-15 12:08:57 +1000116/* Fetch and adjust GPU GET pointer
117 *
118 * Returns:
119 * value >= 0, the adjusted GET pointer
120 * -EINVAL if GET pointer currently outside main push buffer
121 * -EBUSY if timeout exceeded
122 */
123static inline int
124READ_GET(struct nouveau_channel *chan, uint32_t *prev_get, uint32_t *timeout)
Ben Skeggs6ee73862009-12-11 19:24:15 +1000125{
126 uint32_t val;
127
128 val = nvchan_rd32(chan, chan->user_get);
Ben Skeggsba599532010-01-15 12:08:57 +1000129
130 /* reset counter as long as GET is still advancing, this is
131 * to avoid misdetecting a GPU lockup if the GPU happens to
132 * just be processing an operation that takes a long time
133 */
134 if (val != *prev_get) {
135 *prev_get = val;
136 *timeout = 0;
Ben Skeggs6ee73862009-12-11 19:24:15 +1000137 }
138
Ben Skeggsba599532010-01-15 12:08:57 +1000139 if ((++*timeout & 0xff) == 0) {
140 DRM_UDELAY(1);
141 if (*timeout > 100000)
142 return -EBUSY;
143 }
144
145 if (val < chan->pushbuf_base ||
146 val > chan->pushbuf_base + (chan->dma.max << 2))
147 return -EINVAL;
148
149 return (val - chan->pushbuf_base) >> 2;
Ben Skeggs6ee73862009-12-11 19:24:15 +1000150}
151
Ben Skeggs9a391ad2010-02-11 16:37:26 +1000152void
153nv50_dma_push(struct nouveau_channel *chan, struct nouveau_bo *bo,
Ben Skeggsa1606a92010-02-12 10:27:35 +1000154 int delta, int length)
Ben Skeggs9a391ad2010-02-11 16:37:26 +1000155{
156 struct nouveau_bo *pb = chan->pushbuf_bo;
Ben Skeggsd87897d2010-02-12 11:11:54 +1000157 uint64_t offset = bo->bo.offset + delta;
Ben Skeggs9a391ad2010-02-11 16:37:26 +1000158 int ip = (chan->dma.ib_put * 2) + chan->dma.ib_base;
159
160 BUG_ON(chan->dma.ib_free < 1);
Ben Skeggsd87897d2010-02-12 11:11:54 +1000161 nouveau_bo_wr32(pb, ip++, lower_32_bits(offset));
Ben Skeggsa1606a92010-02-12 10:27:35 +1000162 nouveau_bo_wr32(pb, ip++, upper_32_bits(offset) | length << 8);
Ben Skeggs9a391ad2010-02-11 16:37:26 +1000163
164 chan->dma.ib_put = (chan->dma.ib_put + 1) & chan->dma.ib_max;
Maarten Maathuisce48fa92010-02-25 20:00:38 +0100165
166 DRM_MEMORYBARRIER();
167 /* Flush writes. */
168 nouveau_bo_rd32(pb, 0);
169
Ben Skeggs9a391ad2010-02-11 16:37:26 +1000170 nvchan_wr32(chan, 0x8c, chan->dma.ib_put);
171 chan->dma.ib_free--;
172}
173
174static int
175nv50_dma_push_wait(struct nouveau_channel *chan, int count)
176{
177 uint32_t cnt = 0, prev_get = 0;
178
179 while (chan->dma.ib_free < count) {
180 uint32_t get = nvchan_rd32(chan, 0x88);
181 if (get != prev_get) {
182 prev_get = get;
183 cnt = 0;
184 }
185
186 if ((++cnt & 0xff) == 0) {
187 DRM_UDELAY(1);
188 if (cnt > 100000)
189 return -EBUSY;
190 }
191
192 chan->dma.ib_free = get - chan->dma.ib_put;
193 if (chan->dma.ib_free <= 0)
Ben Skeggs62841ab2010-09-30 09:09:42 +1000194 chan->dma.ib_free += chan->dma.ib_max;
Ben Skeggs9a391ad2010-02-11 16:37:26 +1000195 }
196
197 return 0;
198}
199
200static int
201nv50_dma_wait(struct nouveau_channel *chan, int slots, int count)
202{
203 uint32_t cnt = 0, prev_get = 0;
204 int ret;
205
206 ret = nv50_dma_push_wait(chan, slots + 1);
207 if (unlikely(ret))
208 return ret;
209
210 while (chan->dma.free < count) {
211 int get = READ_GET(chan, &prev_get, &cnt);
212 if (unlikely(get < 0)) {
213 if (get == -EINVAL)
214 continue;
215
216 return get;
217 }
218
219 if (get <= chan->dma.cur) {
220 chan->dma.free = chan->dma.max - chan->dma.cur;
221 if (chan->dma.free >= count)
222 break;
223
224 FIRE_RING(chan);
225 do {
226 get = READ_GET(chan, &prev_get, &cnt);
227 if (unlikely(get < 0)) {
228 if (get == -EINVAL)
229 continue;
230 return get;
231 }
232 } while (get == 0);
233 chan->dma.cur = 0;
234 chan->dma.put = 0;
235 }
236
237 chan->dma.free = get - chan->dma.cur - 1;
238 }
239
240 return 0;
241}
242
Ben Skeggs6ee73862009-12-11 19:24:15 +1000243int
Ben Skeggs9a391ad2010-02-11 16:37:26 +1000244nouveau_dma_wait(struct nouveau_channel *chan, int slots, int size)
Ben Skeggs6ee73862009-12-11 19:24:15 +1000245{
Ben Skeggsba599532010-01-15 12:08:57 +1000246 uint32_t prev_get = 0, cnt = 0;
247 int get;
Ben Skeggs6ee73862009-12-11 19:24:15 +1000248
Ben Skeggs9a391ad2010-02-11 16:37:26 +1000249 if (chan->dma.ib_max)
250 return nv50_dma_wait(chan, slots, size);
251
Ben Skeggs6ee73862009-12-11 19:24:15 +1000252 while (chan->dma.free < size) {
Ben Skeggsba599532010-01-15 12:08:57 +1000253 get = READ_GET(chan, &prev_get, &cnt);
254 if (unlikely(get == -EBUSY))
255 return -EBUSY;
Ben Skeggs6ee73862009-12-11 19:24:15 +1000256
257 /* loop until we have a usable GET pointer. the value
258 * we read from the GPU may be outside the main ring if
259 * PFIFO is processing a buffer called from the main ring,
260 * discard these values until something sensible is seen.
261 *
262 * the other case we discard GET is while the GPU is fetching
263 * from the SKIPS area, so the code below doesn't have to deal
264 * with some fun corner cases.
265 */
Ben Skeggsba599532010-01-15 12:08:57 +1000266 if (unlikely(get == -EINVAL) || get < NOUVEAU_DMA_SKIPS)
Ben Skeggs6ee73862009-12-11 19:24:15 +1000267 continue;
268
269 if (get <= chan->dma.cur) {
270 /* engine is fetching behind us, or is completely
271 * idle (GET == PUT) so we have free space up until
272 * the end of the push buffer
273 *
274 * we can only hit that path once per call due to
275 * looping back to the beginning of the push buffer,
276 * we'll hit the fetching-ahead-of-us path from that
277 * point on.
278 *
279 * the *one* exception to that rule is if we read
280 * GET==PUT, in which case the below conditional will
281 * always succeed and break us out of the wait loop.
282 */
283 chan->dma.free = chan->dma.max - chan->dma.cur;
284 if (chan->dma.free >= size)
285 break;
286
287 /* not enough space left at the end of the push buffer,
288 * instruct the GPU to jump back to the start right
289 * after processing the currently pending commands.
290 */
291 OUT_RING(chan, chan->pushbuf_base | 0x20000000);
Ben Skeggsba599532010-01-15 12:08:57 +1000292
293 /* wait for GET to depart from the skips area.
294 * prevents writing GET==PUT and causing a race
295 * condition that causes us to think the GPU is
296 * idle when it's not.
297 */
298 do {
299 get = READ_GET(chan, &prev_get, &cnt);
300 if (unlikely(get == -EBUSY))
301 return -EBUSY;
302 if (unlikely(get == -EINVAL))
303 continue;
304 } while (get <= NOUVEAU_DMA_SKIPS);
Ben Skeggs6ee73862009-12-11 19:24:15 +1000305 WRITE_PUT(NOUVEAU_DMA_SKIPS);
306
307 /* we're now submitting commands at the start of
308 * the push buffer.
309 */
310 chan->dma.cur =
311 chan->dma.put = NOUVEAU_DMA_SKIPS;
312 }
313
314 /* engine fetching ahead of us, we have space up until the
315 * current GET pointer. the "- 1" is to ensure there's
316 * space left to emit a jump back to the beginning of the
317 * push buffer if we require it. we can never get GET == PUT
318 * here, so this is safe.
319 */
320 chan->dma.free = get - chan->dma.cur - 1;
321 }
322
323 return 0;
324}
325