45 for(k = 0; (state->
N[Q] << k) < state->
A[Q]; k++);
47 map = !state->
near && !k && (2 * state->
B[Q] <= -state->
N[Q]);
51 if(err >= ((state->
range + 1) >> 1)) {
53 val = 2 *
FFABS(err) - 1 - map;
73 temp += state->
N[Q] >> 1;
74 for(k = 0; (state->
N[Q] << k) < temp; k++);
76 if(!k && err && (2 * state->
B[Q] < state->
N[Q]))
80 val = - (2 * err) - 1 - RItype + map;
82 val = 2 * err - RItype - map;
87 state->
A[Q] += (val + 1 - RItype) >> 1;
124 Ra = x ?
R(cur, x - stride) :
R(last, x);
126 Rc = x ?
R(last, x - stride) : last2;
127 Rd = (x >= w -
stride) ?
R(last, x) :
R(last, x + stride);
134 int RUNval, RItype,
run;
138 while(x < w && (
FFABS(
R(cur, x) - RUNval) <= state->
near)){
147 RItype = (
FFABS(Ra - Rb) <= state->
near);
148 pred = RItype ? Ra : Rb;
149 err =
R(cur, x) -
pred;
151 if(!RItype && Ra > Rb)
160 if(RItype || (Rb >= Ra))
168 if(err >= ((state->
range + 1) >> 1))
179 pred =
mid_pred(Ra, Ra + Rb - Rc, Rb);
184 pred = av_clip(pred - state->
C[context], 0, state->
maxval);
185 err = pred -
R(cur, x);
188 pred = av_clip(pred + state->
C[context], 0, state->
maxval);
189 err =
R(cur, x) -
pred;
213 memset(&state2, 0,
sizeof(
JLSState));
217 if(state->
T1 == state2.
T1 && state->
T2 == state2.
T2 && state->
T3 == state2.
T3 && state->
reset == state2.
reset)
237 uint8_t *buf2, *
zero, *cur, *last;
264 for(i = 1; i <= comps; i++) {
273 for(i = 1; i <= comps; i++) {
278 put_bits(&pb, 8, (comps > 1) ? 1 : 0);
296 for(i = 0; i < avctx->
height; i++) {
305 for(i = 0; i < avctx->
height; i++) {
307 t = *((uint16_t*)last);
313 int Rc[3] = {0, 0, 0};
315 width = avctx->
width * 3;
316 for(i = 0; i < avctx->
height; i++) {
317 for(j = 0; j < 3; j++) {
326 int Rc[3] = {0, 0, 0};
328 width = avctx->
width * 3;
329 for(i = 0; i < avctx->
height; i++) {
330 for(j = 2; j >= 0; j--) {