mirror of
https://github.com/mpv-player/mpv
synced 2024-12-11 09:25:56 +00:00
73829e43ab
git-svn-id: svn://svn.mplayerhq.hu/mplayer/trunk@12626 b3059339-0415-0410-9bf9-f77b7e298cf2
186 lines
5.9 KiB
C
186 lines
5.9 KiB
C
/*
|
|
** FAAD2 - Freeware Advanced Audio (AAC) Decoder including SBR decoding
|
|
** Copyright (C) 2003 M. Bakker, Ahead Software AG, http://www.nero.com
|
|
**
|
|
** 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.
|
|
**
|
|
** Any non-GPL usage of this software or parts of this software is strictly
|
|
** forbidden.
|
|
**
|
|
** Commercial non-GPL licensing of this software is possible.
|
|
** For more info contact Ahead Software through Mpeg4AAClicense@nero.com.
|
|
**
|
|
** Initially modified for use with MPlayer by Arpad Gereöffy on 2003/08/30
|
|
** $Id: hcb_1.h,v 1.1 2003/08/30 22:30:28 arpi Exp $
|
|
** detailed CVS changelog at http://www.mplayerhq.hu/cgi-bin/cvsweb.cgi/main/
|
|
**/
|
|
|
|
/* 2-step huffman table HCB_1 */
|
|
|
|
|
|
/* 1st step: 5 bits
|
|
* 2^5 = 32 entries
|
|
*
|
|
* Used to find offset into 2nd step table and number of extra bits to get
|
|
*/
|
|
static hcb hcb1_1[] = {
|
|
{ /* 00000 */ 0, 0 },
|
|
{ /* */ 0, 0 },
|
|
{ /* */ 0, 0 },
|
|
{ /* */ 0, 0 },
|
|
{ /* */ 0, 0 },
|
|
{ /* */ 0, 0 },
|
|
{ /* */ 0, 0 },
|
|
{ /* */ 0, 0 },
|
|
{ /* */ 0, 0 },
|
|
{ /* */ 0, 0 },
|
|
{ /* */ 0, 0 },
|
|
{ /* */ 0, 0 },
|
|
{ /* */ 0, 0 },
|
|
{ /* */ 0, 0 },
|
|
{ /* */ 0, 0 },
|
|
{ /* */ 0, 0 },
|
|
{ /* 10000 */ 1, 0 },
|
|
{ /* 10001 */ 2, 0 },
|
|
{ /* 10010 */ 3, 0 },
|
|
{ /* 10011 */ 4, 0 },
|
|
{ /* 10100 */ 5, 0 },
|
|
{ /* 10101 */ 6, 0 },
|
|
{ /* 10110 */ 7, 0 },
|
|
{ /* 10111 */ 8, 0 },
|
|
|
|
/* 7 bit codewords */
|
|
{ /* 11000 */ 9, 2 },
|
|
{ /* 11001 */ 13, 2 },
|
|
{ /* 11010 */ 17, 2 },
|
|
{ /* 11011 */ 21, 2 },
|
|
{ /* 11100 */ 25, 2 },
|
|
{ /* 11101 */ 29, 2 },
|
|
|
|
/* 9 bit codewords */
|
|
{ /* 11110 */ 33, 4 },
|
|
|
|
/* 9/10/11 bit codewords */
|
|
{ /* 11111 */ 49, 6 }
|
|
};
|
|
|
|
/* 2nd step table
|
|
*
|
|
* Gives size of codeword and actual data (x,y,v,w)
|
|
*/
|
|
static hcb_2_quad hcb1_2[] = {
|
|
/* 1 bit codeword */
|
|
{ 1, 0, 0, 0, 0 },
|
|
|
|
/* 5 bit codewords */
|
|
{ 5, 1, 0, 0, 0 },
|
|
{ 5, -1, 0, 0, 0 },
|
|
{ 5, 0, 0, 0, -1 },
|
|
{ 5, 0, 1, 0, 0 },
|
|
{ 5, 0, 0, 0, 1 },
|
|
{ 5, 0, 0, -1, 0 },
|
|
{ 5, 0, 0, 1, 0 },
|
|
{ 5, 0, -1, 0, 0 },
|
|
|
|
/* 7 bit codewords */
|
|
/* first 5 bits: 11000 */
|
|
{ 7, 1, -1, 0, 0 },
|
|
{ 7, -1, 1, 0, 0 },
|
|
{ 7, 0, 0, -1, 1 },
|
|
{ 7, 0, 1, -1, 0 },
|
|
/* first 5 bits: 11001 */
|
|
{ 7, 0, -1, 1, 0 },
|
|
{ 7, 0, 0, 1, -1 },
|
|
{ 7, 1, 1, 0, 0 },
|
|
{ 7, 0, 0, -1, -1 },
|
|
/* first 5 bits: 11010 */
|
|
{ 7, -1, -1, 0, 0 },
|
|
{ 7, 0, -1, -1, 0 },
|
|
{ 7, 1, 0, -1, 0 },
|
|
{ 7, 0, 1, 0, -1 },
|
|
/* first 5 bits: 11011 */
|
|
{ 7, -1, 0, 1, 0 },
|
|
{ 7, 0, 0, 1, 1 },
|
|
{ 7, 1, 0, 1, 0 },
|
|
{ 7, 0, -1, 0, 1 },
|
|
/* first 5 bits: 11100 */
|
|
{ 7, 0, 1, 1, 0 },
|
|
{ 7, 0, 1, 0, 1 },
|
|
{ 7, -1, 0, -1, 0 },
|
|
{ 7, 1, 0, 0, 1 },
|
|
/* first 5 bits: 11101 */
|
|
{ 7, -1, 0, 0, -1 },
|
|
{ 7, 1, 0, 0, -1 },
|
|
{ 7, -1, 0, 0, 1 },
|
|
{ 7, 0, -1, 0, -1 },
|
|
|
|
/* 9 bit codeword */
|
|
/* first 5 bits: 11110 */
|
|
{ 9, 1, 1, -1, 0 },
|
|
{ 9, -1, 1, -1, 0 },
|
|
{ 9, 1, -1, 1, 0 },
|
|
{ 9, 0, 1, 1, -1 },
|
|
{ 9, 0, 1, -1, 1 },
|
|
{ 9, 0, -1, 1, 1 },
|
|
{ 9, 0, -1, 1, -1 },
|
|
{ 9, 1, -1, -1, 0 },
|
|
{ 9, 1, 0, -1, 1 },
|
|
{ 9, 0, 1, -1, -1 },
|
|
{ 9, -1, 1, 1, 0 },
|
|
{ 9, -1, 0, 1, -1 },
|
|
{ 9, -1, -1, 1, 0 },
|
|
{ 9, 0, -1, -1, 1 },
|
|
{ 9, 1, -1, 0, 1 },
|
|
{ 9, 1, -1, 0, -1 },
|
|
|
|
/* 9/10/11 bit codewords */
|
|
/* first 5 bits: 11111 */
|
|
/* 9 bit: reading 11 bits -> 2 too much so 4 entries for each codeword */
|
|
{ 9, -1, 1, 0, -1 }, { 9, -1, 1, 0, -1 }, { 9, -1, 1, 0, -1 }, { 9, -1, 1, 0, -1 },
|
|
{ 9, -1, -1, -1, 0 }, { 9, -1, -1, -1, 0 }, { 9, -1, -1, -1, 0 }, { 9, -1, -1, -1, 0 },
|
|
{ 9, 0, -1, -1, -1 }, { 9, 0, -1, -1, -1 }, { 9, 0, -1, -1, -1 }, { 9, 0, -1, -1, -1 },
|
|
{ 9, 0, 1, 1, 1 }, { 9, 0, 1, 1, 1 }, { 9, 0, 1, 1, 1 }, { 9, 0, 1, 1, 1 },
|
|
{ 9, 1, 0, 1, -1 }, { 9, 1, 0, 1, -1 }, { 9, 1, 0, 1, -1 }, { 9, 1, 0, 1, -1 },
|
|
{ 9, 1, 1, 0, 1 }, { 9, 1, 1, 0, 1 }, { 9, 1, 1, 0, 1 }, { 9, 1, 1, 0, 1 },
|
|
{ 9, -1, 1, 0, 1 }, { 9, -1, 1, 0, 1 }, { 9, -1, 1, 0, 1 }, { 9, -1, 1, 0, 1 },
|
|
{ 9, 1, 1, 1, 0 }, { 9, 1, 1, 1, 0 }, { 9, 1, 1, 1, 0 }, { 9, 1, 1, 1, 0 },
|
|
/* 10 bit: reading 11 bits -> 1 too much so 2 entries for each codeword */
|
|
{ 10, -1, -1, 0, 1 }, { 10, -1, -1, 0, 1 },
|
|
{ 10, -1, 0, -1, -1 }, { 10, -1, 0, -1, -1 },
|
|
{ 10, 1, 1, 0, -1 }, { 10, 1, 1, 0, -1 },
|
|
{ 10, 1, 0, -1, -1 }, { 10, 1, 0, -1, -1 },
|
|
{ 10, -1, 0, -1, 1 }, { 10, -1, 0, -1, 1 },
|
|
{ 10, -1, -1, 0, -1 }, { 10, -1, -1, 0, -1 },
|
|
{ 10, -1, 0, 1, 1 }, { 10, -1, 0, 1, 1 },
|
|
{ 10, 1, 0, 1, 1 }, { 10, 1, 0, 1, 1 },
|
|
/* 11 bit */
|
|
{ 11, 1, -1, 1, -1 },
|
|
{ 11, -1, 1, -1, 1 },
|
|
{ 11, -1, 1, 1, -1 },
|
|
{ 11, 1, -1, -1, 1 },
|
|
{ 11, 1, 1, 1, 1 },
|
|
{ 11, -1, -1, 1, 1 },
|
|
{ 11, 1, 1, -1, -1 },
|
|
{ 11, -1, -1, 1, -1 },
|
|
{ 11, -1, -1, -1, -1 },
|
|
{ 11, 1, 1, -1, 1 },
|
|
{ 11, 1, -1, 1, 1 },
|
|
{ 11, -1, 1, 1, 1 },
|
|
{ 11, -1, 1, -1, -1 },
|
|
{ 11, -1, -1, -1, 1 },
|
|
{ 11, 1, -1, -1, -1 },
|
|
{ 11, 1, 1, 1, -1 }
|
|
};
|