Logo Search packages:      
Sourcecode: schroedinger version File versions  Download package

schroarith.c

#ifdef HAVE_CONFIG_H
#include "config.h"
#endif

#include <string.h>

#define SCHRO_ARITH_DEFINE_INLINE

#include <schroedinger/schroarith.h>
#include <schroedinger/schrotables.h>
#include <schroedinger/schrodebug.h>
#include <orc/orc.h>

static const unsigned int next_list[] = {
  0,
  SCHRO_CTX_QUANTISER_CONT,
  0,
  0,
  SCHRO_CTX_ZP_F2,
  SCHRO_CTX_ZP_F2,
  SCHRO_CTX_ZP_F3,
  SCHRO_CTX_ZP_F4,
  SCHRO_CTX_ZP_F5,
  SCHRO_CTX_ZP_F6p,
  SCHRO_CTX_ZP_F6p,
  SCHRO_CTX_NP_F2,
  SCHRO_CTX_NP_F2,
  SCHRO_CTX_NP_F3,
  SCHRO_CTX_NP_F4,
  SCHRO_CTX_NP_F5,
  SCHRO_CTX_NP_F6p,
  SCHRO_CTX_NP_F6p,
  0,
  0,
  0,
  0,

  SCHRO_CTX_SB_F2,
  SCHRO_CTX_SB_F2,
  0,
  0,
  0,
  0,
  SCHRO_CTX_LUMA_DC_CONT_BIN2,
  SCHRO_CTX_LUMA_DC_CONT_BIN2,
  0,
  0,
  SCHRO_CTX_CHROMA1_DC_CONT_BIN2,
  SCHRO_CTX_CHROMA1_DC_CONT_BIN2,
  0,
  0,
  SCHRO_CTX_CHROMA2_DC_CONT_BIN2,
  SCHRO_CTX_CHROMA2_DC_CONT_BIN2,
  0,
  0,
  SCHRO_CTX_MV_REF1_H_CONT_BIN2,
  SCHRO_CTX_MV_REF1_H_CONT_BIN3,
  SCHRO_CTX_MV_REF1_H_CONT_BIN4,
  SCHRO_CTX_MV_REF1_H_CONT_BIN5,
  SCHRO_CTX_MV_REF1_H_CONT_BIN5,
  0,
  0,
  SCHRO_CTX_MV_REF1_V_CONT_BIN2,
  SCHRO_CTX_MV_REF1_V_CONT_BIN3,
  SCHRO_CTX_MV_REF1_V_CONT_BIN4,
  SCHRO_CTX_MV_REF1_V_CONT_BIN5,
  SCHRO_CTX_MV_REF1_V_CONT_BIN5,
  0,
  0,
  SCHRO_CTX_MV_REF2_H_CONT_BIN2,
  SCHRO_CTX_MV_REF2_H_CONT_BIN3,
  SCHRO_CTX_MV_REF2_H_CONT_BIN4,
  SCHRO_CTX_MV_REF2_H_CONT_BIN5,
  SCHRO_CTX_MV_REF2_H_CONT_BIN5,
  0,
  0,
  SCHRO_CTX_MV_REF2_V_CONT_BIN2,
  SCHRO_CTX_MV_REF2_V_CONT_BIN3,
  SCHRO_CTX_MV_REF2_V_CONT_BIN4,
  SCHRO_CTX_MV_REF2_V_CONT_BIN5,
  SCHRO_CTX_MV_REF2_V_CONT_BIN5,
  0,
  0,
  0,
};

static const uint16_t lut[256] = {
  //LUT corresponds to window = 16 @ p0=0.5 & 256 @ p=1.0
     0,    2,    5,    8,   11,   15,   20,   24,
    29,   35,   41,   47,   53,   60,   67,   74,
    82,   89,   97,  106,  114,  123,  132,  141,
   150,  160,  170,  180,  190,  201,  211,  222,
   233,  244,  256,  267,  279,  291,  303,  315,
   327,  340,  353,  366,  379,  392,  405,  419,
   433,  447,  461,  475,  489,  504,  518,  533,
   548,  563,  578,  593,  609,  624,  640,  656,
   672,  688,  705,  721,  738,  754,  771,  788,
   805,  822,  840,  857,  875,  892,  910,  928,
   946,  964,  983, 1001, 1020, 1038, 1057, 1076,
  1095, 1114, 1133, 1153, 1172, 1192, 1211, 1231,
  1251, 1271, 1291, 1311, 1332, 1352, 1373, 1393,
  1414, 1435, 1456, 1477, 1498, 1520, 1541, 1562,
  1584, 1606, 1628, 1649, 1671, 1694, 1716, 1738,
  1760, 1783, 1806, 1828, 1851, 1874, 1897, 1920,
  1935, 1942, 1949, 1955, 1961, 1968, 1974, 1980,
  1985, 1991, 1996, 2001, 2006, 2011, 2016, 2021,
  2025, 2029, 2033, 2037, 2040, 2044, 2047, 2050,
  2053, 2056, 2058, 2061, 2063, 2065, 2066, 2068,
  2069, 2070, 2071, 2072, 2072, 2072, 2072, 2072,
  2072, 2071, 2070, 2069, 2068, 2066, 2065, 2063,
  2060, 2058, 2055, 2052, 2049, 2045, 2042, 2038,
  2033, 2029, 2024, 2019, 2013, 2008, 2002, 1996,
  1989, 1982, 1975, 1968, 1960, 1952, 1943, 1934,
  1925, 1916, 1906, 1896, 1885, 1874, 1863, 1851,
  1839, 1827, 1814, 1800, 1786, 1772, 1757, 1742,
  1727, 1710, 1694, 1676, 1659, 1640, 1622, 1602,
  1582, 1561, 1540, 1518, 1495, 1471, 1447, 1422,
  1396, 1369, 1341, 1312, 1282, 1251, 1219, 1186,
  1151, 1114, 1077, 1037,  995,  952,  906,  857,
   805,  750,  690,  625,  553,  471,  376,  255
};

/* This is a copy of the above lookup-table, with the
   elements interleaved in a way that decreases the number
   of operations during decode. */
static const int16_t lut_interleaved[512] = {
    255,     0,   376,    -2,   471,    -5,   553,    -8,
    625,   -11,   690,   -15,   750,   -20,   805,   -24,
    857,   -29,   906,   -35,   952,   -41,   995,   -47,
   1037,   -53,  1077,   -60,  1114,   -67,  1151,   -74,
   1186,   -82,  1219,   -89,  1251,   -97,  1282,  -106,
   1312,  -114,  1341,  -123,  1369,  -132,  1396,  -141,
   1422,  -150,  1447,  -160,  1471,  -170,  1495,  -180,
   1518,  -190,  1540,  -201,  1561,  -211,  1582,  -222,
   1602,  -233,  1622,  -244,  1640,  -256,  1659,  -267,
   1676,  -279,  1694,  -291,  1710,  -303,  1727,  -315,
   1742,  -327,  1757,  -340,  1772,  -353,  1786,  -366,
   1800,  -379,  1814,  -392,  1827,  -405,  1839,  -419,
   1851,  -433,  1863,  -447,  1874,  -461,  1885,  -475,
   1896,  -489,  1906,  -504,  1916,  -518,  1925,  -533,
   1934,  -548,  1943,  -563,  1952,  -578,  1960,  -593,
   1968,  -609,  1975,  -624,  1982,  -640,  1989,  -656,
   1996,  -672,  2002,  -688,  2008,  -705,  2013,  -721,
   2019,  -738,  2024,  -754,  2029,  -771,  2033,  -788,
   2038,  -805,  2042,  -822,  2045,  -840,  2049,  -857,
   2052,  -875,  2055,  -892,  2058,  -910,  2060,  -928,
   2063,  -946,  2065,  -964,  2066,  -983,  2068, -1001,
   2069, -1020,  2070, -1038,  2071, -1057,  2072, -1076,
   2072, -1095,  2072, -1114,  2072, -1133,  2072, -1153,
   2072, -1172,  2071, -1192,  2070, -1211,  2069, -1231,
   2068, -1251,  2066, -1271,  2065, -1291,  2063, -1311,
   2061, -1332,  2058, -1352,  2056, -1373,  2053, -1393,
   2050, -1414,  2047, -1435,  2044, -1456,  2040, -1477,
   2037, -1498,  2033, -1520,  2029, -1541,  2025, -1562,
   2021, -1584,  2016, -1606,  2011, -1628,  2006, -1649,
   2001, -1671,  1996, -1694,  1991, -1716,  1985, -1738,
   1980, -1760,  1974, -1783,  1968, -1806,  1961, -1828,
   1955, -1851,  1949, -1874,  1942, -1897,  1935, -1920,
   1920, -1935,  1897, -1942,  1874, -1949,  1851, -1955,
   1828, -1961,  1806, -1968,  1783, -1974,  1760, -1980,
   1738, -1985,  1716, -1991,  1694, -1996,  1671, -2001,
   1649, -2006,  1628, -2011,  1606, -2016,  1584, -2021,
   1562, -2025,  1541, -2029,  1520, -2033,  1498, -2037,
   1477, -2040,  1456, -2044,  1435, -2047,  1414, -2050,
   1393, -2053,  1373, -2056,  1352, -2058,  1332, -2061,
   1311, -2063,  1291, -2065,  1271, -2066,  1251, -2068,
   1231, -2069,  1211, -2070,  1192, -2071,  1172, -2072,
   1153, -2072,  1133, -2072,  1114, -2072,  1095, -2072,
   1076, -2072,  1057, -2071,  1038, -2070,  1020, -2069,
   1001, -2068,   983, -2066,   964, -2065,   946, -2063,
    928, -2060,   910, -2058,   892, -2055,   875, -2052,
    857, -2049,   840, -2045,   822, -2042,   805, -2038,
    788, -2033,   771, -2029,   754, -2024,   738, -2019,
    721, -2013,   705, -2008,   688, -2002,   672, -1996,
    656, -1989,   640, -1982,   624, -1975,   609, -1968,
    593, -1960,   578, -1952,   563, -1943,   548, -1934,
    533, -1925,   518, -1916,   504, -1906,   489, -1896,
    475, -1885,   461, -1874,   447, -1863,   433, -1851,
    419, -1839,   405, -1827,   392, -1814,   379, -1800,
    366, -1786,   353, -1772,   340, -1757,   327, -1742,
    315, -1727,   303, -1710,   291, -1694,   279, -1676,
    267, -1659,   256, -1640,   244, -1622,   233, -1602,
    222, -1582,   211, -1561,   201, -1540,   190, -1518,
    180, -1495,   170, -1471,   160, -1447,   150, -1422,
    141, -1396,   132, -1369,   123, -1341,   114, -1312,
    106, -1282,    97, -1251,    89, -1219,    82, -1186,
     74, -1151,    67, -1114,    60, -1077,    53, -1037,
     47,  -995,    41,  -952,    35,  -906,    29,  -857,
     24,  -805,    20,  -750,    15,  -690,    11,  -625,
      8,  -553,     5,  -471,     2,  -376,     0,  -255
};

SchroArith *
schro_arith_new (void)
{
  SchroArith *arith;

  arith = schro_malloc (sizeof (*arith));

  return arith;
}

void
schro_arith_free (SchroArith * arith)
{
  schro_free (arith);
}

void
schro_arith_decode_init (SchroArith * arith, SchroBuffer * buffer)
{
  int i;
  int size;

  orc_memset (arith, 0, sizeof (SchroArith));
  arith->range[0] = 0;
  arith->range[1] = 0xffff0000;
  arith->range_size = arith->range[1] - arith->range[0];
  arith->code = 0;
  arith->cntr = 16;

  arith->buffer = buffer;

  size = arith->buffer->length;
  arith->dataptr = arith->buffer->data;
  arith->code = ((size > 0) ? arith->dataptr[0] : 0xff) << 24;
  arith->code |= ((size > 1) ? arith->dataptr[1] : 0xff) << 16;
  arith->code |= ((size > 2) ? arith->dataptr[2] : 0xff) << 8;
  arith->code |= ((size > 3) ? arith->dataptr[3] : 0xff);
  arith->offset = 3;

  for (i = 0; i < SCHRO_CTX_LAST; i++) {
    arith->contexts[i].next = next_list[i];
    arith->probabilities[i] = 0x8000;
  }

  orc_memcpy (arith->lut, (void *) lut_interleaved, 512 * sizeof (int16_t));
}

void
schro_arith_encode_init (SchroArith * arith, SchroBuffer * buffer)
{
  int i;

  orc_memset (arith, 0, sizeof (SchroArith));
  arith->range[0] = 0;
  arith->range[1] = 0xffff;
  arith->range_size = arith->range[1] - arith->range[0];
  arith->code = 0;

  arith->buffer = buffer;
  arith->offset = 0;
  arith->dataptr = arith->buffer->data;

  for (i = 0; i < SCHRO_CTX_LAST; i++) {
    arith->contexts[i].next = next_list[i];
    arith->probabilities[i] = 0x8000;
  }

  for (i = 0; i < 256; i++) {
    arith->lut[i] = lut[i];
    arith->lut[511 - i] = lut[255 - i];
  }
}

#ifdef unused
void
schro_arith_estimate_init (SchroArith * arith)
{
  int i;

  memset (arith, 0, sizeof (SchroArith));
  for (i = 0; i < SCHRO_CTX_LAST; i++) {
    arith->contexts[i].stat_range = 0xffff;
    arith->contexts[i].next = next_list[i];
    arith->probabilities[i] = 0x8000;
  }
}
#endif

void
schro_arith_decode_flush (SchroArith * arith)
{
  if (arith->cntr < 8) {
    arith->offset++;
  }
}

void
schro_arith_flush (SchroArith * arith)
{
  int extra_byte;
  int i;

  if (arith->cntr > 0) {
    extra_byte = TRUE;
  } else {
    extra_byte = FALSE;
  }

  for (i = 0; i < 16; i++) {
    if ((arith->range[0] | ((1 << (i + 1)) - 1)) > arith->range[1] - 1)
      break;
  }
  arith->range[0] |= ((1 << i) - 1);
//arith->range[0] += arith->range[1] - 1;

  while (arith->cntr < 8) {
    arith->range[0] <<= 1;
    arith->range[0] |= 1;
    arith->cntr++;
  }

  if (arith->range[0] >= (1 << 24)) {
    arith->dataptr[arith->offset - 1]++;
    while (arith->carry) {
      arith->dataptr[arith->offset] = 0x00;
      arith->carry--;
      arith->offset++;
    }
  } else {
    while (arith->carry) {
      arith->dataptr[arith->offset] = 0xff;
      arith->carry--;
      arith->offset++;
    }
  }

  arith->dataptr[arith->offset] = arith->range[0] >> 16;
  arith->offset++;
  arith->dataptr[arith->offset] = arith->range[0] >> 8;
  arith->offset++;
  if (extra_byte) {
    arith->dataptr[arith->offset] = arith->range[0] >> 0;
    arith->offset++;
  }
  while (arith->offset > 1 && arith->dataptr[arith->offset - 1] == 0xff) {
    arith->offset--;
  }
}


#ifndef SCHRO_ARITH_DEFINE_INLINE
#define faster
#ifdef faster
static int
__schro_arith_decode_bit (SchroArith * arith, unsigned int i)
{
  unsigned int range_x_prob;
  int value;
  int lut_index;

  range_x_prob = (arith->range[1] * arith->probabilities[i]) >> 16;
  lut_index = arith->probabilities[i] >> 8;

  value = (arith->code - arith->range[0] >= range_x_prob);
  arith->probabilities[i] += arith->lut[(value << 8) | lut_index];
  if (value) {
    arith->range[0] += range_x_prob;
    arith->range[1] -= range_x_prob;
  } else {
    arith->range[1] = range_x_prob;
  }

  while (arith->range[1] <= 0x4000) {
    arith->range[0] <<= 1;
    arith->range[1] <<= 1;

    arith->code <<= 1;
    arith->code |= arith->shift >> (7 - arith->cntr) & 1;

    if (!--arith->cntr) {
      arith->offset++;
      if (arith->offset < arith->buffer->length) {
        arith->shift = arith->dataptr[arith->offset];
      } else {
        arith->shift = 0xff;
      }
      arith->range[0] &= 0xffff;
      arith->code &= 0xffff;

      if (arith->code < arith->range[0]) {
        arith->code |= (1 << 16);
      }
      arith->cntr = 8;
    }
  }

  return value;
}
#else
static int
__schro_arith_decode_bit (SchroArith * arith, unsigned int i)
{
  unsigned int range;
  unsigned int probability0;
  unsigned int range_x_prob;
  unsigned int count;
  int value;

  probability0 = arith->probabilities[i];
  count = arith->code - arith->range[0];
  range = arith->range[1];
  range_x_prob = (range * probability0) >> 16;

  value = (count >= range_x_prob);
  if (value) {
    arith->range[0] = arith->range[0] + range_x_prob;
    arith->range[1] -= range_x_prob;
    arith->probabilities[i] -= lut[arith->probabilities[i] >> 8];
  } else {
    arith->range[1] = range_x_prob;
    arith->probabilities[i] += lut[255 - (arith->probabilities[i] >> 8)];
  }

  while (arith->range[1] <= 0x4000) {
    arith->range[0] <<= 1;
    arith->range[1] <<= 1;

    arith->code <<= 1;
    arith->code |= (arith->dataptr[arith->offset] >> (7 - arith->cntr)) & 1;

    if (!--arith->cntr) {
      arith->offset++;
      arith->range[0] &= 0xffff;
      arith->code &= 0xffff;

      if (arith->code < arith->range[0]) {
        arith->code |= (1 << 16);
      }
      arith->cntr = 8;
    }
  }

  return value;
}
#endif
int
_schro_arith_decode_bit (SchroArith * arith, unsigned int i)
{
  return __schro_arith_decode_bit (arith, i);
}
#endif

#ifndef SCHRO_ARITH_DEFINE_INLINE
void
_schro_arith_encode_bit (SchroArith * arith, int i, int value)
{
  unsigned int range;
  unsigned int probability0;
  unsigned int range_x_prob;

  probability0 = arith->probabilities[i];
  range = arith->range[1];
  range_x_prob = (range * probability0) >> 16;

  if (value) {
    arith->range[0] = arith->range[0] + range_x_prob;
    arith->range[1] -= range_x_prob;
    arith->probabilities[i] -= lut[arith->probabilities[i] >> 8];
  } else {
    arith->range[1] = range_x_prob;
    arith->probabilities[i] += lut[255 - (arith->probabilities[i] >> 8)];
  }

  while (arith->range[1] <= 0x4000) {
    arith->range[0] <<= 1;
    arith->range[1] <<= 1;
    arith->cntr++;

    if (arith->cntr == 8) {
      if (arith->range[0] < (1 << 24) &&
          (arith->range[0] + arith->range[1]) >= (1 << 24)) {
        arith->carry++;
      } else {
        if (arith->range[0] >= (1 << 24)) {
          arith->dataptr[arith->offset - 1]++;
          while (arith->carry) {
            arith->dataptr[arith->offset] = 0x00;
            arith->carry--;
            arith->offset++;
          }
        } else {
          while (arith->carry) {
            arith->dataptr[arith->offset] = 0xff;
            arith->carry--;
            arith->offset++;
          }
        }
        arith->dataptr[arith->offset] = arith->range[0] >> 16;
        arith->offset++;
      }

      arith->range[0] &= 0xffff;
      arith->cntr = 0;
    }
  }
}
#endif

#ifdef unused
void
schro_arith_estimate_bit (SchroArith * arith, int i, int value)
{
  unsigned int range;
  unsigned int probability0;
  unsigned int range_x_prob;

  probability0 = arith->probabilities[i];
  range = arith->contexts[i].stat_range;
  range_x_prob = (range * probability0) >> 16;

  if (value) {
    arith->contexts[i].stat_range -= range_x_prob;
    arith->probabilities[i] -= lut[arith->probabilities[i] >> 8];
    arith->contexts[i].ones++;
  } else {
    arith->contexts[i].stat_range = range_x_prob;
    arith->probabilities[i] += lut[255 - (arith->probabilities[i] >> 8)];
  }
  arith->contexts[i].n_symbols++;

  while (arith->contexts[i].stat_range <= 0x4000) {
    arith->contexts[i].stat_range <<= 1;
    arith->contexts[i].n_bits++;
  }
}
#endif

#ifndef SCHRO_ARITH_DEFINE_INLINE
static int
maxbit (unsigned int x)
{
  int i;
  for (i = 0; x; i++) {
    x >>= 1;
  }
  return i;
}

void
_schro_arith_encode_uint (SchroArith * arith, int cont_context,
    int value_context, int value)
{
  int i;
  int n_bits;

  value++;
  n_bits = maxbit (value);
  for (i = 0; i < n_bits - 1; i++) {
    _schro_arith_encode_bit (arith, cont_context, 0);
    _schro_arith_encode_bit (arith, value_context,
        (value >> (n_bits - 2 - i)) & 1);
    cont_context = arith->contexts[cont_context].next;
  }
  _schro_arith_encode_bit (arith, cont_context, 1);
}

void
_schro_arith_encode_sint (SchroArith * arith, int cont_context,
    int value_context, int sign_context, int value)
{
  int sign;

  if (value < 0) {
    sign = 1;
    value = -value;
  } else {
    sign = 0;
  }
  _schro_arith_encode_uint (arith, cont_context, value_context, value);
  if (value) {
    _schro_arith_encode_bit (arith, sign_context, sign);
  }
}
#endif

#ifdef unused
void
schro_arith_estimate_uint (SchroArith * arith, int cont_context,
    int value_context, int value)
{
  int i;
  int n_bits;

  value++;
  n_bits = maxbit (value);
  for (i = 0; i < n_bits - 1; i++) {
    schro_arith_estimate_bit (arith, cont_context, 0);
    schro_arith_estimate_bit (arith, value_context,
        (value >> (n_bits - 2 - i)) & 1);
    cont_context = arith->contexts[cont_context].next;
  }
  schro_arith_estimate_bit (arith, cont_context, 1);
}
#endif

#ifdef unused
void
schro_arith_estimate_sint (SchroArith * arith, int cont_context,
    int value_context, int sign_context, int value)
{
  int sign;

  if (value < 0) {
    sign = 1;
    value = -value;
  } else {
    sign = 0;
  }
  schro_arith_estimate_uint (arith, cont_context, value_context, value);
  if (value) {
    schro_arith_estimate_bit (arith, sign_context, sign);
  }
}
#endif

#ifndef SCHRO_ARITH_DEFINE_INLINE
int
_schro_arith_decode_uint (SchroArith * arith, unsigned int cont_context,
    unsigned int value_context)
{
  unsigned int bits = 1;
  int count = 0;

  while (!__schro_arith_decode_bit (arith, cont_context)) {
    bits <<= 1;
    bits |= __schro_arith_decode_bit (arith, value_context);
    cont_context = arith->contexts[cont_context].next;
    count++;

    /* FIXME being careful */
    if (count == 30)
      break;
  }
  return bits - 1;
}
#endif

int
_schro_arith_decode_sint (SchroArith * arith, unsigned int cont_context,
    unsigned int value_context, unsigned int sign_context)
{
  unsigned int bits = 1;
  int count = 0;
  int value;

  while (!_schro_arith_decode_bit (arith, cont_context)) {
    bits <<= 1;
    bits |= _schro_arith_decode_bit (arith, value_context);
    cont_context = arith->contexts[cont_context].next;
    count++;

    /* FIXME being careful */
    if (count == 30)
      break;
  }
  value = bits - 1;

  if (value) {
    if (_schro_arith_decode_bit (arith, sign_context)) {
      value = -value;
    }
  }

  return value;
}

/* wrappers */

void
schro_arith_encode_bit (SchroArith * arith, int i, int value)
{
  _schro_arith_encode_bit (arith, i, value);
}

void
schro_arith_encode_uint (SchroArith * arith, int cont_context,
    int value_context, int value)
{
  _schro_arith_encode_uint (arith, cont_context, value_context, value);
}

void
schro_arith_encode_sint (SchroArith * arith, int cont_context,
    int value_context, int sign_context, int value)
{
  _schro_arith_encode_sint (arith, cont_context, value_context,
      sign_context, value);
}

int
schro_arith_decode_bit (SchroArith * arith, unsigned int context)
{
  return _schro_arith_decode_bit (arith, context);
}

int
schro_arith_decode_uint (SchroArith * arith, unsigned int cont_context,
    unsigned int value_context)
{
  return _schro_arith_decode_uint (arith, cont_context, value_context);
}

int
schro_arith_decode_sint (SchroArith * arith, unsigned int cont_context,
    unsigned int value_context, unsigned int sign_context)
{
  return _schro_arith_decode_sint (arith, cont_context,
      value_context, sign_context);
}

Generated by  Doxygen 1.6.0   Back to index