blob: 9d27acda87e24b6c3ad88f9c2ca4a332c4be14a4 [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 Skeggsa8eaebc2010-09-01 15:24:31 +100062 struct nouveau_gpuobj *obj = NULL;
Ben Skeggs6ee73862009-12-11 19:24:15 +100063 int ret, i;
64
65 /* Create NV_MEMORY_TO_MEMORY_FORMAT for buffer moves */
66 ret = nouveau_gpuobj_gr_new(chan, dev_priv->card_type < NV_50 ?
Ben Skeggsa8eaebc2010-09-01 15:24:31 +100067 0x0039 : 0x5039, &obj);
Ben Skeggs6ee73862009-12-11 19:24:15 +100068 if (ret)
69 return ret;
70
Ben Skeggsa8eaebc2010-09-01 15:24:31 +100071 ret = nouveau_ramht_insert(chan, NvM2MF, obj);
72 nouveau_gpuobj_ref(NULL, &obj);
Ben Skeggs6ee73862009-12-11 19:24:15 +100073 if (ret)
74 return ret;
75
Francisco Jerezf03a3142009-12-26 02:42:45 +010076 /* Create an NV_SW object for various sync purposes */
Ben Skeggsa8eaebc2010-09-01 15:24:31 +100077 ret = nouveau_gpuobj_sw_new(chan, NV_SW, &obj);
Francisco Jerezf03a3142009-12-26 02:42:45 +010078 if (ret)
79 return ret;
80
Ben Skeggsa8eaebc2010-09-01 15:24:31 +100081 ret = nouveau_ramht_insert(chan, NvSw, obj);
82 nouveau_gpuobj_ref(NULL, &obj);
Francisco Jerezf03a3142009-12-26 02:42:45 +010083 if (ret)
84 return ret;
85
Ben Skeggs6ee73862009-12-11 19:24:15 +100086 /* NV_MEMORY_TO_MEMORY_FORMAT requires a notifier object */
87 ret = nouveau_notifier_alloc(chan, NvNotify0, 32, &chan->m2mf_ntfy);
88 if (ret)
89 return ret;
90
91 /* Map push buffer */
92 ret = nouveau_bo_map(chan->pushbuf_bo);
93 if (ret)
94 return ret;
95
Ben Skeggs6ee73862009-12-11 19:24:15 +100096 /* Insert NOPS for NOUVEAU_DMA_SKIPS */
97 ret = RING_SPACE(chan, NOUVEAU_DMA_SKIPS);
98 if (ret)
99 return ret;
100
101 for (i = 0; i < NOUVEAU_DMA_SKIPS; i++)
102 OUT_RING(chan, 0);
103
104 /* Initialise NV_MEMORY_TO_MEMORY_FORMAT */
105 ret = RING_SPACE(chan, 4);
106 if (ret)
107 return ret;
108 BEGIN_RING(chan, NvSubM2MF, NV_MEMORY_TO_MEMORY_FORMAT_NAME, 1);
109 OUT_RING(chan, NvM2MF);
110 BEGIN_RING(chan, NvSubM2MF, NV_MEMORY_TO_MEMORY_FORMAT_DMA_NOTIFY, 1);
111 OUT_RING(chan, NvNotify0);
112
Francisco Jerezf03a3142009-12-26 02:42:45 +0100113 /* Initialise NV_SW */
114 ret = RING_SPACE(chan, 2);
115 if (ret)
116 return ret;
117 BEGIN_RING(chan, NvSubSw, 0, 1);
118 OUT_RING(chan, NvSw);
119
Ben Skeggs6ee73862009-12-11 19:24:15 +1000120 /* Sit back and pray the channel works.. */
121 FIRE_RING(chan);
122
123 return 0;
124}
125
126void
127OUT_RINGp(struct nouveau_channel *chan, const void *data, unsigned nr_dwords)
128{
129 bool is_iomem;
130 u32 *mem = ttm_kmap_obj_virtual(&chan->pushbuf_bo->kmap, &is_iomem);
131 mem = &mem[chan->dma.cur];
132 if (is_iomem)
133 memcpy_toio((void __force __iomem *)mem, data, nr_dwords * 4);
134 else
135 memcpy(mem, data, nr_dwords * 4);
136 chan->dma.cur += nr_dwords;
137}
138
Ben Skeggsba599532010-01-15 12:08:57 +1000139/* Fetch and adjust GPU GET pointer
140 *
141 * Returns:
142 * value >= 0, the adjusted GET pointer
143 * -EINVAL if GET pointer currently outside main push buffer
144 * -EBUSY if timeout exceeded
145 */
146static inline int
147READ_GET(struct nouveau_channel *chan, uint32_t *prev_get, uint32_t *timeout)
Ben Skeggs6ee73862009-12-11 19:24:15 +1000148{
149 uint32_t val;
150
151 val = nvchan_rd32(chan, chan->user_get);
Ben Skeggsba599532010-01-15 12:08:57 +1000152
153 /* reset counter as long as GET is still advancing, this is
154 * to avoid misdetecting a GPU lockup if the GPU happens to
155 * just be processing an operation that takes a long time
156 */
157 if (val != *prev_get) {
158 *prev_get = val;
159 *timeout = 0;
Ben Skeggs6ee73862009-12-11 19:24:15 +1000160 }
161
Ben Skeggsba599532010-01-15 12:08:57 +1000162 if ((++*timeout & 0xff) == 0) {
163 DRM_UDELAY(1);
164 if (*timeout > 100000)
165 return -EBUSY;
166 }
167
168 if (val < chan->pushbuf_base ||
169 val > chan->pushbuf_base + (chan->dma.max << 2))
170 return -EINVAL;
171
172 return (val - chan->pushbuf_base) >> 2;
Ben Skeggs6ee73862009-12-11 19:24:15 +1000173}
174
Ben Skeggs9a391ad2010-02-11 16:37:26 +1000175void
176nv50_dma_push(struct nouveau_channel *chan, struct nouveau_bo *bo,
Ben Skeggsa1606a92010-02-12 10:27:35 +1000177 int delta, int length)
Ben Skeggs9a391ad2010-02-11 16:37:26 +1000178{
179 struct nouveau_bo *pb = chan->pushbuf_bo;
Ben Skeggsd87897d2010-02-12 11:11:54 +1000180 uint64_t offset = bo->bo.offset + delta;
Ben Skeggs9a391ad2010-02-11 16:37:26 +1000181 int ip = (chan->dma.ib_put * 2) + chan->dma.ib_base;
182
183 BUG_ON(chan->dma.ib_free < 1);
Ben Skeggsd87897d2010-02-12 11:11:54 +1000184 nouveau_bo_wr32(pb, ip++, lower_32_bits(offset));
Ben Skeggsa1606a92010-02-12 10:27:35 +1000185 nouveau_bo_wr32(pb, ip++, upper_32_bits(offset) | length << 8);
Ben Skeggs9a391ad2010-02-11 16:37:26 +1000186
187 chan->dma.ib_put = (chan->dma.ib_put + 1) & chan->dma.ib_max;
Maarten Maathuisce48fa92010-02-25 20:00:38 +0100188
189 DRM_MEMORYBARRIER();
190 /* Flush writes. */
191 nouveau_bo_rd32(pb, 0);
192
Ben Skeggs9a391ad2010-02-11 16:37:26 +1000193 nvchan_wr32(chan, 0x8c, chan->dma.ib_put);
194 chan->dma.ib_free--;
195}
196
197static int
198nv50_dma_push_wait(struct nouveau_channel *chan, int count)
199{
200 uint32_t cnt = 0, prev_get = 0;
201
202 while (chan->dma.ib_free < count) {
203 uint32_t get = nvchan_rd32(chan, 0x88);
204 if (get != prev_get) {
205 prev_get = get;
206 cnt = 0;
207 }
208
209 if ((++cnt & 0xff) == 0) {
210 DRM_UDELAY(1);
211 if (cnt > 100000)
212 return -EBUSY;
213 }
214
215 chan->dma.ib_free = get - chan->dma.ib_put;
216 if (chan->dma.ib_free <= 0)
217 chan->dma.ib_free += chan->dma.ib_max + 1;
218 }
219
220 return 0;
221}
222
223static int
224nv50_dma_wait(struct nouveau_channel *chan, int slots, int count)
225{
226 uint32_t cnt = 0, prev_get = 0;
227 int ret;
228
229 ret = nv50_dma_push_wait(chan, slots + 1);
230 if (unlikely(ret))
231 return ret;
232
233 while (chan->dma.free < count) {
234 int get = READ_GET(chan, &prev_get, &cnt);
235 if (unlikely(get < 0)) {
236 if (get == -EINVAL)
237 continue;
238
239 return get;
240 }
241
242 if (get <= chan->dma.cur) {
243 chan->dma.free = chan->dma.max - chan->dma.cur;
244 if (chan->dma.free >= count)
245 break;
246
247 FIRE_RING(chan);
248 do {
249 get = READ_GET(chan, &prev_get, &cnt);
250 if (unlikely(get < 0)) {
251 if (get == -EINVAL)
252 continue;
253 return get;
254 }
255 } while (get == 0);
256 chan->dma.cur = 0;
257 chan->dma.put = 0;
258 }
259
260 chan->dma.free = get - chan->dma.cur - 1;
261 }
262
263 return 0;
264}
265
Ben Skeggs6ee73862009-12-11 19:24:15 +1000266int
Ben Skeggs9a391ad2010-02-11 16:37:26 +1000267nouveau_dma_wait(struct nouveau_channel *chan, int slots, int size)
Ben Skeggs6ee73862009-12-11 19:24:15 +1000268{
Ben Skeggsba599532010-01-15 12:08:57 +1000269 uint32_t prev_get = 0, cnt = 0;
270 int get;
Ben Skeggs6ee73862009-12-11 19:24:15 +1000271
Ben Skeggs9a391ad2010-02-11 16:37:26 +1000272 if (chan->dma.ib_max)
273 return nv50_dma_wait(chan, slots, size);
274
Ben Skeggs6ee73862009-12-11 19:24:15 +1000275 while (chan->dma.free < size) {
Ben Skeggsba599532010-01-15 12:08:57 +1000276 get = READ_GET(chan, &prev_get, &cnt);
277 if (unlikely(get == -EBUSY))
278 return -EBUSY;
Ben Skeggs6ee73862009-12-11 19:24:15 +1000279
280 /* loop until we have a usable GET pointer. the value
281 * we read from the GPU may be outside the main ring if
282 * PFIFO is processing a buffer called from the main ring,
283 * discard these values until something sensible is seen.
284 *
285 * the other case we discard GET is while the GPU is fetching
286 * from the SKIPS area, so the code below doesn't have to deal
287 * with some fun corner cases.
288 */
Ben Skeggsba599532010-01-15 12:08:57 +1000289 if (unlikely(get == -EINVAL) || get < NOUVEAU_DMA_SKIPS)
Ben Skeggs6ee73862009-12-11 19:24:15 +1000290 continue;
291
292 if (get <= chan->dma.cur) {
293 /* engine is fetching behind us, or is completely
294 * idle (GET == PUT) so we have free space up until
295 * the end of the push buffer
296 *
297 * we can only hit that path once per call due to
298 * looping back to the beginning of the push buffer,
299 * we'll hit the fetching-ahead-of-us path from that
300 * point on.
301 *
302 * the *one* exception to that rule is if we read
303 * GET==PUT, in which case the below conditional will
304 * always succeed and break us out of the wait loop.
305 */
306 chan->dma.free = chan->dma.max - chan->dma.cur;
307 if (chan->dma.free >= size)
308 break;
309
310 /* not enough space left at the end of the push buffer,
311 * instruct the GPU to jump back to the start right
312 * after processing the currently pending commands.
313 */
314 OUT_RING(chan, chan->pushbuf_base | 0x20000000);
Ben Skeggsba599532010-01-15 12:08:57 +1000315
316 /* wait for GET to depart from the skips area.
317 * prevents writing GET==PUT and causing a race
318 * condition that causes us to think the GPU is
319 * idle when it's not.
320 */
321 do {
322 get = READ_GET(chan, &prev_get, &cnt);
323 if (unlikely(get == -EBUSY))
324 return -EBUSY;
325 if (unlikely(get == -EINVAL))
326 continue;
327 } while (get <= NOUVEAU_DMA_SKIPS);
Ben Skeggs6ee73862009-12-11 19:24:15 +1000328 WRITE_PUT(NOUVEAU_DMA_SKIPS);
329
330 /* we're now submitting commands at the start of
331 * the push buffer.
332 */
333 chan->dma.cur =
334 chan->dma.put = NOUVEAU_DMA_SKIPS;
335 }
336
337 /* engine fetching ahead of us, we have space up until the
338 * current GET pointer. the "- 1" is to ensure there's
339 * space left to emit a jump back to the beginning of the
340 * push buffer if we require it. we can never get GET == PUT
341 * here, so this is safe.
342 */
343 chan->dma.free = get - chan->dma.cur - 1;
344 }
345
346 return 0;
347}
348