Coverage Report

Created: 2025-07-11 06:40

/proc/self/cwd/libfaad/filtbank.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
** FAAD2 - Freeware Advanced Audio (AAC) Decoder including SBR decoding
3
** Copyright (C) 2003-2005 M. Bakker, Nero 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
** The "appropriate copyright message" mentioned in section 2c of the GPLv2
23
** must read: "Code from FAAD2 is copyright (c) Nero AG, www.nero.com"
24
**
25
** Commercial non-GPL licensing of this software is possible.
26
** For more info contact Nero AG through Mpeg4AAClicense@nero.com.
27
**
28
** $Id: filtbank.c,v 1.46 2009/01/26 23:51:15 menno Exp $
29
**/
30
31
#include "common.h"
32
#include "structs.h"
33
34
#include <stdlib.h>
35
#ifdef _WIN32_WCE
36
#define assert(x)
37
#else
38
#include <assert.h>
39
#endif
40
41
#include "filtbank.h"
42
#include "syntax.h"
43
#include "kbd_win.h"
44
#include "sine_win.h"
45
#include "mdct.h"
46
47
48
fb_info *filter_bank_init(uint16_t frame_len)
49
8.46k
{
50
8.46k
    uint16_t nshort = frame_len/8;
51
8.46k
#ifdef LD_DEC
52
8.46k
    uint16_t frame_len_ld = frame_len/2;
53
8.46k
#endif
54
55
8.46k
    fb_info *fb = (fb_info*)faad_malloc(sizeof(fb_info));
56
8.46k
    memset(fb, 0, sizeof(fb_info));
57
58
    /* normal */
59
8.46k
    fb->mdct256 = faad_mdct_init(2*nshort);
60
8.46k
    fb->mdct2048 = faad_mdct_init(2*frame_len);
61
8.46k
#ifdef LD_DEC
62
    /* LD */
63
8.46k
    fb->mdct1024 = faad_mdct_init(2*frame_len_ld);
64
8.46k
#endif
65
66
8.46k
#ifdef ALLOW_SMALL_FRAMELENGTH
67
8.46k
    if (frame_len == 1024)
68
6.89k
    {
69
6.89k
#endif
70
6.89k
        fb->long_window[0]  = sine_long_1024;
71
6.89k
        fb->short_window[0] = sine_short_128;
72
6.89k
        fb->long_window[1]  = kbd_long_1024;
73
6.89k
        fb->short_window[1] = kbd_short_128;
74
6.89k
#ifdef LD_DEC
75
6.89k
        fb->ld_window[0] = sine_mid_512;
76
6.89k
        fb->ld_window[1] = ld_mid_512;
77
6.89k
#endif
78
6.89k
#ifdef ALLOW_SMALL_FRAMELENGTH
79
6.89k
    } else /* (frame_len == 960) */ {
80
1.57k
        fb->long_window[0]  = sine_long_960;
81
1.57k
        fb->short_window[0] = sine_short_120;
82
1.57k
        fb->long_window[1]  = kbd_long_960;
83
1.57k
        fb->short_window[1] = kbd_short_120;
84
1.57k
#ifdef LD_DEC
85
1.57k
        fb->ld_window[0] = sine_mid_480;
86
1.57k
        fb->ld_window[1] = ld_mid_480;
87
1.57k
#endif
88
1.57k
    }
89
8.46k
#endif
90
91
8.46k
    return fb;
92
8.46k
}
93
94
void filter_bank_end(fb_info *fb)
95
8.64k
{
96
8.64k
    if (fb != NULL)
97
8.46k
    {
98
#ifdef PROFILE
99
        printf("FB:                 %I64d cycles\n", fb->cycles);
100
#endif
101
102
8.46k
        faad_mdct_end(fb->mdct256);
103
8.46k
        faad_mdct_end(fb->mdct2048);
104
8.46k
#ifdef LD_DEC
105
8.46k
        faad_mdct_end(fb->mdct1024);
106
8.46k
#endif
107
108
8.46k
        faad_free(fb);
109
8.46k
    }
110
8.64k
}
111
112
static INLINE void imdct_long(fb_info *fb, real_t *in_data, real_t *out_data, uint16_t len)
113
230k
{
114
230k
#ifdef LD_DEC
115
230k
    mdct_info *mdct = NULL;
116
117
230k
    switch (len)
118
230k
    {
119
194k
    case 2048:
120
228k
    case 1920:
121
228k
        mdct = fb->mdct2048;
122
228k
        break;
123
1.24k
    case 1024:
124
2.35k
    case 960:
125
2.35k
        mdct = fb->mdct1024;
126
2.35k
        break;
127
230k
    }
128
129
230k
    faad_imdct(mdct, in_data, out_data);
130
#else
131
    (void)len;
132
    faad_imdct(fb->mdct2048, in_data, out_data);
133
#endif
134
230k
}
135
136
137
#ifdef LTP_DEC
138
static INLINE void mdct(fb_info *fb, real_t *in_data, real_t *out_data, uint16_t len)
139
6.82k
{
140
6.82k
    mdct_info *mdct = NULL;
141
142
6.82k
    switch (len)
143
6.82k
    {
144
2.47k
    case 2048:
145
6.56k
    case 1920:
146
6.56k
        mdct = fb->mdct2048;
147
6.56k
        break;
148
0
    case 256:
149
0
    case 240:
150
0
        mdct = fb->mdct256;
151
0
        break;
152
0
#ifdef LD_DEC
153
188
    case 1024:
154
260
    case 960:
155
260
        mdct = fb->mdct1024;
156
260
        break;
157
6.82k
#endif
158
6.82k
    }
159
160
6.82k
    faad_mdct(mdct, in_data, out_data);
161
6.82k
}
162
#endif
163
164
void ifilter_bank(fb_info *fb, uint8_t window_sequence, uint8_t window_shape,
165
                  uint8_t window_shape_prev, real_t *freq_in,
166
                  real_t *time_out, real_t *overlap,
167
                  uint8_t object_type, uint16_t frame_len)
168
256k
{
169
256k
    int16_t i;
170
256k
    ALIGN real_t transf_buf[2*1024] = {0};
171
172
256k
    const real_t *window_long = NULL;
173
256k
    const real_t *window_long_prev = NULL;
174
256k
    const real_t *window_short = NULL;
175
256k
    const real_t *window_short_prev = NULL;
176
177
256k
    uint16_t nlong = frame_len;
178
256k
    uint16_t nshort = frame_len/8;
179
256k
    uint16_t trans = nshort/2;
180
181
256k
    uint16_t nflat_ls = (nlong-nshort)/2;
182
183
#ifdef PROFILE
184
    int64_t count = faad_get_ts();
185
#endif
186
187
    /* select windows of current frame and previous frame (Sine or KBD) */
188
256k
#ifdef LD_DEC
189
256k
    if (object_type == LD)
190
2.35k
    {
191
2.35k
        window_long       = fb->ld_window[window_shape];
192
2.35k
        window_long_prev  = fb->ld_window[window_shape_prev];
193
254k
    } else {
194
#else
195
        (void)object_type;
196
#endif
197
254k
        window_long       = fb->long_window[window_shape];
198
254k
        window_long_prev  = fb->long_window[window_shape_prev];
199
254k
        window_short      = fb->short_window[window_shape];
200
254k
        window_short_prev = fb->short_window[window_shape_prev];
201
254k
#ifdef LD_DEC
202
254k
    }
203
256k
#endif
204
205
#if 0
206
    for (i = 0; i < 1024; i++)
207
    {
208
        printf("%d\n", freq_in[i]);
209
    }
210
#endif
211
212
#if 0
213
    printf("%d %d\n", window_sequence, window_shape);
214
#endif
215
216
256k
    switch (window_sequence)
217
256k
    {
218
205k
    case ONLY_LONG_SEQUENCE:
219
        /* perform iMDCT */
220
205k
        imdct_long(fb, freq_in, transf_buf, 2*nlong);
221
222
        /* add second half output of previous frame to windowed output of current frame */
223
52.1M
        for (i = 0; i < nlong; i+=4)
224
51.9M
        {
225
51.9M
            time_out[i]   = overlap[i]   + MUL_F(transf_buf[i],window_long_prev[i]);
226
51.9M
            time_out[i+1] = overlap[i+1] + MUL_F(transf_buf[i+1],window_long_prev[i+1]);
227
51.9M
            time_out[i+2] = overlap[i+2] + MUL_F(transf_buf[i+2],window_long_prev[i+2]);
228
51.9M
            time_out[i+3] = overlap[i+3] + MUL_F(transf_buf[i+3],window_long_prev[i+3]);
229
51.9M
        }
230
231
        /* window the second half and save as overlap for next frame */
232
52.1M
        for (i = 0; i < nlong; i+=4)
233
51.9M
        {
234
51.9M
            overlap[i]   = MUL_F(transf_buf[nlong+i],window_long[nlong-1-i]);
235
51.9M
            overlap[i+1] = MUL_F(transf_buf[nlong+i+1],window_long[nlong-2-i]);
236
51.9M
            overlap[i+2] = MUL_F(transf_buf[nlong+i+2],window_long[nlong-3-i]);
237
51.9M
            overlap[i+3] = MUL_F(transf_buf[nlong+i+3],window_long[nlong-4-i]);
238
51.9M
        }
239
205k
        break;
240
241
19.2k
    case LONG_START_SEQUENCE:
242
        /* perform iMDCT */
243
19.2k
        imdct_long(fb, freq_in, transf_buf, 2*nlong);
244
245
        /* add second half output of previous frame to windowed output of current frame */
246
4.84M
        for (i = 0; i < nlong; i+=4)
247
4.82M
        {
248
4.82M
            time_out[i]   = overlap[i]   + MUL_F(transf_buf[i],window_long_prev[i]);
249
4.82M
            time_out[i+1] = overlap[i+1] + MUL_F(transf_buf[i+1],window_long_prev[i+1]);
250
4.82M
            time_out[i+2] = overlap[i+2] + MUL_F(transf_buf[i+2],window_long_prev[i+2]);
251
4.82M
            time_out[i+3] = overlap[i+3] + MUL_F(transf_buf[i+3],window_long_prev[i+3]);
252
4.82M
        }
253
254
        /* window the second half and save as overlap for next frame */
255
        /* construct second half window using padding with 1's and 0's */
256
8.46M
        for (i = 0; i < nflat_ls; i++)
257
8.45M
            overlap[i] = transf_buf[nlong+i];
258
2.43M
        for (i = 0; i < nshort; i++)
259
2.41M
            overlap[nflat_ls+i] = MUL_F(transf_buf[nlong+nflat_ls+i],window_short[nshort-i-1]);
260
8.46M
        for (i = 0; i < nflat_ls; i++)
261
8.45M
            overlap[nflat_ls+nshort+i] = 0;
262
19.2k
        break;
263
264
26.1k
    case EIGHT_SHORT_SEQUENCE:
265
        /* perform iMDCT for each short block */
266
26.1k
        faad_imdct(fb->mdct256, freq_in+0*nshort, transf_buf+2*nshort*0);
267
26.1k
        faad_imdct(fb->mdct256, freq_in+1*nshort, transf_buf+2*nshort*1);
268
26.1k
        faad_imdct(fb->mdct256, freq_in+2*nshort, transf_buf+2*nshort*2);
269
26.1k
        faad_imdct(fb->mdct256, freq_in+3*nshort, transf_buf+2*nshort*3);
270
26.1k
        faad_imdct(fb->mdct256, freq_in+4*nshort, transf_buf+2*nshort*4);
271
26.1k
        faad_imdct(fb->mdct256, freq_in+5*nshort, transf_buf+2*nshort*5);
272
26.1k
        faad_imdct(fb->mdct256, freq_in+6*nshort, transf_buf+2*nshort*6);
273
26.1k
        faad_imdct(fb->mdct256, freq_in+7*nshort, transf_buf+2*nshort*7);
274
275
        /* add second half output of previous frame to windowed output of current frame */
276
11.6M
        for (i = 0; i < nflat_ls; i++)
277
11.5M
            time_out[i] = overlap[i];
278
3.33M
        for(i = 0; i < nshort; i++)
279
3.31M
        {
280
3.31M
            time_out[nflat_ls+         i] = overlap[nflat_ls+         i] + MUL_F(transf_buf[nshort*0+i],window_short_prev[i]);
281
3.31M
            time_out[nflat_ls+1*nshort+i] = overlap[nflat_ls+nshort*1+i] + MUL_F(transf_buf[nshort*1+i],window_short[nshort-1-i]) + MUL_F(transf_buf[nshort*2+i],window_short[i]);
282
3.31M
            time_out[nflat_ls+2*nshort+i] = overlap[nflat_ls+nshort*2+i] + MUL_F(transf_buf[nshort*3+i],window_short[nshort-1-i]) + MUL_F(transf_buf[nshort*4+i],window_short[i]);
283
3.31M
            time_out[nflat_ls+3*nshort+i] = overlap[nflat_ls+nshort*3+i] + MUL_F(transf_buf[nshort*5+i],window_short[nshort-1-i]) + MUL_F(transf_buf[nshort*6+i],window_short[i]);
284
3.31M
            if (i < trans)
285
1.65M
                time_out[nflat_ls+4*nshort+i] = overlap[nflat_ls+nshort*4+i] + MUL_F(transf_buf[nshort*7+i],window_short[nshort-1-i]) + MUL_F(transf_buf[nshort*8+i],window_short[i]);
286
3.31M
        }
287
288
        /* window the second half and save as overlap for next frame */
289
3.33M
        for(i = 0; i < nshort; i++)
290
3.31M
        {
291
3.31M
            if (i >= trans)
292
1.65M
                overlap[nflat_ls+4*nshort+i-nlong] = MUL_F(transf_buf[nshort*7+i],window_short[nshort-1-i]) + MUL_F(transf_buf[nshort*8+i],window_short[i]);
293
3.31M
            overlap[nflat_ls+5*nshort+i-nlong] = MUL_F(transf_buf[nshort*9+i],window_short[nshort-1-i]) + MUL_F(transf_buf[nshort*10+i],window_short[i]);
294
3.31M
            overlap[nflat_ls+6*nshort+i-nlong] = MUL_F(transf_buf[nshort*11+i],window_short[nshort-1-i]) + MUL_F(transf_buf[nshort*12+i],window_short[i]);
295
3.31M
            overlap[nflat_ls+7*nshort+i-nlong] = MUL_F(transf_buf[nshort*13+i],window_short[nshort-1-i]) + MUL_F(transf_buf[nshort*14+i],window_short[i]);
296
3.31M
            overlap[nflat_ls+8*nshort+i-nlong] = MUL_F(transf_buf[nshort*15+i],window_short[nshort-1-i]);
297
3.31M
        }
298
11.6M
        for (i = 0; i < nflat_ls; i++)
299
11.5M
            overlap[nflat_ls+nshort+i] = 0;
300
26.1k
        break;
301
302
5.73k
    case LONG_STOP_SEQUENCE:
303
        /* perform iMDCT */
304
5.73k
        imdct_long(fb, freq_in, transf_buf, 2*nlong);
305
306
        /* add second half output of previous frame to windowed output of current frame */
307
        /* construct first half window using padding with 1's and 0's */
308
2.50M
        for (i = 0; i < nflat_ls; i++)
309
2.49M
            time_out[i] = overlap[i];
310
718k
        for (i = 0; i < nshort; i++)
311
713k
            time_out[nflat_ls+i] = overlap[nflat_ls+i] + MUL_F(transf_buf[nflat_ls+i],window_short_prev[i]);
312
2.50M
        for (i = 0; i < nflat_ls; i++)
313
2.49M
            time_out[nflat_ls+nshort+i] = overlap[nflat_ls+nshort+i] + transf_buf[nflat_ls+nshort+i];
314
315
        /* window the second half and save as overlap for next frame */
316
5.71M
        for (i = 0; i < nlong; i++)
317
5.70M
            overlap[i] = MUL_F(transf_buf[nlong+i],window_long[nlong-1-i]);
318
5.73k
    break;
319
256k
    }
320
321
#if 0
322
    for (i = 0; i < 1024; i++)
323
    {
324
        printf("%d\n", time_out[i]);
325
        //printf("0x%.8X\n", time_out[i]);
326
    }
327
#endif
328
329
330
#ifdef PROFILE
331
    count = faad_get_ts() - count;
332
    fb->cycles += count;
333
#endif
334
256k
}
335
336
337
#ifdef LTP_DEC
338
/* only works for LTP -> no overlapping, no short blocks */
339
void filter_bank_ltp(fb_info *fb, uint8_t window_sequence, uint8_t window_shape,
340
                     uint8_t window_shape_prev, real_t *in_data, real_t *out_mdct,
341
                     uint8_t object_type, uint16_t frame_len)
342
6.82k
{
343
6.82k
    int16_t i;
344
6.82k
    ALIGN real_t windowed_buf[2*1024] = {0};
345
346
6.82k
    const real_t *window_long = NULL;
347
6.82k
    const real_t *window_long_prev = NULL;
348
6.82k
    const real_t *window_short = NULL;
349
6.82k
    const real_t *window_short_prev = NULL;
350
351
6.82k
    uint16_t nlong = frame_len;
352
6.82k
    uint16_t nshort = frame_len/8;
353
6.82k
    uint16_t nflat_ls = (nlong-nshort)/2;
354
355
6.82k
    assert(window_sequence != EIGHT_SHORT_SEQUENCE);
356
357
6.82k
#ifdef LD_DEC
358
6.82k
    if (object_type == LD)
359
260
    {
360
260
        window_long       = fb->ld_window[window_shape];
361
260
        window_long_prev  = fb->ld_window[window_shape_prev];
362
6.56k
    } else {
363
6.56k
#endif
364
6.56k
        window_long       = fb->long_window[window_shape];
365
6.56k
        window_long_prev  = fb->long_window[window_shape_prev];
366
6.56k
        window_short      = fb->short_window[window_shape];
367
6.56k
        window_short_prev = fb->short_window[window_shape_prev];
368
6.56k
#ifdef LD_DEC
369
6.56k
    }
370
6.82k
#endif
371
372
6.82k
    switch(window_sequence)
373
6.82k
    {
374
655
    case ONLY_LONG_SEQUENCE:
375
525k
        for (i = nlong-1; i >= 0; i--)
376
524k
        {
377
524k
            windowed_buf[i] = MUL_F(in_data[i], window_long_prev[i]);
378
524k
            windowed_buf[i+nlong] = MUL_F(in_data[i+nlong], window_long[nlong-1-i]);
379
524k
        }
380
655
        mdct(fb, windowed_buf, out_mdct, 2*nlong);
381
655
        break;
382
383
3.94k
    case LONG_START_SEQUENCE:
384
3.89M
        for (i = 0; i < nlong; i++)
385
3.89M
            windowed_buf[i] = MUL_F(in_data[i], window_long_prev[i]);
386
1.70M
        for (i = 0; i < nflat_ls; i++)
387
1.70M
            windowed_buf[i+nlong] = in_data[i+nlong];
388
490k
        for (i = 0; i < nshort; i++)
389
486k
            windowed_buf[i+nlong+nflat_ls] = MUL_F(in_data[i+nlong+nflat_ls], window_short[nshort-1-i]);
390
1.70M
        for (i = 0; i < nflat_ls; i++)
391
1.70M
            windowed_buf[i+nlong+nflat_ls+nshort] = 0;
392
3.94k
        mdct(fb, windowed_buf, out_mdct, 2*nlong);
393
3.94k
        break;
394
395
2.22k
    case LONG_STOP_SEQUENCE:
396
951k
        for (i = 0; i < nflat_ls; i++)
397
949k
            windowed_buf[i] = 0;
398
273k
        for (i = 0; i < nshort; i++)
399
271k
            windowed_buf[i+nflat_ls] = MUL_F(in_data[i+nflat_ls], window_short_prev[i]);
400
951k
        for (i = 0; i < nflat_ls; i++)
401
949k
            windowed_buf[i+nflat_ls+nshort] = in_data[i+nflat_ls+nshort];
402
2.17M
        for (i = 0; i < nlong; i++)
403
2.16M
            windowed_buf[i+nlong] = MUL_F(in_data[i+nlong], window_long[nlong-1-i]);
404
2.22k
        mdct(fb, windowed_buf, out_mdct, 2*nlong);
405
2.22k
        break;
406
6.82k
    }
407
6.82k
}
408
#endif