Coverage Report

Created: 2025-07-23 06:30

/proc/self/cwd/libfaad/hcr.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: hcr.c,v 1.26 2009/01/26 23:51:15 menno Exp $
29
**/
30
31
#include "common.h"
32
#include "structs.h"
33
34
#include <stdlib.h>
35
36
#include "specrec.h"
37
#include "huffman.h"
38
39
/* ISO/IEC 14496-3/Amd.1
40
 * 8.5.3.3: Huffman Codeword Reordering for AAC spectral data (HCR)
41
 *
42
 * HCR devides the spectral data in known fixed size segments, and
43
 * sorts it by the importance of the data. The importance is firstly
44
 * the (lower) position in the spectrum, and secondly the largest
45
 * value in the used codebook.
46
 * The most important data is written at the start of each segment
47
 * (at known positions), the remaining data is interleaved inbetween,
48
 * with the writing direction alternating.
49
 * Data length is not increased.
50
*/
51
52
#ifdef ERROR_RESILIENCE
53
54
/* 8.5.3.3.1 Pre-sorting */
55
56
157
#define NUM_CB      6
57
779
#define NUM_CB_ER   22
58
#define MAX_CB      32
59
299k
#define VCB11_FIRST 16
60
111k
#define VCB11_LAST  31
61
62
static const uint8_t PreSortCB_STD[NUM_CB] =
63
    { 11, 9, 7, 5, 3, 1};
64
65
static const uint8_t PreSortCB_ER[NUM_CB_ER] =
66
    { 11, 31, 30, 29, 28, 27, 26, 25, 24, 23, 22, 21, 20, 19, 18, 17, 16, 9, 7, 5, 3, 1};
67
68
/* 8.5.3.3.2 Derivation of segment width */
69
70
static const uint8_t maxCwLen[MAX_CB] = {0, 11, 9, 20, 16, 13, 11, 14, 12, 17, 14, 49,
71
    0, 0, 0, 0, 14, 17, 21, 21, 25, 25, 29, 29, 29, 29, 33, 33, 33, 37, 37, 41};
72
73
36.1k
#define segmentWidth(cb)    min(maxCwLen[cb], ics->length_of_longest_codeword)
74
75
/* bit-twiddling helpers */
76
static const uint8_t  S[] = {1, 2, 4, 8, 16};
77
static const uint32_t B[] = {0x55555555, 0x33333333, 0x0F0F0F0F, 0x00FF00FF, 0x0000FFFF};
78
79
typedef struct
80
{
81
    uint8_t     cb;
82
    uint8_t     decoded;
83
    uint16_t  sp_offset;
84
    bits_t      bits;
85
} codeword_t;
86
87
static uint32_t reverse_word(uint32_t v)
88
86.3k
{
89
86.3k
    v = ((v >> S[0]) & B[0]) | ((v << S[0]) & ~B[0]);
90
86.3k
    v = ((v >> S[1]) & B[1]) | ((v << S[1]) & ~B[1]);
91
86.3k
    v = ((v >> S[2]) & B[2]) | ((v << S[2]) & ~B[2]);
92
86.3k
    v = ((v >> S[3]) & B[3]) | ((v << S[3]) & ~B[3]);
93
86.3k
    v = ((v >> S[4]) & B[4]) | ((v << S[4]) & ~B[4]);
94
86.3k
    return v;
95
86.3k
}
96
97
/* bits_t version */
98
static void rewrev_bits(bits_t *bits)
99
119k
{
100
119k
    if (bits->len == 0) return;
101
71.9k
    if (bits->len <= 32) {
102
57.5k
        bits->bufb = 0;
103
57.5k
        bits->bufa = reverse_word(bits->bufa) >> (32 - bits->len);
104
57.5k
    } else {
105
        /* last 32<>32 bit swap via rename */
106
14.4k
        uint32_t lo = reverse_word(bits->bufb);
107
14.4k
        uint32_t hi = reverse_word(bits->bufa);
108
109
14.4k
        if (bits->len == 64) {
110
27
            bits->bufb = hi;
111
27
            bits->bufa = lo;
112
14.3k
        } else {
113
            /* shift off low bits (this is really only one 64 bit shift) */
114
14.3k
            bits->bufb = hi >> (64 - bits->len);
115
14.3k
            bits->bufa = (lo >> (64 - bits->len)) | (hi << (bits->len - 32));
116
14.3k
        }
117
14.4k
    }
118
71.9k
}
119
120
121
/* merge bits of a to b */
122
/* precondition: a->len + b->len <= 64 */
123
static void concat_bits(bits_t *b, bits_t *a)
124
7.19k
{
125
7.19k
    uint32_t bl, bh, al, ah;
126
127
    /* empty addend */
128
7.19k
    if (a->len == 0) return;
129
130
    /* addend becomes result */
131
7.19k
    if (b->len == 0)
132
0
    {
133
0
        *b = *a;
134
0
        return;
135
0
    }
136
137
7.19k
    al = a->bufa;
138
7.19k
    ah = a->bufb;
139
140
7.19k
    if (b->len > 32)
141
441
    {
142
        /* (b->len - 32) is 1..31 */
143
        /* maskoff superfluous high b bits */
144
441
        bl = b->bufa;
145
441
        bh = b->bufb & ((1u << (b->len-32)) - 1);
146
        /* left shift a b->len bits */
147
441
        ah = al << (b->len - 32);
148
441
        al = 0;
149
6.75k
    } else if (b->len == 32) {
150
63
        bl = b->bufa;
151
63
        bh = 0;
152
63
        ah = al;
153
63
        al = 0;
154
6.69k
    } else {
155
        /* b->len is 1..31, (32 - b->len) is 1..31 */
156
6.69k
        bl = b->bufa & ((1u << (b->len)) - 1);
157
6.69k
        bh = 0;
158
6.69k
        ah = (ah << (b->len)) | (al >> (32 - b->len));
159
6.69k
        al = al << b->len;
160
6.69k
    }
161
162
    /* merge */
163
7.19k
    b->bufa = bl | al;
164
7.19k
    b->bufb = bh | ah;
165
166
7.19k
    b->len += a->len;
167
7.19k
}
168
169
static uint8_t is_good_cb(uint8_t this_CB, uint8_t this_sec_CB)
170
640k
{
171
    /* only want spectral data CB's */
172
640k
    if ((this_sec_CB > ZERO_HCB && this_sec_CB <= ESC_HCB) || (this_sec_CB >= VCB11_FIRST && this_sec_CB <= VCB11_LAST))
173
602k
    {
174
602k
        if (this_CB < ESC_HCB)
175
179k
        {
176
            /* normal codebook pairs */
177
179k
            return ((this_sec_CB == this_CB) || (this_sec_CB == this_CB + 1));
178
179k
        } else
179
422k
        {
180
            /* escape codebook */
181
422k
            return (this_sec_CB == this_CB);
182
422k
        }
183
602k
    }
184
38.4k
    return 0;
185
640k
}
186
187
static void read_segment(bits_t *segment, uint8_t segwidth, bitfile *ld)
188
48.4k
{
189
48.4k
    segment->len = segwidth;
190
191
48.4k
     if (segwidth > 32)
192
8.68k
     {
193
8.68k
        segment->bufb = faad_getbits(ld, segwidth - 32);
194
8.68k
        segment->bufa = faad_getbits(ld, 32);
195
196
39.7k
    } else {
197
39.7k
        segment->bufb = 0;
198
39.7k
        segment->bufa = faad_getbits(ld, segwidth);
199
39.7k
    }
200
48.4k
}
201
202
static void fill_in_codeword(codeword_t *codeword, uint16_t index, uint16_t sp, uint8_t cb)
203
34.6k
{
204
34.6k
    codeword[index].sp_offset = sp;
205
34.6k
    codeword[index].cb = cb;
206
34.6k
    codeword[index].decoded = 0;
207
34.6k
    codeword[index].bits.len = 0;
208
34.6k
}
209
210
uint8_t reordered_spectral_data(NeAACDecStruct *hDecoder, ic_stream *ics,
211
                                bitfile *ld, int16_t *spectral_data)
212
4.26k
{
213
4.26k
    uint16_t PCWs_done;
214
4.26k
    uint16_t numberOfSegments, numberOfSets, numberOfCodewords;
215
216
4.26k
    codeword_t codeword[512];
217
4.26k
    bits_t segment[512];
218
219
4.26k
    uint16_t sp_offset[8];
220
4.26k
    uint16_t g, i, sortloop, set, bitsread;
221
4.26k
    /*uint16_t bitsleft, codewordsleft*/;
222
4.26k
    uint8_t w_idx, sfb, this_CB, last_CB, this_sec_CB;
223
224
4.26k
    const uint16_t nshort = hDecoder->frameLength/8;
225
4.26k
    const uint16_t sp_data_len = ics->length_of_reordered_spectral_data;
226
227
4.26k
    const uint8_t *PreSortCb;
228
229
    /* no data (e.g. silence) */
230
4.26k
    if (sp_data_len == 0)
231
3.31k
        return 0;
232
233
    /* since there is spectral data, at least one codeword has nonzero length */
234
956
    if (ics->length_of_longest_codeword == 0)
235
17
        return 10;
236
237
939
    if (sp_data_len < ics->length_of_longest_codeword)
238
3
        return 10;
239
240
936
    sp_offset[0] = 0;
241
1.20k
    for (g = 1; g < ics->num_window_groups; g++)
242
265
    {
243
265
        sp_offset[g] = sp_offset[g-1] + nshort*ics->window_group_length[g-1];
244
265
    }
245
246
936
    PCWs_done = 0;
247
936
    numberOfSegments = 0;
248
936
    numberOfCodewords = 0;
249
936
    bitsread = 0;
250
251
    /* VCB11 code books in use */
252
936
    if (hDecoder->aacSectionDataResilienceFlag)
253
779
    {
254
779
        PreSortCb = PreSortCB_ER;
255
779
        last_CB = NUM_CB_ER;
256
779
    } else
257
157
    {
258
157
        PreSortCb = PreSortCB_STD;
259
157
        last_CB = NUM_CB;
260
157
    }
261
262
    /* step 1: decode PCW's (set 0), and stuff data in easier-to-use format */
263
18.2k
    for (sortloop = 0; sortloop < last_CB; sortloop++)
264
17.3k
    {
265
        /* select codebook to process this pass */
266
17.3k
        this_CB = PreSortCb[sortloop];
267
268
        /* loop over sfbs */
269
171k
        for (sfb = 0; sfb < ics->max_sfb; sfb++)
270
154k
        {
271
            /* loop over all in this sfb, 4 lines per loop */
272
776k
            for (w_idx = 0; 4*w_idx < (min(ics->swb_offset[sfb+1], ics->swb_offset_max) - ics->swb_offset[sfb]); w_idx++)
273
622k
            {
274
1.26M
                for(g = 0; g < ics->num_window_groups; g++)
275
640k
                {
276
4.86M
                    for (i = 0; i < ics->num_sec[g]; i++)
277
4.22M
                    {
278
                        /* check whether sfb used here is the one we want to process */
279
4.22M
                        if ((ics->sect_start[g][i] <= sfb) && (ics->sect_end[g][i] > sfb))
280
640k
                        {
281
                            /* check whether codebook used here is the one we want to process */
282
640k
                            this_sec_CB = ics->sect_cb[g][i];
283
284
640k
                            if (is_good_cb(this_CB, this_sec_CB))
285
36.1k
                            {
286
                                /* precalculate some stuff */
287
36.1k
                                uint16_t sect_sfb_size = ics->sect_sfb_offset[g][sfb+1] - ics->sect_sfb_offset[g][sfb];
288
36.1k
                                uint8_t inc = (this_sec_CB < FIRST_PAIR_HCB) ? QUAD_LEN : PAIR_LEN;
289
36.1k
                                uint16_t group_cws_count = (4*ics->window_group_length[g])/inc;
290
36.1k
                                uint8_t segwidth = segmentWidth(this_sec_CB);
291
36.1k
                                uint16_t cws;
292
293
                                /* read codewords until end of sfb or end of window group (shouldn't only 1 trigger?) */
294
118k
                                for (cws = 0; (cws < group_cws_count) && ((cws + w_idx*group_cws_count) < sect_sfb_size); cws++)
295
82.7k
                                {
296
82.7k
                                    uint16_t sp = sp_offset[g] + ics->sect_sfb_offset[g][sfb] + inc * (cws + w_idx*group_cws_count);
297
298
                                    /* read and decode PCW */
299
82.7k
                                    if (!PCWs_done)
300
48.5k
                                    {
301
                                        /* read in normal segments */
302
48.5k
                                        if (bitsread + segwidth <= sp_data_len)
303
47.9k
                                        {
304
47.9k
                                            read_segment(&segment[numberOfSegments], segwidth, ld);
305
47.9k
                                            bitsread += segwidth;
306
307
47.9k
                                            huffman_spectral_data_2(this_sec_CB, &segment[numberOfSegments], &spectral_data[sp]);
308
309
                                            /* keep leftover bits */
310
47.9k
                                            rewrev_bits(&segment[numberOfSegments]);
311
312
47.9k
                                            numberOfSegments++;
313
47.9k
                                        } else {  // sp_data_len - bitsread < segwidth
314
                                            /* remaining stuff after last segment, we unfortunately couldn't read
315
                                               this in earlier because it might not fit in 64 bits. since we already
316
                                               decoded (and removed) the PCW it is now should fit */
317
527
                                            if (bitsread < sp_data_len)
318
451
                                            {
319
451
                                                const uint8_t additional_bits = (uint8_t)(sp_data_len - bitsread);
320
321
451
                                                read_segment(&segment[numberOfSegments], additional_bits, ld);
322
451
                                                segment[numberOfSegments].len += segment[numberOfSegments-1].len;
323
451
                                                if (segment[numberOfSegments].len > 64)
324
41
                                                    return 10;
325
410
                                                rewrev_bits(&segment[numberOfSegments]);
326
327
410
                                                if (segment[numberOfSegments-1].len > 32)
328
68
                                                {
329
68
                                                    segment[numberOfSegments-1].bufb = segment[numberOfSegments].bufb +
330
68
                                                        showbits_hcr(&segment[numberOfSegments-1], segment[numberOfSegments-1].len - 32);
331
68
                                                    segment[numberOfSegments-1].bufa = segment[numberOfSegments].bufa +
332
68
                                                        showbits_hcr(&segment[numberOfSegments-1], 32);
333
342
                                                } else {
334
342
                                                    segment[numberOfSegments-1].bufa = segment[numberOfSegments].bufa +
335
342
                                                        showbits_hcr(&segment[numberOfSegments-1], segment[numberOfSegments-1].len);
336
342
                                                    segment[numberOfSegments-1].bufb = segment[numberOfSegments].bufb;
337
342
                                                }
338
410
                                                segment[numberOfSegments-1].len += additional_bits;
339
410
                                            }
340
486
                                            bitsread = sp_data_len;
341
486
                                            PCWs_done = 1;
342
343
486
                                            fill_in_codeword(codeword, 0, sp, this_sec_CB);
344
486
                                        }
345
48.5k
                                    } else {
346
34.2k
                                        fill_in_codeword(codeword, numberOfCodewords - numberOfSegments, sp, this_sec_CB);
347
34.2k
                                    }
348
82.6k
                                    numberOfCodewords++;
349
82.6k
                                }
350
36.1k
                            }
351
640k
                        }
352
4.22M
                    }
353
640k
                 }
354
622k
             }
355
154k
         }
356
17.3k
    }
357
358
895
    if (numberOfSegments == 0)
359
43
        return 10;
360
361
852
    numberOfSets = numberOfCodewords / numberOfSegments;
362
363
    /* step 2: decode nonPCWs */
364
3.85k
    for (set = 1; set <= numberOfSets; set++)
365
3.00k
    {
366
3.00k
        uint16_t trial;
367
368
74.1k
        for (trial = 0; trial < numberOfSegments; trial++)
369
71.1k
        {
370
71.1k
            uint16_t codewordBase;
371
372
3.56M
            for (codewordBase = 0; codewordBase < numberOfSegments; codewordBase++)
373
3.54M
            {
374
3.54M
                const uint16_t segment_idx = (trial + codewordBase) % numberOfSegments;
375
3.54M
                const uint16_t codeword_idx = codewordBase + set*numberOfSegments - numberOfSegments;
376
377
                /* data up */
378
3.54M
                if (codeword_idx >= numberOfCodewords - numberOfSegments) break;
379
380
3.49M
                if (!codeword[codeword_idx].decoded && segment[segment_idx].len > 0)
381
36.5k
                {
382
36.5k
                    uint8_t tmplen = segment[segment_idx].len + codeword[codeword_idx].bits.len;
383
384
36.5k
                    if (tmplen > 64)
385
265
                    {
386
                      // Drop bits that do not fit concatenation result.
387
265
                      flushbits_hcr(&codeword[codeword_idx].bits, tmplen - 64);
388
265
                    }
389
390
36.5k
                    if (codeword[codeword_idx].bits.len != 0)
391
7.19k
                        concat_bits(&segment[segment_idx], &codeword[codeword_idx].bits);
392
393
36.5k
                    tmplen = segment[segment_idx].len;
394
395
36.5k
                    if (huffman_spectral_data_2(codeword[codeword_idx].cb, &segment[segment_idx],
396
36.5k
                                               &spectral_data[codeword[codeword_idx].sp_offset]) >= 0)
397
28.5k
                    {
398
28.5k
                        codeword[codeword_idx].decoded = 1;
399
28.5k
                    } else
400
8.00k
                    {
401
8.00k
                        codeword[codeword_idx].bits = segment[segment_idx];
402
8.00k
                        codeword[codeword_idx].bits.len = tmplen;
403
8.00k
                    }
404
405
36.5k
                }
406
3.49M
            }
407
71.1k
        }
408
74.1k
        for (i = 0; i < numberOfSegments; i++)
409
71.1k
            rewrev_bits(&segment[i]);
410
3.00k
    }
411
412
#if 0 // Seems to give false errors
413
    bitsleft = 0;
414
415
    for (i = 0; i < numberOfSegments && !bitsleft; i++)
416
        bitsleft += segment[i].len;
417
418
    if (bitsleft) return 10;
419
420
    codewordsleft = 0;
421
422
    for (i = 0; (i < numberOfCodewords - numberOfSegments) && (!codewordsleft); i++)
423
        if (!codeword[i].decoded)
424
                codewordsleft++;
425
426
    if (codewordsleft) return 10;
427
#endif
428
429
430
852
    return 0;
431
432
895
}
433
#endif