63 lines
1.9 KiB
C
63 lines
1.9 KiB
C
/*
|
|
* Copyright (c) 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.
|
|
*/
|
|
|
|
#ifndef AV1_ENCODER_TREEWRITER_H_
|
|
#define AV1_ENCODER_TREEWRITER_H_
|
|
|
|
#ifdef AV1_FORCE_AOMBOOL_TREEWRITER
|
|
#include "aom_dsp/dkboolwriter.h"
|
|
#define tree_writer aom_dk_writer
|
|
#define tree_bit_write aom_dk_write
|
|
#else
|
|
#include "aom_dsp/bitwriter.h"
|
|
#define tree_writer aom_writer
|
|
#define tree_bit_write aom_write
|
|
#endif
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
void av1_tree_probs_from_distribution(aom_tree tree,
|
|
unsigned int branch_ct[/* n - 1 */][2],
|
|
const unsigned int num_events[/* n */]);
|
|
|
|
struct av1_token {
|
|
int value;
|
|
int len;
|
|
};
|
|
|
|
void av1_tokens_from_tree(struct av1_token *, const aom_tree_index *);
|
|
|
|
static INLINE void av1_write_tree(tree_writer *w, const aom_tree_index *tree,
|
|
const aom_prob *probs, int bits, int len,
|
|
aom_tree_index i) {
|
|
do {
|
|
const int bit = (bits >> --len) & 1;
|
|
tree_bit_write(w, bit, probs[i >> 1]);
|
|
i = tree[i + bit];
|
|
} while (len);
|
|
}
|
|
|
|
static INLINE void av1_write_token(tree_writer *w, const aom_tree_index *tree,
|
|
const aom_prob *probs,
|
|
const struct av1_token *token) {
|
|
av1_write_tree(w, tree, probs, token->value, token->len, 0);
|
|
}
|
|
|
|
#undef tree_writer
|
|
#undef tree_bit_write
|
|
#ifdef __cplusplus
|
|
} // extern "C"
|
|
#endif
|
|
|
|
#endif // AV1_ENCODER_TREEWRITER_H_
|