Coverage Report

Created: 2024-09-06 07:53

/src/libvpx/vp8/common/entropy.c
Line
Count
Source
1
/*
2
 *  Copyright (c) 2010 The WebM project authors. All Rights Reserved.
3
 *
4
 *  Use of this source code is governed by a BSD-style license
5
 *  that can be found in the LICENSE file in the root of the source
6
 *  tree. An additional intellectual property rights grant can be found
7
 *  in the file PATENTS.  All contributing project authors may
8
 *  be found in the AUTHORS file in the root of the source tree.
9
 */
10
11
#include "entropy.h"
12
#include "blockd.h"
13
#include "onyxc_int.h"
14
#include "vpx_mem/vpx_mem.h"
15
16
#include "coefupdateprobs.h"
17
18
DECLARE_ALIGNED(16, const unsigned char, vp8_norm[256]) = {
19
  0, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
20
  3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
21
  2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
22
  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
23
  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0,
24
  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
25
  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
26
  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
27
  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
28
  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
29
};
30
31
DECLARE_ALIGNED(16, const unsigned char,
32
                vp8_coef_bands[16]) = { 0, 1, 2, 3, 6, 4, 5, 6,
33
                                        6, 6, 6, 6, 6, 6, 6, 7 };
34
35
DECLARE_ALIGNED(16, const unsigned char,
36
                vp8_prev_token_class[MAX_ENTROPY_TOKENS]) = {
37
  0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0
38
};
39
40
DECLARE_ALIGNED(16, const int, vp8_default_zig_zag1d[16]) = {
41
  0, 1, 4, 8, 5, 2, 3, 6, 9, 12, 13, 10, 7, 11, 14, 15,
42
};
43
44
DECLARE_ALIGNED(16, const short,
45
                vp8_default_inv_zig_zag[16]) = { 1, 2, 6,  7,  3,  5,  8,  13,
46
                                                 4, 9, 12, 14, 10, 11, 15, 16 };
47
48
/* vp8_default_zig_zag_mask generated with:
49
50
    void vp8_init_scan_order_mask()
51
    {
52
        int i;
53
54
        for (i = 0; i < 16; ++i)
55
        {
56
            vp8_default_zig_zag_mask[vp8_default_zig_zag1d[i]] = 1 << i;
57
        }
58
59
    }
60
*/
61
DECLARE_ALIGNED(16, const short, vp8_default_zig_zag_mask[16]) = {
62
  1, 2, 32, 64, 4, 16, 128, 4096, 8, 256, 2048, 8192, 512, 1024, 16384, -32768
63
};
64
65
const int vp8_mb_feature_data_bits[MB_LVL_MAX] = { 7, 6 };
66
67
/* Array indices are identical to previously-existing CONTEXT_NODE indices */
68
/* corresponding _CONTEXT_NODEs */
69
/* clang-format off */
70
const vp8_tree_index vp8_coef_tree[22] = {
71
  -DCT_EOB_TOKEN, 2,                       /* 0 = EOB */
72
  -ZERO_TOKEN, 4,                          /* 1 = ZERO */
73
  -ONE_TOKEN, 6,                           /* 2 = ONE */
74
  8, 12,                                   /* 3 = LOW_VAL */
75
  -TWO_TOKEN, 10,                          /* 4 = TWO */
76
  -THREE_TOKEN, -FOUR_TOKEN,               /* 5 = THREE */
77
  14, 16,                                  /* 6 = HIGH_LOW */
78
  -DCT_VAL_CATEGORY1, -DCT_VAL_CATEGORY2,  /* 7 = CAT_ONE */
79
  18, 20,                                  /* 8 = CAT_THREEFOUR */
80
  -DCT_VAL_CATEGORY3, -DCT_VAL_CATEGORY4,  /* 9 = CAT_THREE */
81
  -DCT_VAL_CATEGORY5, -DCT_VAL_CATEGORY6   /* 10 = CAT_FIVE */
82
};
83
/* clang-format on */
84
85
/* vp8_coef_encodings generated with:
86
    vp8_tokens_from_tree(vp8_coef_encodings, vp8_coef_tree);
87
*/
88
vp8_token vp8_coef_encodings[MAX_ENTROPY_TOKENS] = {
89
  { 2, 2 },  { 6, 3 },   { 28, 5 },  { 58, 6 },  { 59, 6 },  { 60, 6 },
90
  { 61, 6 }, { 124, 7 }, { 125, 7 }, { 126, 7 }, { 127, 7 }, { 0, 1 }
91
};
92
93
/* Trees for extra bits.  Probabilities are constant and
94
   do not depend on previously encoded bits */
95
96
static const vp8_prob Pcat1[] = { 159 };
97
static const vp8_prob Pcat2[] = { 165, 145 };
98
static const vp8_prob Pcat3[] = { 173, 148, 140 };
99
static const vp8_prob Pcat4[] = { 176, 155, 140, 135 };
100
static const vp8_prob Pcat5[] = { 180, 157, 141, 134, 130 };
101
static const vp8_prob Pcat6[] = { 254, 254, 243, 230, 196, 177,
102
                                  153, 140, 133, 130, 129 };
103
104
/* tree index tables generated with:
105
106
    void init_bit_tree(vp8_tree_index *p, int n) {
107
      int i = 0;
108
109
      while (++i < n) {
110
          p[0] = p[1] = i << 1;
111
          p += 2;
112
      }
113
114
      p[0] = p[1] = 0;
115
    }
116
117
    void init_bit_trees(void) {
118
      init_bit_tree(cat1, 1);
119
      init_bit_tree(cat2, 2);
120
      init_bit_tree(cat3, 3);
121
      init_bit_tree(cat4, 4);
122
      init_bit_tree(cat5, 5);
123
      init_bit_tree(cat6, 11);
124
    }
125
*/
126
127
static const vp8_tree_index cat1[2] = { 0, 0 };
128
static const vp8_tree_index cat2[4] = { 2, 2, 0, 0 };
129
static const vp8_tree_index cat3[6] = { 2, 2, 4, 4, 0, 0 };
130
static const vp8_tree_index cat4[8] = { 2, 2, 4, 4, 6, 6, 0, 0 };
131
static const vp8_tree_index cat5[10] = { 2, 2, 4, 4, 6, 6, 8, 8, 0, 0 };
132
static const vp8_tree_index cat6[22] = { 2,  2,  4,  4,  6,  6,  8,  8,
133
                                         10, 10, 12, 12, 14, 14, 16, 16,
134
                                         18, 18, 20, 20, 0,  0 };
135
136
const vp8_extra_bit_struct vp8_extra_bits[12] = {
137
  { 0, 0, 0, 0 },         { 0, 0, 0, 1 },          { 0, 0, 0, 2 },
138
  { 0, 0, 0, 3 },         { 0, 0, 0, 4 },          { cat1, Pcat1, 1, 5 },
139
  { cat2, Pcat2, 2, 7 },  { cat3, Pcat3, 3, 11 },  { cat4, Pcat4, 4, 19 },
140
  { cat5, Pcat5, 5, 35 }, { cat6, Pcat6, 11, 67 }, { 0, 0, 0, 0 }
141
};
142
143
#include "default_coef_probs.h"
144
145
18.6k
void vp8_default_coef_probs(VP8_COMMON *pc) {
146
18.6k
  memcpy(pc->fc.coef_probs, default_coef_probs, sizeof(default_coef_probs));
147
18.6k
}