Coverage Report

Created: 2025-07-23 06:30

/proc/self/cwd/libfaad/sbr_tf_grid.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: sbr_tf_grid.c,v 1.20 2008/09/19 22:50:20 menno Exp $
29
**/
30
31
/* Time/Frequency grid */
32
33
#include "common.h"
34
#include "structs.h"
35
36
#ifdef SBR_DEC
37
38
#include <stdlib.h>
39
40
#include "sbr_syntax.h"
41
#include "sbr_tf_grid.h"
42
43
44
/* static function declarations */
45
#if 0
46
static int16_t rel_bord_lead(sbr_info *sbr, uint8_t ch, uint8_t l);
47
static int16_t rel_bord_trail(sbr_info *sbr, uint8_t ch, uint8_t l);
48
#endif
49
static uint8_t middleBorder(sbr_info *sbr, uint8_t ch);
50
51
52
/* function constructs new time border vector */
53
/* first build into temp vector to be able to use previous vector on error */
54
uint8_t envelope_time_border_vector(sbr_info *sbr, uint8_t ch)
55
105k
{
56
105k
    uint8_t l, border, temp, trail;
57
105k
    uint8_t t_E_temp[6] = {0};
58
59
105k
    trail = sbr->abs_bord_trail[ch];
60
105k
    t_E_temp[0] = sbr->rate * sbr->abs_bord_lead[ch];
61
105k
    t_E_temp[sbr->L_E[ch]] = sbr->rate * trail;
62
63
105k
    switch (sbr->bs_frame_class[ch])
64
105k
    {
65
39.0k
    case FIXFIX:
66
39.0k
        switch (sbr->L_E[ch])
67
39.0k
        {
68
6.66k
        case 4:
69
6.66k
            temp = (sbr->numTimeSlots / 4);
70
6.66k
            t_E_temp[3] = sbr->rate * 3 * temp;
71
6.66k
            t_E_temp[2] = sbr->rate * 2 * temp;
72
6.66k
            t_E_temp[1] = sbr->rate * temp;
73
6.66k
            break;
74
5.23k
        case 2:
75
5.23k
            t_E_temp[1] = sbr->rate * (sbr->numTimeSlots / 2);
76
5.23k
            break;
77
27.1k
        default:
78
27.1k
            break;
79
39.0k
        }
80
39.0k
        break;
81
82
39.0k
    case FIXVAR:
83
22.4k
        if (sbr->L_E[ch] > 1)
84
9.08k
        {
85
9.08k
            int8_t i = sbr->L_E[ch];
86
9.08k
            border = sbr->abs_bord_trail[ch];
87
88
29.1k
            for (l = 0; l < (sbr->L_E[ch] - 1); l++)
89
20.9k
            {
90
20.9k
                if (border < sbr->bs_rel_bord[ch][l])
91
838
                    return 1;
92
93
20.1k
                border -= sbr->bs_rel_bord[ch][l];
94
20.1k
                t_E_temp[--i] = sbr->rate * border;
95
20.1k
            }
96
9.08k
        }
97
21.6k
        break;
98
99
23.0k
    case VARFIX:
100
23.0k
        if (sbr->L_E[ch] > 1)
101
12.1k
        {
102
12.1k
            int8_t i = 1;
103
12.1k
            border = sbr->abs_bord_lead[ch];
104
105
35.3k
            for (l = 0; l < (sbr->L_E[ch] - 1); l++)
106
24.2k
            {
107
24.2k
                border += sbr->bs_rel_bord[ch][l];
108
109
24.2k
                if (border > trail)
110
973
                    return 1;
111
112
23.2k
                t_E_temp[i++] = sbr->rate * border;
113
23.2k
            }
114
12.1k
        }
115
22.0k
        break;
116
117
22.0k
    case VARVAR:
118
21.0k
        if (sbr->bs_num_rel_0[ch])
119
13.9k
        {
120
13.9k
            int8_t i = 1;
121
13.9k
            border = sbr->abs_bord_lead[ch];
122
123
46.2k
            for (l = 0; l < sbr->bs_num_rel_0[ch]; l++)
124
33.2k
            {
125
33.2k
                border += sbr->bs_rel_bord_0[ch][l];
126
127
33.2k
                if (border > trail)
128
1.01k
                    return 1;
129
130
32.2k
                t_E_temp[i++] = sbr->rate * border;
131
32.2k
            }
132
13.9k
        }
133
134
19.9k
        if (sbr->bs_num_rel_1[ch])
135
14.6k
        {
136
14.6k
            int8_t i = sbr->L_E[ch];
137
14.6k
            border = sbr->abs_bord_trail[ch];
138
139
45.9k
            for (l = 0; l < sbr->bs_num_rel_1[ch]; l++)
140
32.3k
            {
141
32.3k
                if (border < sbr->bs_rel_bord_1[ch][l])
142
1.08k
                    return 1;
143
144
31.2k
                border -= sbr->bs_rel_bord_1[ch][l];
145
31.2k
                t_E_temp[--i] = sbr->rate * border;
146
31.2k
            }
147
14.6k
        }
148
18.9k
        break;
149
105k
    }
150
151
    /* no error occured, we can safely use this t_E vector */
152
711k
    for (l = 0; l < 6; l++)
153
610k
    {
154
610k
        sbr->t_E[ch][l] = t_E_temp[l];
155
610k
    }
156
157
101k
    return 0;
158
105k
}
159
160
void noise_floor_time_border_vector(sbr_info *sbr, uint8_t ch)
161
101k
{
162
101k
    sbr->t_Q[ch][0] = sbr->t_E[ch][0];
163
164
101k
    if (sbr->L_E[ch] == 1)
165
54.5k
    {
166
54.5k
        sbr->t_Q[ch][1] = sbr->t_E[ch][1];
167
54.5k
        sbr->t_Q[ch][2] = 0;
168
54.5k
    } else {
169
47.1k
        uint8_t index = middleBorder(sbr, ch);
170
47.1k
        sbr->t_Q[ch][1] = sbr->t_E[ch][index];
171
47.1k
        sbr->t_Q[ch][2] = sbr->t_E[ch][sbr->L_E[ch]];
172
47.1k
    }
173
101k
}
174
175
#if 0
176
static int16_t rel_bord_lead(sbr_info *sbr, uint8_t ch, uint8_t l)
177
{
178
    uint8_t i;
179
    int16_t acc = 0;
180
181
    switch (sbr->bs_frame_class[ch])
182
    {
183
    case FIXFIX:
184
        return sbr->numTimeSlots/sbr->L_E[ch];
185
    case FIXVAR:
186
        return 0;
187
    case VARFIX:
188
        for (i = 0; i < l; i++)
189
        {
190
            acc += sbr->bs_rel_bord[ch][i];
191
        }
192
        return acc;
193
    case VARVAR:
194
        for (i = 0; i < l; i++)
195
        {
196
            acc += sbr->bs_rel_bord_0[ch][i];
197
        }
198
        return acc;
199
    }
200
201
    return 0;
202
}
203
204
static int16_t rel_bord_trail(sbr_info *sbr, uint8_t ch, uint8_t l)
205
{
206
    uint8_t i;
207
    int16_t acc = 0;
208
209
    switch (sbr->bs_frame_class[ch])
210
    {
211
    case FIXFIX:
212
    case VARFIX:
213
        return 0;
214
    case FIXVAR:
215
        for (i = 0; i < l; i++)
216
        {
217
            acc += sbr->bs_rel_bord[ch][i];
218
        }
219
        return acc;
220
    case VARVAR:
221
        for (i = 0; i < l; i++)
222
        {
223
            acc += sbr->bs_rel_bord_1[ch][i];
224
        }
225
        return acc;
226
    }
227
228
    return 0;
229
}
230
#endif
231
232
static uint8_t middleBorder(sbr_info *sbr, uint8_t ch)
233
47.1k
{
234
47.1k
    int8_t retval = 0;
235
236
47.1k
    switch (sbr->bs_frame_class[ch])
237
47.1k
    {
238
11.8k
    case FIXFIX:
239
11.8k
        retval = sbr->L_E[ch]/2;
240
11.8k
        break;
241
11.1k
    case VARFIX:
242
11.1k
        if (sbr->bs_pointer[ch] == 0)
243
4.46k
            retval = 1;
244
6.68k
        else if (sbr->bs_pointer[ch] == 1)
245
2.40k
            retval = sbr->L_E[ch] - 1;
246
4.27k
        else
247
4.27k
            retval = sbr->bs_pointer[ch] - 1;
248
11.1k
        break;
249
8.24k
    case FIXVAR:
250
24.1k
    case VARVAR:
251
24.1k
        if (sbr->bs_pointer[ch] > 1)
252
9.35k
            retval = sbr->L_E[ch] + 1 - sbr->bs_pointer[ch];
253
14.7k
        else
254
14.7k
            retval = sbr->L_E[ch] - 1;
255
24.1k
        break;
256
47.1k
    }
257
258
47.1k
    return (retval > 0) ? retval : 0;
259
47.1k
}
260
261
262
#endif