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 VP9_DECODER_VP9_TREEREADER_H_
michael@0: #define VP9_DECODER_VP9_TREEREADER_H_
michael@0: 
michael@0: #include "vp9/common/vp9_treecoder.h"
michael@0: #include "vp9/decoder/vp9_dboolhuff.h"
michael@0: 
michael@0: // Intent of tree data structure is to make decoding trivial.
michael@0: static int treed_read(vp9_reader *const r, /* !!! must return a 0 or 1 !!! */
michael@0:                       vp9_tree t,
michael@0:                       const vp9_prob *const p) {
michael@0:   register vp9_tree_index i = 0;
michael@0: 
michael@0:   while ((i = t[ i + vp9_read(r, p[i >> 1])]) > 0)
michael@0:     continue;
michael@0: 
michael@0:   return -i;
michael@0: }
michael@0: 
michael@0: #endif  // VP9_DECODER_VP9_TREEREADER_H_