vp9_dsubexp.c 2.91 KB
Newer Older
1 2 3 4 5 6 7 8 9 10
/*
  Copyright (c) 2010 The WebM project authors. All Rights Reserved.
 *
 *  Use of this source code is governed by a BSD-style license
 *  that can be found in the LICENSE file in the root of the source
 *  tree. An additional intellectual property rights grant can be found
 *  in the file PATENTS.  All contributing project authors may
 *  be found in the AUTHORS file in the root of the source tree.
 */

11 12
#include <assert.h>

13 14 15 16 17 18 19 20 21 22 23
#include "vp9/common/vp9_entropy.h"

#include "vp9/decoder/vp9_dsubexp.h"

static int inv_recenter_nonneg(int v, int m) {
  if (v > 2 * m)
    return v;

  return v % 2 ? m - (v + 1) / 2 : m + v / 2;
}

24 25 26 27
static int decode_uniform(vp9_reader *r) {
  const int l = 8;
  const int m = (1 << l) - 191;
  const int v = vp9_read_literal(r, l - 1);
28 29 30 31
  return v < m ?  v : (v << 1) - m + vp9_read_bit(r);
}

static int inv_remap_prob(int v, int m) {
32
  static int inv_map_table[MAX_PROB] = {
33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49
      7,  20,  33,  46,  59,  72,  85,  98, 111, 124, 137, 150, 163, 176, 189,
    202, 215, 228, 241, 254,   1,   2,   3,   4,   5,   6,   8,   9,  10,  11,
     12,  13,  14,  15,  16,  17,  18,  19,  21,  22,  23,  24,  25,  26,  27,
     28,  29,  30,  31,  32,  34,  35,  36,  37,  38,  39,  40,  41,  42,  43,
     44,  45,  47,  48,  49,  50,  51,  52,  53,  54,  55,  56,  57,  58,  60,
     61,  62,  63,  64,  65,  66,  67,  68,  69,  70,  71,  73,  74,  75,  76,
     77,  78,  79,  80,  81,  82,  83,  84,  86,  87,  88,  89,  90,  91,  92,
     93,  94,  95,  96,  97,  99, 100, 101, 102, 103, 104, 105, 106, 107, 108,
    109, 110, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 125,
    126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 138, 139, 140, 141,
    142, 143, 144, 145, 146, 147, 148, 149, 151, 152, 153, 154, 155, 156, 157,
    158, 159, 160, 161, 162, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173,
    174, 175, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 190,
    191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 203, 204, 205, 206,
    207, 208, 209, 210, 211, 212, 213, 214, 216, 217, 218, 219, 220, 221, 222,
    223, 224, 225, 226, 227, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238,
    239, 240, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 253
50
  };
51
  assert(v < (int)(sizeof(inv_map_table) / sizeof(inv_map_table[0])));
52
  v = inv_map_table[v];
53
  m--;
54
  if ((m << 1) <= MAX_PROB) {
55
    return 1 + inv_recenter_nonneg(v, m);
56
  } else {
57
    return MAX_PROB - inv_recenter_nonneg(v, MAX_PROB - 1 - m);
58 59 60
  }
}

61 62 63 64 65 66 67 68
static int decode_term_subexp(vp9_reader *r) {
  if (!vp9_read_bit(r))
    return vp9_read_literal(r, 4);
  if (!vp9_read_bit(r))
    return vp9_read_literal(r, 4) + 16;
  if (!vp9_read_bit(r))
    return vp9_read_literal(r, 5) + 32;
  return decode_uniform(r) + 64;
69 70
}

71 72
void vp9_diff_update_prob(vp9_reader *r, vp9_prob* p) {
  if (vp9_read(r, DIFF_UPDATE_PROB)) {
73
    const int delp = decode_term_subexp(r);
74 75
    *p = (vp9_prob)inv_remap_prob(delp, *p);
  }
76
}