Coverage Report

Created: 2026-07-16 06:55

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/aac/libDRCdec/src/drcDec_tools.cpp
Line
Count
Source
1
/* -----------------------------------------------------------------------------
2
Software License for The Fraunhofer FDK AAC Codec Library for Android
3
4
© Copyright  1995 - 2018 Fraunhofer-Gesellschaft zur Förderung der angewandten
5
Forschung e.V. All rights reserved.
6
7
 1.    INTRODUCTION
8
The Fraunhofer FDK AAC Codec Library for Android ("FDK AAC Codec") is software
9
that implements the MPEG Advanced Audio Coding ("AAC") encoding and decoding
10
scheme for digital audio. This FDK AAC Codec software is intended to be used on
11
a wide variety of Android devices.
12
13
AAC's HE-AAC and HE-AAC v2 versions are regarded as today's most efficient
14
general perceptual audio codecs. AAC-ELD is considered the best-performing
15
full-bandwidth communications codec by independent studies and is widely
16
deployed. AAC has been standardized by ISO and IEC as part of the MPEG
17
specifications.
18
19
Patent licenses for necessary patent claims for the FDK AAC Codec (including
20
those of Fraunhofer) may be obtained through Via Licensing
21
(www.vialicensing.com) or through the respective patent owners individually for
22
the purpose of encoding or decoding bit streams in products that are compliant
23
with the ISO/IEC MPEG audio standards. Please note that most manufacturers of
24
Android devices already license these patent claims through Via Licensing or
25
directly from the patent owners, and therefore FDK AAC Codec software may
26
already be covered under those patent licenses when it is used for those
27
licensed purposes only.
28
29
Commercially-licensed AAC software libraries, including floating-point versions
30
with enhanced sound quality, are also available from Fraunhofer. Users are
31
encouraged to check the Fraunhofer website for additional applications
32
information and documentation.
33
34
2.    COPYRIGHT LICENSE
35
36
Redistribution and use in source and binary forms, with or without modification,
37
are permitted without payment of copyright license fees provided that you
38
satisfy the following conditions:
39
40
You must retain the complete text of this software license in redistributions of
41
the FDK AAC Codec or your modifications thereto in source code form.
42
43
You must retain the complete text of this software license in the documentation
44
and/or other materials provided with redistributions of the FDK AAC Codec or
45
your modifications thereto in binary form. You must make available free of
46
charge copies of the complete source code of the FDK AAC Codec and your
47
modifications thereto to recipients of copies in binary form.
48
49
The name of Fraunhofer may not be used to endorse or promote products derived
50
from this library without prior written permission.
51
52
You may not charge copyright license fees for anyone to use, copy or distribute
53
the FDK AAC Codec software or your modifications thereto.
54
55
Your modified versions of the FDK AAC Codec must carry prominent notices stating
56
that you changed the software and the date of any change. For modified versions
57
of the FDK AAC Codec, the term "Fraunhofer FDK AAC Codec Library for Android"
58
must be replaced by the term "Third-Party Modified Version of the Fraunhofer FDK
59
AAC Codec Library for Android."
60
61
3.    NO PATENT LICENSE
62
63
NO EXPRESS OR IMPLIED LICENSES TO ANY PATENT CLAIMS, including without
64
limitation the patents of Fraunhofer, ARE GRANTED BY THIS SOFTWARE LICENSE.
65
Fraunhofer provides no warranty of patent non-infringement with respect to this
66
software.
67
68
You may use this FDK AAC Codec software or modifications thereto only for
69
purposes that are authorized by appropriate patent licenses.
70
71
4.    DISCLAIMER
72
73
This FDK AAC Codec software is provided by Fraunhofer on behalf of the copyright
74
holders and contributors "AS IS" and WITHOUT ANY EXPRESS OR IMPLIED WARRANTIES,
75
including but not limited to the implied warranties of merchantability and
76
fitness for a particular purpose. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
77
CONTRIBUTORS BE LIABLE for any direct, indirect, incidental, special, exemplary,
78
or consequential damages, including but not limited to procurement of substitute
79
goods or services; loss of use, data, or profits, or business interruption,
80
however caused and on any theory of liability, whether in contract, strict
81
liability, or tort (including negligence), arising in any way out of the use of
82
this software, even if advised of the possibility of such damage.
83
84
5.    CONTACT INFORMATION
85
86
Fraunhofer Institute for Integrated Circuits IIS
87
Attention: Audio and Multimedia Departments - FDK AAC LL
88
Am Wolfsmantel 33
89
91058 Erlangen, Germany
90
91
www.iis.fraunhofer.de/amm
92
amm-info@iis.fraunhofer.de
93
----------------------------------------------------------------------------- */
94
95
/************************* MPEG-D DRC decoder library **************************
96
97
   Author(s):
98
99
   Description:
100
101
*******************************************************************************/
102
103
#include "drcDec_types.h"
104
#include "drcDec_tools.h"
105
#include "fixpoint_math.h"
106
#include "drcDecoder.h"
107
108
166k
int getDeltaTmin(const int sampleRate) {
109
  /* half_ms = round (0.0005 * sampleRate); */
110
166k
  int half_ms = (sampleRate + 1000) / 2000;
111
166k
  int deltaTmin = 1;
112
166k
  if (sampleRate < 1000) {
113
438
    return DE_NOT_OK;
114
438
  }
115
983k
  while (deltaTmin <= half_ms) {
116
817k
    deltaTmin = deltaTmin << 1;
117
817k
  }
118
165k
  return deltaTmin;
119
166k
}
120
121
DRC_COEFFICIENTS_UNI_DRC* selectDrcCoefficients(
122
1.12M
    HANDLE_UNI_DRC_CONFIG hUniDrcConfig, const int location) {
123
1.12M
  int n;
124
1.12M
  int c = -1;
125
1.99M
  for (n = 0; n < hUniDrcConfig->drcCoefficientsUniDrcCount; n++) {
126
866k
    if (hUniDrcConfig->drcCoefficientsUniDrc[n].drcLocation == location) {
127
377k
      c = n;
128
377k
    }
129
866k
  }
130
1.12M
  if (c >= 0) {
131
330k
    return &(hUniDrcConfig->drcCoefficientsUniDrc[c]);
132
330k
  }
133
796k
  return NULL; /* possible during bitstream parsing */
134
1.12M
}
135
136
DRC_INSTRUCTIONS_UNI_DRC* selectDrcInstructions(
137
872k
    HANDLE_UNI_DRC_CONFIG hUniDrcConfig, const int drcSetId) {
138
872k
  int i;
139
1.52M
  for (i = 0; i < hUniDrcConfig->drcInstructionsCountInclVirtual; i++) {
140
1.52M
    if (hUniDrcConfig->drcInstructionsUniDrc[i].drcSetId == drcSetId) {
141
872k
      return &(hUniDrcConfig->drcInstructionsUniDrc[i]);
142
872k
    }
143
1.52M
  }
144
0
  return NULL;
145
872k
}
146
147
DOWNMIX_INSTRUCTIONS* selectDownmixInstructions(
148
4.99k
    HANDLE_UNI_DRC_CONFIG hUniDrcConfig, const int downmixId) {
149
4.99k
  int i;
150
10.1k
  for (i = 0; i < hUniDrcConfig->downmixInstructionsCount; i++) {
151
5.63k
    if (hUniDrcConfig->downmixInstructions[i].downmixId == downmixId) {
152
464
      return &(hUniDrcConfig->downmixInstructions[i]);
153
464
    }
154
5.63k
  }
155
4.52k
  return NULL;
156
4.99k
}
157
158
DRC_ERROR
159
deriveDrcChannelGroups(
160
    const int drcSetEffect,                                    /* in */
161
    const int channelCount,                                    /* in */
162
    const SCHAR* gainSetIndex,                                 /* in */
163
    const DUCKING_MODIFICATION* duckingModificationForChannel, /* in */
164
    UCHAR* nDrcChannelGroups,                                  /* out */
165
    SCHAR* uniqueIndex,     /* out (gainSetIndexForChannelGroup) */
166
    SCHAR* groupForChannel, /* out */
167
    DUCKING_MODIFICATION* duckingModificationForChannelGroup) /* out */
168
339k
{
169
339k
  int duckingSequence = -1;
170
339k
  int c, n, g, match, idx;
171
339k
  FIXP_SGL factor;
172
339k
  FIXP_SGL uniqueScaling[8];
173
174
3.05M
  for (g = 0; g < 8; g++) {
175
2.71M
    uniqueIndex[g] = -10;
176
2.71M
    uniqueScaling[g] = FIXP_SGL(-1.0f);
177
2.71M
  }
178
179
339k
  g = 0;
180
181
339k
  if (drcSetEffect & EB_DUCK_OTHER) {
182
33.9k
    for (c = 0; c < channelCount; c++) {
183
18.6k
      match = 0;
184
18.6k
      if (c >= 8) return DE_MEMORY_ERROR;
185
18.6k
      idx = gainSetIndex[c];
186
18.6k
      factor = duckingModificationForChannel[c].duckingScaling;
187
18.6k
      if (idx < 0) {
188
9.78k
        for (n = 0; n < g; n++) {
189
5.56k
          if (uniqueScaling[n] == factor) {
190
4.74k
            match = 1;
191
4.74k
            groupForChannel[c] = n;
192
4.74k
            break;
193
4.74k
          }
194
5.56k
        }
195
8.96k
        if (match == 0) {
196
4.21k
          if (g >= 8) return DE_MEMORY_ERROR;
197
4.21k
          uniqueIndex[g] = idx;
198
4.21k
          uniqueScaling[g] = factor;
199
4.21k
          groupForChannel[c] = g;
200
4.21k
          g++;
201
4.21k
        }
202
9.71k
      } else {
203
9.71k
        if ((duckingSequence > 0) && (duckingSequence != idx)) {
204
575
          return DE_NOT_OK;
205
575
        }
206
9.13k
        duckingSequence = idx;
207
9.13k
        groupForChannel[c] = -1;
208
9.13k
      }
209
18.6k
    }
210
15.3k
    if (duckingSequence == -1) {
211
8.17k
      return DE_NOT_OK;
212
8.17k
    }
213
323k
  } else if (drcSetEffect & EB_DUCK_SELF) {
214
85.0k
    for (c = 0; c < channelCount; c++) {
215
63.3k
      match = 0;
216
63.3k
      if (c >= 8) return DE_MEMORY_ERROR;
217
63.3k
      idx = gainSetIndex[c];
218
63.3k
      factor = duckingModificationForChannel[c].duckingScaling;
219
63.3k
      if (idx >= 0) {
220
86.8k
        for (n = 0; n < g; n++) {
221
57.7k
          if ((uniqueIndex[n] == idx) && (uniqueScaling[n] == factor)) {
222
6.52k
            match = 1;
223
6.52k
            groupForChannel[c] = n;
224
6.52k
            break;
225
6.52k
          }
226
57.7k
        }
227
35.6k
        if (match == 0) {
228
29.1k
          if (g >= 8) return DE_MEMORY_ERROR;
229
29.1k
          uniqueIndex[g] = idx;
230
29.1k
          uniqueScaling[g] = factor;
231
29.1k
          groupForChannel[c] = g;
232
29.1k
          g++;
233
29.1k
        }
234
35.6k
      } else {
235
27.6k
        groupForChannel[c] = -1;
236
27.6k
      }
237
63.3k
    }
238
302k
  } else { /* no ducking */
239
1.12M
    for (c = 0; c < channelCount; c++) {
240
827k
      if (c >= 8) return DE_MEMORY_ERROR;
241
827k
      idx = gainSetIndex[c];
242
827k
      match = 0;
243
827k
      if (idx >= 0) {
244
228k
        for (n = 0; n < g; n++) {
245
154k
          if (uniqueIndex[n] == idx) {
246
108k
            match = 1;
247
108k
            groupForChannel[c] = n;
248
108k
            break;
249
108k
          }
250
154k
        }
251
182k
        if (match == 0) {
252
73.7k
          if (g >= 8) return DE_MEMORY_ERROR;
253
73.7k
          uniqueIndex[g] = idx;
254
73.7k
          groupForChannel[c] = g;
255
73.7k
          g++;
256
73.7k
        }
257
645k
      } else {
258
645k
        groupForChannel[c] = -1;
259
645k
      }
260
827k
    }
261
302k
  }
262
330k
  *nDrcChannelGroups = g;
263
264
330k
  if (drcSetEffect & (EB_DUCK_OTHER | EB_DUCK_SELF)) {
265
61.2k
    for (g = 0; g < *nDrcChannelGroups; g++) {
266
32.3k
      if (drcSetEffect & EB_DUCK_OTHER) {
267
3.24k
        uniqueIndex[g] = duckingSequence;
268
3.24k
      }
269
32.3k
      duckingModificationForChannelGroup[g].duckingScaling = uniqueScaling[g];
270
32.3k
      if (uniqueScaling[g] != FL2FXCONST_SGL(1.0f / (float)(1 << 2))) {
271
13.1k
        duckingModificationForChannelGroup[g].duckingScalingPresent = 1;
272
19.2k
      } else {
273
19.2k
        duckingModificationForChannelGroup[g].duckingScalingPresent = 0;
274
19.2k
      }
275
32.3k
    }
276
28.8k
  }
277
278
330k
  return DE_OK;
279
339k
}
280
281
FIXP_DBL
282
19.2k
dB2lin(const FIXP_DBL dB_m, const int dB_e, int* pLin_e) {
283
  /* get linear value from dB.
284
     return lin_val = 10^(dB_val/20) = 2^(log2(10)/20*dB_val)
285
     with dB_val = dB_m *2^dB_e and lin_val = lin_m * 2^lin_e */
286
19.2k
  FIXP_DBL lin_m =
287
19.2k
      f2Pow(fMult(dB_m, FL2FXCONST_DBL(0.1660964f * (float)(1 << 2))), dB_e - 2,
288
19.2k
            pLin_e);
289
290
19.2k
  return lin_m;
291
19.2k
}
292
293
FIXP_DBL
294
0
lin2dB(const FIXP_DBL lin_m, const int lin_e, int* pDb_e) {
295
  /* get dB value from linear value.
296
     return dB_val = 20*log10(lin_val)
297
     with dB_val = dB_m *2^dB_e and lin_val = lin_m * 2^lin_e */
298
0
  FIXP_DBL dB_m;
299
300
0
  if (lin_m == (FIXP_DBL)0) { /* return very small value representing -inf */
301
0
    dB_m = (FIXP_DBL)MINVAL_DBL;
302
0
    *pDb_e = DFRACT_BITS - 1;
303
0
  } else {
304
    /* 20*log10(lin_val) = 20/log2(10)*log2(lin_val) */
305
0
    dB_m = fMultDiv2(FL2FXCONST_DBL(6.02059991f / (float)(1 << 3)),
306
0
                     fLog2(lin_m, lin_e, pDb_e));
307
0
    *pDb_e += 3 + 1;
308
0
  }
309
310
0
  return dB_m;
311
0
}
312
313
FIXP_DBL
314
124k
approxDb2lin(const FIXP_DBL dB_m, const int dB_e, int* pLin_e) {
315
  /* get linear value from approximate dB.
316
     return lin_val = 2^(dB_val/6)
317
     with dB_val = dB_m *2^dB_e and lin_val = lin_m * 2^lin_e */
318
124k
  FIXP_DBL lin_m =
319
124k
      f2Pow(fMult(dB_m, FL2FXCONST_DBL(0.1666667f * (float)(1 << 2))), dB_e - 2,
320
124k
            pLin_e);
321
322
124k
  return lin_m;
323
124k
}
324
325
int bitstreamContainsMultibandDrc(HANDLE_UNI_DRC_CONFIG hUniDrcConfig,
326
0
                                  const int downmixId) {
327
0
  int i, g, d, seq;
328
0
  DRC_INSTRUCTIONS_UNI_DRC* pInst;
329
0
  DRC_COEFFICIENTS_UNI_DRC* pCoef = NULL;
330
0
  int isMultiband = 0;
331
332
0
  pCoef = selectDrcCoefficients(hUniDrcConfig, LOCATION_SELECTED);
333
0
  if (pCoef == NULL) return 0;
334
335
0
  for (i = 0; i < hUniDrcConfig->drcInstructionsUniDrcCount; i++) {
336
0
    pInst = &(hUniDrcConfig->drcInstructionsUniDrc[i]);
337
0
    for (d = 0; d < pInst->downmixIdCount; d++) {
338
0
      if (downmixId == pInst->downmixId[d]) {
339
0
        for (g = 0; g < pInst->nDrcChannelGroups; g++) {
340
0
          seq = pInst->gainSetIndexForChannelGroup[g];
341
0
          if (pCoef->gainSet[seq].bandCount > 1) {
342
0
            isMultiband = 1;
343
0
          }
344
0
        }
345
0
      }
346
0
    }
347
0
  }
348
349
0
  return isMultiband;
350
0
}
351
352
0
FIXP_DBL getDownmixOffset(DOWNMIX_INSTRUCTIONS* pDown, int baseChannelCount) {
353
0
  FIXP_DBL downmixOffset = FL2FXCONST_DBL(1.0f / (1 << 1)); /* e = 1 */
354
0
  if ((pDown->bsDownmixOffset == 1) || (pDown->bsDownmixOffset == 2)) {
355
0
    int e_a, e_downmixOffset;
356
0
    FIXP_DBL a, q;
357
0
    if (baseChannelCount <= pDown->targetChannelCount) return downmixOffset;
358
359
0
    q = fDivNorm((FIXP_DBL)pDown->targetChannelCount,
360
0
                 (FIXP_DBL)baseChannelCount); /* e = 0 */
361
0
    a = lin2dB(q, 0, &e_a);
362
0
    if (pDown->bsDownmixOffset == 2) {
363
0
      e_a += 1; /* a *= 2 */
364
0
    }
365
    /* a = 0.5 * round (a) */
366
0
    a = fixp_round(a, e_a) >> 1;
367
0
    downmixOffset = dB2lin(a, e_a, &e_downmixOffset);
368
0
    downmixOffset = scaleValue(downmixOffset, e_downmixOffset - 1);
369
0
  }
370
0
  return downmixOffset;
371
0
}