Mercurial > libavcodec.hg
annotate common.c @ 1395:b2ac20ff1458 libavcodec
clear bitstream buffers in AVCodec.flush()
author | michaelni |
---|---|
date | Sat, 02 Aug 2003 22:01:02 +0000 |
parents | 45aeed789017 |
children | 79dddc5cd990 |
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 | |
0 | 47 void init_put_bits(PutBitContext *s, |
1064 | 48 uint8_t *buffer, int buffer_size, |
0 | 49 void *opaque, |
1064 | 50 void (*write_data)(void *, uint8_t *, int)) |
0 | 51 { |
52 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
|
53 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
|
54 s->data_out_size = 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
|
55 if(write_data!=NULL) |
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 { |
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
|
57 fprintf(stderr, "write Data callback is not supported\n"); |
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
|
58 } |
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
|
59 #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
|
60 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
|
61 ((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
|
62 // 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
|
63 #else |
0 | 64 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
|
65 s->bit_left=32; |
0 | 66 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
|
67 #endif |
0 | 68 } |
69 | |
1232
e88d3b1fb2a1
more #ifdef CONFIG_ENCODERS by (Wolfgang Hesseler <qv at multimediaware dot com>)
michaelni
parents:
1126
diff
changeset
|
70 #ifdef CONFIG_ENCODERS |
e88d3b1fb2a1
more #ifdef CONFIG_ENCODERS by (Wolfgang Hesseler <qv at multimediaware dot com>)
michaelni
parents:
1126
diff
changeset
|
71 |
0 | 72 /* return the number of bits output */ |
1064 | 73 int64_t get_bit_count(PutBitContext *s) |
0 | 74 { |
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
|
75 #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
|
76 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
|
77 #else |
1064 | 78 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
|
79 #endif |
0 | 80 } |
81 | |
82 void align_put_bits(PutBitContext *s) | |
83 { | |
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
|
84 #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
|
85 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
|
86 #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
|
87 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
|
88 #endif |
0 | 89 } |
90 | |
1232
e88d3b1fb2a1
more #ifdef CONFIG_ENCODERS by (Wolfgang Hesseler <qv at multimediaware dot com>)
michaelni
parents:
1126
diff
changeset
|
91 #endif //CONFIG_ENCODERS |
e88d3b1fb2a1
more #ifdef CONFIG_ENCODERS by (Wolfgang Hesseler <qv at multimediaware dot com>)
michaelni
parents:
1126
diff
changeset
|
92 |
0 | 93 /* pad the end of the output stream with zeros */ |
94 void flush_put_bits(PutBitContext *s) | |
95 { | |
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
|
96 #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
|
97 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
|
98 #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
|
99 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
|
100 while (s->bit_left < 32) { |
0 | 101 /* XXX: should test end of buffer */ |
102 *s->buf_ptr++=s->bit_buf >> 24; | |
103 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
|
104 s->bit_left+=8; |
0 | 105 } |
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
|
106 s->bit_left=32; |
0 | 107 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
|
108 #endif |
0 | 109 } |
110 | |
1232
e88d3b1fb2a1
more #ifdef CONFIG_ENCODERS by (Wolfgang Hesseler <qv at multimediaware dot com>)
michaelni
parents:
1126
diff
changeset
|
111 #ifdef CONFIG_ENCODERS |
e88d3b1fb2a1
more #ifdef CONFIG_ENCODERS by (Wolfgang Hesseler <qv at multimediaware dot com>)
michaelni
parents:
1126
diff
changeset
|
112 |
358 | 113 void put_string(PutBitContext * pbc, char *s) |
114 { | |
115 while(*s){ | |
116 put_bits(pbc, 8, *s); | |
117 s++; | |
118 } | |
119 put_bits(pbc, 8, 0); | |
120 } | |
121 | |
0 | 122 /* bit input functions */ |
123 | |
1232
e88d3b1fb2a1
more #ifdef CONFIG_ENCODERS by (Wolfgang Hesseler <qv at multimediaware dot com>)
michaelni
parents:
1126
diff
changeset
|
124 #endif //CONFIG_ENCODERS |
e88d3b1fb2a1
more #ifdef CONFIG_ENCODERS by (Wolfgang Hesseler <qv at multimediaware dot com>)
michaelni
parents:
1126
diff
changeset
|
125 |
1249 | 126 /** |
127 * init GetBitContext. | |
128 * @param buffer bitstream buffer, must be FF_INPUT_BUFFER_PADDING_SIZE bytes larger then the actual read bits | |
129 * because some optimized bitstream readers read 32 or 64 bit at once and could read over the end | |
130 * @param bit_size the size of the buffer in bits | |
131 */ | |
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 void init_get_bits(GetBitContext *s, |
1083 | 133 const uint8_t *buffer, int bit_size) |
0 | 134 { |
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
|
135 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
|
136 |
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
|
137 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
|
138 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
|
139 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
|
140 #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
|
141 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
|
142 #elif defined LIBMPEG2_BITSTREAM_READER |
1257 | 143 #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
|
144 if ((int)buffer&1) { |
604661d34c68
bitstream reader optimize patch by (BERO <bero at geocities dot co dot jp>)
michaelni
parents:
1249
diff
changeset
|
145 /* word alignment */ |
604661d34c68
bitstream reader optimize patch by (BERO <bero at geocities dot co dot jp>)
michaelni
parents:
1249
diff
changeset
|
146 s->cache = (*buffer++)<<24; |
604661d34c68
bitstream reader optimize patch by (BERO <bero at geocities dot co dot jp>)
michaelni
parents:
1249
diff
changeset
|
147 s->buffer_ptr = buffer; |
604661d34c68
bitstream reader optimize patch by (BERO <bero at geocities dot co dot jp>)
michaelni
parents:
1249
diff
changeset
|
148 s->bit_count = 16-8; |
604661d34c68
bitstream reader optimize patch by (BERO <bero at geocities dot co dot jp>)
michaelni
parents:
1249
diff
changeset
|
149 } else |
604661d34c68
bitstream reader optimize patch by (BERO <bero at geocities dot co dot jp>)
michaelni
parents:
1249
diff
changeset
|
150 #endif |
604661d34c68
bitstream reader optimize patch by (BERO <bero at geocities dot co dot jp>)
michaelni
parents:
1249
diff
changeset
|
151 { |
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
|
152 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
|
153 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
|
154 s->cache = 0; |
1254
604661d34c68
bitstream reader optimize patch by (BERO <bero at geocities dot co dot jp>)
michaelni
parents:
1249
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 #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
|
157 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
|
158 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
|
159 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
|
160 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
|
161 #endif |
20
907b67420d84
inlineing common case of get_bits() -> gives 2speedup. more optim coming soon...
arpi_esp
parents:
8
diff
changeset
|
162 { |
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
|
163 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
|
164 UPDATE_CACHE(re, s) |
1263
9fce515e9894
libmpeg2 style bitstream reader 17 vs 16 bit bugfix
michaelni
parents:
1257
diff
changeset
|
165 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
|
166 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
|
167 } |
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
|
168 #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
|
169 s->cache1 = 0; |
8 | 170 #endif |
0 | 171 } |
172 | |
1257 | 173 /** |
174 * reads 0-32 bits. | |
175 */ | |
176 unsigned int get_bits_long(GetBitContext *s, int n){ | |
177 if(n<=17) return get_bits(s, n); | |
178 else{ | |
179 int ret= get_bits(s, 16) << (n-16); | |
180 return ret | get_bits(s, n-16); | |
181 } | |
182 } | |
183 | |
184 /** | |
185 * shows 0-32 bits. | |
186 */ | |
187 unsigned int show_bits_long(GetBitContext *s, int n){ | |
188 if(n<=17) return show_bits(s, n); | |
189 else{ | |
190 GetBitContext gb= *s; | |
191 int ret= get_bits_long(s, n); | |
192 *s= gb; | |
193 return ret; | |
194 } | |
195 } | |
196 | |
0 | 197 void align_get_bits(GetBitContext *s) |
198 { | |
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
|
199 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
|
200 if(n) skip_bits(s, n); |
0 | 201 } |
192
1e5f64be86fc
another bitstream reader code (faster on intel cpus) - patch by Michael Niedermayer <michaelni@gmx.at>
uid46427
parents:
144
diff
changeset
|
202 |
862 | 203 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
|
204 { |
28c5c62b1c4c
support decoding (with mplayer) of 3 .mp4 files from mphq
michaelni
parents:
238
diff
changeset
|
205 int bit= get_bits1(s); |
28c5c62b1c4c
support decoding (with mplayer) of 3 .mp4 files from mphq
michaelni
parents:
238
diff
changeset
|
206 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
|
207 |
28c5c62b1c4c
support decoding (with mplayer) of 3 .mp4 files from mphq
michaelni
parents:
238
diff
changeset
|
208 return bit; |
28c5c62b1c4c
support decoding (with mplayer) of 3 .mp4 files from mphq
michaelni
parents:
238
diff
changeset
|
209 } |
28c5c62b1c4c
support decoding (with mplayer) of 3 .mp4 files from mphq
michaelni
parents:
238
diff
changeset
|
210 |
0 | 211 /* VLC decoding */ |
212 | |
213 //#define DEBUG_VLC | |
214 | |
215 #define GET_DATA(v, table, i, wrap, size) \ | |
216 {\ | |
1064 | 217 const uint8_t *ptr = (const uint8_t *)table + i * wrap;\ |
0 | 218 switch(size) {\ |
219 case 1:\ | |
1064 | 220 v = *(const uint8_t *)ptr;\ |
0 | 221 break;\ |
222 case 2:\ | |
1064 | 223 v = *(const uint16_t *)ptr;\ |
0 | 224 break;\ |
225 default:\ | |
1064 | 226 v = *(const uint32_t *)ptr;\ |
0 | 227 break;\ |
228 }\ | |
229 } | |
230 | |
231 | |
232 static int alloc_table(VLC *vlc, int size) | |
233 { | |
234 int index; | |
235 index = vlc->table_size; | |
236 vlc->table_size += size; | |
237 if (vlc->table_size > vlc->table_allocated) { | |
238 vlc->table_allocated += (1 << vlc->bits); | |
1031
19de1445beb2
use av_malloc() functions - added av_strdup and av_realloc()
bellard
parents:
1025
diff
changeset
|
239 vlc->table = av_realloc(vlc->table, |
19de1445beb2
use av_malloc() functions - added av_strdup and av_realloc()
bellard
parents:
1025
diff
changeset
|
240 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
|
241 if (!vlc->table) |
0 | 242 return -1; |
243 } | |
244 return index; | |
245 } | |
246 | |
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
|
247 static int build_table(VLC *vlc, int table_nb_bits, |
0 | 248 int nb_codes, |
249 const void *bits, int bits_wrap, int bits_size, | |
250 const void *codes, int codes_wrap, int codes_size, | |
1064 | 251 uint32_t code_prefix, int n_prefix) |
0 | 252 { |
253 int i, j, k, n, table_size, table_index, nb, n1, index; | |
1064 | 254 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
|
255 VLC_TYPE (*table)[2]; |
0 | 256 |
257 table_size = 1 << table_nb_bits; | |
258 table_index = alloc_table(vlc, table_size); | |
259 #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
|
260 printf("new table index=%d size=%d code_prefix=%x n=%d\n", |
0 | 261 table_index, table_size, code_prefix, n_prefix); |
262 #endif | |
263 if (table_index < 0) | |
264 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
|
265 table = &vlc->table[table_index]; |
0 | 266 |
267 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
|
268 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
|
269 table[i][0] = -1; //codes |
0 | 270 } |
271 | |
272 /* first pass: map codes and compute auxillary table sizes */ | |
273 for(i=0;i<nb_codes;i++) { | |
274 GET_DATA(n, bits, i, bits_wrap, bits_size); | |
275 GET_DATA(code, codes, i, codes_wrap, codes_size); | |
276 /* we accept tables with holes */ | |
277 if (n <= 0) | |
278 continue; | |
279 #if defined(DEBUG_VLC) && 0 | |
280 printf("i=%d n=%d code=0x%x\n", i, n, code); | |
281 #endif | |
282 /* if code matches the prefix, it is in the table */ | |
283 n -= n_prefix; | |
284 if (n > 0 && (code >> n) == code_prefix) { | |
285 if (n <= table_nb_bits) { | |
286 /* no need to add another table */ | |
287 j = (code << (table_nb_bits - n)) & (table_size - 1); | |
288 nb = 1 << (table_nb_bits - n); | |
289 for(k=0;k<nb;k++) { | |
290 #ifdef DEBUG_VLC | |
291 printf("%4x: code=%d n=%d\n", | |
292 j, i, n); | |
293 #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
|
294 if (table[j][1] /*bits*/ != 0) { |
0 | 295 fprintf(stderr, "incorrect codes\n"); |
1387 | 296 av_abort(); |
0 | 297 } |
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
|
298 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
|
299 table[j][0] = i; //code |
0 | 300 j++; |
301 } | |
302 } else { | |
303 n -= table_nb_bits; | |
304 j = (code >> n) & ((1 << table_nb_bits) - 1); | |
305 #ifdef DEBUG_VLC | |
306 printf("%4x: n=%d (subtable)\n", | |
307 j, n); | |
308 #endif | |
309 /* 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
|
310 n1 = -table[j][1]; //bits |
0 | 311 if (n > n1) |
312 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
|
313 table[j][1] = -n1; //bits |
0 | 314 } |
315 } | |
316 } | |
317 | |
318 /* second pass : fill auxillary tables recursively */ | |
319 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
|
320 n = table[i][1]; //bits |
0 | 321 if (n < 0) { |
322 n = -n; | |
323 if (n > table_nb_bits) { | |
324 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
|
325 table[i][1] = -n; //bits |
0 | 326 } |
327 index = build_table(vlc, n, nb_codes, | |
328 bits, bits_wrap, bits_size, | |
329 codes, codes_wrap, codes_size, | |
330 (code_prefix << table_nb_bits) | i, | |
331 n_prefix + table_nb_bits); | |
332 if (index < 0) | |
333 return -1; | |
334 /* 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
|
335 table = &vlc->table[table_index]; |
535 | 336 table[i][0] = index; //code |
0 | 337 } |
338 } | |
339 return table_index; | |
340 } | |
341 | |
342 | |
24 | 343 /* Build VLC decoding tables suitable for use with get_vlc(). |
344 | |
345 'nb_bits' set thee decoding table size (2^nb_bits) entries. The | |
346 bigger it is, the faster is the decoding. But it should not be too | |
347 big to save memory and L1 cache. '9' is a good compromise. | |
348 | |
349 'nb_codes' : number of vlcs codes | |
350 | |
351 'bits' : table which gives the size (in bits) of each vlc code. | |
352 | |
353 'codes' : table which gives the bit pattern of of each vlc code. | |
354 | |
355 'xxx_wrap' : give the number of bytes between each entry of the | |
356 'bits' or 'codes' tables. | |
357 | |
358 'xxx_size' : gives the number of bytes of each entry of the 'bits' | |
359 or 'codes' tables. | |
360 | |
361 'wrap' and 'size' allows to use any memory configuration and types | |
362 (byte/word/long) to store the 'bits' and 'codes' tables. | |
363 */ | |
0 | 364 int init_vlc(VLC *vlc, int nb_bits, int nb_codes, |
365 const void *bits, int bits_wrap, int bits_size, | |
366 const void *codes, int codes_wrap, int codes_size) | |
367 { | |
368 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
|
369 vlc->table = NULL; |
0 | 370 vlc->table_allocated = 0; |
371 vlc->table_size = 0; | |
372 #ifdef DEBUG_VLC | |
373 printf("build table nb_codes=%d\n", nb_codes); | |
374 #endif | |
375 | |
376 if (build_table(vlc, nb_bits, nb_codes, | |
377 bits, bits_wrap, bits_size, | |
378 codes, codes_wrap, codes_size, | |
379 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
|
380 av_free(vlc->table); |
0 | 381 return -1; |
382 } | |
383 return 0; | |
384 } | |
385 | |
386 | |
387 void free_vlc(VLC *vlc) | |
388 { | |
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
|
389 av_free(vlc->table); |
0 | 390 } |
391 | |
1126
77ccf7fe3bd0
per context frame_rate_base, this should finally fix frame_rate related av sync issues
michaelni
parents:
1106
diff
changeset
|
392 int64_t ff_gcd(int64_t a, int64_t b){ |
324 | 393 if(b) return ff_gcd(b, a%b); |
394 else return a; | |
395 } | |
880 | 396 |
397 void ff_float2fraction(int *nom_arg, int *denom_arg, double f, int max){ | |
398 double best_diff=1E10, diff; | |
399 int best_denom=1, best_nom=1; | |
400 int nom, denom, gcd; | |
401 | |
402 //brute force here, perhaps we should try continued fractions if we need large max ... | |
403 for(denom=1; denom<=max; denom++){ | |
404 nom= (int)(f*denom + 0.5); | |
405 if(nom<=0 || nom>max) continue; | |
406 | |
407 diff= ABS( f - (double)nom / (double)denom ); | |
408 if(diff < best_diff){ | |
409 best_diff= diff; | |
410 best_nom= nom; | |
411 best_denom= denom; | |
412 } | |
413 } | |
414 | |
415 gcd= ff_gcd(best_nom, best_denom); | |
416 best_nom /= gcd; | |
417 best_denom /= gcd; | |
418 | |
419 *nom_arg= best_nom; | |
420 *denom_arg= best_denom; | |
421 } |