Coverage Report

Created: 2026-02-14 07:13

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