Mercurial > libavcodec.hg
annotate common.c @ 1555:27073c5532dc libavcodec
move blocks away MpegEncContext (7.4 -> 5.8k)
author | michael |
---|---|
date | Wed, 22 Oct 2003 12:01:21 +0000 |
parents | dd544554ed42 |
children | 932d306bf1dc |
rev | line source |
---|---|
0 | 1 /* |
2 * Common bit i/o utils | |
429 | 3 * Copyright (c) 2000, 2001 Fabrice Bellard. |
0 | 4 * |
429 | 5 * This library is free software; you can redistribute it and/or |
6 * modify it under the terms of the GNU Lesser General Public | |
7 * License as published by the Free Software Foundation; either | |
8 * version 2 of the License, or (at your option) any later version. | |
0 | 9 * |
429 | 10 * This library is distributed in the hope that it will be useful, |
0 | 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
429 | 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
13 * Lesser General Public License for more details. | |
0 | 14 * |
429 | 15 * You should have received a copy of the GNU Lesser General Public |
16 * License along with this library; if not, write to the Free Software | |
17 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA | |
192
1e5f64be86fc
another bitstream reader code (faster on intel cpus) - patch by Michael Niedermayer <michaelni@gmx.at>
uid46427
parents:
144
diff
changeset
|
18 * |
234
5fc0c3af3fe4
alternative bitstream writer (disabled by default, uncomment #define ALT_BISTREAM_WRITER in common.h if u want to try it)
michaelni
parents:
219
diff
changeset
|
19 * alternative bitstream reader & writer by Michael Niedermayer <michaelni@gmx.at> |
0 | 20 */ |
1106 | 21 |
22 /** | |
23 * @file common.c | |
24 * common internal api. | |
25 */ | |
26 | |
524 | 27 #include "avcodec.h" |
8 | 28 |
1064 | 29 const uint8_t ff_sqrt_tab[128]={ |
609 | 30 0, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, |
31 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, | |
32 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, | |
33 9, 9, 9, 9,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,11,11,11,11,11,11,11 | |
34 }; | |
35 | |
1037 | 36 const uint8_t ff_log2_tab[256]={ |
37 0,0,1,1,2,2,2,2,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4, | |
38 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5, | |
39 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6, | |
40 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6, | |
41 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, | |
42 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, | |
43 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, | |
44 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7 | |
45 }; | |
46 | |
1522
79dddc5cd990
removed the obsolete and unused parameters of init_put_bits
alex
parents:
1387
diff
changeset
|
47 void init_put_bits(PutBitContext *s, uint8_t *buffer, int buffer_size) |
0 | 48 { |
49 s->buf = buffer; | |
234
5fc0c3af3fe4
alternative bitstream writer (disabled by default, uncomment #define ALT_BISTREAM_WRITER in common.h if u want to try it)
michaelni
parents:
219
diff
changeset
|
50 s->buf_end = s->buf + buffer_size; |
5fc0c3af3fe4
alternative bitstream writer (disabled by default, uncomment #define ALT_BISTREAM_WRITER in common.h if u want to try it)
michaelni
parents:
219
diff
changeset
|
51 s->data_out_size = 0; |
238
99a9f903f0e3
optimized the normal bitstream writer, its faster than the alternative one on p3 now ... lets hope its at least not slower on p4 & k7
michaelni
parents:
234
diff
changeset
|
52 #ifdef ALT_BITSTREAM_WRITER |
99a9f903f0e3
optimized the normal bitstream writer, its faster than the alternative one on p3 now ... lets hope its at least not slower on p4 & k7
michaelni
parents:
234
diff
changeset
|
53 s->index=0; |
99a9f903f0e3
optimized the normal bitstream writer, its faster than the alternative one on p3 now ... lets hope its at least not slower on p4 & k7
michaelni
parents:
234
diff
changeset
|
54 ((uint32_t*)(s->buf))[0]=0; |
99a9f903f0e3
optimized the normal bitstream writer, its faster than the alternative one on p3 now ... lets hope its at least not slower on p4 & k7
michaelni
parents:
234
diff
changeset
|
55 // memset(buffer, 0, buffer_size); |
234
5fc0c3af3fe4
alternative bitstream writer (disabled by default, uncomment #define ALT_BISTREAM_WRITER in common.h if u want to try it)
michaelni
parents:
219
diff
changeset
|
56 #else |
0 | 57 s->buf_ptr = s->buf; |
238
99a9f903f0e3
optimized the normal bitstream writer, its faster than the alternative one on p3 now ... lets hope its at least not slower on p4 & k7
michaelni
parents:
234
diff
changeset
|
58 s->bit_left=32; |
0 | 59 s->bit_buf=0; |
234
5fc0c3af3fe4
alternative bitstream writer (disabled by default, uncomment #define ALT_BISTREAM_WRITER in common.h if u want to try it)
michaelni
parents:
219
diff
changeset
|
60 #endif |
0 | 61 } |
62 | |
1232
e88d3b1fb2a1
more #ifdef CONFIG_ENCODERS by (Wolfgang Hesseler <qv at multimediaware dot com>)
michaelni
parents:
1126
diff
changeset
|
63 #ifdef CONFIG_ENCODERS |
e88d3b1fb2a1
more #ifdef CONFIG_ENCODERS by (Wolfgang Hesseler <qv at multimediaware dot com>)
michaelni
parents:
1126
diff
changeset
|
64 |
0 | 65 /* return the number of bits output */ |
1064 | 66 int64_t get_bit_count(PutBitContext *s) |
0 | 67 { |
234
5fc0c3af3fe4
alternative bitstream writer (disabled by default, uncomment #define ALT_BISTREAM_WRITER in common.h if u want to try it)
michaelni
parents:
219
diff
changeset
|
68 #ifdef ALT_BITSTREAM_WRITER |
5fc0c3af3fe4
alternative bitstream writer (disabled by default, uncomment #define ALT_BISTREAM_WRITER in common.h if u want to try it)
michaelni
parents:
219
diff
changeset
|
69 return s->data_out_size * 8 + s->index; |
5fc0c3af3fe4
alternative bitstream writer (disabled by default, uncomment #define ALT_BISTREAM_WRITER in common.h if u want to try it)
michaelni
parents:
219
diff
changeset
|
70 #else |
1064 | 71 return (s->buf_ptr - s->buf + s->data_out_size) * 8 + 32 - (int64_t)s->bit_left; |
234
5fc0c3af3fe4
alternative bitstream writer (disabled by default, uncomment #define ALT_BISTREAM_WRITER in common.h if u want to try it)
michaelni
parents:
219
diff
changeset
|
72 #endif |
0 | 73 } |
74 | |
75 void align_put_bits(PutBitContext *s) | |
76 { | |
234
5fc0c3af3fe4
alternative bitstream writer (disabled by default, uncomment #define ALT_BISTREAM_WRITER in common.h if u want to try it)
michaelni
parents:
219
diff
changeset
|
77 #ifdef ALT_BITSTREAM_WRITER |
5fc0c3af3fe4
alternative bitstream writer (disabled by default, uncomment #define ALT_BISTREAM_WRITER in common.h if u want to try it)
michaelni
parents:
219
diff
changeset
|
78 put_bits(s,( - s->index) & 7,0); |
5fc0c3af3fe4
alternative bitstream writer (disabled by default, uncomment #define ALT_BISTREAM_WRITER in common.h if u want to try it)
michaelni
parents:
219
diff
changeset
|
79 #else |
238
99a9f903f0e3
optimized the normal bitstream writer, its faster than the alternative one on p3 now ... lets hope its at least not slower on p4 & k7
michaelni
parents:
234
diff
changeset
|
80 put_bits(s,s->bit_left & 7,0); |
234
5fc0c3af3fe4
alternative bitstream writer (disabled by default, uncomment #define ALT_BISTREAM_WRITER in common.h if u want to try it)
michaelni
parents:
219
diff
changeset
|
81 #endif |
0 | 82 } |
83 | |
1232
e88d3b1fb2a1
more #ifdef CONFIG_ENCODERS by (Wolfgang Hesseler <qv at multimediaware dot com>)
michaelni
parents:
1126
diff
changeset
|
84 #endif //CONFIG_ENCODERS |
e88d3b1fb2a1
more #ifdef CONFIG_ENCODERS by (Wolfgang Hesseler <qv at multimediaware dot com>)
michaelni
parents:
1126
diff
changeset
|
85 |
0 | 86 /* pad the end of the output stream with zeros */ |
87 void flush_put_bits(PutBitContext *s) | |
88 { | |
234
5fc0c3af3fe4
alternative bitstream writer (disabled by default, uncomment #define ALT_BISTREAM_WRITER in common.h if u want to try it)
michaelni
parents:
219
diff
changeset
|
89 #ifdef ALT_BITSTREAM_WRITER |
5fc0c3af3fe4
alternative bitstream writer (disabled by default, uncomment #define ALT_BISTREAM_WRITER in common.h if u want to try it)
michaelni
parents:
219
diff
changeset
|
90 align_put_bits(s); |
5fc0c3af3fe4
alternative bitstream writer (disabled by default, uncomment #define ALT_BISTREAM_WRITER in common.h if u want to try it)
michaelni
parents:
219
diff
changeset
|
91 #else |
238
99a9f903f0e3
optimized the normal bitstream writer, its faster than the alternative one on p3 now ... lets hope its at least not slower on p4 & k7
michaelni
parents:
234
diff
changeset
|
92 s->bit_buf<<= s->bit_left; |
99a9f903f0e3
optimized the normal bitstream writer, its faster than the alternative one on p3 now ... lets hope its at least not slower on p4 & k7
michaelni
parents:
234
diff
changeset
|
93 while (s->bit_left < 32) { |
0 | 94 /* XXX: should test end of buffer */ |
95 *s->buf_ptr++=s->bit_buf >> 24; | |
96 s->bit_buf<<=8; | |
238
99a9f903f0e3
optimized the normal bitstream writer, its faster than the alternative one on p3 now ... lets hope its at least not slower on p4 & k7
michaelni
parents:
234
diff
changeset
|
97 s->bit_left+=8; |
0 | 98 } |
238
99a9f903f0e3
optimized the normal bitstream writer, its faster than the alternative one on p3 now ... lets hope its at least not slower on p4 & k7
michaelni
parents:
234
diff
changeset
|
99 s->bit_left=32; |
0 | 100 s->bit_buf=0; |
234
5fc0c3af3fe4
alternative bitstream writer (disabled by default, uncomment #define ALT_BISTREAM_WRITER in common.h if u want to try it)
michaelni
parents:
219
diff
changeset
|
101 #endif |
0 | 102 } |
103 | |
1232
e88d3b1fb2a1
more #ifdef CONFIG_ENCODERS by (Wolfgang Hesseler <qv at multimediaware dot com>)
michaelni
parents:
1126
diff
changeset
|
104 #ifdef CONFIG_ENCODERS |
e88d3b1fb2a1
more #ifdef CONFIG_ENCODERS by (Wolfgang Hesseler <qv at multimediaware dot com>)
michaelni
parents:
1126
diff
changeset
|
105 |
358 | 106 void put_string(PutBitContext * pbc, char *s) |
107 { | |
108 while(*s){ | |
109 put_bits(pbc, 8, *s); | |
110 s++; | |
111 } | |
112 put_bits(pbc, 8, 0); | |
113 } | |
114 | |
0 | 115 /* bit input functions */ |
116 | |
1232
e88d3b1fb2a1
more #ifdef CONFIG_ENCODERS by (Wolfgang Hesseler <qv at multimediaware dot com>)
michaelni
parents:
1126
diff
changeset
|
117 #endif //CONFIG_ENCODERS |
e88d3b1fb2a1
more #ifdef CONFIG_ENCODERS by (Wolfgang Hesseler <qv at multimediaware dot com>)
michaelni
parents:
1126
diff
changeset
|
118 |
1249 | 119 /** |
120 * init GetBitContext. | |
121 * @param buffer bitstream buffer, must be FF_INPUT_BUFFER_PADDING_SIZE bytes larger then the actual read bits | |
122 * because some optimized bitstream readers read 32 or 64 bit at once and could read over the end | |
123 * @param bit_size the size of the buffer in bits | |
124 */ | |
520
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
125 void init_get_bits(GetBitContext *s, |
1083 | 126 const uint8_t *buffer, int bit_size) |
0 | 127 { |
1025
1f9afd8b9131
GetBitContext.size is allways multiplied by 8 -> use size_in_bits to avoid useless *8 in a few inner loops
michaelni
parents:
880
diff
changeset
|
128 const int buffer_size= (bit_size+7)>>3; |
1f9afd8b9131
GetBitContext.size is allways multiplied by 8 -> use size_in_bits to avoid useless *8 in a few inner loops
michaelni
parents:
880
diff
changeset
|
129 |
520
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
130 s->buffer= buffer; |
1025
1f9afd8b9131
GetBitContext.size is allways multiplied by 8 -> use size_in_bits to avoid useless *8 in a few inner loops
michaelni
parents:
880
diff
changeset
|
131 s->size_in_bits= bit_size; |
520
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
132 s->buffer_end= buffer + buffer_size; |
192
1e5f64be86fc
another bitstream reader code (faster on intel cpus) - patch by Michael Niedermayer <michaelni@gmx.at>
uid46427
parents:
144
diff
changeset
|
133 #ifdef ALT_BITSTREAM_READER |
1e5f64be86fc
another bitstream reader code (faster on intel cpus) - patch by Michael Niedermayer <michaelni@gmx.at>
uid46427
parents:
144
diff
changeset
|
134 s->index=0; |
520
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
135 #elif defined LIBMPEG2_BITSTREAM_READER |
1257 | 136 #ifdef LIBMPEG2_BITSTREAM_READER_HACK |
1254
604661d34c68
bitstream reader optimize patch by (BERO <bero at geocities dot co dot jp>)
michaelni
parents:
1249
diff
changeset
|
137 if ((int)buffer&1) { |
604661d34c68
bitstream reader optimize patch by (BERO <bero at geocities dot co dot jp>)
michaelni
parents:
1249
diff
changeset
|
138 /* word alignment */ |
604661d34c68
bitstream reader optimize patch by (BERO <bero at geocities dot co dot jp>)
michaelni
parents:
1249
diff
changeset
|
139 s->cache = (*buffer++)<<24; |
604661d34c68
bitstream reader optimize patch by (BERO <bero at geocities dot co dot jp>)
michaelni
parents:
1249
diff
changeset
|
140 s->buffer_ptr = buffer; |
604661d34c68
bitstream reader optimize patch by (BERO <bero at geocities dot co dot jp>)
michaelni
parents:
1249
diff
changeset
|
141 s->bit_count = 16-8; |
604661d34c68
bitstream reader optimize patch by (BERO <bero at geocities dot co dot jp>)
michaelni
parents:
1249
diff
changeset
|
142 } else |
604661d34c68
bitstream reader optimize patch by (BERO <bero at geocities dot co dot jp>)
michaelni
parents:
1249
diff
changeset
|
143 #endif |
604661d34c68
bitstream reader optimize patch by (BERO <bero at geocities dot co dot jp>)
michaelni
parents:
1249
diff
changeset
|
144 { |
520
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
145 s->buffer_ptr = buffer; |
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
146 s->bit_count = 16; |
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
147 s->cache = 0; |
1254
604661d34c68
bitstream reader optimize patch by (BERO <bero at geocities dot co dot jp>)
michaelni
parents:
1249
diff
changeset
|
148 } |
520
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
149 #elif defined A32_BITSTREAM_READER |
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
150 s->buffer_ptr = (uint32_t*)buffer; |
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
151 s->bit_count = 32; |
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
152 s->cache0 = 0; |
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
153 s->cache1 = 0; |
192
1e5f64be86fc
another bitstream reader code (faster on intel cpus) - patch by Michael Niedermayer <michaelni@gmx.at>
uid46427
parents:
144
diff
changeset
|
154 #endif |
20
907b67420d84
inlineing common case of get_bits() -> gives 2speedup. more optim coming soon...
arpi_esp
parents:
8
diff
changeset
|
155 { |
520
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
156 OPEN_READER(re, s) |
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
157 UPDATE_CACHE(re, s) |
1263
9fce515e9894
libmpeg2 style bitstream reader 17 vs 16 bit bugfix
michaelni
parents:
1257
diff
changeset
|
158 UPDATE_CACHE(re, s) |
520
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
159 CLOSE_READER(re, s) |
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
160 } |
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
161 #ifdef A32_BITSTREAM_READER |
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
162 s->cache1 = 0; |
8 | 163 #endif |
0 | 164 } |
165 | |
1257 | 166 /** |
167 * reads 0-32 bits. | |
168 */ | |
169 unsigned int get_bits_long(GetBitContext *s, int n){ | |
170 if(n<=17) return get_bits(s, n); | |
171 else{ | |
172 int ret= get_bits(s, 16) << (n-16); | |
173 return ret | get_bits(s, n-16); | |
174 } | |
175 } | |
176 | |
177 /** | |
178 * shows 0-32 bits. | |
179 */ | |
180 unsigned int show_bits_long(GetBitContext *s, int n){ | |
181 if(n<=17) return show_bits(s, n); | |
182 else{ | |
183 GetBitContext gb= *s; | |
184 int ret= get_bits_long(s, n); | |
185 *s= gb; | |
186 return ret; | |
187 } | |
188 } | |
189 | |
0 | 190 void align_get_bits(GetBitContext *s) |
191 { | |
520
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
192 int n= (-get_bits_count(s)) & 7; |
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
193 if(n) skip_bits(s, n); |
0 | 194 } |
192
1e5f64be86fc
another bitstream reader code (faster on intel cpus) - patch by Michael Niedermayer <michaelni@gmx.at>
uid46427
parents:
144
diff
changeset
|
195 |
862 | 196 int check_marker(GetBitContext *s, const char *msg) |
264
28c5c62b1c4c
support decoding (with mplayer) of 3 .mp4 files from mphq
michaelni
parents:
238
diff
changeset
|
197 { |
28c5c62b1c4c
support decoding (with mplayer) of 3 .mp4 files from mphq
michaelni
parents:
238
diff
changeset
|
198 int bit= get_bits1(s); |
28c5c62b1c4c
support decoding (with mplayer) of 3 .mp4 files from mphq
michaelni
parents:
238
diff
changeset
|
199 if(!bit) printf("Marker bit missing %s\n", msg); |
28c5c62b1c4c
support decoding (with mplayer) of 3 .mp4 files from mphq
michaelni
parents:
238
diff
changeset
|
200 |
28c5c62b1c4c
support decoding (with mplayer) of 3 .mp4 files from mphq
michaelni
parents:
238
diff
changeset
|
201 return bit; |
28c5c62b1c4c
support decoding (with mplayer) of 3 .mp4 files from mphq
michaelni
parents:
238
diff
changeset
|
202 } |
28c5c62b1c4c
support decoding (with mplayer) of 3 .mp4 files from mphq
michaelni
parents:
238
diff
changeset
|
203 |
0 | 204 /* VLC decoding */ |
205 | |
206 //#define DEBUG_VLC | |
207 | |
208 #define GET_DATA(v, table, i, wrap, size) \ | |
209 {\ | |
1064 | 210 const uint8_t *ptr = (const uint8_t *)table + i * wrap;\ |
0 | 211 switch(size) {\ |
212 case 1:\ | |
1064 | 213 v = *(const uint8_t *)ptr;\ |
0 | 214 break;\ |
215 case 2:\ | |
1064 | 216 v = *(const uint16_t *)ptr;\ |
0 | 217 break;\ |
218 default:\ | |
1064 | 219 v = *(const uint32_t *)ptr;\ |
0 | 220 break;\ |
221 }\ | |
222 } | |
223 | |
224 | |
225 static int alloc_table(VLC *vlc, int size) | |
226 { | |
227 int index; | |
228 index = vlc->table_size; | |
229 vlc->table_size += size; | |
230 if (vlc->table_size > vlc->table_allocated) { | |
231 vlc->table_allocated += (1 << vlc->bits); | |
1031
19de1445beb2
use av_malloc() functions - added av_strdup and av_realloc()
bellard
parents:
1025
diff
changeset
|
232 vlc->table = av_realloc(vlc->table, |
19de1445beb2
use av_malloc() functions - added av_strdup and av_realloc()
bellard
parents:
1025
diff
changeset
|
233 sizeof(VLC_TYPE) * 2 * vlc->table_allocated); |
520
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
234 if (!vlc->table) |
0 | 235 return -1; |
236 } | |
237 return index; | |
238 } | |
239 | |
520
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
240 static int build_table(VLC *vlc, int table_nb_bits, |
0 | 241 int nb_codes, |
242 const void *bits, int bits_wrap, int bits_size, | |
243 const void *codes, int codes_wrap, int codes_size, | |
1064 | 244 uint32_t code_prefix, int n_prefix) |
0 | 245 { |
246 int i, j, k, n, table_size, table_index, nb, n1, index; | |
1064 | 247 uint32_t code; |
520
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
248 VLC_TYPE (*table)[2]; |
0 | 249 |
250 table_size = 1 << table_nb_bits; | |
251 table_index = alloc_table(vlc, table_size); | |
252 #ifdef DEBUG_VLC | |
520
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
253 printf("new table index=%d size=%d code_prefix=%x n=%d\n", |
0 | 254 table_index, table_size, code_prefix, n_prefix); |
255 #endif | |
256 if (table_index < 0) | |
257 return -1; | |
520
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
258 table = &vlc->table[table_index]; |
0 | 259 |
260 for(i=0;i<table_size;i++) { | |
520
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
261 table[i][1] = 0; //bits |
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
262 table[i][0] = -1; //codes |
0 | 263 } |
264 | |
265 /* first pass: map codes and compute auxillary table sizes */ | |
266 for(i=0;i<nb_codes;i++) { | |
267 GET_DATA(n, bits, i, bits_wrap, bits_size); | |
268 GET_DATA(code, codes, i, codes_wrap, codes_size); | |
269 /* we accept tables with holes */ | |
270 if (n <= 0) | |
271 continue; | |
272 #if defined(DEBUG_VLC) && 0 | |
273 printf("i=%d n=%d code=0x%x\n", i, n, code); | |
274 #endif | |
275 /* if code matches the prefix, it is in the table */ | |
276 n -= n_prefix; | |
277 if (n > 0 && (code >> n) == code_prefix) { | |
278 if (n <= table_nb_bits) { | |
279 /* no need to add another table */ | |
280 j = (code << (table_nb_bits - n)) & (table_size - 1); | |
281 nb = 1 << (table_nb_bits - n); | |
282 for(k=0;k<nb;k++) { | |
283 #ifdef DEBUG_VLC | |
284 printf("%4x: code=%d n=%d\n", | |
285 j, i, n); | |
286 #endif | |
520
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
287 if (table[j][1] /*bits*/ != 0) { |
0 | 288 fprintf(stderr, "incorrect codes\n"); |
1387 | 289 av_abort(); |
0 | 290 } |
520
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
291 table[j][1] = n; //bits |
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
292 table[j][0] = i; //code |
0 | 293 j++; |
294 } | |
295 } else { | |
296 n -= table_nb_bits; | |
297 j = (code >> n) & ((1 << table_nb_bits) - 1); | |
298 #ifdef DEBUG_VLC | |
299 printf("%4x: n=%d (subtable)\n", | |
300 j, n); | |
301 #endif | |
302 /* compute table size */ | |
520
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
303 n1 = -table[j][1]; //bits |
0 | 304 if (n > n1) |
305 n1 = n; | |
520
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
306 table[j][1] = -n1; //bits |
0 | 307 } |
308 } | |
309 } | |
310 | |
311 /* second pass : fill auxillary tables recursively */ | |
312 for(i=0;i<table_size;i++) { | |
520
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
313 n = table[i][1]; //bits |
0 | 314 if (n < 0) { |
315 n = -n; | |
316 if (n > table_nb_bits) { | |
317 n = table_nb_bits; | |
520
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
318 table[i][1] = -n; //bits |
0 | 319 } |
320 index = build_table(vlc, n, nb_codes, | |
321 bits, bits_wrap, bits_size, | |
322 codes, codes_wrap, codes_size, | |
323 (code_prefix << table_nb_bits) | i, | |
324 n_prefix + table_nb_bits); | |
325 if (index < 0) | |
326 return -1; | |
327 /* note: realloc has been done, so reload tables */ | |
520
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
328 table = &vlc->table[table_index]; |
535 | 329 table[i][0] = index; //code |
0 | 330 } |
331 } | |
332 return table_index; | |
333 } | |
334 | |
335 | |
24 | 336 /* Build VLC decoding tables suitable for use with get_vlc(). |
337 | |
338 'nb_bits' set thee decoding table size (2^nb_bits) entries. The | |
339 bigger it is, the faster is the decoding. But it should not be too | |
340 big to save memory and L1 cache. '9' is a good compromise. | |
341 | |
342 'nb_codes' : number of vlcs codes | |
343 | |
344 'bits' : table which gives the size (in bits) of each vlc code. | |
345 | |
346 'codes' : table which gives the bit pattern of of each vlc code. | |
347 | |
348 'xxx_wrap' : give the number of bytes between each entry of the | |
349 'bits' or 'codes' tables. | |
350 | |
351 'xxx_size' : gives the number of bytes of each entry of the 'bits' | |
352 or 'codes' tables. | |
353 | |
354 'wrap' and 'size' allows to use any memory configuration and types | |
355 (byte/word/long) to store the 'bits' and 'codes' tables. | |
356 */ | |
0 | 357 int init_vlc(VLC *vlc, int nb_bits, int nb_codes, |
358 const void *bits, int bits_wrap, int bits_size, | |
359 const void *codes, int codes_wrap, int codes_size) | |
360 { | |
361 vlc->bits = nb_bits; | |
520
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
362 vlc->table = NULL; |
0 | 363 vlc->table_allocated = 0; |
364 vlc->table_size = 0; | |
365 #ifdef DEBUG_VLC | |
366 printf("build table nb_codes=%d\n", nb_codes); | |
367 #endif | |
368 | |
369 if (build_table(vlc, nb_bits, nb_codes, | |
370 bits, bits_wrap, bits_size, | |
371 codes, codes_wrap, codes_size, | |
372 0, 0) < 0) { | |
520
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
373 av_free(vlc->table); |
0 | 374 return -1; |
375 } | |
376 return 0; | |
377 } | |
378 | |
379 | |
380 void free_vlc(VLC *vlc) | |
381 { | |
520
19a5e2a81e1a
new bitstream reader API (old get_bits() based one is emulated and will still be supported in the future cuz its simpler)
michaelni
parents:
497
diff
changeset
|
382 av_free(vlc->table); |
0 | 383 } |
384 | |
1126
77ccf7fe3bd0
per context frame_rate_base, this should finally fix frame_rate related av sync issues
michaelni
parents:
1106
diff
changeset
|
385 int64_t ff_gcd(int64_t a, int64_t b){ |
324 | 386 if(b) return ff_gcd(b, a%b); |
387 else return a; | |
388 } |