Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(187)

Side by Side Diff: source/libvpx/vp9/decoder/vp9_dboolhuff.h

Issue 11555023: libvpx: Add VP9 decoder. (Closed) Base URL: svn://chrome-svn/chrome/trunk/deps/third_party/libvpx/
Patch Set: Created 8 years ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
Property Changes:
Added: svn:eol-style
+ LF
OLDNEW
(Empty)
1 /*
2 * Copyright (c) 2010 The WebM project authors. All Rights Reserved.
3 *
4 * Use of this source code is governed by a BSD-style license
5 * that can be found in the LICENSE file in the root of the source
6 * tree. An additional intellectual property rights grant can be found
7 * in the file PATENTS. All contributing project authors may
8 * be found in the AUTHORS file in the root of the source tree.
9 */
10
11
12 #ifndef VP9_DECODER_VP9_DBOOLHUFF_H_
13 #define VP9_DECODER_VP9_DBOOLHUFF_H_
14 #include <stddef.h>
15 #include <limits.h>
16 #include "vpx_ports/config.h"
17 #include "vpx_ports/mem.h"
18 #include "vpx/vpx_integer.h"
19
20 typedef size_t VP9_BD_VALUE;
21
22 # define VP9_BD_VALUE_SIZE ((int)sizeof(VP9_BD_VALUE)*CHAR_BIT)
23 /*This is meant to be a large, positive constant that can still be efficiently
24 loaded as an immediate (on platforms like ARM, for example).
25 Even relatively modest values like 100 would work fine.*/
26 # define VP9_LOTS_OF_BITS (0x40000000)
27
28 typedef struct {
29 const unsigned char *user_buffer_end;
30 const unsigned char *user_buffer;
31 VP9_BD_VALUE value;
32 int count;
33 unsigned int range;
34 } BOOL_DECODER;
35
36 DECLARE_ALIGNED(16, extern const unsigned char, vp9_norm[256]);
37
38 int vp9_start_decode(BOOL_DECODER *br,
39 const unsigned char *source,
40 unsigned int source_sz);
41
42 void vp9_bool_decoder_fill(BOOL_DECODER *br);
43
44 int vp9_decode_uniform(BOOL_DECODER *br, int n);
45 int vp9_decode_term_subexp(BOOL_DECODER *br, int k, int num_syms);
46 int vp9_inv_recenter_nonneg(int v, int m);
47
48 /*The refill loop is used in several places, so define it in a macro to make
49 sure they're all consistent.
50 An inline function would be cleaner, but has a significant penalty, because
51 multiple BOOL_DECODER fields must be modified, and the compiler is not smart
52 enough to eliminate the stores to those fields and the subsequent reloads
53 from them when inlining the function.*/
54 #define VP9DX_BOOL_DECODER_FILL(_count,_value,_bufptr,_bufend) \
55 do \
56 { \
57 int shift = VP9_BD_VALUE_SIZE - 8 - ((_count) + 8); \
58 int loop_end, x; \
59 int bits_left = (int)(((_bufend)-(_bufptr))*CHAR_BIT); \
60 \
61 x = shift + CHAR_BIT - bits_left; \
62 loop_end = 0; \
63 if(x >= 0) \
64 { \
65 (_count) += VP9_LOTS_OF_BITS; \
66 loop_end = x; \
67 if(!bits_left) break; \
68 } \
69 while(shift >= loop_end) \
70 { \
71 (_count) += CHAR_BIT; \
72 (_value) |= (VP9_BD_VALUE)*(_bufptr)++ << shift; \
73 shift -= CHAR_BIT; \
74 } \
75 } \
76 while(0) \
77
78
79 static int decode_bool(BOOL_DECODER *br, int probability) {
80 unsigned int bit = 0;
81 VP9_BD_VALUE value;
82 unsigned int split;
83 VP9_BD_VALUE bigsplit;
84 int count;
85 unsigned int range;
86
87 split = 1 + (((br->range - 1) * probability) >> 8);
88
89 if (br->count < 0)
90 vp9_bool_decoder_fill(br);
91
92 value = br->value;
93 count = br->count;
94
95 bigsplit = (VP9_BD_VALUE)split << (VP9_BD_VALUE_SIZE - 8);
96
97 range = split;
98
99 if (value >= bigsplit) {
100 range = br->range - split;
101 value = value - bigsplit;
102 bit = 1;
103 }
104
105 {
106 register unsigned int shift = vp9_norm[range];
107 range <<= shift;
108 value <<= shift;
109 count -= shift;
110 }
111 br->value = value;
112 br->count = count;
113 br->range = range;
114
115 return bit;
116 }
117
118 static int decode_value(BOOL_DECODER *br, int bits) {
119 int z = 0;
120 int bit;
121
122 for (bit = bits - 1; bit >= 0; bit--) {
123 z |= (decode_bool(br, 0x80) << bit);
124 }
125
126 return z;
127 }
128
129 static int bool_error(BOOL_DECODER *br) {
130 /* Check if we have reached the end of the buffer.
131 *
132 * Variable 'count' stores the number of bits in the 'value' buffer, minus
133 * 8. The top byte is part of the algorithm, and the remainder is buffered
134 * to be shifted into it. So if count == 8, the top 16 bits of 'value' are
135 * occupied, 8 for the algorithm and 8 in the buffer.
136 *
137 * When reading a byte from the user's buffer, count is filled with 8 and
138 * one byte is filled into the value buffer. When we reach the end of the
139 * data, count is additionally filled with VP9_LOTS_OF_BITS. So when
140 * count == VP9_LOTS_OF_BITS - 1, the user's data has been exhausted.
141 */
142 if ((br->count > VP9_BD_VALUE_SIZE) && (br->count < VP9_LOTS_OF_BITS)) {
143 /* We have tried to decode bits after the end of
144 * stream was encountered.
145 */
146 return 1;
147 }
148
149 /* No error. */
150 return 0;
151 }
152
153 extern int vp9_decode_unsigned_max(BOOL_DECODER *br, int max);
154
155 #endif
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698