michael@0: /*
michael@0:  *  Copyright (c) 2010 The WebM project authors. All Rights Reserved.
michael@0:  *
michael@0:  *  Use of this source code is governed by a BSD-style license
michael@0:  *  that can be found in the LICENSE file in the root of the source
michael@0:  *  tree. An additional intellectual property rights grant can be found
michael@0:  *  in the file PATENTS.  All contributing project authors may
michael@0:  *  be found in the AUTHORS file in the root of the source tree.
michael@0:  */
michael@0: 
michael@0: 
michael@0: #ifndef TREEREADER_H_
michael@0: #define TREEREADER_H_
michael@0: 
michael@0: #include "vp8/common/treecoder.h"
michael@0: #include "dboolhuff.h"
michael@0: 
michael@0: typedef BOOL_DECODER vp8_reader;
michael@0: 
michael@0: #define vp8_read vp8dx_decode_bool
michael@0: #define vp8_read_literal vp8_decode_value
michael@0: #define vp8_read_bit(R) vp8_read(R, vp8_prob_half)
michael@0: 
michael@0: 
michael@0: /* Intent of tree data structure is to make decoding trivial. */
michael@0: 
michael@0: static int vp8_treed_read(
michael@0:     vp8_reader *const r,        /* !!! must return a 0 or 1 !!! */
michael@0:     vp8_tree t,
michael@0:     const vp8_prob *const p
michael@0: )
michael@0: {
michael@0:     register vp8_tree_index i = 0;
michael@0: 
michael@0:     while ((i = t[ i + vp8_read(r, p[i>>1])]) > 0) ;
michael@0: 
michael@0:     return -i;
michael@0: }
michael@0: 
michael@0: #endif  // TREEREADER_H_