Mercurial > audlegacy
comparison Plugins/Input/aac/libfaad2/sbr_fbt.c @ 61:fa848bd484d8 trunk
[svn] Move plugins to Plugins/
author | nenolod |
---|---|
date | Fri, 28 Oct 2005 22:58:11 -0700 |
parents | |
children | 0a2ad94e8607 |
comparison
equal
deleted
inserted
replaced
60:1771f253e1b2 | 61:fa848bd484d8 |
---|---|
1 /* | |
2 ** FAAD2 - Freeware Advanced Audio (AAC) Decoder including SBR decoding | |
3 ** Copyright (C) 2003 M. Bakker, Ahead Software AG, http://www.nero.com | |
4 ** | |
5 ** This program is free software; you can redistribute it and/or modify | |
6 ** it under the terms of the GNU General Public License as published by | |
7 ** the Free Software Foundation; either version 2 of the License, or | |
8 ** (at your option) any later version. | |
9 ** | |
10 ** This program is distributed in the hope that it will be useful, | |
11 ** but WITHOUT ANY WARRANTY; without even the implied warranty of | |
12 ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
13 ** GNU General Public License for more details. | |
14 ** | |
15 ** You should have received a copy of the GNU General Public License | |
16 ** along with this program; if not, write to the Free Software | |
17 ** Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. | |
18 ** | |
19 ** Any non-GPL usage of this software or parts of this software is strictly | |
20 ** forbidden. | |
21 ** | |
22 ** Commercial non-GPL licensing of this software is possible. | |
23 ** For more info contact Ahead Software through Mpeg4AAClicense@nero.com. | |
24 ** | |
25 ** $Id: sbr_fbt.c,v 1.7 2003/11/12 20:47:58 menno Exp $ | |
26 **/ | |
27 | |
28 /* Calculate frequency band tables */ | |
29 | |
30 #include "common.h" | |
31 #include "structs.h" | |
32 | |
33 #ifdef SBR_DEC | |
34 | |
35 #include <stdlib.h> | |
36 | |
37 #include "sbr_syntax.h" | |
38 #include "sbr_fbt.h" | |
39 | |
40 /* calculate the start QMF channel for the master frequency band table */ | |
41 /* parameter is also called k0 */ | |
42 uint8_t qmf_start_channel(uint8_t bs_start_freq, uint8_t bs_samplerate_mode, | |
43 uint32_t sample_rate) | |
44 { | |
45 static const uint8_t startMinTable[12] = { 7, 7, 10, 11, 12, 16, 16, | |
46 17, 24, 32, 35, 48 }; | |
47 static const uint8_t offsetIndexTable[12] = { 5, 5, 4, 4, 4, 3, 2, 1, 0, | |
48 6, 6, 6 }; | |
49 static const int8_t offset[7][16] = { | |
50 { -8, -7, -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7 }, | |
51 { -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 9, 11, 13 }, | |
52 { -5, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 9, 11, 13, 16 }, | |
53 { -6, -4, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 9, 11, 13, 16 }, | |
54 { -4, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 9, 11, 13, 16, 20 }, | |
55 { -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 9, 11, 13, 16, 20, 24 }, | |
56 { 0, 1, 2, 3, 4, 5, 6, 7, 9, 11, 13, 16, 20, 24, 28, 33 } | |
57 }; | |
58 uint8_t startMin = startMinTable[get_sr_index(sample_rate)]; | |
59 uint8_t offsetIndex = offsetIndexTable[get_sr_index(sample_rate)]; | |
60 | |
61 #if 0 /* replaced with table (startMinTable) */ | |
62 if (sample_rate >= 64000) | |
63 { | |
64 startMin = (uint8_t)((5000.*128.)/(float)sample_rate + 0.5); | |
65 } else if (sample_rate < 32000) { | |
66 startMin = (uint8_t)((3000.*128.)/(float)sample_rate + 0.5); | |
67 } else { | |
68 startMin = (uint8_t)((4000.*128.)/(float)sample_rate + 0.5); | |
69 } | |
70 #endif | |
71 | |
72 if (bs_samplerate_mode) | |
73 { | |
74 return startMin + offset[offsetIndex][bs_start_freq]; | |
75 | |
76 #if 0 /* replaced by offsetIndexTable */ | |
77 switch (sample_rate) | |
78 { | |
79 case 16000: | |
80 return startMin + offset[0][bs_start_freq]; | |
81 case 22050: | |
82 return startMin + offset[1][bs_start_freq]; | |
83 case 24000: | |
84 return startMin + offset[2][bs_start_freq]; | |
85 case 32000: | |
86 return startMin + offset[3][bs_start_freq]; | |
87 default: | |
88 if (sample_rate > 64000) | |
89 { | |
90 return startMin + offset[5][bs_start_freq]; | |
91 } else { /* 44100 <= sample_rate <= 64000 */ | |
92 return startMin + offset[4][bs_start_freq]; | |
93 } | |
94 } | |
95 #endif | |
96 } else { | |
97 return startMin + offset[6][bs_start_freq]; | |
98 } | |
99 } | |
100 | |
101 static int32_t longcmp(const void *a, const void *b) | |
102 { | |
103 return ((int32_t)(*(int32_t*)a - *(int32_t*)b)); | |
104 } | |
105 | |
106 /* calculate the stop QMF channel for the master frequency band table */ | |
107 /* parameter is also called k2 */ | |
108 uint8_t qmf_stop_channel(uint8_t bs_stop_freq, uint32_t sample_rate, | |
109 uint8_t k0) | |
110 { | |
111 if (bs_stop_freq == 15) | |
112 { | |
113 return min(64, k0 * 3); | |
114 } else if (bs_stop_freq == 14) { | |
115 return min(64, k0 * 2); | |
116 } else { | |
117 static const uint8_t stopMinTable[12] = { 13, 15, 20, 21, 23, | |
118 32, 32, 35, 48, 64, 70, 96 }; | |
119 static const int8_t offset[12][14] = { | |
120 { 0, 2, 4, 6, 8, 11, 14, 18, 22, 26, 31, 37, 44, 51 }, | |
121 { 0, 2, 4, 6, 8, 11, 14, 18, 22, 26, 31, 36, 42, 49 }, | |
122 { 0, 2, 4, 6, 8, 11, 14, 17, 21, 25, 29, 34, 39, 44 }, | |
123 { 0, 2, 4, 6, 8, 11, 14, 17, 20, 24, 28, 33, 38, 43 }, | |
124 { 0, 2, 4, 6, 8, 11, 14, 17, 20, 24, 28, 32, 36, 41 }, | |
125 { 0, 2, 4, 6, 8, 10, 12, 14, 17, 20, 23, 26, 29, 32 }, | |
126 { 0, 2, 4, 6, 8, 10, 12, 14, 17, 20, 23, 26, 29, 32 }, | |
127 { 0, 1, 3, 5, 7, 9, 11, 13, 15, 17, 20, 23, 26, 29 }, | |
128 { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 16 }, | |
129 { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, | |
130 { 0, -1, -2, -3, -4, -5, -6, -6, -6, -6, -6, -6, -6, -6 }, | |
131 { 0, -3, -6, -9, -12, -15, -18, -20, -22, -24, -26, -28, -30, -32 } | |
132 }; | |
133 #if 0 | |
134 uint8_t i; | |
135 int32_t stopDk[13], stopDk_t[14], k2; | |
136 #endif | |
137 uint8_t stopMin = stopMinTable[get_sr_index(sample_rate)]; | |
138 | |
139 #if 0 /* replaced by table lookup */ | |
140 if (sample_rate >= 64000) | |
141 { | |
142 stopMin = (uint8_t)((10000.*128.)/(float)sample_rate + 0.5); | |
143 } else if (sample_rate < 32000) { | |
144 stopMin = (uint8_t)((6000.*128.)/(float)sample_rate + 0.5); | |
145 } else { | |
146 stopMin = (uint8_t)((8000.*128.)/(float)sample_rate + 0.5); | |
147 } | |
148 #endif | |
149 | |
150 #if 0 /* replaced by table lookup */ | |
151 /* diverging power series */ | |
152 for (i = 0; i <= 13; i++) | |
153 { | |
154 stopDk_t[i] = (int32_t)(stopMin*pow(64.0/stopMin, i/13.0) + 0.5); | |
155 } | |
156 for (i = 0; i < 13; i++) | |
157 { | |
158 stopDk[i] = stopDk_t[i+1] - stopDk_t[i]; | |
159 } | |
160 | |
161 /* needed? */ | |
162 qsort(stopDk, 13, sizeof(stopDk[0]), longcmp); | |
163 | |
164 k2 = stopMin; | |
165 for (i = 0; i < bs_stop_freq; i++) | |
166 { | |
167 k2 += stopDk[i]; | |
168 } | |
169 return min(64, k2); | |
170 #endif | |
171 /* bs_stop_freq <= 13 */ | |
172 return min(64, stopMin + offset[get_sr_index(sample_rate)][min(bs_stop_freq, 13)]); | |
173 } | |
174 | |
175 return 0; | |
176 } | |
177 | |
178 /* calculate the master frequency table from k0, k2, bs_freq_scale | |
179 and bs_alter_scale | |
180 | |
181 version for bs_freq_scale = 0 | |
182 */ | |
183 void master_frequency_table_fs0(sbr_info *sbr, uint8_t k0, uint8_t k2, | |
184 uint8_t bs_alter_scale) | |
185 { | |
186 int8_t incr; | |
187 uint8_t k; | |
188 uint8_t dk; | |
189 uint32_t nrBands, k2Achieved; | |
190 int32_t k2Diff, vDk[64] = {0}; | |
191 | |
192 /* mft only defined for k2 > k0 */ | |
193 if (k2 <= k0) | |
194 { | |
195 sbr->N_master = 0; | |
196 return; | |
197 } | |
198 | |
199 dk = bs_alter_scale ? 2 : 1; | |
200 | |
201 #if 0 /* replaced by float-less design */ | |
202 nrBands = 2 * (int32_t)((float)(k2-k0)/(dk*2) + (-1+dk)/2.0f); | |
203 #else | |
204 if (bs_alter_scale) | |
205 { | |
206 nrBands = (((k2-k0+2)>>2)<<1); | |
207 } else { | |
208 nrBands = (((k2-k0)>>1)<<1); | |
209 } | |
210 #endif | |
211 nrBands = min(nrBands, 63); | |
212 | |
213 k2Achieved = k0 + nrBands * dk; | |
214 k2Diff = k2 - k2Achieved; | |
215 for (k = 0; k < nrBands; k++) | |
216 vDk[k] = dk; | |
217 | |
218 if (k2Diff) | |
219 { | |
220 incr = (k2Diff > 0) ? -1 : 1; | |
221 k = (k2Diff > 0) ? (nrBands-1) : 0; | |
222 | |
223 while (k2Diff != 0) | |
224 { | |
225 vDk[k] -= incr; | |
226 k += incr; | |
227 k2Diff += incr; | |
228 } | |
229 } | |
230 | |
231 sbr->f_master[0] = k0; | |
232 for (k = 1; k <= nrBands; k++) | |
233 sbr->f_master[k] = sbr->f_master[k-1] + vDk[k-1]; | |
234 | |
235 sbr->N_master = nrBands; | |
236 sbr->N_master = min(sbr->N_master, 64); | |
237 | |
238 #if 0 | |
239 printf("f_master[%d]: ", nrBands); | |
240 for (k = 0; k <= nrBands; k++) | |
241 { | |
242 printf("%d ", sbr->f_master[k]); | |
243 } | |
244 printf("\n"); | |
245 #endif | |
246 } | |
247 | |
248 /* | |
249 This function finds the number of bands using this formula: | |
250 bands * log(a1/a0)/log(2.0) + 0.5 | |
251 */ | |
252 static int32_t find_bands(uint8_t warp, uint8_t bands, uint8_t a0, uint8_t a1) | |
253 { | |
254 real_t div = (real_t)log(2.0); | |
255 if (warp) div *= (real_t)1.3; | |
256 | |
257 return (int32_t)(bands * log((float)a1/(float)a0)/div + 0.5); | |
258 } | |
259 | |
260 static real_t find_initial_power(uint8_t bands, uint8_t a0, uint8_t a1) | |
261 { | |
262 return pow((real_t)a1/(real_t)a0, 1.0/(real_t)bands); | |
263 } | |
264 | |
265 /* | |
266 version for bs_freq_scale > 0 | |
267 */ | |
268 void master_frequency_table(sbr_info *sbr, uint8_t k0, uint8_t k2, | |
269 uint8_t bs_freq_scale, uint8_t bs_alter_scale) | |
270 { | |
271 uint8_t k, bands, twoRegions; | |
272 uint8_t k1; | |
273 uint8_t nrBand0, nrBand1; | |
274 int32_t vDk0[64] = {0}, vDk1[64] = {0}; | |
275 int32_t vk0[64] = {0}, vk1[64] = {0}; | |
276 uint8_t temp1[] = { 6, 5, 4 }; | |
277 real_t q, qk; | |
278 int32_t A_1; | |
279 | |
280 /* mft only defined for k2 > k0 */ | |
281 if (k2 <= k0) | |
282 { | |
283 sbr->N_master = 0; | |
284 return; | |
285 } | |
286 | |
287 bands = temp1[bs_freq_scale-1]; | |
288 | |
289 if ((float)k2/(float)k0 > 2.2449) | |
290 { | |
291 twoRegions = 1; | |
292 k1 = k0 << 1; | |
293 } else { | |
294 twoRegions = 0; | |
295 k1 = k2; | |
296 } | |
297 | |
298 nrBand0 = 2 * find_bands(0, bands, k0, k1); | |
299 nrBand0 = min(nrBand0, 63); | |
300 | |
301 q = find_initial_power(nrBand0, k0, k1); | |
302 qk = REAL_CONST(k0); | |
303 A_1 = (int32_t)(qk + .5); | |
304 for (k = 0; k <= nrBand0; k++) | |
305 { | |
306 int32_t A_0 = A_1; | |
307 qk *= q; | |
308 A_1 = (int32_t)(qk + 0.5); | |
309 vDk0[k] = A_1 - A_0; | |
310 } | |
311 | |
312 /* needed? */ | |
313 qsort(vDk0, nrBand0, sizeof(vDk0[0]), longcmp); | |
314 | |
315 vk0[0] = k0; | |
316 for (k = 1; k <= nrBand0; k++) | |
317 { | |
318 vk0[k] = vk0[k-1] + vDk0[k-1]; | |
319 } | |
320 | |
321 if (!twoRegions) | |
322 { | |
323 for (k = 0; k <= nrBand0; k++) | |
324 sbr->f_master[k] = vk0[k]; | |
325 | |
326 sbr->N_master = nrBand0; | |
327 sbr->N_master = min(sbr->N_master, 64); | |
328 return; | |
329 } | |
330 | |
331 nrBand1 = 2 * find_bands(1 /* warped */, bands, k1, k2); | |
332 nrBand1 = min(nrBand1, 63); | |
333 | |
334 q = find_initial_power(nrBand1, k1, k2); | |
335 qk = REAL_CONST(k1); | |
336 A_1 = (int32_t)(qk + .5); | |
337 for (k = 0; k <= nrBand1 - 1; k++) | |
338 { | |
339 int32_t A_0 = A_1; | |
340 qk *= q; | |
341 A_1 = (int32_t)(qk + 0.5); | |
342 vDk1[k] = A_1 - A_0; | |
343 } | |
344 | |
345 if (vDk1[0] < vDk0[nrBand0 - 1]) | |
346 { | |
347 int32_t change; | |
348 | |
349 /* needed? */ | |
350 qsort(vDk1, nrBand1 + 1, sizeof(vDk1[0]), longcmp); | |
351 change = vDk0[nrBand0 - 1] - vDk1[0]; | |
352 vDk1[0] = vDk0[nrBand0 - 1]; | |
353 vDk1[nrBand1 - 1] = vDk1[nrBand1 - 1] - change; | |
354 } | |
355 | |
356 /* needed? */ | |
357 qsort(vDk1, nrBand1, sizeof(vDk1[0]), longcmp); | |
358 vk1[0] = k1; | |
359 for (k = 1; k <= nrBand1; k++) | |
360 { | |
361 vk1[k] = vk1[k-1] + vDk1[k-1]; | |
362 } | |
363 | |
364 sbr->N_master = nrBand0 + nrBand1; | |
365 sbr->N_master = min(sbr->N_master, 64); | |
366 for (k = 0; k <= nrBand0; k++) | |
367 { | |
368 sbr->f_master[k] = vk0[k]; | |
369 } | |
370 for (k = nrBand0 + 1; k <= sbr->N_master; k++) | |
371 { | |
372 sbr->f_master[k] = vk1[k - nrBand0]; | |
373 } | |
374 | |
375 #if 0 | |
376 printf("f_master[%d]: ", sbr->N_master); | |
377 for (k = 0; k <= sbr->N_master; k++) | |
378 { | |
379 printf("%d ", sbr->f_master[k]); | |
380 } | |
381 printf("\n"); | |
382 #endif | |
383 } | |
384 | |
385 /* calculate the derived frequency border tables from f_master */ | |
386 uint8_t derived_frequency_table(sbr_info *sbr, uint8_t bs_xover_band, | |
387 uint8_t k2) | |
388 { | |
389 uint8_t k, i; | |
390 uint32_t minus; | |
391 | |
392 /* The following relation shall be satisfied: bs_xover_band < N_Master */ | |
393 if (sbr->N_master <= bs_xover_band) | |
394 return 1; | |
395 | |
396 sbr->N_high = sbr->N_master - bs_xover_band; | |
397 sbr->N_low = (sbr->N_high>>1) + (sbr->N_high - ((sbr->N_high>>1)<<1)); | |
398 | |
399 sbr->n[0] = sbr->N_low; | |
400 sbr->n[1] = sbr->N_high; | |
401 | |
402 for (k = 0; k <= sbr->N_high; k++) | |
403 { | |
404 sbr->f_table_res[HI_RES][k] = sbr->f_master[k + bs_xover_band]; | |
405 } | |
406 | |
407 sbr->M = sbr->f_table_res[HI_RES][sbr->N_high] - sbr->f_table_res[HI_RES][0]; | |
408 sbr->kx = sbr->f_table_res[HI_RES][0]; | |
409 | |
410 minus = (sbr->N_high & 1) ? 1 : 0; | |
411 | |
412 for (k = 0; k <= sbr->N_low; k++) | |
413 { | |
414 if (k == 0) | |
415 i = 0; | |
416 else | |
417 i = 2*k - minus; | |
418 sbr->f_table_res[LO_RES][k] = sbr->f_table_res[HI_RES][i]; | |
419 } | |
420 | |
421 #if 0 | |
422 printf("f_table_res[HI_RES][%d]: ", sbr->N_high); | |
423 for (k = 0; k <= sbr->N_high; k++) | |
424 { | |
425 printf("%d ", sbr->f_table_res[HI_RES][k]); | |
426 } | |
427 printf("\n"); | |
428 #endif | |
429 #if 0 | |
430 printf("f_table_res[LO_RES][%d]: ", sbr->N_low); | |
431 for (k = 0; k <= sbr->N_low; k++) | |
432 { | |
433 printf("%d ", sbr->f_table_res[LO_RES][k]); | |
434 } | |
435 printf("\n"); | |
436 #endif | |
437 | |
438 sbr->N_Q = 0; | |
439 if (sbr->bs_noise_bands == 0) | |
440 { | |
441 sbr->N_Q = 1; | |
442 } else { | |
443 #if 0 | |
444 sbr->N_Q = max(1, (int32_t)(sbr->bs_noise_bands*(log(k2/(float)sbr->kx)/log(2.0)) + 0.5)); | |
445 #else | |
446 sbr->N_Q = max(1, find_bands(0, sbr->bs_noise_bands, sbr->kx, k2)); | |
447 #endif | |
448 sbr->N_Q = min(5, sbr->N_Q); | |
449 } | |
450 | |
451 for (k = 0; k <= sbr->N_Q; k++) | |
452 { | |
453 if (k == 0) | |
454 { | |
455 i = 0; | |
456 } else { | |
457 /* i = i + (int32_t)((sbr->N_low - i)/(sbr->N_Q + 1 - k)); */ | |
458 i = i + (sbr->N_low - i)/(sbr->N_Q + 1 - k); | |
459 } | |
460 sbr->f_table_noise[k] = sbr->f_table_res[LO_RES][i]; | |
461 } | |
462 | |
463 /* build table for mapping k to g in hf patching */ | |
464 for (k = 0; k < 64; k++) | |
465 { | |
466 uint8_t g; | |
467 for (g = 0; g < sbr->N_Q; g++) | |
468 { | |
469 if ((sbr->f_table_noise[g] <= k) && | |
470 (k < sbr->f_table_noise[g+1])) | |
471 { | |
472 sbr->table_map_k_to_g[k] = g; | |
473 break; | |
474 } | |
475 } | |
476 } | |
477 | |
478 #if 0 | |
479 printf("f_table_noise[%d]: ", sbr->N_Q); | |
480 for (k = 0; k <= sbr->N_Q; k++) | |
481 { | |
482 printf("%d ", sbr->f_table_noise[k]); | |
483 } | |
484 printf("\n"); | |
485 #endif | |
486 | |
487 return 0; | |
488 } | |
489 | |
490 /* TODO: blegh, ugly */ | |
491 /* Modified to calculate for all possible bs_limiter_bands always | |
492 * This reduces the number calls to this functions needed (now only on | |
493 * header reset) | |
494 */ | |
495 void limiter_frequency_table(sbr_info *sbr) | |
496 { | |
497 #if 0 | |
498 static const real_t limiterBandsPerOctave[] = { REAL_CONST(1.2), | |
499 REAL_CONST(2), REAL_CONST(3) }; | |
500 #else | |
501 static const real_t limiterBandsCompare[] = { REAL_CONST(1.328125), | |
502 REAL_CONST(1.1875), REAL_CONST(1.125) }; | |
503 #endif | |
504 uint8_t k, s; | |
505 int8_t nrLim; | |
506 #if 0 | |
507 real_t limBands; | |
508 #endif | |
509 | |
510 sbr->f_table_lim[0][0] = sbr->f_table_res[LO_RES][0] - sbr->kx; | |
511 sbr->f_table_lim[0][1] = sbr->f_table_res[LO_RES][sbr->N_low] - sbr->kx; | |
512 sbr->N_L[0] = 1; | |
513 | |
514 for (s = 1; s < 4; s++) | |
515 { | |
516 int32_t limTable[100 /*TODO*/] = {0}; | |
517 uint8_t patchBorders[64/*??*/] = {0}; | |
518 | |
519 #if 0 | |
520 limBands = limiterBandsPerOctave[s - 1]; | |
521 #endif | |
522 | |
523 patchBorders[0] = sbr->kx; | |
524 for (k = 1; k <= sbr->noPatches; k++) | |
525 { | |
526 patchBorders[k] = patchBorders[k-1] + sbr->patchNoSubbands[k-1]; | |
527 } | |
528 | |
529 for (k = 0; k <= sbr->N_low; k++) | |
530 { | |
531 limTable[k] = sbr->f_table_res[LO_RES][k]; | |
532 } | |
533 for (k = 1; k < sbr->noPatches; k++) | |
534 { | |
535 limTable[k+sbr->N_low] = patchBorders[k]; | |
536 } | |
537 | |
538 /* needed */ | |
539 qsort(limTable, sbr->noPatches + sbr->N_low, sizeof(limTable[0]), longcmp); | |
540 k = 1; | |
541 nrLim = sbr->noPatches + sbr->N_low - 1; | |
542 | |
543 if (nrLim < 0) // TODO: BIG FAT PROBLEM | |
544 return; | |
545 | |
546 restart: | |
547 if (k <= nrLim) | |
548 { | |
549 real_t nOctaves; | |
550 | |
551 if (limTable[k-1] != 0) | |
552 #if 0 | |
553 nOctaves = REAL_CONST(log((float)limTable[k]/(float)limTable[k-1])/log(2.0)); | |
554 #endif | |
555 nOctaves = (real_t)limTable[k]/(real_t)limTable[k-1]; | |
556 else | |
557 nOctaves = 0; | |
558 | |
559 #if 0 | |
560 if ((MUL(nOctaves,limBands)) < REAL_CONST(0.49)) | |
561 #else | |
562 if (nOctaves < limiterBandsCompare[s - 1]) | |
563 #endif | |
564 { | |
565 uint8_t i; | |
566 if (limTable[k] != limTable[k-1]) | |
567 { | |
568 uint8_t found = 0, found2 = 0; | |
569 for (i = 0; i <= sbr->noPatches; i++) | |
570 { | |
571 if (limTable[k] == patchBorders[i]) | |
572 found = 1; | |
573 } | |
574 if (found) | |
575 { | |
576 found2 = 0; | |
577 for (i = 0; i <= sbr->noPatches; i++) | |
578 { | |
579 if (limTable[k-1] == patchBorders[i]) | |
580 found2 = 1; | |
581 } | |
582 if (found2) | |
583 { | |
584 k++; | |
585 goto restart; | |
586 } else { | |
587 /* remove (k-1)th element */ | |
588 limTable[k-1] = sbr->f_table_res[LO_RES][sbr->N_low]; | |
589 qsort(limTable, sbr->noPatches + sbr->N_low, sizeof(limTable[0]), longcmp); | |
590 nrLim--; | |
591 goto restart; | |
592 } | |
593 } | |
594 } | |
595 /* remove kth element */ | |
596 limTable[k] = sbr->f_table_res[LO_RES][sbr->N_low]; | |
597 qsort(limTable, nrLim, sizeof(limTable[0]), longcmp); | |
598 nrLim--; | |
599 goto restart; | |
600 } else { | |
601 k++; | |
602 goto restart; | |
603 } | |
604 } | |
605 | |
606 sbr->N_L[s] = nrLim; | |
607 for (k = 0; k <= nrLim; k++) | |
608 { | |
609 sbr->f_table_lim[s][k] = limTable[k] - sbr->kx; | |
610 } | |
611 | |
612 #if 0 | |
613 printf("f_table_lim[%d][%d]: ", s, sbr->N_L[s]); | |
614 for (k = 0; k <= sbr->N_L[s]; k++) | |
615 { | |
616 printf("%d ", sbr->f_table_lim[s][k]); | |
617 } | |
618 printf("\n"); | |
619 #endif | |
620 } | |
621 } | |
622 | |
623 #endif |