Mercurial > libavcodec.hg
annotate common.c @ 1232:e88d3b1fb2a1 libavcodec
more #ifdef CONFIG_ENCODERS by (Wolfgang Hesseler <qv at multimediaware dot com>)
author | michaelni |
---|---|
date | Wed, 07 May 2003 23:32:45 +0000 |
parents | 77ccf7fe3bd0 |
children | 7ac0a77e5973 |
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 |
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
|
126 void init_get_bits(GetBitContext *s, |
1083 | 127 const uint8_t *buffer, int bit_size) |
0 | 128 { |
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
|
129 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
|
130 |
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
|
131 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
|
132 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
|
133 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
|
134 #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
|
135 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
|
136 #elif defined LIBMPEG2_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
|
137 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
|
138 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
|
139 s->cache = 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
|
140 #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
|
141 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
|
142 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
|
143 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
|
144 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
|
145 #endif |
20
907b67420d84
inlineing common case of get_bits() -> gives 2speedup. more optim coming soon...
arpi_esp
parents:
8
diff
changeset
|
146 { |
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
|
147 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
|
148 UPDATE_CACHE(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
|
149 // UPDATE_CACHE(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
|
150 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
|
151 } |
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 #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
|
153 s->cache1 = 0; |
8 | 154 #endif |
0 | 155 } |
156 | |
157 void align_get_bits(GetBitContext *s) | |
158 { | |
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 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
|
160 if(n) skip_bits(s, n); |
0 | 161 } |
192
1e5f64be86fc
another bitstream reader code (faster on intel cpus) - patch by Michael Niedermayer <michaelni@gmx.at>
uid46427
parents:
144
diff
changeset
|
162 |
862 | 163 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
|
164 { |
28c5c62b1c4c
support decoding (with mplayer) of 3 .mp4 files from mphq
michaelni
parents:
238
diff
changeset
|
165 int bit= get_bits1(s); |
28c5c62b1c4c
support decoding (with mplayer) of 3 .mp4 files from mphq
michaelni
parents:
238
diff
changeset
|
166 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
|
167 |
28c5c62b1c4c
support decoding (with mplayer) of 3 .mp4 files from mphq
michaelni
parents:
238
diff
changeset
|
168 return bit; |
28c5c62b1c4c
support decoding (with mplayer) of 3 .mp4 files from mphq
michaelni
parents:
238
diff
changeset
|
169 } |
28c5c62b1c4c
support decoding (with mplayer) of 3 .mp4 files from mphq
michaelni
parents:
238
diff
changeset
|
170 |
0 | 171 /* VLC decoding */ |
172 | |
173 //#define DEBUG_VLC | |
174 | |
175 #define GET_DATA(v, table, i, wrap, size) \ | |
176 {\ | |
1064 | 177 const uint8_t *ptr = (const uint8_t *)table + i * wrap;\ |
0 | 178 switch(size) {\ |
179 case 1:\ | |
1064 | 180 v = *(const uint8_t *)ptr;\ |
0 | 181 break;\ |
182 case 2:\ | |
1064 | 183 v = *(const uint16_t *)ptr;\ |
0 | 184 break;\ |
185 default:\ | |
1064 | 186 v = *(const uint32_t *)ptr;\ |
0 | 187 break;\ |
188 }\ | |
189 } | |
190 | |
191 | |
192 static int alloc_table(VLC *vlc, int size) | |
193 { | |
194 int index; | |
195 index = vlc->table_size; | |
196 vlc->table_size += size; | |
197 if (vlc->table_size > vlc->table_allocated) { | |
198 vlc->table_allocated += (1 << vlc->bits); | |
1031
19de1445beb2
use av_malloc() functions - added av_strdup and av_realloc()
bellard
parents:
1025
diff
changeset
|
199 vlc->table = av_realloc(vlc->table, |
19de1445beb2
use av_malloc() functions - added av_strdup and av_realloc()
bellard
parents:
1025
diff
changeset
|
200 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
|
201 if (!vlc->table) |
0 | 202 return -1; |
203 } | |
204 return index; | |
205 } | |
206 | |
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
|
207 static int build_table(VLC *vlc, int table_nb_bits, |
0 | 208 int nb_codes, |
209 const void *bits, int bits_wrap, int bits_size, | |
210 const void *codes, int codes_wrap, int codes_size, | |
1064 | 211 uint32_t code_prefix, int n_prefix) |
0 | 212 { |
213 int i, j, k, n, table_size, table_index, nb, n1, index; | |
1064 | 214 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
|
215 VLC_TYPE (*table)[2]; |
0 | 216 |
217 table_size = 1 << table_nb_bits; | |
218 table_index = alloc_table(vlc, table_size); | |
219 #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
|
220 printf("new table index=%d size=%d code_prefix=%x n=%d\n", |
0 | 221 table_index, table_size, code_prefix, n_prefix); |
222 #endif | |
223 if (table_index < 0) | |
224 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
|
225 table = &vlc->table[table_index]; |
0 | 226 |
227 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
|
228 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
|
229 table[i][0] = -1; //codes |
0 | 230 } |
231 | |
232 /* first pass: map codes and compute auxillary table sizes */ | |
233 for(i=0;i<nb_codes;i++) { | |
234 GET_DATA(n, bits, i, bits_wrap, bits_size); | |
235 GET_DATA(code, codes, i, codes_wrap, codes_size); | |
236 /* we accept tables with holes */ | |
237 if (n <= 0) | |
238 continue; | |
239 #if defined(DEBUG_VLC) && 0 | |
240 printf("i=%d n=%d code=0x%x\n", i, n, code); | |
241 #endif | |
242 /* if code matches the prefix, it is in the table */ | |
243 n -= n_prefix; | |
244 if (n > 0 && (code >> n) == code_prefix) { | |
245 if (n <= table_nb_bits) { | |
246 /* no need to add another table */ | |
247 j = (code << (table_nb_bits - n)) & (table_size - 1); | |
248 nb = 1 << (table_nb_bits - n); | |
249 for(k=0;k<nb;k++) { | |
250 #ifdef DEBUG_VLC | |
251 printf("%4x: code=%d n=%d\n", | |
252 j, i, n); | |
253 #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
|
254 if (table[j][1] /*bits*/ != 0) { |
0 | 255 fprintf(stderr, "incorrect codes\n"); |
256 exit(1); | |
257 } | |
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[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
|
259 table[j][0] = i; //code |
0 | 260 j++; |
261 } | |
262 } else { | |
263 n -= table_nb_bits; | |
264 j = (code >> n) & ((1 << table_nb_bits) - 1); | |
265 #ifdef DEBUG_VLC | |
266 printf("%4x: n=%d (subtable)\n", | |
267 j, n); | |
268 #endif | |
269 /* 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
|
270 n1 = -table[j][1]; //bits |
0 | 271 if (n > n1) |
272 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
|
273 table[j][1] = -n1; //bits |
0 | 274 } |
275 } | |
276 } | |
277 | |
278 /* second pass : fill auxillary tables recursively */ | |
279 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
|
280 n = table[i][1]; //bits |
0 | 281 if (n < 0) { |
282 n = -n; | |
283 if (n > table_nb_bits) { | |
284 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
|
285 table[i][1] = -n; //bits |
0 | 286 } |
287 index = build_table(vlc, n, nb_codes, | |
288 bits, bits_wrap, bits_size, | |
289 codes, codes_wrap, codes_size, | |
290 (code_prefix << table_nb_bits) | i, | |
291 n_prefix + table_nb_bits); | |
292 if (index < 0) | |
293 return -1; | |
294 /* 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
|
295 table = &vlc->table[table_index]; |
535 | 296 table[i][0] = index; //code |
0 | 297 } |
298 } | |
299 return table_index; | |
300 } | |
301 | |
302 | |
24 | 303 /* Build VLC decoding tables suitable for use with get_vlc(). |
304 | |
305 'nb_bits' set thee decoding table size (2^nb_bits) entries. The | |
306 bigger it is, the faster is the decoding. But it should not be too | |
307 big to save memory and L1 cache. '9' is a good compromise. | |
308 | |
309 'nb_codes' : number of vlcs codes | |
310 | |
311 'bits' : table which gives the size (in bits) of each vlc code. | |
312 | |
313 'codes' : table which gives the bit pattern of of each vlc code. | |
314 | |
315 'xxx_wrap' : give the number of bytes between each entry of the | |
316 'bits' or 'codes' tables. | |
317 | |
318 'xxx_size' : gives the number of bytes of each entry of the 'bits' | |
319 or 'codes' tables. | |
320 | |
321 'wrap' and 'size' allows to use any memory configuration and types | |
322 (byte/word/long) to store the 'bits' and 'codes' tables. | |
323 */ | |
0 | 324 int init_vlc(VLC *vlc, int nb_bits, int nb_codes, |
325 const void *bits, int bits_wrap, int bits_size, | |
326 const void *codes, int codes_wrap, int codes_size) | |
327 { | |
328 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
|
329 vlc->table = NULL; |
0 | 330 vlc->table_allocated = 0; |
331 vlc->table_size = 0; | |
332 #ifdef DEBUG_VLC | |
333 printf("build table nb_codes=%d\n", nb_codes); | |
334 #endif | |
335 | |
336 if (build_table(vlc, nb_bits, nb_codes, | |
337 bits, bits_wrap, bits_size, | |
338 codes, codes_wrap, codes_size, | |
339 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
|
340 av_free(vlc->table); |
0 | 341 return -1; |
342 } | |
343 return 0; | |
344 } | |
345 | |
346 | |
347 void free_vlc(VLC *vlc) | |
348 { | |
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
|
349 av_free(vlc->table); |
0 | 350 } |
351 | |
1126
77ccf7fe3bd0
per context frame_rate_base, this should finally fix frame_rate related av sync issues
michaelni
parents:
1106
diff
changeset
|
352 int64_t ff_gcd(int64_t a, int64_t b){ |
324 | 353 if(b) return ff_gcd(b, a%b); |
354 else return a; | |
355 } | |
880 | 356 |
357 void ff_float2fraction(int *nom_arg, int *denom_arg, double f, int max){ | |
358 double best_diff=1E10, diff; | |
359 int best_denom=1, best_nom=1; | |
360 int nom, denom, gcd; | |
361 | |
362 //brute force here, perhaps we should try continued fractions if we need large max ... | |
363 for(denom=1; denom<=max; denom++){ | |
364 nom= (int)(f*denom + 0.5); | |
365 if(nom<=0 || nom>max) continue; | |
366 | |
367 diff= ABS( f - (double)nom / (double)denom ); | |
368 if(diff < best_diff){ | |
369 best_diff= diff; | |
370 best_nom= nom; | |
371 best_denom= denom; | |
372 } | |
373 } | |
374 | |
375 gcd= ff_gcd(best_nom, best_denom); | |
376 best_nom /= gcd; | |
377 best_denom /= gcd; | |
378 | |
379 *nom_arg= best_nom; | |
380 *denom_arg= best_denom; | |
381 } |