Coverage Report

Created: 2025-12-14 06:24

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/proc/self/cwd/libfaad/hcr.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: 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
153
#define NUM_CB      6
57
2.12k
#define NUM_CB_ER   22
58
#define MAX_CB      32
59
284k
#define VCB11_FIRST 16
60
67.0k
#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
27.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
127k
{
89
127k
    v = ((v >> S[0]) & B[0]) | ((v << S[0]) & ~B[0]);
90
127k
    v = ((v >> S[1]) & B[1]) | ((v << S[1]) & ~B[1]);
91
127k
    v = ((v >> S[2]) & B[2]) | ((v << S[2]) & ~B[2]);
92
127k
    v = ((v >> S[3]) & B[3]) | ((v << S[3]) & ~B[3]);
93
127k
    v = ((v >> S[4]) & B[4]) | ((v << S[4]) & ~B[4]);
94
127k
    return v;
95
127k
}
96
97
/* bits_t version */
98
static void rewrev_bits(bits_t *bits)
99
163k
{
100
163k
    if (bits->len == 0) return;
101
111k
    if (bits->len <= 32) {
102
96.0k
        bits->bufb = 0;
103
96.0k
        bits->bufa = reverse_word(bits->bufa) >> (32 - bits->len);
104
96.0k
    } else {
105
        /* last 32<>32 bit swap via rename */
106
15.5k
        uint32_t lo = reverse_word(bits->bufb);
107
15.5k
        uint32_t hi = reverse_word(bits->bufa);
108
109
15.5k
        if (bits->len == 64) {
110
11
            bits->bufb = hi;
111
11
            bits->bufa = lo;
112
15.5k
        } else {
113
            /* shift off low bits (this is really only one 64 bit shift) */
114
15.5k
            bits->bufb = hi >> (64 - bits->len);
115
15.5k
            bits->bufa = (lo >> (64 - bits->len)) | (hi << (bits->len - 32));
116
15.5k
        }
117
15.5k
    }
118
111k
}
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
6.71k
{
125
6.71k
    uint32_t bl, bh, al, ah;
126
127
    /* empty addend */
128
6.71k
    if (a->len == 0) return;
129
130
    /* addend becomes result */
131
6.71k
    if (b->len == 0)
132
0
    {
133
0
        *b = *a;
134
0
        return;
135
0
    }
136
137
6.71k
    al = a->bufa;
138
6.71k
    ah = a->bufb;
139
140
6.71k
    if (b->len > 32)
141
451
    {
142
        /* (b->len - 32) is 1..31 */
143
        /* maskoff superfluous high b bits */
144
451
        bl = b->bufa;
145
451
        bh = b->bufb & ((1u << (b->len-32)) - 1);
146
        /* left shift a b->len bits */
147
451
        ah = al << (b->len - 32);
148
451
        al = 0;
149
6.25k
    } else if (b->len == 32) {
150
39
        bl = b->bufa;
151
39
        bh = 0;
152
39
        ah = al;
153
39
        al = 0;
154
6.22k
    } else {
155
        /* b->len is 1..31, (32 - b->len) is 1..31 */
156
6.22k
        bl = b->bufa & ((1u << (b->len)) - 1);
157
6.22k
        bh = 0;
158
6.22k
        ah = (ah << (b->len)) | (al >> (32 - b->len));
159
6.22k
        al = al << b->len;
160
6.22k
    }
161
162
    /* merge */
163
6.71k
    b->bufa = bl | al;
164
6.71k
    b->bufb = bh | ah;
165
166
6.71k
    b->len += a->len;
167
6.71k
}
168
169
static uint8_t is_good_cb(uint8_t this_CB, uint8_t this_sec_CB)
170
620k
{
171
    /* only want spectral data CB's */
172
620k
    if ((this_sec_CB > ZERO_HCB && this_sec_CB <= ESC_HCB) || (this_sec_CB >= VCB11_FIRST && this_sec_CB <= VCB11_LAST))
173
544k
    {
174
544k
        if (this_CB < ESC_HCB)
175
135k
        {
176
            /* normal codebook pairs */
177
135k
            return ((this_sec_CB == this_CB) || (this_sec_CB == this_CB + 1));
178
135k
        } else
179
409k
        {
180
            /* escape codebook */
181
409k
            return (this_sec_CB == this_CB);
182
409k
        }
183
544k
    }
184
75.3k
    return 0;
185
620k
}
186
187
static void read_segment(bits_t *segment, uint8_t segwidth, bitfile *ld)
188
64.0k
{
189
64.0k
    segment->len = segwidth;
190
191
64.0k
     if (segwidth > 32)
192
8.72k
     {
193
8.72k
        segment->bufb = faad_getbits(ld, segwidth - 32);
194
8.72k
        segment->bufa = faad_getbits(ld, 32);
195
196
55.3k
    } else {
197
55.3k
        segment->bufb = 0;
198
55.3k
        segment->bufa = faad_getbits(ld, segwidth);
199
55.3k
    }
200
64.0k
}
201
202
static void fill_in_codeword(codeword_t *codeword, uint16_t index, uint16_t sp, uint8_t cb)
203
49.4k
{
204
49.4k
    codeword[index].sp_offset = sp;
205
49.4k
    codeword[index].cb = cb;
206
49.4k
    codeword[index].decoded = 0;
207
49.4k
    codeword[index].bits.len = 0;
208
49.4k
}
209
210
uint8_t reordered_spectral_data(NeAACDecStruct *hDecoder, ic_stream *ics,
211
                                bitfile *ld, int16_t *spectral_data)
212
5.82k
{
213
5.82k
    uint16_t PCWs_done;
214
5.82k
    uint16_t numberOfSegments, numberOfSets, numberOfCodewords;
215
216
5.82k
    codeword_t codeword[512];
217
5.82k
    bits_t segment[512];
218
219
5.82k
    uint16_t sp_offset[8];
220
5.82k
    uint16_t g, i, sortloop, set, bitsread;
221
5.82k
    /*uint16_t bitsleft, codewordsleft*/;
222
5.82k
    uint8_t w_idx, sfb, this_CB, last_CB, this_sec_CB;
223
224
5.82k
    const uint16_t nshort = hDecoder->frameLength/8;
225
5.82k
    const uint16_t sp_data_len = ics->length_of_reordered_spectral_data;
226
227
5.82k
    const uint8_t *PreSortCb;
228
229
    /* no data (e.g. silence) */
230
5.82k
    if (sp_data_len == 0)
231
3.50k
        return 0;
232
233
    /* since there is spectral data, at least one codeword has nonzero length */
234
2.31k
    if (ics->length_of_longest_codeword == 0)
235
24
        return 10;
236
237
2.28k
    if (sp_data_len < ics->length_of_longest_codeword)
238
6
        return 10;
239
240
2.28k
    sp_offset[0] = 0;
241
2.55k
    for (g = 1; g < ics->num_window_groups; g++)
242
275
    {
243
275
        sp_offset[g] = sp_offset[g-1] + nshort*ics->window_group_length[g-1];
244
275
    }
245
246
2.28k
    PCWs_done = 0;
247
2.28k
    numberOfSegments = 0;
248
2.28k
    numberOfCodewords = 0;
249
2.28k
    bitsread = 0;
250
251
    /* VCB11 code books in use */
252
2.28k
    if (hDecoder->aacSectionDataResilienceFlag)
253
2.12k
    {
254
2.12k
        PreSortCb = PreSortCB_ER;
255
2.12k
        last_CB = NUM_CB_ER;
256
2.12k
    } else
257
153
    {
258
153
        PreSortCb = PreSortCB_STD;
259
153
        last_CB = NUM_CB;
260
153
    }
261
262
    /* step 1: decode PCW's (set 0), and stuff data in easier-to-use format */
263
49.4k
    for (sortloop = 0; sortloop < last_CB; sortloop++)
264
47.1k
    {
265
        /* select codebook to process this pass */
266
47.1k
        this_CB = PreSortCb[sortloop];
267
268
        /* loop over sfbs */
269
440k
        for (sfb = 0; sfb < ics->max_sfb; sfb++)
270
393k
        {
271
            /* loop over all in this sfb, 4 lines per loop */
272
991k
            for (w_idx = 0; 4*w_idx < (min(ics->swb_offset[sfb+1], ics->swb_offset_max) - ics->swb_offset[sfb]); w_idx++)
273
598k
            {
274
1.21M
                for(g = 0; g < ics->num_window_groups; g++)
275
620k
                {
276
2.36M
                    for (i = 0; i < ics->num_sec[g]; i++)
277
1.74M
                    {
278
                        /* check whether sfb used here is the one we want to process */
279
1.74M
                        if ((ics->sect_start[g][i] <= sfb) && (ics->sect_end[g][i] > sfb))
280
620k
                        {
281
                            /* check whether codebook used here is the one we want to process */
282
620k
                            this_sec_CB = ics->sect_cb[g][i];
283
284
620k
                            if (is_good_cb(this_CB, this_sec_CB))
285
27.1k
                            {
286
                                /* precalculate some stuff */
287
27.1k
                                uint16_t sect_sfb_size = ics->sect_sfb_offset[g][sfb+1] - ics->sect_sfb_offset[g][sfb];
288
27.1k
                                uint8_t inc = (this_sec_CB < FIRST_PAIR_HCB) ? QUAD_LEN : PAIR_LEN;
289
27.1k
                                uint16_t group_cws_count = (4*ics->window_group_length[g])/inc;
290
27.1k
                                uint8_t segwidth = segmentWidth(this_sec_CB);
291
27.1k
                                uint16_t cws;
292
293
                                /* read codewords until end of sfb or end of window group (shouldn't only 1 trigger?) */
294
140k
                                for (cws = 0; (cws < group_cws_count) && ((cws + w_idx*group_cws_count) < sect_sfb_size); cws++)
295
113k
                                {
296
113k
                                    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
113k
                                    if (!PCWs_done)
300
64.1k
                                    {
301
                                        /* read in normal segments */
302
64.1k
                                        if (bitsread + segwidth <= sp_data_len)
303
63.7k
                                        {
304
63.7k
                                            read_segment(&segment[numberOfSegments], segwidth, ld);
305
63.7k
                                            bitsread += segwidth;
306
307
63.7k
                                            huffman_spectral_data_2(this_sec_CB, &segment[numberOfSegments], &spectral_data[sp]);
308
309
                                            /* keep leftover bits */
310
63.7k
                                            rewrev_bits(&segment[numberOfSegments]);
311
312
63.7k
                                            numberOfSegments++;
313
63.7k
                                        } 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
452
                                            if (bitsread < sp_data_len)
318
354
                                            {
319
354
                                                const uint8_t additional_bits = (uint8_t)(sp_data_len - bitsread);
320
321
354
                                                read_segment(&segment[numberOfSegments], additional_bits, ld);
322
354
                                                segment[numberOfSegments].len += segment[numberOfSegments-1].len;
323
354
                                                if (segment[numberOfSegments].len > 64)
324
33
                                                    return 10;
325
321
                                                rewrev_bits(&segment[numberOfSegments]);
326
327
321
                                                if (segment[numberOfSegments-1].len > 32)
328
72
                                                {
329
72
                                                    segment[numberOfSegments-1].bufb = segment[numberOfSegments].bufb +
330
72
                                                        showbits_hcr(&segment[numberOfSegments-1], segment[numberOfSegments-1].len - 32);
331
72
                                                    segment[numberOfSegments-1].bufa = segment[numberOfSegments].bufa +
332
72
                                                        showbits_hcr(&segment[numberOfSegments-1], 32);
333
249
                                                } else {
334
249
                                                    segment[numberOfSegments-1].bufa = segment[numberOfSegments].bufa +
335
249
                                                        showbits_hcr(&segment[numberOfSegments-1], segment[numberOfSegments-1].len);
336
249
                                                    segment[numberOfSegments-1].bufb = segment[numberOfSegments].bufb;
337
249
                                                }
338
321
                                                segment[numberOfSegments-1].len += additional_bits;
339
321
                                            }
340
419
                                            bitsread = sp_data_len;
341
419
                                            PCWs_done = 1;
342
343
419
                                            fill_in_codeword(codeword, 0, sp, this_sec_CB);
344
419
                                        }
345
64.1k
                                    } else {
346
49.0k
                                        fill_in_codeword(codeword, numberOfCodewords - numberOfSegments, sp, this_sec_CB);
347
49.0k
                                    }
348
113k
                                    numberOfCodewords++;
349
113k
                                }
350
27.1k
                            }
351
620k
                        }
352
1.74M
                    }
353
620k
                 }
354
598k
             }
355
393k
         }
356
47.1k
    }
357
358
2.24k
    if (numberOfSegments == 0)
359
25
        return 10;
360
361
2.22k
    numberOfSets = numberOfCodewords / numberOfSegments;
362
363
    /* step 2: decode nonPCWs */
364
12.6k
    for (set = 1; set <= numberOfSets; set++)
365
10.4k
    {
366
10.4k
        uint16_t trial;
367
368
110k
        for (trial = 0; trial < numberOfSegments; trial++)
369
99.9k
        {
370
99.9k
            uint16_t codewordBase;
371
372
4.64M
            for (codewordBase = 0; codewordBase < numberOfSegments; codewordBase++)
373
4.61M
            {
374
4.61M
                const uint16_t segment_idx = (trial + codewordBase) % numberOfSegments;
375
4.61M
                const uint16_t codeword_idx = codewordBase + set*numberOfSegments - numberOfSegments;
376
377
                /* data up */
378
4.61M
                if (codeword_idx >= numberOfCodewords - numberOfSegments) break;
379
380
4.54M
                if (!codeword[codeword_idx].decoded && segment[segment_idx].len > 0)
381
38.5k
                {
382
38.5k
                    uint8_t tmplen = segment[segment_idx].len + codeword[codeword_idx].bits.len;
383
384
38.5k
                    if (tmplen > 64)
385
384
                    {
386
                      // Drop bits that do not fit concatenation result.
387
384
                      flushbits_hcr(&codeword[codeword_idx].bits, tmplen - 64);
388
384
                    }
389
390
38.5k
                    if (codeword[codeword_idx].bits.len != 0)
391
6.71k
                        concat_bits(&segment[segment_idx], &codeword[codeword_idx].bits);
392
393
38.5k
                    tmplen = segment[segment_idx].len;
394
395
38.5k
                    if (huffman_spectral_data_2(codeword[codeword_idx].cb, &segment[segment_idx],
396
38.5k
                                               &spectral_data[codeword[codeword_idx].sp_offset]) >= 0)
397
30.7k
                    {
398
30.7k
                        codeword[codeword_idx].decoded = 1;
399
30.7k
                    } else
400
7.76k
                    {
401
7.76k
                        codeword[codeword_idx].bits = segment[segment_idx];
402
7.76k
                        codeword[codeword_idx].bits.len = tmplen;
403
7.76k
                    }
404
405
38.5k
                }
406
4.54M
            }
407
99.9k
        }
408
110k
        for (i = 0; i < numberOfSegments; i++)
409
99.9k
            rewrev_bits(&segment[i]);
410
10.4k
    }
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
2.22k
    return 0;
431
432
2.24k
}
433
#endif