93 for(k = 0; (state->
N[Q] << k) < state->
A[Q]; k++);
102 ret = -((ret + 1) >> 1);
107 if(!state->
near && !k && (2 * state->
B[Q] <= -state->
N[Q]))
119 int k, ret, temp, map;
120 int Q = 365 + RItype;
124 temp += state->
N[Q] >> 1;
126 for(k = 0; (state->
N[Q] << k) < temp; k++);
135 if(!k && (RItype || ret) && (2 * state->
B[Q] < state->
N[Q]))
140 ret = map - ((ret + 1) >> 1);
147 state->
A[Q] +=
FFABS(ret) - RItype;
166 Ra = x ?
R(dst, x - stride) :
R(last, x);
168 Rc = x ?
R(last, x - stride) : last2;
169 Rd = (x >= w -
stride) ?
R(last, x) :
R(last, x + stride);
182 if(x + r * stride > w) {
183 r = (w - x) / stride;
185 for(i = 0; i <
r; i++) {
201 for(i = 0; i <
r; i++) {
208 RItype = (
FFABS(Ra - Rb) <= state->
near) ? 1 : 0;
213 if(state->
near && RItype){
225 pred =
mid_pred(Ra, Ra + Rb - Rc, Rb);
235 pred = av_clip(pred - state->
C[context], 0, state->
maxval);
238 pred = av_clip(pred + state->
C[context], 0, state->
maxval);
246 if(pred < -state->near)
250 pred = av_clip(pred, 0, state->
maxval);
261 uint8_t *
zero, *last, *cur;
282 shift = point_transform + (8 - s->
bits);
284 shift = point_transform + (16 - s->
bits);
297 for(i = 0; i < s->
height; i++) {
303 t = *((uint16_t*)last);
313 }
else if(ilv == 1) {
315 int Rc[3] = {0, 0, 0};
318 for(i = 0; i < s->
height; i++) {
319 for(j = 0; j < 3; j++) {
331 }
else if (ilv == 2) {
345 for(i = 0; i < s->
height; i++){
346 for(x = off; x < w; x+=
stride){
354 for(i = 0; i < s->
height; i++){
355 for(x = 0; x < w; x++){