2010-05-18 17:58:33 +02:00
|
|
|
/*
|
2010-09-09 14:16:39 +02:00
|
|
|
* Copyright (c) 2010 The WebM project authors. All Rights Reserved.
|
2010-05-18 17:58:33 +02:00
|
|
|
*
|
2010-06-18 18:39:21 +02:00
|
|
|
* Use of this source code is governed by a BSD-style license
|
2010-06-04 22:19:40 +02:00
|
|
|
* that can be found in the LICENSE file in the root of the source
|
|
|
|
* tree. An additional intellectual property rights grant can be found
|
2010-06-18 18:39:21 +02:00
|
|
|
* in the file PATENTS. All contributing project authors may
|
2010-06-04 22:19:40 +02:00
|
|
|
* be found in the AUTHORS file in the root of the source tree.
|
2010-05-18 17:58:33 +02:00
|
|
|
*/
|
|
|
|
|
|
|
|
|
2012-11-30 01:36:10 +01:00
|
|
|
#ifndef VP9_DECODER_VP9_TREEREADER_H_
|
|
|
|
#define VP9_DECODER_VP9_TREEREADER_H_
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-11-27 22:59:17 +01:00
|
|
|
#include "vp9/common/vp9_treecoder.h"
|
2012-11-28 19:41:40 +01:00
|
|
|
#include "vp9/decoder/vp9_dboolhuff.h"
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2013-03-27 22:04:35 +01:00
|
|
|
#define vp9_read_prob(r) ((vp9_prob)vp9_read_literal(r, 8))
|
2013-04-12 00:36:43 +02:00
|
|
|
#define vp9_read_and_apply_sign(r, value) (vp9_read_bit(r) ? -(value) : (value))
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2013-03-27 22:04:35 +01:00
|
|
|
// Intent of tree data structure is to make decoding trivial.
|
2012-10-31 22:40:53 +01:00
|
|
|
static int treed_read(vp9_reader *const r, /* !!! must return a 0 or 1 !!! */
|
|
|
|
vp9_tree t,
|
|
|
|
const vp9_prob *const p) {
|
|
|
|
register vp9_tree_index i = 0;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-10-31 22:40:53 +01:00
|
|
|
while ((i = t[ i + vp9_read(r, p[i >> 1])]) > 0);
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-07-14 00:21:29 +02:00
|
|
|
return -i;
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
|
2012-12-19 00:31:19 +01:00
|
|
|
#endif // VP9_DECODER_VP9_TREEREADER_H_
|