Lines Matching +full:max +full:- +full:cur

37  *  -EINVAL if GET pointer currently outside main push buffer
38 * -EBUSY if timeout exceeded
45 val = nvif_rd32(&chan->user, chan->user_get); in READ_GET()
46 if (chan->user_get_hi) in READ_GET()
47 val |= (uint64_t)nvif_rd32(&chan->user, chan->user_get_hi) << 32; in READ_GET()
61 return -EBUSY; in READ_GET()
64 if (val < chan->push.addr || in READ_GET()
65 val > chan->push.addr + (chan->dma.max << 2)) in READ_GET()
66 return -EINVAL; in READ_GET()
68 return (val - chan->push.addr) >> 2; in READ_GET()
74 struct nvif_user *user = &chan->drm->client.device.user; in nv50_dma_push()
75 struct nouveau_bo *pb = chan->push.buffer; in nv50_dma_push()
76 int ip = (chan->dma.ib_put * 2) + chan->dma.ib_base; in nv50_dma_push()
78 BUG_ON(chan->dma.ib_free < 1); in nv50_dma_push()
83 chan->dma.ib_put = (chan->dma.ib_put + 1) & chan->dma.ib_max; in nv50_dma_push()
89 nvif_wr32(&chan->user, 0x8c, chan->dma.ib_put); in nv50_dma_push()
90 if (user->func && user->func->doorbell) in nv50_dma_push()
91 user->func->doorbell(user, chan->token); in nv50_dma_push()
92 chan->dma.ib_free--; in nv50_dma_push()
100 while (chan->dma.ib_free < count) { in nv50_dma_push_wait()
101 uint32_t get = nvif_rd32(&chan->user, 0x88); in nv50_dma_push_wait()
110 return -EBUSY; in nv50_dma_push_wait()
113 chan->dma.ib_free = get - chan->dma.ib_put; in nv50_dma_push_wait()
114 if (chan->dma.ib_free <= 0) in nv50_dma_push_wait()
115 chan->dma.ib_free += chan->dma.ib_max; in nv50_dma_push_wait()
131 while (chan->dma.free < count) { in nv50_dma_wait()
134 if (get == -EINVAL) in nv50_dma_wait()
140 if (get <= chan->dma.cur) { in nv50_dma_wait()
141 chan->dma.free = chan->dma.max - chan->dma.cur; in nv50_dma_wait()
142 if (chan->dma.free >= count) in nv50_dma_wait()
149 if (get == -EINVAL) in nv50_dma_wait()
154 chan->dma.cur = 0; in nv50_dma_wait()
155 chan->dma.put = 0; in nv50_dma_wait()
158 chan->dma.free = get - chan->dma.cur - 1; in nv50_dma_wait()
170 if (chan->dma.ib_max) in nouveau_dma_wait()
173 while (chan->dma.free < size) { in nouveau_dma_wait()
175 if (unlikely(get == -EBUSY)) in nouveau_dma_wait()
176 return -EBUSY; in nouveau_dma_wait()
187 if (unlikely(get == -EINVAL) || get < NOUVEAU_DMA_SKIPS) in nouveau_dma_wait()
190 if (get <= chan->dma.cur) { in nouveau_dma_wait()
197 * we'll hit the fetching-ahead-of-us path from that in nouveau_dma_wait()
204 chan->dma.free = chan->dma.max - chan->dma.cur; in nouveau_dma_wait()
205 if (chan->dma.free >= size) in nouveau_dma_wait()
212 OUT_RING(chan, chan->push.addr | 0x20000000); in nouveau_dma_wait()
221 if (unlikely(get == -EBUSY)) in nouveau_dma_wait()
222 return -EBUSY; in nouveau_dma_wait()
223 if (unlikely(get == -EINVAL)) in nouveau_dma_wait()
231 chan->dma.cur = in nouveau_dma_wait()
232 chan->dma.put = NOUVEAU_DMA_SKIPS; in nouveau_dma_wait()
236 * current GET pointer. the "- 1" is to ensure there's in nouveau_dma_wait()
241 chan->dma.free = get - chan->dma.cur - 1; in nouveau_dma_wait()