summaryrefslogtreecommitdiff
path: root/src
diff options
context:
space:
mode:
Diffstat (limited to 'src')
-rw-r--r--src/libfaad/reordered_spectral_data.c607
-rw-r--r--src/libfaad/rvlc_scale_factors.c339
-rw-r--r--src/libfaad/rvlc_scale_factors.h54
-rw-r--r--src/libfaad/sbr_dec.h38
-rw-r--r--src/libfaad/sbr_huff.h58
-rw-r--r--src/libfaad/sbr_qmf.h41
-rw-r--r--src/libfaad/sbr_syntax.h115
7 files changed, 0 insertions, 1252 deletions
diff --git a/src/libfaad/reordered_spectral_data.c b/src/libfaad/reordered_spectral_data.c
deleted file mode 100644
index 67fe1e050..000000000
--- a/src/libfaad/reordered_spectral_data.c
+++ /dev/null
@@ -1,607 +0,0 @@
-#include <stdlib.h>
-#include <memory.h>
-#include "common.h"
-#include "syntax.h"
-#include "specrec.h"
-#include "bits.h"
-#include "data.h"
-#include "pulse.h"
-#include "analysis.h"
-#include "bits.h"
-#include "codebook/hcb.h"
-
-/* Implements the HCR11 tool as described in ISO/IEC 14496-3/Amd.1, 8.5.3.3 */
-
-#ifdef ERROR_RESILIENCE
-
-/* FIXME these tables are not needed twice actually */
-
-static hcb *hcb_table[] = {
- 0, hcb1_1, hcb2_1, 0, hcb4_1, 0, hcb6_1, 0, hcb8_1, 0, hcb10_1, hcb11_1
-};
-
-static hcb_2_quad *hcb_2_quad_table[] = {
- 0, hcb1_2, hcb2_2, 0, hcb4_2, 0, 0, 0, 0, 0, 0, 0
-};
-
-static hcb_2_pair *hcb_2_pair_table[] = {
- 0, 0, 0, 0, 0, 0, hcb6_2, 0, hcb8_2, 0, hcb10_2, hcb11_2
-};
-
-static hcb_bin_pair *hcb_bin_table[] = {
- 0, 0, 0, 0, 0, hcb5, 0, hcb7, 0, hcb9, 0, 0
-};
-
-static uint8_t hcbN[] = { 0, 5, 5, 0, 5, 0, 5, 0, 5, 0, 6, 5 };
-
-
-/* defines whether a huffman codebook is unsigned or not */
-/* Table 4.6.2 */
-static uint8_t unsigned_cb[] = { 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0,
- /* codebook 16 to 31 */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
-};
-typedef struct
-{
- /* bit input */
- uint32_t bufa;
- uint32_t bufb;
- int16_t len;
-} bits_t;
-
-
-static INLINE uint32_t showbits(bits_t *ld, uint8_t bits) {
-
- if (bits == 0) return 0;
- if (ld->len <= 32){
- /* huffman_spectral_data_2 needs to read more than may be available, bits maybe
- > ld->len, deliver 0 than */
- if (ld->len >= bits)
- return ((ld->bufa >> (ld->len - bits)) & (0xFFFFFFFF >> (32 - bits)));
- else
- return ((ld->bufa << (bits - ld->len)) & (0xFFFFFFFF >> (32 - bits)));
- } else {
- if ((ld->len - bits) < 32) {
-
- return ( (ld->bufb & (0xFFFFFFFF >> (64 - ld->len))) << (bits - ld->len + 32)) |
- (ld->bufa >> (ld->len - bits));
- } else {
- return ((ld->bufb >> (ld->len - bits - 32)) & (0xFFFFFFFF >> (32 - bits)));
- }
- }
-}
-
-/* return 1 if position is outside of buffer, 0 otherwise */
-static INLINE int8_t flushbits( bits_t *ld, uint8_t bits)
-{
- ld->len -= bits;
-
- if (ld->len <0) {
- ld->len = 0;
- return 1;
- } else
- return 0;
-}
-
-
-static INLINE int8_t getbits(bits_t *ld, uint8_t n, uint32_t *result)
-{
- *result = showbits(ld, n);
- return flushbits(ld, n);
-}
-
-static INLINE int8_t get1bit(bits_t *ld, uint8_t *result)
-{
- uint32_t res;
- int8_t ret;
-
- ret = getbits(ld, 1, &res);
- *result = res & 1;
- return ret;
-}
-
-/* Special version of huffman_spectral_data adapted from huffman.h
- Will not read from a bitfile but a bits_t structure.
- Will keep track of the bits decoded and return the number of bits remaining.
- Do not read more than ld->len, return -1 if codeword would be longer */
-
-static int8_t huffman_spectral_data_2(uint8_t cb, bits_t *ld, int16_t *sp )
-{
- uint32_t cw;
- uint16_t offset = 0;
- uint8_t extra_bits;
- uint8_t i;
- uint8_t save_cb = cb;
-
-
- switch (cb)
- {
- case 1: /* 2-step method for data quadruples */
- case 2:
- case 4:
-
- cw = showbits(ld, hcbN[cb]);
- offset = hcb_table[cb][cw].offset;
- extra_bits = hcb_table[cb][cw].extra_bits;
-
- if (extra_bits)
- {
- /* we know for sure it's more than hcbN[cb] bits long */
- if ( flushbits(ld, hcbN[cb]) ) return -1;
- offset += (uint16_t)showbits(ld, extra_bits);
- if ( flushbits(ld, hcb_2_quad_table[cb][offset].bits - hcbN[cb]) ) return -1;
- } else {
- if ( flushbits(ld, hcb_2_quad_table[cb][offset].bits) ) return -1;
- }
-
- sp[0] = hcb_2_quad_table[cb][offset].x;
- sp[1] = hcb_2_quad_table[cb][offset].y;
- sp[2] = hcb_2_quad_table[cb][offset].v;
- sp[3] = hcb_2_quad_table[cb][offset].w;
- break;
-
- case 6: /* 2-step method for data pairs */
- case 8:
- case 10:
- case 11:
- /* VCB11 uses codebook 11 */
- case 16: case 17: case 18: case 19: case 20: case 21: case 22: case 23:
- case 24: case 25: case 26: case 27: case 28: case 29: case 30: case 31:
-
- /* TODO: If ER is used, some extra error checking should be done */
- if (cb >= 16)
- cb = 11;
-
- cw = showbits(ld, hcbN[cb]);
- offset = hcb_table[cb][cw].offset;
- extra_bits = hcb_table[cb][cw].extra_bits;
-
- if (extra_bits)
- {
- /* we know for sure it's more than hcbN[cb] bits long */
- if ( flushbits(ld, hcbN[cb]) ) return -1;
- offset += (uint16_t)showbits(ld, extra_bits);
- if ( flushbits(ld, hcb_2_pair_table[cb][offset].bits - hcbN[cb]) ) return -1;
- } else {
- if ( flushbits(ld, hcb_2_pair_table[cb][offset].bits) ) return -1;
- }
- sp[0] = hcb_2_pair_table[cb][offset].x;
- sp[1] = hcb_2_pair_table[cb][offset].y;
- break;
-
- case 3: /* binary search for data quadruples */
-
- while (!hcb3[offset].is_leaf)
- {
- uint8_t b;
-
- if ( get1bit(ld, &b) ) return -1;
- offset += hcb3[offset].data[b];
- }
-
- sp[0] = hcb3[offset].data[0];
- sp[1] = hcb3[offset].data[1];
- sp[2] = hcb3[offset].data[2];
- sp[3] = hcb3[offset].data[3];
-
- break;
-
- case 5: /* binary search for data pairs */
- case 7:
- case 9:
-
- while (!hcb_bin_table[cb][offset].is_leaf)
- {
- uint8_t b;
-
- if (get1bit(ld, &b) ) return -1;
- offset += hcb_bin_table[cb][offset].data[b];
- }
-
- sp[0] = hcb_bin_table[cb][offset].data[0];
- sp[1] = hcb_bin_table[cb][offset].data[1];
-
- break;
- }
-
- /* decode sign bits */
- if (unsigned_cb[cb]) {
-
- for(i = 0; i < ((cb < FIRST_PAIR_HCB) ? QUAD_LEN : PAIR_LEN); i++)
- {
- if(sp[i])
- {
- uint8_t b;
- if ( get1bit(ld, &b) ) return -1;
- if (b != 0) {
- sp[i] = -sp[i];
- }
- }
- }
- }
-
- /* decode huffman escape bits */
- if ((cb == ESC_HCB) || (cb >= 16))
- {
- uint8_t k;
- for (k=0; k<2; k++){
-
- if ((sp[k] == 16) || (sp[k] == -16)) {
-
- uint8_t neg, i;
- int32_t j, off;
-
- neg = (sp[k] < 0) ? 1 : 0;
-
- for (i = 4; ; i++)
- {
- uint8_t b;
- if ( get1bit(ld, &b) ) return -1;
- if (b == 0)
- {
- break;
- }
- }
-/* TODO: here we would need to test "off" if VCB11 is used! */
- if ( getbits(ld, i, &off) ) return -1;
- j = off + (1<<i);
- sp[k] = neg ? -j : j;
- }
- }
- }
- return ld->len;
-}
-
-/* rewind len (max. 32) bits so that the MSB becomes LSB */
-
-static uint32_t rewind_word( uint32_t W, uint8_t len){
-
- uint8_t i;
- uint32_t tmp_W=0;
-
- for ( i=0; i<len; i++ ) {
- tmp_W<<=1;
- if (W & (1<<i)) tmp_W |= 1;
- }
- return tmp_W;
-}
-
-static void rewind_lword( uint32_t *highW, uint32_t *lowW, uint8_t len){
-
- uint32_t tmp_lW=0;
-
- if (len > 32) {
- tmp_lW = rewind_word( (*highW << (64-len)) | (*lowW >> (len-32)), 32);
- *highW = rewind_word( *lowW << (64-len) , 32);
- *lowW = tmp_lW;
- } else {
- *highW =0;
- *lowW = rewind_word( *lowW, len);
- }
-}
-
-/* Takes a codeword as stored in r, rewinds the remaining bits and stores it back */
-
-static void rewind_bits(bits_t * r){
-
- uint32_t hw, lw;
-
- if (r->len == 0) return;
-
- if (r->len >32) {
- lw = r->bufa;
- hw = r->bufb & (0xFFFFFFFF >> (64 - r->len));
- rewind_lword( &hw, &lw, r->len );
- r->bufa = lw;
- r->bufb = hw;
-
- } else {
- lw = showbits(r, r->len );
- r->bufa = rewind_word( lw, r->len);
- r->bufb = 0;
- }
-}
-
-/* takes codewords from a and b, concatenate them and store them in b */
-
-static void concat_bits( bits_t * a, bits_t * b) {
-
- uint32_t hwa, lwa, hwb, lwb;
-
- if (a->len == 0) return;
-
- if (a->len >32) {
- lwa = a->bufa;
- hwa = a->bufb & (0xFFFFFFFF >> (64 - a->len));
- } else {
- lwa = showbits(a, a->len );
- hwa = 0;
- }
- if (b->len >=32) {
- lwb = b->bufa;
- hwb = (b->bufb & (0xFFFFFFFF >> (64 - b->len)) ) | ( lwa << (b->len - 32));
- } else {
- lwb = showbits(b, b->len ) | (lwa << (b->len));
- hwb = (lwa >> (32 - b->len)) | (hwa << (b->len));
- }
-
- b->bufa = lwb;
- b->bufb = hwb;
- b->len += a->len;
-}
-
-/* 8.5.3.3.1 */
-
-static const uint8_t PresortedCodebook_VCB11[] = { 11, 31, 30, 29, 28, 27, 26, 25, 24, 23, 22, 21, 20, 19, 18, 17, 16, 9, 7, 5, 3, 1};
-static const uint8_t PresortedCodebook[] = { 11, 9, 7, 5, 3, 1};
-
-static const uint8_t maxCwLen[32] = {0, 11, 9, 20, 16, 13, 11, 14, 12, 17, 14, 49,
- 0, 0, 0, 0, 14, 17, 21, 21, 25, 25, 29, 29, 29, 29, 33, 33, 33, 37, 37, 41};
-
-typedef struct {
-
- bits_t bits;
- uint8_t decoded;
- uint16_t sp_offset;
- uint8_t cb;
-} codeword_state;
-
-
-#define segmentWidth( codebook ) min( maxCwLen[codebook], ics->length_of_longest_codeword )
-
-uint8_t reordered_spectral_data(ic_stream *ics, bitfile *ld, int16_t *spectral_data,
- uint16_t frame_len, uint8_t aacSectionDataResilienceFlag)
-{
- uint16_t sp_offset[8];
- uint16_t g,i, presort;
- uint16_t NrCodeWords=0, numberOfSegments=0, BitsRead=0;
- uint8_t numberOfSets, set;
- codeword_state Codewords[ 1024 ]; /* FIXME max length? PCWs are not stored, so index is Codewordnr - numberOfSegments!, maybe malloc()? */
- bits_t Segment[ 512 ];
-
- uint8_t PCW_decoded=0;
- uint16_t segment_index=0, codeword_index=0;
- uint16_t nshort = frame_len/8;
-
-
- memset (spectral_data, 0, frame_len*sizeof(uint16_t));
-
- if (ics->length_of_reordered_spectral_data == 0)
- return 0; /* nothing to do */
-
- /* if we have a corrupted bitstream this can happen... */
- if ((ics->length_of_longest_codeword == 0) ||
- (ics->length_of_reordered_spectral_data <
- ics->length_of_longest_codeword))
- {
- return 10; /* this is not good... */
- }
-
- /* store the offset into the spectral data for all the window groups because we can't do it later */
-
- sp_offset[0] = 0;
- for (g=1; g < ics->num_window_groups; g++) {
- sp_offset[g] = sp_offset[g-1] + nshort*ics->window_group_length[g-1];
- }
-
- /* All data is sorted according to the codebook used */
- for (presort = 0; presort < (aacSectionDataResilienceFlag ? 22 : 6); presort++) {
-
- uint8_t sfb;
- /* next codebook that has to be processed according to presorting */
- uint8_t nextCB = aacSectionDataResilienceFlag ? PresortedCodebook_VCB11[ presort ] : PresortedCodebook[ presort ];
-
- /* Data belonging to the same spectral unit and having the same codebook comes in consecutive codewords.
- This is done by scanning all sfbs for possible codewords. For sfbs with more than 4 elements this has to be
- repeated */
-
- for (sfb=0; sfb<ics->max_sfb; sfb ++) {
-
- uint8_t sect_cb, w;
-
- for (w=0; w< (ics->swb_offset[sfb+1] - ics->swb_offset[sfb]); w+=4){
- for(g = 0; g < ics->num_window_groups; g++)
- {
- for (i = 0; i < ics->num_sec[g]; i++)
- {
-
-
- sect_cb = ics->sect_cb[g][i];
-
- if (
- /* process only sections that are due now */
- (( sect_cb == nextCB ) || (( nextCB < ESC_HCB ) && ( sect_cb == nextCB+1)) ) &&
-
- /* process only sfb's that are due now */
- ((ics->sect_start[g][i] <= sfb) && (ics->sect_end[g][i] > sfb))
- ) {
-
-
- if ((sect_cb != ZERO_HCB) &&
- (sect_cb != NOISE_HCB) &&
- (sect_cb != INTENSITY_HCB) &&
- (sect_cb != INTENSITY_HCB2))
- {
- uint8_t inc = (sect_cb < FIRST_PAIR_HCB) ? QUAD_LEN : PAIR_LEN;
- uint16_t k;
-
- uint32_t hw, lw;
-
-
- for (k=0; (k < (4/inc)*ics->window_group_length[g]) &&
- ( (k+w*ics->window_group_length[g]/inc) < (ics->sect_sfb_offset[g][sfb+1] - ics->sect_sfb_offset[g][sfb])); k++) {
-
- uint16_t sp = sp_offset[g] + ics->sect_sfb_offset[g][sfb] + inc*(k+w*ics->window_group_length[g]/inc);
-
- if (!PCW_decoded) {
-
- /* if we haven't yet read until the end of the buffer, we can directly decode the so-called PCWs */
- if ((BitsRead + segmentWidth( sect_cb ))<= ics->length_of_reordered_spectral_data) {
-
- Segment[ numberOfSegments ].len = segmentWidth( sect_cb );
-
- if (segmentWidth( sect_cb ) > 32) {
- Segment[ numberOfSegments ].bufb = faad_showbits(ld, segmentWidth( sect_cb ) - 32);
- faad_flushbits(ld, segmentWidth( sect_cb) - 32);
- Segment[ numberOfSegments ].bufa = faad_showbits(ld, 32),
- faad_flushbits(ld, 32 );
-
- } else {
- Segment[ numberOfSegments ].bufa = faad_showbits(ld, segmentWidth( sect_cb ));
- Segment[ numberOfSegments ].bufb = 0;
- faad_flushbits(ld, segmentWidth( sect_cb) );
- }
-
- huffman_spectral_data_2(sect_cb, &Segment[ numberOfSegments ], &spectral_data[sp]);
-
- BitsRead += segmentWidth( sect_cb );
-
- /* skip to next segment, but store left bits in new buffer */
- rewind_bits( &Segment[ numberOfSegments ]);
-
- numberOfSegments++;
- } else {
-
- /* the last segment is extended until length_of_reordered_spectral_data */
-
- if (BitsRead < ics->length_of_reordered_spectral_data) {
-
- uint8_t additional_bits = (ics->length_of_reordered_spectral_data - BitsRead);
-
- if ( additional_bits > 32) {
- hw = faad_showbits(ld, additional_bits - 32);
- faad_flushbits(ld, additional_bits - 32);
- lw = faad_showbits(ld, 32);
- faad_flushbits(ld, 32 );
- } else {
- lw = faad_showbits(ld, additional_bits);
- hw = 0;
- faad_flushbits(ld, additional_bits );
- }
- rewind_lword( &hw, &lw, additional_bits + Segment[ numberOfSegments-1 ].len );
- if (Segment[ numberOfSegments-1 ].len > 32) {
-
- Segment[ numberOfSegments-1 ].bufb = hw +
- showbits(&Segment[ numberOfSegments-1 ], Segment[ numberOfSegments-1 ].len - 32);
- Segment[ numberOfSegments-1 ].bufa = lw +
- showbits(&Segment[ numberOfSegments-1 ], 32);
- } else {
- Segment[ numberOfSegments-1 ].bufa = lw +
- showbits(&Segment[ numberOfSegments-1 ], Segment[ numberOfSegments-1 ].len);
- Segment[ numberOfSegments-1 ].bufb = hw;
- }
- Segment[ numberOfSegments-1 ].len += additional_bits;
-
-
- }
- BitsRead = ics->length_of_reordered_spectral_data;
- PCW_decoded = 1;
-
- Codewords[ 0 ].sp_offset = sp;
- Codewords[ 0 ].cb = sect_cb;
- Codewords[ 0 ].decoded = 0;
- Codewords[ 0 ].bits.len = 0;
- }
- } else {
- Codewords[ NrCodeWords - numberOfSegments ].sp_offset = sp;
- Codewords[ NrCodeWords - numberOfSegments ].cb = sect_cb;
- Codewords[ NrCodeWords - numberOfSegments ].decoded = 0;
- Codewords[ NrCodeWords - numberOfSegments ].bits.len = 0;
-
- } /* PCW decoded */
- NrCodeWords++;
- } /* of k */
- }
- }
- } /* of i */
- } /* of g */
- } /* of w */
- } /* of sfb */
- } /* of presort */
-
- numberOfSets = NrCodeWords / numberOfSegments;
-
- /* second step: decode nonPCWs */
-
- for (set = 1; set <= numberOfSets; set++) {
-
- uint16_t trial;
- for (trial = 0; trial < numberOfSegments; trial++) {
-
- uint16_t codewordBase;
- uint16_t codeword_index;
- uint16_t set_decoded=numberOfSegments;
-
- if (set == numberOfSets)
- set_decoded = NrCodeWords - set*numberOfSegments; /* last set is shorter than the rest */
-
- for (codewordBase = 0; codewordBase < numberOfSegments; codewordBase++) {
-
- uint16_t segment_index = (trial + codewordBase) % numberOfSegments;
- uint16_t codeword_index = codewordBase + set*numberOfSegments - numberOfSegments;
-
- if ((codeword_index + numberOfSegments) >= NrCodeWords)
- break;
- if (!Codewords[ codeword_index ].decoded) {
- if ( Segment[ segment_index ].len > 0) {
-
- uint16_t tmplen;
- if (Codewords[ codeword_index ].bits.len != 0) {
- /* on the first trial the data is only stored in Segment[], not in Codewords[].
- On next trials first collect the data stored for this codeword and
- concatenate the new data from Segment[] */
-
- concat_bits( &Codewords[ codeword_index ].bits, &Segment[ segment_index ]);
- /* Now everthing is stored in Segment[] */
- }
- tmplen = Segment[ segment_index ].len;
- if ( huffman_spectral_data_2(Codewords[ codeword_index ].cb, &Segment[ segment_index ],
- &spectral_data[ Codewords[ codeword_index ].sp_offset ]) >=0) {
-
- /* CW did fit into segment */
-
- Codewords[ codeword_index ].decoded = 1;
- set_decoded--;
- } else {
-
- /* CW did not fit, so store for later use */
-
- Codewords[ codeword_index ].bits.len = tmplen;
- Codewords[ codeword_index ].bits.bufa = Segment[ segment_index ].bufa;
- Codewords[ codeword_index ].bits.bufb = Segment[ segment_index ].bufb;
- }
- }
- }
- } /* of codewordBase */
-
- if (set_decoded == 0) break; /* no undecoded codewords left in this set */
-
- } /* of trial */
-
- /* rewind all bits in remaining segments with len>0 */
- for (i=0; i < numberOfSegments; i++)
- rewind_bits( &Segment[ i ] );
- }
-
-#if 0
- {
- int i, r=0, c=0;
- for (i=0; i< numberOfSegments; i++)
- r += Segment[ i ].len;
- if (r != 0) {
-printf("reordered_spectral_data: %d bits remaining!\n", r);
- }
- for (i=0; i< NrCodeWords - numberOfSegments; i++) {
- if (Codewords[ i ].decoded == 0) {
- c++;
- }
- }
- if (c != 0) {
-printf("reordered_spectral_data: %d Undecoded Codewords remaining!\n",c );
- }
- if ((r !=0) || (c!=0)) return 10;
- }
-#endif
-
- return 0;
-}
-#endif
diff --git a/src/libfaad/rvlc_scale_factors.c b/src/libfaad/rvlc_scale_factors.c
deleted file mode 100644
index 4a399c43c..000000000
--- a/src/libfaad/rvlc_scale_factors.c
+++ /dev/null
@@ -1,339 +0,0 @@
-/*
-** FAAD - Freeware Advanced Audio Decoder
-** Copyright (C) 2002 M. Bakker
-**
-** This program is free software; you can redistribute it and/or modify
-** it under the terms of the GNU General Public License as published by
-** the Free Software Foundation; either version 2 of the License, or
-** (at your option) any later version.
-**
-** This program is distributed in the hope that it will be useful,
-** but WITHOUT ANY WARRANTY; without even the implied warranty of
-** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-** GNU General Public License for more details.
-**
-** You should have received a copy of the GNU General Public License
-** along with this program; if not, write to the Free Software
-** Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
-**
-** $Id: rvlc_scale_factors.c,v 1.1 2002/08/09 22:36:36 miguelfreitas Exp $
-**/
-
-#include "common.h"
-#include <stdlib.h>
-#include "syntax.h"
-#include "bits.h"
-#include "rvlc_scale_factors.h"
-
-
-#ifdef ERROR_RESILIENCE
-
-uint8_t rvlc_scale_factor_data(ic_stream *ics, bitfile *ld)
-{
- uint8_t bits = 9;
-
- ics->sf_concealment = faad_get1bit(ld
- DEBUGVAR(1,149,"rvlc_scale_factor_data(): sf_concealment"));
- ics->rev_global_gain = faad_getbits(ld, 8
- DEBUGVAR(1,150,"rvlc_scale_factor_data(): rev_global_gain"));
-
- if (ics->window_sequence == EIGHT_SHORT_SEQUENCE)
- bits = 11;
-
- /* the number of bits used for the huffman codewords */
- ics->length_of_rvlc_sf = faad_getbits(ld, bits
- DEBUGVAR(1,151,"rvlc_scale_factor_data(): length_of_rvlc_sf"));
-
- if (ics->noise_used)
- {
- ics->dpcm_noise_nrg = faad_getbits(ld, 9
- DEBUGVAR(1,152,"rvlc_scale_factor_data(): dpcm_noise_nrg"));
-
- ics->length_of_rvlc_sf -= 9;
- }
-
- ics->sf_escapes_present = faad_get1bit(ld
- DEBUGVAR(1,153,"rvlc_scale_factor_data(): sf_escapes_present"));
-
- if (ics->sf_escapes_present)
- {
- ics->length_of_rvlc_escapes = faad_getbits(ld, 8
- DEBUGVAR(1,154,"rvlc_scale_factor_data(): length_of_rvlc_escapes"));
- }
-
- if (ics->noise_used)
- {
- ics->dpcm_noise_last_position = faad_getbits(ld, 9
- DEBUGVAR(1,155,"rvlc_scale_factor_data(): dpcm_noise_last_position"));
- }
-
- return 0;
-}
-
-uint8_t rvlc_decode_scale_factors(ic_stream *ics, bitfile *ld)
-{
- uint8_t result;
- uint8_t *rvlc_sf_buffer = NULL;
- uint8_t *rvlc_esc_buffer = NULL;
- bitfile ld_rvlc_sf;
- bitfile ld_rvlc_esc;
-
- if (ics->length_of_rvlc_sf > 0)
- {
- /* We read length_of_rvlc_sf bits here to put it in a
- seperate bitfile.
- */
- rvlc_sf_buffer = faad_getbitbuffer(ld, ics->length_of_rvlc_sf
- DEBUGVAR(1,156,"rvlc_decode_scale_factors(): bitbuffer: length_of_rvlc_sf"));
-
- faad_initbits(&ld_rvlc_sf, (void*)rvlc_sf_buffer);
- }
-
- if (ics->sf_escapes_present)
- {
- /* We read length_of_rvlc_escapes bits here to put it in a
- seperate bitfile.
- */
- rvlc_esc_buffer = faad_getbitbuffer(ld, ics->length_of_rvlc_escapes
- DEBUGVAR(1,157,"rvlc_decode_scale_factors(): bitbuffer: length_of_rvlc_escapes"));
-
- faad_initbits(&ld_rvlc_esc, (void*)rvlc_esc_buffer);
- }
-
- /* decode the rvlc scale factors and escapes */
- result = rvlc_decode_sf_forward(ics, &ld_rvlc_sf, &ld_rvlc_esc);
-
-
- if (rvlc_esc_buffer) free(rvlc_esc_buffer);
- if (rvlc_sf_buffer) free(rvlc_sf_buffer);
-
- return result;
-}
-
-static uint8_t rvlc_decode_sf_forward(ic_stream *ics, bitfile *ld_sf, bitfile *ld_esc)
-{
- uint8_t g, sfb;
- int8_t t = 0;
- int8_t error = 0;
- int8_t noise_pcm_flag = 1;
-
- int16_t scale_factor = ics->global_gain;
- int16_t is_position = 0;
- int16_t noise_energy = ics->global_gain - 90;
-
- for (g = 0; g < ics->num_window_groups; g++)
- {
- for (sfb = 0; sfb < ics->max_sfb; sfb++)
- {
- if (error)
- {
- ics->scale_factors[g][sfb] = 0;
- } else {
- switch (ics->sfb_cb[g][sfb])
- {
- case ZERO_HCB: /* zero book */
- ics->scale_factors[g][sfb] = 0;
- break;
- case INTENSITY_HCB: /* intensity books */
- case INTENSITY_HCB2:
-
- /* decode intensity position */
- t = rvlc_huffman_sf(ld_sf, ld_esc);
-
- is_position += t;
- ics->scale_factors[g][sfb] = is_position;
-
- break;
- case NOISE_HCB: /* noise books */
-
- /* decode noise energy */
- if (noise_pcm_flag)
- {
- int8_t n = ics->dpcm_noise_nrg;
- noise_pcm_flag = 0;
- noise_energy += n;
- } else {
- t = rvlc_huffman_sf(ld_sf, ld_esc);
- noise_energy += t;
- }
-
- ics->scale_factors[g][sfb] = noise_energy;
-
- break;
- case BOOKSCL: /* invalid books */
- return 3;
- default: /* spectral books */
-
- /* decode scale factor */
- t = rvlc_huffman_sf(ld_sf, ld_esc);
-
- scale_factor += t;
- if (scale_factor < 0)
- return 4;
-
- ics->scale_factors[g][sfb] = scale_factor;
-
- break;
- }
- if (t == 99)
- {
- error = 1;
- }
- }
- }
- }
-
- return 0;
-}
-
-/* index == 99 means not allowed codeword */
-static rvlc_huff_table book_rvlc[] = {
- /*index length codeword */
- { 0, 1, 0 }, /* 0 */
- { -1, 3, 5 }, /* 101 */
- { 1, 3, 7 }, /* 111 */
- { -2, 4, 9 }, /* 1001 */
- { -3, 5, 17 }, /* 10001 */
- { 2, 5, 27 }, /* 11011 */
- { -4, 6, 33 }, /* 100001 */
- { 99, 6, 50 }, /* 110010 */
- { 3, 6, 51 }, /* 110011 */
- { 99, 6, 52 }, /* 110100 */
- { -7, 7, 65 }, /* 1000001 */
- { 99, 7, 96 }, /* 1100000 */
- { 99, 7, 98 }, /* 1100010 */
- { 7, 7, 99 }, /* 1100011 */
- { 4, 7, 107 }, /* 1101011 */
- { -5, 8, 129 }, /* 10000001 */
- { 99, 8, 194 }, /* 11000010 */
- { 5, 8, 195 }, /* 11000011 */
- { 99, 8, 212 }, /* 11010100 */
- { 99, 9, 256 }, /* 100000000 */
- { -6, 9, 257 }, /* 100000001 */
- { 99, 9, 426 }, /* 110101010 */
- { 6, 9, 427 }, /* 110101011 */
- { 99, 10, 0 } /* Shouldn't come this far */
-};
-
-static rvlc_huff_table book_escape[] = {
- /*index length codeword */
- { 1, 2, 0 },
- { 0, 2, 2 },
- { 3, 3, 2 },
- { 2, 3, 6 },
- { 4, 4, 14 },
- { 7, 5, 13 },
- { 6, 5, 15 },
- { 5, 5, 31 },
- { 11, 6, 24 },
- { 10, 6, 25 },
- { 9, 6, 29 },
- { 8, 6, 61 },
- { 13, 7, 56 },
- { 12, 7, 120 },
- { 15, 8, 114 },
- { 14, 8, 242 },
- { 17, 9, 230 },
- { 16, 9, 486 },
- { 19, 10, 463 },
- { 18, 10, 974 },
- { 22, 11, 925 },
- { 20, 11, 1950 },
- { 21, 11, 1951 },
- { 23, 12, 1848 },
- { 25, 13, 3698 },
- { 24, 14, 7399 },
- { 26, 15, 14797 },
- { 49, 19, 236736 },
- { 50, 19, 236737 },
- { 51, 19, 236738 },
- { 52, 19, 236739 },
- { 53, 19, 236740 },
- { 27, 20, 473482 },
- { 28, 20, 473483 },
- { 29, 20, 473484 },
- { 30, 20, 473485 },
- { 31, 20, 473486 },
- { 32, 20, 473487 },
- { 33, 20, 473488 },
- { 34, 20, 473489 },
- { 35, 20, 473490 },
- { 36, 20, 473491 },
- { 37, 20, 473492 },
- { 38, 20, 473493 },
- { 39, 20, 473494 },
- { 40, 20, 473495 },
- { 41, 20, 473496 },
- { 42, 20, 473497 },
- { 43, 20, 473498 },
- { 44, 20, 473499 },
- { 45, 20, 473500 },
- { 46, 20, 473501 },
- { 47, 20, 473502 },
- { 48, 20, 473503 },
- { 99, 21, 0 } /* Shouldn't come this far */
-};
-
-static int8_t rvlc_huffman_sf(bitfile *ld_sf, bitfile *ld_esc)
-{
- uint8_t i, j;
- int8_t index;
- uint32_t cw;
- rvlc_huff_table *h = book_rvlc;
-
- i = h->len;
- cw = faad_getbits(ld_sf, i);
-
- while ((cw != h->cw)
- && (i < 10))
- {
- h++;
- j = h->len-i;
- i += j;
- cw <<= j;
- cw |= faad_getbits(ld_sf, j);
- }
-
- index = h->index;
-
- if (index == +ESC_VAL)
- {
- int8_t esc = rvlc_huffman_esc(ld_esc);
- if (esc == 99)
- return 99;
- index += esc;
- }
- if (index == -ESC_VAL)
- {
- int8_t esc = rvlc_huffman_esc(ld_esc);
- if (esc == 99)
- return 99;
- index -= esc;
- }
-
- return index;
-}
-
-static int8_t rvlc_huffman_esc(bitfile *ld)
-{
- uint8_t i, j;
- uint32_t cw;
- rvlc_huff_table *h = book_escape;
-
- i = h->len;
- cw = faad_getbits(ld, i);
-
- while ((cw != h->cw)
- && (i < 21))
- {
- h++;
- j = h->len-i;
- i += j;
- cw <<= j;
- cw |= faad_getbits(ld, j);
- }
-
- return h->index;
-}
-
-#endif \ No newline at end of file
diff --git a/src/libfaad/rvlc_scale_factors.h b/src/libfaad/rvlc_scale_factors.h
deleted file mode 100644
index 44164dcc3..000000000
--- a/src/libfaad/rvlc_scale_factors.h
+++ /dev/null
@@ -1,54 +0,0 @@
-/*
-** FAAD - Freeware Advanced Audio Decoder
-** Copyright (C) 2002 M. Bakker
-**
-** This program is free software; you can redistribute it and/or modify
-** it under the terms of the GNU General Public License as published by
-** the Free Software Foundation; either version 2 of the License, or
-** (at your option) any later version.
-**
-** This program is distributed in the hope that it will be useful,
-** but WITHOUT ANY WARRANTY; without even the implied warranty of
-** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-** GNU General Public License for more details.
-**
-** You should have received a copy of the GNU General Public License
-** along with this program; if not, write to the Free Software
-** Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
-**
-** $Id: rvlc_scale_factors.h,v 1.1 2002/08/09 22:36:36 miguelfreitas Exp $
-**/
-
-#ifndef __RVLC_SCF_H__
-#define __RVLC_SCF_H__
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-typedef struct
-{
- int8_t index;
- uint8_t len;
- uint32_t cw;
-} rvlc_huff_table;
-
-
-#define ESC_VAL 7
-
-
-uint8_t rvlc_scale_factor_data(ic_stream *ics, bitfile *ld);
-uint8_t rvlc_decode_scale_factors(ic_stream *ics, bitfile *ld);
-
-static uint8_t rvlc_decode_sf_forward(ic_stream *ics,
- bitfile *ld_sf,
- bitfile *ld_esc);
-static int8_t rvlc_huffman_sf(bitfile *ld_sf,
- bitfile *ld_esc);
-static int8_t rvlc_huffman_esc(bitfile *ld_esc);
-
-
-#ifdef __cplusplus
-}
-#endif
-#endif
diff --git a/src/libfaad/sbr_dec.h b/src/libfaad/sbr_dec.h
deleted file mode 100644
index c08ae3578..000000000
--- a/src/libfaad/sbr_dec.h
+++ /dev/null
@@ -1,38 +0,0 @@
-/*
-** FAAD - Freeware Advanced Audio Decoder
-** Copyright (C) 2002 M. Bakker
-**
-** This program is free software; you can redistribute it and/or modify
-** it under the terms of the GNU General Public License as published by
-** the Free Software Foundation; either version 2 of the License, or
-** (at your option) any later version.
-**
-** This program is distributed in the hope that it will be useful,
-** but WITHOUT ANY WARRANTY; without even the implied warranty of
-** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-** GNU General Public License for more details.
-**
-** You should have received a copy of the GNU General Public License
-** along with this program; if not, write to the Free Software
-** Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
-**
-** $Id: sbr_dec.h,v 1.1 2002/07/14 23:43:01 miguelfreitas Exp $
-**/
-
-#ifdef SBR
-
-#ifndef __SBR_DEC_H__
-#define __SBR_DEC_H__
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-
-
-#ifdef __cplusplus
-}
-#endif
-#endif
-
-#endif /* SBR */ \ No newline at end of file
diff --git a/src/libfaad/sbr_huff.h b/src/libfaad/sbr_huff.h
deleted file mode 100644
index c4eb468e7..000000000
--- a/src/libfaad/sbr_huff.h
+++ /dev/null
@@ -1,58 +0,0 @@
-/*
-** FAAD - Freeware Advanced Audio Decoder
-** Copyright (C) 2002 M. Bakker
-**
-** This program is free software; you can redistribute it and/or modify
-** it under the terms of the GNU General Public License as published by
-** the Free Software Foundation; either version 2 of the License, or
-** (at your option) any later version.
-**
-** This program is distributed in the hope that it will be useful,
-** but WITHOUT ANY WARRANTY; without even the implied warranty of
-** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-** GNU General Public License for more details.
-**
-** You should have received a copy of the GNU General Public License
-** along with this program; if not, write to the Free Software
-** Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
-**
-** $Id: sbr_huff.h,v 1.1 2002/07/14 23:43:01 miguelfreitas Exp $
-**/
-
-#ifdef SBR
-
-#ifndef __SBR_HUFF_H__
-#define __SBR_HUFF_H__
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-typedef struct
-{
- uint32_t codeword;
- uint16_t index;
-} sbr_huff_tab;
-
-
-uint16_t sbr_huff_dec(bitfile *ld, sbr_huff_tab *t_huff);
-
-sbr_huff_tab t_huffman_env_1_5dB[];
-sbr_huff_tab f_huffman_env_1_5dB[];
-sbr_huff_tab t_huffman_env_bal_1_5dB[];
-sbr_huff_tab f_huffman_env_bal_1_5dB[];
-sbr_huff_tab t_huffman_env_3_0dB[];
-sbr_huff_tab f_huffman_env_3_0dB[];
-sbr_huff_tab t_huffman_env_bal_3_0dB[];
-sbr_huff_tab f_huffman_env_bal_3_0dB[];
-sbr_huff_tab t_huffman_noise_3_0dB[];
-sbr_huff_tab *f_huffman_noise_3_0dB;
-sbr_huff_tab t_huffman_noise_bal_3_0dB[];
-sbr_huff_tab *f_huffman_noise_bal_3_0dB;
-
-#ifdef __cplusplus
-}
-#endif
-#endif
-
-#endif /* SBR */ \ No newline at end of file
diff --git a/src/libfaad/sbr_qmf.h b/src/libfaad/sbr_qmf.h
deleted file mode 100644
index 4f4c5150a..000000000
--- a/src/libfaad/sbr_qmf.h
+++ /dev/null
@@ -1,41 +0,0 @@
-/*
-** FAAD - Freeware Advanced Audio Decoder
-** Copyright (C) 2002 M. Bakker
-**
-** This program is free software; you can redistribute it and/or modify
-** it under the terms of the GNU General Public License as published by
-** the Free Software Foundation; either version 2 of the License, or
-** (at your option) any later version.
-**
-** This program is distributed in the hope that it will be useful,
-** but WITHOUT ANY WARRANTY; without even the implied warranty of
-** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-** GNU General Public License for more details.
-**
-** You should have received a copy of the GNU General Public License
-** along with this program; if not, write to the Free Software
-** Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
-**
-** $Id: sbr_qmf.h,v 1.1 2002/07/14 23:43:01 miguelfreitas Exp $
-**/
-
-#ifdef SBR
-
-#ifndef __SBR_QMF_H__
-#define __SBR_QMF_H__
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-static real_t qmf_c[];
-
-void sbr_qmf_analysis(real_t *input, complex_t **Xlow);
-void sbr_qmf_synthesis(complex_t **Xlow, real_t *output);
-
-#ifdef __cplusplus
-}
-#endif
-#endif
-
-#endif /* SBR */ \ No newline at end of file
diff --git a/src/libfaad/sbr_syntax.h b/src/libfaad/sbr_syntax.h
deleted file mode 100644
index 5d094d7d1..000000000
--- a/src/libfaad/sbr_syntax.h
+++ /dev/null
@@ -1,115 +0,0 @@
-/*
-** FAAD - Freeware Advanced Audio Decoder
-** Copyright (C) 2002 M. Bakker
-**
-** This program is free software; you can redistribute it and/or modify
-** it under the terms of the GNU General Public License as published by
-** the Free Software Foundation; either version 2 of the License, or
-** (at your option) any later version.
-**
-** This program is distributed in the hope that it will be useful,
-** but WITHOUT ANY WARRANTY; without even the implied warranty of
-** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-** GNU General Public License for more details.
-**
-** You should have received a copy of the GNU General Public License
-** along with this program; if not, write to the Free Software
-** Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
-**
-** $Id: sbr_syntax.h,v 1.1 2002/07/14 23:43:01 miguelfreitas Exp $
-**/
-
-#ifdef SBR
-
-#ifndef __SBR_SYNTAX_H__
-#define __SBR_SYNTAX_H__
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-#include "bits.h"
-
-
-#define SBR_STD 12
-#define SBR_HDR 13
-
-#define FIXFIX 0
-#define FIXVAR 1
-#define VARFIX 2
-#define VARVAR 3
-
-#define NO_TIME_SLOTS 16
-
-typedef struct
-{
- /* really used */
- uint8_t abs_bord_lead[2];
- uint8_t abs_bord_trail[2];
-
-
- /* to get it compiling */
- /* we'll see during the coding of all the tools, whether
- these are all used or not.
- */
- uint8_t bs_crc_flag;
- uint8_t bs_sbr_crc_bits;
- uint8_t bs_protocol_version;
- uint8_t bs_amp_res;
- uint8_t bs_start_freq;
- uint8_t bs_stop_freq;
- uint8_t bs_xover_band;
- uint8_t bs_freq_scale;
- uint8_t bs_alter_scale;
- uint8_t bs_noise_bands;
- uint8_t bs_limiter_bands;
- uint8_t bs_limiter_gains;
- uint8_t bs_interpol_freq;
- uint8_t bs_smoothing_mode;
- uint8_t bs_samplerate_mode;
- uint8_t bs_add_harmonic_flag[2];
- uint8_t bs_extended_data[2];
- uint8_t bs_extension_id;
- uint8_t bs_coupling;
- uint8_t bs_frame_class;
- uint8_t bs_num_env[2];
- uint8_t bs_freq_res[2][6];
- uint8_t bs_rel_bord[2][9];
- uint8_t bs_rel_bord_0[2][9];
- uint8_t bs_rel_bord_1[2][9];
- uint8_t bs_pointer[2];
- uint8_t bs_abs_bord_0[2];
- uint8_t bs_abs_bord_1[2];
- uint8_t bs_num_rel_0[2];
- uint8_t bs_num_rel_1[2];
- uint8_t bs_num_noise[2];
- uint8_t bs_df_env[2][9];
- uint8_t bs_df_noise[2][3];
- uint8_t num_noise_bands[2];
- uint8_t bs_invf_mode_vec[2][/*??*/10];
- uint8_t num_high_res[2];
- uint8_t bs_add_harmonic[2][/*??*/10];
- uint16_t bs_data_env[2][/*??*/10][/*??*/10];
- uint16_t bs_data_noise[2][/*??*/10][/*??*/10];
- uint8_t num_env_bands[2];
-} sbr_info;
-
-uint8_t sbr_bitstream(bitfile *ld, sbr_info *sbr, uint8_t id_aac,
- uint8_t bs_extension_type);
-static void sbr_header(bitfile *ld, sbr_info *sbr, uint8_t id_aac);
-static void sbr_data(bitfile *ld, sbr_info *sbr, uint8_t id_aac);
-static void sbr_single_channel_element(bitfile *ld, sbr_info *sbr);
-static void sbr_channel_pair_element(bitfile *ld, sbr_info *sbr);
-static void sbr_grid(bitfile *ld, sbr_info *sbr, uint8_t ch);
-static void sbr_dtdf(bitfile *ld, sbr_info *sbr, uint8_t ch);
-static void invf_mode(bitfile *ld, sbr_info *sbr, uint8_t ch);
-static void sbr_envelope(bitfile *ld, sbr_info *sbr, uint8_t ch);
-static void sbr_noise(bitfile *ld, sbr_info *sbr, uint8_t ch);
-static void sinusoidal_coding(bitfile *ld, sbr_info *sbr, uint8_t ch);
-
-#ifdef __cplusplus
-}
-#endif
-#endif /* __SBR_SYNTAX_H__ */
-
-#endif /* SBR */ \ No newline at end of file
generated by cgit v1.2.3 (git 2.25.1) at 2025-04-22 11:38:54 +0000