mirror of
https://gitlab.winehq.org/wine/wine-gecko.git
synced 2024-09-13 09:24:08 -07:00
31fca20085
This updates our in-tree copy of libvpx to the v1.3.0 git tag (2e88f2f2ec777259bda1714e72f1ecd2519bceb5) libvpx 1.3.0 adds support for VP9. VP9 support is built but not yet exposed with this commit. Our update.sh script is replaced with update.py that can update the build system to a given git commit. - checkout out upstream git - create platform dependend config files - add/remove changed libvpx files - update moz.build - warn about new build categories in libvpx
248 lines
9.6 KiB
C
248 lines
9.6 KiB
C
/*
|
|
* 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.
|
|
*/
|
|
|
|
|
|
#include "vp9/common/vp9_onyxc_int.h"
|
|
#include "vp9/common/vp9_entropymv.h"
|
|
|
|
#define MV_COUNT_SAT 20
|
|
#define MV_MAX_UPDATE_FACTOR 128
|
|
|
|
/* Integer pel reference mv threshold for use of high-precision 1/8 mv */
|
|
#define COMPANDED_MVREF_THRESH 8
|
|
|
|
const vp9_tree_index vp9_mv_joint_tree[TREE_SIZE(MV_JOINTS)] = {
|
|
-MV_JOINT_ZERO, 2,
|
|
-MV_JOINT_HNZVZ, 4,
|
|
-MV_JOINT_HZVNZ, -MV_JOINT_HNZVNZ
|
|
};
|
|
struct vp9_token vp9_mv_joint_encodings[MV_JOINTS];
|
|
|
|
const vp9_tree_index vp9_mv_class_tree[TREE_SIZE(MV_CLASSES)] = {
|
|
-MV_CLASS_0, 2,
|
|
-MV_CLASS_1, 4,
|
|
6, 8,
|
|
-MV_CLASS_2, -MV_CLASS_3,
|
|
10, 12,
|
|
-MV_CLASS_4, -MV_CLASS_5,
|
|
-MV_CLASS_6, 14,
|
|
16, 18,
|
|
-MV_CLASS_7, -MV_CLASS_8,
|
|
-MV_CLASS_9, -MV_CLASS_10,
|
|
};
|
|
struct vp9_token vp9_mv_class_encodings[MV_CLASSES];
|
|
|
|
const vp9_tree_index vp9_mv_class0_tree[TREE_SIZE(CLASS0_SIZE)] = {
|
|
-0, -1,
|
|
};
|
|
struct vp9_token vp9_mv_class0_encodings[CLASS0_SIZE];
|
|
|
|
const vp9_tree_index vp9_mv_fp_tree[TREE_SIZE(4)] = {
|
|
-0, 2,
|
|
-1, 4,
|
|
-2, -3
|
|
};
|
|
struct vp9_token vp9_mv_fp_encodings[4];
|
|
|
|
static const nmv_context default_nmv_context = {
|
|
{32, 64, 96},
|
|
{ // NOLINT
|
|
{ /* vert component */ // NOLINT
|
|
128, /* sign */
|
|
{224, 144, 192, 168, 192, 176, 192, 198, 198, 245}, /* class */
|
|
{216}, /* class0 */
|
|
{136, 140, 148, 160, 176, 192, 224, 234, 234, 240}, /* bits */
|
|
{{128, 128, 64}, {96, 112, 64}}, /* class0_fp */
|
|
{64, 96, 64}, /* fp */
|
|
160, /* class0_hp bit */
|
|
128, /* hp */
|
|
},
|
|
{ /* hor component */ // NOLINT
|
|
128, /* sign */
|
|
{216, 128, 176, 160, 176, 176, 192, 198, 198, 208}, /* class */
|
|
{208}, /* class0 */
|
|
{136, 140, 148, 160, 176, 192, 224, 234, 234, 240}, /* bits */
|
|
{{128, 128, 64}, {96, 112, 64}}, /* class0_fp */
|
|
{64, 96, 64}, /* fp */
|
|
160, /* class0_hp bit */
|
|
128, /* hp */
|
|
}
|
|
},
|
|
};
|
|
|
|
#define mv_class_base(c) ((c) ? (CLASS0_SIZE << (c + 2)) : 0)
|
|
|
|
static const uint8_t log_in_base_2[] = {
|
|
0, 0, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4,
|
|
4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
|
|
5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6,
|
|
6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
|
|
6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
|
|
6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8,
|
|
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
|
|
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
|
|
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
|
|
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
|
|
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
|
|
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
|
|
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
|
|
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
|
|
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
|
|
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
|
|
8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
|
|
9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
|
|
9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
|
|
9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
|
|
9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
|
|
9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
|
|
9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
|
|
9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
|
|
9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
|
|
9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
|
|
9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
|
|
9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
|
|
9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
|
|
9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
|
|
9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
|
|
9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
|
|
9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
|
|
9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
|
|
9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
|
|
9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
|
|
9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
|
|
9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10
|
|
};
|
|
|
|
MV_CLASS_TYPE vp9_get_mv_class(int z, int *offset) {
|
|
MV_CLASS_TYPE c = MV_CLASS_0;
|
|
if (z >= CLASS0_SIZE * 4096)
|
|
c = MV_CLASS_10;
|
|
else
|
|
c = log_in_base_2[z >> 3];
|
|
|
|
if (offset)
|
|
*offset = z - mv_class_base(c);
|
|
return c;
|
|
}
|
|
|
|
int vp9_use_mv_hp(const MV *ref) {
|
|
return (abs(ref->row) >> 3) < COMPANDED_MVREF_THRESH &&
|
|
(abs(ref->col) >> 3) < COMPANDED_MVREF_THRESH;
|
|
}
|
|
|
|
int vp9_get_mv_mag(MV_CLASS_TYPE c, int offset) {
|
|
return mv_class_base(c) + offset;
|
|
}
|
|
|
|
static void inc_mv_component(int v, nmv_component_counts *comp_counts,
|
|
int incr, int usehp) {
|
|
int s, z, c, o, d, e, f;
|
|
assert(v != 0); /* should not be zero */
|
|
s = v < 0;
|
|
comp_counts->sign[s] += incr;
|
|
z = (s ? -v : v) - 1; /* magnitude - 1 */
|
|
|
|
c = vp9_get_mv_class(z, &o);
|
|
comp_counts->classes[c] += incr;
|
|
|
|
d = (o >> 3); /* int mv data */
|
|
f = (o >> 1) & 3; /* fractional pel mv data */
|
|
e = (o & 1); /* high precision mv data */
|
|
|
|
if (c == MV_CLASS_0) {
|
|
comp_counts->class0[d] += incr;
|
|
comp_counts->class0_fp[d][f] += incr;
|
|
comp_counts->class0_hp[e] += usehp * incr;
|
|
} else {
|
|
int i;
|
|
int b = c + CLASS0_BITS - 1; // number of bits
|
|
for (i = 0; i < b; ++i)
|
|
comp_counts->bits[i][((d >> i) & 1)] += incr;
|
|
comp_counts->fp[f] += incr;
|
|
comp_counts->hp[e] += usehp * incr;
|
|
}
|
|
}
|
|
|
|
void vp9_inc_mv(const MV *mv, nmv_context_counts *counts) {
|
|
if (counts != NULL) {
|
|
const MV_JOINT_TYPE j = vp9_get_mv_joint(mv);
|
|
++counts->joints[j];
|
|
|
|
if (mv_joint_vertical(j)) {
|
|
inc_mv_component(mv->row, &counts->comps[0], 1, 1);
|
|
}
|
|
|
|
if (mv_joint_horizontal(j)) {
|
|
inc_mv_component(mv->col, &counts->comps[1], 1, 1);
|
|
}
|
|
}
|
|
}
|
|
|
|
static vp9_prob adapt_prob(vp9_prob prep, const unsigned int ct[2]) {
|
|
return merge_probs(prep, ct, MV_COUNT_SAT, MV_MAX_UPDATE_FACTOR);
|
|
}
|
|
|
|
static void adapt_probs(const vp9_tree_index *tree, const vp9_prob *pre_probs,
|
|
const unsigned int *counts, vp9_prob *probs) {
|
|
tree_merge_probs(tree, pre_probs, counts, MV_COUNT_SAT, MV_MAX_UPDATE_FACTOR,
|
|
probs);
|
|
}
|
|
|
|
void vp9_adapt_mv_probs(VP9_COMMON *cm, int allow_hp) {
|
|
int i, j;
|
|
|
|
nmv_context *fc = &cm->fc.nmvc;
|
|
const nmv_context *pre_fc = &cm->frame_contexts[cm->frame_context_idx].nmvc;
|
|
const nmv_context_counts *counts = &cm->counts.mv;
|
|
|
|
adapt_probs(vp9_mv_joint_tree, pre_fc->joints, counts->joints, fc->joints);
|
|
|
|
for (i = 0; i < 2; ++i) {
|
|
nmv_component *comp = &fc->comps[i];
|
|
const nmv_component *pre_comp = &pre_fc->comps[i];
|
|
const nmv_component_counts *c = &counts->comps[i];
|
|
|
|
comp->sign = adapt_prob(pre_comp->sign, c->sign);
|
|
adapt_probs(vp9_mv_class_tree, pre_comp->classes, c->classes,
|
|
comp->classes);
|
|
adapt_probs(vp9_mv_class0_tree, pre_comp->class0, c->class0, comp->class0);
|
|
|
|
for (j = 0; j < MV_OFFSET_BITS; ++j)
|
|
comp->bits[j] = adapt_prob(pre_comp->bits[j], c->bits[j]);
|
|
|
|
for (j = 0; j < CLASS0_SIZE; ++j)
|
|
adapt_probs(vp9_mv_fp_tree, pre_comp->class0_fp[j], c->class0_fp[j],
|
|
comp->class0_fp[j]);
|
|
|
|
adapt_probs(vp9_mv_fp_tree, pre_comp->fp, c->fp, comp->fp);
|
|
|
|
if (allow_hp) {
|
|
comp->class0_hp = adapt_prob(pre_comp->class0_hp, c->class0_hp);
|
|
comp->hp = adapt_prob(pre_comp->hp, c->hp);
|
|
}
|
|
}
|
|
}
|
|
|
|
void vp9_entropy_mv_init() {
|
|
vp9_tokens_from_tree(vp9_mv_joint_encodings, vp9_mv_joint_tree);
|
|
vp9_tokens_from_tree(vp9_mv_class_encodings, vp9_mv_class_tree);
|
|
vp9_tokens_from_tree(vp9_mv_class0_encodings, vp9_mv_class0_tree);
|
|
vp9_tokens_from_tree(vp9_mv_fp_encodings, vp9_mv_fp_tree);
|
|
}
|
|
|
|
void vp9_init_mv_probs(VP9_COMMON *cm) {
|
|
cm->fc.nmvc = default_nmv_context;
|
|
}
|