Coverage Report

Created: 2026-10-17 06:34

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