uint32_t   *codebook;
const uint32_t *codebook;
static int svq1_decode_block_non_intra (bit_buffer_t *bitbuf, uint8_t *pixels, int pitch ) {  uint32_t    bit_cache;  vlc_code_t *vlc;  uint8_t    *list[63];  uint32_t   *dst;  uint32_t   *codebook;  int	      entries[6];  int	      i, j, m, n;  int	      mean, stages;  int	      x, y, width, height, level;  uint32_t    n1, n2, n3, n4;  /* initialize list for breadth first processing of vectors */  list[0] = pixels;  /* recursively process vector */  for (i=0, m=1, n=1, level=5; i < n; i++) {    SVQ1_PROCESS_VECTOR();    /* destination address and vector size */    dst = (uint32_t *) list[i];    width = 1 << ((4 + level) /2);    height = 1 << ((3 + level) /2);    /* get number of stages (-1 skips vector, 0 for mean only) */    bit_cache = get_bit_cache (bitbuf);    vlc = &svq1_inter_vector_tables[level][bit_cache >> (32 - 6)];    /* flush bits */    stages	    = vlc->value;    skip_bits(bitbuf,vlc->length);    if (stages == -1) continue;	/* skip vector */    if ((stages > 0) && (level >= 4)) {#ifdef DEBUG_SVQ1    printf("Error (svq1_decode_block_non_intra): invalid vector: stages=%i level=%i\n",stages,level);#endif      return -1;	/* invalid vector */    }    /* get mean value for vector */    bit_cache = get_bit_cache (bitbuf);    if (bit_cache >= 0x0B000000)	vlc = &svq1_inter_mean_table_0[(bit_cache >> (32 - 8)) - 11];    else if (bit_cache >= 0x01200000)	vlc = &svq1_inter_mean_table_1[(bit_cache >> (32 - 12)) - 18];    else if (bit_cache >= 0x002E0000) 	vlc = &svq1_inter_mean_table_2[(bit_cache >> (32 - 15)) - 23];    else if (bit_cache >= 0x00094000)	vlc = &svq1_inter_mean_table_3[(bit_cache >> (32 - 18)) - 37];    else if (bit_cache >= 0x00049000)	vlc = &svq1_inter_mean_table_4[(bit_cache >> (32 - 20)) - 73];    else	vlc = &svq1_inter_mean_table_5[bit_cache >> (32 - 22)];    /* flush bits */    mean	    = vlc->value;    skip_bits(bitbuf,vlc->length);    SVQ1_CALC_CODEBOOK_ENTRIES(svq1_inter_codebooks);    SVQ1_DO_CODEBOOK_NONINTRA()  }  return 0;}