Coverage Report

Created: 2025-11-16 06:18

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/proc/self/cwd/libfaad/filtbank.c
Line
Count
Source
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
5.32k
{
50
5.32k
    uint16_t nshort = frame_len/8;
51
5.32k
#ifdef LD_DEC
52
5.32k
    uint16_t frame_len_ld = frame_len/2;
53
5.32k
#endif
54
55
5.32k
    fb_info *fb = (fb_info*)faad_malloc(sizeof(fb_info));
56
5.32k
    memset(fb, 0, sizeof(fb_info));
57
58
    /* normal */
59
5.32k
    fb->mdct256 = faad_mdct_init(2*nshort);
60
5.32k
    fb->mdct2048 = faad_mdct_init(2*frame_len);
61
5.32k
#ifdef LD_DEC
62
    /* LD */
63
5.32k
    fb->mdct1024 = faad_mdct_init(2*frame_len_ld);
64
5.32k
#endif
65
66
5.32k
#ifdef ALLOW_SMALL_FRAMELENGTH
67
5.32k
    if (frame_len == 1024)
68
4.19k
    {
69
4.19k
#endif
70
4.19k
        fb->long_window[0]  = sine_long_1024;
71
4.19k
        fb->short_window[0] = sine_short_128;
72
4.19k
        fb->long_window[1]  = kbd_long_1024;
73
4.19k
        fb->short_window[1] = kbd_short_128;
74
4.19k
#ifdef LD_DEC
75
4.19k
        fb->ld_window[0] = sine_mid_512;
76
4.19k
        fb->ld_window[1] = ld_mid_512;
77
4.19k
#endif
78
4.19k
#ifdef ALLOW_SMALL_FRAMELENGTH
79
4.19k
    } else /* (frame_len == 960) */ {
80
1.12k
        fb->long_window[0]  = sine_long_960;
81
1.12k
        fb->short_window[0] = sine_short_120;
82
1.12k
        fb->long_window[1]  = kbd_long_960;
83
1.12k
        fb->short_window[1] = kbd_short_120;
84
1.12k
#ifdef LD_DEC
85
1.12k
        fb->ld_window[0] = sine_mid_480;
86
1.12k
        fb->ld_window[1] = ld_mid_480;
87
1.12k
#endif
88
1.12k
    }
89
5.32k
#endif
90
91
5.32k
    return fb;
92
5.32k
}
93
94
void filter_bank_end(fb_info *fb)
95
5.45k
{
96
5.45k
    if (fb != NULL)
97
5.32k
    {
98
#ifdef PROFILE
99
        printf("FB:                 %I64d cycles\n", fb->cycles);
100
#endif
101
102
5.32k
        faad_mdct_end(fb->mdct256);
103
5.32k
        faad_mdct_end(fb->mdct2048);
104
5.32k
#ifdef LD_DEC
105
5.32k
        faad_mdct_end(fb->mdct1024);
106
5.32k
#endif
107
108
5.32k
        faad_free(fb);
109
5.32k
    }
110
5.45k
}
111
112
static INLINE void imdct_long(fb_info *fb, real_t *in_data, real_t *out_data, uint16_t len)
113
127k
{
114
127k
#ifdef LD_DEC
115
127k
    mdct_info *mdct = NULL;
116
117
127k
    switch (len)
118
127k
    {
119
106k
    case 2048:
120
126k
    case 1920:
121
126k
        mdct = fb->mdct2048;
122
126k
        break;
123
421
    case 1024:
124
1.32k
    case 960:
125
1.32k
        mdct = fb->mdct1024;
126
1.32k
        break;
127
127k
    }
128
129
127k
    faad_imdct(mdct, in_data, out_data);
130
#else
131
    (void)len;
132
    faad_imdct(fb->mdct2048, in_data, out_data);
133
#endif
134
127k
}
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
5.27k
{
140
5.27k
    mdct_info *mdct = NULL;
141
142
5.27k
    switch (len)
143
5.27k
    {
144
2.21k
    case 2048:
145
5.21k
    case 1920:
146
5.21k
        mdct = fb->mdct2048;
147
5.21k
        break;
148
0
    case 256:
149
0
    case 240:
150
0
        mdct = fb->mdct256;
151
0
        break;
152
0
#ifdef LD_DEC
153
43
    case 1024:
154
63
    case 960:
155
63
        mdct = fb->mdct1024;
156
63
        break;
157
5.27k
#endif
158
5.27k
    }
159
160
5.27k
    faad_mdct(mdct, in_data, out_data);
161
5.27k
}
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
139k
{
169
139k
    int16_t i;
170
139k
    ALIGN real_t transf_buf[2*1024] = {0};
171
172
139k
    const real_t *window_long = NULL;
173
139k
    const real_t *window_long_prev = NULL;
174
139k
    const real_t *window_short = NULL;
175
139k
    const real_t *window_short_prev = NULL;
176
177
139k
    uint16_t nlong = frame_len;
178
139k
    uint16_t nshort = frame_len/8;
179
139k
    uint16_t trans = nshort/2;
180
181
139k
    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
139k
#ifdef LD_DEC
189
139k
    if (object_type == LD)
190
1.32k
    {
191
1.32k
        window_long       = fb->ld_window[window_shape];
192
1.32k
        window_long_prev  = fb->ld_window[window_shape_prev];
193
138k
    } else {
194
#else
195
        (void)object_type;
196
#endif
197
138k
        window_long       = fb->long_window[window_shape];
198
138k
        window_long_prev  = fb->long_window[window_shape_prev];
199
138k
        window_short      = fb->short_window[window_shape];
200
138k
        window_short_prev = fb->short_window[window_shape_prev];
201
138k
#ifdef LD_DEC
202
138k
    }
203
139k
#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
139k
    switch (window_sequence)
217
139k
    {
218
117k
    case ONLY_LONG_SEQUENCE:
219
        /* perform iMDCT */
220
117k
        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
29.7M
        for (i = 0; i < nlong; i+=4)
224
29.6M
        {
225
29.6M
            time_out[i]   = overlap[i]   + MUL_F(transf_buf[i],window_long_prev[i]);
226
29.6M
            time_out[i+1] = overlap[i+1] + MUL_F(transf_buf[i+1],window_long_prev[i+1]);
227
29.6M
            time_out[i+2] = overlap[i+2] + MUL_F(transf_buf[i+2],window_long_prev[i+2]);
228
29.6M
            time_out[i+3] = overlap[i+3] + MUL_F(transf_buf[i+3],window_long_prev[i+3]);
229
29.6M
        }
230
231
        /* window the second half and save as overlap for next frame */
232
29.7M
        for (i = 0; i < nlong; i+=4)
233
29.6M
        {
234
29.6M
            overlap[i]   = MUL_F(transf_buf[nlong+i],window_long[nlong-1-i]);
235
29.6M
            overlap[i+1] = MUL_F(transf_buf[nlong+i+1],window_long[nlong-2-i]);
236
29.6M
            overlap[i+2] = MUL_F(transf_buf[nlong+i+2],window_long[nlong-3-i]);
237
29.6M
            overlap[i+3] = MUL_F(transf_buf[nlong+i+3],window_long[nlong-4-i]);
238
29.6M
        }
239
117k
        break;
240
241
6.35k
    case LONG_START_SEQUENCE:
242
        /* perform iMDCT */
243
6.35k
        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
1.56M
        for (i = 0; i < nlong; i+=4)
247
1.56M
        {
248
1.56M
            time_out[i]   = overlap[i]   + MUL_F(transf_buf[i],window_long_prev[i]);
249
1.56M
            time_out[i+1] = overlap[i+1] + MUL_F(transf_buf[i+1],window_long_prev[i+1]);
250
1.56M
            time_out[i+2] = overlap[i+2] + MUL_F(transf_buf[i+2],window_long_prev[i+2]);
251
1.56M
            time_out[i+3] = overlap[i+3] + MUL_F(transf_buf[i+3],window_long_prev[i+3]);
252
1.56M
        }
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
2.73M
        for (i = 0; i < nflat_ls; i++)
257
2.73M
            overlap[i] = transf_buf[nlong+i];
258
787k
        for (i = 0; i < nshort; i++)
259
780k
            overlap[nflat_ls+i] = MUL_F(transf_buf[nlong+nflat_ls+i],window_short[nshort-i-1]);
260
2.73M
        for (i = 0; i < nflat_ls; i++)
261
2.73M
            overlap[nflat_ls+nshort+i] = 0;
262
6.35k
        break;
263
264
12.1k
    case EIGHT_SHORT_SEQUENCE:
265
        /* perform iMDCT for each short block */
266
12.1k
        faad_imdct(fb->mdct256, freq_in+0*nshort, transf_buf+2*nshort*0);
267
12.1k
        faad_imdct(fb->mdct256, freq_in+1*nshort, transf_buf+2*nshort*1);
268
12.1k
        faad_imdct(fb->mdct256, freq_in+2*nshort, transf_buf+2*nshort*2);
269
12.1k
        faad_imdct(fb->mdct256, freq_in+3*nshort, transf_buf+2*nshort*3);
270
12.1k
        faad_imdct(fb->mdct256, freq_in+4*nshort, transf_buf+2*nshort*4);
271
12.1k
        faad_imdct(fb->mdct256, freq_in+5*nshort, transf_buf+2*nshort*5);
272
12.1k
        faad_imdct(fb->mdct256, freq_in+6*nshort, transf_buf+2*nshort*6);
273
12.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
5.37M
        for (i = 0; i < nflat_ls; i++)
277
5.36M
            time_out[i] = overlap[i];
278
1.54M
        for(i = 0; i < nshort; i++)
279
1.53M
        {
280
1.53M
            time_out[nflat_ls+         i] = overlap[nflat_ls+         i] + MUL_F(transf_buf[nshort*0+i],window_short_prev[i]);
281
1.53M
            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
1.53M
            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
1.53M
            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
1.53M
            if (i < trans)
285
766k
                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
1.53M
        }
287
288
        /* window the second half and save as overlap for next frame */
289
1.54M
        for(i = 0; i < nshort; i++)
290
1.53M
        {
291
1.53M
            if (i >= trans)
292
766k
                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
1.53M
            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
1.53M
            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
1.53M
            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
1.53M
            overlap[nflat_ls+8*nshort+i-nlong] = MUL_F(transf_buf[nshort*15+i],window_short[nshort-1-i]);
297
1.53M
        }
298
5.37M
        for (i = 0; i < nflat_ls; i++)
299
5.36M
            overlap[nflat_ls+nshort+i] = 0;
300
12.1k
        break;
301
302
3.94k
    case LONG_STOP_SEQUENCE:
303
        /* perform iMDCT */
304
3.94k
        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
1.74M
        for (i = 0; i < nflat_ls; i++)
309
1.74M
            time_out[i] = overlap[i];
310
501k
        for (i = 0; i < nshort; i++)
311
497k
            time_out[nflat_ls+i] = overlap[nflat_ls+i] + MUL_F(transf_buf[nflat_ls+i],window_short_prev[i]);
312
1.74M
        for (i = 0; i < nflat_ls; i++)
313
1.74M
            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
3.98M
        for (i = 0; i < nlong; i++)
317
3.98M
            overlap[i] = MUL_F(transf_buf[nlong+i],window_long[nlong-1-i]);
318
3.94k
    break;
319
139k
    }
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
139k
}
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
5.27k
{
343
5.27k
    int16_t i;
344
5.27k
    ALIGN real_t windowed_buf[2*1024] = {0};
345
346
5.27k
    const real_t *window_long = NULL;
347
5.27k
    const real_t *window_long_prev = NULL;
348
5.27k
    const real_t *window_short = NULL;
349
5.27k
    const real_t *window_short_prev = NULL;
350
351
5.27k
    uint16_t nlong = frame_len;
352
5.27k
    uint16_t nshort = frame_len/8;
353
5.27k
    uint16_t nflat_ls = (nlong-nshort)/2;
354
355
5.27k
    assert(window_sequence != EIGHT_SHORT_SEQUENCE);
356
357
5.27k
#ifdef LD_DEC
358
5.27k
    if (object_type == LD)
359
63
    {
360
63
        window_long       = fb->ld_window[window_shape];
361
63
        window_long_prev  = fb->ld_window[window_shape_prev];
362
5.21k
    } else {
363
5.21k
#endif
364
5.21k
        window_long       = fb->long_window[window_shape];
365
5.21k
        window_long_prev  = fb->long_window[window_shape_prev];
366
5.21k
        window_short      = fb->short_window[window_shape];
367
5.21k
        window_short_prev = fb->short_window[window_shape_prev];
368
5.21k
#ifdef LD_DEC
369
5.21k
    }
370
5.27k
#endif
371
372
5.27k
    switch(window_sequence)
373
5.27k
    {
374
773
    case ONLY_LONG_SEQUENCE:
375
744k
        for (i = nlong-1; i >= 0; i--)
376
743k
        {
377
743k
            windowed_buf[i] = MUL_F(in_data[i], window_long_prev[i]);
378
743k
            windowed_buf[i+nlong] = MUL_F(in_data[i+nlong], window_long[nlong-1-i]);
379
743k
        }
380
773
        mdct(fb, windowed_buf, out_mdct, 2*nlong);
381
773
        break;
382
383
3.77k
    case LONG_START_SEQUENCE:
384
3.73M
        for (i = 0; i < nlong; i++)
385
3.73M
            windowed_buf[i] = MUL_F(in_data[i], window_long_prev[i]);
386
1.63M
        for (i = 0; i < nflat_ls; i++)
387
1.63M
            windowed_buf[i+nlong] = in_data[i+nlong];
388
470k
        for (i = 0; i < nshort; i++)
389
466k
            windowed_buf[i+nlong+nflat_ls] = MUL_F(in_data[i+nlong+nflat_ls], window_short[nshort-1-i]);
390
1.63M
        for (i = 0; i < nflat_ls; i++)
391
1.63M
            windowed_buf[i+nlong+nflat_ls+nshort] = 0;
392
3.77k
        mdct(fb, windowed_buf, out_mdct, 2*nlong);
393
3.77k
        break;
394
395
723
    case LONG_STOP_SEQUENCE:
396
307k
        for (i = 0; i < nflat_ls; i++)
397
306k
            windowed_buf[i] = 0;
398
88.3k
        for (i = 0; i < nshort; i++)
399
87.6k
            windowed_buf[i+nflat_ls] = MUL_F(in_data[i+nflat_ls], window_short_prev[i]);
400
307k
        for (i = 0; i < nflat_ls; i++)
401
306k
            windowed_buf[i+nflat_ls+nshort] = in_data[i+nflat_ls+nshort];
402
701k
        for (i = 0; i < nlong; i++)
403
700k
            windowed_buf[i+nlong] = MUL_F(in_data[i+nlong], window_long[nlong-1-i]);
404
723
        mdct(fb, windowed_buf, out_mdct, 2*nlong);
405
723
        break;
406
5.27k
    }
407
5.27k
}
408
#endif