diff options
Diffstat (limited to 'apps/codecs/libtremor/res012.c')
-rw-r--r-- | apps/codecs/libtremor/res012.c | 344 |
1 files changed, 344 insertions, 0 deletions
diff --git a/apps/codecs/libtremor/res012.c b/apps/codecs/libtremor/res012.c new file mode 100644 index 0000000000..46b782def1 --- /dev/null +++ b/apps/codecs/libtremor/res012.c | |||
@@ -0,0 +1,344 @@ | |||
1 | /******************************************************************** | ||
2 | * * | ||
3 | * THIS FILE IS PART OF THE OggVorbis 'TREMOR' CODEC SOURCE CODE. * | ||
4 | * * | ||
5 | * USE, DISTRIBUTION AND REPRODUCTION OF THIS LIBRARY SOURCE IS * | ||
6 | * GOVERNED BY A BSD-STYLE SOURCE LICENSE INCLUDED WITH THIS SOURCE * | ||
7 | * IN 'COPYING'. PLEASE READ THESE TERMS BEFORE DISTRIBUTING. * | ||
8 | * * | ||
9 | * THE OggVorbis 'TREMOR' SOURCE CODE IS (C) COPYRIGHT 1994-2002 * | ||
10 | * BY THE Xiph.Org FOUNDATION http://www.xiph.org/ * | ||
11 | * * | ||
12 | ******************************************************************** | ||
13 | |||
14 | function: residue backend 0, 1 and 2 implementation | ||
15 | |||
16 | ********************************************************************/ | ||
17 | |||
18 | #include "config-tremor.h" | ||
19 | #include <string.h> | ||
20 | #include <math.h> | ||
21 | #include "ogg.h" | ||
22 | #include "ivorbiscodec.h" | ||
23 | #include "codec_internal.h" | ||
24 | #include "registry.h" | ||
25 | #include "codebook.h" | ||
26 | #include "misc.h" | ||
27 | #include "os.h" | ||
28 | |||
29 | typedef struct { | ||
30 | vorbis_info_residue0 *info; | ||
31 | int map; | ||
32 | |||
33 | int parts; | ||
34 | int stages; | ||
35 | codebook *fullbooks; | ||
36 | codebook *phrasebook; | ||
37 | codebook ***partbooks; | ||
38 | |||
39 | int partvals; | ||
40 | int **decodemap; | ||
41 | |||
42 | } vorbis_look_residue0; | ||
43 | |||
44 | static void res0_free_info(vorbis_info_residue *i){ | ||
45 | vorbis_info_residue0 *info=(vorbis_info_residue0 *)i; | ||
46 | if(info){ | ||
47 | memset(info,0,sizeof(*info)); | ||
48 | _ogg_free(info); | ||
49 | } | ||
50 | } | ||
51 | |||
52 | static void res0_free_look(vorbis_look_residue *i){ | ||
53 | int j; | ||
54 | if(i){ | ||
55 | |||
56 | vorbis_look_residue0 *look=(vorbis_look_residue0 *)i; | ||
57 | |||
58 | for(j=0;j<look->parts;j++) | ||
59 | if(look->partbooks[j])_ogg_free(look->partbooks[j]); | ||
60 | _ogg_free(look->partbooks); | ||
61 | for(j=0;j<look->partvals;j++) | ||
62 | _ogg_free(look->decodemap[j]); | ||
63 | _ogg_free(look->decodemap); | ||
64 | |||
65 | memset(look,0,sizeof(*look)); | ||
66 | _ogg_free(look); | ||
67 | } | ||
68 | } | ||
69 | |||
70 | static int ilog(unsigned int v){ | ||
71 | int ret=0; | ||
72 | while(v){ | ||
73 | ret++; | ||
74 | v>>=1; | ||
75 | } | ||
76 | return(ret); | ||
77 | } | ||
78 | |||
79 | static int icount(unsigned int v){ | ||
80 | int ret=0; | ||
81 | while(v){ | ||
82 | ret+=v&1; | ||
83 | v>>=1; | ||
84 | } | ||
85 | return(ret); | ||
86 | } | ||
87 | |||
88 | /* vorbis_info is for range checking */ | ||
89 | static vorbis_info_residue *res0_unpack(vorbis_info *vi,oggpack_buffer *opb){ | ||
90 | int j,acc=0; | ||
91 | vorbis_info_residue0 *info=(vorbis_info_residue0 *)_ogg_calloc(1,sizeof(*info)); | ||
92 | codec_setup_info *ci=(codec_setup_info *)vi->codec_setup; | ||
93 | |||
94 | info->begin=oggpack_read(opb,24); | ||
95 | info->end=oggpack_read(opb,24); | ||
96 | info->grouping=oggpack_read(opb,24)+1; | ||
97 | info->partitions=oggpack_read(opb,6)+1; | ||
98 | info->groupbook=oggpack_read(opb,8); | ||
99 | |||
100 | for(j=0;j<info->partitions;j++){ | ||
101 | int cascade=oggpack_read(opb,3); | ||
102 | if(oggpack_read(opb,1)) | ||
103 | cascade|=(oggpack_read(opb,5)<<3); | ||
104 | info->secondstages[j]=cascade; | ||
105 | |||
106 | acc+=icount(cascade); | ||
107 | } | ||
108 | for(j=0;j<acc;j++) | ||
109 | info->booklist[j]=oggpack_read(opb,8); | ||
110 | |||
111 | if(info->groupbook>=ci->books)goto errout; | ||
112 | for(j=0;j<acc;j++) | ||
113 | if(info->booklist[j]>=ci->books)goto errout; | ||
114 | |||
115 | return(info); | ||
116 | errout: | ||
117 | res0_free_info(info); | ||
118 | return(NULL); | ||
119 | } | ||
120 | |||
121 | static vorbis_look_residue *res0_look(vorbis_dsp_state *vd,vorbis_info_mode *vm, | ||
122 | vorbis_info_residue *vr){ | ||
123 | vorbis_info_residue0 *info=(vorbis_info_residue0 *)vr; | ||
124 | vorbis_look_residue0 *look=(vorbis_look_residue0 *)_ogg_calloc(1,sizeof(*look)); | ||
125 | codec_setup_info *ci=(codec_setup_info *)vd->vi->codec_setup; | ||
126 | |||
127 | int j,k,acc=0; | ||
128 | int dim; | ||
129 | int maxstage=0; | ||
130 | look->info=info; | ||
131 | look->map=vm->mapping; | ||
132 | |||
133 | look->parts=info->partitions; | ||
134 | look->fullbooks=ci->fullbooks; | ||
135 | look->phrasebook=ci->fullbooks+info->groupbook; | ||
136 | dim=look->phrasebook->dim; | ||
137 | |||
138 | look->partbooks=(codebook ***)_ogg_calloc(look->parts,sizeof(*look->partbooks)); | ||
139 | |||
140 | for(j=0;j<look->parts;j++){ | ||
141 | int stages=ilog(info->secondstages[j]); | ||
142 | if(stages){ | ||
143 | if(stages>maxstage)maxstage=stages; | ||
144 | look->partbooks[j]=(codebook **)_ogg_calloc(stages,sizeof(*look->partbooks[j])); | ||
145 | for(k=0;k<stages;k++) | ||
146 | if(info->secondstages[j]&(1<<k)){ | ||
147 | look->partbooks[j][k]=ci->fullbooks+info->booklist[acc++]; | ||
148 | #ifdef TRAIN_RES | ||
149 | look->training_data[k][j]=calloc(look->partbooks[j][k]->entries, | ||
150 | sizeof(***look->training_data)); | ||
151 | #endif | ||
152 | } | ||
153 | } | ||
154 | } | ||
155 | |||
156 | look->partvals=look->parts; | ||
157 | for(j=1;j<dim;j++)look->partvals*=look->parts; | ||
158 | look->stages=maxstage; | ||
159 | look->decodemap=(int **)_ogg_malloc(look->partvals*sizeof(*look->decodemap)); | ||
160 | for(j=0;j<look->partvals;j++){ | ||
161 | long val=j; | ||
162 | long mult=look->partvals/look->parts; | ||
163 | look->decodemap[j]=(int *)_ogg_malloc(dim*sizeof(*look->decodemap[j])); | ||
164 | for(k=0;k<dim;k++){ | ||
165 | long deco=val/mult; | ||
166 | val-=deco*mult; | ||
167 | mult/=look->parts; | ||
168 | look->decodemap[j][k]=deco; | ||
169 | } | ||
170 | } | ||
171 | |||
172 | return(look); | ||
173 | } | ||
174 | |||
175 | #define CHANNELS 2 | ||
176 | |||
177 | /* a truncated packet here just means 'stop working'; it's not an error */ | ||
178 | static int _01inverse(vorbis_block *vb,vorbis_look_residue *vl, | ||
179 | ogg_int32_t **in,int ch, | ||
180 | long (*decodepart)(codebook *, ogg_int32_t *, | ||
181 | oggpack_buffer *,int,int)){ | ||
182 | |||
183 | long i,j,k,l,s; | ||
184 | vorbis_look_residue0 *look=(vorbis_look_residue0 *)vl; | ||
185 | vorbis_info_residue0 *info=look->info; | ||
186 | |||
187 | /* move all this setup out later */ | ||
188 | int samples_per_partition=info->grouping; | ||
189 | int partitions_per_word=look->phrasebook->dim; | ||
190 | int max=vb->pcmend>>1; | ||
191 | int end=(info->end<max?info->end:max); | ||
192 | int n=end-info->begin; | ||
193 | |||
194 | if(n>0){ | ||
195 | int partvals=n/samples_per_partition; | ||
196 | int partwords=(partvals+partitions_per_word-1)/partitions_per_word; | ||
197 | int ***partword=(int ***)alloca(ch*sizeof(*partword)); | ||
198 | |||
199 | for(j=0;j<ch;j++) | ||
200 | partword[j]=(int **)_vorbis_block_alloc(vb,partwords*sizeof(*partword[j])); | ||
201 | |||
202 | for(s=0;s<look->stages;s++){ | ||
203 | |||
204 | /* each loop decodes on partition codeword containing | ||
205 | partitions_pre_word partitions */ | ||
206 | for(i=0,l=0;i<partvals;l++){ | ||
207 | if(s==0){ | ||
208 | /* fetch the partition word for each channel */ | ||
209 | for(j=0;j<ch;j++){ | ||
210 | int temp=vorbis_book_decode(look->phrasebook,&vb->opb); | ||
211 | if(temp==-1)goto eopbreak; | ||
212 | partword[j][l]=look->decodemap[temp]; | ||
213 | if(partword[j][l]==NULL)goto errout; | ||
214 | } | ||
215 | } | ||
216 | |||
217 | /* now we decode residual values for the partitions */ | ||
218 | for(k=0;k<partitions_per_word && i<partvals;k++,i++) | ||
219 | for(j=0;j<ch;j++){ | ||
220 | long offset=info->begin+i*samples_per_partition; | ||
221 | if(info->secondstages[partword[j][l][k]]&(1<<s)){ | ||
222 | codebook *stagebook=look->partbooks[partword[j][l][k]][s]; | ||
223 | if(stagebook){ | ||
224 | if(decodepart(stagebook,in[j]+offset,&vb->opb, | ||
225 | samples_per_partition,-8)==-1)goto eopbreak; | ||
226 | } | ||
227 | } | ||
228 | } | ||
229 | } | ||
230 | } | ||
231 | } | ||
232 | errout: | ||
233 | eopbreak: | ||
234 | return(0); | ||
235 | } | ||
236 | |||
237 | static int res0_inverse(vorbis_block *vb,vorbis_look_residue *vl, | ||
238 | ogg_int32_t **in,int *nonzero,int ch){ | ||
239 | int i,used=0; | ||
240 | for(i=0;i<ch;i++) | ||
241 | if(nonzero[i]) | ||
242 | in[used++]=in[i]; | ||
243 | if(used) | ||
244 | return(_01inverse(vb,vl,in,used,vorbis_book_decodevs_add)); | ||
245 | else | ||
246 | return(0); | ||
247 | } | ||
248 | |||
249 | static int res1_inverse(vorbis_block *vb,vorbis_look_residue *vl, | ||
250 | ogg_int32_t **in,int *nonzero,int ch){ | ||
251 | int i,used=0; | ||
252 | for(i=0;i<ch;i++) | ||
253 | if(nonzero[i]) | ||
254 | in[used++]=in[i]; | ||
255 | if(used) | ||
256 | return(_01inverse(vb,vl,in,used,vorbis_book_decodev_add)); | ||
257 | else | ||
258 | return(0); | ||
259 | } | ||
260 | |||
261 | /* duplicate code here as speed is somewhat more important */ | ||
262 | int res2_inverse(vorbis_block *vb,vorbis_look_residue *vl, | ||
263 | ogg_int32_t **in,int *nonzero,int ch) | ||
264 | ICODE_ATTR_TREMOR_NOT_MDCT; | ||
265 | int res2_inverse(vorbis_block *vb,vorbis_look_residue *vl, | ||
266 | ogg_int32_t **in,int *nonzero,int ch){ | ||
267 | long i,k,l,s; | ||
268 | vorbis_look_residue0 *look=(vorbis_look_residue0 *)vl; | ||
269 | vorbis_info_residue0 *info=look->info; | ||
270 | |||
271 | /* move all this setup out later */ | ||
272 | int samples_per_partition=info->grouping; | ||
273 | int partitions_per_word=look->phrasebook->dim; | ||
274 | int max=(vb->pcmend*ch)>>1; | ||
275 | int end=(info->end<max?info->end:max); | ||
276 | int n=end-info->begin; | ||
277 | |||
278 | if(n>0){ | ||
279 | |||
280 | int partvals=n/samples_per_partition; | ||
281 | int partwords=(partvals+partitions_per_word-1)/partitions_per_word; | ||
282 | int **partword=(int **)_vorbis_block_alloc(vb,partwords*sizeof(*partword)); | ||
283 | int beginoff=info->begin/ch; | ||
284 | |||
285 | for(i=0;i<ch;i++)if(nonzero[i])break; | ||
286 | if(i==ch)return(0); /* no nonzero vectors */ | ||
287 | |||
288 | samples_per_partition/=ch; | ||
289 | |||
290 | for(s=0;s<look->stages;s++){ | ||
291 | for(i=0,l=0;i<partvals;l++){ | ||
292 | |||
293 | if(s==0){ | ||
294 | /* fetch the partition word */ | ||
295 | int temp=vorbis_book_decode(look->phrasebook,&vb->opb); | ||
296 | if(temp==-1)goto eopbreak; | ||
297 | partword[l]=look->decodemap[temp]; | ||
298 | if(partword[l]==NULL)goto errout; | ||
299 | } | ||
300 | |||
301 | /* now we decode residual values for the partitions */ | ||
302 | for(k=0;k<partitions_per_word && i<partvals;k++,i++) | ||
303 | if(info->secondstages[partword[l][k]]&(1<<s)){ | ||
304 | codebook *stagebook=look->partbooks[partword[l][k]][s]; | ||
305 | if(stagebook){ | ||
306 | if(vorbis_book_decodevv_add(stagebook,in, | ||
307 | i*samples_per_partition+beginoff,ch, | ||
308 | &vb->opb, | ||
309 | samples_per_partition,-8)==-1) | ||
310 | goto eopbreak; | ||
311 | } | ||
312 | } | ||
313 | } | ||
314 | } | ||
315 | } | ||
316 | errout: | ||
317 | eopbreak: | ||
318 | return(0); | ||
319 | } | ||
320 | |||
321 | |||
322 | const vorbis_func_residue residue0_exportbundle ICONST_ATTR ={ | ||
323 | &res0_unpack, | ||
324 | &res0_look, | ||
325 | &res0_free_info, | ||
326 | &res0_free_look, | ||
327 | &res0_inverse | ||
328 | }; | ||
329 | |||
330 | const vorbis_func_residue residue1_exportbundle ICONST_ATTR ={ | ||
331 | &res0_unpack, | ||
332 | &res0_look, | ||
333 | &res0_free_info, | ||
334 | &res0_free_look, | ||
335 | &res1_inverse | ||
336 | }; | ||
337 | |||
338 | const vorbis_func_residue residue2_exportbundle ICONST_ATTR ={ | ||
339 | &res0_unpack, | ||
340 | &res0_look, | ||
341 | &res0_free_info, | ||
342 | &res0_free_look, | ||
343 | &res2_inverse | ||
344 | }; | ||