/*
* Copyright (c) 2001-2016, Alliance for Open Media. All rights reserved
*
* This source code is subject to the terms of the BSD 2 Clause License and
* the Alliance for Open Media Patent License 1.0. If the BSD 2 Clause License
* was not distributed with this source code in the LICENSE file, you can
* obtain it at www.aomedia.org/license/software. If the Alliance for Open
* Media Patent License 1.0 was not distributed with this source code in the
* PATENTS file, you can obtain it at www.aomedia.org/license/patent.
*/
/* clang-format off */
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif
#include
#include "aom_dsp/entdec.h"
#include "av1/common/generic_code.h"
#include "av1/common/odintrin.h"
#include "pvq_decoder.h"
/** Decodes a value from 0 to N-1 (with N up to 16) based on a cdf and adapts
* the cdf accordingly.
*
* @param [in,out] enc range encoder
* @param [in,out] cdf CDF of the variable (Q15)
* @param [in] n number of values possible
* @param [in,out] count number of symbols encoded with that cdf so far
* @param [in] rate adaptation rate shift (smaller is faster)
* @return decoded variable
*/
int od_decode_cdf_adapt_q15_(od_ec_dec *ec, uint16_t *cdf, int n,
int *count, int rate OD_ACC_STR) {
int val;
int i;
if (*count == 0) {
int ft;
ft = cdf[n - 1];
for (i = 0; i < n; i++) {
cdf[i] = cdf[i]*32768/ft;
}
}
val = od_ec_decode_cdf_q15(ec, cdf, n);
aom_cdf_adapt_q15(val, cdf, n, count, rate);
return val;
}
/** Decodes a value from 0 to N-1 (with N up to 16) based on a cdf and adapts
* the cdf accordingly.
*
* @param [in,out] enc range encoder
* @param [in] cdf CDF of the variable (Q15)
* @param [in] n number of values possible
* @param [in] increment adaptation speed (Q15)
*
* @retval decoded variable
*/
int od_decode_cdf_adapt_(od_ec_dec *ec, uint16_t *cdf, int n,
int increment OD_ACC_STR) {
int i;
int val;
val = od_ec_decode_cdf_unscaled(ec, cdf, n);
if (cdf[n-1] + increment > 32767) {
for (i = 0; i < n; i++) {
/* Second term ensures that the pdf is non-null */
cdf[i] = (cdf[i] >> 1) + i + 1;
}
}
for (i = val; i < n; i++) cdf[i] += increment;
return val;
}
/** Encodes a random variable using a "generic" model, assuming that the
* distribution is one-sided (zero and up), has a single mode, and decays
* exponentially past the model.
*
* @param [in,out] dec range decoder
* @param [in,out] model generic probability model
* @param [in] x variable being encoded
* @param [in,out] ExQ16 expectation of x (adapted)
* @param [in] integration integration period of ExQ16 (leaky average over
* 1<> 1);
/* Choose the cdf to use: we have two per "octave" of ExQ16. */
id = OD_MINI(GENERIC_TABLES - 1, lg_q1);
cdf = model->cdf[id];
ms = (max + (1 << shift >> 1)) >> shift;
if (max == -1) xs = od_ec_decode_cdf_unscaled(dec, cdf, 16);
else xs = od_ec_decode_cdf_unscaled(dec, cdf, OD_MINI(ms + 1, 16));
if (xs == 15) {
int e;
unsigned decay;
/* Estimate decay based on the assumption that the distribution is close
to Laplacian for large values. We should probably have an adaptive
estimate instead. Note: The 2* is a kludge that's not fully understood
yet. */
OD_ASSERT(*ex_q16 < INT_MAX >> 1);
e = ((2**ex_q16 >> 8) + (1 << shift >> 1)) >> shift;
decay = OD_MAXI(2, OD_MINI(254, 256*e/(e + 256)));
xs += laplace_decode_special(dec, decay, (max == -1) ? -1 : ms - 15, acc_str);
}
if (shift != 0) {
int special;
/* Because of the rounding, there's only half the number of possibilities
for xs=0 */
special = xs == 0;
if (shift - special > 0) lsb = od_ec_dec_bits(dec, shift - special, acc_str);
lsb -= !special << (shift - 1);
}
x = (xs << shift) + lsb;
generic_model_update(model, ex_q16, x, xs, id, integration);
OD_LOG((OD_LOG_ENTROPY_CODER, OD_LOG_DEBUG,
"dec: %d %d %d %d %d %x", *ex_q16, x, shift, id, xs, dec->rng));
return x;
}