1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27#include "nouveau_drv.h"
28#include "nouveau_dma.h"
29
30void
31OUT_RINGp(struct nouveau_channel *chan, const void *data, unsigned nr_dwords)
32{
33 bool is_iomem;
34 u32 *mem = ttm_kmap_obj_virtual(&chan->push.buffer->kmap, &is_iomem);
35 mem = &mem[chan->dma.cur];
36 if (is_iomem)
37 memcpy_toio((void __force __iomem *)mem, data, nr_dwords * 4);
38 else
39 memcpy(mem, data, nr_dwords * 4);
40 chan->dma.cur += nr_dwords;
41}
42
43
44
45
46
47
48
49
50static inline int
51READ_GET(struct nouveau_channel *chan, uint64_t *prev_get, int *timeout)
52{
53 uint64_t val;
54
55 val = nvif_rd32(&chan->user, chan->user_get);
56 if (chan->user_get_hi)
57 val |= (uint64_t)nvif_rd32(&chan->user, chan->user_get_hi) << 32;
58
59
60
61
62
63 if (val != *prev_get) {
64 *prev_get = val;
65 *timeout = 0;
66 }
67
68 if ((++*timeout & 0xff) == 0) {
69 udelay(1);
70 if (*timeout > 100000)
71 return -EBUSY;
72 }
73
74 if (val < chan->push.vma.offset ||
75 val > chan->push.vma.offset + (chan->dma.max << 2))
76 return -EINVAL;
77
78 return (val - chan->push.vma.offset) >> 2;
79}
80
81void
82nv50_dma_push(struct nouveau_channel *chan, struct nouveau_bo *bo,
83 int delta, int length)
84{
85 struct nouveau_cli *cli = (void *)chan->user.client;
86 struct nouveau_bo *pb = chan->push.buffer;
87 struct nvkm_vma *vma;
88 int ip = (chan->dma.ib_put * 2) + chan->dma.ib_base;
89 u64 offset;
90
91 vma = nouveau_bo_vma_find(bo, cli->vm);
92 BUG_ON(!vma);
93 offset = vma->offset + delta;
94
95 BUG_ON(chan->dma.ib_free < 1);
96
97 nouveau_bo_wr32(pb, ip++, lower_32_bits(offset));
98 nouveau_bo_wr32(pb, ip++, upper_32_bits(offset) | length << 8);
99
100 chan->dma.ib_put = (chan->dma.ib_put + 1) & chan->dma.ib_max;
101
102 mb();
103
104 nouveau_bo_rd32(pb, 0);
105
106 nvif_wr32(&chan->user, 0x8c, chan->dma.ib_put);
107 chan->dma.ib_free--;
108}
109
110static int
111nv50_dma_push_wait(struct nouveau_channel *chan, int count)
112{
113 uint32_t cnt = 0, prev_get = 0;
114
115 while (chan->dma.ib_free < count) {
116 uint32_t get = nvif_rd32(&chan->user, 0x88);
117 if (get != prev_get) {
118 prev_get = get;
119 cnt = 0;
120 }
121
122 if ((++cnt & 0xff) == 0) {
123 DRM_UDELAY(1);
124 if (cnt > 100000)
125 return -EBUSY;
126 }
127
128 chan->dma.ib_free = get - chan->dma.ib_put;
129 if (chan->dma.ib_free <= 0)
130 chan->dma.ib_free += chan->dma.ib_max;
131 }
132
133 return 0;
134}
135
136static int
137nv50_dma_wait(struct nouveau_channel *chan, int slots, int count)
138{
139 uint64_t prev_get = 0;
140 int ret, cnt = 0;
141
142 ret = nv50_dma_push_wait(chan, slots + 1);
143 if (unlikely(ret))
144 return ret;
145
146 while (chan->dma.free < count) {
147 int get = READ_GET(chan, &prev_get, &cnt);
148 if (unlikely(get < 0)) {
149 if (get == -EINVAL)
150 continue;
151
152 return get;
153 }
154
155 if (get <= chan->dma.cur) {
156 chan->dma.free = chan->dma.max - chan->dma.cur;
157 if (chan->dma.free >= count)
158 break;
159
160 FIRE_RING(chan);
161 do {
162 get = READ_GET(chan, &prev_get, &cnt);
163 if (unlikely(get < 0)) {
164 if (get == -EINVAL)
165 continue;
166 return get;
167 }
168 } while (get == 0);
169 chan->dma.cur = 0;
170 chan->dma.put = 0;
171 }
172
173 chan->dma.free = get - chan->dma.cur - 1;
174 }
175
176 return 0;
177}
178
179int
180nouveau_dma_wait(struct nouveau_channel *chan, int slots, int size)
181{
182 uint64_t prev_get = 0;
183 int cnt = 0, get;
184
185 if (chan->dma.ib_max)
186 return nv50_dma_wait(chan, slots, size);
187
188 while (chan->dma.free < size) {
189 get = READ_GET(chan, &prev_get, &cnt);
190 if (unlikely(get == -EBUSY))
191 return -EBUSY;
192
193
194
195
196
197
198
199
200
201
202 if (unlikely(get == -EINVAL) || get < NOUVEAU_DMA_SKIPS)
203 continue;
204
205 if (get <= chan->dma.cur) {
206
207
208
209
210
211
212
213
214
215
216
217
218
219 chan->dma.free = chan->dma.max - chan->dma.cur;
220 if (chan->dma.free >= size)
221 break;
222
223
224
225
226
227 OUT_RING(chan, chan->push.vma.offset | 0x20000000);
228
229
230
231
232
233
234 do {
235 get = READ_GET(chan, &prev_get, &cnt);
236 if (unlikely(get == -EBUSY))
237 return -EBUSY;
238 if (unlikely(get == -EINVAL))
239 continue;
240 } while (get <= NOUVEAU_DMA_SKIPS);
241 WRITE_PUT(NOUVEAU_DMA_SKIPS);
242
243
244
245
246 chan->dma.cur =
247 chan->dma.put = NOUVEAU_DMA_SKIPS;
248 }
249
250
251
252
253
254
255
256 chan->dma.free = get - chan->dma.cur - 1;
257 }
258
259 return 0;
260}
261
262