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
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
#ifndef tree_reader_h
|
|
|
|
#define tree_reader_h 1
|
|
|
|
|
2011-02-10 20:41:38 +01:00
|
|
|
#include "vp8/common/treecoder.h"
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
#include "dboolhuff.h"
|
|
|
|
|
|
|
|
typedef BOOL_DECODER vp8_reader;
|
|
|
|
|
|
|
|
#define vp8_read vp8dx_decode_bool
|
|
|
|
#define vp8_read_literal vp8_decode_value
|
|
|
|
#define vp8_read_bit( R) vp8_read( R, vp8_prob_half)
|
|
|
|
|
|
|
|
|
|
|
|
/* Intent of tree data structure is to make decoding trivial. */
|
|
|
|
|
|
|
|
static int vp8_treed_read(
|
2012-07-14 00:21:29 +02:00
|
|
|
vp8_reader *const r, /* !!! must return a 0 or 1 !!! */
|
|
|
|
vp8_tree t,
|
|
|
|
const vp8_prob *const p
|
|
|
|
) {
|
|
|
|
register vp8_tree_index i = 0;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-07-14 00:21:29 +02:00
|
|
|
while ((i = t[ i + vp8_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
|
|
|
}
|
|
|
|
|
|
|
|
#endif /* tree_reader_h */
|