/src/libvpx/vp8/decoder/dboolhuff.h
Line | Count | Source |
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 | | #ifndef VPX_VP8_DECODER_DBOOLHUFF_H_ |
12 | | #define VPX_VP8_DECODER_DBOOLHUFF_H_ |
13 | | |
14 | | #include <stddef.h> |
15 | | #include <limits.h> |
16 | | |
17 | | #include "./vpx_config.h" |
18 | | #include "vpx_ports/compiler_attributes.h" |
19 | | #include "vpx_ports/mem.h" |
20 | | #include "vpx/vp8dx.h" |
21 | | #include "vpx/vpx_integer.h" |
22 | | |
23 | | #ifdef __cplusplus |
24 | | extern "C" { |
25 | | #endif |
26 | | |
27 | | typedef size_t VP8_BD_VALUE; |
28 | | |
29 | 15.0G | #define VP8_BD_VALUE_SIZE ((int)sizeof(VP8_BD_VALUE) * CHAR_BIT) |
30 | | |
31 | | /*This is meant to be a large, positive constant that can still be efficiently |
32 | | loaded as an immediate (on platforms like ARM, for example). |
33 | | Even relatively modest values like 100 would work fine.*/ |
34 | 1.28G | #define VP8_LOTS_OF_BITS (0x40000000) |
35 | | |
36 | | typedef struct { |
37 | | const unsigned char *user_buffer_end; |
38 | | const unsigned char *user_buffer; |
39 | | VP8_BD_VALUE value; |
40 | | int count; |
41 | | unsigned int range; |
42 | | vpx_decrypt_cb decrypt_cb; |
43 | | void *decrypt_state; |
44 | | } BOOL_DECODER; |
45 | | |
46 | | DECLARE_ALIGNED(16, extern const unsigned char, vp8_norm[256]); |
47 | | |
48 | | int vp8dx_start_decode(BOOL_DECODER *br, const unsigned char *source, |
49 | | unsigned int source_sz, vpx_decrypt_cb decrypt_cb, |
50 | | void *decrypt_state); |
51 | | |
52 | | void vp8dx_bool_decoder_fill(BOOL_DECODER *br); |
53 | | |
54 | | static VPX_NO_UNSIGNED_SHIFT_CHECK int vp8dx_decode_bool(BOOL_DECODER *br, |
55 | 13.7G | int probability) { |
56 | 13.7G | unsigned int bit = 0; |
57 | 13.7G | VP8_BD_VALUE value; |
58 | 13.7G | unsigned int split; |
59 | 13.7G | VP8_BD_VALUE bigsplit; |
60 | 13.7G | int count; |
61 | 13.7G | unsigned int range; |
62 | | |
63 | 13.7G | split = 1 + (((br->range - 1) * probability) >> 8); |
64 | | |
65 | 13.7G | if (br->count < 0) vp8dx_bool_decoder_fill(br); |
66 | | |
67 | 13.7G | value = br->value; |
68 | 13.7G | count = br->count; |
69 | | |
70 | 13.7G | bigsplit = (VP8_BD_VALUE)split << (VP8_BD_VALUE_SIZE - 8); |
71 | | |
72 | 13.7G | range = split; |
73 | | |
74 | 13.7G | if (value >= bigsplit) { |
75 | 309M | range = br->range - split; |
76 | 309M | value = value - bigsplit; |
77 | 309M | bit = 1; |
78 | 309M | } |
79 | | |
80 | 13.7G | { |
81 | 13.7G | const unsigned char shift = vp8_norm[(unsigned char)range]; |
82 | 13.7G | range <<= shift; |
83 | 13.7G | value <<= shift; |
84 | 13.7G | count -= shift; |
85 | 13.7G | } |
86 | 13.7G | br->value = value; |
87 | 13.7G | br->count = count; |
88 | 13.7G | br->range = range; |
89 | | |
90 | 13.7G | return bit; |
91 | 13.7G | } Unexecuted instantiation: vp8_dx_iface.c:vp8dx_decode_bool Unexecuted instantiation: onyxd_if.c:vp8dx_decode_bool Unexecuted instantiation: threading.c:vp8dx_decode_bool decodeframe.c:vp8dx_decode_bool Line | Count | Source | 55 | 85.1M | int probability) { | 56 | 85.1M | unsigned int bit = 0; | 57 | 85.1M | VP8_BD_VALUE value; | 58 | 85.1M | unsigned int split; | 59 | 85.1M | VP8_BD_VALUE bigsplit; | 60 | 85.1M | int count; | 61 | 85.1M | unsigned int range; | 62 | | | 63 | 85.1M | split = 1 + (((br->range - 1) * probability) >> 8); | 64 | | | 65 | 85.1M | if (br->count < 0) vp8dx_bool_decoder_fill(br); | 66 | | | 67 | 85.1M | value = br->value; | 68 | 85.1M | count = br->count; | 69 | | | 70 | 85.1M | bigsplit = (VP8_BD_VALUE)split << (VP8_BD_VALUE_SIZE - 8); | 71 | | | 72 | 85.1M | range = split; | 73 | | | 74 | 85.1M | if (value >= bigsplit) { | 75 | 3.57M | range = br->range - split; | 76 | 3.57M | value = value - bigsplit; | 77 | 3.57M | bit = 1; | 78 | 3.57M | } | 79 | | | 80 | 85.1M | { | 81 | 85.1M | const unsigned char shift = vp8_norm[(unsigned char)range]; | 82 | 85.1M | range <<= shift; | 83 | 85.1M | value <<= shift; | 84 | 85.1M | count -= shift; | 85 | 85.1M | } | 86 | 85.1M | br->value = value; | 87 | 85.1M | br->count = count; | 88 | 85.1M | br->range = range; | 89 | | | 90 | 85.1M | return bit; | 91 | 85.1M | } |
detokenize.c:vp8dx_decode_bool Line | Count | Source | 55 | 181M | int probability) { | 56 | 181M | unsigned int bit = 0; | 57 | 181M | VP8_BD_VALUE value; | 58 | 181M | unsigned int split; | 59 | 181M | VP8_BD_VALUE bigsplit; | 60 | 181M | int count; | 61 | 181M | unsigned int range; | 62 | | | 63 | 181M | split = 1 + (((br->range - 1) * probability) >> 8); | 64 | | | 65 | 181M | if (br->count < 0) vp8dx_bool_decoder_fill(br); | 66 | | | 67 | 181M | value = br->value; | 68 | 181M | count = br->count; | 69 | | | 70 | 181M | bigsplit = (VP8_BD_VALUE)split << (VP8_BD_VALUE_SIZE - 8); | 71 | | | 72 | 181M | range = split; | 73 | | | 74 | 181M | if (value >= bigsplit) { | 75 | 37.1M | range = br->range - split; | 76 | 37.1M | value = value - bigsplit; | 77 | 37.1M | bit = 1; | 78 | 37.1M | } | 79 | | | 80 | 181M | { | 81 | 181M | const unsigned char shift = vp8_norm[(unsigned char)range]; | 82 | 181M | range <<= shift; | 83 | 181M | value <<= shift; | 84 | 181M | count -= shift; | 85 | 181M | } | 86 | 181M | br->value = value; | 87 | 181M | br->count = count; | 88 | 181M | br->range = range; | 89 | | | 90 | 181M | return bit; | 91 | 181M | } |
Unexecuted instantiation: dboolhuff.c:vp8dx_decode_bool decodemv.c:vp8dx_decode_bool Line | Count | Source | 55 | 13.4G | int probability) { | 56 | 13.4G | unsigned int bit = 0; | 57 | 13.4G | VP8_BD_VALUE value; | 58 | 13.4G | unsigned int split; | 59 | 13.4G | VP8_BD_VALUE bigsplit; | 60 | 13.4G | int count; | 61 | 13.4G | unsigned int range; | 62 | | | 63 | 13.4G | split = 1 + (((br->range - 1) * probability) >> 8); | 64 | | | 65 | 13.4G | if (br->count < 0) vp8dx_bool_decoder_fill(br); | 66 | | | 67 | 13.4G | value = br->value; | 68 | 13.4G | count = br->count; | 69 | | | 70 | 13.4G | bigsplit = (VP8_BD_VALUE)split << (VP8_BD_VALUE_SIZE - 8); | 71 | | | 72 | 13.4G | range = split; | 73 | | | 74 | 13.4G | if (value >= bigsplit) { | 75 | 268M | range = br->range - split; | 76 | 268M | value = value - bigsplit; | 77 | 268M | bit = 1; | 78 | 268M | } | 79 | | | 80 | 13.4G | { | 81 | 13.4G | const unsigned char shift = vp8_norm[(unsigned char)range]; | 82 | 13.4G | range <<= shift; | 83 | 13.4G | value <<= shift; | 84 | 13.4G | count -= shift; | 85 | 13.4G | } | 86 | 13.4G | br->value = value; | 87 | 13.4G | br->count = count; | 88 | 13.4G | br->range = range; | 89 | | | 90 | 13.4G | return bit; | 91 | 13.4G | } |
|
92 | | |
93 | 1.32M | static INLINE int vp8_decode_value(BOOL_DECODER *br, int bits) { |
94 | 1.32M | int z = 0; |
95 | 1.32M | int bit; |
96 | | |
97 | 9.55M | for (bit = bits - 1; bit >= 0; bit--) { |
98 | 8.23M | z |= (vp8dx_decode_bool(br, 0x80) << bit); |
99 | 8.23M | } |
100 | | |
101 | 1.32M | return z; |
102 | 1.32M | } Unexecuted instantiation: vp8_dx_iface.c:vp8_decode_value Unexecuted instantiation: onyxd_if.c:vp8_decode_value Unexecuted instantiation: threading.c:vp8_decode_value decodeframe.c:vp8_decode_value Line | Count | Source | 93 | 979k | static INLINE int vp8_decode_value(BOOL_DECODER *br, int bits) { | 94 | 979k | int z = 0; | 95 | 979k | int bit; | 96 | | | 97 | 6.47M | for (bit = bits - 1; bit >= 0; bit--) { | 98 | 5.49M | z |= (vp8dx_decode_bool(br, 0x80) << bit); | 99 | 5.49M | } | 100 | | | 101 | 979k | return z; | 102 | 979k | } |
Unexecuted instantiation: detokenize.c:vp8_decode_value Unexecuted instantiation: dboolhuff.c:vp8_decode_value decodemv.c:vp8_decode_value Line | Count | Source | 93 | 346k | static INLINE int vp8_decode_value(BOOL_DECODER *br, int bits) { | 94 | 346k | int z = 0; | 95 | 346k | int bit; | 96 | | | 97 | 3.08M | for (bit = bits - 1; bit >= 0; bit--) { | 98 | 2.73M | z |= (vp8dx_decode_bool(br, 0x80) << bit); | 99 | 2.73M | } | 100 | | | 101 | 346k | return z; | 102 | 346k | } |
|
103 | | |
104 | 1.30G | static INLINE int vp8dx_bool_error(BOOL_DECODER *br) { |
105 | | /* Check if we have reached the end of the buffer. |
106 | | * |
107 | | * Variable 'count' stores the number of bits in the 'value' buffer, minus |
108 | | * 8. The top byte is part of the algorithm, and the remainder is buffered |
109 | | * to be shifted into it. So if count == 8, the top 16 bits of 'value' are |
110 | | * occupied, 8 for the algorithm and 8 in the buffer. |
111 | | * |
112 | | * When reading a byte from the user's buffer, count is filled with 8 and |
113 | | * one byte is filled into the value buffer. When we reach the end of the |
114 | | * data, count is additionally filled with VP8_LOTS_OF_BITS. So when |
115 | | * count == VP8_LOTS_OF_BITS - 1, the user's data has been exhausted. |
116 | | */ |
117 | 1.30G | if ((br->count > VP8_BD_VALUE_SIZE) && (br->count < VP8_LOTS_OF_BITS)) { |
118 | | /* We have tried to decode bits after the end of |
119 | | * stream was encountered. |
120 | | */ |
121 | 1.28G | return 1; |
122 | 1.28G | } |
123 | | |
124 | | /* No error. */ |
125 | 22.4M | return 0; |
126 | 1.30G | } Unexecuted instantiation: vp8_dx_iface.c:vp8dx_bool_error Unexecuted instantiation: onyxd_if.c:vp8dx_bool_error threading.c:vp8dx_bool_error Line | Count | Source | 104 | 4.20M | static INLINE int vp8dx_bool_error(BOOL_DECODER *br) { | 105 | | /* Check if we have reached the end of the buffer. | 106 | | * | 107 | | * Variable 'count' stores the number of bits in the 'value' buffer, minus | 108 | | * 8. The top byte is part of the algorithm, and the remainder is buffered | 109 | | * to be shifted into it. So if count == 8, the top 16 bits of 'value' are | 110 | | * occupied, 8 for the algorithm and 8 in the buffer. | 111 | | * | 112 | | * When reading a byte from the user's buffer, count is filled with 8 and | 113 | | * one byte is filled into the value buffer. When we reach the end of the | 114 | | * data, count is additionally filled with VP8_LOTS_OF_BITS. So when | 115 | | * count == VP8_LOTS_OF_BITS - 1, the user's data has been exhausted. | 116 | | */ | 117 | 4.20M | if ((br->count > VP8_BD_VALUE_SIZE) && (br->count < VP8_LOTS_OF_BITS)) { | 118 | | /* We have tried to decode bits after the end of | 119 | | * stream was encountered. | 120 | | */ | 121 | 12.8k | return 1; | 122 | 12.8k | } | 123 | | | 124 | | /* No error. */ | 125 | 4.19M | return 0; | 126 | 4.20M | } |
decodeframe.c:vp8dx_bool_error Line | Count | Source | 104 | 1.29G | static INLINE int vp8dx_bool_error(BOOL_DECODER *br) { | 105 | | /* Check if we have reached the end of the buffer. | 106 | | * | 107 | | * Variable 'count' stores the number of bits in the 'value' buffer, minus | 108 | | * 8. The top byte is part of the algorithm, and the remainder is buffered | 109 | | * to be shifted into it. So if count == 8, the top 16 bits of 'value' are | 110 | | * occupied, 8 for the algorithm and 8 in the buffer. | 111 | | * | 112 | | * When reading a byte from the user's buffer, count is filled with 8 and | 113 | | * one byte is filled into the value buffer. When we reach the end of the | 114 | | * data, count is additionally filled with VP8_LOTS_OF_BITS. So when | 115 | | * count == VP8_LOTS_OF_BITS - 1, the user's data has been exhausted. | 116 | | */ | 117 | 1.29G | if ((br->count > VP8_BD_VALUE_SIZE) && (br->count < VP8_LOTS_OF_BITS)) { | 118 | | /* We have tried to decode bits after the end of | 119 | | * stream was encountered. | 120 | | */ | 121 | 1.28G | return 1; | 122 | 1.28G | } | 123 | | | 124 | | /* No error. */ | 125 | 18.2M | return 0; | 126 | 1.29G | } |
Unexecuted instantiation: detokenize.c:vp8dx_bool_error Unexecuted instantiation: dboolhuff.c:vp8dx_bool_error Unexecuted instantiation: decodemv.c:vp8dx_bool_error |
127 | | |
128 | | #ifdef __cplusplus |
129 | | } // extern "C" |
130 | | #endif |
131 | | |
132 | | #endif // VPX_VP8_DECODER_DBOOLHUFF_H_ |