Mercurial > libavcodec.hg
annotate common.c @ 579:ba17f7dbe745 libavcodec
moved codebooks to svq1_cb.h
author | al3x |
---|---|
date | Mon, 22 Jul 2002 20:51:26 +0000 |
parents | 7f1b09bb34c6 |
children | 153a7ffd289b |
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 */ |
524 | 21 #include "avcodec.h" |
8 | 22 |
0 | 23 void init_put_bits(PutBitContext *s, |
24 UINT8 *buffer, int buffer_size, | |
25 void *opaque, | |
26 void (*write_data)(void *, UINT8 *, int)) | |
27 { | |
28 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
|
29 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
|
30 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
|
31 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
|
32 { |
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
|
33 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
|
34 } |
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
|
35 #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
|
36 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
|
37 ((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
|
38 // 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
|
39 #else |
0 | 40 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
|
41 s->bit_left=32; |
0 | 42 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
|
43 #endif |
0 | 44 } |
45 | |
46 /* return the number of bits output */ | |
64 | 47 INT64 get_bit_count(PutBitContext *s) |
0 | 48 { |
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
|
49 #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
|
50 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
|
51 #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
|
52 return (s->buf_ptr - s->buf + s->data_out_size) * 8 + 32 - (INT64)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
|
53 #endif |
0 | 54 } |
55 | |
56 void align_put_bits(PutBitContext *s) | |
57 { | |
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
|
58 #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
|
59 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
|
60 #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
|
61 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
|
62 #endif |
0 | 63 } |
64 | |
65 /* pad the end of the output stream with zeros */ | |
66 void flush_put_bits(PutBitContext *s) | |
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 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
|
70 #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
|
71 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
|
72 while (s->bit_left < 32) { |
0 | 73 /* XXX: should test end of buffer */ |
74 *s->buf_ptr++=s->bit_buf >> 24; | |
75 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
|
76 s->bit_left+=8; |
0 | 77 } |
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
|
78 s->bit_left=32; |
0 | 79 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
|
80 #endif |
0 | 81 } |
82 | |
83 /* pad the end of the output stream with zeros */ | |
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 #ifndef ALT_BITSTREAM_WRITER |
0 | 85 void jflush_put_bits(PutBitContext *s) |
86 { | |
87 unsigned int b; | |
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
|
88 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
|
89 s->bit_buf |= ~1U >> (32 - s->bit_left); /* set all the unused bits to one */ |
0 | 90 |
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
|
91 while (s->bit_left < 32) { |
0 | 92 b = s->bit_buf >> 24; |
93 *s->buf_ptr++ = b; | |
94 if (b == 0xff) | |
95 *s->buf_ptr++ = 0; | |
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; |
101 } | |
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
|
102 #else |
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
|
103 void jflush_put_bits(PutBitContext *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
|
104 { |
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
|
105 int num= ( - s->index) & 7; |
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
|
106 jput_bits(s, num,0xFF>>(8-num)); |
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
|
107 } |
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 |
358 | 110 void put_string(PutBitContext * pbc, char *s) |
111 { | |
112 while(*s){ | |
113 put_bits(pbc, 8, *s); | |
114 s++; | |
115 } | |
116 put_bits(pbc, 8, 0); | |
117 } | |
118 | |
0 | 119 /* bit input functions */ |
120 | |
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
|
121 void init_get_bits(GetBitContext *s, |
0 | 122 UINT8 *buffer, int buffer_size) |
123 { | |
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
|
124 s->buffer= 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
|
125 s->size= buffer_size; |
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 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
|
127 #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
|
128 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
|
129 #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
|
130 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
|
131 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
|
132 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
|
133 #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
|
134 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
|
135 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
|
136 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
|
137 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
|
138 #endif |
20
907b67420d84
inlineing common case of get_bits() -> gives 2speedup. more optim coming soon...
arpi_esp
parents:
8
diff
changeset
|
139 { |
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
|
140 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
|
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 // 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
|
143 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
|
144 } |
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 #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
|
146 s->cache1 = 0; |
8 | 147 #endif |
0 | 148 } |
149 | |
150 void align_get_bits(GetBitContext *s) | |
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 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
|
153 if(n) skip_bits(s, n); |
0 | 154 } |
192
1e5f64be86fc
another bitstream reader code (faster on intel cpus) - patch by Michael Niedermayer <michaelni@gmx.at>
uid46427
parents:
144
diff
changeset
|
155 |
264
28c5c62b1c4c
support decoding (with mplayer) of 3 .mp4 files from mphq
michaelni
parents:
238
diff
changeset
|
156 int check_marker(GetBitContext *s, char *msg) |
28c5c62b1c4c
support decoding (with mplayer) of 3 .mp4 files from mphq
michaelni
parents:
238
diff
changeset
|
157 { |
28c5c62b1c4c
support decoding (with mplayer) of 3 .mp4 files from mphq
michaelni
parents:
238
diff
changeset
|
158 int bit= get_bits1(s); |
28c5c62b1c4c
support decoding (with mplayer) of 3 .mp4 files from mphq
michaelni
parents:
238
diff
changeset
|
159 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
|
160 |
28c5c62b1c4c
support decoding (with mplayer) of 3 .mp4 files from mphq
michaelni
parents:
238
diff
changeset
|
161 return bit; |
28c5c62b1c4c
support decoding (with mplayer) of 3 .mp4 files from mphq
michaelni
parents:
238
diff
changeset
|
162 } |
28c5c62b1c4c
support decoding (with mplayer) of 3 .mp4 files from mphq
michaelni
parents:
238
diff
changeset
|
163 |
0 | 164 /* VLC decoding */ |
165 | |
166 //#define DEBUG_VLC | |
167 | |
168 #define GET_DATA(v, table, i, wrap, size) \ | |
169 {\ | |
170 UINT8 *ptr = (UINT8 *)table + i * wrap;\ | |
171 switch(size) {\ | |
172 case 1:\ | |
173 v = *(UINT8 *)ptr;\ | |
174 break;\ | |
175 case 2:\ | |
176 v = *(UINT16 *)ptr;\ | |
177 break;\ | |
178 default:\ | |
179 v = *(UINT32 *)ptr;\ | |
180 break;\ | |
181 }\ | |
182 } | |
183 | |
184 | |
185 static int alloc_table(VLC *vlc, int size) | |
186 { | |
187 int index; | |
188 index = vlc->table_size; | |
189 vlc->table_size += size; | |
190 if (vlc->table_size > vlc->table_allocated) { | |
191 vlc->table_allocated += (1 << vlc->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
|
192 vlc->table = realloc(vlc->table, |
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 sizeof(VLC_TYPE) * 2 * vlc->table_allocated); |
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
|
194 if (!vlc->table) |
0 | 195 return -1; |
196 } | |
197 return index; | |
198 } | |
199 | |
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
|
200 static int build_table(VLC *vlc, int table_nb_bits, |
0 | 201 int nb_codes, |
202 const void *bits, int bits_wrap, int bits_size, | |
203 const void *codes, int codes_wrap, int codes_size, | |
204 UINT32 code_prefix, int n_prefix) | |
205 { | |
206 int i, j, k, n, table_size, table_index, nb, n1, index; | |
207 UINT32 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
|
208 VLC_TYPE (*table)[2]; |
0 | 209 |
210 table_size = 1 << table_nb_bits; | |
211 table_index = alloc_table(vlc, table_size); | |
212 #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
|
213 printf("new table index=%d size=%d code_prefix=%x n=%d\n", |
0 | 214 table_index, table_size, code_prefix, n_prefix); |
215 #endif | |
216 if (table_index < 0) | |
217 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
|
218 table = &vlc->table[table_index]; |
0 | 219 |
220 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
|
221 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
|
222 table[i][0] = -1; //codes |
0 | 223 } |
224 | |
225 /* first pass: map codes and compute auxillary table sizes */ | |
226 for(i=0;i<nb_codes;i++) { | |
227 GET_DATA(n, bits, i, bits_wrap, bits_size); | |
228 GET_DATA(code, codes, i, codes_wrap, codes_size); | |
229 /* we accept tables with holes */ | |
230 if (n <= 0) | |
231 continue; | |
232 #if defined(DEBUG_VLC) && 0 | |
233 printf("i=%d n=%d code=0x%x\n", i, n, code); | |
234 #endif | |
235 /* if code matches the prefix, it is in the table */ | |
236 n -= n_prefix; | |
237 if (n > 0 && (code >> n) == code_prefix) { | |
238 if (n <= table_nb_bits) { | |
239 /* no need to add another table */ | |
240 j = (code << (table_nb_bits - n)) & (table_size - 1); | |
241 nb = 1 << (table_nb_bits - n); | |
242 for(k=0;k<nb;k++) { | |
243 #ifdef DEBUG_VLC | |
244 printf("%4x: code=%d n=%d\n", | |
245 j, i, n); | |
246 #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
|
247 if (table[j][1] /*bits*/ != 0) { |
0 | 248 fprintf(stderr, "incorrect codes\n"); |
249 exit(1); | |
250 } | |
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
|
251 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
|
252 table[j][0] = i; //code |
0 | 253 j++; |
254 } | |
255 } else { | |
256 n -= table_nb_bits; | |
257 j = (code >> n) & ((1 << table_nb_bits) - 1); | |
258 #ifdef DEBUG_VLC | |
259 printf("%4x: n=%d (subtable)\n", | |
260 j, n); | |
261 #endif | |
262 /* 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
|
263 n1 = -table[j][1]; //bits |
0 | 264 if (n > n1) |
265 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
|
266 table[j][1] = -n1; //bits |
0 | 267 } |
268 } | |
269 } | |
270 | |
271 /* second pass : fill auxillary tables recursively */ | |
272 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
|
273 n = table[i][1]; //bits |
0 | 274 if (n < 0) { |
275 n = -n; | |
276 if (n > table_nb_bits) { | |
277 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
|
278 table[i][1] = -n; //bits |
0 | 279 } |
280 index = build_table(vlc, n, nb_codes, | |
281 bits, bits_wrap, bits_size, | |
282 codes, codes_wrap, codes_size, | |
283 (code_prefix << table_nb_bits) | i, | |
284 n_prefix + table_nb_bits); | |
285 if (index < 0) | |
286 return -1; | |
287 /* 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
|
288 table = &vlc->table[table_index]; |
535 | 289 table[i][0] = index; //code |
0 | 290 } |
291 } | |
292 return table_index; | |
293 } | |
294 | |
295 | |
24 | 296 /* Build VLC decoding tables suitable for use with get_vlc(). |
297 | |
298 'nb_bits' set thee decoding table size (2^nb_bits) entries. The | |
299 bigger it is, the faster is the decoding. But it should not be too | |
300 big to save memory and L1 cache. '9' is a good compromise. | |
301 | |
302 'nb_codes' : number of vlcs codes | |
303 | |
304 'bits' : table which gives the size (in bits) of each vlc code. | |
305 | |
306 'codes' : table which gives the bit pattern of of each vlc code. | |
307 | |
308 'xxx_wrap' : give the number of bytes between each entry of the | |
309 'bits' or 'codes' tables. | |
310 | |
311 'xxx_size' : gives the number of bytes of each entry of the 'bits' | |
312 or 'codes' tables. | |
313 | |
314 'wrap' and 'size' allows to use any memory configuration and types | |
315 (byte/word/long) to store the 'bits' and 'codes' tables. | |
316 */ | |
0 | 317 int init_vlc(VLC *vlc, int nb_bits, int nb_codes, |
318 const void *bits, int bits_wrap, int bits_size, | |
319 const void *codes, int codes_wrap, int codes_size) | |
320 { | |
321 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
|
322 vlc->table = NULL; |
0 | 323 vlc->table_allocated = 0; |
324 vlc->table_size = 0; | |
325 #ifdef DEBUG_VLC | |
326 printf("build table nb_codes=%d\n", nb_codes); | |
327 #endif | |
328 | |
329 if (build_table(vlc, nb_bits, nb_codes, | |
330 bits, bits_wrap, bits_size, | |
331 codes, codes_wrap, codes_size, | |
332 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
|
333 av_free(vlc->table); |
0 | 334 return -1; |
335 } | |
336 return 0; | |
337 } | |
338 | |
339 | |
340 void free_vlc(VLC *vlc) | |
341 { | |
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
|
342 av_free(vlc->table); |
0 | 343 } |
344 | |
324 | 345 int ff_gcd(int a, int b){ |
346 if(b) return ff_gcd(b, a%b); | |
347 else return a; | |
348 } |