Coverage Report

Created: 2026-10-28 07:04

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
217
#define NUM_CB      6
57
770
#define NUM_CB_ER   22
58
#define MAX_CB      32
59
379k
#define VCB11_FIRST 16
60
153k
#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.8k
#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
93.7k
{
89
93.7k
    v = ((v >> S[0]) & B[0]) | ((v << S[0]) & ~B[0]);
90
93.7k
    v = ((v >> S[1]) & B[1]) | ((v << S[1]) & ~B[1]);
91
93.7k
    v = ((v >> S[2]) & B[2]) | ((v << S[2]) & ~B[2]);
92
93.7k
    v = ((v >> S[3]) & B[3]) | ((v << S[3]) & ~B[3]);
93
93.7k
    v = ((v >> S[4]) & B[4]) | ((v << S[4]) & ~B[4]);
94
93.7k
    return v;
95
93.7k
}
96
97
/* bits_t version */
98
static void rewrev_bits(bits_t *bits)
99
132k
{
100
132k
    if (bits->len == 0) return;
101
78.8k
    if (bits->len <= 32) {
102
64.0k
        bits->bufb = 0;
103
64.0k
        bits->bufa = reverse_word(bits->bufa) >> (32 - bits->len);
104
64.0k
    } else {
105
        /* last 32<>32 bit swap via rename */
106
14.8k
        uint32_t lo = reverse_word(bits->bufb);
107
14.8k
        uint32_t hi = reverse_word(bits->bufa);
108
109
14.8k
        if (bits->len == 64) {
110
28
            bits->bufb = hi;
111
28
            bits->bufa = lo;
112
14.8k
        } else {
113
            /* shift off low bits (this is really only one 64 bit shift) */
114
14.8k
            bits->bufb = hi >> (64 - bits->len);
115
14.8k
            bits->bufa = (lo >> (64 - bits->len)) | (hi << (bits->len - 32));
116
14.8k
        }
117
14.8k
    }
118
78.8k
}
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
497
    {
142
        /* (b->len - 32) is 1..31 */
143
        /* maskoff superfluous high b bits */
144
497
        bl = b->bufa;
145
497
        bh = b->bufb & ((1u << (b->len-32)) - 1);
146
        /* left shift a b->len bits */
147
497
        ah = al << (b->len - 32);
148
497
        al = 0;
149
6.69k
    } else if (b->len == 32) {
150
97
        bl = b->bufa;
151
97
        bh = 0;
152
97
        ah = al;
153
97
        al = 0;
154
6.59k
    } else {
155
        /* b->len is 1..31, (32 - b->len) is 1..31 */
156
6.59k
        bl = b->bufa & ((1u << (b->len)) - 1);
157
6.59k
        bh = 0;
158
6.59k
        ah = (ah << (b->len)) | (al >> (32 - b->len));
159
6.59k
        al = al << b->len;
160
6.59k
    }
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
864k
{
171
    /* only want spectral data CB's */
172
864k
    if ((this_sec_CB > ZERO_HCB && this_sec_CB <= ESC_HCB) || (this_sec_CB >= VCB11_FIRST && this_sec_CB <= VCB11_LAST))
173
828k
    {
174
828k
        if (this_CB < ESC_HCB)
175
262k
        {
176
            /* normal codebook pairs */
177
262k
            return ((this_sec_CB == this_CB) || (this_sec_CB == this_CB + 1));
178
262k
        } else
179
565k
        {
180
            /* escape codebook */
181
565k
            return (this_sec_CB == this_CB);
182
565k
        }
183
828k
    }
184
36.3k
    return 0;
185
864k
}
186
187
static void read_segment(bits_t *segment, uint8_t segwidth, bitfile *ld)
188
45.5k
{
189
45.5k
    segment->len = segwidth;
190
191
45.5k
     if (segwidth > 32)
192
9.56k
     {
193
9.56k
        segment->bufb = faad_getbits(ld, segwidth - 32);
194
9.56k
        segment->bufa = faad_getbits(ld, 32);
195
196
35.9k
    } else {
197
35.9k
        segment->bufb = 0;
198
35.9k
        segment->bufa = faad_getbits(ld, segwidth);
199
35.9k
    }
200
45.5k
}
201
202
static void fill_in_codeword(codeword_t *codeword, uint16_t index, uint16_t sp, uint8_t cb)
203
55.8k
{
204
55.8k
    codeword[index].sp_offset = sp;
205
55.8k
    codeword[index].cb = cb;
206
55.8k
    codeword[index].decoded = 0;
207
55.8k
    codeword[index].bits.len = 0;
208
55.8k
}
209
210
uint8_t reordered_spectral_data(NeAACDecStruct *hDecoder, ic_stream *ics,
211
                                bitfile *ld, int16_t *spectral_data)
212
4.15k
{
213
4.15k
    uint16_t PCWs_done;
214
4.15k
    uint16_t numberOfSegments, numberOfSets, numberOfCodewords;
215
216
4.15k
    codeword_t codeword[512];
217
4.15k
    bits_t segment[512];
218
219
4.15k
    uint16_t sp_offset[8];
220
4.15k
    uint16_t g, i, sortloop, set, bitsread;
221
4.15k
    /*uint16_t bitsleft, codewordsleft*/;
222
4.15k
    uint8_t w_idx, sfb, this_CB, last_CB, this_sec_CB;
223
224
4.15k
    const uint16_t nshort = hDecoder->frameLength/8;
225
4.15k
    const uint16_t sp_data_len = ics->length_of_reordered_spectral_data;
226
227
4.15k
    const uint8_t *PreSortCb;
228
229
    /* no data (e.g. silence) */
230
4.15k
    if (sp_data_len == 0)
231
3.14k
        return 0;
232
233
    /* since there is spectral data, at least one codeword has nonzero length */
234
1.00k
    if (ics->length_of_longest_codeword == 0)
235
17
        return 10;
236
237
990
    if (sp_data_len < ics->length_of_longest_codeword)
238
3
        return 10;
239
240
987
    sp_offset[0] = 0;
241
1.34k
    for (g = 1; g < ics->num_window_groups; g++)
242
356
    {
243
356
        sp_offset[g] = sp_offset[g-1] + nshort*ics->window_group_length[g-1];
244
356
    }
245
246
987
    PCWs_done = 0;
247
987
    numberOfSegments = 0;
248
987
    numberOfCodewords = 0;
249
987
    bitsread = 0;
250
251
    /* VCB11 code books in use */
252
987
    if (hDecoder->aacSectionDataResilienceFlag)
253
770
    {
254
770
        PreSortCb = PreSortCB_ER;
255
770
        last_CB = NUM_CB_ER;
256
770
    } else
257
217
    {
258
217
        PreSortCb = PreSortCB_STD;
259
217
        last_CB = NUM_CB;
260
217
    }
261
262
    /* step 1: decode PCW's (set 0), and stuff data in easier-to-use format */
263
18.6k
    for (sortloop = 0; sortloop < last_CB; sortloop++)
264
17.6k
    {
265
        /* select codebook to process this pass */
266
17.6k
        this_CB = PreSortCb[sortloop];
267
268
        /* loop over sfbs */
269
207k
        for (sfb = 0; sfb < ics->max_sfb; sfb++)
270
189k
        {
271
            /* loop over all in this sfb, 4 lines per loop */
272
999k
            for (w_idx = 0; 4*w_idx < (min(ics->swb_offset[sfb+1], ics->swb_offset_max) - ics->swb_offset[sfb]); w_idx++)
273
810k
            {
274
1.67M
                for(g = 0; g < ics->num_window_groups; g++)
275
864k
                {
276
8.25M
                    for (i = 0; i < ics->num_sec[g]; i++)
277
7.39M
                    {
278
                        /* check whether sfb used here is the one we want to process */
279
7.39M
                        if ((ics->sect_start[g][i] <= sfb) && (ics->sect_end[g][i] > sfb))
280
864k
                        {
281
                            /* check whether codebook used here is the one we want to process */
282
864k
                            this_sec_CB = ics->sect_cb[g][i];
283
284
864k
                            if (is_good_cb(this_CB, this_sec_CB))
285
52.8k
                            {
286
                                /* precalculate some stuff */
287
52.8k
                                uint16_t sect_sfb_size = ics->sect_sfb_offset[g][sfb+1] - ics->sect_sfb_offset[g][sfb];
288
52.8k
                                uint8_t inc = (this_sec_CB < FIRST_PAIR_HCB) ? QUAD_LEN : PAIR_LEN;
289
52.8k
                                uint16_t group_cws_count = (4*ics->window_group_length[g])/inc;
290
52.8k
                                uint8_t segwidth = segmentWidth(this_sec_CB);
291
52.8k
                                uint16_t cws;
292
293
                                /* read codewords until end of sfb or end of window group (shouldn't only 1 trigger?) */
294
153k
                                for (cws = 0; (cws < group_cws_count) && ((cws + w_idx*group_cws_count) < sect_sfb_size); cws++)
295
101k
                                {
296
101k
                                    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
101k
                                    if (!PCWs_done)
300
45.7k
                                    {
301
                                        /* read in normal segments */
302
45.7k
                                        if (bitsread + segwidth <= sp_data_len)
303
45.1k
                                        {
304
45.1k
                                            read_segment(&segment[numberOfSegments], segwidth, ld);
305
45.1k
                                            bitsread += segwidth;
306
307
45.1k
                                            huffman_spectral_data_2(this_sec_CB, &segment[numberOfSegments], &spectral_data[sp]);
308
309
                                            /* keep leftover bits */
310
45.1k
                                            rewrev_bits(&segment[numberOfSegments]);
311
312
45.1k
                                            numberOfSegments++;
313
45.1k
                                        } 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
618
                                            if (bitsread < sp_data_len)
318
441
                                            {
319
441
                                                const uint8_t additional_bits = (uint8_t)(sp_data_len - bitsread);
320
321
441
                                                read_segment(&segment[numberOfSegments], additional_bits, ld);
322
441
                                                segment[numberOfSegments].len += segment[numberOfSegments-1].len;
323
441
                                                if (segment[numberOfSegments].len > 64)
324
30
                                                    return 10;
325
411
                                                rewrev_bits(&segment[numberOfSegments]);
326
327
411
                                                if (segment[numberOfSegments-1].len > 32)
328
76
                                                {
329
76
                                                    segment[numberOfSegments-1].bufb = segment[numberOfSegments].bufb +
330
76
                                                        showbits_hcr(&segment[numberOfSegments-1], segment[numberOfSegments-1].len - 32);
331
76
                                                    segment[numberOfSegments-1].bufa = segment[numberOfSegments].bufa +
332
76
                                                        showbits_hcr(&segment[numberOfSegments-1], 32);
333
335
                                                } else {
334
335
                                                    segment[numberOfSegments-1].bufa = segment[numberOfSegments].bufa +
335
335
                                                        showbits_hcr(&segment[numberOfSegments-1], segment[numberOfSegments-1].len);
336
335
                                                    segment[numberOfSegments-1].bufb = segment[numberOfSegments].bufb;
337
335
                                                }
338
411
                                                segment[numberOfSegments-1].len += additional_bits;
339
411
                                            }
340
588
                                            bitsread = sp_data_len;
341
588
                                            PCWs_done = 1;
342
343
588
                                            fill_in_codeword(codeword, 0, sp, this_sec_CB);
344
588
                                        }
345
55.2k
                                    } else {
346
55.2k
                                        fill_in_codeword(codeword, numberOfCodewords - numberOfSegments, sp, this_sec_CB);
347
55.2k
                                    }
348
100k
                                    numberOfCodewords++;
349
100k
                                }
350
52.8k
                            }
351
864k
                        }
352
7.39M
                    }
353
864k
                 }
354
810k
             }
355
189k
         }
356
17.6k
    }
357
358
957
    if (numberOfSegments == 0)
359
35
        return 10;
360
361
922
    numberOfSets = numberOfCodewords / numberOfSegments;
362
363
    /* step 2: decode nonPCWs */
364
6.33k
    for (set = 1; set <= numberOfSets; set++)
365
5.41k
    {
366
5.41k
        uint16_t trial;
367
368
92.3k
        for (trial = 0; trial < numberOfSegments; trial++)
369
86.9k
        {
370
86.9k
            uint16_t codewordBase;
371
372
4.15M
            for (codewordBase = 0; codewordBase < numberOfSegments; codewordBase++)
373
4.10M
            {
374
4.10M
                const uint16_t segment_idx = (trial + codewordBase) % numberOfSegments;
375
4.10M
                const uint16_t codeword_idx = codewordBase + set*numberOfSegments - numberOfSegments;
376
377
                /* data up */
378
4.10M
                if (codeword_idx >= numberOfCodewords - numberOfSegments) break;
379
380
4.06M
                if (!codeword[codeword_idx].decoded && segment[segment_idx].len > 0)
381
37.3k
                {
382
37.3k
                    uint8_t tmplen = segment[segment_idx].len + codeword[codeword_idx].bits.len;
383
384
37.3k
                    if (tmplen > 64)
385
368
                    {
386
                      // Drop bits that do not fit concatenation result.
387
368
                      flushbits_hcr(&codeword[codeword_idx].bits, tmplen - 64);
388
368
                    }
389
390
37.3k
                    if (codeword[codeword_idx].bits.len != 0)
391
7.19k
                        concat_bits(&segment[segment_idx], &codeword[codeword_idx].bits);
392
393
37.3k
                    tmplen = segment[segment_idx].len;
394
395
37.3k
                    if (huffman_spectral_data_2(codeword[codeword_idx].cb, &segment[segment_idx],
396
37.3k
                                               &spectral_data[codeword[codeword_idx].sp_offset]) >= 0)
397
29.8k
                    {
398
29.8k
                        codeword[codeword_idx].decoded = 1;
399
29.8k
                    } else
400
7.49k
                    {
401
7.49k
                        codeword[codeword_idx].bits = segment[segment_idx];
402
7.49k
                        codeword[codeword_idx].bits.len = tmplen;
403
7.49k
                    }
404
405
37.3k
                }
406
4.06M
            }
407
86.9k
        }
408
92.3k
        for (i = 0; i < numberOfSegments; i++)
409
86.9k
            rewrev_bits(&segment[i]);
410
5.41k
    }
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
922
    return 0;
431
432
957
}
433
#endif