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