64     while (r->
sum > val && cnt < 9) {
 
  103         v = ((v >> 1) + r->
lossy) ^ -(v & 1);
 
  123     c = data[-stride - step];
 
  154     for (i = 1; i < 
width; i++) {
 
  156         data[i * step] = data[i * step - step] + 
val;
 
  159     for (j = 1; j < 
height; j++) {
 
  162         data[0] = data[-stride] + 
val;
 
  164         for (i = 1; i < 
width; i++) {
 
  178     for (y=1; y<
height; y++) {
 
  180             memmove(data + y*stride,
 
  181                     data + y*(stride + step),
 
  184                 memmove(data + y*stride + step*(width-y),
 
  192                         void *
data, 
int *got_frame,
 
  197     int buf_size          = avpkt->
size;
 
  205 #define ADVANCE_BY_DECODED do { \ 
  206     if (decoded < 0 || decoded >= buf_size) goto buf_too_small; \ 
  207     buf += decoded; buf_size -= decoded; \ 
  239         if (avctx->
width & 1)
 
  260     if (decoded < 0 || decoded > buf_size)
 
  266     return avpkt->
size - buf_size;