Coverage Report

Created: 2026-01-17 06:46

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