From: yeom <yeom>
Date: Tue, 26 Apr 2011 00:44:47 +0000 (+0000)
Subject: add another test case for ssjava:
X-Git-Url: http://demsky.eecs.uci.edu/git/?a=commitdiff_plain;h=0ebe658af9d2a322352e9529a5ed091584c58a91;p=IRC.git
add another test case for ssjava:
trying to put annotations on mp3 decoder source codes using the current ssjava scheme.
---
diff --git a/Robust/src/Tests/ssJava/mp3decoder/BitReserve.java b/Robust/src/Tests/ssJava/mp3decoder/BitReserve.java
new file mode 100644
index 00000000..9b6da48e
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/BitReserve.java
@@ -0,0 +1,223 @@
+/*
+ * 11/19/04 1.0 moved to LGPL.
+ *
+ * 12/12/99 0.0.7 Implementation stores single bits
+ * as ints for better performance. mdm@techie.com.
+ *
+ * 02/28/99 0.0 Java Conversion by E.B, javalayer@javazoom.net
+ *
+ * Adapted from the public c code by Jeff Tsay.
+ *
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+
+package javazoom.jl.decoder;
+
+/**
+ * Implementation of Bit Reservoir for Layer III.
+ * <p>
+ * The implementation stores single bits as a word in the buffer. If
+ * a bit is set, the corresponding word in the buffer will be non-zero.
+ * If a bit is clear, the corresponding word is zero. Although this
+ * may seem waseful, this can be a factor of two quicker than
+ * packing 8 bits to a byte and extracting.
+ * <p>
+ */
+
+// REVIEW: there is no range checking, so buffer underflow or overflow
+// can silently occur.
+final class BitReserve
+{
+ /**
+ * Size of the internal buffer to store the reserved bits.
+ * Must be a power of 2. And x8, as each bit is stored as a single
+ * entry.
+ */
+ private static final int BUFSIZE = 4096*8;
+
+ /**
+ * Mask that can be used to quickly implement the
+ * modulus operation on BUFSIZE.
+ */
+ private static final int BUFSIZE_MASK = BUFSIZE-1;
+
+ private int offset, totbit, buf_byte_idx;
+ private final int[] buf = new int[BUFSIZE];
+ private int buf_bit_idx;
+
+ BitReserve()
+ {
+
+ offset = 0;
+ totbit = 0;
+ buf_byte_idx = 0;
+ }
+
+
+ /**
+ * Return totbit Field.
+ */
+ public int hsstell()
+ {
+ return(totbit);
+ }
+
+ /**
+ * Read a number bits from the bit stream.
+ * @param N the number of
+ */
+ public int hgetbits(int N)
+ {
+ totbit += N;
+
+ int val = 0;
+
+ int pos = buf_byte_idx;
+ if (pos+N < BUFSIZE)
+ {
+ while (N-- > 0)
+ {
+ val <<= 1;
+ val |= ((buf[pos++]!=0) ? 1 : 0);
+ }
+ }
+ else
+ {
+ while (N-- > 0)
+ {
+ val <<= 1;
+ val |= ((buf[pos]!=0) ? 1 : 0);
+ pos = (pos+1) & BUFSIZE_MASK;
+ }
+ }
+ buf_byte_idx = pos;
+ return val;
+ }
+
+
+
+ /**
+ * Read 1 bit from the bit stream.
+ */
+/*
+ public int hget1bit_old()
+ {
+ int val;
+ totbit++;
+ if (buf_bit_idx == 0)
+ {
+ buf_bit_idx = 8;
+ buf_byte_idx++;
+ }
+ // BUFSIZE = 4096 = 2^12, so
+ // buf_byte_idx%BUFSIZE == buf_byte_idx & 0xfff
+ val = buf[buf_byte_idx & BUFSIZE_MASK] & putmask[buf_bit_idx];
+ buf_bit_idx--;
+ val = val >>> buf_bit_idx;
+ return val;
+ }
+ */
+ /**
+ * Returns next bit from reserve.
+ * @returns 0 if next bit is reset, or 1 if next bit is set.
+ */
+ public int hget1bit()
+ {
+ totbit++;
+ int val = buf[buf_byte_idx];
+ buf_byte_idx = (buf_byte_idx+1) & BUFSIZE_MASK;
+ return val;
+ }
+
+ /**
+ * Retrieves bits from the reserve.
+ */
+/*
+ public int readBits(int[] out, int len)
+ {
+ if (buf_bit_idx == 0)
+ {
+ buf_bit_idx = 8;
+ buf_byte_idx++;
+ current = buf[buf_byte_idx & BUFSIZE_MASK];
+ }
+
+
+
+ // save total number of bits returned
+ len = buf_bit_idx;
+ buf_bit_idx = 0;
+
+ int b = current;
+ int count = len-1;
+
+ while (count >= 0)
+ {
+ out[count--] = (b & 0x1);
+ b >>>= 1;
+ }
+
+ totbit += len;
+ return len;
+ }
+ */
+
+ /**
+ * Write 8 bits into the bit stream.
+ */
+ public void hputbuf(int val)
+ {
+ int ofs = offset;
+ buf[ofs++] = val & 0x80;
+ buf[ofs++] = val & 0x40;
+ buf[ofs++] = val & 0x20;
+ buf[ofs++] = val & 0x10;
+ buf[ofs++] = val & 0x08;
+ buf[ofs++] = val & 0x04;
+ buf[ofs++] = val & 0x02;
+ buf[ofs++] = val & 0x01;
+
+ if (ofs==BUFSIZE)
+ offset = 0;
+ else
+ offset = ofs;
+
+ }
+
+ /**
+ * Rewind N bits in Stream.
+ */
+ public void rewindNbits(int N)
+ {
+ totbit -= N;
+ buf_byte_idx -= N;
+ if (buf_byte_idx<0)
+ buf_byte_idx += BUFSIZE;
+ }
+
+ /**
+ * Rewind N bytes in Stream.
+ */
+ public void rewindNbytes(int N)
+ {
+ int bits = (N << 3);
+ totbit -= bits;
+ buf_byte_idx -= bits;
+ if (buf_byte_idx<0)
+ buf_byte_idx += BUFSIZE;
+ }
+}
diff --git a/Robust/src/Tests/ssJava/mp3decoder/Bitstream.java b/Robust/src/Tests/ssJava/mp3decoder/Bitstream.java
new file mode 100644
index 00000000..d91ea26f
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/Bitstream.java
@@ -0,0 +1,655 @@
+/*
+ * 11/19/04 1.0 moved to LGPL.
+ *
+ * 11/17/04 Uncomplete frames discarded. E.B, javalayer@javazoom.net
+ *
+ * 12/05/03 ID3v2 tag returned. E.B, javalayer@javazoom.net
+ *
+ * 12/12/99 Based on Ibitstream. Exceptions thrown on errors,
+ * Temporary removed seek functionality. mdm@techie.com
+ *
+ * 02/12/99 : Java Conversion by E.B , javalayer@javazoom.net
+ *
+ * 04/14/97 : Added function prototypes for new syncing and seeking
+ * mechanisms. Also made this file portable. Changes made by Jeff Tsay
+ *
+ * @(#) ibitstream.h 1.5, last edit: 6/15/94 16:55:34
+ * @(#) Copyright (C) 1993, 1994 Tobias Bading (bading@cs.tu-berlin.de)
+ * @(#) Berlin University of Technology
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+
+package javazoom.jl.decoder;
+
+import java.io.BufferedInputStream;
+import java.io.ByteArrayInputStream;
+import java.io.IOException;
+import java.io.InputStream;
+import java.io.PushbackInputStream;
+
+
+/**
+ * The <code>Bistream</code> class is responsible for parsing
+ * an MPEG audio bitstream.
+ *
+ * <b>REVIEW:</b> much of the parsing currently occurs in the
+ * various decoders. This should be moved into this class and associated
+ * inner classes.
+ */
+public final class Bitstream implements BitstreamErrors
+{
+ /**
+ * Synchronization control constant for the initial
+ * synchronization to the start of a frame.
+ */
+ static byte INITIAL_SYNC = 0;
+
+ /**
+ * Synchronization control constant for non-initial frame
+ * synchronizations.
+ */
+ static byte STRICT_SYNC = 1;
+
+ // max. 1730 bytes per frame: 144 * 384kbit/s / 32000 Hz + 2 Bytes CRC
+ /**
+ * Maximum size of the frame buffer.
+ */
+ private static final int BUFFER_INT_SIZE = 433;
+
+ /**
+ * The frame buffer that holds the data for the current frame.
+ */
+ private final int[] framebuffer = new int[BUFFER_INT_SIZE];
+
+ /**
+ * Number of valid bytes in the frame buffer.
+ */
+ private int framesize;
+
+ /**
+ * The bytes read from the stream.
+ */
+ private byte[] frame_bytes = new byte[BUFFER_INT_SIZE*4];
+
+ /**
+ * Index into <code>framebuffer</code> where the next bits are
+ * retrieved.
+ */
+ private int wordpointer;
+
+ /**
+ * Number (0-31, from MSB to LSB) of next bit for get_bits()
+ */
+ private int bitindex;
+
+ /**
+ * The current specified syncword
+ */
+ private int syncword;
+
+ /**
+ * Audio header position in stream.
+ */
+ private int header_pos = 0;
+
+ /**
+ *
+ */
+ private boolean single_ch_mode;
+ //private int current_frame_number;
+ //private int last_frame_number;
+
+ private final int bitmask[] = {0, // dummy
+ 0x00000001, 0x00000003, 0x00000007, 0x0000000F,
+ 0x0000001F, 0x0000003F, 0x0000007F, 0x000000FF,
+ 0x000001FF, 0x000003FF, 0x000007FF, 0x00000FFF,
+ 0x00001FFF, 0x00003FFF, 0x00007FFF, 0x0000FFFF,
+ 0x0001FFFF };
+
+ private final PushbackInputStream source;
+
+ private final Header header = new Header();
+
+ private final byte syncbuf[] = new byte[4];
+
+ private Crc16[] crc = new Crc16[1];
+
+ private byte[] rawid3v2 = null;
+
+ private boolean firstframe = true;
+
+
+ /**
+ * Construct a IBitstream that reads data from a
+ * given InputStream.
+ *
+ * @param in The InputStream to read from.
+ */
+ public Bitstream(InputStream in)
+ {
+ if (in==null) throw new NullPointerException("in");
+ in = new BufferedInputStream(in);
+ loadID3v2(in);
+ firstframe = true;
+ //source = new PushbackInputStream(in, 1024);
+ source = new PushbackInputStream(in, BUFFER_INT_SIZE*4);
+
+ closeFrame();
+ //current_frame_number = -1;
+ //last_frame_number = -1;
+ }
+
+ /**
+ * Return position of the first audio header.
+ * @return size of ID3v2 tag frames.
+ */
+ public int header_pos()
+ {
+ return header_pos;
+ }
+
+ /**
+ * Load ID3v2 frames.
+ * @param in MP3 InputStream.
+ * @author JavaZOOM
+ */
+ private void loadID3v2(InputStream in)
+ {
+ int size = -1;
+ try
+ {
+ // Read ID3v2 header (10 bytes).
+ in.mark(10);
+ size = readID3v2Header(in);
+ header_pos = size;
+ }
+ catch (IOException e)
+ {}
+ finally
+ {
+ try
+ {
+ // Unread ID3v2 header (10 bytes).
+ in.reset();
+ }
+ catch (IOException e)
+ {}
+ }
+ // Load ID3v2 tags.
+ try
+ {
+ if (size > 0)
+ {
+ rawid3v2 = new byte[size];
+ in.read(rawid3v2,0,rawid3v2.length);
+ }
+ }
+ catch (IOException e)
+ {}
+ }
+
+ /**
+ * Parse ID3v2 tag header to find out size of ID3v2 frames.
+ * @param in MP3 InputStream
+ * @return size of ID3v2 frames + header
+ * @throws IOException
+ * @author JavaZOOM
+ */
+ private int readID3v2Header(InputStream in) throws IOException
+ {
+ byte[] id3header = new byte[4];
+ int size = -10;
+ in.read(id3header,0,3);
+ // Look for ID3v2
+ if ( (id3header[0]=='I') && (id3header[1]=='D') && (id3header[2]=='3'))
+ {
+ in.read(id3header,0,3);
+ int majorVersion = id3header[0];
+ int revision = id3header[1];
+ in.read(id3header,0,4);
+ size = (int) (id3header[0] << 21) + (id3header[1] << 14) + (id3header[2] << 7) + (id3header[3]);
+ }
+ return (size+10);
+ }
+
+ /**
+ * Return raw ID3v2 frames + header.
+ * @return ID3v2 InputStream or null if ID3v2 frames are not available.
+ */
+ public InputStream getRawID3v2()
+ {
+ if (rawid3v2 == null) return null;
+ else
+ {
+ ByteArrayInputStream bain = new ByteArrayInputStream(rawid3v2);
+ return bain;
+ }
+ }
+
+ /**
+ * Close the Bitstream.
+ * @throws BitstreamException
+ */
+ public void close() throws BitstreamException
+ {
+ try
+ {
+ source.close();
+ }
+ catch (IOException ex)
+ {
+ throw newBitstreamException(STREAM_ERROR, ex);
+ }
+ }
+
+ /**
+ * Reads and parses the next frame from the input source.
+ * @return the Header describing details of the frame read,
+ * or null if the end of the stream has been reached.
+ */
+ public Header readFrame() throws BitstreamException
+ {
+ Header result = null;
+ try
+ {
+ result = readNextFrame();
+ // E.B, Parse VBR (if any) first frame.
+ if (firstframe == true)
+ {
+ result.parseVBR(frame_bytes);
+ firstframe = false;
+ }
+ }
+ catch (BitstreamException ex)
+ {
+ if ((ex.getErrorCode()==INVALIDFRAME))
+ {
+ // Try to skip this frame.
+ //System.out.println("INVALIDFRAME");
+ try
+ {
+ closeFrame();
+ result = readNextFrame();
+ }
+ catch (BitstreamException e)
+ {
+ if ((e.getErrorCode()!=STREAM_EOF))
+ {
+ // wrap original exception so stack trace is maintained.
+ throw newBitstreamException(e.getErrorCode(), e);
+ }
+ }
+ }
+ else if ((ex.getErrorCode()!=STREAM_EOF))
+ {
+ // wrap original exception so stack trace is maintained.
+ throw newBitstreamException(ex.getErrorCode(), ex);
+ }
+ }
+ return result;
+ }
+
+ /**
+ * Read next MP3 frame.
+ * @return MP3 frame header.
+ * @throws BitstreamException
+ */
+ private Header readNextFrame() throws BitstreamException
+ {
+ if (framesize == -1)
+ {
+ nextFrame();
+ }
+ return header;
+ }
+
+
+ /**
+ * Read next MP3 frame.
+ * @throws BitstreamException
+ */
+ private void nextFrame() throws BitstreamException
+ {
+ // entire frame is read by the header class.
+ header.read_header(this, crc);
+ }
+
+ /**
+ * Unreads the bytes read from the frame.
+ * @throws BitstreamException
+ */
+ // REVIEW: add new error codes for this.
+ public void unreadFrame() throws BitstreamException
+ {
+ if (wordpointer==-1 && bitindex==-1 && (framesize>0))
+ {
+ try
+ {
+ source.unread(frame_bytes, 0, framesize);
+ }
+ catch (IOException ex)
+ {
+ throw newBitstreamException(STREAM_ERROR);
+ }
+ }
+ }
+
+ /**
+ * Close MP3 frame.
+ */
+ public void closeFrame()
+ {
+ framesize = -1;
+ wordpointer = -1;
+ bitindex = -1;
+ }
+
+ /**
+ * Determines if the next 4 bytes of the stream represent a
+ * frame header.
+ */
+ public boolean isSyncCurrentPosition(int syncmode) throws BitstreamException
+ {
+ int read = readBytes(syncbuf, 0, 4);
+ int headerstring = ((syncbuf[0] << 24) & 0xFF000000) | ((syncbuf[1] << 16) & 0x00FF0000) | ((syncbuf[2] << 8) & 0x0000FF00) | ((syncbuf[3] << 0) & 0x000000FF);
+
+ try
+ {
+ source.unread(syncbuf, 0, read);
+ }
+ catch (IOException ex)
+ {
+ }
+
+ boolean sync = false;
+ switch (read)
+ {
+ case 0:
+ sync = true;
+ break;
+ case 4:
+ sync = isSyncMark(headerstring, syncmode, syncword);
+ break;
+ }
+
+ return sync;
+ }
+
+
+ // REVIEW: this class should provide inner classes to
+ // parse the frame contents. Eventually, readBits will
+ // be removed.
+ public int readBits(int n)
+ {
+ return get_bits(n);
+ }
+
+ public int readCheckedBits(int n)
+ {
+ // REVIEW: implement CRC check.
+ return get_bits(n);
+ }
+
+ protected BitstreamException newBitstreamException(int errorcode)
+ {
+ return new BitstreamException(errorcode, null);
+ }
+ protected BitstreamException newBitstreamException(int errorcode, Throwable throwable)
+ {
+ return new BitstreamException(errorcode, throwable);
+ }
+
+ /**
+ * Get next 32 bits from bitstream.
+ * They are stored in the headerstring.
+ * syncmod allows Synchro flag ID
+ * The returned value is False at the end of stream.
+ */
+
+ int syncHeader(byte syncmode) throws BitstreamException
+ {
+ boolean sync;
+ int headerstring;
+ // read additional 2 bytes
+ int bytesRead = readBytes(syncbuf, 0, 3);
+
+ if (bytesRead!=3) throw newBitstreamException(STREAM_EOF, null);
+
+ headerstring = ((syncbuf[0] << 16) & 0x00FF0000) | ((syncbuf[1] << 8) & 0x0000FF00) | ((syncbuf[2] << 0) & 0x000000FF);
+
+ do
+ {
+ headerstring <<= 8;
+
+ if (readBytes(syncbuf, 3, 1)!=1)
+ throw newBitstreamException(STREAM_EOF, null);
+
+ headerstring |= (syncbuf[3] & 0x000000FF);
+
+ sync = isSyncMark(headerstring, syncmode, syncword);
+ }
+ while (!sync);
+
+ //current_frame_number++;
+ //if (last_frame_number < current_frame_number) last_frame_number = current_frame_number;
+
+ return headerstring;
+ }
+
+ public boolean isSyncMark(int headerstring, int syncmode, int word)
+ {
+ boolean sync = false;
+
+ if (syncmode == INITIAL_SYNC)
+ {
+ //sync = ((headerstring & 0xFFF00000) == 0xFFF00000);
+ sync = ((headerstring & 0xFFE00000) == 0xFFE00000); // SZD: MPEG 2.5
+ }
+ else
+ {
+ sync = ((headerstring & 0xFFF80C00) == word) &&
+ (((headerstring & 0x000000C0) == 0x000000C0) == single_ch_mode);
+ }
+
+ // filter out invalid sample rate
+ if (sync)
+ sync = (((headerstring >>> 10) & 3)!=3);
+ // filter out invalid layer
+ if (sync)
+ sync = (((headerstring >>> 17) & 3)!=0);
+ // filter out invalid version
+ if (sync)
+ sync = (((headerstring >>> 19) & 3)!=1);
+
+ return sync;
+ }
+
+ /**
+ * Reads the data for the next frame. The frame is not parsed
+ * until parse frame is called.
+ */
+ int read_frame_data(int bytesize) throws BitstreamException
+ {
+ int numread = 0;
+ numread = readFully(frame_bytes, 0, bytesize);
+ framesize = bytesize;
+ wordpointer = -1;
+ bitindex = -1;
+ return numread;
+ }
+
+ /**
+ * Parses the data previously read with read_frame_data().
+ */
+ void parse_frame() throws BitstreamException
+ {
+ // Convert Bytes read to int
+ int b=0;
+ byte[] byteread = frame_bytes;
+ int bytesize = framesize;
+
+ // Check ID3v1 TAG (True only if last frame).
+ //for (int t=0;t<(byteread.length)-2;t++)
+ //{
+ // if ((byteread[t]=='T') && (byteread[t+1]=='A') && (byteread[t+2]=='G'))
+ // {
+ // System.out.println("ID3v1 detected at offset "+t);
+ // throw newBitstreamException(INVALIDFRAME, null);
+ // }
+ //}
+
+ for (int k=0;k<bytesize;k=k+4)
+ {
+ int convert = 0;
+ byte b0 = 0;
+ byte b1 = 0;
+ byte b2 = 0;
+ byte b3 = 0;
+ b0 = byteread[k];
+ if (k+1<bytesize) b1 = byteread[k+1];
+ if (k+2<bytesize) b2 = byteread[k+2];
+ if (k+3<bytesize) b3 = byteread[k+3];
+ framebuffer[b++] = ((b0 << 24) &0xFF000000) | ((b1 << 16) & 0x00FF0000) | ((b2 << 8) & 0x0000FF00) | (b3 & 0x000000FF);
+ }
+ wordpointer = 0;
+ bitindex = 0;
+ }
+
+ /**
+ * Read bits from buffer into the lower bits of an unsigned int.
+ * The LSB contains the latest read bit of the stream.
+ * (1 <= number_of_bits <= 16)
+ */
+ public int get_bits(int number_of_bits)
+ {
+ int returnvalue = 0;
+ int sum = bitindex + number_of_bits;
+
+ // E.B
+ // There is a problem here, wordpointer could be -1 ?!
+ if (wordpointer < 0) wordpointer = 0;
+ // E.B : End.
+
+ if (sum <= 32)
+ {
+ // all bits contained in *wordpointer
+ returnvalue = (framebuffer[wordpointer] >>> (32 - sum)) & bitmask[number_of_bits];
+ // returnvalue = (wordpointer[0] >> (32 - sum)) & bitmask[number_of_bits];
+ if ((bitindex += number_of_bits) == 32)
+ {
+ bitindex = 0;
+ wordpointer++; // added by me!
+ }
+ return returnvalue;
+ }
+
+ // E.B : Check that ?
+ //((short[])&returnvalue)[0] = ((short[])wordpointer + 1)[0];
+ //wordpointer++; // Added by me!
+ //((short[])&returnvalue + 1)[0] = ((short[])wordpointer)[0];
+ int Right = (framebuffer[wordpointer] & 0x0000FFFF);
+ wordpointer++;
+ int Left = (framebuffer[wordpointer] & 0xFFFF0000);
+ returnvalue = ((Right << 16) & 0xFFFF0000) | ((Left >>> 16)& 0x0000FFFF);
+
+ returnvalue >>>= 48 - sum; // returnvalue >>= 16 - (number_of_bits - (32 - bitindex))
+ returnvalue &= bitmask[number_of_bits];
+ bitindex = sum - 32;
+ return returnvalue;
+}
+
+ /**
+ * Set the word we want to sync the header to.
+ * In Big-Endian byte order
+ */
+ void set_syncword(int syncword0)
+ {
+ syncword = syncword0 & 0xFFFFFF3F;
+ single_ch_mode = ((syncword0 & 0x000000C0) == 0x000000C0);
+ }
+ /**
+ * Reads the exact number of bytes from the source
+ * input stream into a byte array.
+ *
+ * @param b The byte array to read the specified number
+ * of bytes into.
+ * @param offs The index in the array where the first byte
+ * read should be stored.
+ * @param len the number of bytes to read.
+ *
+ * @exception BitstreamException is thrown if the specified
+ * number of bytes could not be read from the stream.
+ */
+ private int readFully(byte[] b, int offs, int len)
+ throws BitstreamException
+ {
+ int nRead = 0;
+ try
+ {
+ while (len > 0)
+ {
+ int bytesread = source.read(b, offs, len);
+ if (bytesread == -1)
+ {
+ while (len-->0)
+ {
+ b[offs++] = 0;
+ }
+ break;
+ //throw newBitstreamException(UNEXPECTED_EOF, new EOFException());
+ }
+ nRead = nRead + bytesread;
+ offs += bytesread;
+ len -= bytesread;
+ }
+ }
+ catch (IOException ex)
+ {
+ throw newBitstreamException(STREAM_ERROR, ex);
+ }
+ return nRead;
+ }
+
+ /**
+ * Simlar to readFully, but doesn't throw exception when
+ * EOF is reached.
+ */
+ private int readBytes(byte[] b, int offs, int len)
+ throws BitstreamException
+ {
+ int totalBytesRead = 0;
+ try
+ {
+ while (len > 0)
+ {
+ int bytesread = source.read(b, offs, len);
+ if (bytesread == -1)
+ {
+ break;
+ }
+ totalBytesRead += bytesread;
+ offs += bytesread;
+ len -= bytesread;
+ }
+ }
+ catch (IOException ex)
+ {
+ throw newBitstreamException(STREAM_ERROR, ex);
+ }
+ return totalBytesRead;
+ }
+}
diff --git a/Robust/src/Tests/ssJava/mp3decoder/BitstreamErrors.java b/Robust/src/Tests/ssJava/mp3decoder/BitstreamErrors.java
new file mode 100644
index 00000000..26daeb9d
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/BitstreamErrors.java
@@ -0,0 +1,72 @@
+/*
+ * 11/19/04 1.0 moved to LGPL.
+ * 11/17/04 INVALIDFRAME code added. javalayer@javazoom.net
+ * 12/12/99 Initial version. mdm@techie.com
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+
+package javazoom.jl.decoder;
+
+/**
+ * This interface describes all error codes that can be thrown
+ * in <code>BistreamException</code>s.
+ *
+ * @see BitstreamException
+ *
+ * @author MDM 12/12/99
+ * @since 0.0.6
+ */
+
+public interface BitstreamErrors extends JavaLayerErrors
+{
+
+ /**
+ * An undeterminable error occurred.
+ */
+ static public final int UNKNOWN_ERROR = BITSTREAM_ERROR + 0;
+
+ /**
+ * The header describes an unknown sample rate.
+ */
+ static public final int UNKNOWN_SAMPLE_RATE = BITSTREAM_ERROR + 1;
+
+ /**
+ * A problem occurred reading from the stream.
+ */
+ static public final int STREAM_ERROR = BITSTREAM_ERROR + 2;
+
+ /**
+ * The end of the stream was reached prematurely.
+ */
+ static public final int UNEXPECTED_EOF = BITSTREAM_ERROR + 3;
+
+ /**
+ * The end of the stream was reached.
+ */
+ static public final int STREAM_EOF = BITSTREAM_ERROR + 4;
+
+ /**
+ * Frame data are missing.
+ */
+ static public final int INVALIDFRAME = BITSTREAM_ERROR + 5;
+
+ /**
+ *
+ */
+ static public final int BITSTREAM_LAST = 0x1ff;
+
+}
diff --git a/Robust/src/Tests/ssJava/mp3decoder/BitstreamException.java b/Robust/src/Tests/ssJava/mp3decoder/BitstreamException.java
new file mode 100644
index 00000000..e4afb1a1
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/BitstreamException.java
@@ -0,0 +1,71 @@
+/*
+ * 11/19/04 1.0 moved to LGPL.
+ * 12/12/99 Initial version. mdm@techie.com
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+
+package javazoom.jl.decoder;
+
+/**
+ * Instances of <code>BitstreamException</code> are thrown
+ * when operations on a <code>Bitstream</code> fail.
+ * <p>
+ * The exception provides details of the exception condition
+ * in two ways:
+ * <ol><li>
+ * as an error-code describing the nature of the error
+ * </li><br></br><li>
+ * as the <code>Throwable</code> instance, if any, that was thrown
+ * indicating that an exceptional condition has occurred.
+ * </li></ol></p>
+ *
+ * @since 0.0.6
+ * @author MDM 12/12/99
+ */
+
+public class BitstreamException extends JavaLayerException
+ implements BitstreamErrors
+{
+ private int errorcode = UNKNOWN_ERROR;
+
+ public BitstreamException(String msg, Throwable t)
+ {
+ super(msg, t);
+ }
+
+ public BitstreamException(int errorcode, Throwable t)
+ {
+ this(getErrorString(errorcode), t);
+ this.errorcode = errorcode;
+ }
+
+ public int getErrorCode()
+ {
+ return errorcode;
+ }
+
+
+ static public String getErrorString(int errorcode)
+ {
+ // REVIEW: use resource bundle to map error codes
+ // to locale-sensitive strings.
+
+ return "Bitstream errorcode "+Integer.toHexString(errorcode);
+ }
+
+
+}
diff --git a/Robust/src/Tests/ssJava/mp3decoder/Control.java b/Robust/src/Tests/ssJava/mp3decoder/Control.java
new file mode 100644
index 00000000..9d566049
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/Control.java
@@ -0,0 +1,57 @@
+/*
+ * 11/19/04 1.0 moved to LGPL.
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+
+package javazoom.jl.decoder;
+
+/**
+ * Work in progress.
+ */
+
+public interface Control
+{
+
+ /**
+ * Starts playback of the media presented by this control.
+ */
+ public void start();
+
+ /**
+ * Stops playback of the media presented by this control.
+ */
+ public void stop();
+
+ public boolean isPlaying();
+
+ public void pause();
+
+
+ public boolean isRandomAccess();
+
+ /**
+ * Retrieves the current position.
+ */
+ public double getPosition();
+
+ /**
+ *
+ */
+ public void setPosition(double d);
+
+
+}
diff --git a/Robust/src/Tests/ssJava/mp3decoder/Crc16.java b/Robust/src/Tests/ssJava/mp3decoder/Crc16.java
new file mode 100644
index 00000000..caad01ca
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/Crc16.java
@@ -0,0 +1,70 @@
+/*
+ * 11/19/04 : 1.0 moved to LGPL.
+ *
+ * 02/12/99 : Java Conversion by E.B , javalayer@javazoom.net
+ *
+ * @(#) crc.h 1.5, last edit: 6/15/94 16:55:32
+ * @(#) Copyright (C) 1993, 1994 Tobias Bading (bading@cs.tu-berlin.de)
+ * @(#) Berlin University of Technology
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+package javazoom.jl.decoder;
+
+/**
+ * 16-Bit CRC checksum
+ */
+public final class Crc16
+{
+ private static short polynomial=(short)0x8005;
+ private short crc;
+
+ /**
+ * Dummy Constructor
+ */
+ public Crc16()
+ {
+ crc = (short) 0xFFFF;
+ }
+
+ /**
+ * Feed a bitstring to the crc calculation (0 < length <= 32).
+ */
+ public void add_bits (int bitstring, int length)
+ {
+ int bitmask = 1 << (length - 1);
+ do
+ if (((crc & 0x8000) == 0) ^ ((bitstring & bitmask) == 0 ))
+ {
+ crc <<= 1;
+ crc ^= polynomial;
+ }
+ else
+ crc <<= 1;
+ while ((bitmask >>>= 1) != 0);
+ }
+
+ /**
+ * Return the calculated checksum.
+ * Erase it for next calls to add_bits().
+ */
+ public short checksum()
+ {
+ short sum = crc;
+ crc = (short) 0xFFFF;
+ return sum;
+ }
+}
diff --git a/Robust/src/Tests/ssJava/mp3decoder/Decoder.java b/Robust/src/Tests/ssJava/mp3decoder/Decoder.java
new file mode 100644
index 00000000..6de55997
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/Decoder.java
@@ -0,0 +1,357 @@
+/*
+ * 11/19/04 1.0 moved to LGPL.
+ * 01/12/99 Initial version. mdm@techie.com
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+
+package javazoom.jl.decoder;
+
+/**
+ * The <code>Decoder</code> class encapsulates the details of
+ * decoding an MPEG audio frame.
+ *
+ * @author MDM
+ * @version 0.0.7 12/12/99
+ * @since 0.0.5
+ */
+public class Decoder implements DecoderErrors
+{
+ static private final Params DEFAULT_PARAMS = new Params();
+
+ /**
+ * The Bistream from which the MPEG audio frames are read.
+ */
+ //private Bitstream stream;
+
+ /**
+ * The Obuffer instance that will receive the decoded
+ * PCM samples.
+ */
+ private Obuffer output;
+
+ /**
+ * Synthesis filter for the left channel.
+ */
+ private SynthesisFilter filter1;
+
+ /**
+ * Sythesis filter for the right channel.
+ */
+ private SynthesisFilter filter2;
+
+ /**
+ * The decoder used to decode layer III frames.
+ */
+ private LayerIIIDecoder l3decoder;
+ private LayerIIDecoder l2decoder;
+ private LayerIDecoder l1decoder;
+
+ private int outputFrequency;
+ private int outputChannels;
+
+ private Equalizer equalizer = new Equalizer();
+
+ private Params params;
+
+ private boolean initialized;
+
+
+ /**
+ * Creates a new <code>Decoder</code> instance with default
+ * parameters.
+ */
+
+ public Decoder()
+ {
+ this(null);
+ }
+
+ /**
+ * Creates a new <code>Decoder</code> instance with default
+ * parameters.
+ *
+ * @param params The <code>Params</code> instance that describes
+ * the customizable aspects of the decoder.
+ */
+ public Decoder(Params params0)
+ {
+ if (params0==null)
+ params0 = DEFAULT_PARAMS;
+
+ params = params0;
+
+ Equalizer eq = params.getInitialEqualizerSettings();
+ if (eq!=null)
+ {
+ equalizer.setFrom(eq);
+ }
+ }
+
+ static public Params getDefaultParams()
+ {
+ return (Params)DEFAULT_PARAMS.clone();
+ }
+
+ public void setEqualizer(Equalizer eq)
+ {
+ if (eq==null)
+ eq = Equalizer.PASS_THRU_EQ;
+
+ equalizer.setFrom(eq);
+
+ float[] factors = equalizer.getBandFactors();
+
+ if (filter1!=null)
+ filter1.setEQ(factors);
+
+ if (filter2!=null)
+ filter2.setEQ(factors);
+ }
+
+ /**
+ * Decodes one frame from an MPEG audio bitstream.
+ *
+ * @param header The header describing the frame to decode.
+ * @param bitstream The bistream that provides the bits for te body of the frame.
+ *
+ * @return A SampleBuffer containing the decoded samples.
+ */
+ public Obuffer decodeFrame(Header header, Bitstream stream)
+ throws DecoderException
+ {
+ if (!initialized)
+ {
+ initialize(header);
+ }
+
+ int layer = header.layer();
+
+ output.clear_buffer();
+
+ FrameDecoder decoder = retrieveDecoder(header, stream, layer);
+
+ decoder.decodeFrame();
+
+ output.write_buffer(1);
+
+ return output;
+ }
+
+ /**
+ * Changes the output buffer. This will take effect the next time
+ * decodeFrame() is called.
+ */
+ public void setOutputBuffer(Obuffer out)
+ {
+ output = out;
+ }
+
+ /**
+ * Retrieves the sample frequency of the PCM samples output
+ * by this decoder. This typically corresponds to the sample
+ * rate encoded in the MPEG audio stream.
+ *
+ * @param the sample rate (in Hz) of the samples written to the
+ * output buffer when decoding.
+ */
+ public int getOutputFrequency()
+ {
+ return outputFrequency;
+ }
+
+ /**
+ * Retrieves the number of channels of PCM samples output by
+ * this decoder. This usually corresponds to the number of
+ * channels in the MPEG audio stream, although it may differ.
+ *
+ * @return The number of output channels in the decoded samples: 1
+ * for mono, or 2 for stereo.
+ *
+ */
+ public int getOutputChannels()
+ {
+ return outputChannels;
+ }
+
+ /**
+ * Retrieves the maximum number of samples that will be written to
+ * the output buffer when one frame is decoded. This can be used to
+ * help calculate the size of other buffers whose size is based upon
+ * the number of samples written to the output buffer. NB: this is
+ * an upper bound and fewer samples may actually be written, depending
+ * upon the sample rate and number of channels.
+ *
+ * @return The maximum number of samples that are written to the
+ * output buffer when decoding a single frame of MPEG audio.
+ */
+ public int getOutputBlockSize()
+ {
+ return Obuffer.OBUFFERSIZE;
+ }
+
+
+ protected DecoderException newDecoderException(int errorcode)
+ {
+ return new DecoderException(errorcode, null);
+ }
+
+ protected DecoderException newDecoderException(int errorcode, Throwable throwable)
+ {
+ return new DecoderException(errorcode, throwable);
+ }
+
+ protected FrameDecoder retrieveDecoder(Header header, Bitstream stream, int layer)
+ throws DecoderException
+ {
+ FrameDecoder decoder = null;
+
+ // REVIEW: allow channel output selection type
+ // (LEFT, RIGHT, BOTH, DOWNMIX)
+ switch (layer)
+ {
+ case 3:
+ if (l3decoder==null)
+ {
+ l3decoder = new LayerIIIDecoder(stream,
+ header, filter1, filter2,
+ output, OutputChannels.BOTH_CHANNELS);
+ }
+
+ decoder = l3decoder;
+ break;
+ case 2:
+ if (l2decoder==null)
+ {
+ l2decoder = new LayerIIDecoder();
+ l2decoder.create(stream,
+ header, filter1, filter2,
+ output, OutputChannels.BOTH_CHANNELS);
+ }
+ decoder = l2decoder;
+ break;
+ case 1:
+ if (l1decoder==null)
+ {
+ l1decoder = new LayerIDecoder();
+ l1decoder.create(stream,
+ header, filter1, filter2,
+ output, OutputChannels.BOTH_CHANNELS);
+ }
+ decoder = l1decoder;
+ break;
+ }
+
+ if (decoder==null)
+ {
+ throw newDecoderException(UNSUPPORTED_LAYER, null);
+ }
+
+ return decoder;
+ }
+
+ private void initialize(Header header)
+ throws DecoderException
+ {
+
+ // REVIEW: allow customizable scale factor
+ float scalefactor = 32700.0f;
+
+ int mode = header.mode();
+ int layer = header.layer();
+ int channels = mode==Header.SINGLE_CHANNEL ? 1 : 2;
+
+
+ // set up output buffer if not set up by client.
+ if (output==null)
+ output = new SampleBuffer(header.frequency(), channels);
+
+ float[] factors = equalizer.getBandFactors();
+ filter1 = new SynthesisFilter(0, scalefactor, factors);
+
+ // REVIEW: allow mono output for stereo
+ if (channels==2)
+ filter2 = new SynthesisFilter(1, scalefactor, factors);
+
+ outputChannels = channels;
+ outputFrequency = header.frequency();
+
+ initialized = true;
+ }
+
+ /**
+ * The <code>Params</code> class presents the customizable
+ * aspects of the decoder.
+ * <p>
+ * Instances of this class are not thread safe.
+ */
+ public static class Params implements Cloneable
+ {
+ private OutputChannels outputChannels = OutputChannels.BOTH;
+
+ private Equalizer equalizer = new Equalizer();
+
+ public Params()
+ {
+ }
+
+ public Object clone()
+ {
+ try
+ {
+ return super.clone();
+ }
+ catch (CloneNotSupportedException ex)
+ {
+ throw new InternalError(this+": "+ex);
+ }
+ }
+
+ public void setOutputChannels(OutputChannels out)
+ {
+ if (out==null)
+ throw new NullPointerException("out");
+
+ outputChannels = out;
+ }
+
+ public OutputChannels getOutputChannels()
+ {
+ return outputChannels;
+ }
+
+ /**
+ * Retrieves the equalizer settings that the decoder's equalizer
+ * will be initialized from.
+ * <p>
+ * The <code>Equalizer</code> instance returned
+ * cannot be changed in real time to affect the
+ * decoder output as it is used only to initialize the decoders
+ * EQ settings. To affect the decoder's output in realtime,
+ * use the Equalizer returned from the getEqualizer() method on
+ * the decoder.
+ *
+ * @return The <code>Equalizer</code> used to initialize the
+ * EQ settings of the decoder.
+ */
+ public Equalizer getInitialEqualizerSettings()
+ {
+ return equalizer;
+ }
+
+ };
+}
+
diff --git a/Robust/src/Tests/ssJava/mp3decoder/DecoderErrors.java b/Robust/src/Tests/ssJava/mp3decoder/DecoderErrors.java
new file mode 100644
index 00000000..686f2602
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/DecoderErrors.java
@@ -0,0 +1,45 @@
+/*
+ * 09/26/08 throw exception on subbband alloc error: Christopher G. Jennings (cjennings@acm.org)
+ * 11/19/04 1.0 moved to LGPL.
+ * 01/12/99 Initial version. mdm@techie.com
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+
+package javazoom.jl.decoder;
+
+/**
+ * This interface provides constants describing the error
+ * codes used by the Decoder to indicate errors.
+ *
+ * @author MDM
+ */
+public interface DecoderErrors extends JavaLayerErrors
+{
+
+ static public final int UNKNOWN_ERROR = DECODER_ERROR + 0;
+
+ /**
+ * Layer not supported by the decoder.
+ */
+ static public final int UNSUPPORTED_LAYER = DECODER_ERROR + 1;
+
+ /**
+ * Illegal allocation in subband layer. Indicates a corrupt stream.
+ */
+ static public final int ILLEGAL_SUBBAND_ALLOCATION = DECODER_ERROR + 2;
+
+}
diff --git a/Robust/src/Tests/ssJava/mp3decoder/DecoderException.java b/Robust/src/Tests/ssJava/mp3decoder/DecoderException.java
new file mode 100644
index 00000000..87638ad2
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/DecoderException.java
@@ -0,0 +1,61 @@
+/*
+ * 11/19/04 1.0 moved to LGPL.
+ * 01/12/99 Initial version. mdm@techie.com
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+
+package javazoom.jl.decoder;
+
+/**
+ * The <code>DecoderException</code> represents the class of
+ * errors that can occur when decoding MPEG audio.
+ *
+ * @author MDM
+ */
+public class DecoderException extends JavaLayerException
+ implements DecoderErrors
+{
+ private int errorcode = UNKNOWN_ERROR;
+
+ public DecoderException(String msg, Throwable t)
+ {
+ super(msg, t);
+ }
+
+ public DecoderException(int errorcode, Throwable t)
+ {
+ this(getErrorString(errorcode), t);
+ this.errorcode = errorcode;
+ }
+
+ public int getErrorCode()
+ {
+ return errorcode;
+ }
+
+
+ static public String getErrorString(int errorcode)
+ {
+ // REVIEW: use resource file to map error codes
+ // to locale-sensitive strings.
+
+ return "Decoder errorcode "+Integer.toHexString(errorcode);
+ }
+
+
+}
+
diff --git a/Robust/src/Tests/ssJava/mp3decoder/Equalizer.java b/Robust/src/Tests/ssJava/mp3decoder/Equalizer.java
new file mode 100644
index 00000000..439279e6
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/Equalizer.java
@@ -0,0 +1,227 @@
+/*
+ * 11/19/04 1.0 moved to LGPL.
+ * 12/12/99 Initial version. mdm@techie.com
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+
+
+package javazoom.jl.decoder;
+
+/**
+ * The <code>Equalizer</code> class can be used to specify
+ * equalization settings for the MPEG audio decoder.
+ * <p>
+ * The equalizer consists of 32 band-pass filters.
+ * Each band of the equalizer can take on a fractional value between
+ * -1.0 and +1.0.
+ * At -1.0, the input signal is attenuated by 6dB, at +1.0 the signal is
+ * amplified by 6dB.
+ *
+ * @see Decoder
+ *
+ * @author MDM
+ */
+public final class Equalizer
+{
+ /**
+ * Equalizer setting to denote that a given band will not be
+ * present in the output signal.
+ */
+ static public final float BAND_NOT_PRESENT = Float.NEGATIVE_INFINITY;
+
+ static public final Equalizer PASS_THRU_EQ = new Equalizer();
+
+ private static final int BANDS = 32;
+
+ private final float[] settings = new float[BANDS];
+
+ /**
+ * Creates a new <code>Equalizer</code> instance.
+ */
+ public Equalizer()
+ {
+ }
+
+// private Equalizer(float b1, float b2, float b3, float b4, float b5,
+// float b6, float b7, float b8, float b9, float b10, float b11,
+// float b12, float b13, float b14, float b15, float b16,
+// float b17, float b18, float b19, float b20);
+
+ public Equalizer(float[] settings)
+ {
+ setFrom(settings);
+ }
+
+ public Equalizer(EQFunction eq)
+ {
+ setFrom(eq);
+ }
+
+ public void setFrom(float[] eq)
+ {
+ reset();
+ int max = (eq.length > BANDS) ? BANDS : eq.length;
+
+ for (int i=0; i<max; i++)
+ {
+ settings[i] = limit(eq[i]);
+ }
+ }
+
+ public void setFrom(EQFunction eq)
+ {
+ reset();
+ int max = BANDS;
+
+ for (int i=0; i<max; i++)
+ {
+ settings[i] = limit(eq.getBand(i));
+ }
+ }
+
+ /**
+ * Sets the bands of this equalizer to the value the bands of
+ * another equalizer. Bands that are not present in both equalizers are ignored.
+ */
+ public void setFrom(Equalizer eq)
+ {
+ if (eq!=this)
+ {
+ setFrom(eq.settings);
+ }
+ }
+
+
+
+
+ /**
+ * Sets all bands to 0.0
+ */
+ public void reset()
+ {
+ for (int i=0; i<BANDS; i++)
+ {
+ settings[i] = 0.0f;
+ }
+ }
+
+
+ /**
+ * Retrieves the number of bands present in this equalizer.
+ */
+ public int getBandCount()
+ {
+ return settings.length;
+ }
+
+ public float setBand(int band, float neweq)
+ {
+ float eq = 0.0f;
+
+ if ((band>=0) && (band<BANDS))
+ {
+ eq = settings[band];
+ settings[band] = limit(neweq);
+ }
+
+ return eq;
+ }
+
+
+
+ /**
+ * Retrieves the eq setting for a given band.
+ */
+ public float getBand(int band)
+ {
+ float eq = 0.0f;
+
+ if ((band>=0) && (band<BANDS))
+ {
+ eq = settings[band];
+ }
+
+ return eq;
+ }
+
+ private float limit(float eq)
+ {
+ if (eq==BAND_NOT_PRESENT)
+ return eq;
+ if (eq > 1.0f)
+ return 1.0f;
+ if (eq < -1.0f)
+ return -1.0f;
+
+ return eq;
+ }
+
+ /**
+ * Retrieves an array of floats whose values represent a
+ * scaling factor that can be applied to linear samples
+ * in each band to provide the equalization represented by
+ * this instance.
+ *
+ * @return an array of factors that can be applied to the
+ * subbands.
+ */
+ float[] getBandFactors()
+ {
+ float[] factors = new float[BANDS];
+ for (int i=0, maxCount=BANDS; i<maxCount; i++)
+ {
+ factors[i] = getBandFactor(settings[i]);
+ }
+
+ return factors;
+ }
+
+ /**
+ * Converts an equalizer band setting to a sample factor.
+ * The factor is determined by the function f = 2^n where
+ * n is the equalizer band setting in the range [-1.0,1.0].
+ *
+ */
+ float getBandFactor(float eq)
+ {
+ if (eq==BAND_NOT_PRESENT)
+ return 0.0f;
+
+ float f = (float)Math.pow(2.0, eq);
+ return f;
+ }
+
+
+ static abstract public class EQFunction
+ {
+ /**
+ * Returns the setting of a band in the equalizer.
+ *
+ * @param band The index of the band to retrieve the setting
+ * for.
+ *
+ * @return the setting of the specified band. This is a value between
+ * -1 and +1.
+ */
+ public float getBand(int band)
+ {
+ return 0.0f;
+ }
+
+ }
+
+}
diff --git a/Robust/src/Tests/ssJava/mp3decoder/FrameDecoder.java b/Robust/src/Tests/ssJava/mp3decoder/FrameDecoder.java
new file mode 100644
index 00000000..12912f6e
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/FrameDecoder.java
@@ -0,0 +1,39 @@
+/*
+ * 09/26/08 throw exception on subbband alloc error: Christopher G. Jennings (cjennings@acm.org)
+ * 11/19/04 1.0 moved to LGPL.
+ * 12/12/99 Initial version. mdm@techie.com
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+
+package javazoom.jl.decoder;
+
+/**
+ * Implementations of FrameDecoder are responsible for decoding
+ * an MPEG audio frame.
+ *
+ */
+//REVIEW: the interface currently is too thin. There should be
+// methods to specify the output buffer, the synthesis filters and
+// possibly other objects used by the decoder.
+public interface FrameDecoder
+{
+ /**
+ * Decodes one frame of MPEG audio.
+ */
+ public void decodeFrame() throws DecoderException;
+
+}
diff --git a/Robust/src/Tests/ssJava/mp3decoder/Header.java b/Robust/src/Tests/ssJava/mp3decoder/Header.java
new file mode 100644
index 00000000..a36572dc
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/Header.java
@@ -0,0 +1,762 @@
+/*
+ * 11/19/04 : 1.0 moved to LGPL.
+ * VBRI header support added, E.B javalayer@javazoom.net
+ *
+ * 12/04/03 : VBR (XING) header support added, E.B javalayer@javazoom.net
+ *
+ * 02/13/99 : Java Conversion by JavaZOOM , E.B javalayer@javazoom.net
+ *
+ * Declarations for MPEG header class
+ * A few layer III, MPEG-2 LSF, and seeking modifications made by Jeff Tsay.
+ * Last modified : 04/19/97
+ *
+ * @(#) header.h 1.7, last edit: 6/15/94 16:55:33
+ * @(#) Copyright (C) 1993, 1994 Tobias Bading (bading@cs.tu-berlin.de)
+ * @(#) Berlin University of Technology
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+package javazoom.jl.decoder;
+
+/**
+ * Class for extracting information from a frame header.
+ */
+public final class Header
+{
+ public static final int[][] frequencies =
+ {{22050, 24000, 16000, 1},
+ {44100, 48000, 32000, 1},
+ {11025, 12000, 8000, 1}}; // SZD: MPEG25
+
+ /**
+ * Constant for MPEG-2 LSF version
+ */
+ public static final int MPEG2_LSF = 0;
+ public static final int MPEG25_LSF = 2; // SZD
+
+ /**
+ * Constant for MPEG-1 version
+ */
+ public static final int MPEG1 = 1;
+
+ public static final int STEREO = 0;
+ public static final int JOINT_STEREO = 1;
+ public static final int DUAL_CHANNEL = 2;
+ public static final int SINGLE_CHANNEL = 3;
+ public static final int FOURTYFOUR_POINT_ONE = 0;
+ public static final int FOURTYEIGHT=1;
+ public static final int THIRTYTWO=2;
+
+ private int h_layer, h_protection_bit, h_bitrate_index,
+ h_padding_bit, h_mode_extension;
+ private int h_version;
+ private int h_mode;
+ private int h_sample_frequency;
+ private int h_number_of_subbands, h_intensity_stereo_bound;
+ private boolean h_copyright, h_original;
+ // VBR support added by E.B
+ private double[] h_vbr_time_per_frame = {-1, 384, 1152, 1152};
+ private boolean h_vbr;
+ private int h_vbr_frames;
+ private int h_vbr_scale;
+ private int h_vbr_bytes;
+ private byte[] h_vbr_toc;
+
+ private byte syncmode = Bitstream.INITIAL_SYNC;
+ private Crc16 crc;
+
+ public short checksum;
+ public int framesize;
+ public int nSlots;
+
+ private int _headerstring = -1; // E.B
+
+ Header()
+ {
+ }
+ public String toString()
+ {
+ StringBuffer buffer = new StringBuffer(200);
+ buffer.append("Layer ");
+ buffer.append(layer_string());
+ buffer.append(" frame ");
+ buffer.append(mode_string());
+ buffer.append(' ');
+ buffer.append(version_string());
+ if (!checksums())
+ buffer.append(" no");
+ buffer.append(" checksums");
+ buffer.append(' ');
+ buffer.append(sample_frequency_string());
+ buffer.append(',');
+ buffer.append(' ');
+ buffer.append(bitrate_string());
+
+ String s = buffer.toString();
+ return s;
+ }
+
+ /**
+ * Read a 32-bit header from the bitstream.
+ */
+ void read_header(Bitstream stream, Crc16[] crcp) throws BitstreamException
+ {
+ int headerstring;
+ int channel_bitrate;
+ boolean sync = false;
+ do
+ {
+ headerstring = stream.syncHeader(syncmode);
+ _headerstring = headerstring; // E.B
+ if (syncmode == Bitstream.INITIAL_SYNC)
+ {
+ h_version = ((headerstring >>> 19) & 1);
+ if (((headerstring >>> 20) & 1) == 0) // SZD: MPEG2.5 detection
+ if (h_version == MPEG2_LSF)
+ h_version = MPEG25_LSF;
+ else
+ throw stream.newBitstreamException(Bitstream.UNKNOWN_ERROR);
+ if ((h_sample_frequency = ((headerstring >>> 10) & 3)) == 3)
+ {
+ throw stream.newBitstreamException(Bitstream.UNKNOWN_ERROR);
+ }
+ }
+ h_layer = 4 - (headerstring >>> 17) & 3;
+ h_protection_bit = (headerstring >>> 16) & 1;
+ h_bitrate_index = (headerstring >>> 12) & 0xF;
+ h_padding_bit = (headerstring >>> 9) & 1;
+ h_mode = ((headerstring >>> 6) & 3);
+ h_mode_extension = (headerstring >>> 4) & 3;
+ if (h_mode == JOINT_STEREO)
+ h_intensity_stereo_bound = (h_mode_extension << 2) + 4;
+ else
+ h_intensity_stereo_bound = 0; // should never be used
+ if (((headerstring >>> 3) & 1) == 1)
+ h_copyright = true;
+ if (((headerstring >>> 2) & 1) == 1)
+ h_original = true;
+ // calculate number of subbands:
+ if (h_layer == 1)
+ h_number_of_subbands = 32;
+ else
+ {
+ channel_bitrate = h_bitrate_index;
+ // calculate bitrate per channel:
+ if (h_mode != SINGLE_CHANNEL)
+ if (channel_bitrate == 4)
+ channel_bitrate = 1;
+ else
+ channel_bitrate -= 4;
+ if ((channel_bitrate == 1) || (channel_bitrate == 2))
+ if (h_sample_frequency == THIRTYTWO)
+ h_number_of_subbands = 12;
+ else
+ h_number_of_subbands = 8;
+ else if ((h_sample_frequency == FOURTYEIGHT) || ((channel_bitrate >= 3) && (channel_bitrate <= 5)))
+ h_number_of_subbands = 27;
+ else
+ h_number_of_subbands = 30;
+ }
+ if (h_intensity_stereo_bound > h_number_of_subbands)
+ h_intensity_stereo_bound = h_number_of_subbands;
+ // calculate framesize and nSlots
+ calculate_framesize();
+ // read framedata:
+ int framesizeloaded = stream.read_frame_data(framesize);
+ if ((framesize >=0) && (framesizeloaded != framesize))
+ {
+ // Data loaded does not match to expected framesize,
+ // it might be an ID3v1 TAG. (Fix 11/17/04).
+ throw stream.newBitstreamException(Bitstream.INVALIDFRAME);
+ }
+ if (stream.isSyncCurrentPosition(syncmode))
+ {
+ if (syncmode == Bitstream.INITIAL_SYNC)
+ {
+ syncmode = Bitstream.STRICT_SYNC;
+ stream.set_syncword(headerstring & 0xFFF80CC0);
+ }
+ sync = true;
+ }
+ else
+ {
+ stream.unreadFrame();
+ }
+ }
+ while (!sync);
+ stream.parse_frame();
+ if (h_protection_bit == 0)
+ {
+ // frame contains a crc checksum
+ checksum = (short) stream.get_bits(16);
+ if (crc == null)
+ crc = new Crc16();
+ crc.add_bits(headerstring, 16);
+ crcp[0] = crc;
+ }
+ else
+ crcp[0] = null;
+ if (h_sample_frequency == FOURTYFOUR_POINT_ONE)
+ {
+ /*
+ if (offset == null)
+ {
+ int max = max_number_of_frames(stream);
+ offset = new int[max];
+ for(int i=0; i<max; i++) offset[i] = 0;
+ }
+ // E.B : Investigate more
+ int cf = stream.current_frame();
+ int lf = stream.last_frame();
+ if ((cf > 0) && (cf == lf))
+ {
+ offset[cf] = offset[cf-1] + h_padding_bit;
+ }
+ else
+ {
+ offset[0] = h_padding_bit;
+ }
+ */
+ }
+ }
+
+ /**
+ * Parse frame to extract optionnal VBR frame.
+ * @param firstframe
+ * @author E.B (javalayer@javazoom.net)
+ */
+ void parseVBR(byte[] firstframe) throws BitstreamException
+ {
+ // Trying Xing header.
+ String xing = "Xing";
+ byte tmp[] = new byte[4];
+ int offset = 0;
+ // Compute "Xing" offset depending on MPEG version and channels.
+ if (h_version == MPEG1)
+ {
+ if (h_mode == SINGLE_CHANNEL) offset=21-4;
+ else offset=36-4;
+ }
+ else
+ {
+ if (h_mode == SINGLE_CHANNEL) offset=13-4;
+ else offset = 21-4;
+ }
+ try
+ {
+ System.arraycopy(firstframe, offset, tmp, 0, 4);
+ // Is "Xing" ?
+ if (xing.equals(new String(tmp)))
+ {
+ //Yes.
+ h_vbr = true;
+ h_vbr_frames = -1;
+ h_vbr_bytes = -1;
+ h_vbr_scale = -1;
+ h_vbr_toc = new byte[100];
+
+ int length = 4;
+ // Read flags.
+ byte flags[] = new byte[4];
+ System.arraycopy(firstframe, offset + length, flags, 0, flags.length);
+ length += flags.length;
+ // Read number of frames (if available).
+ if ((flags[3] & (byte) (1 << 0)) != 0)
+ {
+ System.arraycopy(firstframe, offset + length, tmp, 0, tmp.length);
+ h_vbr_frames = (tmp[0] << 24)&0xFF000000 | (tmp[1] << 16)&0x00FF0000 | (tmp[2] << 8)&0x0000FF00 | tmp[3]&0x000000FF;
+ length += 4;
+ }
+ // Read size (if available).
+ if ((flags[3] & (byte) (1 << 1)) != 0)
+ {
+ System.arraycopy(firstframe, offset + length, tmp, 0, tmp.length);
+ h_vbr_bytes = (tmp[0] << 24)&0xFF000000 | (tmp[1] << 16)&0x00FF0000 | (tmp[2] << 8)&0x0000FF00 | tmp[3]&0x000000FF;
+ length += 4;
+ }
+ // Read TOC (if available).
+ if ((flags[3] & (byte) (1 << 2)) != 0)
+ {
+ System.arraycopy(firstframe, offset + length, h_vbr_toc, 0, h_vbr_toc.length);
+ length += h_vbr_toc.length;
+ }
+ // Read scale (if available).
+ if ((flags[3] & (byte) (1 << 3)) != 0)
+ {
+ System.arraycopy(firstframe, offset + length, tmp, 0, tmp.length);
+ h_vbr_scale = (tmp[0] << 24)&0xFF000000 | (tmp[1] << 16)&0x00FF0000 | (tmp[2] << 8)&0x0000FF00 | tmp[3]&0x000000FF;
+ length += 4;
+ }
+ //System.out.println("VBR:"+xing+" Frames:"+ h_vbr_frames +" Size:"+h_vbr_bytes);
+ }
+ }
+ catch (ArrayIndexOutOfBoundsException e)
+ {
+ throw new BitstreamException("XingVBRHeader Corrupted",e);
+ }
+
+ // Trying VBRI header.
+ String vbri = "VBRI";
+ offset = 36-4;
+ try
+ {
+ System.arraycopy(firstframe, offset, tmp, 0, 4);
+ // Is "VBRI" ?
+ if (vbri.equals(new String(tmp)))
+ {
+ //Yes.
+ h_vbr = true;
+ h_vbr_frames = -1;
+ h_vbr_bytes = -1;
+ h_vbr_scale = -1;
+ h_vbr_toc = new byte[100];
+ // Bytes.
+ int length = 4 + 6;
+ System.arraycopy(firstframe, offset + length, tmp, 0, tmp.length);
+ h_vbr_bytes = (tmp[0] << 24)&0xFF000000 | (tmp[1] << 16)&0x00FF0000 | (tmp[2] << 8)&0x0000FF00 | tmp[3]&0x000000FF;
+ length += 4;
+ // Frames.
+ System.arraycopy(firstframe, offset + length, tmp, 0, tmp.length);
+ h_vbr_frames = (tmp[0] << 24)&0xFF000000 | (tmp[1] << 16)&0x00FF0000 | (tmp[2] << 8)&0x0000FF00 | tmp[3]&0x000000FF;
+ length += 4;
+ //System.out.println("VBR:"+vbri+" Frames:"+ h_vbr_frames +" Size:"+h_vbr_bytes);
+ // TOC
+ // TODO
+ }
+ }
+ catch (ArrayIndexOutOfBoundsException e)
+ {
+ throw new BitstreamException("VBRIVBRHeader Corrupted",e);
+ }
+ }
+
+ // Functions to query header contents:
+ /**
+ * Returns version.
+ */
+ public int version() { return h_version; }
+
+ /**
+ * Returns Layer ID.
+ */
+ public int layer() { return h_layer; }
+
+ /**
+ * Returns bitrate index.
+ */
+ public int bitrate_index() { return h_bitrate_index; }
+
+ /**
+ * Returns Sample Frequency.
+ */
+ public int sample_frequency() { return h_sample_frequency; }
+
+ /**
+ * Returns Frequency.
+ */
+ public int frequency() {return frequencies[h_version][h_sample_frequency];}
+
+ /**
+ * Returns Mode.
+ */
+ public int mode() { return h_mode; }
+
+ /**
+ * Returns Protection bit.
+ */
+ public boolean checksums()
+ {
+ if (h_protection_bit == 0) return true;
+ else return false;
+ }
+
+ /**
+ * Returns Copyright.
+ */
+ public boolean copyright() { return h_copyright; }
+
+ /**
+ * Returns Original.
+ */
+ public boolean original() { return h_original; }
+
+ /**
+ * Return VBR.
+ * @return true if VBR header is found
+ */
+ public boolean vbr() { return h_vbr; }
+
+ /**
+ * Return VBR scale.
+ * @return scale of -1 if not available
+ */
+ public int vbr_scale() { return h_vbr_scale; }
+
+ /**
+ * Return VBR TOC.
+ * @return vbr toc ot null if not available
+ */
+ public byte[] vbr_toc() { return h_vbr_toc; }
+
+ /**
+ * Returns Checksum flag.
+ * Compares computed checksum with stream checksum.
+ */
+ public boolean checksum_ok () { return (checksum == crc.checksum()); }
+
+ // Seeking and layer III stuff
+ /**
+ * Returns Layer III Padding bit.
+ */
+ public boolean padding()
+ {
+ if (h_padding_bit == 0) return false;
+ else return true;
+ }
+
+ /**
+ * Returns Slots.
+ */
+ public int slots() { return nSlots; }
+
+ /**
+ * Returns Mode Extension.
+ */
+ public int mode_extension() { return h_mode_extension; }
+
+ // E.B -> private to public
+ public static final int bitrates[][][] = {
+ {{0 /*free format*/, 32000, 48000, 56000, 64000, 80000, 96000,
+ 112000, 128000, 144000, 160000, 176000, 192000 ,224000, 256000, 0},
+ {0 /*free format*/, 8000, 16000, 24000, 32000, 40000, 48000,
+ 56000, 64000, 80000, 96000, 112000, 128000, 144000, 160000, 0},
+ {0 /*free format*/, 8000, 16000, 24000, 32000, 40000, 48000,
+ 56000, 64000, 80000, 96000, 112000, 128000, 144000, 160000, 0}},
+
+ {{0 /*free format*/, 32000, 64000, 96000, 128000, 160000, 192000,
+ 224000, 256000, 288000, 320000, 352000, 384000, 416000, 448000, 0},
+ {0 /*free format*/, 32000, 48000, 56000, 64000, 80000, 96000,
+ 112000, 128000, 160000, 192000, 224000, 256000, 320000, 384000, 0},
+ {0 /*free format*/, 32000, 40000, 48000, 56000, 64000, 80000,
+ 96000, 112000, 128000, 160000, 192000, 224000, 256000, 320000, 0}},
+ // SZD: MPEG2.5
+ {{0 /*free format*/, 32000, 48000, 56000, 64000, 80000, 96000,
+ 112000, 128000, 144000, 160000, 176000, 192000 ,224000, 256000, 0},
+ {0 /*free format*/, 8000, 16000, 24000, 32000, 40000, 48000,
+ 56000, 64000, 80000, 96000, 112000, 128000, 144000, 160000, 0},
+ {0 /*free format*/, 8000, 16000, 24000, 32000, 40000, 48000,
+ 56000, 64000, 80000, 96000, 112000, 128000, 144000, 160000, 0}},
+
+ };
+
+ // E.B -> private to public
+ /**
+ * Calculate Frame size.
+ * Calculates framesize in bytes excluding header size.
+ */
+ public int calculate_framesize()
+ {
+
+ if (h_layer == 1)
+ {
+ framesize = (12 * bitrates[h_version][0][h_bitrate_index]) /
+ frequencies[h_version][h_sample_frequency];
+ if (h_padding_bit != 0 ) framesize++;
+ framesize <<= 2; // one slot is 4 bytes long
+ nSlots = 0;
+ }
+ else
+ {
+ framesize = (144 * bitrates[h_version][h_layer - 1][h_bitrate_index]) /
+ frequencies[h_version][h_sample_frequency];
+ if (h_version == MPEG2_LSF || h_version == MPEG25_LSF) framesize >>= 1; // SZD
+ if (h_padding_bit != 0) framesize++;
+ // Layer III slots
+ if (h_layer == 3)
+ {
+ if (h_version == MPEG1)
+ {
+ nSlots = framesize - ((h_mode == SINGLE_CHANNEL) ? 17 : 32) // side info size
+ - ((h_protection_bit!=0) ? 0 : 2) // CRC size
+ - 4; // header size
+ }
+ else
+ { // MPEG-2 LSF, SZD: MPEG-2.5 LSF
+ nSlots = framesize - ((h_mode == SINGLE_CHANNEL) ? 9 : 17) // side info size
+ - ((h_protection_bit!=0) ? 0 : 2) // CRC size
+ - 4; // header size
+ }
+ }
+ else
+ {
+ nSlots = 0;
+ }
+ }
+ framesize -= 4; // subtract header size
+ return framesize;
+ }
+
+ /**
+ * Returns the maximum number of frames in the stream.
+ * @param streamsize
+ * @return number of frames
+ */
+ public int max_number_of_frames(int streamsize) // E.B
+ {
+ if (h_vbr == true) return h_vbr_frames;
+ else
+ {
+ if ((framesize + 4 - h_padding_bit) == 0) return 0;
+ else return(streamsize / (framesize + 4 - h_padding_bit));
+ }
+ }
+
+ /**
+ * Returns the maximum number of frames in the stream.
+ * @param streamsize
+ * @return number of frames
+ */
+ public int min_number_of_frames(int streamsize) // E.B
+ {
+ if (h_vbr == true) return h_vbr_frames;
+ else
+ {
+ if ((framesize + 5 - h_padding_bit) == 0) return 0;
+ else return(streamsize / (framesize + 5 - h_padding_bit));
+ }
+ }
+
+
+ /**
+ * Returns ms/frame.
+ * @return milliseconds per frame
+ */
+ public float ms_per_frame() // E.B
+ {
+ if (h_vbr == true)
+ {
+ double tpf = h_vbr_time_per_frame[layer()] / frequency();
+ if ((h_version == MPEG2_LSF) || (h_version == MPEG25_LSF)) tpf /= 2;
+ return ((float) (tpf * 1000));
+ }
+ else
+ {
+ float ms_per_frame_array[][] = {{8.707483f, 8.0f, 12.0f},
+ {26.12245f, 24.0f, 36.0f},
+ {26.12245f, 24.0f, 36.0f}};
+ return(ms_per_frame_array[h_layer-1][h_sample_frequency]);
+ }
+ }
+
+ /**
+ * Returns total ms.
+ * @param streamsize
+ * @return total milliseconds
+ */
+ public float total_ms(int streamsize) // E.B
+ {
+ return(max_number_of_frames(streamsize) * ms_per_frame());
+ }
+
+ /**
+ * Returns synchronized header.
+ */
+ public int getSyncHeader() // E.B
+ {
+ return _headerstring;
+ }
+
+ // functions which return header informations as strings:
+ /**
+ * Return Layer version.
+ */
+ public String layer_string()
+ {
+ switch (h_layer)
+ {
+ case 1:
+ return "I";
+ case 2:
+ return "II";
+ case 3:
+ return "III";
+ }
+ return null;
+ }
+
+ // E.B -> private to public
+ public static final String bitrate_str[][][] = {
+ {{"free format", "32 kbit/s", "48 kbit/s", "56 kbit/s", "64 kbit/s",
+ "80 kbit/s", "96 kbit/s", "112 kbit/s", "128 kbit/s", "144 kbit/s",
+ "160 kbit/s", "176 kbit/s", "192 kbit/s", "224 kbit/s", "256 kbit/s",
+ "forbidden"},
+ {"free format", "8 kbit/s", "16 kbit/s", "24 kbit/s", "32 kbit/s",
+ "40 kbit/s", "48 kbit/s", "56 kbit/s", "64 kbit/s", "80 kbit/s",
+ "96 kbit/s", "112 kbit/s", "128 kbit/s", "144 kbit/s", "160 kbit/s",
+ "forbidden"},
+ {"free format", "8 kbit/s", "16 kbit/s", "24 kbit/s", "32 kbit/s",
+ "40 kbit/s", "48 kbit/s", "56 kbit/s", "64 kbit/s", "80 kbit/s",
+ "96 kbit/s", "112 kbit/s", "128 kbit/s", "144 kbit/s", "160 kbit/s",
+ "forbidden"}},
+
+ {{"free format", "32 kbit/s", "64 kbit/s", "96 kbit/s", "128 kbit/s",
+ "160 kbit/s", "192 kbit/s", "224 kbit/s", "256 kbit/s", "288 kbit/s",
+ "320 kbit/s", "352 kbit/s", "384 kbit/s", "416 kbit/s", "448 kbit/s",
+ "forbidden"},
+ {"free format", "32 kbit/s", "48 kbit/s", "56 kbit/s", "64 kbit/s",
+ "80 kbit/s", "96 kbit/s", "112 kbit/s", "128 kbit/s", "160 kbit/s",
+ "192 kbit/s", "224 kbit/s", "256 kbit/s", "320 kbit/s", "384 kbit/s",
+ "forbidden"},
+ {"free format", "32 kbit/s", "40 kbit/s", "48 kbit/s", "56 kbit/s",
+ "64 kbit/s", "80 kbit/s" , "96 kbit/s", "112 kbit/s", "128 kbit/s",
+ "160 kbit/s", "192 kbit/s", "224 kbit/s", "256 kbit/s", "320 kbit/s",
+ "forbidden"}},
+ // SZD: MPEG2.5
+ {{"free format", "32 kbit/s", "48 kbit/s", "56 kbit/s", "64 kbit/s",
+ "80 kbit/s", "96 kbit/s", "112 kbit/s", "128 kbit/s", "144 kbit/s",
+ "160 kbit/s", "176 kbit/s", "192 kbit/s", "224 kbit/s", "256 kbit/s",
+ "forbidden"},
+ {"free format", "8 kbit/s", "16 kbit/s", "24 kbit/s", "32 kbit/s",
+ "40 kbit/s", "48 kbit/s", "56 kbit/s", "64 kbit/s", "80 kbit/s",
+ "96 kbit/s", "112 kbit/s", "128 kbit/s", "144 kbit/s", "160 kbit/s",
+ "forbidden"},
+ {"free format", "8 kbit/s", "16 kbit/s", "24 kbit/s", "32 kbit/s",
+ "40 kbit/s", "48 kbit/s", "56 kbit/s", "64 kbit/s", "80 kbit/s",
+ "96 kbit/s", "112 kbit/s", "128 kbit/s", "144 kbit/s", "160 kbit/s",
+ "forbidden"}},
+ };
+
+ /**
+ * Return Bitrate.
+ * @return bitrate in bps
+ */
+ public String bitrate_string()
+ {
+ if (h_vbr == true)
+ {
+ return Integer.toString(bitrate()/1000)+" kb/s";
+ }
+ else return bitrate_str[h_version][h_layer - 1][h_bitrate_index];
+ }
+
+ /**
+ * Return Bitrate.
+ * @return bitrate in bps and average bitrate for VBR header
+ */
+ public int bitrate()
+ {
+ if (h_vbr == true)
+ {
+ return ((int) ((h_vbr_bytes * 8) / (ms_per_frame() * h_vbr_frames)))*1000;
+ }
+ else return bitrates[h_version][h_layer - 1][h_bitrate_index];
+ }
+
+ /**
+ * Return Instant Bitrate.
+ * Bitrate for VBR is not constant.
+ * @return bitrate in bps
+ */
+ public int bitrate_instant()
+ {
+ return bitrates[h_version][h_layer - 1][h_bitrate_index];
+ }
+
+ /**
+ * Returns Frequency
+ * @return frequency string in kHz
+ */
+ public String sample_frequency_string()
+ {
+ switch (h_sample_frequency)
+ {
+ case THIRTYTWO:
+ if (h_version == MPEG1)
+ return "32 kHz";
+ else if (h_version == MPEG2_LSF)
+ return "16 kHz";
+ else // SZD
+ return "8 kHz";
+ case FOURTYFOUR_POINT_ONE:
+ if (h_version == MPEG1)
+ return "44.1 kHz";
+ else if (h_version == MPEG2_LSF)
+ return "22.05 kHz";
+ else // SZD
+ return "11.025 kHz";
+ case FOURTYEIGHT:
+ if (h_version == MPEG1)
+ return "48 kHz";
+ else if (h_version == MPEG2_LSF)
+ return "24 kHz";
+ else // SZD
+ return "12 kHz";
+ }
+ return(null);
+ }
+
+ /**
+ * Returns Mode.
+ */
+ public String mode_string()
+ {
+ switch (h_mode)
+ {
+ case STEREO:
+ return "Stereo";
+ case JOINT_STEREO:
+ return "Joint stereo";
+ case DUAL_CHANNEL:
+ return "Dual channel";
+ case SINGLE_CHANNEL:
+ return "Single channel";
+ }
+ return null;
+ }
+
+ /**
+ * Returns Version.
+ * @return MPEG-1 or MPEG-2 LSF or MPEG-2.5 LSF
+ */
+ public String version_string()
+ {
+ switch (h_version)
+ {
+ case MPEG1:
+ return "MPEG-1";
+ case MPEG2_LSF:
+ return "MPEG-2 LSF";
+ case MPEG25_LSF: // SZD
+ return "MPEG-2.5 LSF";
+ }
+ return(null);
+ }
+
+ /**
+ * Returns the number of subbands in the current frame.
+ * @return number of subbands
+ */
+ public int number_of_subbands() {return h_number_of_subbands;}
+
+ /**
+ * Returns Intensity Stereo.
+ * (Layer II joint stereo only).
+ * Returns the number of subbands which are in stereo mode,
+ * subbands above that limit are in intensity stereo mode.
+ * @return intensity
+ */
+ public int intensity_stereo_bound() {return h_intensity_stereo_bound;}
+}
diff --git a/Robust/src/Tests/ssJava/mp3decoder/InputStreamSource.java b/Robust/src/Tests/ssJava/mp3decoder/InputStreamSource.java
new file mode 100644
index 00000000..fb6c0299
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/InputStreamSource.java
@@ -0,0 +1,80 @@
+/*
+ * 11/19/04 1.0 moved to LGPL.
+ * 12/12/99 Initial version. mdm@techie.com
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+
+package javazoom.jl.decoder;
+
+import java.io.IOException;
+import java.io.InputStream;
+
+/**
+ * <i>Work In Progress.</i>
+ *
+ * An instance of <code>InputStreamSource</code> implements a
+ * <code>Source</code> that provides data from an <code>InputStream
+ * </code>. Seeking functionality is not supported.
+ *
+ * @author MDM
+ */
+public class InputStreamSource implements Source
+{
+ private final InputStream in;
+
+ public InputStreamSource(InputStream in)
+ {
+ if (in==null)
+ throw new NullPointerException("in");
+
+ this.in = in;
+ }
+
+ public int read(byte[] b, int offs, int len)
+ throws IOException
+ {
+ int read = in.read(b, offs, len);
+ return read;
+ }
+
+ public boolean willReadBlock()
+ {
+ return true;
+ //boolean block = (in.available()==0);
+ //return block;
+ }
+
+ public boolean isSeekable()
+ {
+ return false;
+ }
+
+ public long tell()
+ {
+ return -1;
+ }
+
+ public long seek(long to)
+ {
+ return -1;
+ }
+
+ public long length()
+ {
+ return -1;
+ }
+}
diff --git a/Robust/src/Tests/ssJava/mp3decoder/JavaLayerError.java b/Robust/src/Tests/ssJava/mp3decoder/JavaLayerError.java
new file mode 100644
index 00000000..042d83a5
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/JavaLayerError.java
@@ -0,0 +1,31 @@
+/*
+ * 11/19/04 1.0 moved to LGPL.
+ * 12/12/99 Initial version. mdm@techie.com
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+
+package javazoom.jl.decoder;
+
+/**
+ * Work in progress.
+ *
+ * API usage errors may be handled by throwing an instance of this
+ * class, as per JMF 2.0.
+ */
+public class JavaLayerError extends Error
+{
+}
diff --git a/Robust/src/Tests/ssJava/mp3decoder/JavaLayerErrors.java b/Robust/src/Tests/ssJava/mp3decoder/JavaLayerErrors.java
new file mode 100644
index 00000000..b141ce84
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/JavaLayerErrors.java
@@ -0,0 +1,40 @@
+/*
+ * 11/19/04 1.0 moved to LGPL.
+ * 12/12/99 Initial version. mdm@techie.com
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+
+package javazoom.jl.decoder;
+
+/**
+ * Exception erorr codes for components of the JavaLayer API.
+ */
+public interface JavaLayerErrors
+{
+ /**
+ * The first bitstream error code. See the {@link DecoderErrors DecoderErrors}
+ * interface for other bitstream error codes.
+ */
+ static public final int BITSTREAM_ERROR = 0x100;
+
+ /**
+ * The first decoder error code. See the {@link DecoderErrors DecoderErrors}
+ * interface for other decoder error codes.
+ */
+ static public final int DECODER_ERROR = 0x200;
+
+}
diff --git a/Robust/src/Tests/ssJava/mp3decoder/JavaLayerException.java b/Robust/src/Tests/ssJava/mp3decoder/JavaLayerException.java
new file mode 100644
index 00000000..0767bf21
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/JavaLayerException.java
@@ -0,0 +1,80 @@
+/*
+ * 11/19/04 1.0 moved to LGPL.
+ * 12/12/99 Initial version. mdm@techie.com
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+
+package javazoom.jl.decoder;
+
+import java.io.PrintStream;
+
+
+/**
+ * The JavaLayerException is the base class for all API-level
+ * exceptions thrown by JavaLayer. To facilitate conversion and
+ * common handling of exceptions from other domains, the class
+ * can delegate some functionality to a contained Throwable instance.
+ * <p>
+ *
+ * @author MDM
+ */
+public class JavaLayerException extends Exception
+{
+
+ private Throwable exception;
+
+
+ public JavaLayerException()
+ {
+ }
+
+ public JavaLayerException(String msg)
+ {
+ super(msg);
+ }
+
+ public JavaLayerException(String msg, Throwable t)
+ {
+ super(msg);
+ exception = t;
+ }
+
+ public Throwable getException()
+ {
+ return exception;
+ }
+
+
+ public void printStackTrace()
+ {
+ printStackTrace(System.err);
+ }
+
+ public void printStackTrace(PrintStream ps)
+ {
+ if (this.exception==null)
+ {
+ super.printStackTrace(ps);
+ }
+ else
+ {
+ exception.printStackTrace();
+ }
+ }
+
+
+}
diff --git a/Robust/src/Tests/ssJava/mp3decoder/JavaLayerHook.java b/Robust/src/Tests/ssJava/mp3decoder/JavaLayerHook.java
new file mode 100644
index 00000000..edd890dd
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/JavaLayerHook.java
@@ -0,0 +1,36 @@
+/*
+ * 11/19/04 1.0 moved to LGPL.
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+
+package javazoom.jl.decoder;
+
+import java.io.InputStream;
+
+/**
+ * The <code>JavaLayerHooks</code> class allows developers to change
+ * the way the JavaLayer library uses Resources.
+ */
+
+public interface JavaLayerHook
+{
+ /**
+ * Retrieves the named resource. This allows resources to be
+ * obtained without specifying how they are retrieved.
+ */
+ public InputStream getResourceAsStream(String name);
+}
diff --git a/Robust/src/Tests/ssJava/mp3decoder/JavaLayerUtils.java b/Robust/src/Tests/ssJava/mp3decoder/JavaLayerUtils.java
new file mode 100644
index 00000000..b7cd5484
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/JavaLayerUtils.java
@@ -0,0 +1,207 @@
+/*
+ * 11/19/04 1.0 moved to LGPL.
+ * 12/12/99 Initial version. mdm@techie.com
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+
+package javazoom.jl.decoder;
+
+import java.io.IOException;
+import java.io.InputStream;
+import java.io.InvalidClassException;
+import java.io.InvalidObjectException;
+import java.io.ObjectInputStream;
+import java.io.ObjectOutputStream;
+import java.io.OutputStream;
+import java.lang.reflect.Array;
+
+/**
+ * The JavaLayerUtils class is not strictly part of the JavaLayer API.
+ * It serves to provide useful methods and system-wide hooks.
+ *
+ * @author MDM
+ */
+public class JavaLayerUtils
+{
+ static private JavaLayerHook hook = null;
+
+ /**
+ * Deserializes the object contained in the given input stream.
+ * @param in The input stream to deserialize an object from.
+ * @param cls The expected class of the deserialized object.
+ */
+ static public Object deserialize(InputStream in, Class cls)
+ throws IOException
+ {
+ if (cls==null)
+ throw new NullPointerException("cls");
+
+ Object obj = deserialize(in, cls);
+ if (!cls.isInstance(obj))
+ {
+ throw new InvalidObjectException("type of deserialized instance not of required class.");
+ }
+
+ return obj;
+ }
+
+ /**
+ * Deserializes an object from the given <code>InputStream</code>.
+ * The deserialization is delegated to an <code>
+ * ObjectInputStream</code> instance.
+ *
+ * @param in The <code>InputStream</code> to deserialize an object
+ * from.
+ *
+ * @return The object deserialized from the stream.
+ * @exception IOException is thrown if there was a problem reading
+ * the underlying stream, or an object could not be deserialized
+ * from the stream.
+ *
+ * @see java.io.ObjectInputStream
+ */
+ static public Object deserialize(InputStream in)
+ throws IOException
+ {
+ if (in==null)
+ throw new NullPointerException("in");
+
+ ObjectInputStream objIn = new ObjectInputStream(in);
+
+ Object obj;
+
+ try
+ {
+ obj = objIn.readObject();
+ }
+ catch (ClassNotFoundException ex)
+ {
+ throw new InvalidClassException(ex.toString());
+ }
+
+ return obj;
+ }
+
+ /**
+ * Deserializes an array from a given <code>InputStream</code>.
+ *
+ * @param in The <code>InputStream</code> to
+ * deserialize an object from.
+ *
+ * @param elemType The class denoting the type of the array
+ * elements.
+ * @param length The expected length of the array, or -1 if
+ * any length is expected.
+ */
+ static public Object deserializeArray(InputStream in, Class elemType, int length)
+ throws IOException
+ {
+ if (elemType==null)
+ throw new NullPointerException("elemType");
+
+ if (length<-1)
+ throw new IllegalArgumentException("length");
+
+ Object obj = deserialize(in);
+
+ Class cls = obj.getClass();
+
+
+ if (!cls.isArray())
+ throw new InvalidObjectException("object is not an array");
+
+ Class arrayElemType = cls.getComponentType();
+ if (arrayElemType!=elemType)
+ throw new InvalidObjectException("unexpected array component type");
+
+ if (length != -1)
+ {
+ int arrayLength = Array.getLength(obj);
+ if (arrayLength!=length)
+ throw new InvalidObjectException("array length mismatch");
+ }
+
+ return obj;
+ }
+
+ static public Object deserializeArrayResource(String name, Class elemType, int length)
+ throws IOException
+ {
+ InputStream str = getResourceAsStream(name);
+ if (str==null)
+ throw new IOException("unable to load resource '"+name+"'");
+
+ Object obj = deserializeArray(str, elemType, length);
+
+ return obj;
+ }
+
+ static public void serialize(OutputStream out, Object obj)
+ throws IOException
+ {
+ if (out==null)
+ throw new NullPointerException("out");
+
+ if (obj==null)
+ throw new NullPointerException("obj");
+
+ ObjectOutputStream objOut = new ObjectOutputStream(out);
+ objOut.writeObject(obj);
+
+ }
+
+ /**
+ * Sets the system-wide JavaLayer hook.
+ */
+ static synchronized public void setHook(JavaLayerHook hook0)
+ {
+ hook = hook0;
+ }
+
+ static synchronized public JavaLayerHook getHook()
+ {
+ return hook;
+ }
+
+ /**
+ * Retrieves an InputStream for a named resource.
+ *
+ * @param name The name of the resource. This must be a simple
+ * name, and not a qualified package name.
+ *
+ * @return The InputStream for the named resource, or null if
+ * the resource has not been found. If a hook has been
+ * provided, its getResourceAsStream() method is called
+ * to retrieve the resource.
+ */
+ static synchronized public InputStream getResourceAsStream(String name)
+ {
+ InputStream is = null;
+
+ if (hook!=null)
+ {
+ is = hook.getResourceAsStream(name);
+ }
+ else
+ {
+ Class cls = JavaLayerUtils.class;
+ is = cls.getResourceAsStream(name);
+ }
+
+ return is;
+ }
+}
diff --git a/Robust/src/Tests/ssJava/mp3decoder/LayerIDecoder.java b/Robust/src/Tests/ssJava/mp3decoder/LayerIDecoder.java
new file mode 100644
index 00000000..fb936d2b
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/LayerIDecoder.java
@@ -0,0 +1,448 @@
+/*
+ * 09/26/08 throw exception on subbband alloc error: Christopher G. Jennings (cjennings@acm.org)
+ *
+ * 11/19/04 1.0 moved to LGPL.
+ *
+ * 12/12/99 Initial version. Adapted from javalayer.java
+ * and Subband*.java. mdm@techie.com
+ *
+ * 02/28/99 Initial version : javalayer.java by E.B
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+
+package javazoom.jl.decoder;
+
+/**
+ * Implements decoding of MPEG Audio Layer I frames.
+ */
+class LayerIDecoder implements FrameDecoder
+{
+ protected Bitstream stream;
+ protected Header header;
+ protected SynthesisFilter filter1, filter2;
+ protected Obuffer buffer;
+ protected int which_channels;
+ protected int mode;
+
+ protected int num_subbands;
+ protected Subband[] subbands;
+ protected Crc16 crc = null; // new Crc16[1] to enable CRC checking.
+
+ public LayerIDecoder()
+ {
+ crc = new Crc16();
+ }
+
+ public void create(Bitstream stream0, Header header0,
+ SynthesisFilter filtera, SynthesisFilter filterb,
+ Obuffer buffer0, int which_ch0)
+ {
+ stream = stream0;
+ header = header0;
+ filter1 = filtera;
+ filter2 = filterb;
+ buffer = buffer0;
+ which_channels = which_ch0;
+
+ }
+
+ public void decodeFrame() throws DecoderException
+ {
+
+ num_subbands = header.number_of_subbands();
+ subbands = new Subband[32];
+ mode = header.mode();
+
+ createSubbands();
+
+ readAllocation();
+ readScaleFactorSelection();
+
+ if ((crc != null) || header.checksum_ok())
+ {
+ readScaleFactors();
+
+ readSampleData();
+ }
+
+ }
+
+ protected void createSubbands()
+ {
+ int i;
+ if (mode == Header.SINGLE_CHANNEL)
+ for (i = 0; i < num_subbands; ++i)
+ subbands[i] = new SubbandLayer1(i);
+ else if (mode == Header.JOINT_STEREO)
+ {
+ for (i = 0; i < header.intensity_stereo_bound(); ++i)
+ subbands[i] = new SubbandLayer1Stereo(i);
+ for (; i < num_subbands; ++i)
+ subbands[i] = new SubbandLayer1IntensityStereo(i);
+ }
+ else
+ {
+ for (i = 0; i < num_subbands; ++i)
+ subbands[i] = new SubbandLayer1Stereo(i);
+ }
+ }
+
+ protected void readAllocation() throws DecoderException
+ {
+ // start to read audio data:
+ for (int i = 0; i < num_subbands; ++i)
+ subbands[i].read_allocation(stream, header, crc);
+
+ }
+
+ protected void readScaleFactorSelection()
+ {
+ // scale factor selection not present for layer I.
+ }
+
+ protected void readScaleFactors()
+ {
+ for (int i = 0; i < num_subbands; ++i)
+ subbands[i].read_scalefactor(stream, header);
+ }
+
+ protected void readSampleData()
+ {
+ boolean read_ready = false;
+ boolean write_ready = false;
+ int mode = header.mode();
+ int i;
+ do
+ {
+ for (i = 0; i < num_subbands; ++i)
+ read_ready = subbands[i].read_sampledata(stream);
+ do
+ {
+ for (i = 0; i < num_subbands; ++i)
+ write_ready = subbands[i].put_next_sample(which_channels,filter1, filter2);
+
+ filter1.calculate_pcm_samples(buffer);
+ if ((which_channels == OutputChannels.BOTH_CHANNELS) && (mode != Header.SINGLE_CHANNEL))
+ filter2.calculate_pcm_samples(buffer);
+ } while (!write_ready);
+ } while (!read_ready);
+
+ }
+
+ /**
+ * Abstract base class for subband classes of layer I and II
+ */
+ static abstract class Subband
+ {
+ /*
+ * Changes from version 1.1 to 1.2:
+ * - array size increased by one, although a scalefactor with index 63
+ * is illegal (to prevent segmentation faults)
+ */
+ // Scalefactors for layer I and II, Annex 3-B.1 in ISO/IEC DIS 11172:
+ public static final float scalefactors[] =
+ {
+ 2.00000000000000f, 1.58740105196820f, 1.25992104989487f, 1.00000000000000f,
+ 0.79370052598410f, 0.62996052494744f, 0.50000000000000f, 0.39685026299205f,
+ 0.31498026247372f, 0.25000000000000f, 0.19842513149602f, 0.15749013123686f,
+ 0.12500000000000f, 0.09921256574801f, 0.07874506561843f, 0.06250000000000f,
+ 0.04960628287401f, 0.03937253280921f, 0.03125000000000f, 0.02480314143700f,
+ 0.01968626640461f, 0.01562500000000f, 0.01240157071850f, 0.00984313320230f,
+ 0.00781250000000f, 0.00620078535925f, 0.00492156660115f, 0.00390625000000f,
+ 0.00310039267963f, 0.00246078330058f, 0.00195312500000f, 0.00155019633981f,
+ 0.00123039165029f, 0.00097656250000f, 0.00077509816991f, 0.00061519582514f,
+ 0.00048828125000f, 0.00038754908495f, 0.00030759791257f, 0.00024414062500f,
+ 0.00019377454248f, 0.00015379895629f, 0.00012207031250f, 0.00009688727124f,
+ 0.00007689947814f, 0.00006103515625f, 0.00004844363562f, 0.00003844973907f,
+ 0.00003051757813f, 0.00002422181781f, 0.00001922486954f, 0.00001525878906f,
+ 0.00001211090890f, 0.00000961243477f, 0.00000762939453f, 0.00000605545445f,
+ 0.00000480621738f, 0.00000381469727f, 0.00000302772723f, 0.00000240310869f,
+ 0.00000190734863f, 0.00000151386361f, 0.00000120155435f, 0.00000000000000f /* illegal scalefactor */
+ };
+
+ public abstract void read_allocation (Bitstream stream, Header header, Crc16 crc) throws DecoderException;
+ public abstract void read_scalefactor (Bitstream stream, Header header);
+ public abstract boolean read_sampledata (Bitstream stream);
+ public abstract boolean put_next_sample (int channels, SynthesisFilter filter1, SynthesisFilter filter2);
+ };
+
+ /**
+ * Class for layer I subbands in single channel mode.
+ * Used for single channel mode
+ * and in derived class for intensity stereo mode
+ */
+ static class SubbandLayer1 extends Subband
+ {
+
+ // Factors and offsets for sample requantization
+ public static final float table_factor[] = {
+ 0.0f, (1.0f/2.0f) * (4.0f/3.0f), (1.0f/4.0f) * (8.0f/7.0f), (1.0f/8.0f) * (16.0f/15.0f),
+ (1.0f/16.0f) * (32.0f/31.0f), (1.0f/32.0f) * (64.0f/63.0f), (1.0f/64.0f) * (128.0f/127.0f),
+ (1.0f/128.0f) * (256.0f/255.0f), (1.0f/256.0f) * (512.0f/511.0f),
+ (1.0f/512.0f) * (1024.0f/1023.0f), (1.0f/1024.0f) * (2048.0f/2047.0f),
+ (1.0f/2048.0f) * (4096.0f/4095.0f), (1.0f/4096.0f) * (8192.0f/8191.0f),
+ (1.0f/8192.0f) * (16384.0f/16383.0f), (1.0f/16384.0f) * (32768.0f/32767.0f)
+ };
+
+ public static final float table_offset[] = {
+ 0.0f, ((1.0f/2.0f)-1.0f) * (4.0f/3.0f), ((1.0f/4.0f)-1.0f) * (8.0f/7.0f), ((1.0f/8.0f)-1.0f) * (16.0f/15.0f),
+ ((1.0f/16.0f)-1.0f) * (32.0f/31.0f), ((1.0f/32.0f)-1.0f) * (64.0f/63.0f), ((1.0f/64.0f)-1.0f) * (128.0f/127.0f),
+ ((1.0f/128.0f)-1.0f) * (256.0f/255.0f), ((1.0f/256.0f)-1.0f) * (512.0f/511.0f),
+ ((1.0f/512.0f)-1.0f) * (1024.0f/1023.0f), ((1.0f/1024.0f)-1.0f) * (2048.0f/2047.0f),
+ ((1.0f/2048.0f)-1.0f) * (4096.0f/4095.0f), ((1.0f/4096.0f)-1.0f) * (8192.0f/8191.0f),
+ ((1.0f/8192.0f)-1.0f) * (16384.0f/16383.0f), ((1.0f/16384.0f)-1.0f) * (32768.0f/32767.0f)
+ };
+
+ protected int subbandnumber;
+ protected int samplenumber;
+ protected int allocation;
+ protected float scalefactor;
+ protected int samplelength;
+ protected float sample;
+ protected float factor, offset;
+
+ /**
+ * Construtor.
+ */
+ public SubbandLayer1(int subbandnumber)
+ {
+ this.subbandnumber = subbandnumber;
+ samplenumber = 0;
+ }
+
+ /**
+ *
+ */
+ public void read_allocation(Bitstream stream, Header header, Crc16 crc) throws DecoderException
+ {
+ if ((allocation = stream.get_bits (4)) == 15)
+ {
+ // CGJ: catch this condition and throw appropriate exception
+ throw new DecoderException(DecoderErrors.ILLEGAL_SUBBAND_ALLOCATION, null);
+ // cerr << "WARNING: stream contains an illegal allocation!\n";
+ // MPEG-stream is corrupted!
+ }
+
+ if (crc != null) crc.add_bits (allocation, 4);
+ if (allocation != 0)
+ {
+ samplelength = allocation + 1;
+ factor = table_factor[allocation];
+ offset = table_offset[allocation];
+ }
+ }
+
+ /**
+ *
+ */
+ public void read_scalefactor(Bitstream stream, Header header)
+ {
+ if (allocation != 0) scalefactor = scalefactors[stream.get_bits(6)];
+ }
+
+ /**
+ *
+ */
+ public boolean read_sampledata(Bitstream stream)
+ {
+ if (allocation != 0)
+ {
+ sample = (float) (stream.get_bits(samplelength));
+ }
+ if (++samplenumber == 12)
+ {
+ samplenumber = 0;
+ return true;
+ }
+ return false;
+ }
+
+ /**
+ *
+ */
+ public boolean put_next_sample(int channels, SynthesisFilter filter1, SynthesisFilter filter2)
+ {
+ if ((allocation !=0) && (channels != OutputChannels.RIGHT_CHANNEL))
+ {
+ float scaled_sample = (sample * factor + offset) * scalefactor;
+ filter1.input_sample (scaled_sample, subbandnumber);
+ }
+ return true;
+ }
+ };
+
+ /**
+ * Class for layer I subbands in joint stereo mode.
+ */
+ static class SubbandLayer1IntensityStereo extends SubbandLayer1
+ {
+ protected float channel2_scalefactor;
+
+ /**
+ * Constructor
+ */
+ public SubbandLayer1IntensityStereo(int subbandnumber)
+ {
+ super(subbandnumber);
+ }
+
+ /**
+ *
+ */
+ public void read_allocation(Bitstream stream, Header header, Crc16 crc) throws DecoderException
+ {
+ super.read_allocation (stream, header, crc);
+ }
+
+ /**
+ *
+ */
+ public void read_scalefactor (Bitstream stream, Header header)
+ {
+ if (allocation != 0)
+ {
+ scalefactor = scalefactors[stream.get_bits(6)];
+ channel2_scalefactor = scalefactors[stream.get_bits(6)];
+ }
+ }
+
+ /**
+ *
+ */
+ public boolean read_sampledata(Bitstream stream)
+ {
+ return super.read_sampledata (stream);
+ }
+
+ /**
+ *
+ */
+ public boolean put_next_sample (int channels, SynthesisFilter filter1, SynthesisFilter filter2)
+ {
+ if (allocation !=0 )
+ {
+ sample = sample * factor + offset; // requantization
+ if (channels == OutputChannels.BOTH_CHANNELS)
+ {
+ float sample1 = sample * scalefactor,
+ sample2 = sample * channel2_scalefactor;
+ filter1.input_sample(sample1, subbandnumber);
+ filter2.input_sample(sample2, subbandnumber);
+ }
+ else if (channels == OutputChannels.LEFT_CHANNEL)
+ {
+ float sample1 = sample * scalefactor;
+ filter1.input_sample(sample1, subbandnumber);
+ }
+ else
+ {
+ float sample2 = sample * channel2_scalefactor;
+ filter1.input_sample(sample2, subbandnumber);
+ }
+ }
+ return true;
+ }
+ };
+
+ /**
+ * Class for layer I subbands in stereo mode.
+ */
+ static class SubbandLayer1Stereo extends SubbandLayer1
+ {
+ protected int channel2_allocation;
+ protected float channel2_scalefactor;
+ protected int channel2_samplelength;
+ protected float channel2_sample;
+ protected float channel2_factor, channel2_offset;
+
+
+ /**
+ * Constructor
+ */
+ public SubbandLayer1Stereo(int subbandnumber)
+ {
+ super(subbandnumber);
+ }
+
+ /**
+ *
+ */
+ public void read_allocation (Bitstream stream, Header header, Crc16 crc) throws DecoderException
+ {
+ allocation = stream.get_bits(4);
+ channel2_allocation = stream.get_bits(4);
+ if (crc != null)
+ {
+ crc.add_bits (allocation, 4);
+ crc.add_bits (channel2_allocation, 4);
+ }
+ if (allocation != 0)
+ {
+ samplelength = allocation + 1;
+ factor = table_factor[allocation];
+ offset = table_offset[allocation];
+ }
+ if (channel2_allocation != 0)
+ {
+ channel2_samplelength = channel2_allocation + 1;
+ channel2_factor = table_factor[channel2_allocation];
+ channel2_offset = table_offset[channel2_allocation];
+ }
+ }
+
+ /**
+ *
+ */
+ public void read_scalefactor(Bitstream stream, Header header)
+ {
+ if (allocation != 0) scalefactor = scalefactors[stream.get_bits(6)];
+ if (channel2_allocation != 0) channel2_scalefactor = scalefactors[stream.get_bits(6)];
+ }
+
+ /**
+ *
+ */
+ public boolean read_sampledata (Bitstream stream)
+ {
+ boolean returnvalue = super.read_sampledata(stream);
+ if (channel2_allocation != 0)
+ {
+ channel2_sample = (float) (stream.get_bits(channel2_samplelength));
+ }
+ return(returnvalue);
+ }
+
+ /**
+ *
+ */
+ public boolean put_next_sample(int channels, SynthesisFilter filter1, SynthesisFilter filter2)
+ {
+ super.put_next_sample (channels, filter1, filter2);
+ if ((channel2_allocation != 0) && (channels != OutputChannels.LEFT_CHANNEL))
+ {
+ float sample2 = (channel2_sample * channel2_factor + channel2_offset) *
+ channel2_scalefactor;
+ if (channels == OutputChannels.BOTH_CHANNELS)
+ filter2.input_sample (sample2, subbandnumber);
+ else
+ filter1.input_sample (sample2, subbandnumber);
+ }
+ return true;
+ }
+ };
+
+}
diff --git a/Robust/src/Tests/ssJava/mp3decoder/LayerIIDecoder.java b/Robust/src/Tests/ssJava/mp3decoder/LayerIIDecoder.java
new file mode 100644
index 00000000..7265b1f8
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/LayerIIDecoder.java
@@ -0,0 +1,1064 @@
+/*
+ * 11/19/04 1.0 moved to LGPL.
+ *
+ * 29/05/01 Michael Scheerer, Fixed some C++ to Java porting bugs.
+ *
+ * 16/07/01 Michael Scheerer, Catched a bug in method
+ * read_sampledata, which causes an outOfIndexException.
+ *
+ * 12/12/99 Initial version. Adapted from javalayer.java
+ * and Subband*.java. mdm@techie.com
+ *
+ * 02/28/99 Initial version : javalayer.java by E.B
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+
+package javazoom.jl.decoder;
+
+/**
+ * Implements decoding of MPEG Audio Layer II frames.
+ */
+class LayerIIDecoder extends LayerIDecoder implements FrameDecoder
+{
+
+ public LayerIIDecoder()
+ {
+ }
+
+
+ protected void createSubbands()
+ {
+ int i;
+ if (mode == Header.SINGLE_CHANNEL)
+ for (i = 0; i < num_subbands; ++i)
+ subbands[i] = new SubbandLayer2(i);
+ else if (mode == Header.JOINT_STEREO)
+ {
+ for (i = 0; i < header.intensity_stereo_bound(); ++i)
+ subbands[i] = new SubbandLayer2Stereo(i);
+ for (; i < num_subbands; ++i)
+ subbands[i] = new SubbandLayer2IntensityStereo(i);
+ }
+ else
+ {
+ for (i = 0; i < num_subbands; ++i)
+ subbands[i] = new SubbandLayer2Stereo(i);
+ }
+
+ }
+
+ protected void readScaleFactorSelection()
+ {
+ for (int i = 0; i < num_subbands; ++i)
+ ((SubbandLayer2)subbands[i]).read_scalefactor_selection(stream, crc);
+ }
+
+
+
+ /**
+ * Class for layer II subbands in single channel mode.
+ */
+ static class SubbandLayer2 extends Subband
+ {
+ // this table contains 3 requantized samples for each legal codeword
+ // when grouped in 5 bits, i.e. 3 quantizationsteps per sample
+ public static final float grouping_5bits[] = new float[]
+ {
+ -2.0f/3.0f, -2.0f/3.0f, -2.0f/3.0f,
+ 0.0f, -2.0f/3.0f, -2.0f/3.0f,
+ 2.0f/3.0f, -2.0f/3.0f, -2.0f/3.0f,
+ -2.0f/3.0f, 0.0f, -2.0f/3.0f,
+ 0.0f, 0.0f, -2.0f/3.0f,
+ 2.0f/3.0f, 0.0f, -2.0f/3.0f,
+ -2.0f/3.0f, 2.0f/3.0f, -2.0f/3.0f,
+ 0.0f, 2.0f/3.0f, -2.0f/3.0f,
+ 2.0f/3.0f, 2.0f/3.0f, -2.0f/3.0f,
+ -2.0f/3.0f, -2.0f/3.0f, 0.0f,
+ 0.0f, -2.0f/3.0f, 0.0f,
+ 2.0f/3.0f, -2.0f/3.0f, 0.0f,
+ -2.0f/3.0f, 0.0f, 0.0f,
+ 0.0f, 0.0f, 0.0f,
+ 2.0f/3.0f, 0.0f, 0.0f,
+ -2.0f/3.0f, 2.0f/3.0f, 0.0f,
+ 0.0f, 2.0f/3.0f, 0.0f,
+ 2.0f/3.0f, 2.0f/3.0f, 0.0f,
+ -2.0f/3.0f, -2.0f/3.0f, 2.0f/3.0f,
+ 0.0f, -2.0f/3.0f, 2.0f/3.0f,
+ 2.0f/3.0f, -2.0f/3.0f, 2.0f/3.0f,
+ -2.0f/3.0f, 0.0f, 2.0f/3.0f,
+ 0.0f, 0.0f, 2.0f/3.0f,
+ 2.0f/3.0f, 0.0f, 2.0f/3.0f,
+ -2.0f/3.0f, 2.0f/3.0f, 2.0f/3.0f,
+ 0.0f, 2.0f/3.0f, 2.0f/3.0f,
+ 2.0f/3.0f, 2.0f/3.0f, 2.0f/3.0f
+ };
+
+ // this table contains 3 requantized samples for each legal codeword
+ // when grouped in 7 bits, i.e. 5 quantizationsteps per sample
+ public static final float grouping_7bits[] = new float[]
+ {
+ -0.8f, -0.8f, -0.8f, -0.4f, -0.8f, -0.8f, 0.0f, -0.8f, -0.8f, 0.4f, -0.8f, -0.8f, 0.8f, -0.8f, -0.8f,
+ -0.8f, -0.4f, -0.8f, -0.4f, -0.4f, -0.8f, 0.0f, -0.4f, -0.8f, 0.4f, -0.4f, -0.8f, 0.8f, -0.4f, -0.8f,
+ -0.8f, 0.0f, -0.8f, -0.4f, 0.0f, -0.8f, 0.0f, 0.0f, -0.8f, 0.4f, 0.0f, -0.8f, 0.8f, 0.0f, -0.8f,
+ -0.8f, 0.4f, -0.8f, -0.4f, 0.4f, -0.8f, 0.0f, 0.4f, -0.8f, 0.4f, 0.4f, -0.8f, 0.8f, 0.4f, -0.8f,
+ -0.8f, 0.8f, -0.8f, -0.4f, 0.8f, -0.8f, 0.0f, 0.8f, -0.8f, 0.4f, 0.8f, -0.8f, 0.8f, 0.8f, -0.8f,
+ -0.8f, -0.8f, -0.4f, -0.4f, -0.8f, -0.4f, 0.0f, -0.8f, -0.4f, 0.4f, -0.8f, -0.4f, 0.8f, -0.8f, -0.4f,
+ -0.8f, -0.4f, -0.4f, -0.4f, -0.4f, -0.4f, 0.0f, -0.4f, -0.4f, 0.4f, -0.4f, -0.4f, 0.8f, -0.4f, -0.4f,
+ -0.8f, 0.0f, -0.4f, -0.4f, 0.0f, -0.4f, 0.0f, 0.0f, -0.4f, 0.4f, 0.0f, -0.4f, 0.8f, 0.0f, -0.4f,
+ -0.8f, 0.4f, -0.4f, -0.4f, 0.4f, -0.4f, 0.0f, 0.4f, -0.4f, 0.4f, 0.4f, -0.4f, 0.8f, 0.4f, -0.4f,
+ -0.8f, 0.8f, -0.4f, -0.4f, 0.8f, -0.4f, 0.0f, 0.8f, -0.4f, 0.4f, 0.8f, -0.4f, 0.8f, 0.8f, -0.4f,
+ -0.8f, -0.8f, 0.0f, -0.4f, -0.8f, 0.0f, 0.0f, -0.8f, 0.0f, 0.4f, -0.8f, 0.0f, 0.8f, -0.8f, 0.0f,
+ -0.8f, -0.4f, 0.0f, -0.4f, -0.4f, 0.0f, 0.0f, -0.4f, 0.0f, 0.4f, -0.4f, 0.0f, 0.8f, -0.4f, 0.0f,
+ -0.8f, 0.0f, 0.0f, -0.4f, 0.0f, 0.0f, 0.0f, 0.0f, 0.0f, 0.4f, 0.0f, 0.0f, 0.8f, 0.0f, 0.0f,
+ -0.8f, 0.4f, 0.0f, -0.4f, 0.4f, 0.0f, 0.0f, 0.4f, 0.0f, 0.4f, 0.4f, 0.0f, 0.8f, 0.4f, 0.0f,
+ -0.8f, 0.8f, 0.0f, -0.4f, 0.8f, 0.0f, 0.0f, 0.8f, 0.0f, 0.4f, 0.8f, 0.0f, 0.8f, 0.8f, 0.0f,
+ -0.8f, -0.8f, 0.4f, -0.4f, -0.8f, 0.4f, 0.0f, -0.8f, 0.4f, 0.4f, -0.8f, 0.4f, 0.8f, -0.8f, 0.4f,
+ -0.8f, -0.4f, 0.4f, -0.4f, -0.4f, 0.4f, 0.0f, -0.4f, 0.4f, 0.4f, -0.4f, 0.4f, 0.8f, -0.4f, 0.4f,
+ -0.8f, 0.0f, 0.4f, -0.4f, 0.0f, 0.4f, 0.0f, 0.0f, 0.4f, 0.4f, 0.0f, 0.4f, 0.8f, 0.0f, 0.4f,
+ -0.8f, 0.4f, 0.4f, -0.4f, 0.4f, 0.4f, 0.0f, 0.4f, 0.4f, 0.4f, 0.4f, 0.4f, 0.8f, 0.4f, 0.4f,
+ -0.8f, 0.8f, 0.4f, -0.4f, 0.8f, 0.4f, 0.0f, 0.8f, 0.4f, 0.4f, 0.8f, 0.4f, 0.8f, 0.8f, 0.4f,
+ -0.8f, -0.8f, 0.8f, -0.4f, -0.8f, 0.8f, 0.0f, -0.8f, 0.8f, 0.4f, -0.8f, 0.8f, 0.8f, -0.8f, 0.8f,
+ -0.8f, -0.4f, 0.8f, -0.4f, -0.4f, 0.8f, 0.0f, -0.4f, 0.8f, 0.4f, -0.4f, 0.8f, 0.8f, -0.4f, 0.8f,
+ -0.8f, 0.0f, 0.8f, -0.4f, 0.0f, 0.8f, 0.0f, 0.0f, 0.8f, 0.4f, 0.0f, 0.8f, 0.8f, 0.0f, 0.8f,
+ -0.8f, 0.4f, 0.8f, -0.4f, 0.4f, 0.8f, 0.0f, 0.4f, 0.8f, 0.4f, 0.4f, 0.8f, 0.8f, 0.4f, 0.8f,
+ -0.8f, 0.8f, 0.8f, -0.4f, 0.8f, 0.8f, 0.0f, 0.8f, 0.8f, 0.4f, 0.8f, 0.8f, 0.8f, 0.8f, 0.8f
+ };
+
+ // this table contains 3 requantized samples for each legal codeword
+ // when grouped in 10 bits, i.e. 9 quantizationsteps per sample
+ public static final float grouping_10bits[] =
+ {
+ -8.0f/9.0f, -8.0f/9.0f, -8.0f/9.0f, -6.0f/9.0f, -8.0f/9.0f, -8.0f/9.0f, -4.0f/9.0f, -8.0f/9.0f, -8.0f/9.0f,
+ -2.0f/9.0f, -8.0f/9.0f, -8.0f/9.0f, 0.0f, -8.0f/9.0f, -8.0f/9.0f, 2.0f/9.0f, -8.0f/9.0f, -8.0f/9.0f,
+ 4.0f/9.0f, -8.0f/9.0f, -8.0f/9.0f, 6.0f/9.0f, -8.0f/9.0f, -8.0f/9.0f, 8.0f/9.0f, -8.0f/9.0f, -8.0f/9.0f,
+ -8.0f/9.0f, -6.0f/9.0f, -8.0f/9.0f, -6.0f/9.0f, -6.0f/9.0f, -8.0f/9.0f, -4.0f/9.0f, -6.0f/9.0f, -8.0f/9.0f,
+ -2.0f/9.0f, -6.0f/9.0f, -8.0f/9.0f, 0.0f, -6.0f/9.0f, -8.0f/9.0f, 2.0f/9.0f, -6.0f/9.0f, -8.0f/9.0f,
+ 4.0f/9.0f, -6.0f/9.0f, -8.0f/9.0f, 6.0f/9.0f, -6.0f/9.0f, -8.0f/9.0f, 8.0f/9.0f, -6.0f/9.0f, -8.0f/9.0f,
+ -8.0f/9.0f, -4.0f/9.0f, -8.0f/9.0f, -6.0f/9.0f, -4.0f/9.0f, -8.0f/9.0f, -4.0f/9.0f, -4.0f/9.0f, -8.0f/9.0f,
+ -2.0f/9.0f, -4.0f/9.0f, -8.0f/9.0f, 0.0f, -4.0f/9.0f, -8.0f/9.0f, 2.0f/9.0f, -4.0f/9.0f, -8.0f/9.0f,
+ 4.0f/9.0f, -4.0f/9.0f, -8.0f/9.0f, 6.0f/9.0f, -4.0f/9.0f, -8.0f/9.0f, 8.0f/9.0f, -4.0f/9.0f, -8.0f/9.0f,
+ -8.0f/9.0f, -2.0f/9.0f, -8.0f/9.0f, -6.0f/9.0f, -2.0f/9.0f, -8.0f/9.0f, -4.0f/9.0f, -2.0f/9.0f, -8.0f/9.0f,
+ -2.0f/9.0f, -2.0f/9.0f, -8.0f/9.0f, 0.0f, -2.0f/9.0f, -8.0f/9.0f, 2.0f/9.0f, -2.0f/9.0f, -8.0f/9.0f,
+ 4.0f/9.0f, -2.0f/9.0f, -8.0f/9.0f, 6.0f/9.0f, -2.0f/9.0f, -8.0f/9.0f, 8.0f/9.0f, -2.0f/9.0f, -8.0f/9.0f,
+ -8.0f/9.0f, 0.0f, -8.0f/9.0f, -6.0f/9.0f, 0.0f, -8.0f/9.0f, -4.0f/9.0f, 0.0f, -8.0f/9.0f,
+ -2.0f/9.0f, 0.0f, -8.0f/9.0f, 0.0f, 0.0f, -8.0f/9.0f, 2.0f/9.0f, 0.0f, -8.0f/9.0f,
+ 4.0f/9.0f, 0.0f, -8.0f/9.0f, 6.0f/9.0f, 0.0f, -8.0f/9.0f, 8.0f/9.0f, 0.0f, -8.0f/9.0f,
+ -8.0f/9.0f, 2.0f/9.0f, -8.0f/9.0f, -6.0f/9.0f, 2.0f/9.0f, -8.0f/9.0f, -4.0f/9.0f, 2.0f/9.0f, -8.0f/9.0f,
+ -2.0f/9.0f, 2.0f/9.0f, -8.0f/9.0f, 0.0f, 2.0f/9.0f, -8.0f/9.0f, 2.0f/9.0f, 2.0f/9.0f, -8.0f/9.0f,
+ 4.0f/9.0f, 2.0f/9.0f, -8.0f/9.0f, 6.0f/9.0f, 2.0f/9.0f, -8.0f/9.0f, 8.0f/9.0f, 2.0f/9.0f, -8.0f/9.0f,
+ -8.0f/9.0f, 4.0f/9.0f, -8.0f/9.0f, -6.0f/9.0f, 4.0f/9.0f, -8.0f/9.0f, -4.0f/9.0f, 4.0f/9.0f, -8.0f/9.0f,
+ -2.0f/9.0f, 4.0f/9.0f, -8.0f/9.0f, 0.0f, 4.0f/9.0f, -8.0f/9.0f, 2.0f/9.0f, 4.0f/9.0f, -8.0f/9.0f,
+ 4.0f/9.0f, 4.0f/9.0f, -8.0f/9.0f, 6.0f/9.0f, 4.0f/9.0f, -8.0f/9.0f, 8.0f/9.0f, 4.0f/9.0f, -8.0f/9.0f,
+ -8.0f/9.0f, 6.0f/9.0f, -8.0f/9.0f, -6.0f/9.0f, 6.0f/9.0f, -8.0f/9.0f, -4.0f/9.0f, 6.0f/9.0f, -8.0f/9.0f,
+ -2.0f/9.0f, 6.0f/9.0f, -8.0f/9.0f, 0.0f, 6.0f/9.0f, -8.0f/9.0f, 2.0f/9.0f, 6.0f/9.0f, -8.0f/9.0f,
+ 4.0f/9.0f, 6.0f/9.0f, -8.0f/9.0f, 6.0f/9.0f, 6.0f/9.0f, -8.0f/9.0f, 8.0f/9.0f, 6.0f/9.0f, -8.0f/9.0f,
+ -8.0f/9.0f, 8.0f/9.0f, -8.0f/9.0f, -6.0f/9.0f, 8.0f/9.0f, -8.0f/9.0f, -4.0f/9.0f, 8.0f/9.0f, -8.0f/9.0f,
+ -2.0f/9.0f, 8.0f/9.0f, -8.0f/9.0f, 0.0f, 8.0f/9.0f, -8.0f/9.0f, 2.0f/9.0f, 8.0f/9.0f, -8.0f/9.0f,
+ 4.0f/9.0f, 8.0f/9.0f, -8.0f/9.0f, 6.0f/9.0f, 8.0f/9.0f, -8.0f/9.0f, 8.0f/9.0f, 8.0f/9.0f, -8.0f/9.0f,
+ -8.0f/9.0f, -8.0f/9.0f, -6.0f/9.0f, -6.0f/9.0f, -8.0f/9.0f, -6.0f/9.0f, -4.0f/9.0f, -8.0f/9.0f, -6.0f/9.0f,
+ -2.0f/9.0f, -8.0f/9.0f, -6.0f/9.0f, 0.0f, -8.0f/9.0f, -6.0f/9.0f, 2.0f/9.0f, -8.0f/9.0f, -6.0f/9.0f,
+ 4.0f/9.0f, -8.0f/9.0f, -6.0f/9.0f, 6.0f/9.0f, -8.0f/9.0f, -6.0f/9.0f, 8.0f/9.0f, -8.0f/9.0f, -6.0f/9.0f,
+ -8.0f/9.0f, -6.0f/9.0f, -6.0f/9.0f, -6.0f/9.0f, -6.0f/9.0f, -6.0f/9.0f, -4.0f/9.0f, -6.0f/9.0f, -6.0f/9.0f,
+ -2.0f/9.0f, -6.0f/9.0f, -6.0f/9.0f, 0.0f, -6.0f/9.0f, -6.0f/9.0f, 2.0f/9.0f, -6.0f/9.0f, -6.0f/9.0f,
+ 4.0f/9.0f, -6.0f/9.0f, -6.0f/9.0f, 6.0f/9.0f, -6.0f/9.0f, -6.0f/9.0f, 8.0f/9.0f, -6.0f/9.0f, -6.0f/9.0f,
+ -8.0f/9.0f, -4.0f/9.0f, -6.0f/9.0f, -6.0f/9.0f, -4.0f/9.0f, -6.0f/9.0f, -4.0f/9.0f, -4.0f/9.0f, -6.0f/9.0f,
+ -2.0f/9.0f, -4.0f/9.0f, -6.0f/9.0f, 0.0f, -4.0f/9.0f, -6.0f/9.0f, 2.0f/9.0f, -4.0f/9.0f, -6.0f/9.0f,
+ 4.0f/9.0f, -4.0f/9.0f, -6.0f/9.0f, 6.0f/9.0f, -4.0f/9.0f, -6.0f/9.0f, 8.0f/9.0f, -4.0f/9.0f, -6.0f/9.0f,
+ -8.0f/9.0f, -2.0f/9.0f, -6.0f/9.0f, -6.0f/9.0f, -2.0f/9.0f, -6.0f/9.0f, -4.0f/9.0f, -2.0f/9.0f, -6.0f/9.0f,
+ -2.0f/9.0f, -2.0f/9.0f, -6.0f/9.0f, 0.0f, -2.0f/9.0f, -6.0f/9.0f, 2.0f/9.0f, -2.0f/9.0f, -6.0f/9.0f,
+ 4.0f/9.0f, -2.0f/9.0f, -6.0f/9.0f, 6.0f/9.0f, -2.0f/9.0f, -6.0f/9.0f, 8.0f/9.0f, -2.0f/9.0f, -6.0f/9.0f,
+ -8.0f/9.0f, 0.0f, -6.0f/9.0f, -6.0f/9.0f, 0.0f, -6.0f/9.0f, -4.0f/9.0f, 0.0f, -6.0f/9.0f,
+ -2.0f/9.0f, 0.0f, -6.0f/9.0f, 0.0f, 0.0f, -6.0f/9.0f, 2.0f/9.0f, 0.0f, -6.0f/9.0f,
+ 4.0f/9.0f, 0.0f, -6.0f/9.0f, 6.0f/9.0f, 0.0f, -6.0f/9.0f, 8.0f/9.0f, 0.0f, -6.0f/9.0f,
+ -8.0f/9.0f, 2.0f/9.0f, -6.0f/9.0f, -6.0f/9.0f, 2.0f/9.0f, -6.0f/9.0f, -4.0f/9.0f, 2.0f/9.0f, -6.0f/9.0f,
+ -2.0f/9.0f, 2.0f/9.0f, -6.0f/9.0f, 0.0f, 2.0f/9.0f, -6.0f/9.0f, 2.0f/9.0f, 2.0f/9.0f, -6.0f/9.0f,
+ 4.0f/9.0f, 2.0f/9.0f, -6.0f/9.0f, 6.0f/9.0f, 2.0f/9.0f, -6.0f/9.0f, 8.0f/9.0f, 2.0f/9.0f, -6.0f/9.0f,
+ -8.0f/9.0f, 4.0f/9.0f, -6.0f/9.0f, -6.0f/9.0f, 4.0f/9.0f, -6.0f/9.0f, -4.0f/9.0f, 4.0f/9.0f, -6.0f/9.0f,
+ -2.0f/9.0f, 4.0f/9.0f, -6.0f/9.0f, 0.0f, 4.0f/9.0f, -6.0f/9.0f, 2.0f/9.0f, 4.0f/9.0f, -6.0f/9.0f,
+ 4.0f/9.0f, 4.0f/9.0f, -6.0f/9.0f, 6.0f/9.0f, 4.0f/9.0f, -6.0f/9.0f, 8.0f/9.0f, 4.0f/9.0f, -6.0f/9.0f,
+ -8.0f/9.0f, 6.0f/9.0f, -6.0f/9.0f, -6.0f/9.0f, 6.0f/9.0f, -6.0f/9.0f, -4.0f/9.0f, 6.0f/9.0f, -6.0f/9.0f,
+ -2.0f/9.0f, 6.0f/9.0f, -6.0f/9.0f, 0.0f, 6.0f/9.0f, -6.0f/9.0f, 2.0f/9.0f, 6.0f/9.0f, -6.0f/9.0f,
+ 4.0f/9.0f, 6.0f/9.0f, -6.0f/9.0f, 6.0f/9.0f, 6.0f/9.0f, -6.0f/9.0f, 8.0f/9.0f, 6.0f/9.0f, -6.0f/9.0f,
+ -8.0f/9.0f, 8.0f/9.0f, -6.0f/9.0f, -6.0f/9.0f, 8.0f/9.0f, -6.0f/9.0f, -4.0f/9.0f, 8.0f/9.0f, -6.0f/9.0f,
+ -2.0f/9.0f, 8.0f/9.0f, -6.0f/9.0f, 0.0f, 8.0f/9.0f, -6.0f/9.0f, 2.0f/9.0f, 8.0f/9.0f, -6.0f/9.0f,
+ 4.0f/9.0f, 8.0f/9.0f, -6.0f/9.0f, 6.0f/9.0f, 8.0f/9.0f, -6.0f/9.0f, 8.0f/9.0f, 8.0f/9.0f, -6.0f/9.0f,
+ -8.0f/9.0f, -8.0f/9.0f, -4.0f/9.0f, -6.0f/9.0f, -8.0f/9.0f, -4.0f/9.0f, -4.0f/9.0f, -8.0f/9.0f, -4.0f/9.0f,
+ -2.0f/9.0f, -8.0f/9.0f, -4.0f/9.0f, 0.0f, -8.0f/9.0f, -4.0f/9.0f, 2.0f/9.0f, -8.0f/9.0f, -4.0f/9.0f,
+ 4.0f/9.0f, -8.0f/9.0f, -4.0f/9.0f, 6.0f/9.0f, -8.0f/9.0f, -4.0f/9.0f, 8.0f/9.0f, -8.0f/9.0f, -4.0f/9.0f,
+ -8.0f/9.0f, -6.0f/9.0f, -4.0f/9.0f, -6.0f/9.0f, -6.0f/9.0f, -4.0f/9.0f, -4.0f/9.0f, -6.0f/9.0f, -4.0f/9.0f,
+ -2.0f/9.0f, -6.0f/9.0f, -4.0f/9.0f, 0.0f, -6.0f/9.0f, -4.0f/9.0f, 2.0f/9.0f, -6.0f/9.0f, -4.0f/9.0f,
+ 4.0f/9.0f, -6.0f/9.0f, -4.0f/9.0f, 6.0f/9.0f, -6.0f/9.0f, -4.0f/9.0f, 8.0f/9.0f, -6.0f/9.0f, -4.0f/9.0f,
+ -8.0f/9.0f, -4.0f/9.0f, -4.0f/9.0f, -6.0f/9.0f, -4.0f/9.0f, -4.0f/9.0f, -4.0f/9.0f, -4.0f/9.0f, -4.0f/9.0f,
+ -2.0f/9.0f, -4.0f/9.0f, -4.0f/9.0f, 0.0f, -4.0f/9.0f, -4.0f/9.0f, 2.0f/9.0f, -4.0f/9.0f, -4.0f/9.0f,
+ 4.0f/9.0f, -4.0f/9.0f, -4.0f/9.0f, 6.0f/9.0f, -4.0f/9.0f, -4.0f/9.0f, 8.0f/9.0f, -4.0f/9.0f, -4.0f/9.0f,
+ -8.0f/9.0f, -2.0f/9.0f, -4.0f/9.0f, -6.0f/9.0f, -2.0f/9.0f, -4.0f/9.0f, -4.0f/9.0f, -2.0f/9.0f, -4.0f/9.0f,
+ -2.0f/9.0f, -2.0f/9.0f, -4.0f/9.0f, 0.0f, -2.0f/9.0f, -4.0f/9.0f, 2.0f/9.0f, -2.0f/9.0f, -4.0f/9.0f,
+ 4.0f/9.0f, -2.0f/9.0f, -4.0f/9.0f, 6.0f/9.0f, -2.0f/9.0f, -4.0f/9.0f, 8.0f/9.0f, -2.0f/9.0f, -4.0f/9.0f,
+ -8.0f/9.0f, 0.0f, -4.0f/9.0f, -6.0f/9.0f, 0.0f, -4.0f/9.0f, -4.0f/9.0f, 0.0f, -4.0f/9.0f,
+ -2.0f/9.0f, 0.0f, -4.0f/9.0f, 0.0f, 0.0f, -4.0f/9.0f, 2.0f/9.0f, 0.0f, -4.0f/9.0f,
+ 4.0f/9.0f, 0.0f, -4.0f/9.0f, 6.0f/9.0f, 0.0f, -4.0f/9.0f, 8.0f/9.0f, 0.0f, -4.0f/9.0f,
+ -8.0f/9.0f, 2.0f/9.0f, -4.0f/9.0f, -6.0f/9.0f, 2.0f/9.0f, -4.0f/9.0f, -4.0f/9.0f, 2.0f/9.0f, -4.0f/9.0f,
+ -2.0f/9.0f, 2.0f/9.0f, -4.0f/9.0f, 0.0f, 2.0f/9.0f, -4.0f/9.0f, 2.0f/9.0f, 2.0f/9.0f, -4.0f/9.0f,
+ 4.0f/9.0f, 2.0f/9.0f, -4.0f/9.0f, 6.0f/9.0f, 2.0f/9.0f, -4.0f/9.0f, 8.0f/9.0f, 2.0f/9.0f, -4.0f/9.0f,
+ -8.0f/9.0f, 4.0f/9.0f, -4.0f/9.0f, -6.0f/9.0f, 4.0f/9.0f, -4.0f/9.0f, -4.0f/9.0f, 4.0f/9.0f, -4.0f/9.0f,
+ -2.0f/9.0f, 4.0f/9.0f, -4.0f/9.0f, 0.0f, 4.0f/9.0f, -4.0f/9.0f, 2.0f/9.0f, 4.0f/9.0f, -4.0f/9.0f,
+ 4.0f/9.0f, 4.0f/9.0f, -4.0f/9.0f, 6.0f/9.0f, 4.0f/9.0f, -4.0f/9.0f, 8.0f/9.0f, 4.0f/9.0f, -4.0f/9.0f,
+ -8.0f/9.0f, 6.0f/9.0f, -4.0f/9.0f, -6.0f/9.0f, 6.0f/9.0f, -4.0f/9.0f, -4.0f/9.0f, 6.0f/9.0f, -4.0f/9.0f,
+ -2.0f/9.0f, 6.0f/9.0f, -4.0f/9.0f, 0.0f, 6.0f/9.0f, -4.0f/9.0f, 2.0f/9.0f, 6.0f/9.0f, -4.0f/9.0f,
+ 4.0f/9.0f, 6.0f/9.0f, -4.0f/9.0f, 6.0f/9.0f, 6.0f/9.0f, -4.0f/9.0f, 8.0f/9.0f, 6.0f/9.0f, -4.0f/9.0f,
+ -8.0f/9.0f, 8.0f/9.0f, -4.0f/9.0f, -6.0f/9.0f, 8.0f/9.0f, -4.0f/9.0f, -4.0f/9.0f, 8.0f/9.0f, -4.0f/9.0f,
+ -2.0f/9.0f, 8.0f/9.0f, -4.0f/9.0f, 0.0f, 8.0f/9.0f, -4.0f/9.0f, 2.0f/9.0f, 8.0f/9.0f, -4.0f/9.0f,
+ 4.0f/9.0f, 8.0f/9.0f, -4.0f/9.0f, 6.0f/9.0f, 8.0f/9.0f, -4.0f/9.0f, 8.0f/9.0f, 8.0f/9.0f, -4.0f/9.0f,
+ -8.0f/9.0f, -8.0f/9.0f, -2.0f/9.0f, -6.0f/9.0f, -8.0f/9.0f, -2.0f/9.0f, -4.0f/9.0f, -8.0f/9.0f, -2.0f/9.0f,
+ -2.0f/9.0f, -8.0f/9.0f, -2.0f/9.0f, 0.0f, -8.0f/9.0f, -2.0f/9.0f, 2.0f/9.0f, -8.0f/9.0f, -2.0f/9.0f,
+ 4.0f/9.0f, -8.0f/9.0f, -2.0f/9.0f, 6.0f/9.0f, -8.0f/9.0f, -2.0f/9.0f, 8.0f/9.0f, -8.0f/9.0f, -2.0f/9.0f,
+ -8.0f/9.0f, -6.0f/9.0f, -2.0f/9.0f, -6.0f/9.0f, -6.0f/9.0f, -2.0f/9.0f, -4.0f/9.0f, -6.0f/9.0f, -2.0f/9.0f,
+ -2.0f/9.0f, -6.0f/9.0f, -2.0f/9.0f, 0.0f, -6.0f/9.0f, -2.0f/9.0f, 2.0f/9.0f, -6.0f/9.0f, -2.0f/9.0f,
+ 4.0f/9.0f, -6.0f/9.0f, -2.0f/9.0f, 6.0f/9.0f, -6.0f/9.0f, -2.0f/9.0f, 8.0f/9.0f, -6.0f/9.0f, -2.0f/9.0f,
+ -8.0f/9.0f, -4.0f/9.0f, -2.0f/9.0f, -6.0f/9.0f, -4.0f/9.0f, -2.0f/9.0f, -4.0f/9.0f, -4.0f/9.0f, -2.0f/9.0f,
+ -2.0f/9.0f, -4.0f/9.0f, -2.0f/9.0f, 0.0f, -4.0f/9.0f, -2.0f/9.0f, 2.0f/9.0f, -4.0f/9.0f, -2.0f/9.0f,
+ 4.0f/9.0f, -4.0f/9.0f, -2.0f/9.0f, 6.0f/9.0f, -4.0f/9.0f, -2.0f/9.0f, 8.0f/9.0f, -4.0f/9.0f, -2.0f/9.0f,
+ -8.0f/9.0f, -2.0f/9.0f, -2.0f/9.0f, -6.0f/9.0f, -2.0f/9.0f, -2.0f/9.0f, -4.0f/9.0f, -2.0f/9.0f, -2.0f/9.0f,
+ -2.0f/9.0f, -2.0f/9.0f, -2.0f/9.0f, 0.0f, -2.0f/9.0f, -2.0f/9.0f, 2.0f/9.0f, -2.0f/9.0f, -2.0f/9.0f,
+ 4.0f/9.0f, -2.0f/9.0f, -2.0f/9.0f, 6.0f/9.0f, -2.0f/9.0f, -2.0f/9.0f, 8.0f/9.0f, -2.0f/9.0f, -2.0f/9.0f,
+ -8.0f/9.0f, 0.0f, -2.0f/9.0f, -6.0f/9.0f, 0.0f, -2.0f/9.0f, -4.0f/9.0f, 0.0f, -2.0f/9.0f,
+ -2.0f/9.0f, 0.0f, -2.0f/9.0f, 0.0f, 0.0f, -2.0f/9.0f, 2.0f/9.0f, 0.0f, -2.0f/9.0f,
+ 4.0f/9.0f, 0.0f, -2.0f/9.0f, 6.0f/9.0f, 0.0f, -2.0f/9.0f, 8.0f/9.0f, 0.0f, -2.0f/9.0f,
+ -8.0f/9.0f, 2.0f/9.0f, -2.0f/9.0f, -6.0f/9.0f, 2.0f/9.0f, -2.0f/9.0f, -4.0f/9.0f, 2.0f/9.0f, -2.0f/9.0f,
+ -2.0f/9.0f, 2.0f/9.0f, -2.0f/9.0f, 0.0f, 2.0f/9.0f, -2.0f/9.0f, 2.0f/9.0f, 2.0f/9.0f, -2.0f/9.0f,
+ 4.0f/9.0f, 2.0f/9.0f, -2.0f/9.0f, 6.0f/9.0f, 2.0f/9.0f, -2.0f/9.0f, 8.0f/9.0f, 2.0f/9.0f, -2.0f/9.0f,
+ -8.0f/9.0f, 4.0f/9.0f, -2.0f/9.0f, -6.0f/9.0f, 4.0f/9.0f, -2.0f/9.0f, -4.0f/9.0f, 4.0f/9.0f, -2.0f/9.0f,
+ -2.0f/9.0f, 4.0f/9.0f, -2.0f/9.0f, 0.0f, 4.0f/9.0f, -2.0f/9.0f, 2.0f/9.0f, 4.0f/9.0f, -2.0f/9.0f,
+ 4.0f/9.0f, 4.0f/9.0f, -2.0f/9.0f, 6.0f/9.0f, 4.0f/9.0f, -2.0f/9.0f, 8.0f/9.0f, 4.0f/9.0f, -2.0f/9.0f,
+ -8.0f/9.0f, 6.0f/9.0f, -2.0f/9.0f, -6.0f/9.0f, 6.0f/9.0f, -2.0f/9.0f, -4.0f/9.0f, 6.0f/9.0f, -2.0f/9.0f,
+ -2.0f/9.0f, 6.0f/9.0f, -2.0f/9.0f, 0.0f, 6.0f/9.0f, -2.0f/9.0f, 2.0f/9.0f, 6.0f/9.0f, -2.0f/9.0f,
+ 4.0f/9.0f, 6.0f/9.0f, -2.0f/9.0f, 6.0f/9.0f, 6.0f/9.0f, -2.0f/9.0f, 8.0f/9.0f, 6.0f/9.0f, -2.0f/9.0f,
+ -8.0f/9.0f, 8.0f/9.0f, -2.0f/9.0f, -6.0f/9.0f, 8.0f/9.0f, -2.0f/9.0f, -4.0f/9.0f, 8.0f/9.0f, -2.0f/9.0f,
+ -2.0f/9.0f, 8.0f/9.0f, -2.0f/9.0f, 0.0f, 8.0f/9.0f, -2.0f/9.0f, 2.0f/9.0f, 8.0f/9.0f, -2.0f/9.0f,
+ 4.0f/9.0f, 8.0f/9.0f, -2.0f/9.0f, 6.0f/9.0f, 8.0f/9.0f, -2.0f/9.0f, 8.0f/9.0f, 8.0f/9.0f, -2.0f/9.0f,
+ -8.0f/9.0f, -8.0f/9.0f, 0.0f, -6.0f/9.0f, -8.0f/9.0f, 0.0f, -4.0f/9.0f, -8.0f/9.0f, 0.0f,
+ -2.0f/9.0f, -8.0f/9.0f, 0.0f, 0.0f, -8.0f/9.0f, 0.0f, 2.0f/9.0f, -8.0f/9.0f, 0.0f,
+ 4.0f/9.0f, -8.0f/9.0f, 0.0f, 6.0f/9.0f, -8.0f/9.0f, 0.0f, 8.0f/9.0f, -8.0f/9.0f, 0.0f,
+ -8.0f/9.0f, -6.0f/9.0f, 0.0f, -6.0f/9.0f, -6.0f/9.0f, 0.0f, -4.0f/9.0f, -6.0f/9.0f, 0.0f,
+ -2.0f/9.0f, -6.0f/9.0f, 0.0f, 0.0f, -6.0f/9.0f, 0.0f, 2.0f/9.0f, -6.0f/9.0f, 0.0f,
+ 4.0f/9.0f, -6.0f/9.0f, 0.0f, 6.0f/9.0f, -6.0f/9.0f, 0.0f, 8.0f/9.0f, -6.0f/9.0f, 0.0f,
+ -8.0f/9.0f, -4.0f/9.0f, 0.0f, -6.0f/9.0f, -4.0f/9.0f, 0.0f, -4.0f/9.0f, -4.0f/9.0f, 0.0f,
+ -2.0f/9.0f, -4.0f/9.0f, 0.0f, 0.0f, -4.0f/9.0f, 0.0f, 2.0f/9.0f, -4.0f/9.0f, 0.0f,
+ 4.0f/9.0f, -4.0f/9.0f, 0.0f, 6.0f/9.0f, -4.0f/9.0f, 0.0f, 8.0f/9.0f, -4.0f/9.0f, 0.0f,
+ -8.0f/9.0f, -2.0f/9.0f, 0.0f, -6.0f/9.0f, -2.0f/9.0f, 0.0f, -4.0f/9.0f, -2.0f/9.0f, 0.0f,
+ -2.0f/9.0f, -2.0f/9.0f, 0.0f, 0.0f, -2.0f/9.0f, 0.0f, 2.0f/9.0f, -2.0f/9.0f, 0.0f,
+ 4.0f/9.0f, -2.0f/9.0f, 0.0f, 6.0f/9.0f, -2.0f/9.0f, 0.0f, 8.0f/9.0f, -2.0f/9.0f, 0.0f,
+ -8.0f/9.0f, 0.0f, 0.0f, -6.0f/9.0f, 0.0f, 0.0f, -4.0f/9.0f, 0.0f, 0.0f,
+ -2.0f/9.0f, 0.0f, 0.0f, 0.0f, 0.0f, 0.0f, 2.0f/9.0f, 0.0f, 0.0f,
+ 4.0f/9.0f, 0.0f, 0.0f, 6.0f/9.0f, 0.0f, 0.0f, 8.0f/9.0f, 0.0f, 0.0f,
+ -8.0f/9.0f, 2.0f/9.0f, 0.0f, -6.0f/9.0f, 2.0f/9.0f, 0.0f, -4.0f/9.0f, 2.0f/9.0f, 0.0f,
+ -2.0f/9.0f, 2.0f/9.0f, 0.0f, 0.0f, 2.0f/9.0f, 0.0f, 2.0f/9.0f, 2.0f/9.0f, 0.0f,
+ 4.0f/9.0f, 2.0f/9.0f, 0.0f, 6.0f/9.0f, 2.0f/9.0f, 0.0f, 8.0f/9.0f, 2.0f/9.0f, 0.0f,
+ -8.0f/9.0f, 4.0f/9.0f, 0.0f, -6.0f/9.0f, 4.0f/9.0f, 0.0f, -4.0f/9.0f, 4.0f/9.0f, 0.0f,
+ -2.0f/9.0f, 4.0f/9.0f, 0.0f, 0.0f, 4.0f/9.0f, 0.0f, 2.0f/9.0f, 4.0f/9.0f, 0.0f,
+ 4.0f/9.0f, 4.0f/9.0f, 0.0f, 6.0f/9.0f, 4.0f/9.0f, 0.0f, 8.0f/9.0f, 4.0f/9.0f, 0.0f,
+ -8.0f/9.0f, 6.0f/9.0f, 0.0f, -6.0f/9.0f, 6.0f/9.0f, 0.0f, -4.0f/9.0f, 6.0f/9.0f, 0.0f,
+ -2.0f/9.0f, 6.0f/9.0f, 0.0f, 0.0f, 6.0f/9.0f, 0.0f, 2.0f/9.0f, 6.0f/9.0f, 0.0f,
+ 4.0f/9.0f, 6.0f/9.0f, 0.0f, 6.0f/9.0f, 6.0f/9.0f, 0.0f, 8.0f/9.0f, 6.0f/9.0f, 0.0f,
+ -8.0f/9.0f, 8.0f/9.0f, 0.0f, -6.0f/9.0f, 8.0f/9.0f, 0.0f, -4.0f/9.0f, 8.0f/9.0f, 0.0f,
+ -2.0f/9.0f, 8.0f/9.0f, 0.0f, 0.0f, 8.0f/9.0f, 0.0f, 2.0f/9.0f, 8.0f/9.0f, 0.0f,
+ 4.0f/9.0f, 8.0f/9.0f, 0.0f, 6.0f/9.0f, 8.0f/9.0f, 0.0f, 8.0f/9.0f, 8.0f/9.0f, 0.0f,
+ -8.0f/9.0f, -8.0f/9.0f, 2.0f/9.0f, -6.0f/9.0f, -8.0f/9.0f, 2.0f/9.0f, -4.0f/9.0f, -8.0f/9.0f, 2.0f/9.0f,
+ -2.0f/9.0f, -8.0f/9.0f, 2.0f/9.0f, 0.0f, -8.0f/9.0f, 2.0f/9.0f, 2.0f/9.0f, -8.0f/9.0f, 2.0f/9.0f,
+ 4.0f/9.0f, -8.0f/9.0f, 2.0f/9.0f, 6.0f/9.0f, -8.0f/9.0f, 2.0f/9.0f, 8.0f/9.0f, -8.0f/9.0f, 2.0f/9.0f,
+ -8.0f/9.0f, -6.0f/9.0f, 2.0f/9.0f, -6.0f/9.0f, -6.0f/9.0f, 2.0f/9.0f, -4.0f/9.0f, -6.0f/9.0f, 2.0f/9.0f,
+ -2.0f/9.0f, -6.0f/9.0f, 2.0f/9.0f, 0.0f, -6.0f/9.0f, 2.0f/9.0f, 2.0f/9.0f, -6.0f/9.0f, 2.0f/9.0f,
+ 4.0f/9.0f, -6.0f/9.0f, 2.0f/9.0f, 6.0f/9.0f, -6.0f/9.0f, 2.0f/9.0f, 8.0f/9.0f, -6.0f/9.0f, 2.0f/9.0f,
+ -8.0f/9.0f, -4.0f/9.0f, 2.0f/9.0f, -6.0f/9.0f, -4.0f/9.0f, 2.0f/9.0f, -4.0f/9.0f, -4.0f/9.0f, 2.0f/9.0f,
+ -2.0f/9.0f, -4.0f/9.0f, 2.0f/9.0f, 0.0f, -4.0f/9.0f, 2.0f/9.0f, 2.0f/9.0f, -4.0f/9.0f, 2.0f/9.0f,
+ 4.0f/9.0f, -4.0f/9.0f, 2.0f/9.0f, 6.0f/9.0f, -4.0f/9.0f, 2.0f/9.0f, 8.0f/9.0f, -4.0f/9.0f, 2.0f/9.0f,
+ -8.0f/9.0f, -2.0f/9.0f, 2.0f/9.0f, -6.0f/9.0f, -2.0f/9.0f, 2.0f/9.0f, -4.0f/9.0f, -2.0f/9.0f, 2.0f/9.0f,
+ -2.0f/9.0f, -2.0f/9.0f, 2.0f/9.0f, 0.0f, -2.0f/9.0f, 2.0f/9.0f, 2.0f/9.0f, -2.0f/9.0f, 2.0f/9.0f,
+ 4.0f/9.0f, -2.0f/9.0f, 2.0f/9.0f, 6.0f/9.0f, -2.0f/9.0f, 2.0f/9.0f, 8.0f/9.0f, -2.0f/9.0f, 2.0f/9.0f,
+ -8.0f/9.0f, 0.0f, 2.0f/9.0f, -6.0f/9.0f, 0.0f, 2.0f/9.0f, -4.0f/9.0f, 0.0f, 2.0f/9.0f,
+ -2.0f/9.0f, 0.0f, 2.0f/9.0f, 0.0f, 0.0f, 2.0f/9.0f, 2.0f/9.0f, 0.0f, 2.0f/9.0f,
+ 4.0f/9.0f, 0.0f, 2.0f/9.0f, 6.0f/9.0f, 0.0f, 2.0f/9.0f, 8.0f/9.0f, 0.0f, 2.0f/9.0f,
+ -8.0f/9.0f, 2.0f/9.0f, 2.0f/9.0f, -6.0f/9.0f, 2.0f/9.0f, 2.0f/9.0f, -4.0f/9.0f, 2.0f/9.0f, 2.0f/9.0f,
+ -2.0f/9.0f, 2.0f/9.0f, 2.0f/9.0f, 0.0f, 2.0f/9.0f, 2.0f/9.0f, 2.0f/9.0f, 2.0f/9.0f, 2.0f/9.0f,
+ 4.0f/9.0f, 2.0f/9.0f, 2.0f/9.0f, 6.0f/9.0f, 2.0f/9.0f, 2.0f/9.0f, 8.0f/9.0f, 2.0f/9.0f, 2.0f/9.0f,
+ -8.0f/9.0f, 4.0f/9.0f, 2.0f/9.0f, -6.0f/9.0f, 4.0f/9.0f, 2.0f/9.0f, -4.0f/9.0f, 4.0f/9.0f, 2.0f/9.0f,
+ -2.0f/9.0f, 4.0f/9.0f, 2.0f/9.0f, 0.0f, 4.0f/9.0f, 2.0f/9.0f, 2.0f/9.0f, 4.0f/9.0f, 2.0f/9.0f,
+ 4.0f/9.0f, 4.0f/9.0f, 2.0f/9.0f, 6.0f/9.0f, 4.0f/9.0f, 2.0f/9.0f, 8.0f/9.0f, 4.0f/9.0f, 2.0f/9.0f,
+ -8.0f/9.0f, 6.0f/9.0f, 2.0f/9.0f, -6.0f/9.0f, 6.0f/9.0f, 2.0f/9.0f, -4.0f/9.0f, 6.0f/9.0f, 2.0f/9.0f,
+ -2.0f/9.0f, 6.0f/9.0f, 2.0f/9.0f, 0.0f, 6.0f/9.0f, 2.0f/9.0f, 2.0f/9.0f, 6.0f/9.0f, 2.0f/9.0f,
+ 4.0f/9.0f, 6.0f/9.0f, 2.0f/9.0f, 6.0f/9.0f, 6.0f/9.0f, 2.0f/9.0f, 8.0f/9.0f, 6.0f/9.0f, 2.0f/9.0f,
+ -8.0f/9.0f, 8.0f/9.0f, 2.0f/9.0f, -6.0f/9.0f, 8.0f/9.0f, 2.0f/9.0f, -4.0f/9.0f, 8.0f/9.0f, 2.0f/9.0f,
+ -2.0f/9.0f, 8.0f/9.0f, 2.0f/9.0f, 0.0f, 8.0f/9.0f, 2.0f/9.0f, 2.0f/9.0f, 8.0f/9.0f, 2.0f/9.0f,
+ 4.0f/9.0f, 8.0f/9.0f, 2.0f/9.0f, 6.0f/9.0f, 8.0f/9.0f, 2.0f/9.0f, 8.0f/9.0f, 8.0f/9.0f, 2.0f/9.0f,
+ -8.0f/9.0f, -8.0f/9.0f, 4.0f/9.0f, -6.0f/9.0f, -8.0f/9.0f, 4.0f/9.0f, -4.0f/9.0f, -8.0f/9.0f, 4.0f/9.0f,
+ -2.0f/9.0f, -8.0f/9.0f, 4.0f/9.0f, 0.0f, -8.0f/9.0f, 4.0f/9.0f, 2.0f/9.0f, -8.0f/9.0f, 4.0f/9.0f,
+ 4.0f/9.0f, -8.0f/9.0f, 4.0f/9.0f, 6.0f/9.0f, -8.0f/9.0f, 4.0f/9.0f, 8.0f/9.0f, -8.0f/9.0f, 4.0f/9.0f,
+ -8.0f/9.0f, -6.0f/9.0f, 4.0f/9.0f, -6.0f/9.0f, -6.0f/9.0f, 4.0f/9.0f, -4.0f/9.0f, -6.0f/9.0f, 4.0f/9.0f,
+ -2.0f/9.0f, -6.0f/9.0f, 4.0f/9.0f, 0.0f, -6.0f/9.0f, 4.0f/9.0f, 2.0f/9.0f, -6.0f/9.0f, 4.0f/9.0f,
+ 4.0f/9.0f, -6.0f/9.0f, 4.0f/9.0f, 6.0f/9.0f, -6.0f/9.0f, 4.0f/9.0f, 8.0f/9.0f, -6.0f/9.0f, 4.0f/9.0f,
+ -8.0f/9.0f, -4.0f/9.0f, 4.0f/9.0f, -6.0f/9.0f, -4.0f/9.0f, 4.0f/9.0f, -4.0f/9.0f, -4.0f/9.0f, 4.0f/9.0f,
+ -2.0f/9.0f, -4.0f/9.0f, 4.0f/9.0f, 0.0f, -4.0f/9.0f, 4.0f/9.0f, 2.0f/9.0f, -4.0f/9.0f, 4.0f/9.0f,
+ 4.0f/9.0f, -4.0f/9.0f, 4.0f/9.0f, 6.0f/9.0f, -4.0f/9.0f, 4.0f/9.0f, 8.0f/9.0f, -4.0f/9.0f, 4.0f/9.0f,
+ -8.0f/9.0f, -2.0f/9.0f, 4.0f/9.0f, -6.0f/9.0f, -2.0f/9.0f, 4.0f/9.0f, -4.0f/9.0f, -2.0f/9.0f, 4.0f/9.0f,
+ -2.0f/9.0f, -2.0f/9.0f, 4.0f/9.0f, 0.0f, -2.0f/9.0f, 4.0f/9.0f, 2.0f/9.0f, -2.0f/9.0f, 4.0f/9.0f,
+ 4.0f/9.0f, -2.0f/9.0f, 4.0f/9.0f, 6.0f/9.0f, -2.0f/9.0f, 4.0f/9.0f, 8.0f/9.0f, -2.0f/9.0f, 4.0f/9.0f,
+ -8.0f/9.0f, 0.0f, 4.0f/9.0f, -6.0f/9.0f, 0.0f, 4.0f/9.0f, -4.0f/9.0f, 0.0f, 4.0f/9.0f,
+ -2.0f/9.0f, 0.0f, 4.0f/9.0f, 0.0f, 0.0f, 4.0f/9.0f, 2.0f/9.0f, 0.0f, 4.0f/9.0f,
+ 4.0f/9.0f, 0.0f, 4.0f/9.0f, 6.0f/9.0f, 0.0f, 4.0f/9.0f, 8.0f/9.0f, 0.0f, 4.0f/9.0f,
+ -8.0f/9.0f, 2.0f/9.0f, 4.0f/9.0f, -6.0f/9.0f, 2.0f/9.0f, 4.0f/9.0f, -4.0f/9.0f, 2.0f/9.0f, 4.0f/9.0f,
+ -2.0f/9.0f, 2.0f/9.0f, 4.0f/9.0f, 0.0f, 2.0f/9.0f, 4.0f/9.0f, 2.0f/9.0f, 2.0f/9.0f, 4.0f/9.0f,
+ 4.0f/9.0f, 2.0f/9.0f, 4.0f/9.0f, 6.0f/9.0f, 2.0f/9.0f, 4.0f/9.0f, 8.0f/9.0f, 2.0f/9.0f, 4.0f/9.0f,
+ -8.0f/9.0f, 4.0f/9.0f, 4.0f/9.0f, -6.0f/9.0f, 4.0f/9.0f, 4.0f/9.0f, -4.0f/9.0f, 4.0f/9.0f, 4.0f/9.0f,
+ -2.0f/9.0f, 4.0f/9.0f, 4.0f/9.0f, 0.0f, 4.0f/9.0f, 4.0f/9.0f, 2.0f/9.0f, 4.0f/9.0f, 4.0f/9.0f,
+ 4.0f/9.0f, 4.0f/9.0f, 4.0f/9.0f, 6.0f/9.0f, 4.0f/9.0f, 4.0f/9.0f, 8.0f/9.0f, 4.0f/9.0f, 4.0f/9.0f,
+ -8.0f/9.0f, 6.0f/9.0f, 4.0f/9.0f, -6.0f/9.0f, 6.0f/9.0f, 4.0f/9.0f, -4.0f/9.0f, 6.0f/9.0f, 4.0f/9.0f,
+ -2.0f/9.0f, 6.0f/9.0f, 4.0f/9.0f, 0.0f, 6.0f/9.0f, 4.0f/9.0f, 2.0f/9.0f, 6.0f/9.0f, 4.0f/9.0f,
+ 4.0f/9.0f, 6.0f/9.0f, 4.0f/9.0f, 6.0f/9.0f, 6.0f/9.0f, 4.0f/9.0f, 8.0f/9.0f, 6.0f/9.0f, 4.0f/9.0f,
+ -8.0f/9.0f, 8.0f/9.0f, 4.0f/9.0f, -6.0f/9.0f, 8.0f/9.0f, 4.0f/9.0f, -4.0f/9.0f, 8.0f/9.0f, 4.0f/9.0f,
+ -2.0f/9.0f, 8.0f/9.0f, 4.0f/9.0f, 0.0f, 8.0f/9.0f, 4.0f/9.0f, 2.0f/9.0f, 8.0f/9.0f, 4.0f/9.0f,
+ 4.0f/9.0f, 8.0f/9.0f, 4.0f/9.0f, 6.0f/9.0f, 8.0f/9.0f, 4.0f/9.0f, 8.0f/9.0f, 8.0f/9.0f, 4.0f/9.0f,
+ -8.0f/9.0f, -8.0f/9.0f, 6.0f/9.0f, -6.0f/9.0f, -8.0f/9.0f, 6.0f/9.0f, -4.0f/9.0f, -8.0f/9.0f, 6.0f/9.0f,
+ -2.0f/9.0f, -8.0f/9.0f, 6.0f/9.0f, 0.0f, -8.0f/9.0f, 6.0f/9.0f, 2.0f/9.0f, -8.0f/9.0f, 6.0f/9.0f,
+ 4.0f/9.0f, -8.0f/9.0f, 6.0f/9.0f, 6.0f/9.0f, -8.0f/9.0f, 6.0f/9.0f, 8.0f/9.0f, -8.0f/9.0f, 6.0f/9.0f,
+ -8.0f/9.0f, -6.0f/9.0f, 6.0f/9.0f, -6.0f/9.0f, -6.0f/9.0f, 6.0f/9.0f, -4.0f/9.0f, -6.0f/9.0f, 6.0f/9.0f,
+ -2.0f/9.0f, -6.0f/9.0f, 6.0f/9.0f, 0.0f, -6.0f/9.0f, 6.0f/9.0f, 2.0f/9.0f, -6.0f/9.0f, 6.0f/9.0f,
+ 4.0f/9.0f, -6.0f/9.0f, 6.0f/9.0f, 6.0f/9.0f, -6.0f/9.0f, 6.0f/9.0f, 8.0f/9.0f, -6.0f/9.0f, 6.0f/9.0f,
+ -8.0f/9.0f, -4.0f/9.0f, 6.0f/9.0f, -6.0f/9.0f, -4.0f/9.0f, 6.0f/9.0f, -4.0f/9.0f, -4.0f/9.0f, 6.0f/9.0f,
+ -2.0f/9.0f, -4.0f/9.0f, 6.0f/9.0f, 0.0f, -4.0f/9.0f, 6.0f/9.0f, 2.0f/9.0f, -4.0f/9.0f, 6.0f/9.0f,
+ 4.0f/9.0f, -4.0f/9.0f, 6.0f/9.0f, 6.0f/9.0f, -4.0f/9.0f, 6.0f/9.0f, 8.0f/9.0f, -4.0f/9.0f, 6.0f/9.0f,
+ -8.0f/9.0f, -2.0f/9.0f, 6.0f/9.0f, -6.0f/9.0f, -2.0f/9.0f, 6.0f/9.0f, -4.0f/9.0f, -2.0f/9.0f, 6.0f/9.0f,
+ -2.0f/9.0f, -2.0f/9.0f, 6.0f/9.0f, 0.0f, -2.0f/9.0f, 6.0f/9.0f, 2.0f/9.0f, -2.0f/9.0f, 6.0f/9.0f,
+ 4.0f/9.0f, -2.0f/9.0f, 6.0f/9.0f, 6.0f/9.0f, -2.0f/9.0f, 6.0f/9.0f, 8.0f/9.0f, -2.0f/9.0f, 6.0f/9.0f,
+ -8.0f/9.0f, 0.0f, 6.0f/9.0f, -6.0f/9.0f, 0.0f, 6.0f/9.0f, -4.0f/9.0f, 0.0f, 6.0f/9.0f,
+ -2.0f/9.0f, 0.0f, 6.0f/9.0f, 0.0f, 0.0f, 6.0f/9.0f, 2.0f/9.0f, 0.0f, 6.0f/9.0f,
+ 4.0f/9.0f, 0.0f, 6.0f/9.0f, 6.0f/9.0f, 0.0f, 6.0f/9.0f, 8.0f/9.0f, 0.0f, 6.0f/9.0f,
+ -8.0f/9.0f, 2.0f/9.0f, 6.0f/9.0f, -6.0f/9.0f, 2.0f/9.0f, 6.0f/9.0f, -4.0f/9.0f, 2.0f/9.0f, 6.0f/9.0f,
+ -2.0f/9.0f, 2.0f/9.0f, 6.0f/9.0f, 0.0f, 2.0f/9.0f, 6.0f/9.0f, 2.0f/9.0f, 2.0f/9.0f, 6.0f/9.0f,
+ 4.0f/9.0f, 2.0f/9.0f, 6.0f/9.0f, 6.0f/9.0f, 2.0f/9.0f, 6.0f/9.0f, 8.0f/9.0f, 2.0f/9.0f, 6.0f/9.0f,
+ -8.0f/9.0f, 4.0f/9.0f, 6.0f/9.0f, -6.0f/9.0f, 4.0f/9.0f, 6.0f/9.0f, -4.0f/9.0f, 4.0f/9.0f, 6.0f/9.0f,
+ -2.0f/9.0f, 4.0f/9.0f, 6.0f/9.0f, 0.0f, 4.0f/9.0f, 6.0f/9.0f, 2.0f/9.0f, 4.0f/9.0f, 6.0f/9.0f,
+ 4.0f/9.0f, 4.0f/9.0f, 6.0f/9.0f, 6.0f/9.0f, 4.0f/9.0f, 6.0f/9.0f, 8.0f/9.0f, 4.0f/9.0f, 6.0f/9.0f,
+ -8.0f/9.0f, 6.0f/9.0f, 6.0f/9.0f, -6.0f/9.0f, 6.0f/9.0f, 6.0f/9.0f, -4.0f/9.0f, 6.0f/9.0f, 6.0f/9.0f,
+ -2.0f/9.0f, 6.0f/9.0f, 6.0f/9.0f, 0.0f, 6.0f/9.0f, 6.0f/9.0f, 2.0f/9.0f, 6.0f/9.0f, 6.0f/9.0f,
+ 4.0f/9.0f, 6.0f/9.0f, 6.0f/9.0f, 6.0f/9.0f, 6.0f/9.0f, 6.0f/9.0f, 8.0f/9.0f, 6.0f/9.0f, 6.0f/9.0f,
+ -8.0f/9.0f, 8.0f/9.0f, 6.0f/9.0f, -6.0f/9.0f, 8.0f/9.0f, 6.0f/9.0f, -4.0f/9.0f, 8.0f/9.0f, 6.0f/9.0f,
+ -2.0f/9.0f, 8.0f/9.0f, 6.0f/9.0f, 0.0f, 8.0f/9.0f, 6.0f/9.0f, 2.0f/9.0f, 8.0f/9.0f, 6.0f/9.0f,
+ 4.0f/9.0f, 8.0f/9.0f, 6.0f/9.0f, 6.0f/9.0f, 8.0f/9.0f, 6.0f/9.0f, 8.0f/9.0f, 8.0f/9.0f, 6.0f/9.0f,
+ -8.0f/9.0f, -8.0f/9.0f, 8.0f/9.0f, -6.0f/9.0f, -8.0f/9.0f, 8.0f/9.0f, -4.0f/9.0f, -8.0f/9.0f, 8.0f/9.0f,
+ -2.0f/9.0f, -8.0f/9.0f, 8.0f/9.0f, 0.0f, -8.0f/9.0f, 8.0f/9.0f, 2.0f/9.0f, -8.0f/9.0f, 8.0f/9.0f,
+ 4.0f/9.0f, -8.0f/9.0f, 8.0f/9.0f, 6.0f/9.0f, -8.0f/9.0f, 8.0f/9.0f, 8.0f/9.0f, -8.0f/9.0f, 8.0f/9.0f,
+ -8.0f/9.0f, -6.0f/9.0f, 8.0f/9.0f, -6.0f/9.0f, -6.0f/9.0f, 8.0f/9.0f, -4.0f/9.0f, -6.0f/9.0f, 8.0f/9.0f,
+ -2.0f/9.0f, -6.0f/9.0f, 8.0f/9.0f, 0.0f, -6.0f/9.0f, 8.0f/9.0f, 2.0f/9.0f, -6.0f/9.0f, 8.0f/9.0f,
+ 4.0f/9.0f, -6.0f/9.0f, 8.0f/9.0f, 6.0f/9.0f, -6.0f/9.0f, 8.0f/9.0f, 8.0f/9.0f, -6.0f/9.0f, 8.0f/9.0f,
+ -8.0f/9.0f, -4.0f/9.0f, 8.0f/9.0f, -6.0f/9.0f, -4.0f/9.0f, 8.0f/9.0f, -4.0f/9.0f, -4.0f/9.0f, 8.0f/9.0f,
+ -2.0f/9.0f, -4.0f/9.0f, 8.0f/9.0f, 0.0f, -4.0f/9.0f, 8.0f/9.0f, 2.0f/9.0f, -4.0f/9.0f, 8.0f/9.0f,
+ 4.0f/9.0f, -4.0f/9.0f, 8.0f/9.0f, 6.0f/9.0f, -4.0f/9.0f, 8.0f/9.0f, 8.0f/9.0f, -4.0f/9.0f, 8.0f/9.0f,
+ -8.0f/9.0f, -2.0f/9.0f, 8.0f/9.0f, -6.0f/9.0f, -2.0f/9.0f, 8.0f/9.0f, -4.0f/9.0f, -2.0f/9.0f, 8.0f/9.0f,
+ -2.0f/9.0f, -2.0f/9.0f, 8.0f/9.0f, 0.0f, -2.0f/9.0f, 8.0f/9.0f, 2.0f/9.0f, -2.0f/9.0f, 8.0f/9.0f,
+ 4.0f/9.0f, -2.0f/9.0f, 8.0f/9.0f, 6.0f/9.0f, -2.0f/9.0f, 8.0f/9.0f, 8.0f/9.0f, -2.0f/9.0f, 8.0f/9.0f,
+ -8.0f/9.0f, 0.0f, 8.0f/9.0f, -6.0f/9.0f, 0.0f, 8.0f/9.0f, -4.0f/9.0f, 0.0f, 8.0f/9.0f,
+ -2.0f/9.0f, 0.0f, 8.0f/9.0f, 0.0f, 0.0f, 8.0f/9.0f, 2.0f/9.0f, 0.0f, 8.0f/9.0f,
+ 4.0f/9.0f, 0.0f, 8.0f/9.0f, 6.0f/9.0f, 0.0f, 8.0f/9.0f, 8.0f/9.0f, 0.0f, 8.0f/9.0f,
+ -8.0f/9.0f, 2.0f/9.0f, 8.0f/9.0f, -6.0f/9.0f, 2.0f/9.0f, 8.0f/9.0f, -4.0f/9.0f, 2.0f/9.0f, 8.0f/9.0f,
+ -2.0f/9.0f, 2.0f/9.0f, 8.0f/9.0f, 0.0f, 2.0f/9.0f, 8.0f/9.0f, 2.0f/9.0f, 2.0f/9.0f, 8.0f/9.0f,
+ 4.0f/9.0f, 2.0f/9.0f, 8.0f/9.0f, 6.0f/9.0f, 2.0f/9.0f, 8.0f/9.0f, 8.0f/9.0f, 2.0f/9.0f, 8.0f/9.0f,
+ -8.0f/9.0f, 4.0f/9.0f, 8.0f/9.0f, -6.0f/9.0f, 4.0f/9.0f, 8.0f/9.0f, -4.0f/9.0f, 4.0f/9.0f, 8.0f/9.0f,
+ -2.0f/9.0f, 4.0f/9.0f, 8.0f/9.0f, 0.0f, 4.0f/9.0f, 8.0f/9.0f, 2.0f/9.0f, 4.0f/9.0f, 8.0f/9.0f,
+ 4.0f/9.0f, 4.0f/9.0f, 8.0f/9.0f, 6.0f/9.0f, 4.0f/9.0f, 8.0f/9.0f, 8.0f/9.0f, 4.0f/9.0f, 8.0f/9.0f,
+ -8.0f/9.0f, 6.0f/9.0f, 8.0f/9.0f, -6.0f/9.0f, 6.0f/9.0f, 8.0f/9.0f, -4.0f/9.0f, 6.0f/9.0f, 8.0f/9.0f,
+ -2.0f/9.0f, 6.0f/9.0f, 8.0f/9.0f, 0.0f, 6.0f/9.0f, 8.0f/9.0f, 2.0f/9.0f, 6.0f/9.0f, 8.0f/9.0f,
+ 4.0f/9.0f, 6.0f/9.0f, 8.0f/9.0f, 6.0f/9.0f, 6.0f/9.0f, 8.0f/9.0f, 8.0f/9.0f, 6.0f/9.0f, 8.0f/9.0f,
+ -8.0f/9.0f, 8.0f/9.0f, 8.0f/9.0f, -6.0f/9.0f, 8.0f/9.0f, 8.0f/9.0f, -4.0f/9.0f, 8.0f/9.0f, 8.0f/9.0f,
+ -2.0f/9.0f, 8.0f/9.0f, 8.0f/9.0f, 0.0f, 8.0f/9.0f, 8.0f/9.0f, 2.0f/9.0f, 8.0f/9.0f, 8.0f/9.0f,
+ 4.0f/9.0f, 8.0f/9.0f, 8.0f/9.0f, 6.0f/9.0f, 8.0f/9.0f, 8.0f/9.0f, 8.0f/9.0f, 8.0f/9.0f, 8.0f/9.0f
+ };
+
+ // data taken from ISO/IEC DIS 11172, Annexes 3-B.2[abcd] and 3-B.4:
+
+ // subbands 0-2 in tables 3-B.2a and 2b: (index is allocation)
+ public static final int table_ab1_codelength[] =
+ // bits per codeword
+ { 0, 5, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 };
+
+ public static final float table_ab1_groupingtables[][] =
+ // pointer to sample grouping table, or NULL-pointer if ungrouped
+ { null, grouping_5bits, null, null, null, null, null, null, null, null, null, null, null, null, null, null };
+
+ public static final float table_ab1_factor[] =
+ // factor for requantization: (real)sample * factor - 1.0 gives requantized sample
+ { 0.0f, 1.0f/2.0f, 1.0f/4.0f, 1.0f/8.0f, 1.0f/16.0f, 1.0f/32.0f, 1.0f/64.0f,
+ 1.0f/128.0f, 1.0f/256.0f, 1.0f/512.0f, 1.0f/1024.0f, 1.0f/2048.0f,
+ 1.0f/4096.0f, 1.0f/8192.0f, 1.0f/16384.0f, 1.0f/32768.0f };
+
+ public static final float table_ab1_c[] =
+ // factor c for requantization from table 3-B.4
+ { 0.0f, 1.33333333333f, 1.14285714286f, 1.06666666666f, 1.03225806452f,
+ 1.01587301587f, 1.00787401575f, 1.00392156863f, 1.00195694716f, 1.00097751711f,
+ 1.00048851979f, 1.00024420024f, 1.00012208522f, 1.00006103888f, 1.00003051851f,
+ 1.00001525902f };
+
+ public static final float table_ab1_d[] =
+ // addend d for requantization from table 3-B.4
+ { 0.0f, 0.50000000000f, 0.25000000000f, 0.12500000000f, 0.06250000000f,
+ 0.03125000000f, 0.01562500000f, 0.00781250000f, 0.00390625000f, 0.00195312500f,
+ 0.00097656250f, 0.00048828125f, 0.00024414063f, 0.00012207031f, 0.00006103516f,
+ 0.00003051758f };
+
+ // subbands 3-... tables 3-B.2a and 2b:
+ public static final float[] table_ab234_groupingtables[] =
+ { null, grouping_5bits, grouping_7bits, null, grouping_10bits, null, null, null, null, null, null, null, null, null, null, null };
+
+ // subbands 3-10 in tables 3-B.2a and 2b:
+ public static final int table_ab2_codelength[] =
+ { 0, 5, 7, 3, 10, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 16 };
+ public static final float table_ab2_factor[] =
+ { 0.0f, 1.0f/2.0f, 1.0f/4.0f, 1.0f/4.0f, 1.0f/8.0f, 1.0f/8.0f, 1.0f/16.0f,
+ 1.0f/32.0f, 1.0f/64.0f, 1.0f/128.0f, 1.0f/256.0f, 1.0f/512.0f,
+ 1.0f/1024.0f, 1.0f/2048.0f, 1.0f/4096.0f, 1.0f/32768.0f };
+ public static final float table_ab2_c[] =
+ { 0.0f, 1.33333333333f, 1.60000000000f, 1.14285714286f, 1.77777777777f,
+ 1.06666666666f, 1.03225806452f, 1.01587301587f, 1.00787401575f, 1.00392156863f,
+ 1.00195694716f, 1.00097751711f, 1.00048851979f, 1.00024420024f, 1.00012208522f,
+ 1.00001525902f };
+ public static final float table_ab2_d[] =
+ { 0.0f, 0.50000000000f, 0.50000000000f, 0.25000000000f, 0.50000000000f,
+ 0.12500000000f, 0.06250000000f, 0.03125000000f, 0.01562500000f, 0.00781250000f,
+ 0.00390625000f, 0.00195312500f, 0.00097656250f, 0.00048828125f, 0.00024414063f,
+ 0.00003051758f };
+
+ // subbands 11-22 in tables 3-B.2a and 2b:
+ public static final int table_ab3_codelength[] = { 0, 5, 7, 3, 10, 4, 5, 16 };
+ public static final float table_ab3_factor[] =
+ { 0.0f, 1.0f/2.0f, 1.0f/4.0f, 1.0f/4.0f, 1.0f/8.0f, 1.0f/8.0f, 1.0f/16.0f, 1.0f/32768.0f };
+ public static final float table_ab3_c[] =
+ { 0.0f, 1.33333333333f, 1.60000000000f, 1.14285714286f, 1.77777777777f,
+ 1.06666666666f, 1.03225806452f, 1.00001525902f };
+ public static final float table_ab3_d[] =
+ { 0.0f, 0.50000000000f, 0.50000000000f, 0.25000000000f, 0.50000000000f,
+ 0.12500000000f, 0.06250000000f, 0.00003051758f };
+
+ // subbands 23-... in tables 3-B.2a and 2b:
+ public static final int table_ab4_codelength[] = { 0, 5, 7, 16 };
+ public static final float table_ab4_factor[] = { 0.0f, 1.0f/2.0f, 1.0f/4.0f, 1.0f/32768.0f };
+ public static final float table_ab4_c[] = { 0.0f, 1.33333333333f, 1.60000000000f, 1.00001525902f };
+ public static final float table_ab4_d[] = { 0.0f, 0.50000000000f, 0.50000000000f, 0.00003051758f };
+
+ // subbands in tables 3-B.2c and 2d:
+ public static final int table_cd_codelength[] =
+ { 0, 5, 7, 10, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 };
+ public static final float table_cd_groupingtables[][] =
+ { null, grouping_5bits, grouping_7bits, grouping_10bits, null, null, null, null, null, null, null, null, null, null, null, null };
+ public static final float table_cd_factor[] =
+ { 0.0f, 1.0f/2.0f, 1.0f/4.0f, 1.0f/8.0f, 1.0f/8.0f, 1.0f/16.0f, 1.0f/32.0f, 1.0f/64.0f,
+ 1.0f/128.0f, 1.0f/256.0f, 1.0f/512.0f, 1.0f/1024.0f, 1.0f/2048.0f, 1.0f/4096.0f,
+ 1.0f/8192.0f, 1.0f/16384.0f };
+ public static final float table_cd_c[] =
+ { 0.0f, 1.33333333333f, 1.60000000000f, 1.77777777777f, 1.06666666666f,
+ 1.03225806452f, 1.01587301587f, 1.00787401575f, 1.00392156863f, 1.00195694716f,
+ 1.00097751711f, 1.00048851979f, 1.00024420024f, 1.00012208522f, 1.00006103888f,
+ 1.00003051851f };
+ public static final float table_cd_d[] =
+ { 0.0f, 0.50000000000f, 0.50000000000f, 0.50000000000f, 0.12500000000f,
+ 0.06250000000f, 0.03125000000f, 0.01562500000f, 0.00781250000f, 0.00390625000f,
+ 0.00195312500f, 0.00097656250f, 0.00048828125f, 0.00024414063f, 0.00012207031f,
+ 0.00006103516f };
+
+
+
+ protected int subbandnumber;
+ protected int allocation;
+ protected int scfsi;
+ protected float scalefactor1, scalefactor2, scalefactor3;
+ protected int[] codelength = {0};
+ protected float groupingtable[][] = new float[2][];
+ //protected float[][] groupingtable = {{0},{0}} ;
+ protected float[] factor = {0.0f};
+ protected int groupnumber;
+ protected int samplenumber;
+ protected float[] samples = new float[3];
+ protected float[] c = {0};
+ protected float[] d = {0};
+ /**
+ * Constructor
+ */
+ public SubbandLayer2(int subbandnumber)
+ {
+ this.subbandnumber = subbandnumber;
+ groupnumber = samplenumber = 0;
+ }
+
+
+ /**
+ *
+ */
+ protected int get_allocationlength (Header header)
+ {
+ if (header.version() == Header.MPEG1)
+ {
+ int channel_bitrate = header.bitrate_index();
+
+ // calculate bitrate per channel:
+ if (header.mode() != Header.SINGLE_CHANNEL)
+ if (channel_bitrate == 4)
+ channel_bitrate = 1;
+ else
+ channel_bitrate -= 4;
+
+ if (channel_bitrate == 1 || channel_bitrate == 2)
+ // table 3-B.2c or 3-B.2d
+ if (subbandnumber <= 1)
+ return 4;
+ else
+ return 3;
+ else
+ // tables 3-B.2a or 3-B.2b
+ if (subbandnumber <= 10)
+ return 4;
+ else if (subbandnumber <= 22)
+ return 3;
+ else
+ return 2;
+ }
+ else
+ { // MPEG-2 LSF -- Jeff
+
+ // table B.1 of ISO/IEC 13818-3
+ if (subbandnumber <= 3)
+ return 4;
+ else if (subbandnumber <= 10)
+ return 3;
+ else
+ return 2;
+ }
+ }
+
+ /**
+ *
+ */
+ protected void prepare_sample_reading(Header header, int allocation,
+ //float[][] groupingtable,
+ int channel,
+ float[] factor, int[] codelength,
+ float[] c, float[] d)
+ {
+ int channel_bitrate = header.bitrate_index();
+ // calculate bitrate per channel:
+ if (header.mode() != Header.SINGLE_CHANNEL)
+ if (channel_bitrate == 4)
+ channel_bitrate = 1;
+ else
+ channel_bitrate -= 4;
+
+ if (channel_bitrate == 1 || channel_bitrate == 2)
+ {
+ // table 3-B.2c or 3-B.2d
+ groupingtable[channel] = table_cd_groupingtables[allocation];
+ factor[0] = table_cd_factor[allocation];
+ codelength[0] = table_cd_codelength[allocation];
+ c[0] = table_cd_c[allocation];
+ d[0] = table_cd_d[allocation];
+ }
+ else
+ {
+ // tables 3-B.2a or 3-B.2b
+ if (subbandnumber <= 2)
+ {
+ groupingtable[channel] = table_ab1_groupingtables[allocation];
+ factor[0] = table_ab1_factor[allocation];
+ codelength[0] = table_ab1_codelength[allocation];
+ c[0] = table_ab1_c[allocation];
+ d[0] = table_ab1_d[allocation];
+ }
+ else
+ {
+ groupingtable[channel] = table_ab234_groupingtables[allocation];
+ if (subbandnumber <= 10)
+ {
+ factor[0] = table_ab2_factor[allocation];
+ codelength[0] = table_ab2_codelength[allocation];
+ c[0] = table_ab2_c[allocation];
+ d[0] = table_ab2_d[allocation];
+ }
+ else if (subbandnumber <= 22)
+ {
+ factor[0] = table_ab3_factor[allocation];
+ codelength[0] = table_ab3_codelength[allocation];
+ c[0] = table_ab3_c[allocation];
+ d[0] = table_ab3_d[allocation];
+ }
+ else
+ {
+ factor[0] = table_ab4_factor[allocation];
+ codelength[0] = table_ab4_codelength[allocation];
+ c[0] = table_ab4_c[allocation];
+ d[0] = table_ab4_d[allocation];
+ }
+ }
+ }
+ }
+
+
+ /**
+ *
+ */
+ public void read_allocation(Bitstream stream, Header header, Crc16 crc)
+ {
+ int length = get_allocationlength(header);
+ allocation = stream.get_bits(length);
+ if (crc != null)
+ crc.add_bits(allocation, length);
+ }
+
+ /**
+ *
+ */
+ public void read_scalefactor_selection (Bitstream stream, Crc16 crc)
+ {
+ if (allocation != 0)
+ {
+ scfsi = stream.get_bits(2);
+ if (crc != null) crc.add_bits(scfsi, 2);
+ }
+ }
+
+ /**
+ *
+ */
+ public void read_scalefactor (Bitstream stream, Header header)
+ {
+ if (allocation != 0)
+ {
+ switch (scfsi)
+ {
+ case 0:
+ scalefactor1 = scalefactors[stream.get_bits(6)];
+ scalefactor2 = scalefactors[stream.get_bits(6)];
+ scalefactor3 = scalefactors[stream.get_bits(6)];
+ break;
+ case 1:
+ scalefactor1 = scalefactor2 = scalefactors[stream.get_bits(6)];
+ scalefactor3 = scalefactors[stream.get_bits(6)];
+ break;
+ case 2:
+ scalefactor1 = scalefactor2 = scalefactor3 = scalefactors[stream.get_bits(6)];
+ break;
+ case 3:
+ scalefactor1 = scalefactors[stream.get_bits(6)];
+ scalefactor2 = scalefactor3 = scalefactors[stream.get_bits(6)];
+ break;
+ }
+ prepare_sample_reading(header, allocation, 0,
+ factor, codelength, c, d);
+ }
+ }
+
+ /**
+ *
+ */
+ public boolean read_sampledata (Bitstream stream)
+ {
+ if (allocation != 0)
+ if (groupingtable[0] != null)
+ {
+ int samplecode = stream.get_bits(codelength[0]);
+ // create requantized samples:
+ samplecode += samplecode << 1;
+ float[] target = samples;
+ float[] source = groupingtable[0];
+ /*
+ int tmp = 0;
+ int temp = 0;
+ target[tmp++] = source[samplecode + temp];
+ temp++;
+ target[tmp++] = source[samplecode + temp];
+ temp++;
+ target[tmp] = source[samplecode + temp];
+ */
+ //Bugfix:
+ int tmp = 0;
+ int temp = samplecode;
+
+ if(temp > source.length - 3) temp = source.length - 3;
+
+ target[tmp] = source[temp];
+ temp++;tmp++;
+ target[tmp] = source[temp];
+ temp++;tmp++;
+ target[tmp] = source[temp];
+
+ // memcpy (samples, groupingtable + samplecode, 3 * sizeof (real));
+ }
+ else
+ {
+ samples[0] = (float) ((stream.get_bits(codelength[0])) * factor[0] - 1.0);
+ samples[1] = (float) ((stream.get_bits(codelength[0])) * factor[0] - 1.0);
+ samples[2] = (float) ((stream.get_bits(codelength[0])) * factor[0] - 1.0);
+ }
+
+ samplenumber = 0;
+ if (++groupnumber == 12)
+ return true;
+ else
+ return false;
+ }
+
+ /**
+ *
+ */
+ public boolean put_next_sample(int channels, SynthesisFilter filter1, SynthesisFilter filter2)
+ {
+ if ((allocation != 0) && (channels != OutputChannels.RIGHT_CHANNEL))
+ {
+ float sample = samples[samplenumber];
+
+ if (groupingtable[0] == null)
+ sample = (sample + d[0]) * c[0];
+ if (groupnumber <= 4)
+ sample *= scalefactor1;
+ else if (groupnumber <= 8)
+ sample *= scalefactor2;
+ else
+ sample *= scalefactor3;
+ filter1.input_sample(sample, subbandnumber);
+ }
+
+ if (++samplenumber == 3)
+ return true;
+ else
+ return false;
+ }
+ };
+
+ /**
+ * Class for layer II subbands in joint stereo mode.
+ */
+ static class SubbandLayer2IntensityStereo extends SubbandLayer2
+ {
+ protected int channel2_scfsi;
+ protected float channel2_scalefactor1, channel2_scalefactor2, channel2_scalefactor3;
+
+ /**
+ * Constructor
+ */
+ public SubbandLayer2IntensityStereo (int subbandnumber)
+ {
+ super(subbandnumber);
+ }
+
+ /**
+ *
+ */
+ public void read_allocation(Bitstream stream, Header header, Crc16 crc)
+ {
+ super.read_allocation (stream, header, crc);
+ }
+
+ /**
+ *
+ */
+ public void read_scalefactor_selection(Bitstream stream, Crc16 crc)
+ {
+ if (allocation != 0)
+ {
+ scfsi = stream.get_bits(2);
+ channel2_scfsi = stream.get_bits(2);
+ if (crc != null)
+ {
+ crc.add_bits(scfsi, 2);
+ crc.add_bits(channel2_scfsi, 2);
+ }
+ }
+ }
+
+ /**
+ *
+ */
+ public void read_scalefactor(Bitstream stream, Header header)
+ {
+ if (allocation != 0)
+ {
+ super.read_scalefactor(stream, header);
+ switch (channel2_scfsi)
+ {
+ case 0:
+ channel2_scalefactor1 = scalefactors[stream.get_bits(6)];
+ channel2_scalefactor2 = scalefactors[stream.get_bits(6)];
+ channel2_scalefactor3 = scalefactors[stream.get_bits(6)];
+ break;
+
+ case 1:
+ channel2_scalefactor1 = channel2_scalefactor2 = scalefactors[stream.get_bits (6)];
+ channel2_scalefactor3 = scalefactors[stream.get_bits(6)];
+ break;
+
+ case 2:
+ channel2_scalefactor1 = channel2_scalefactor2 =
+ channel2_scalefactor3 = scalefactors[stream.get_bits(6)];
+ break;
+
+ case 3:
+ channel2_scalefactor1 = scalefactors[stream.get_bits(6)];
+ channel2_scalefactor2 = channel2_scalefactor3 = scalefactors[stream.get_bits (6)];
+ break;
+ }
+ }
+
+ }
+
+ /**
+ *
+ */
+ public boolean read_sampledata(Bitstream stream)
+ {
+ return super.read_sampledata (stream);
+ }
+
+ /**
+ *
+ */
+ public boolean put_next_sample(int channels, SynthesisFilter filter1, SynthesisFilter filter2)
+ {
+ if (allocation != 0)
+ {
+ float sample = samples[samplenumber];
+
+ if (groupingtable[0] == null)
+ sample = (sample + d[0]) * c[0];
+ if (channels == OutputChannels.BOTH_CHANNELS)
+ {
+ float sample2 = sample;
+ if (groupnumber <= 4)
+ {
+ sample *= scalefactor1;
+ sample2 *= channel2_scalefactor1;
+ }
+ else if (groupnumber <= 8)
+ {
+ sample *= scalefactor2;
+ sample2 *= channel2_scalefactor2;
+ }
+ else
+ {
+ sample *= scalefactor3;
+ sample2 *= channel2_scalefactor3;
+ }
+ filter1.input_sample(sample, subbandnumber);
+ filter2.input_sample(sample2, subbandnumber);
+ }
+ else if (channels == OutputChannels.LEFT_CHANNEL)
+ {
+ if (groupnumber <= 4)
+ sample *= scalefactor1;
+ else if (groupnumber <= 8)
+ sample *= scalefactor2;
+ else
+ sample *= scalefactor3;
+ filter1.input_sample(sample, subbandnumber);
+ }
+ else
+ {
+ if (groupnumber <= 4)
+ sample *= channel2_scalefactor1;
+ else if (groupnumber <= 8)
+ sample *= channel2_scalefactor2;
+ else
+ sample *= channel2_scalefactor3;
+ filter1.input_sample(sample, subbandnumber);
+ }
+ }
+
+ if (++samplenumber == 3)
+ return true;
+ else
+ return false;
+ }
+ };
+
+ /**
+ * Class for layer II subbands in stereo mode.
+ */
+ static class SubbandLayer2Stereo extends SubbandLayer2
+ {
+ protected int channel2_allocation;
+ protected int channel2_scfsi;
+ protected float channel2_scalefactor1, channel2_scalefactor2, channel2_scalefactor3;
+ //protected boolean channel2_grouping; ???? Never used!
+ protected int[] channel2_codelength = {0};
+ //protected float[][] channel2_groupingtable = {{0},{0}};
+ protected float[] channel2_factor = {0};
+ protected float[] channel2_samples;
+ protected float[] channel2_c = {0};
+ protected float[] channel2_d = {0};
+
+ /**
+ * Constructor
+ */
+ public SubbandLayer2Stereo(int subbandnumber)
+ {
+ super(subbandnumber);
+ channel2_samples = new float[3];
+ }
+
+ /**
+ *
+ */
+ public void read_allocation (Bitstream stream, Header header, Crc16 crc)
+ {
+ int length = get_allocationlength(header);
+ allocation = stream.get_bits(length);
+ channel2_allocation = stream.get_bits(length);
+ if (crc != null)
+ {
+ crc.add_bits(allocation, length);
+ crc.add_bits(channel2_allocation, length);
+ }
+ }
+
+ /**
+ *
+ */
+ public void read_scalefactor_selection(Bitstream stream, Crc16 crc)
+ {
+ if (allocation != 0)
+ {
+ scfsi = stream.get_bits(2);
+ if (crc != null)
+ crc.add_bits(scfsi, 2);
+ }
+ if (channel2_allocation != 0)
+ {
+ channel2_scfsi = stream.get_bits(2);
+ if (crc != null)
+ crc.add_bits(channel2_scfsi, 2);
+ }
+ }
+
+ /**
+ *
+ */
+ public void read_scalefactor(Bitstream stream, Header header)
+ {
+ super.read_scalefactor(stream, header);
+ if (channel2_allocation != 0)
+ {
+ switch (channel2_scfsi)
+ {
+ case 0:
+ channel2_scalefactor1 = scalefactors[stream.get_bits(6)];
+ channel2_scalefactor2 = scalefactors[stream.get_bits(6)];
+ channel2_scalefactor3 = scalefactors[stream.get_bits(6)];
+ break;
+
+ case 1:
+ channel2_scalefactor1 = channel2_scalefactor2 =
+ scalefactors[stream.get_bits(6)];
+ channel2_scalefactor3 = scalefactors[stream.get_bits(6)];
+ break;
+
+ case 2:
+ channel2_scalefactor1 = channel2_scalefactor2 =
+ channel2_scalefactor3 = scalefactors[stream.get_bits(6)];
+ break;
+
+ case 3:
+ channel2_scalefactor1 = scalefactors[stream.get_bits(6)];
+ channel2_scalefactor2 = channel2_scalefactor3 =
+ scalefactors[stream.get_bits(6)];
+ break;
+ }
+ prepare_sample_reading(header, channel2_allocation, 1,
+ channel2_factor, channel2_codelength, channel2_c,
+ channel2_d);
+ }
+ }
+
+ /**
+ *
+ */
+ public boolean read_sampledata (Bitstream stream)
+ {
+ boolean returnvalue = super.read_sampledata(stream);
+
+ if (channel2_allocation != 0)
+ if (groupingtable[1] != null)
+ {
+ int samplecode = stream.get_bits(channel2_codelength[0]);
+ // create requantized samples:
+ samplecode += samplecode << 1;
+ /*
+ float[] target = channel2_samples;
+ float[] source = channel2_groupingtable[0];
+ int tmp = 0;
+ int temp = 0;
+ target[tmp++] = source[samplecode + temp];
+ temp++;
+ target[tmp++] = source[samplecode + temp];
+ temp++;
+ target[tmp] = source[samplecode + temp];
+ // memcpy (channel2_samples, channel2_groupingtable + samplecode, 3 * sizeof (real));
+ */
+ float[] target = channel2_samples;
+ float[] source = groupingtable[1];
+ int tmp = 0;
+ int temp = samplecode;
+ target[tmp] = source[temp];
+ temp++;tmp++;
+ target[tmp] = source[temp];
+ temp++;tmp++;
+ target[tmp] = source[temp];
+
+ }
+ else
+ {
+ channel2_samples[0] = (float) ((stream.get_bits(channel2_codelength[0])) *
+ channel2_factor[0] - 1.0);
+ channel2_samples[1] = (float) ((stream.get_bits(channel2_codelength[0])) *
+ channel2_factor[0] - 1.0);
+ channel2_samples[2] = (float) ((stream.get_bits(channel2_codelength[0])) *
+ channel2_factor[0] - 1.0);
+ }
+ return returnvalue;
+ }
+
+ /**
+ *
+ */
+ public boolean put_next_sample(int channels, SynthesisFilter filter1, SynthesisFilter filter2)
+ {
+ boolean returnvalue = super.put_next_sample(channels, filter1, filter2);
+ if ((channel2_allocation != 0) && (channels != OutputChannels.LEFT_CHANNEL))
+ {
+ float sample = channel2_samples[samplenumber - 1];
+
+ if (groupingtable[1] == null)
+ sample = (sample + channel2_d[0]) * channel2_c[0];
+
+ if (groupnumber <= 4)
+ sample *= channel2_scalefactor1;
+ else if (groupnumber <= 8)
+ sample *= channel2_scalefactor2;
+ else
+ sample *= channel2_scalefactor3;
+ if (channels == OutputChannels.BOTH_CHANNELS)
+ filter2.input_sample(sample, subbandnumber);
+ else
+ filter1.input_sample(sample, subbandnumber);
+ }
+ return returnvalue;
+ }
+ }
+}
diff --git a/Robust/src/Tests/ssJava/mp3decoder/LayerIIIDecoder.java b/Robust/src/Tests/ssJava/mp3decoder/LayerIIIDecoder.java
new file mode 100644
index 00000000..9e66a93b
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/LayerIIIDecoder.java
@@ -0,0 +1,2454 @@
+/*
+ * 11/19/04 1.0 moved to LGPL.
+ *
+ * 18/06/01 Michael Scheerer, Fixed bugs which causes
+ * negative indexes in method huffmann_decode and in method
+ * dequanisize_sample.
+ *
+ * 16/07/01 Michael Scheerer, Catched a bug in method
+ * huffmann_decode, which causes an outOfIndexException.
+ * Cause : Indexnumber of 24 at SfBandIndex,
+ * which has only a length of 22. I have simply and dirty
+ * fixed the index to <= 22, because I'm not really be able
+ * to fix the bug. The Indexnumber is taken from the MP3
+ * file and the origin Ma-Player with the same code works
+ * well.
+ *
+ * 02/19/99 Java Conversion by E.B, javalayer@javazoom.net
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+
+package javazoom.jl.decoder;
+
+/**
+ * Class Implementing Layer 3 Decoder.
+ *
+ * @since 0.0
+ */
+final class LayerIIIDecoder implements FrameDecoder {
+ final double d43 = (4.0 / 3.0);
+
+ public int[] scalefac_buffer;
+
+ // MDM: removed, as this wasn't being used.
+ // private float CheckSumOut1d = 0.0f;
+ private int CheckSumHuff = 0;
+ private int[] is_1d;
+ private float[][][] ro;
+ private float[][][] lr;
+ private float[] out_1d;
+ private float[][] prevblck;
+ private float[][] k;
+ private int[] nonzero;
+ private Bitstream stream;
+ @HEADER private Header header;
+ private SynthesisFilter filter1, filter2;
+ private Obuffer buffer;
+ private int which_channels;
+ private BitReserve br;
+ private III_side_info_t si;
+
+ private temporaire2[] III_scalefac_t;
+ private temporaire2[] scalefac;
+ // private III_scalefac_t scalefac;
+
+ private int max_gr;
+ private int frame_start;
+ private int part2_start;
+ private int channels;
+ private int first_channel;
+ private int last_channel;
+ private int sfreq;
+
+ /**
+ * Constructor.
+ */
+ // REVIEW: these constructor arguments should be moved to the
+ // decodeFrame() method, where possible, so that one
+ public LayerIIIDecoder(Bitstream stream0, Header header0, SynthesisFilter filtera,
+ SynthesisFilter filterb, Obuffer buffer0, int which_ch0) {
+ huffcodetab.inithuff();
+ is_1d = new int[SBLIMIT * SSLIMIT + 4];
+ ro = new float[2][SBLIMIT][SSLIMIT];
+ lr = new float[2][SBLIMIT][SSLIMIT];
+ out_1d = new float[SBLIMIT * SSLIMIT];
+ prevblck = new float[2][SBLIMIT * SSLIMIT];
+ k = new float[2][SBLIMIT * SSLIMIT];
+ nonzero = new int[2];
+
+ // III_scalefact_t
+ III_scalefac_t = new temporaire2[2];
+ III_scalefac_t[0] = new temporaire2();
+ III_scalefac_t[1] = new temporaire2();
+ scalefac = III_scalefac_t;
+ // L3TABLE INIT
+
+ sfBandIndex = new SBI[9]; // SZD: MPEG2.5 +3 indices
+ int[] l0 =
+ { 0, 6, 12, 18, 24, 30, 36, 44, 54, 66, 80, 96, 116, 140, 168, 200, 238, 284, 336, 396,
+ 464, 522, 576 };
+ int[] s0 = { 0, 4, 8, 12, 18, 24, 32, 42, 56, 74, 100, 132, 174, 192 };
+ int[] l1 =
+ { 0, 6, 12, 18, 24, 30, 36, 44, 54, 66, 80, 96, 114, 136, 162, 194, 232, 278, 330, 394,
+ 464, 540, 576 };
+ int[] s1 = { 0, 4, 8, 12, 18, 26, 36, 48, 62, 80, 104, 136, 180, 192 };
+ int[] l2 =
+ { 0, 6, 12, 18, 24, 30, 36, 44, 54, 66, 80, 96, 116, 140, 168, 200, 238, 284, 336, 396,
+ 464, 522, 576 };
+ int[] s2 = { 0, 4, 8, 12, 18, 26, 36, 48, 62, 80, 104, 134, 174, 192 };
+
+ int[] l3 =
+ { 0, 4, 8, 12, 16, 20, 24, 30, 36, 44, 52, 62, 74, 90, 110, 134, 162, 196, 238, 288, 342,
+ 418, 576 };
+ int[] s3 = { 0, 4, 8, 12, 16, 22, 30, 40, 52, 66, 84, 106, 136, 192 };
+ int[] l4 =
+ { 0, 4, 8, 12, 16, 20, 24, 30, 36, 42, 50, 60, 72, 88, 106, 128, 156, 190, 230, 276, 330,
+ 384, 576 };
+ int[] s4 = { 0, 4, 8, 12, 16, 22, 28, 38, 50, 64, 80, 100, 126, 192 };
+ int[] l5 =
+ { 0, 4, 8, 12, 16, 20, 24, 30, 36, 44, 54, 66, 82, 102, 126, 156, 194, 240, 296, 364, 448,
+ 550, 576 };
+ int[] s5 = { 0, 4, 8, 12, 16, 22, 30, 42, 58, 78, 104, 138, 180, 192 };
+ // SZD: MPEG2.5
+ int[] l6 =
+ { 0, 6, 12, 18, 24, 30, 36, 44, 54, 66, 80, 96, 116, 140, 168, 200, 238, 284, 336, 396,
+ 464, 522, 576 };
+ int[] s6 = { 0, 4, 8, 12, 18, 26, 36, 48, 62, 80, 104, 134, 174, 192 };
+ int[] l7 =
+ { 0, 6, 12, 18, 24, 30, 36, 44, 54, 66, 80, 96, 116, 140, 168, 200, 238, 284, 336, 396,
+ 464, 522, 576 };
+ int[] s7 = { 0, 4, 8, 12, 18, 26, 36, 48, 62, 80, 104, 134, 174, 192 };
+ int[] l8 =
+ { 0, 12, 24, 36, 48, 60, 72, 88, 108, 132, 160, 192, 232, 280, 336, 400, 476, 566, 568,
+ 570, 572, 574, 576 };
+ int[] s8 = { 0, 8, 16, 24, 36, 52, 72, 96, 124, 160, 162, 164, 166, 192 };
+
+ sfBandIndex[0] = new SBI(l0, s0);
+ sfBandIndex[1] = new SBI(l1, s1);
+ sfBandIndex[2] = new SBI(l2, s2);
+
+ sfBandIndex[3] = new SBI(l3, s3);
+ sfBandIndex[4] = new SBI(l4, s4);
+ sfBandIndex[5] = new SBI(l5, s5);
+ // SZD: MPEG2.5
+ sfBandIndex[6] = new SBI(l6, s6);
+ sfBandIndex[7] = new SBI(l7, s7);
+ sfBandIndex[8] = new SBI(l8, s8);
+ // END OF L3TABLE INIT
+
+ if (reorder_table == null) { // SZD: generate LUT
+ reorder_table = new int[9][];
+ for (int i = 0; i < 9; i++)
+ reorder_table[i] = reorder(sfBandIndex[i].s);
+ }
+
+ // Sftable
+ int[] ll0 = { 0, 6, 11, 16, 21 };
+ int[] ss0 = { 0, 6, 12 };
+ sftable = new Sftable(ll0, ss0);
+ // END OF Sftable
+
+ // scalefac_buffer
+ scalefac_buffer = new int[54];
+ // END OF scalefac_buffer
+
+ stream = stream0;
+ header = header0;
+ filter1 = filtera;
+ filter2 = filterb;
+ buffer = buffer0;
+ which_channels = which_ch0;
+
+ frame_start = 0;
+ channels = (header.mode() == Header.SINGLE_CHANNEL) ? 1 : 2;
+ max_gr = (header.version() == Header.MPEG1) ? 2 : 1;
+
+ sfreq =
+ header.sample_frequency()
+ + ((header.version() == Header.MPEG1) ? 3 : (header.version() == Header.MPEG25_LSF) ? 6
+ : 0); // SZD
+
+ if (channels == 2) {
+ switch (which_channels) {
+ case OutputChannels.LEFT_CHANNEL:
+ case OutputChannels.DOWNMIX_CHANNELS:
+ first_channel = last_channel = 0;
+ break;
+
+ case OutputChannels.RIGHT_CHANNEL:
+ first_channel = last_channel = 1;
+ break;
+
+ case OutputChannels.BOTH_CHANNELS:
+ default:
+ first_channel = 0;
+ last_channel = 1;
+ break;
+ }
+ } else {
+ first_channel = last_channel = 0;
+ }
+
+ for (int ch = 0; ch < 2; ch++)
+ for (int j = 0; j < 576; j++)
+ prevblck[ch][j] = 0.0f;
+
+ nonzero[0] = nonzero[1] = 576;
+
+ br = new BitReserve();
+ si = new III_side_info_t();
+ }
+
+ /**
+ * Notify decoder that a seek is being made.
+ */
+ public void seek_notify() {
+ frame_start = 0;
+ for (int ch = 0; ch < 2; ch++)
+ for (int j = 0; j < 576; j++)
+ prevblck[ch][j] = 0.0f;
+ br = new BitReserve();
+ }
+
+ public void decodeFrame() {
+ decode();
+ }
+
+ /**
+ * Decode one frame, filling the buffer with the output samples.
+ */
+
+ // subband samples are buffered and passed to the
+ // SynthesisFilter in one go.
+ private float[] samples1 = new float[32];
+ private float[] samples2 = new float[32];
+
+ /* location hierarchy of decode()
+{header} {stream} {si}
+{br, flush_main, main_data_end,frame_start,nSlots,bytes_to_discard}*
+{gr,max_gr} // granule
+{ch,channels,first_channel, last_channel, which_channels} // channel
+{part2_start}
+{sb18, ss}
+{out_1d}*
+{sb}*
+{samples1,sample2} {filter1,filter2}
+ */
+ public void decode() {
+ int nSlots = header.slots();
+ int flush_main;
+ int gr, ch, ss, sb, sb18;
+ int main_data_end;
+ int bytes_to_discard;
+ int i;
+
+ get_side_info();
+
+ for (i = 0; i < nSlots; i++)
+ br.hputbuf(stream.get_bits(8)); // br < stream
+
+ // br < main_data_end
+ main_data_end = br.hsstell() >>> 3; // of previous frame
+
+
+ if ((flush_main = (br.hsstell() & 7)) != 0) { // flush_main < br
+ br.hgetbits(8 - flush_main); // br < flush_main
+ main_data_end++; // main_data_end*
+ }
+
+ // bytes_to_discard < GLB(frame_start,main_data_end,si)
+ // TODO does bytes_to_discard need to go back to si???
+ bytes_to_discard = frame_start - main_data_end - si.main_data_begin;
+
+ // frame_start should be *
+ frame_start += nSlots;
+
+ if (bytes_to_discard < 0)
+ return;
+
+ if (main_data_end > 4096) { // main_data_end should be > than 'frame_start' and 'br'
+ frame_start -= 4096;
+ br.rewindNbytes(4096);
+ }
+
+ for (; bytes_to_discard > 0; bytes_to_discard--) // bytes_to_discard > br
+ br.hgetbits(8);
+
+ // here 'gr' and 'max_gr' should be higher than 'ch','channels', and more
+ for (gr = 0; gr < max_gr; gr++) {
+ // in the loop body, access set={part2_start}
+
+ // 'ch', 'channels' should be higher than all locs in the below body
+ for (ch = 0; ch < channels; ch++) {
+ part2_start = br.hsstell(); // part2_start < br
+
+ if (header.version() == Header.MPEG1)
+ get_scale_factors(ch, gr); // no need to care from this side
+ else
+ // MPEG-2 LSF, SZD: MPEG-2.5 LSF
+ get_LSF_scale_factors(ch, gr); // no need to care from this side
+
+ huffman_decode(ch, gr); // no need to care from this side
+ // System.out.println("CheckSum HuffMan = " + CheckSumHuff);
+ dequantize_sample(ro[ch], ch, gr); // no need to care from this side
+ }
+
+ stereo(gr); // no need to care from this side
+
+ if ((which_channels == OutputChannels.DOWNMIX_CHANNELS) && (channels > 1))
+ do_downmix();
+
+ for (ch = first_channel; ch <= last_channel; ch++) { // 'ch' and 'first_channel' > the body
+
+ // in the body
+ // read set= lr,ch,gr,out_1d, sb18, ss, SSLIMIT, out_1d
+ // write set= out_1d
+
+ reorder(lr[ch], ch, gr);
+ antialias(ch, gr);
+ // for (int hb = 0;hb<576;hb++) CheckSumOut1d = CheckSumOut1d +
+ // out_1d[hb];
+ // System.out.println("CheckSumOut1d = "+CheckSumOut1d);
+
+ hybrid(ch, gr);
+
+ // for (int hb = 0;hb<576;hb++) CheckSumOut1d = CheckSumOut1d +
+ // out_1d[hb];
+ // System.out.println("CheckSumOut1d = "+CheckSumOut1d);
+
+ for (sb18 = 18; sb18 < 576; sb18 += 36) // sb18 > ss, SSLIMIT, out1d
+ // Frequency inversion
+ for (ss = 1; ss < SSLIMIT; ss += 2) // 'ss','SSLIMIT' > out_1d
+ out_1d[sb18 + ss] = -out_1d[sb18 + ss]; // out1d*
+
+ // 'ch', 'which_channels' should be higher than if/else body!
+ // location set written by if/else body
+ // = {samples1, samples2, filter1, filter2}
+ if ((ch == 0) || (which_channels == OutputChannels.RIGHT_CHANNEL)) {
+ for (ss = 0; ss < SSLIMIT; ss++) { // Polyphase synthesis
+ sb = 0;
+ for (sb18 = 0; sb18 < 576; sb18 += 18) {
+ samples1[sb] = out_1d[sb18 + ss]; // out_1d > samples1
+ // filter1.input_sample(out_1d[sb18+ss], sb);
+ sb++; // sb should be loc*
+ }
+ filter1.input_samples(samples1);
+ filter1.calculate_pcm_samples(buffer);
+ }
+ } else {
+ for (ss = 0; ss < SSLIMIT; ss++) { // Polyphase synthesis
+ sb = 0;
+ for (sb18 = 0; sb18 < 576; sb18 += 18) {
+ samples2[sb] = out_1d[sb18 + ss]; // out_1d > samples2
+ // filter2.input_sample(out_1d[sb18+ss], sb);
+ sb++;
+ }
+ filter2.input_samples(samples2);
+ filter2.calculate_pcm_samples(buffer);
+ }
+
+ }
+ } // channels
+ } // granule
+
+ // System.out.println("Counter = ................................."+counter);
+ // if (counter < 609)
+ // {
+ counter++; // count should be loc*
+ buffer.write_buffer(1); // buffer!!!
+ // }
+ // else if (counter == 609)
+ // {
+ // buffer.close();
+ // counter++;
+ // }
+ // else
+ // {
+ // }
+
+ }
+
+ /**
+ * Reads the side info from the stream, assuming the entire. frame has been
+ * read already. Mono : 136 bits (= 17 bytes) Stereo : 256 bits (= 32 bytes)
+ */
+ private boolean get_side_info() {
+ int ch, gr;
+ if (header.version() == Header.MPEG1) {
+
+ si.main_data_begin = stream.get_bits(9);
+ if (channels == 1)
+ si.private_bits = stream.get_bits(5);
+ else
+ si.private_bits = stream.get_bits(3);
+
+ for (ch = 0; ch < channels; ch++) {
+ si.ch[ch].scfsi[0] = stream.get_bits(1);
+ si.ch[ch].scfsi[1] = stream.get_bits(1);
+ si.ch[ch].scfsi[2] = stream.get_bits(1);
+ si.ch[ch].scfsi[3] = stream.get_bits(1);
+ }
+
+ for (gr = 0; gr < 2; gr++) {
+ for (ch = 0; ch < channels; ch++) {
+ si.ch[ch].gr[gr].part2_3_length = stream.get_bits(12);
+ si.ch[ch].gr[gr].big_values = stream.get_bits(9);
+ si.ch[ch].gr[gr].global_gain = stream.get_bits(8);
+ si.ch[ch].gr[gr].scalefac_compress = stream.get_bits(4);
+ si.ch[ch].gr[gr].window_switching_flag = stream.get_bits(1);
+ if ((si.ch[ch].gr[gr].window_switching_flag) != 0) {
+ si.ch[ch].gr[gr].block_type = stream.get_bits(2);
+ si.ch[ch].gr[gr].mixed_block_flag = stream.get_bits(1);
+
+ si.ch[ch].gr[gr].table_select[0] = stream.get_bits(5);
+ si.ch[ch].gr[gr].table_select[1] = stream.get_bits(5);
+
+ si.ch[ch].gr[gr].subblock_gain[0] = stream.get_bits(3);
+ si.ch[ch].gr[gr].subblock_gain[1] = stream.get_bits(3);
+ si.ch[ch].gr[gr].subblock_gain[2] = stream.get_bits(3);
+
+ // Set region_count parameters since they are implicit in this case.
+
+ if (si.ch[ch].gr[gr].block_type == 0) {
+ // Side info bad: block_type == 0 in split block
+ return false;
+ } else if (si.ch[ch].gr[gr].block_type == 2 && si.ch[ch].gr[gr].mixed_block_flag == 0) {
+ si.ch[ch].gr[gr].region0_count = 8;
+ } else {
+ si.ch[ch].gr[gr].region0_count = 7;
+ }
+ si.ch[ch].gr[gr].region1_count = 20 - si.ch[ch].gr[gr].region0_count;
+ } else {
+ si.ch[ch].gr[gr].table_select[0] = stream.get_bits(5);
+ si.ch[ch].gr[gr].table_select[1] = stream.get_bits(5);
+ si.ch[ch].gr[gr].table_select[2] = stream.get_bits(5);
+ si.ch[ch].gr[gr].region0_count = stream.get_bits(4);
+ si.ch[ch].gr[gr].region1_count = stream.get_bits(3);
+ si.ch[ch].gr[gr].block_type = 0;
+ }
+ si.ch[ch].gr[gr].preflag = stream.get_bits(1);
+ si.ch[ch].gr[gr].scalefac_scale = stream.get_bits(1);
+ si.ch[ch].gr[gr].count1table_select = stream.get_bits(1);
+ }
+ }
+
+ } else { // MPEG-2 LSF, SZD: MPEG-2.5 LSF
+
+ si.main_data_begin = stream.get_bits(8);
+ if (channels == 1)
+ si.private_bits = stream.get_bits(1);
+ else
+ si.private_bits = stream.get_bits(2);
+
+ for (ch = 0; ch < channels; ch++) {
+
+ si.ch[ch].gr[0].part2_3_length = stream.get_bits(12);
+ si.ch[ch].gr[0].big_values = stream.get_bits(9);
+ si.ch[ch].gr[0].global_gain = stream.get_bits(8);
+ si.ch[ch].gr[0].scalefac_compress = stream.get_bits(9);
+ si.ch[ch].gr[0].window_switching_flag = stream.get_bits(1);
+
+ if ((si.ch[ch].gr[0].window_switching_flag) != 0) {
+
+ si.ch[ch].gr[0].block_type = stream.get_bits(2);
+ si.ch[ch].gr[0].mixed_block_flag = stream.get_bits(1);
+ si.ch[ch].gr[0].table_select[0] = stream.get_bits(5);
+ si.ch[ch].gr[0].table_select[1] = stream.get_bits(5);
+
+ si.ch[ch].gr[0].subblock_gain[0] = stream.get_bits(3);
+ si.ch[ch].gr[0].subblock_gain[1] = stream.get_bits(3);
+ si.ch[ch].gr[0].subblock_gain[2] = stream.get_bits(3);
+
+ // Set region_count parameters since they are implicit in this case.
+
+ if (si.ch[ch].gr[0].block_type == 0) {
+ // Side info bad: block_type == 0 in split block
+ return false;
+ } else if (si.ch[ch].gr[0].block_type == 2 && si.ch[ch].gr[0].mixed_block_flag == 0) {
+ si.ch[ch].gr[0].region0_count = 8;
+ } else {
+ si.ch[ch].gr[0].region0_count = 7;
+ si.ch[ch].gr[0].region1_count = 20 - si.ch[ch].gr[0].region0_count;
+ }
+
+ } else {
+ si.ch[ch].gr[0].table_select[0] = stream.get_bits(5);
+ si.ch[ch].gr[0].table_select[1] = stream.get_bits(5);
+ si.ch[ch].gr[0].table_select[2] = stream.get_bits(5);
+ si.ch[ch].gr[0].region0_count = stream.get_bits(4);
+ si.ch[ch].gr[0].region1_count = stream.get_bits(3);
+ si.ch[ch].gr[0].block_type = 0;
+ }
+
+ si.ch[ch].gr[0].scalefac_scale = stream.get_bits(1);
+ si.ch[ch].gr[0].count1table_select = stream.get_bits(1);
+ } // for(ch=0; ch<channels; ch++)
+ } // if (header.version() == MPEG1)
+ return true;
+ }
+
+ /**
+ *
+ */
+ private void get_scale_factors(int ch, int gr) {
+ int sfb, window;
+ gr_info_s gr_info = (si.ch[ch].gr[gr]);
+ int scale_comp = gr_info.scalefac_compress;
+ int length0 = slen[0][scale_comp];
+ int length1 = slen[1][scale_comp];
+
+ if ((gr_info.window_switching_flag != 0) && (gr_info.block_type == 2)) {
+ if ((gr_info.mixed_block_flag) != 0) { // MIXED
+ for (sfb = 0; sfb < 8; sfb++)
+ scalefac[ch].l[sfb] = br.hgetbits(slen[0][gr_info.scalefac_compress]);
+ for (sfb = 3; sfb < 6; sfb++)
+ for (window = 0; window < 3; window++)
+ scalefac[ch].s[window][sfb] = br.hgetbits(slen[0][gr_info.scalefac_compress]);
+ for (sfb = 6; sfb < 12; sfb++)
+ for (window = 0; window < 3; window++)
+ scalefac[ch].s[window][sfb] = br.hgetbits(slen[1][gr_info.scalefac_compress]);
+ for (sfb = 12, window = 0; window < 3; window++)
+ scalefac[ch].s[window][sfb] = 0;
+
+ } else { // SHORT
+
+ scalefac[ch].s[0][0] = br.hgetbits(length0);
+ scalefac[ch].s[1][0] = br.hgetbits(length0);
+ scalefac[ch].s[2][0] = br.hgetbits(length0);
+ scalefac[ch].s[0][1] = br.hgetbits(length0);
+ scalefac[ch].s[1][1] = br.hgetbits(length0);
+ scalefac[ch].s[2][1] = br.hgetbits(length0);
+ scalefac[ch].s[0][2] = br.hgetbits(length0);
+ scalefac[ch].s[1][2] = br.hgetbits(length0);
+ scalefac[ch].s[2][2] = br.hgetbits(length0);
+ scalefac[ch].s[0][3] = br.hgetbits(length0);
+ scalefac[ch].s[1][3] = br.hgetbits(length0);
+ scalefac[ch].s[2][3] = br.hgetbits(length0);
+ scalefac[ch].s[0][4] = br.hgetbits(length0);
+ scalefac[ch].s[1][4] = br.hgetbits(length0);
+ scalefac[ch].s[2][4] = br.hgetbits(length0);
+ scalefac[ch].s[0][5] = br.hgetbits(length0);
+ scalefac[ch].s[1][5] = br.hgetbits(length0);
+ scalefac[ch].s[2][5] = br.hgetbits(length0);
+ scalefac[ch].s[0][6] = br.hgetbits(length1);
+ scalefac[ch].s[1][6] = br.hgetbits(length1);
+ scalefac[ch].s[2][6] = br.hgetbits(length1);
+ scalefac[ch].s[0][7] = br.hgetbits(length1);
+ scalefac[ch].s[1][7] = br.hgetbits(length1);
+ scalefac[ch].s[2][7] = br.hgetbits(length1);
+ scalefac[ch].s[0][8] = br.hgetbits(length1);
+ scalefac[ch].s[1][8] = br.hgetbits(length1);
+ scalefac[ch].s[2][8] = br.hgetbits(length1);
+ scalefac[ch].s[0][9] = br.hgetbits(length1);
+ scalefac[ch].s[1][9] = br.hgetbits(length1);
+ scalefac[ch].s[2][9] = br.hgetbits(length1);
+ scalefac[ch].s[0][10] = br.hgetbits(length1);
+ scalefac[ch].s[1][10] = br.hgetbits(length1);
+ scalefac[ch].s[2][10] = br.hgetbits(length1);
+ scalefac[ch].s[0][11] = br.hgetbits(length1);
+ scalefac[ch].s[1][11] = br.hgetbits(length1);
+ scalefac[ch].s[2][11] = br.hgetbits(length1);
+ scalefac[ch].s[0][12] = 0;
+ scalefac[ch].s[1][12] = 0;
+ scalefac[ch].s[2][12] = 0;
+ } // SHORT
+
+ } else { // LONG types 0,1,3
+
+ if ((si.ch[ch].scfsi[0] == 0) || (gr == 0)) {
+ scalefac[ch].l[0] = br.hgetbits(length0);
+ scalefac[ch].l[1] = br.hgetbits(length0);
+ scalefac[ch].l[2] = br.hgetbits(length0);
+ scalefac[ch].l[3] = br.hgetbits(length0);
+ scalefac[ch].l[4] = br.hgetbits(length0);
+ scalefac[ch].l[5] = br.hgetbits(length0);
+ }
+ if ((si.ch[ch].scfsi[1] == 0) || (gr == 0)) {
+ scalefac[ch].l[6] = br.hgetbits(length0);
+ scalefac[ch].l[7] = br.hgetbits(length0);
+ scalefac[ch].l[8] = br.hgetbits(length0);
+ scalefac[ch].l[9] = br.hgetbits(length0);
+ scalefac[ch].l[10] = br.hgetbits(length0);
+ }
+ if ((si.ch[ch].scfsi[2] == 0) || (gr == 0)) {
+ scalefac[ch].l[11] = br.hgetbits(length1);
+ scalefac[ch].l[12] = br.hgetbits(length1);
+ scalefac[ch].l[13] = br.hgetbits(length1);
+ scalefac[ch].l[14] = br.hgetbits(length1);
+ scalefac[ch].l[15] = br.hgetbits(length1);
+ }
+ if ((si.ch[ch].scfsi[3] == 0) || (gr == 0)) {
+ scalefac[ch].l[16] = br.hgetbits(length1);
+ scalefac[ch].l[17] = br.hgetbits(length1);
+ scalefac[ch].l[18] = br.hgetbits(length1);
+ scalefac[ch].l[19] = br.hgetbits(length1);
+ scalefac[ch].l[20] = br.hgetbits(length1);
+ }
+
+ scalefac[ch].l[21] = 0;
+ scalefac[ch].l[22] = 0;
+ }
+ }
+
+ /**
+ *
+ */
+ // MDM: new_slen is fully initialized before use, no need
+ // to reallocate array.
+ private final int[] new_slen = new int[4];
+
+ private void get_LSF_scale_data(int ch, int gr) {
+
+ int scalefac_comp, int_scalefac_comp;
+ int mode_ext = header.mode_extension();
+ int m;
+ int blocktypenumber;
+ int blocknumber = 0;
+
+ gr_info_s gr_info = (si.ch[ch].gr[gr]);
+
+ scalefac_comp = gr_info.scalefac_compress;
+
+ if (gr_info.block_type == 2) {
+ if (gr_info.mixed_block_flag == 0)
+ blocktypenumber = 1;
+ else if (gr_info.mixed_block_flag == 1)
+ blocktypenumber = 2;
+ else
+ blocktypenumber = 0;
+ } else {
+ blocktypenumber = 0;
+ }
+
+ if (!(((mode_ext == 1) || (mode_ext == 3)) && (ch == 1))) {
+
+ if (scalefac_comp < 400) {
+
+ new_slen[0] = (scalefac_comp >>> 4) / 5;
+ new_slen[1] = (scalefac_comp >>> 4) % 5;
+ new_slen[2] = (scalefac_comp & 0xF) >>> 2;
+ new_slen[3] = (scalefac_comp & 3);
+ si.ch[ch].gr[gr].preflag = 0;
+ blocknumber = 0;
+
+ } else if (scalefac_comp < 500) {
+
+ new_slen[0] = ((scalefac_comp - 400) >>> 2) / 5;
+ new_slen[1] = ((scalefac_comp - 400) >>> 2) % 5;
+ new_slen[2] = (scalefac_comp - 400) & 3;
+ new_slen[3] = 0;
+ si.ch[ch].gr[gr].preflag = 0;
+ blocknumber = 1;
+
+ } else if (scalefac_comp < 512) {
+
+ new_slen[0] = (scalefac_comp - 500) / 3;
+ new_slen[1] = (scalefac_comp - 500) % 3;
+ new_slen[2] = 0;
+ new_slen[3] = 0;
+ si.ch[ch].gr[gr].preflag = 1;
+ blocknumber = 2;
+ }
+ }
+
+ if ((((mode_ext == 1) || (mode_ext == 3)) && (ch == 1))) {
+ int_scalefac_comp = scalefac_comp >>> 1;
+
+ if (int_scalefac_comp < 180) {
+ new_slen[0] = int_scalefac_comp / 36;
+ new_slen[1] = (int_scalefac_comp % 36) / 6;
+ new_slen[2] = (int_scalefac_comp % 36) % 6;
+ new_slen[3] = 0;
+ si.ch[ch].gr[gr].preflag = 0;
+ blocknumber = 3;
+ } else if (int_scalefac_comp < 244) {
+ new_slen[0] = ((int_scalefac_comp - 180) & 0x3F) >>> 4;
+ new_slen[1] = ((int_scalefac_comp - 180) & 0xF) >>> 2;
+ new_slen[2] = (int_scalefac_comp - 180) & 3;
+ new_slen[3] = 0;
+ si.ch[ch].gr[gr].preflag = 0;
+ blocknumber = 4;
+ } else if (int_scalefac_comp < 255) {
+ new_slen[0] = (int_scalefac_comp - 244) / 3;
+ new_slen[1] = (int_scalefac_comp - 244) % 3;
+ new_slen[2] = 0;
+ new_slen[3] = 0;
+ si.ch[ch].gr[gr].preflag = 0;
+ blocknumber = 5;
+ }
+ }
+
+ for (int x = 0; x < 45; x++)
+ // why 45, not 54?
+ scalefac_buffer[x] = 0;
+
+ m = 0;
+ for (int i = 0; i < 4; i++) {
+ for (int j = 0; j < nr_of_sfb_block[blocknumber][blocktypenumber][i]; j++) {
+ scalefac_buffer[m] = (new_slen[i] == 0) ? 0 : br.hgetbits(new_slen[i]);
+ m++;
+
+ } // for (unint32 j ...
+ } // for (uint32 i ...
+ }
+
+ /**
+ *
+ */
+ private void get_LSF_scale_factors(int ch, int gr) {
+ int m = 0;
+ int sfb, window;
+ gr_info_s gr_info = (si.ch[ch].gr[gr]);
+
+ get_LSF_scale_data(ch, gr);
+
+ if ((gr_info.window_switching_flag != 0) && (gr_info.block_type == 2)) {
+ if (gr_info.mixed_block_flag != 0) { // MIXED
+ for (sfb = 0; sfb < 8; sfb++) {
+ scalefac[ch].l[sfb] = scalefac_buffer[m];
+ m++;
+ }
+ for (sfb = 3; sfb < 12; sfb++) {
+ for (window = 0; window < 3; window++) {
+ scalefac[ch].s[window][sfb] = scalefac_buffer[m];
+ m++;
+ }
+ }
+ for (window = 0; window < 3; window++)
+ scalefac[ch].s[window][12] = 0;
+
+ } else { // SHORT
+
+ for (sfb = 0; sfb < 12; sfb++) {
+ for (window = 0; window < 3; window++) {
+ scalefac[ch].s[window][sfb] = scalefac_buffer[m];
+ m++;
+ }
+ }
+
+ for (window = 0; window < 3; window++)
+ scalefac[ch].s[window][12] = 0;
+ }
+ } else { // LONG types 0,1,3
+
+ for (sfb = 0; sfb < 21; sfb++) {
+ scalefac[ch].l[sfb] = scalefac_buffer[m];
+ m++;
+ }
+ scalefac[ch].l[21] = 0; // Jeff
+ scalefac[ch].l[22] = 0;
+ }
+ }
+
+ /**
+ *
+ */
+ int[] x = { 0 };
+ int[] y = { 0 };
+ int[] v = { 0 };
+ int[] w = { 0 };
+
+ private void huffman_decode(int ch, int gr) {
+ x[0] = 0;
+ y[0] = 0;
+ v[0] = 0;
+ w[0] = 0;
+
+ int part2_3_end = part2_start + si.ch[ch].gr[gr].part2_3_length;
+ int num_bits;
+ int region1Start;
+ int region2Start;
+ int index;
+
+ int buf, buf1;
+
+ huffcodetab h;
+
+ // Find region boundary for short block case
+
+ if (((si.ch[ch].gr[gr].window_switching_flag) != 0) && (si.ch[ch].gr[gr].block_type == 2)) {
+
+ // Region2.
+ // MS: Extrahandling for 8KHZ
+ region1Start = (sfreq == 8) ? 72 : 36; // sfb[9/3]*3=36 or in case 8KHZ =
+ // 72
+ region2Start = 576; // No Region2 for short block case
+
+ } else { // Find region boundary for long block case
+
+ buf = si.ch[ch].gr[gr].region0_count + 1;
+ buf1 = buf + si.ch[ch].gr[gr].region1_count + 1;
+
+ if (buf1 > sfBandIndex[sfreq].l.length - 1)
+ buf1 = sfBandIndex[sfreq].l.length - 1;
+
+ region1Start = sfBandIndex[sfreq].l[buf];
+ region2Start = sfBandIndex[sfreq].l[buf1]; /* MI */
+ }
+
+ index = 0;
+ // Read bigvalues area
+ for (int i = 0; i < (si.ch[ch].gr[gr].big_values << 1); i += 2) {
+ if (i < region1Start)
+ h = huffcodetab.ht[si.ch[ch].gr[gr].table_select[0]];
+ else if (i < region2Start)
+ h = huffcodetab.ht[si.ch[ch].gr[gr].table_select[1]];
+ else
+ h = huffcodetab.ht[si.ch[ch].gr[gr].table_select[2]];
+
+ huffcodetab.huffman_decoder(h, x, y, v, w, br);
+ // if (index >= is_1d.length)
+ // System.out.println("i0="+i+"/"+(si.ch[ch].gr[gr].big_values<<1)+" Index="+index+" is_1d="+is_1d.length);
+
+ is_1d[index++] = x[0];
+ is_1d[index++] = y[0];
+
+ CheckSumHuff = CheckSumHuff + x[0] + y[0];
+ // System.out.println("x = "+x[0]+" y = "+y[0]);
+ }
+
+ // Read count1 area
+ h = huffcodetab.ht[si.ch[ch].gr[gr].count1table_select + 32];
+ num_bits = br.hsstell();
+
+ while ((num_bits < part2_3_end) && (index < 576)) {
+
+ huffcodetab.huffman_decoder(h, x, y, v, w, br);
+
+ is_1d[index++] = v[0];
+ is_1d[index++] = w[0];
+ is_1d[index++] = x[0];
+ is_1d[index++] = y[0];
+ CheckSumHuff = CheckSumHuff + v[0] + w[0] + x[0] + y[0];
+ // System.out.println("v = "+v[0]+" w = "+w[0]);
+ // System.out.println("x = "+x[0]+" y = "+y[0]);
+ num_bits = br.hsstell();
+ }
+
+ if (num_bits > part2_3_end) {
+ br.rewindNbits(num_bits - part2_3_end);
+ index -= 4;
+ }
+
+ num_bits = br.hsstell();
+
+ // Dismiss stuffing bits
+ if (num_bits < part2_3_end)
+ br.hgetbits(part2_3_end - num_bits);
+
+ // Zero out rest
+
+ if (index < 576)
+ nonzero[ch] = index;
+ else
+ nonzero[ch] = 576;
+
+ if (index < 0)
+ index = 0;
+
+ // may not be necessary
+ for (; index < 576; index++)
+ is_1d[index] = 0;
+ }
+
+ /**
+ *
+ */
+ private void i_stereo_k_values(int is_pos, int io_type, int i) {
+ if (is_pos == 0) {
+ k[0][i] = 1.0f;
+ k[1][i] = 1.0f;
+ } else if ((is_pos & 1) != 0) {
+ k[0][i] = io[io_type][(is_pos + 1) >>> 1];
+ k[1][i] = 1.0f;
+ } else {
+ k[0][i] = 1.0f;
+ k[1][i] = io[io_type][is_pos >>> 1];
+ }
+ }
+
+ /**
+ *
+ */
+ private void dequantize_sample(float xr[][], int ch, int gr) {
+ gr_info_s gr_info = (si.ch[ch].gr[gr]);
+ int cb = 0;
+ int next_cb_boundary;
+ int cb_begin = 0;
+ int cb_width = 0;
+ int index = 0, t_index, j;
+ float g_gain;
+ float[][] xr_1d = xr;
+
+ // choose correct scalefactor band per block type, initalize boundary
+
+ if ((gr_info.window_switching_flag != 0) && (gr_info.block_type == 2)) {
+ if (gr_info.mixed_block_flag != 0)
+ next_cb_boundary = sfBandIndex[sfreq].l[1]; // LONG blocks: 0,1,3
+ else {
+ cb_width = sfBandIndex[sfreq].s[1];
+ next_cb_boundary = (cb_width << 2) - cb_width;
+ cb_begin = 0;
+ }
+ } else {
+ next_cb_boundary = sfBandIndex[sfreq].l[1]; // LONG blocks: 0,1,3
+ }
+
+ // Compute overall (global) scaling.
+
+ g_gain = (float) Math.pow(2.0, (0.25 * (gr_info.global_gain - 210.0)));
+
+ for (j = 0; j < nonzero[ch]; j++) {
+ // Modif E.B 02/22/99
+ int reste = j % SSLIMIT;
+ int quotien = (int) ((j - reste) / SSLIMIT);
+ if (is_1d[j] == 0)
+ xr_1d[quotien][reste] = 0.0f;
+ else {
+ int abv = is_1d[j];
+ // Pow Array fix (11/17/04)
+ if (abv < t_43.length) {
+ if (is_1d[j] > 0)
+ xr_1d[quotien][reste] = g_gain * t_43[abv];
+ else {
+ if (-abv < t_43.length)
+ xr_1d[quotien][reste] = -g_gain * t_43[-abv];
+ else
+ xr_1d[quotien][reste] = -g_gain * (float) Math.pow(-abv, d43);
+ }
+ } else {
+ if (is_1d[j] > 0)
+ xr_1d[quotien][reste] = g_gain * (float) Math.pow(abv, d43);
+ else
+ xr_1d[quotien][reste] = -g_gain * (float) Math.pow(-abv, d43);
+ }
+ }
+ }
+
+ // apply formula per block type
+ for (j = 0; j < nonzero[ch]; j++) {
+ // Modif E.B 02/22/99
+ int reste = j % SSLIMIT;
+ int quotien = (int) ((j - reste) / SSLIMIT);
+
+ if (index == next_cb_boundary) { /* Adjust critical band boundary */
+ if ((gr_info.window_switching_flag != 0) && (gr_info.block_type == 2)) {
+ if (gr_info.mixed_block_flag != 0) {
+
+ if (index == sfBandIndex[sfreq].l[8]) {
+ next_cb_boundary = sfBandIndex[sfreq].s[4];
+ next_cb_boundary = (next_cb_boundary << 2) - next_cb_boundary;
+ cb = 3;
+ cb_width = sfBandIndex[sfreq].s[4] - sfBandIndex[sfreq].s[3];
+
+ cb_begin = sfBandIndex[sfreq].s[3];
+ cb_begin = (cb_begin << 2) - cb_begin;
+
+ } else if (index < sfBandIndex[sfreq].l[8]) {
+
+ next_cb_boundary = sfBandIndex[sfreq].l[(++cb) + 1];
+
+ } else {
+
+ next_cb_boundary = sfBandIndex[sfreq].s[(++cb) + 1];
+ next_cb_boundary = (next_cb_boundary << 2) - next_cb_boundary;
+
+ cb_begin = sfBandIndex[sfreq].s[cb];
+ cb_width = sfBandIndex[sfreq].s[cb + 1] - cb_begin;
+ cb_begin = (cb_begin << 2) - cb_begin;
+ }
+
+ } else {
+
+ next_cb_boundary = sfBandIndex[sfreq].s[(++cb) + 1];
+ next_cb_boundary = (next_cb_boundary << 2) - next_cb_boundary;
+
+ cb_begin = sfBandIndex[sfreq].s[cb];
+ cb_width = sfBandIndex[sfreq].s[cb + 1] - cb_begin;
+ cb_begin = (cb_begin << 2) - cb_begin;
+ }
+
+ } else { // long blocks
+
+ next_cb_boundary = sfBandIndex[sfreq].l[(++cb) + 1];
+
+ }
+ }
+
+ // Do long/short dependent scaling operations
+
+ if ((gr_info.window_switching_flag != 0)
+ && (((gr_info.block_type == 2) && (gr_info.mixed_block_flag == 0)) || ((gr_info.block_type == 2)
+ && (gr_info.mixed_block_flag != 0) && (j >= 36)))) {
+
+ t_index = (index - cb_begin) / cb_width;
+ /*
+ * xr[sb][ss] *= pow(2.0, ((-2.0 * gr_info.subblock_gain[t_index]) -(0.5
+ * * (1.0 + gr_info.scalefac_scale) scalefac[ch].s[t_index][cb])));
+ */
+ int idx = scalefac[ch].s[t_index][cb] << gr_info.scalefac_scale;
+ idx += (gr_info.subblock_gain[t_index] << 2);
+
+ xr_1d[quotien][reste] *= two_to_negative_half_pow[idx];
+
+ } else { // LONG block types 0,1,3 & 1st 2 subbands of switched blocks
+ /*
+ * xr[sb][ss] *= pow(2.0, -0.5 * (1.0+gr_info.scalefac_scale)
+ * (scalefac[ch].l[cb] + gr_info.preflag * pretab[cb]));
+ */
+ int idx = scalefac[ch].l[cb];
+
+ if (gr_info.preflag != 0)
+ idx += pretab[cb];
+
+ idx = idx << gr_info.scalefac_scale;
+ xr_1d[quotien][reste] *= two_to_negative_half_pow[idx];
+ }
+ index++;
+ }
+
+ for (j = nonzero[ch]; j < 576; j++) {
+ // Modif E.B 02/22/99
+ int reste = j % SSLIMIT;
+ int quotien = (int) ((j - reste) / SSLIMIT);
+ if (reste < 0)
+ reste = 0;
+ if (quotien < 0)
+ quotien = 0;
+ xr_1d[quotien][reste] = 0.0f;
+ }
+
+ return;
+ }
+
+ /**
+ *
+ */
+ private void reorder(float xr[][], int ch, int gr) {
+ gr_info_s gr_info = (si.ch[ch].gr[gr]);
+ int freq, freq3;
+ int index;
+ int sfb, sfb_start, sfb_lines;
+ int src_line, des_line;
+ float[][] xr_1d = xr;
+
+ if ((gr_info.window_switching_flag != 0) && (gr_info.block_type == 2)) {
+
+ for (index = 0; index < 576; index++)
+ out_1d[index] = 0.0f;
+
+ if (gr_info.mixed_block_flag != 0) {
+ // NO REORDER FOR LOW 2 SUBBANDS
+ for (index = 0; index < 36; index++) {
+ // Modif E.B 02/22/99
+ int reste = index % SSLIMIT;
+ int quotien = (int) ((index - reste) / SSLIMIT);
+ out_1d[index] = xr_1d[quotien][reste];
+ }
+ // REORDERING FOR REST SWITCHED SHORT
+ /*
+ * for( sfb=3,sfb_start=sfBandIndex[sfreq].s[3],
+ * sfb_lines=sfBandIndex[sfreq].s[4] - sfb_start; sfb < 13;
+ * sfb++,sfb_start = sfBandIndex[sfreq].s[sfb], sfb_lines =
+ * sfBandIndex[sfreq].s[sfb+1] - sfb_start ) {
+ */
+ for (sfb = 3; sfb < 13; sfb++) {
+ // System.out.println("sfreq="+sfreq+" sfb="+sfb+" sfBandIndex="+sfBandIndex.length+" sfBandIndex[sfreq].s="+sfBandIndex[sfreq].s.length);
+ sfb_start = sfBandIndex[sfreq].s[sfb];
+ sfb_lines = sfBandIndex[sfreq].s[sfb + 1] - sfb_start;
+
+ int sfb_start3 = (sfb_start << 2) - sfb_start;
+
+ for (freq = 0, freq3 = 0; freq < sfb_lines; freq++, freq3 += 3) {
+
+ src_line = sfb_start3 + freq;
+ des_line = sfb_start3 + freq3;
+ // Modif E.B 02/22/99
+ int reste = src_line % SSLIMIT;
+ int quotien = (int) ((src_line - reste) / SSLIMIT);
+
+ out_1d[des_line] = xr_1d[quotien][reste];
+ src_line += sfb_lines;
+ des_line++;
+
+ reste = src_line % SSLIMIT;
+ quotien = (int) ((src_line - reste) / SSLIMIT);
+
+ out_1d[des_line] = xr_1d[quotien][reste];
+ src_line += sfb_lines;
+ des_line++;
+
+ reste = src_line % SSLIMIT;
+ quotien = (int) ((src_line - reste) / SSLIMIT);
+
+ out_1d[des_line] = xr_1d[quotien][reste];
+ }
+ }
+
+ } else { // pure short
+ for (index = 0; index < 576; index++) {
+ int j = reorder_table[sfreq][index];
+ int reste = j % SSLIMIT;
+ int quotien = (int) ((j - reste) / SSLIMIT);
+ out_1d[index] = xr_1d[quotien][reste];
+ }
+ }
+ } else { // long blocks
+ for (index = 0; index < 576; index++) {
+ // Modif E.B 02/22/99
+ int reste = index % SSLIMIT;
+ int quotien = (int) ((index - reste) / SSLIMIT);
+ out_1d[index] = xr_1d[quotien][reste];
+ }
+ }
+ }
+
+ /**
+ *
+ */
+
+ int[] is_pos = new int[576];
+ float[] is_ratio = new float[576];
+
+ private void stereo(int gr) {
+ int sb, ss;
+
+ if (channels == 1) { // mono , bypass xr[0][][] to lr[0][][]
+
+ for (sb = 0; sb < SBLIMIT; sb++)
+ for (ss = 0; ss < SSLIMIT; ss += 3) {
+ lr[0][sb][ss] = ro[0][sb][ss];
+ lr[0][sb][ss + 1] = ro[0][sb][ss + 1];
+ lr[0][sb][ss + 2] = ro[0][sb][ss + 2];
+ }
+
+ } else {
+
+ gr_info_s gr_info = (si.ch[0].gr[gr]);
+ int mode_ext = header.mode_extension();
+ int sfb;
+ int i;
+ int lines, temp, temp2;
+
+ boolean ms_stereo = ((header.mode() == Header.JOINT_STEREO) && ((mode_ext & 0x2) != 0));
+ boolean i_stereo = ((header.mode() == Header.JOINT_STEREO) && ((mode_ext & 0x1) != 0));
+ boolean lsf =
+ ((header.version() == Header.MPEG2_LSF || header.version() == Header.MPEG25_LSF)); // SZD
+
+ int io_type = (gr_info.scalefac_compress & 1);
+
+ // initialization
+
+ for (i = 0; i < 576; i++) {
+ is_pos[i] = 7;
+
+ is_ratio[i] = 0.0f;
+ }
+
+ if (i_stereo) {
+ if ((gr_info.window_switching_flag != 0) && (gr_info.block_type == 2)) {
+ if (gr_info.mixed_block_flag != 0) {
+
+ int max_sfb = 0;
+
+ for (int j = 0; j < 3; j++) {
+ int sfbcnt;
+ sfbcnt = 2;
+ for (sfb = 12; sfb >= 3; sfb--) {
+ i = sfBandIndex[sfreq].s[sfb];
+ lines = sfBandIndex[sfreq].s[sfb + 1] - i;
+ i = (i << 2) - i + (j + 1) * lines - 1;
+
+ while (lines > 0) {
+ if (ro[1][i / 18][i % 18] != 0.0f) {
+ // MDM: in java, array access is very slow.
+ // Is quicker to compute div and mod values.
+ // if (ro[1][ss_div[i]][ss_mod[i]] != 0.0f) {
+ sfbcnt = sfb;
+ sfb = -10;
+ lines = -10;
+ }
+
+ lines--;
+ i--;
+
+ } // while (lines > 0)
+
+ } // for (sfb=12 ...
+ sfb = sfbcnt + 1;
+
+ if (sfb > max_sfb)
+ max_sfb = sfb;
+
+ while (sfb < 12) {
+ temp = sfBandIndex[sfreq].s[sfb];
+ sb = sfBandIndex[sfreq].s[sfb + 1] - temp;
+ i = (temp << 2) - temp + j * sb;
+
+ for (; sb > 0; sb--) {
+ is_pos[i] = scalefac[1].s[j][sfb];
+ if (is_pos[i] != 7)
+ if (lsf)
+ i_stereo_k_values(is_pos[i], io_type, i);
+ else
+ is_ratio[i] = TAN12[is_pos[i]];
+
+ i++;
+ } // for (; sb>0...
+ sfb++;
+ } // while (sfb < 12)
+ sfb = sfBandIndex[sfreq].s[10];
+ sb = sfBandIndex[sfreq].s[11] - sfb;
+ sfb = (sfb << 2) - sfb + j * sb;
+ temp = sfBandIndex[sfreq].s[11];
+ sb = sfBandIndex[sfreq].s[12] - temp;
+ i = (temp << 2) - temp + j * sb;
+
+ for (; sb > 0; sb--) {
+ is_pos[i] = is_pos[sfb];
+
+ if (lsf) {
+ k[0][i] = k[0][sfb];
+ k[1][i] = k[1][sfb];
+ } else {
+ is_ratio[i] = is_ratio[sfb];
+ }
+ i++;
+ } // for (; sb > 0 ...
+ }
+ if (max_sfb <= 3) {
+ i = 2;
+ ss = 17;
+ sb = -1;
+ while (i >= 0) {
+ if (ro[1][i][ss] != 0.0f) {
+ sb = (i << 4) + (i << 1) + ss;
+ i = -1;
+ } else {
+ ss--;
+ if (ss < 0) {
+ i--;
+ ss = 17;
+ }
+ } // if (ro ...
+ } // while (i>=0)
+ i = 0;
+ while (sfBandIndex[sfreq].l[i] <= sb)
+ i++;
+ sfb = i;
+ i = sfBandIndex[sfreq].l[i];
+ for (; sfb < 8; sfb++) {
+ sb = sfBandIndex[sfreq].l[sfb + 1] - sfBandIndex[sfreq].l[sfb];
+ for (; sb > 0; sb--) {
+ is_pos[i] = scalefac[1].l[sfb];
+ if (is_pos[i] != 7)
+ if (lsf)
+ i_stereo_k_values(is_pos[i], io_type, i);
+ else
+ is_ratio[i] = TAN12[is_pos[i]];
+ i++;
+ } // for (; sb>0 ...
+ } // for (; sfb<8 ...
+ } // for (j=0 ...
+ } else { // if (gr_info.mixed_block_flag)
+ for (int j = 0; j < 3; j++) {
+ int sfbcnt;
+ sfbcnt = -1;
+ for (sfb = 12; sfb >= 0; sfb--) {
+ temp = sfBandIndex[sfreq].s[sfb];
+ lines = sfBandIndex[sfreq].s[sfb + 1] - temp;
+ i = (temp << 2) - temp + (j + 1) * lines - 1;
+
+ while (lines > 0) {
+ if (ro[1][i / 18][i % 18] != 0.0f) {
+ // MDM: in java, array access is very slow.
+ // Is quicker to compute div and mod values.
+ // if (ro[1][ss_div[i]][ss_mod[i]] != 0.0f) {
+ sfbcnt = sfb;
+ sfb = -10;
+ lines = -10;
+ }
+ lines--;
+ i--;
+ } // while (lines > 0) */
+
+ } // for (sfb=12 ...
+ sfb = sfbcnt + 1;
+ while (sfb < 12) {
+ temp = sfBandIndex[sfreq].s[sfb];
+ sb = sfBandIndex[sfreq].s[sfb + 1] - temp;
+ i = (temp << 2) - temp + j * sb;
+ for (; sb > 0; sb--) {
+ is_pos[i] = scalefac[1].s[j][sfb];
+ if (is_pos[i] != 7)
+ if (lsf)
+ i_stereo_k_values(is_pos[i], io_type, i);
+ else
+ is_ratio[i] = TAN12[is_pos[i]];
+ i++;
+ } // for (; sb>0 ...
+ sfb++;
+ } // while (sfb<12)
+
+ temp = sfBandIndex[sfreq].s[10];
+ temp2 = sfBandIndex[sfreq].s[11];
+ sb = temp2 - temp;
+ sfb = (temp << 2) - temp + j * sb;
+ sb = sfBandIndex[sfreq].s[12] - temp2;
+ i = (temp2 << 2) - temp2 + j * sb;
+
+ for (; sb > 0; sb--) {
+ is_pos[i] = is_pos[sfb];
+
+ if (lsf) {
+ k[0][i] = k[0][sfb];
+ k[1][i] = k[1][sfb];
+ } else {
+ is_ratio[i] = is_ratio[sfb];
+ }
+ i++;
+ } // for (; sb>0 ...
+ } // for (sfb=12
+ } // for (j=0 ...
+ } else { // if (gr_info.window_switching_flag ...
+ i = 31;
+ ss = 17;
+ sb = 0;
+ while (i >= 0) {
+ if (ro[1][i][ss] != 0.0f) {
+ sb = (i << 4) + (i << 1) + ss;
+ i = -1;
+ } else {
+ ss--;
+ if (ss < 0) {
+ i--;
+ ss = 17;
+ }
+ }
+ }
+ i = 0;
+ while (sfBandIndex[sfreq].l[i] <= sb)
+ i++;
+
+ sfb = i;
+ i = sfBandIndex[sfreq].l[i];
+ for (; sfb < 21; sfb++) {
+ sb = sfBandIndex[sfreq].l[sfb + 1] - sfBandIndex[sfreq].l[sfb];
+ for (; sb > 0; sb--) {
+ is_pos[i] = scalefac[1].l[sfb];
+ if (is_pos[i] != 7)
+ if (lsf)
+ i_stereo_k_values(is_pos[i], io_type, i);
+ else
+ is_ratio[i] = TAN12[is_pos[i]];
+ i++;
+ }
+ }
+ sfb = sfBandIndex[sfreq].l[20];
+ for (sb = 576 - sfBandIndex[sfreq].l[21]; (sb > 0) && (i < 576); sb--) {
+ is_pos[i] = is_pos[sfb]; // error here : i >=576
+
+ if (lsf) {
+ k[0][i] = k[0][sfb];
+ k[1][i] = k[1][sfb];
+ } else {
+ is_ratio[i] = is_ratio[sfb];
+ }
+ i++;
+ } // if (gr_info.mixed_block_flag)
+ } // if (gr_info.window_switching_flag ...
+ } // if (i_stereo)
+
+ i = 0;
+ for (sb = 0; sb < SBLIMIT; sb++)
+ for (ss = 0; ss < SSLIMIT; ss++) {
+ if (is_pos[i] == 7) {
+ if (ms_stereo) {
+ lr[0][sb][ss] = (ro[0][sb][ss] + ro[1][sb][ss]) * 0.707106781f;
+ lr[1][sb][ss] = (ro[0][sb][ss] - ro[1][sb][ss]) * 0.707106781f;
+ } else {
+ lr[0][sb][ss] = ro[0][sb][ss];
+ lr[1][sb][ss] = ro[1][sb][ss];
+ }
+ } else if (i_stereo) {
+
+ if (lsf) {
+ lr[0][sb][ss] = ro[0][sb][ss] * k[0][i];
+ lr[1][sb][ss] = ro[0][sb][ss] * k[1][i];
+ } else {
+ lr[1][sb][ss] = ro[0][sb][ss] / (float) (1 + is_ratio[i]);
+ lr[0][sb][ss] = lr[1][sb][ss] * is_ratio[i];
+ }
+ }
+ /*
+ * else { System.out.println("Error in stereo processing\n"); }
+ */
+ i++;
+ }
+
+ } // channels == 2
+
+ }
+
+ /**
+ *
+ */
+ private void antialias(int ch, int gr) {
+ int sb18, ss, sb18lim;
+ gr_info_s gr_info = (si.ch[ch].gr[gr]);
+ // 31 alias-reduction operations between each pair of sub-bands
+ // with 8 butterflies between each pair
+
+ if ((gr_info.window_switching_flag != 0) && (gr_info.block_type == 2)
+ && !(gr_info.mixed_block_flag != 0))
+ return;
+
+ if ((gr_info.window_switching_flag != 0) && (gr_info.mixed_block_flag != 0)
+ && (gr_info.block_type == 2)) {
+ sb18lim = 18;
+ } else {
+ sb18lim = 558;
+ }
+
+ for (sb18 = 0; sb18 < sb18lim; sb18 += 18) {
+ for (ss = 0; ss < 8; ss++) {
+ int src_idx1 = sb18 + 17 - ss;
+ int src_idx2 = sb18 + 18 + ss;
+ float bu = out_1d[src_idx1];
+ float bd = out_1d[src_idx2];
+ out_1d[src_idx1] = (bu * cs[ss]) - (bd * ca[ss]);
+ out_1d[src_idx2] = (bd * cs[ss]) + (bu * ca[ss]);
+ }
+ }
+ }
+
+ /**
+ *
+ */
+
+ // MDM: tsOutCopy and rawout do not need initializing, so the arrays
+ // can be reused.
+ float[] tsOutCopy = new float[18];
+ float[] rawout = new float[36];
+
+ private void hybrid(int ch, int gr) {
+ int bt;
+ int sb18;
+ gr_info_s gr_info = (si.ch[ch].gr[gr]);
+ float[] tsOut;
+
+ float[][] prvblk;
+
+ for (sb18 = 0; sb18 < 576; sb18 += 18) {
+ bt =
+ ((gr_info.window_switching_flag != 0) && (gr_info.mixed_block_flag != 0) && (sb18 < 36))
+ ? 0 : gr_info.block_type;
+
+ tsOut = out_1d;
+ // Modif E.B 02/22/99
+ for (int cc = 0; cc < 18; cc++)
+ tsOutCopy[cc] = tsOut[cc + sb18];
+
+ inv_mdct(tsOutCopy, rawout, bt);
+
+ for (int cc = 0; cc < 18; cc++)
+ tsOut[cc + sb18] = tsOutCopy[cc];
+ // Fin Modif
+
+ // overlap addition
+ prvblk = prevblck;
+
+ tsOut[0 + sb18] = rawout[0] + prvblk[ch][sb18 + 0];
+ prvblk[ch][sb18 + 0] = rawout[18];
+ tsOut[1 + sb18] = rawout[1] + prvblk[ch][sb18 + 1];
+ prvblk[ch][sb18 + 1] = rawout[19];
+ tsOut[2 + sb18] = rawout[2] + prvblk[ch][sb18 + 2];
+ prvblk[ch][sb18 + 2] = rawout[20];
+ tsOut[3 + sb18] = rawout[3] + prvblk[ch][sb18 + 3];
+ prvblk[ch][sb18 + 3] = rawout[21];
+ tsOut[4 + sb18] = rawout[4] + prvblk[ch][sb18 + 4];
+ prvblk[ch][sb18 + 4] = rawout[22];
+ tsOut[5 + sb18] = rawout[5] + prvblk[ch][sb18 + 5];
+ prvblk[ch][sb18 + 5] = rawout[23];
+ tsOut[6 + sb18] = rawout[6] + prvblk[ch][sb18 + 6];
+ prvblk[ch][sb18 + 6] = rawout[24];
+ tsOut[7 + sb18] = rawout[7] + prvblk[ch][sb18 + 7];
+ prvblk[ch][sb18 + 7] = rawout[25];
+ tsOut[8 + sb18] = rawout[8] + prvblk[ch][sb18 + 8];
+ prvblk[ch][sb18 + 8] = rawout[26];
+ tsOut[9 + sb18] = rawout[9] + prvblk[ch][sb18 + 9];
+ prvblk[ch][sb18 + 9] = rawout[27];
+ tsOut[10 + sb18] = rawout[10] + prvblk[ch][sb18 + 10];
+ prvblk[ch][sb18 + 10] = rawout[28];
+ tsOut[11 + sb18] = rawout[11] + prvblk[ch][sb18 + 11];
+ prvblk[ch][sb18 + 11] = rawout[29];
+ tsOut[12 + sb18] = rawout[12] + prvblk[ch][sb18 + 12];
+ prvblk[ch][sb18 + 12] = rawout[30];
+ tsOut[13 + sb18] = rawout[13] + prvblk[ch][sb18 + 13];
+ prvblk[ch][sb18 + 13] = rawout[31];
+ tsOut[14 + sb18] = rawout[14] + prvblk[ch][sb18 + 14];
+ prvblk[ch][sb18 + 14] = rawout[32];
+ tsOut[15 + sb18] = rawout[15] + prvblk[ch][sb18 + 15];
+ prvblk[ch][sb18 + 15] = rawout[33];
+ tsOut[16 + sb18] = rawout[16] + prvblk[ch][sb18 + 16];
+ prvblk[ch][sb18 + 16] = rawout[34];
+ tsOut[17 + sb18] = rawout[17] + prvblk[ch][sb18 + 17];
+ prvblk[ch][sb18 + 17] = rawout[35];
+ }
+ }
+
+ /**
+ *
+ */
+ private void do_downmix() {
+ for (int sb = 0; sb < SSLIMIT; sb++) {
+ for (int ss = 0; ss < SSLIMIT; ss += 3) {
+ lr[0][sb][ss] = (lr[0][sb][ss] + lr[1][sb][ss]) * 0.5f;
+ lr[0][sb][ss + 1] = (lr[0][sb][ss + 1] + lr[1][sb][ss + 1]) * 0.5f;
+ lr[0][sb][ss + 2] = (lr[0][sb][ss + 2] + lr[1][sb][ss + 2]) * 0.5f;
+ }
+ }
+ }
+
+ /**
+ * Fast INV_MDCT.
+ */
+
+ public void inv_mdct(float[] in, float[] out, int block_type) {
+ float[] win_bt;
+ int i;
+
+ float tmpf_0, tmpf_1, tmpf_2, tmpf_3, tmpf_4, tmpf_5, tmpf_6, tmpf_7, tmpf_8, tmpf_9;
+ float tmpf_10, tmpf_11, tmpf_12, tmpf_13, tmpf_14, tmpf_15, tmpf_16, tmpf_17;
+
+ tmpf_0 =
+ tmpf_1 =
+ tmpf_2 =
+ tmpf_3 =
+ tmpf_4 =
+ tmpf_5 =
+ tmpf_6 =
+ tmpf_7 =
+ tmpf_8 =
+ tmpf_9 =
+ tmpf_10 =
+ tmpf_11 =
+ tmpf_12 =
+ tmpf_13 =
+ tmpf_14 =
+ tmpf_15 = tmpf_16 = tmpf_17 = 0.0f;
+
+ if (block_type == 2) {
+
+ /*
+ *
+ * Under MicrosoftVM 2922, This causes a GPF, or At best, an
+ * ArrayIndexOutOfBoundsExceptin. for(int p=0;p<36;p+=9) { out[p] =
+ * out[p+1] = out[p+2] = out[p+3] = out[p+4] = out[p+5] = out[p+6] =
+ * out[p+7] = out[p+8] = 0.0f; }
+ */
+ out[0] = 0.0f;
+ out[1] = 0.0f;
+ out[2] = 0.0f;
+ out[3] = 0.0f;
+ out[4] = 0.0f;
+ out[5] = 0.0f;
+ out[6] = 0.0f;
+ out[7] = 0.0f;
+ out[8] = 0.0f;
+ out[9] = 0.0f;
+ out[10] = 0.0f;
+ out[11] = 0.0f;
+ out[12] = 0.0f;
+ out[13] = 0.0f;
+ out[14] = 0.0f;
+ out[15] = 0.0f;
+ out[16] = 0.0f;
+ out[17] = 0.0f;
+ out[18] = 0.0f;
+ out[19] = 0.0f;
+ out[20] = 0.0f;
+ out[21] = 0.0f;
+ out[22] = 0.0f;
+ out[23] = 0.0f;
+ out[24] = 0.0f;
+ out[25] = 0.0f;
+ out[26] = 0.0f;
+ out[27] = 0.0f;
+ out[28] = 0.0f;
+ out[29] = 0.0f;
+ out[30] = 0.0f;
+ out[31] = 0.0f;
+ out[32] = 0.0f;
+ out[33] = 0.0f;
+ out[34] = 0.0f;
+ out[35] = 0.0f;
+
+ int six_i = 0;
+
+ for (i = 0; i < 3; i++) {
+ // 12 point IMDCT
+ // Begin 12 point IDCT
+ // Input aliasing for 12 pt IDCT
+ in[15 + i] += in[12 + i];
+ in[12 + i] += in[9 + i];
+ in[9 + i] += in[6 + i];
+ in[6 + i] += in[3 + i];
+ in[3 + i] += in[0 + i];
+
+ // Input aliasing on odd indices (for 6 point IDCT)
+ in[15 + i] += in[9 + i];
+ in[9 + i] += in[3 + i];
+
+ // 3 point IDCT on even indices
+ float pp1, pp2, sum;
+ pp2 = in[12 + i] * 0.500000000f;
+ pp1 = in[6 + i] * 0.866025403f;
+ sum = in[0 + i] + pp2;
+ tmpf_1 = in[0 + i] - in[12 + i];
+ tmpf_0 = sum + pp1;
+ tmpf_2 = sum - pp1;
+
+ // End 3 point IDCT on even indices
+ // 3 point IDCT on odd indices (for 6 point IDCT)
+ pp2 = in[15 + i] * 0.500000000f;
+ pp1 = in[9 + i] * 0.866025403f;
+ sum = in[3 + i] + pp2;
+ tmpf_4 = in[3 + i] - in[15 + i];
+ tmpf_5 = sum + pp1;
+ tmpf_3 = sum - pp1;
+ // End 3 point IDCT on odd indices
+ // Twiddle factors on odd indices (for 6 point IDCT)
+
+ tmpf_3 *= 1.931851653f;
+ tmpf_4 *= 0.707106781f;
+ tmpf_5 *= 0.517638090f;
+
+ // Output butterflies on 2 3 point IDCT's (for 6 point IDCT)
+ float save = tmpf_0;
+ tmpf_0 += tmpf_5;
+ tmpf_5 = save - tmpf_5;
+ save = tmpf_1;
+ tmpf_1 += tmpf_4;
+ tmpf_4 = save - tmpf_4;
+ save = tmpf_2;
+ tmpf_2 += tmpf_3;
+ tmpf_3 = save - tmpf_3;
+
+ // End 6 point IDCT
+ // Twiddle factors on indices (for 12 point IDCT)
+
+ tmpf_0 *= 0.504314480f;
+ tmpf_1 *= 0.541196100f;
+ tmpf_2 *= 0.630236207f;
+ tmpf_3 *= 0.821339815f;
+ tmpf_4 *= 1.306562965f;
+ tmpf_5 *= 3.830648788f;
+
+ // End 12 point IDCT
+
+ // Shift to 12 point modified IDCT, multiply by window type 2
+ tmpf_8 = -tmpf_0 * 0.793353340f;
+ tmpf_9 = -tmpf_0 * 0.608761429f;
+ tmpf_7 = -tmpf_1 * 0.923879532f;
+ tmpf_10 = -tmpf_1 * 0.382683432f;
+ tmpf_6 = -tmpf_2 * 0.991444861f;
+ tmpf_11 = -tmpf_2 * 0.130526192f;
+
+ tmpf_0 = tmpf_3;
+ tmpf_1 = tmpf_4 * 0.382683432f;
+ tmpf_2 = tmpf_5 * 0.608761429f;
+
+ tmpf_3 = -tmpf_5 * 0.793353340f;
+ tmpf_4 = -tmpf_4 * 0.923879532f;
+ tmpf_5 = -tmpf_0 * 0.991444861f;
+
+ tmpf_0 *= 0.130526192f;
+
+ out[six_i + 6] += tmpf_0;
+ out[six_i + 7] += tmpf_1;
+ out[six_i + 8] += tmpf_2;
+ out[six_i + 9] += tmpf_3;
+ out[six_i + 10] += tmpf_4;
+ out[six_i + 11] += tmpf_5;
+ out[six_i + 12] += tmpf_6;
+ out[six_i + 13] += tmpf_7;
+ out[six_i + 14] += tmpf_8;
+ out[six_i + 15] += tmpf_9;
+ out[six_i + 16] += tmpf_10;
+ out[six_i + 17] += tmpf_11;
+
+ six_i += 6;
+ }
+ } else {
+ // 36 point IDCT
+ // input aliasing for 36 point IDCT
+ in[17] += in[16];
+ in[16] += in[15];
+ in[15] += in[14];
+ in[14] += in[13];
+ in[13] += in[12];
+ in[12] += in[11];
+ in[11] += in[10];
+ in[10] += in[9];
+ in[9] += in[8];
+ in[8] += in[7];
+ in[7] += in[6];
+ in[6] += in[5];
+ in[5] += in[4];
+ in[4] += in[3];
+ in[3] += in[2];
+ in[2] += in[1];
+ in[1] += in[0];
+
+ // 18 point IDCT for odd indices
+ // input aliasing for 18 point IDCT
+ in[17] += in[15];
+ in[15] += in[13];
+ in[13] += in[11];
+ in[11] += in[9];
+ in[9] += in[7];
+ in[7] += in[5];
+ in[5] += in[3];
+ in[3] += in[1];
+
+ float tmp0, tmp1, tmp2, tmp3, tmp4, tmp0_, tmp1_, tmp2_, tmp3_;
+ float tmp0o, tmp1o, tmp2o, tmp3o, tmp4o, tmp0_o, tmp1_o, tmp2_o, tmp3_o;
+
+ // Fast 9 Point Inverse Discrete Cosine Transform
+ //
+ // By Francois-Raymond Boyer
+ // mailto:boyerf@iro.umontreal.ca
+ // http://www.iro.umontreal.ca/~boyerf
+ //
+ // The code has been optimized for Intel processors
+ // (takes a lot of time to convert float to and from iternal FPU
+ // representation)
+ //
+ // It is a simple "factorization" of the IDCT matrix.
+
+ // 9 point IDCT on even indices
+
+ // 5 points on odd indices (not realy an IDCT)
+ float i00 = in[0] + in[0];
+ float iip12 = i00 + in[12];
+
+ tmp0 =
+ iip12 + in[4] * 1.8793852415718f + in[8] * 1.532088886238f + in[16] * 0.34729635533386f;
+ tmp1 = i00 + in[4] - in[8] - in[12] - in[12] - in[16];
+ tmp2 =
+ iip12 - in[4] * 0.34729635533386f - in[8] * 1.8793852415718f + in[16] * 1.532088886238f;
+ tmp3 =
+ iip12 - in[4] * 1.532088886238f + in[8] * 0.34729635533386f - in[16] * 1.8793852415718f;
+ tmp4 = in[0] - in[4] + in[8] - in[12] + in[16];
+
+ // 4 points on even indices
+ float i66_ = in[6] * 1.732050808f; // Sqrt[3]
+
+ tmp0_ =
+ in[2] * 1.9696155060244f + i66_ + in[10] * 1.2855752193731f + in[14] * 0.68404028665134f;
+ tmp1_ = (in[2] - in[10] - in[14]) * 1.732050808f;
+ tmp2_ =
+ in[2] * 1.2855752193731f - i66_ - in[10] * 0.68404028665134f + in[14] * 1.9696155060244f;
+ tmp3_ =
+ in[2] * 0.68404028665134f - i66_ + in[10] * 1.9696155060244f - in[14] * 1.2855752193731f;
+
+ // 9 point IDCT on odd indices
+ // 5 points on odd indices (not realy an IDCT)
+ float i0 = in[0 + 1] + in[0 + 1];
+ float i0p12 = i0 + in[12 + 1];
+
+ tmp0o =
+ i0p12 + in[4 + 1] * 1.8793852415718f + in[8 + 1] * 1.532088886238f + in[16 + 1]
+ * 0.34729635533386f;
+ tmp1o = i0 + in[4 + 1] - in[8 + 1] - in[12 + 1] - in[12 + 1] - in[16 + 1];
+ tmp2o =
+ i0p12 - in[4 + 1] * 0.34729635533386f - in[8 + 1] * 1.8793852415718f + in[16 + 1]
+ * 1.532088886238f;
+ tmp3o =
+ i0p12 - in[4 + 1] * 1.532088886238f + in[8 + 1] * 0.34729635533386f - in[16 + 1]
+ * 1.8793852415718f;
+ tmp4o = (in[0 + 1] - in[4 + 1] + in[8 + 1] - in[12 + 1] + in[16 + 1]) * 0.707106781f; // Twiddled
+
+ // 4 points on even indices
+ float i6_ = in[6 + 1] * 1.732050808f; // Sqrt[3]
+
+ tmp0_o =
+ in[2 + 1] * 1.9696155060244f + i6_ + in[10 + 1] * 1.2855752193731f + in[14 + 1]
+ * 0.68404028665134f;
+ tmp1_o = (in[2 + 1] - in[10 + 1] - in[14 + 1]) * 1.732050808f;
+ tmp2_o =
+ in[2 + 1] * 1.2855752193731f - i6_ - in[10 + 1] * 0.68404028665134f + in[14 + 1]
+ * 1.9696155060244f;
+ tmp3_o =
+ in[2 + 1] * 0.68404028665134f - i6_ + in[10 + 1] * 1.9696155060244f - in[14 + 1]
+ * 1.2855752193731f;
+
+ // Twiddle factors on odd indices
+ // and
+ // Butterflies on 9 point IDCT's
+ // and
+ // twiddle factors for 36 point IDCT
+
+ float e, o;
+ e = tmp0 + tmp0_;
+ o = (tmp0o + tmp0_o) * 0.501909918f;
+ tmpf_0 = e + o;
+ tmpf_17 = e - o;
+ e = tmp1 + tmp1_;
+ o = (tmp1o + tmp1_o) * 0.517638090f;
+ tmpf_1 = e + o;
+ tmpf_16 = e - o;
+ e = tmp2 + tmp2_;
+ o = (tmp2o + tmp2_o) * 0.551688959f;
+ tmpf_2 = e + o;
+ tmpf_15 = e - o;
+ e = tmp3 + tmp3_;
+ o = (tmp3o + tmp3_o) * 0.610387294f;
+ tmpf_3 = e + o;
+ tmpf_14 = e - o;
+ tmpf_4 = tmp4 + tmp4o;
+ tmpf_13 = tmp4 - tmp4o;
+ e = tmp3 - tmp3_;
+ o = (tmp3o - tmp3_o) * 0.871723397f;
+ tmpf_5 = e + o;
+ tmpf_12 = e - o;
+ e = tmp2 - tmp2_;
+ o = (tmp2o - tmp2_o) * 1.183100792f;
+ tmpf_6 = e + o;
+ tmpf_11 = e - o;
+ e = tmp1 - tmp1_;
+ o = (tmp1o - tmp1_o) * 1.931851653f;
+ tmpf_7 = e + o;
+ tmpf_10 = e - o;
+ e = tmp0 - tmp0_;
+ o = (tmp0o - tmp0_o) * 5.736856623f;
+ tmpf_8 = e + o;
+ tmpf_9 = e - o;
+
+ // end 36 point IDCT */
+ // shift to modified IDCT
+ win_bt = win[block_type];
+
+ out[0] = -tmpf_9 * win_bt[0];
+ out[1] = -tmpf_10 * win_bt[1];
+ out[2] = -tmpf_11 * win_bt[2];
+ out[3] = -tmpf_12 * win_bt[3];
+ out[4] = -tmpf_13 * win_bt[4];
+ out[5] = -tmpf_14 * win_bt[5];
+ out[6] = -tmpf_15 * win_bt[6];
+ out[7] = -tmpf_16 * win_bt[7];
+ out[8] = -tmpf_17 * win_bt[8];
+ out[9] = tmpf_17 * win_bt[9];
+ out[10] = tmpf_16 * win_bt[10];
+ out[11] = tmpf_15 * win_bt[11];
+ out[12] = tmpf_14 * win_bt[12];
+ out[13] = tmpf_13 * win_bt[13];
+ out[14] = tmpf_12 * win_bt[14];
+ out[15] = tmpf_11 * win_bt[15];
+ out[16] = tmpf_10 * win_bt[16];
+ out[17] = tmpf_9 * win_bt[17];
+ out[18] = tmpf_8 * win_bt[18];
+ out[19] = tmpf_7 * win_bt[19];
+ out[20] = tmpf_6 * win_bt[20];
+ out[21] = tmpf_5 * win_bt[21];
+ out[22] = tmpf_4 * win_bt[22];
+ out[23] = tmpf_3 * win_bt[23];
+ out[24] = tmpf_2 * win_bt[24];
+ out[25] = tmpf_1 * win_bt[25];
+ out[26] = tmpf_0 * win_bt[26];
+ out[27] = tmpf_0 * win_bt[27];
+ out[28] = tmpf_1 * win_bt[28];
+ out[29] = tmpf_2 * win_bt[29];
+ out[30] = tmpf_3 * win_bt[30];
+ out[31] = tmpf_4 * win_bt[31];
+ out[32] = tmpf_5 * win_bt[32];
+ out[33] = tmpf_6 * win_bt[33];
+ out[34] = tmpf_7 * win_bt[34];
+ out[35] = tmpf_8 * win_bt[35];
+ }
+ }
+
+ private int counter = 0;
+ private static final int SSLIMIT = 18;
+ private static final int SBLIMIT = 32;
+
+ // Size of the table of whole numbers raised to 4/3 power.
+ // This may be adjusted for performance without any problems.
+ // public static final int POW_TABLE_LIMIT=512;
+
+ /************************************************************/
+ /* L3TABLE */
+ /************************************************************/
+
+ static class SBI {
+ public int[] l;
+ public int[] s;
+
+ public SBI() {
+ l = new int[23];
+ s = new int[14];
+ }
+
+ public SBI(int[] thel, int[] thes) {
+ l = thel;
+ s = thes;
+ }
+ }
+
+ static class gr_info_s {
+ public int part2_3_length = 0;
+ public int big_values = 0;
+ public int global_gain = 0;
+ public int scalefac_compress = 0;
+ public int window_switching_flag = 0;
+ public int block_type = 0;
+ public int mixed_block_flag = 0;
+ public int[] table_select;
+ public int[] subblock_gain;
+ public int region0_count = 0;
+ public int region1_count = 0;
+ public int preflag = 0;
+ public int scalefac_scale = 0;
+ public int count1table_select = 0;
+
+ /**
+ * Dummy Constructor
+ */
+ public gr_info_s() {
+ table_select = new int[3];
+ subblock_gain = new int[3];
+ }
+ }
+
+ static class temporaire {
+ public int[] scfsi;
+ public gr_info_s[] gr;
+
+ /**
+ * Dummy Constructor
+ */
+ public temporaire() {
+ scfsi = new int[4];
+ gr = new gr_info_s[2];
+ gr[0] = new gr_info_s();
+ gr[1] = new gr_info_s();
+ }
+ }
+
+ static class III_side_info_t {
+
+ public int main_data_begin = 0;
+ public int private_bits = 0;
+ public temporaire[] ch;
+
+ /**
+ * Dummy Constructor
+ */
+ public III_side_info_t() {
+ ch = new temporaire[2];
+ ch[0] = new temporaire();
+ ch[1] = new temporaire();
+ }
+ }
+
+ static class temporaire2 {
+ public int[] l; /* [cb] */
+ public int[][] s; /* [window][cb] */
+
+ /**
+ * Dummy Constructor
+ */
+ public temporaire2() {
+ l = new int[23];
+ s = new int[3][13];
+ }
+ }
+
+ // class III_scalefac_t
+ // {
+ // public temporaire2[] tab;
+ // /**
+ // * Dummy Constructor
+ // */
+ // public III_scalefac_t()
+ // {
+ // tab = new temporaire2[2];
+ // }
+ // }
+
+ private static final int slen[][] = { { 0, 0, 0, 0, 3, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4 },
+ { 0, 1, 2, 3, 0, 1, 2, 3, 1, 2, 3, 1, 2, 3, 2, 3 } };
+
+ public static final int pretab[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 3, 3, 3,
+ 2, 0 };
+
+ private SBI[] sfBandIndex; // Init in the constructor.
+
+ public static final float two_to_negative_half_pow[] = { 1.0000000000E+00f, 7.0710678119E-01f,
+ 5.0000000000E-01f, 3.5355339059E-01f, 2.5000000000E-01f, 1.7677669530E-01f,
+ 1.2500000000E-01f, 8.8388347648E-02f, 6.2500000000E-02f, 4.4194173824E-02f,
+ 3.1250000000E-02f, 2.2097086912E-02f, 1.5625000000E-02f, 1.1048543456E-02f,
+ 7.8125000000E-03f, 5.5242717280E-03f, 3.9062500000E-03f, 2.7621358640E-03f,
+ 1.9531250000E-03f, 1.3810679320E-03f, 9.7656250000E-04f, 6.9053396600E-04f,
+ 4.8828125000E-04f, 3.4526698300E-04f, 2.4414062500E-04f, 1.7263349150E-04f,
+ 1.2207031250E-04f, 8.6316745750E-05f, 6.1035156250E-05f, 4.3158372875E-05f,
+ 3.0517578125E-05f, 2.1579186438E-05f, 1.5258789062E-05f, 1.0789593219E-05f,
+ 7.6293945312E-06f, 5.3947966094E-06f, 3.8146972656E-06f, 2.6973983047E-06f,
+ 1.9073486328E-06f, 1.3486991523E-06f, 9.5367431641E-07f, 6.7434957617E-07f,
+ 4.7683715820E-07f, 3.3717478809E-07f, 2.3841857910E-07f, 1.6858739404E-07f,
+ 1.1920928955E-07f, 8.4293697022E-08f, 5.9604644775E-08f, 4.2146848511E-08f,
+ 2.9802322388E-08f, 2.1073424255E-08f, 1.4901161194E-08f, 1.0536712128E-08f,
+ 7.4505805969E-09f, 5.2683560639E-09f, 3.7252902985E-09f, 2.6341780319E-09f,
+ 1.8626451492E-09f, 1.3170890160E-09f, 9.3132257462E-10f, 6.5854450798E-10f,
+ 4.6566128731E-10f, 3.2927225399E-10f };
+
+ public static final float t_43[] = create_t_43();
+
+ static private float[] create_t_43() {
+ float[] t43 = new float[8192];
+ final double d43 = (4.0 / 3.0);
+
+ for (int i = 0; i < 8192; i++) {
+ t43[i] = (float) Math.pow(i, d43);
+ }
+ return t43;
+ }
+
+ public static final float io[][] = {
+ { 1.0000000000E+00f, 8.4089641526E-01f, 7.0710678119E-01f, 5.9460355751E-01f,
+ 5.0000000001E-01f, 4.2044820763E-01f, 3.5355339060E-01f, 2.9730177876E-01f,
+ 2.5000000001E-01f, 2.1022410382E-01f, 1.7677669530E-01f, 1.4865088938E-01f,
+ 1.2500000000E-01f, 1.0511205191E-01f, 8.8388347652E-02f, 7.4325444691E-02f,
+ 6.2500000003E-02f, 5.2556025956E-02f, 4.4194173826E-02f, 3.7162722346E-02f,
+ 3.1250000002E-02f, 2.6278012978E-02f, 2.2097086913E-02f, 1.8581361173E-02f,
+ 1.5625000001E-02f, 1.3139006489E-02f, 1.1048543457E-02f, 9.2906805866E-03f,
+ 7.8125000006E-03f, 6.5695032447E-03f, 5.5242717285E-03f, 4.6453402934E-03f },
+ { 1.0000000000E+00f, 7.0710678119E-01f, 5.0000000000E-01f, 3.5355339060E-01f,
+ 2.5000000000E-01f, 1.7677669530E-01f, 1.2500000000E-01f, 8.8388347650E-02f,
+ 6.2500000001E-02f, 4.4194173825E-02f, 3.1250000001E-02f, 2.2097086913E-02f,
+ 1.5625000000E-02f, 1.1048543456E-02f, 7.8125000002E-03f, 5.5242717282E-03f,
+ 3.9062500001E-03f, 2.7621358641E-03f, 1.9531250001E-03f, 1.3810679321E-03f,
+ 9.7656250004E-04f, 6.9053396603E-04f, 4.8828125002E-04f, 3.4526698302E-04f,
+ 2.4414062501E-04f, 1.7263349151E-04f, 1.2207031251E-04f, 8.6316745755E-05f,
+ 6.1035156254E-05f, 4.3158372878E-05f, 3.0517578127E-05f, 2.1579186439E-05f } };
+
+ public static final float TAN12[] = { 0.0f, 0.26794919f, 0.57735027f, 1.0f, 1.73205081f,
+ 3.73205081f, 9.9999999e10f, -3.73205081f, -1.73205081f, -1.0f, -0.57735027f, -0.26794919f,
+ 0.0f, 0.26794919f, 0.57735027f, 1.0f };
+
+ // REVIEW: in java, the array lookup may well be slower than
+ // the actual calculation
+ // 576 / 18
+ /*
+ * private static final int ss_div[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ * 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2,
+ * 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3,
+ * 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
+ * 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6,
+ * 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
+ * 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
+ * 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10,
+ * 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11,
+ * 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12,
+ * 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13,
+ * 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14,
+ * 14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15,
+ * 15, 15, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16,
+ * 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
+ * 17, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
+ * 18, 18, 18, 18, 18, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19,
+ * 19, 19, 19, 19, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20,
+ * 20, 20, 20, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,
+ * 21, 21, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22,
+ * 22, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
+ * 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 25,
+ * 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 26, 26,
+ * 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 27, 27, 27,
+ * 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 28, 28, 28, 28,
+ * 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 29, 29, 29, 29, 29,
+ * 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 30, 30, 30, 30, 30, 30,
+ * 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 31, 31, 31, 31, 31, 31, 31,
+ * 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31 };
+ *
+ * // 576 % 18 private static final int ss_mod[] = { 0, 1, 2, 3, 4, 5, 6, 7,
+ * 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,
+ * 12, 13, 14, 15, 16, 17, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
+ * 15, 16, 17, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,
+ * 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 0, 1, 2, 3,
+ * 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 0, 1, 2, 3, 4, 5, 6, 7,
+ * 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,
+ * 12, 13, 14, 15, 16, 17, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
+ * 15, 16, 17, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,
+ * 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 0, 1, 2, 3,
+ * 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 0, 1, 2, 3, 4, 5, 6, 7,
+ * 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,
+ * 12, 13, 14, 15, 16, 17, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
+ * 15, 16, 17, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,
+ * 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 0, 1, 2, 3,
+ * 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 0, 1, 2, 3, 4, 5, 6, 7,
+ * 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,
+ * 12, 13, 14, 15, 16, 17, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
+ * 15, 16, 17, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,
+ * 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 0, 1, 2, 3,
+ * 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 0, 1, 2, 3, 4, 5, 6, 7,
+ * 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,
+ * 12, 13, 14, 15, 16, 17, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
+ * 15, 16, 17, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,
+ * 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 0, 1, 2, 3,
+ * 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 0, 1, 2, 3, 4, 5, 6, 7,
+ * 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,
+ * 12, 13, 14, 15, 16, 17 };
+ */
+ private static/* final */int reorder_table[][]/* = loadReorderTable() */; // SZD:
+ // will
+ // be
+ // generated
+ // on
+ // demand
+
+ /**
+ * Loads the data for the reorder
+ */
+ /*
+ * private static int[][] loadReorderTable() // SZD: table will be generated {
+ * try { Class elemType = int[][].class.getComponentType(); Object o =
+ * JavaLayerUtils.deserializeArrayResource("l3reorder.ser", elemType, 6);
+ * return (int[][])o; } catch (IOException ex) { throw new
+ * ExceptionInInitializerError(ex); } }
+ */
+
+ static int[] reorder(int scalefac_band[]) { // SZD: converted from LAME
+ int j = 0;
+ int ix[] = new int[576];
+ for (int sfb = 0; sfb < 13; sfb++) {
+ int start = scalefac_band[sfb];
+ int end = scalefac_band[sfb + 1];
+ for (int window = 0; window < 3; window++)
+ for (int i = start; i < end; i++)
+ ix[3 * i + window] = j++;
+ }
+ return ix;
+ }
+
+ /*
+ * static final int reorder_table_data[][]; = { { 0, 4, 8, 1, 5, 9, 2, 6, 10,
+ * 3, 7, 11, 12, 16, 20, 13, 17, 21, 14, 18, 22, 15, 19, 23, 24, 28, 32, 25,
+ * 29, 33, 26, 30, 34, 27, 31, 35, 36, 42, 48, 37, 43, 49, 38, 44, 50, 39, 45,
+ * 51, 40, 46, 52, 41, 47, 53, 54, 60, 66, 55, 61, 67, 56, 62, 68, 57, 63, 69,
+ * 58, 64, 70, 59, 65, 71, 72, 80, 88, 73, 81, 89, 74, 82, 90, 75, 83, 91, 76,
+ * 84, 92, 77, 85, 93, 78, 86, 94, 79, 87, 95, 96,106,116, 97,107,117,
+ * 98,108,118, 99,109,119,100,110,120,101,
+ * 111,121,102,112,122,103,113,123,104,114,124,105,115,125,126,140,
+ * 154,127,141,155,128,142,156,129,143,157,130,144,158,131,145,159,
+ * 132,146,160,133,147,161,134,148,162,135,149,163,136,150,164,137,
+ * 151,165,138,152,166,139,153,167,168,186,204,169,187,205,170,188,
+ * 206,171,189,207,172,190,208,173,191,209,174,192,210,175,193,211,
+ * 176,194,212,177,195,213,178,196,214,179,197,215,180,198,216,181,
+ * 199,217,182,200,218,183,201,219,184,202,220,185,203,221,222,248,
+ * 274,223,249,275,224,250,276,225,251,277,226,252,278,227,253,279,
+ * 228,254,280,229,255,281,230,256,282,231,257,283,232,258,284,233,
+ * 259,285,234,260,286,235,261,287,236,262,288,237,263,289,238,264,
+ * 290,239,265,291,240,266,292,241,267,293,242,268,294,243,269,295,
+ * 244,270,296,245,271,297,246,272,298,247,273,299,300,332,364,301,
+ * 333,365,302,334,366,303,335,367,304,336,368,305,337,369,306,338,
+ * 370,307,339,371,308,340,372,309,341,373,310,342,374,311,343,375,
+ * 312,344,376,313,345,377,314,346,378,315,347,379,316,348,380,317,
+ * 349,381,318,350,382,319,351,383,320,352,384,321,353,385,322,354,
+ * 386,323,355,387,324,356,388,325,357,389,326,358,390,327,359,391,
+ * 328,360,392,329,361,393,330,362,394,331,363,395,396,438,480,397,
+ * 439,481,398,440,482,399,441,483,400,442,484,401,443,485,402,444,
+ * 486,403,445,487,404,446,488,405,447,489,406,448,490,407,449,491,
+ * 408,450,492,409,451,493,410,452,494,411,453,495,412,454,496,413,
+ * 455,497,414,456,498,415,457,499,416,458,500,417,459,501,418,460,
+ * 502,419,461,503,420,462,504,421,463,505,422,464,506,423,465,507,
+ * 424,466,508,425,467,509,426,468,510,427,469,511,428,470,512,429,
+ * 471,513,430,472,514,431,473,515,432,474,516,433,475,517,434,476,
+ * 518,435,477,519,436,478,520,437,479,521,522,540,558,523,541,559,
+ * 524,542,560,525,543,561,526,544,562,527,545,563,528,546,564,529,
+ * 547,565,530,548,566,531,549,567,532,550,568,533,551,569,534,552,
+ * 570,535,553,571,536,554,572,537,555,573,538,556,574,539,557,575}, { 0, 4,
+ * 8, 1, 5, 9, 2, 6, 10, 3, 7, 11, 12, 16, 20, 13, 17, 21, 14, 18, 22, 15, 19,
+ * 23, 24, 28, 32, 25, 29, 33, 26, 30, 34, 27, 31, 35, 36, 42, 48, 37, 43, 49,
+ * 38, 44, 50, 39, 45, 51, 40, 46, 52, 41, 47, 53, 54, 62, 70, 55, 63, 71, 56,
+ * 64, 72, 57, 65, 73, 58, 66, 74, 59, 67, 75, 60, 68, 76, 61, 69, 77, 78, 88,
+ * 98, 79, 89, 99, 80, 90,100, 81, 91,101, 82, 92,102, 83, 93,103, 84, 94,104,
+ * 85, 95,105, 86, 96,106, 87, 97,107,108,120,132,109,
+ * 121,133,110,122,134,111,123,135,112,124,136,113,125,137,114,126,
+ * 138,115,127,139,116,128,140,117,129,141,118,130,142,119,131,143,
+ * 144,158,172,145,159,173,146,160,174,147,161,175,148,162,176,149,
+ * 163,177,150,164,178,151,165,179,152,166,180,153,167,181,154,168,
+ * 182,155,169,183,156,170,184,157,171,185,186,204,222,187,205,223,
+ * 188,206,224,189,207,225,190,208,226,191,209,227,192,210,228,193,
+ * 211,229,194,212,230,195,213,231,196,214,232,197,215,233,198,216,
+ * 234,199,217,235,200,218,236,201,219,237,202,220,238,203,221,239,
+ * 240,264,288,241,265,289,242,266,290,243,267,291,244,268,292,245,
+ * 269,293,246,270,294,247,271,295,248,272,296,249,273,297,250,274,
+ * 298,251,275,299,252,276,300,253,277,301,254,278,302,255,279,303,
+ * 256,280,304,257,281,305,258,282,306,259,283,307,260,284,308,261,
+ * 285,309,262,286,310,263,287,311,312,344,376,313,345,377,314,346,
+ * 378,315,347,379,316,348,380,317,349,381,318,350,382,319,351,383,
+ * 320,352,384,321,353,385,322,354,386,323,355,387,324,356,388,325,
+ * 357,389,326,358,390,327,359,391,328,360,392,329,361,393,330,362,
+ * 394,331,363,395,332,364,396,333,365,397,334,366,398,335,367,399,
+ * 336,368,400,337,369,401,338,370,402,339,371,403,340,372,404,341,
+ * 373,405,342,374,406,343,375,407,408,452,496,409,453,497,410,454,
+ * 498,411,455,499,412,456,500,413,457,501,414,458,502,415,459,503,
+ * 416,460,504,417,461,505,418,462,506,419,463,507,420,464,508,421,
+ * 465,509,422,466,510,423,467,511,424,468,512,425,469,513,426,470,
+ * 514,427,471,515,428,472,516,429,473,517,430,474,518,431,475,519,
+ * 432,476,520,433,477,521,434,478,522,435,479,523,436,480,524,437,
+ * 481,525,438,482,526,439,483,527,440,484,528,441,485,529,442,486,
+ * 530,443,487,531,444,488,532,445,489,533,446,490,534,447,491,535,
+ * 448,492,536,449,493,537,450,494,538,451,495,539,540,552,564,541,
+ * 553,565,542,554,566,543,555,567,544,556,568,545,557,569,546,558,
+ * 570,547,559,571,548,560,572,549,561,573,550,562,574,551,563,575}, { 0, 4,
+ * 8, 1, 5, 9, 2, 6, 10, 3, 7, 11, 12, 16, 20, 13, 17, 21, 14, 18, 22, 15, 19,
+ * 23, 24, 28, 32, 25, 29, 33, 26, 30, 34, 27, 31, 35, 36, 42, 48, 37, 43, 49,
+ * 38, 44, 50, 39, 45, 51, 40, 46, 52, 41, 47, 53, 54, 62, 70, 55, 63, 71, 56,
+ * 64, 72, 57, 65, 73, 58, 66, 74, 59, 67, 75, 60, 68, 76, 61, 69, 77, 78, 88,
+ * 98, 79, 89, 99, 80, 90,100, 81, 91,101, 82, 92,102, 83, 93,103, 84, 94,104,
+ * 85, 95,105, 86, 96,106, 87, 97,107,108,120,132,109,
+ * 121,133,110,122,134,111,123,135,112,124,136,113,125,137,114,126,
+ * 138,115,127,139,116,128,140,117,129,141,118,130,142,119,131,143,
+ * 144,158,172,145,159,173,146,160,174,147,161,175,148,162,176,149,
+ * 163,177,150,164,178,151,165,179,152,166,180,153,167,181,154,168,
+ * 182,155,169,183,156,170,184,157,171,185,186,204,222,187,205,223,
+ * 188,206,224,189,207,225,190,208,226,191,209,227,192,210,228,193,
+ * 211,229,194,212,230,195,213,231,196,214,232,197,215,233,198,216,
+ * 234,199,217,235,200,218,236,201,219,237,202,220,238,203,221,239,
+ * 240,264,288,241,265,289,242,266,290,243,267,291,244,268,292,245,
+ * 269,293,246,270,294,247,271,295,248,272,296,249,273,297,250,274,
+ * 298,251,275,299,252,276,300,253,277,301,254,278,302,255,279,303,
+ * 256,280,304,257,281,305,258,282,306,259,283,307,260,284,308,261,
+ * 285,309,262,286,310,263,287,311,312,342,372,313,343,373,314,344,
+ * 374,315,345,375,316,346,376,317,347,377,318,348,378,319,349,379,
+ * 320,350,380,321,351,381,322,352,382,323,353,383,324,354,384,325,
+ * 355,385,326,356,386,327,357,387,328,358,388,329,359,389,330,360,
+ * 390,331,361,391,332,362,392,333,363,393,334,364,394,335,365,395,
+ * 336,366,396,337,367,397,338,368,398,339,369,399,340,370,400,341,
+ * 371,401,402,442,482,403,443,483,404,444,484,405,445,485,406,446,
+ * 486,407,447,487,408,448,488,409,449,489,410,450,490,411,451,491,
+ * 412,452,492,413,453,493,414,454,494,415,455,495,416,456,496,417,
+ * 457,497,418,458,498,419,459,499,420,460,500,421,461,501,422,462,
+ * 502,423,463,503,424,464,504,425,465,505,426,466,506,427,467,507,
+ * 428,468,508,429,469,509,430,470,510,431,471,511,432,472,512,433,
+ * 473,513,434,474,514,435,475,515,436,476,516,437,477,517,438,478,
+ * 518,439,479,519,440,480,520,441,481,521,522,540,558,523,541,559,
+ * 524,542,560,525,543,561,526,544,562,527,545,563,528,546,564,529,
+ * 547,565,530,548,566,531,549,567,532,550,568,533,551,569,534,552,
+ * 570,535,553,571,536,554,572,537,555,573,538,556,574,539,557,575}, { 0, 4,
+ * 8, 1, 5, 9, 2, 6, 10, 3, 7, 11, 12, 16, 20, 13, 17, 21, 14, 18, 22, 15, 19,
+ * 23, 24, 28, 32, 25, 29, 33, 26, 30, 34, 27, 31, 35, 36, 40, 44, 37, 41, 45,
+ * 38, 42, 46, 39, 43, 47, 48, 54, 60, 49, 55, 61, 50, 56, 62, 51, 57, 63, 52,
+ * 58, 64, 53, 59, 65, 66, 74, 82, 67, 75, 83, 68, 76, 84, 69, 77, 85, 70, 78,
+ * 86, 71, 79, 87, 72, 80, 88, 73, 81, 89, 90,100,110, 91,101,111, 92,102,112,
+ * 93,103,113, 94,104,114, 95,105,115, 96,106,116, 97, 107,117, 98,108,118,
+ * 99,109,119,120,132,144,121,133,145,122,134,
+ * 146,123,135,147,124,136,148,125,137,149,126,138,150,127,139,151,
+ * 128,140,152,129,141,153,130,142,154,131,143,155,156,170,184,157,
+ * 171,185,158,172,186,159,173,187,160,174,188,161,175,189,162,176,
+ * 190,163,177,191,164,178,192,165,179,193,166,180,194,167,181,195,
+ * 168,182,196,169,183,197,198,216,234,199,217,235,200,218,236,201,
+ * 219,237,202,220,238,203,221,239,204,222,240,205,223,241,206,224,
+ * 242,207,225,243,208,226,244,209,227,245,210,228,246,211,229,247,
+ * 212,230,248,213,231,249,214,232,250,215,233,251,252,274,296,253,
+ * 275,297,254,276,298,255,277,299,256,278,300,257,279,301,258,280,
+ * 302,259,281,303,260,282,304,261,283,305,262,284,306,263,285,307,
+ * 264,286,308,265,287,309,266,288,310,267,289,311,268,290,312,269,
+ * 291,313,270,292,314,271,293,315,272,294,316,273,295,317,318,348,
+ * 378,319,349,379,320,350,380,321,351,381,322,352,382,323,353,383,
+ * 324,354,384,325,355,385,326,356,386,327,357,387,328,358,388,329,
+ * 359,389,330,360,390,331,361,391,332,362,392,333,363,393,334,364,
+ * 394,335,365,395,336,366,396,337,367,397,338,368,398,339,369,399,
+ * 340,370,400,341,371,401,342,372,402,343,373,403,344,374,404,345,
+ * 375,405,346,376,406,347,377,407,408,464,520,409,465,521,410,466,
+ * 522,411,467,523,412,468,524,413,469,525,414,470,526,415,471,527,
+ * 416,472,528,417,473,529,418,474,530,419,475,531,420,476,532,421,
+ * 477,533,422,478,534,423,479,535,424,480,536,425,481,537,426,482,
+ * 538,427,483,539,428,484,540,429,485,541,430,486,542,431,487,543,
+ * 432,488,544,433,489,545,434,490,546,435,491,547,436,492,548,437,
+ * 493,549,438,494,550,439,495,551,440,496,552,441,497,553,442,498,
+ * 554,443,499,555,444,500,556,445,501,557,446,502,558,447,503,559,
+ * 448,504,560,449,505,561,450,506,562,451,507,563,452,508,564,453,
+ * 509,565,454,510,566,455,511,567,456,512,568,457,513,569,458,514,
+ * 570,459,515,571,460,516,572,461,517,573,462,518,574,463,519,575}, { 0, 4,
+ * 8, 1, 5, 9, 2, 6, 10, 3, 7, 11, 12, 16, 20, 13, 17, 21, 14, 18, 22, 15, 19,
+ * 23, 24, 28, 32, 25, 29, 33, 26, 30, 34, 27, 31, 35, 36, 40, 44, 37, 41, 45,
+ * 38, 42, 46, 39, 43, 47, 48, 54, 60, 49, 55, 61, 50, 56, 62, 51, 57, 63, 52,
+ * 58, 64, 53, 59, 65, 66, 72, 78, 67, 73, 79, 68, 74, 80, 69, 75, 81, 70, 76,
+ * 82, 71, 77, 83, 84, 94,104, 85, 95,105, 86, 96,106, 87, 97,107, 88, 98,108,
+ * 89, 99,109, 90,100,110, 91,101,111, 92,102,112, 93,
+ * 103,113,114,126,138,115,127,139,116,128,140,117,129,141,118,130,
+ * 142,119,131,143,120,132,144,121,133,145,122,134,146,123,135,147,
+ * 124,136,148,125,137,149,150,164,178,151,165,179,152,166,180,153,
+ * 167,181,154,168,182,155,169,183,156,170,184,157,171,185,158,172,
+ * 186,159,173,187,160,174,188,161,175,189,162,176,190,163,177,191,
+ * 192,208,224,193,209,225,194,210,226,195,211,227,196,212,228,197,
+ * 213,229,198,214,230,199,215,231,200,216,232,201,217,233,202,218,
+ * 234,203,219,235,204,220,236,205,221,237,206,222,238,207,223,239,
+ * 240,260,280,241,261,281,242,262,282,243,263,283,244,264,284,245,
+ * 265,285,246,266,286,247,267,287,248,268,288,249,269,289,250,270,
+ * 290,251,271,291,252,272,292,253,273,293,254,274,294,255,275,295,
+ * 256,276,296,257,277,297,258,278,298,259,279,299,300,326,352,301,
+ * 327,353,302,328,354,303,329,355,304,330,356,305,331,357,306,332,
+ * 358,307,333,359,308,334,360,309,335,361,310,336,362,311,337,363,
+ * 312,338,364,313,339,365,314,340,366,315,341,367,316,342,368,317,
+ * 343,369,318,344,370,319,345,371,320,346,372,321,347,373,322,348,
+ * 374,323,349,375,324,350,376,325,351,377,378,444,510,379,445,511,
+ * 380,446,512,381,447,513,382,448,514,383,449,515,384,450,516,385,
+ * 451,517,386,452,518,387,453,519,388,454,520,389,455,521,390,456,
+ * 522,391,457,523,392,458,524,393,459,525,394,460,526,395,461,527,
+ * 396,462,528,397,463,529,398,464,530,399,465,531,400,466,532,401,
+ * 467,533,402,468,534,403,469,535,404,470,536,405,471,537,406,472,
+ * 538,407,473,539,408,474,540,409,475,541,410,476,542,411,477,543,
+ * 412,478,544,413,479,545,414,480,546,415,481,547,416,482,548,417,
+ * 483,549,418,484,550,419,485,551,420,486,552,421,487,553,422,488,
+ * 554,423,489,555,424,490,556,425,491,557,426,492,558,427,493,559,
+ * 428,494,560,429,495,561,430,496,562,431,497,563,432,498,564,433,
+ * 499,565,434,500,566,435,501,567,436,502,568,437,503,569,438,504,
+ * 570,439,505,571,440,506,572,441,507,573,442,508,574,443,509,575}, { 0, 4,
+ * 8, 1, 5, 9, 2, 6, 10, 3, 7, 11, 12, 16, 20, 13, 17, 21, 14, 18, 22, 15, 19,
+ * 23, 24, 28, 32, 25, 29, 33, 26, 30, 34, 27, 31, 35, 36, 40, 44, 37, 41, 45,
+ * 38, 42, 46, 39, 43, 47, 48, 54, 60, 49, 55, 61, 50, 56, 62, 51, 57, 63, 52,
+ * 58, 64, 53, 59, 65, 66, 74, 82, 67, 75, 83, 68, 76, 84, 69, 77, 85, 70, 78,
+ * 86, 71, 79, 87, 72, 80, 88, 73, 81, 89, 90,102,114, 91,103,115, 92,104,116,
+ * 93,105,117, 94,106,118, 95,107,119, 96,108,120, 97, 109,121, 98,110,122,
+ * 99,111,123,100,112,124,101,113,125,126,142,
+ * 158,127,143,159,128,144,160,129,145,161,130,146,162,131,147,163,
+ * 132,148,164,133,149,165,134,150,166,135,151,167,136,152,168,137,
+ * 153,169,138,154,170,139,155,171,140,156,172,141,157,173,174,194,
+ * 214,175,195,215,176,196,216,177,197,217,178,198,218,179,199,219,
+ * 180,200,220,181,201,221,182,202,222,183,203,223,184,204,224,185,
+ * 205,225,186,206,226,187,207,227,188,208,228,189,209,229,190,210,
+ * 230,191,211,231,192,212,232,193,213,233,234,260,286,235,261,287,
+ * 236,262,288,237,263,289,238,264,290,239,265,291,240,266,292,241,
+ * 267,293,242,268,294,243,269,295,244,270,296,245,271,297,246,272,
+ * 298,247,273,299,248,274,300,249,275,301,250,276,302,251,277,303,
+ * 252,278,304,253,279,305,254,280,306,255,281,307,256,282,308,257,
+ * 283,309,258,284,310,259,285,311,312,346,380,313,347,381,314,348,
+ * 382,315,349,383,316,350,384,317,351,385,318,352,386,319,353,387,
+ * 320,354,388,321,355,389,322,356,390,323,357,391,324,358,392,325,
+ * 359,393,326,360,394,327,361,395,328,362,396,329,363,397,330,364,
+ * 398,331,365,399,332,366,400,333,367,401,334,368,402,335,369,403,
+ * 336,370,404,337,371,405,338,372,406,339,373,407,340,374,408,341,
+ * 375,409,342,376,410,343,377,411,344,378,412,345,379,413,414,456,
+ * 498,415,457,499,416,458,500,417,459,501,418,460,502,419,461,503,
+ * 420,462,504,421,463,505,422,464,506,423,465,507,424,466,508,425,
+ * 467,509,426,468,510,427,469,511,428,470,512,429,471,513,430,472,
+ * 514,431,473,515,432,474,516,433,475,517,434,476,518,435,477,519,
+ * 436,478,520,437,479,521,438,480,522,439,481,523,440,482,524,441,
+ * 483,525,442,484,526,443,485,527,444,486,528,445,487,529,446,488,
+ * 530,447,489,531,448,490,532,449,491,533,450,492,534,451,493,535,
+ * 452,494,536,453,495,537,454,496,538,455,497,539,540,552,564,541,
+ * 553,565,542,554,566,543,555,567,544,556,568,545,557,569,546,558,
+ * 570,547,559,571,548,560,572,549,561,573,550,562,574,551,563,575} };
+ */
+
+ private static final float cs[] = { 0.857492925712f, 0.881741997318f, 0.949628649103f,
+ 0.983314592492f, 0.995517816065f, 0.999160558175f, 0.999899195243f, 0.999993155067f };
+
+ private static final float ca[] = { -0.5144957554270f, -0.4717319685650f, -0.3133774542040f,
+ -0.1819131996110f, -0.0945741925262f, -0.0409655828852f, -0.0141985685725f,
+ -0.00369997467375f };
+
+ /************************************************************/
+ /* END OF L3TABLE */
+ /************************************************************/
+
+ /************************************************************/
+ /* L3TYPE */
+ /************************************************************/
+
+ /***************************************************************/
+ /* END OF L3TYPE */
+ /***************************************************************/
+
+ /***************************************************************/
+ /* INV_MDCT */
+ /***************************************************************/
+ public static final float win[][] = {
+ { -1.6141214951E-02f, -5.3603178919E-02f, -1.0070713296E-01f, -1.6280817573E-01f,
+ -4.9999999679E-01f, -3.8388735032E-01f, -6.2061144372E-01f, -1.1659756083E+00f,
+ -3.8720752656E+00f, -4.2256286556E+00f, -1.5195289984E+00f, -9.7416483388E-01f,
+ -7.3744074053E-01f, -1.2071067773E+00f, -5.1636156596E-01f, -4.5426052317E-01f,
+ -4.0715656898E-01f, -3.6969460527E-01f, -3.3876269197E-01f, -3.1242222492E-01f,
+ -2.8939587111E-01f, -2.6880081906E-01f, -5.0000000266E-01f, -2.3251417468E-01f,
+ -2.1596714708E-01f, -2.0004979098E-01f, -1.8449493497E-01f, -1.6905846094E-01f,
+ -1.5350360518E-01f, -1.3758624925E-01f, -1.2103922149E-01f, -2.0710679058E-01f,
+ -8.4752577594E-02f, -6.4157525656E-02f, -4.1131172614E-02f, -1.4790705759E-02f },
+
+ { -1.6141214951E-02f, -5.3603178919E-02f, -1.0070713296E-01f, -1.6280817573E-01f,
+ -4.9999999679E-01f, -3.8388735032E-01f, -6.2061144372E-01f, -1.1659756083E+00f,
+ -3.8720752656E+00f, -4.2256286556E+00f, -1.5195289984E+00f, -9.7416483388E-01f,
+ -7.3744074053E-01f, -1.2071067773E+00f, -5.1636156596E-01f, -4.5426052317E-01f,
+ -4.0715656898E-01f, -3.6969460527E-01f, -3.3908542600E-01f, -3.1511810350E-01f,
+ -2.9642226150E-01f, -2.8184548650E-01f, -5.4119610000E-01f, -2.6213228100E-01f,
+ -2.5387916537E-01f, -2.3296291359E-01f, -1.9852728987E-01f, -1.5233534808E-01f,
+ -9.6496400054E-02f, -3.3423828516E-02f, 0.0000000000E+00f, 0.0000000000E+00f,
+ 0.0000000000E+00f, 0.0000000000E+00f, 0.0000000000E+00f, 0.0000000000E+00f },
+
+ { -4.8300800645E-02f, -1.5715656932E-01f, -2.8325045177E-01f, -4.2953747763E-01f,
+ -1.2071067795E+00f, -8.2426483178E-01f, -1.1451749106E+00f, -1.7695290101E+00f,
+ -4.5470225061E+00f, -3.4890531002E+00f, -7.3296292804E-01f, -1.5076514758E-01f,
+ 0.0000000000E+00f, 0.0000000000E+00f, 0.0000000000E+00f, 0.0000000000E+00f,
+ 0.0000000000E+00f, 0.0000000000E+00f, 0.0000000000E+00f, 0.0000000000E+00f,
+ 0.0000000000E+00f, 0.0000000000E+00f, 0.0000000000E+00f, 0.0000000000E+00f,
+ 0.0000000000E+00f, 0.0000000000E+00f, 0.0000000000E+00f, 0.0000000000E+00f,
+ 0.0000000000E+00f, 0.0000000000E+00f, 0.0000000000E+00f, 0.0000000000E+00f,
+ 0.0000000000E+00f, 0.0000000000E+00f, 0.0000000000E+00f, 0.0000000000E+00f },
+
+ { 0.0000000000E+00f, 0.0000000000E+00f, 0.0000000000E+00f, 0.0000000000E+00f,
+ 0.0000000000E+00f, 0.0000000000E+00f, -1.5076513660E-01f, -7.3296291107E-01f,
+ -3.4890530566E+00f, -4.5470224727E+00f, -1.7695290031E+00f, -1.1451749092E+00f,
+ -8.3137738100E-01f, -1.3065629650E+00f, -5.4142014250E-01f, -4.6528974900E-01f,
+ -4.1066990750E-01f, -3.7004680800E-01f, -3.3876269197E-01f, -3.1242222492E-01f,
+ -2.8939587111E-01f, -2.6880081906E-01f, -5.0000000266E-01f, -2.3251417468E-01f,
+ -2.1596714708E-01f, -2.0004979098E-01f, -1.8449493497E-01f, -1.6905846094E-01f,
+ -1.5350360518E-01f, -1.3758624925E-01f, -1.2103922149E-01f, -2.0710679058E-01f,
+ -8.4752577594E-02f, -6.4157525656E-02f, -4.1131172614E-02f, -1.4790705759E-02f } };
+
+ /***************************************************************/
+ /* END OF INV_MDCT */
+ /***************************************************************/
+
+ class Sftable {
+ public int[] l;
+ public int[] s;
+
+ public Sftable() {
+ l = new int[5];
+ s = new int[3];
+ }
+
+ public Sftable(int[] thel, int[] thes) {
+ l = thel;
+ s = thes;
+ }
+ }
+
+ public Sftable sftable;
+
+ public static final int nr_of_sfb_block[][][] = {
+ { { 6, 5, 5, 5 }, { 9, 9, 9, 9 }, { 6, 9, 9, 9 } },
+ { { 6, 5, 7, 3 }, { 9, 9, 12, 6 }, { 6, 9, 12, 6 } },
+ { { 11, 10, 0, 0 }, { 18, 18, 0, 0 }, { 15, 18, 0, 0 } },
+ { { 7, 7, 7, 0 }, { 12, 12, 12, 0 }, { 6, 15, 12, 0 } },
+ { { 6, 6, 6, 3 }, { 12, 9, 9, 6 }, { 6, 12, 9, 6 } },
+ { { 8, 8, 5, 0 }, { 15, 12, 9, 0 }, { 6, 18, 9, 0 } } };
+
+}
diff --git a/Robust/src/Tests/ssJava/mp3decoder/Manager.java b/Robust/src/Tests/ssJava/mp3decoder/Manager.java
new file mode 100644
index 00000000..47f53118
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/Manager.java
@@ -0,0 +1,46 @@
+/*
+ * 11/19/04 1.0 moved to LGPL.
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+
+package javazoom.jl.decoder;
+
+/**
+ * Work in progress.
+ *
+ * Manages a number of controls.
+ */
+public class Manager //implements Control
+{
+ public void addControl(Control c)
+ {
+
+ }
+
+ public void removeControl(Control c)
+ {
+
+ }
+
+ public void removeAll()
+ {
+
+ }
+
+ // control interface delegates to a managed control
+
+}
diff --git a/Robust/src/Tests/ssJava/mp3decoder/Obuffer.java b/Robust/src/Tests/ssJava/mp3decoder/Obuffer.java
new file mode 100644
index 00000000..0481f11c
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/Obuffer.java
@@ -0,0 +1,88 @@
+/*
+ * 11/19/04 1.0 moved to LGPL.
+ * 12/12/99 Added appendSamples() method for efficiency. MDM.
+ * 15/02/99 ,Java Conversion by E.B ,ebsp@iname.com, JavaLayer
+ *
+ * Declarations for output buffer, includes operating system
+ * implementation of the virtual Obuffer. Optional routines
+ * enabling seeks and stops added by Jeff Tsay.
+ *
+ * @(#) obuffer.h 1.8, last edit: 6/15/94 16:51:56
+ * @(#) Copyright (C) 1993, 1994 Tobias Bading (bading@cs.tu-berlin.de)
+ * @(#) Berlin University of Technology
+ *
+ * Idea and first implementation for u-law output with fast downsampling by
+ * Jim Boucher (jboucher@flash.bu.edu)
+ *
+ * LinuxObuffer class written by
+ * Louis P. Kruger (lpkruger@phoenix.princeton.edu)
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+package javazoom.jl.decoder;
+
+/**
+ * Base Class for audio output.
+ */
+public abstract class Obuffer
+{
+ public static final int OBUFFERSIZE = 2 * 1152; // max. 2 * 1152 samples per frame
+ public static final int MAXCHANNELS = 2; // max. number of channels
+
+ /**
+ * Takes a 16 Bit PCM sample.
+ */
+ public abstract void append(int channel, short value);
+
+ /**
+ * Accepts 32 new PCM samples.
+ */
+ public void appendSamples(int channel, float[] f)
+ {
+ short s;
+ for (int i=0; i<32;)
+ {
+ s = clip(f[i++]);
+ append(channel, s);
+ }
+ }
+
+ /**
+ * Clip Sample to 16 Bits
+ */
+ private final short clip(float sample)
+ {
+ return ((sample > 32767.0f) ? 32767 :
+ ((sample < -32768.0f) ? -32768 :
+ (short) sample));
+ }
+
+ /**
+ * Write the samples to the file or directly to the audio hardware.
+ */
+ public abstract void write_buffer(int val);
+ public abstract void close();
+
+ /**
+ * Clears all data in the buffer (for seeking).
+ */
+ public abstract void clear_buffer();
+
+ /**
+ * Notify the buffer that the user has stopped the stream.
+ */
+ public abstract void set_stop_flag();
+}
diff --git a/Robust/src/Tests/ssJava/mp3decoder/OutputChannels.java b/Robust/src/Tests/ssJava/mp3decoder/OutputChannels.java
new file mode 100644
index 00000000..be2c66d2
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/OutputChannels.java
@@ -0,0 +1,143 @@
+/*
+ * 11/19/04 1.0 moved to LGPL.
+ * 12/12/99 Initial implementation. mdm@techie.com.
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+
+package javazoom.jl.decoder;
+
+
+/**
+ * A Type-safe representation of the the supported output channel
+ * constants.
+ *
+ * This class is immutable and, hence, is thread safe.
+ *
+ * @author Mat McGowan 12/12/99
+ * @since 0.0.7
+ */
+public class OutputChannels
+{
+ /**
+ * Flag to indicate output should include both channels.
+ */
+ public static final int BOTH_CHANNELS = 0;
+
+ /**
+ * Flag to indicate output should include the left channel only.
+ */
+ public static final int LEFT_CHANNEL = 1;
+
+ /**
+ * Flag to indicate output should include the right channel only.
+ */
+ public static final int RIGHT_CHANNEL = 2;
+
+ /**
+ * Flag to indicate output is mono.
+ */
+ public static final int DOWNMIX_CHANNELS = 3;
+
+
+ public static final OutputChannels LEFT = new OutputChannels(LEFT_CHANNEL);
+ public static final OutputChannels RIGHT = new OutputChannels(RIGHT_CHANNEL);
+ public static final OutputChannels BOTH = new OutputChannels(BOTH_CHANNELS);
+ public static final OutputChannels DOWNMIX = new OutputChannels(DOWNMIX_CHANNELS);
+
+
+ private /*final*/ int outputChannels;
+
+ /**
+ * Creates an <code>OutputChannels</code> instance
+ * corresponding to the given channel code.
+ *
+ * @param code one of the OutputChannels channel code constants.
+ *
+ * @throws IllegalArgumentException if code is not a valid
+ * channel code.
+ */
+ static public OutputChannels fromInt(int code)
+ {
+ switch (code)
+ {
+ case LEFT_CHANNEL:
+ return LEFT;
+ case RIGHT_CHANNEL:
+ return RIGHT;
+ case BOTH_CHANNELS:
+ return BOTH;
+ case DOWNMIX_CHANNELS:
+ return DOWNMIX;
+ default:
+ throw new IllegalArgumentException("Invalid channel code: "+code);
+ }
+ }
+
+ private OutputChannels(int channels)
+ {
+ outputChannels = channels;
+
+ if (channels<0 || channels>3)
+ throw new IllegalArgumentException("channels");
+ }
+
+ /**
+ * Retrieves the code representing the desired output channels.
+ * Will be one of LEFT_CHANNEL, RIGHT_CHANNEL, BOTH_CHANNELS
+ * or DOWNMIX_CHANNELS.
+ *
+ * @return the channel code represented by this instance.
+ */
+ public int getChannelsOutputCode()
+ {
+ return outputChannels;
+ }
+
+ /**
+ * Retrieves the number of output channels represented
+ * by this channel output type.
+ *
+ * @return The number of output channels for this channel output
+ * type. This will be 2 for BOTH_CHANNELS only, and 1
+ * for all other types.
+ */
+ public int getChannelCount()
+ {
+ int count = (outputChannels==BOTH_CHANNELS) ? 2 : 1;
+ return count;
+ }
+
+
+ public boolean equals(Object o)
+ {
+ boolean equals = false;
+
+ if (o instanceof OutputChannels)
+ {
+ OutputChannels oc = (OutputChannels)o;
+ equals = (oc.outputChannels == outputChannels);
+ }
+
+ return equals;
+ }
+
+ public int hashCode()
+ {
+ return outputChannels;
+ }
+
+}
diff --git a/Robust/src/Tests/ssJava/mp3decoder/Player.java b/Robust/src/Tests/ssJava/mp3decoder/Player.java
new file mode 100644
index 00000000..c3020575
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/Player.java
@@ -0,0 +1,251 @@
+/*
+ * 11/19/04 1.0 moved to LGPL.
+ * 29/01/00 Initial version. mdm@techie.com
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+
+package javazoom.jl.player;
+
+import java.io.InputStream;
+
+import javazoom.jl.decoder.Bitstream;
+import javazoom.jl.decoder.BitstreamException;
+import javazoom.jl.decoder.Decoder;
+import javazoom.jl.decoder.Header;
+import javazoom.jl.decoder.JavaLayerException;
+import javazoom.jl.decoder.SampleBuffer;
+
+/**
+ * The <code>Player</code> class implements a simple player for playback
+ * of an MPEG audio stream.
+ *
+ * @author Mat McGowan
+ * @since 0.0.8
+ */
+
+// REVIEW: the audio device should not be opened until the
+// first MPEG audio frame has been decoded.
+public class Player
+{
+ /**
+ * The current frame number.
+ */
+ private int frame = 0;
+
+ /**
+ * The MPEG audio bitstream.
+ */
+ // javac blank final bug.
+ /*final*/ private Bitstream bitstream;
+
+ /**
+ * The MPEG audio decoder.
+ */
+ /*final*/ private Decoder decoder;
+
+ /**
+ * The AudioDevice the audio samples are written to.
+ */
+ private AudioDevice audio;
+
+ /**
+ * Has the player been closed?
+ */
+ private boolean closed = false;
+
+ /**
+ * Has the player played back all frames from the stream?
+ */
+ private boolean complete = false;
+
+ private int lastPosition = 0;
+
+ /**
+ * Creates a new <code>Player</code> instance.
+ */
+ public Player(InputStream stream) throws JavaLayerException
+ {
+ this(stream, null);
+ }
+
+ public Player(InputStream stream, AudioDevice device) throws JavaLayerException
+ {
+ bitstream = new Bitstream(stream);
+ decoder = new Decoder();
+
+ if (device!=null)
+ {
+ audio = device;
+ }
+ else
+ {
+ FactoryRegistry r = FactoryRegistry.systemRegistry();
+ audio = r.createAudioDevice();
+ }
+ audio.open(decoder);
+ }
+
+ public void play() throws JavaLayerException
+ {
+ play(Integer.MAX_VALUE);
+ }
+
+ /**
+ * Plays a number of MPEG audio frames.
+ *
+ * @param frames The number of frames to play.
+ * @return true if the last frame was played, or false if there are
+ * more frames.
+ */
+ public boolean play(int frames) throws JavaLayerException
+ {
+ boolean ret = true;
+
+ while (frames-- > 0 && ret)
+ {
+ ret = decodeFrame();
+ }
+
+ if (!ret)
+ {
+ // last frame, ensure all data flushed to the audio device.
+ AudioDevice out = audio;
+ if (out!=null)
+ {
+ out.flush();
+ synchronized (this)
+ {
+ complete = (!closed);
+ close();
+ }
+ }
+ }
+ return ret;
+ }
+
+ /**
+ * Cloases this player. Any audio currently playing is stopped
+ * immediately.
+ */
+ public synchronized void close()
+ {
+ AudioDevice out = audio;
+ if (out!=null)
+ {
+ closed = true;
+ audio = null;
+ // this may fail, so ensure object state is set up before
+ // calling this method.
+ out.close();
+ lastPosition = out.getPosition();
+ try
+ {
+ bitstream.close();
+ }
+ catch (BitstreamException ex)
+ {
+ }
+ }
+ }
+
+ /**
+ * Returns the completed status of this player.
+ *
+ * @return true if all available MPEG audio frames have been
+ * decoded, or false otherwise.
+ */
+ public synchronized boolean isComplete()
+ {
+ return complete;
+ }
+
+ /**
+ * Retrieves the position in milliseconds of the current audio
+ * sample being played. This method delegates to the <code>
+ * AudioDevice</code> that is used by this player to sound
+ * the decoded audio samples.
+ */
+ public int getPosition()
+ {
+ int position = lastPosition;
+
+ AudioDevice out = audio;
+ if (out!=null)
+ {
+ position = out.getPosition();
+ }
+ return position;
+ }
+
+ /**
+ * Decodes a single frame.
+ *
+ * @return true if there are no more frames to decode, false otherwise.
+ */
+ protected boolean decodeFrame() throws JavaLayerException
+ {
+ try
+ {
+ AudioDevice out = audio;
+ if (out==null)
+ return false;
+
+ Header h = bitstream.readFrame();
+
+ if (h==null)
+ return false;
+
+ // sample buffer set when decoder constructed
+ SampleBuffer output = (SampleBuffer)decoder.decodeFrame(h, bitstream);
+
+ synchronized (this)
+ {
+ out = audio;
+ if (out!=null)
+ {
+ out.write(output.getBuffer(), 0, output.getBufferLength());
+ }
+ }
+
+ bitstream.closeFrame();
+ }
+ catch (RuntimeException ex)
+ {
+ throw new JavaLayerException("Exception decoding audio frame", ex);
+ }
+/*
+ catch (IOException ex)
+ {
+ System.out.println("exception decoding audio frame: "+ex);
+ return false;
+ }
+ catch (BitstreamException bitex)
+ {
+ System.out.println("exception decoding audio frame: "+bitex);
+ return false;
+ }
+ catch (DecoderException decex)
+ {
+ System.out.println("exception decoding audio frame: "+decex);
+ return false;
+ }
+*/
+ return true;
+ }
+
+
+}
diff --git a/Robust/src/Tests/ssJava/mp3decoder/SampleBuffer.java b/Robust/src/Tests/ssJava/mp3decoder/SampleBuffer.java
new file mode 100644
index 00000000..3bc0fe85
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/SampleBuffer.java
@@ -0,0 +1,132 @@
+/*
+ * 11/19/04 1.0 moved to LGPL.
+ *
+ * 12/12/99 Initial Version based on FileObuffer. mdm@techie.com.
+ *
+ * FileObuffer:
+ * 15/02/99 Java Conversion by E.B ,javalayer@javazoom.net
+ *
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+
+package javazoom.jl.decoder;
+
+/**
+ * The <code>SampleBuffer</code> class implements an output buffer
+ * that provides storage for a fixed size block of samples.
+ */
+public class SampleBuffer extends Obuffer
+{
+ private short[] buffer;
+ private int[] bufferp;
+ private int channels;
+ private int frequency;
+
+ /**
+ * Constructor
+ */
+ public SampleBuffer(int sample_frequency, int number_of_channels)
+ {
+ buffer = new short[OBUFFERSIZE];
+ bufferp = new int[MAXCHANNELS];
+ channels = number_of_channels;
+ frequency = sample_frequency;
+
+ for (int i = 0; i < number_of_channels; ++i)
+ bufferp[i] = (short)i;
+
+ }
+
+ public int getChannelCount()
+ {
+ return this.channels;
+ }
+
+ public int getSampleFrequency()
+ {
+ return this.frequency;
+ }
+
+ public short[] getBuffer()
+ {
+ return this.buffer;
+ }
+
+ public int getBufferLength()
+ {
+ return bufferp[0];
+ }
+
+ /**
+ * Takes a 16 Bit PCM sample.
+ */
+ public void append(int channel, short value)
+ {
+ buffer[bufferp[channel]] = value;
+ bufferp[channel] += channels;
+ }
+
+ public void appendSamples(int channel, float[] f)
+ {
+ int pos = bufferp[channel];
+
+ short s;
+ float fs;
+ for (int i=0; i<32;)
+ {
+ fs = f[i++];
+ fs = (fs>32767.0f ? 32767.0f
+ : (fs < -32767.0f ? -32767.0f : fs));
+
+ s = (short)fs;
+ buffer[pos] = s;
+ pos += channels;
+ }
+
+ bufferp[channel] = pos;
+ }
+
+
+ /**
+ * Write the samples to the file (Random Acces).
+ */
+ public void write_buffer(int val)
+ {
+
+ //for (int i = 0; i < channels; ++i)
+ // bufferp[i] = (short)i;
+
+ }
+
+ public void close()
+ {}
+
+ /**
+ *
+ */
+ public void clear_buffer()
+ {
+ for (int i = 0; i < channels; ++i)
+ bufferp[i] = (short)i;
+ }
+
+ /**
+ *
+ */
+ public void set_stop_flag()
+ {}
+}
diff --git a/Robust/src/Tests/ssJava/mp3decoder/Source.java b/Robust/src/Tests/ssJava/mp3decoder/Source.java
new file mode 100644
index 00000000..f4d7316a
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/Source.java
@@ -0,0 +1,49 @@
+/*
+ * 11/19/04 1.0 moved to LGPL.
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+
+package javazoom.jl.decoder;
+
+import java.io.IOException;
+
+/**
+ * Work in progress.
+ *
+ * Class to describe a seekable data source.
+ *
+ */
+public interface Source
+{
+
+ public static final long LENGTH_UNKNOWN = -1;
+
+ public int read(byte[] b, int offs, int len)
+ throws IOException;
+
+
+ public boolean willReadBlock();
+
+ public boolean isSeekable();
+
+ public long length();
+
+ public long tell();
+
+ public long seek(long pos);
+
+}
diff --git a/Robust/src/Tests/ssJava/mp3decoder/SynthesisFilter.java b/Robust/src/Tests/ssJava/mp3decoder/SynthesisFilter.java
new file mode 100644
index 00000000..b657b518
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/SynthesisFilter.java
@@ -0,0 +1,1817 @@
+/*
+ * 11/19/04 1.0 moved to LGPL.
+ *
+ * 04/01/00 Fixes for running under build 23xx Microsoft JVM. mdm.
+ *
+ * 19/12/99 Performance improvements to compute_pcm_samples().
+ * Mat McGowan. mdm@techie.com.
+ *
+ * 16/02/99 Java Conversion by E.B , javalayer@javazoom.net
+ *
+ * @(#) synthesis_filter.h 1.8, last edit: 6/15/94 16:52:00
+ * @(#) Copyright (C) 1993, 1994 Tobias Bading (bading@cs.tu-berlin.de)
+ * @(#) Berlin University of Technology
+ *
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+package javazoom.jl.decoder;
+
+import java.io.IOException;
+
+/**
+ * A class for the synthesis filter bank.
+ * This class does a fast downsampling from 32, 44.1 or 48 kHz to 8 kHz, if ULAW is defined.
+ * Frequencies above 4 kHz are removed by ignoring higher subbands.
+ */
+final class SynthesisFilter
+{
+ private float[] v1;
+ private float[] v2;
+ private float[] actual_v; // v1 or v2
+ private int actual_write_pos; // 0-15
+ private float[] samples; // 32 new subband samples
+ private int channel;
+ private float scalefactor;
+ private float[] eq;
+
+ /**
+ * Quality value for controlling CPU usage/quality tradeoff.
+ */
+ /*
+ private int quality;
+
+ private int v_inc;
+
+
+
+ public static final int HIGH_QUALITY = 1;
+ public static final int MEDIUM_QUALITY = 2;
+ public static final int LOW_QUALITY = 4;
+ */
+
+ /**
+ * Contructor.
+ * The scalefactor scales the calculated float pcm samples to short values
+ * (raw pcm samples are in [-1.0, 1.0], if no violations occur).
+ */
+ public SynthesisFilter(int channelnumber, float factor, float[] eq0)
+ {
+ if (d==null)
+ {
+ d = load_d();
+ d16 = splitArray(d, 16);
+ }
+
+ v1 = new float[512];
+ v2 = new float[512];
+ samples = new float[32];
+ channel = channelnumber;
+ scalefactor = factor;
+ setEQ(eq);
+ //setQuality(HIGH_QUALITY);
+
+ reset();
+ }
+
+ public void setEQ(float[] eq0)
+ {
+ this.eq = eq0;
+ if (eq==null)
+ {
+ eq = new float[32];
+ for (int i=0; i<32; i++)
+ eq[i] = 1.0f;
+ }
+ if (eq.length<32)
+ {
+ throw new IllegalArgumentException("eq0");
+ }
+
+ }
+
+ /*
+ private void setQuality(int quality0)
+ {
+ switch (quality0)
+ {
+ case HIGH_QUALITY:
+ case MEDIUM_QUALITY:
+ case LOW_QUALITY:
+ v_inc = 16 * quality0;
+ quality = quality0;
+ break;
+ default :
+ throw new IllegalArgumentException("Unknown quality value");
+ }
+ }
+
+ public int getQuality()
+ {
+ return quality;
+ }
+ */
+
+ /**
+ * Reset the synthesis filter.
+ */
+ public void reset()
+ {
+ //float[] floatp;
+ // float[] floatp2;
+
+ // initialize v1[] and v2[]:
+ //for (floatp = v1 + 512, floatp2 = v2 + 512; floatp > v1; )
+ // *--floatp = *--floatp2 = 0.0;
+ for (int p=0;p<512;p++)
+ v1[p] = v2[p] = 0.0f;
+
+ // initialize samples[]:
+ //for (floatp = samples + 32; floatp > samples; )
+ // *--floatp = 0.0;
+ for (int p2=0;p2<32;p2++)
+ samples[p2] = 0.0f;
+
+ actual_v = v1;
+ actual_write_pos = 15;
+ }
+
+
+ /**
+ * Inject Sample.
+ */
+ public void input_sample(float sample, int subbandnumber)
+ {
+ samples[subbandnumber] = eq[subbandnumber]*sample;
+ }
+
+ public void input_samples(float[] s)
+ {
+ for (int i=31; i>=0; i--)
+ {
+ samples[i] = s[i]*eq[i];
+ }
+ }
+
+ /**
+ * Compute new values via a fast cosine transform.
+ */
+ private void compute_new_v()
+ {
+ // p is fully initialized from x1
+ //float[] p = _p;
+ // pp is fully initialized from p
+ //float[] pp = _pp;
+
+ //float[] new_v = _new_v;
+
+ //float[] new_v = new float[32]; // new V[0-15] and V[33-48] of Figure 3-A.2 in ISO DIS 11172-3
+ //float[] p = new float[16];
+ //float[] pp = new float[16];
+
+ /*
+ for (int i=31; i>=0; i--)
+ {
+ new_v[i] = 0.0f;
+ }
+ */
+
+ float new_v0, new_v1, new_v2, new_v3, new_v4, new_v5, new_v6, new_v7, new_v8, new_v9;
+ float new_v10, new_v11, new_v12, new_v13, new_v14, new_v15, new_v16, new_v17, new_v18, new_v19;
+ float new_v20, new_v21, new_v22, new_v23, new_v24, new_v25, new_v26, new_v27, new_v28, new_v29;
+ float new_v30, new_v31;
+
+ new_v0 = new_v1 = new_v2 = new_v3 = new_v4 = new_v5 = new_v6 = new_v7 = new_v8 = new_v9 =
+ new_v10 = new_v11 = new_v12 = new_v13 = new_v14 = new_v15 = new_v16 = new_v17 = new_v18 = new_v19 =
+ new_v20 = new_v21 = new_v22 = new_v23 = new_v24 = new_v25 = new_v26 = new_v27 = new_v28 = new_v29 =
+ new_v30 = new_v31 = 0.0f;
+
+
+// float[] new_v = new float[32]; // new V[0-15] and V[33-48] of Figure 3-A.2 in ISO DIS 11172-3
+// float[] p = new float[16];
+// float[] pp = new float[16];
+
+ float[] s = samples;
+
+ float s0 = s[0];
+ float s1 = s[1];
+ float s2 = s[2];
+ float s3 = s[3];
+ float s4 = s[4];
+ float s5 = s[5];
+ float s6 = s[6];
+ float s7 = s[7];
+ float s8 = s[8];
+ float s9 = s[9];
+ float s10 = s[10];
+ float s11 = s[11];
+ float s12 = s[12];
+ float s13 = s[13];
+ float s14 = s[14];
+ float s15 = s[15];
+ float s16 = s[16];
+ float s17 = s[17];
+ float s18 = s[18];
+ float s19 = s[19];
+ float s20 = s[20];
+ float s21 = s[21];
+ float s22 = s[22];
+ float s23 = s[23];
+ float s24 = s[24];
+ float s25 = s[25];
+ float s26 = s[26];
+ float s27 = s[27];
+ float s28 = s[28];
+ float s29 = s[29];
+ float s30 = s[30];
+ float s31 = s[31];
+
+ float p0 = s0 + s31;
+ float p1 = s1 + s30;
+ float p2 = s2 + s29;
+ float p3 = s3 + s28;
+ float p4 = s4 + s27;
+ float p5 = s5 + s26;
+ float p6 = s6 + s25;
+ float p7 = s7 + s24;
+ float p8 = s8 + s23;
+ float p9 = s9 + s22;
+ float p10 = s10 + s21;
+ float p11 = s11 + s20;
+ float p12 = s12 + s19;
+ float p13 = s13 + s18;
+ float p14 = s14 + s17;
+ float p15 = s15 + s16;
+
+ float pp0 = p0 + p15;
+ float pp1 = p1 + p14;
+ float pp2 = p2 + p13;
+ float pp3 = p3 + p12;
+ float pp4 = p4 + p11;
+ float pp5 = p5 + p10;
+ float pp6 = p6 + p9;
+ float pp7 = p7 + p8;
+ float pp8 = (p0 - p15) * cos1_32;
+ float pp9 = (p1 - p14) * cos3_32;
+ float pp10 = (p2 - p13) * cos5_32;
+ float pp11 = (p3 - p12) * cos7_32;
+ float pp12 = (p4 - p11) * cos9_32;
+ float pp13 = (p5 - p10) * cos11_32;
+ float pp14 = (p6 - p9) * cos13_32;
+ float pp15 = (p7 - p8) * cos15_32;
+
+ p0 = pp0 + pp7;
+ p1 = pp1 + pp6;
+ p2 = pp2 + pp5;
+ p3 = pp3 + pp4;
+ p4 = (pp0 - pp7) * cos1_16;
+ p5 = (pp1 - pp6) * cos3_16;
+ p6 = (pp2 - pp5) * cos5_16;
+ p7 = (pp3 - pp4) * cos7_16;
+ p8 = pp8 + pp15;
+ p9 = pp9 + pp14;
+ p10 = pp10 + pp13;
+ p11 = pp11 + pp12;
+ p12 = (pp8 - pp15) * cos1_16;
+ p13 = (pp9 - pp14) * cos3_16;
+ p14 = (pp10 - pp13) * cos5_16;
+ p15 = (pp11 - pp12) * cos7_16;
+
+
+ pp0 = p0 + p3;
+ pp1 = p1 + p2;
+ pp2 = (p0 - p3) * cos1_8;
+ pp3 = (p1 - p2) * cos3_8;
+ pp4 = p4 + p7;
+ pp5 = p5 + p6;
+ pp6 = (p4 - p7) * cos1_8;
+ pp7 = (p5 - p6) * cos3_8;
+ pp8 = p8 + p11;
+ pp9 = p9 + p10;
+ pp10 = (p8 - p11) * cos1_8;
+ pp11 = (p9 - p10) * cos3_8;
+ pp12 = p12 + p15;
+ pp13 = p13 + p14;
+ pp14 = (p12 - p15) * cos1_8;
+ pp15 = (p13 - p14) * cos3_8;
+
+ p0 = pp0 + pp1;
+ p1 = (pp0 - pp1) * cos1_4;
+ p2 = pp2 + pp3;
+ p3 = (pp2 - pp3) * cos1_4;
+ p4 = pp4 + pp5;
+ p5 = (pp4 - pp5) * cos1_4;
+ p6 = pp6 + pp7;
+ p7 = (pp6 - pp7) * cos1_4;
+ p8 = pp8 + pp9;
+ p9 = (pp8 - pp9) * cos1_4;
+ p10 = pp10 + pp11;
+ p11 = (pp10 - pp11) * cos1_4;
+ p12 = pp12 + pp13;
+ p13 = (pp12 - pp13) * cos1_4;
+ p14 = pp14 + pp15;
+ p15 = (pp14 - pp15) * cos1_4;
+
+ // this is pretty insane coding
+ float tmp1;
+ new_v19/*36-17*/ = -(new_v4 = (new_v12 = p7) + p5) - p6;
+ new_v27/*44-17*/ = -p6 - p7 - p4;
+ new_v6 = (new_v10 = (new_v14 = p15) + p11) + p13;
+ new_v17/*34-17*/ = -(new_v2 = p15 + p13 + p9) - p14;
+ new_v21/*38-17*/ = (tmp1 = -p14 - p15 - p10 - p11) - p13;
+ new_v29/*46-17*/ = -p14 - p15 - p12 - p8;
+ new_v25/*42-17*/ = tmp1 - p12;
+ new_v31/*48-17*/ = -p0;
+ new_v0 = p1;
+ new_v23/*40-17*/ = -(new_v8 = p3) - p2;
+
+ p0 = (s0 - s31) * cos1_64;
+ p1 = (s1 - s30) * cos3_64;
+ p2 = (s2 - s29) * cos5_64;
+ p3 = (s3 - s28) * cos7_64;
+ p4 = (s4 - s27) * cos9_64;
+ p5 = (s5 - s26) * cos11_64;
+ p6 = (s6 - s25) * cos13_64;
+ p7 = (s7 - s24) * cos15_64;
+ p8 = (s8 - s23) * cos17_64;
+ p9 = (s9 - s22) * cos19_64;
+ p10 = (s10 - s21) * cos21_64;
+ p11 = (s11 - s20) * cos23_64;
+ p12 = (s12 - s19) * cos25_64;
+ p13 = (s13 - s18) * cos27_64;
+ p14 = (s14 - s17) * cos29_64;
+ p15 = (s15 - s16) * cos31_64;
+
+
+ pp0 = p0 + p15;
+ pp1 = p1 + p14;
+ pp2 = p2 + p13;
+ pp3 = p3 + p12;
+ pp4 = p4 + p11;
+ pp5 = p5 + p10;
+ pp6 = p6 + p9;
+ pp7 = p7 + p8;
+ pp8 = (p0 - p15) * cos1_32;
+ pp9 = (p1 - p14) * cos3_32;
+ pp10 = (p2 - p13) * cos5_32;
+ pp11 = (p3 - p12) * cos7_32;
+ pp12 = (p4 - p11) * cos9_32;
+ pp13 = (p5 - p10) * cos11_32;
+ pp14 = (p6 - p9) * cos13_32;
+ pp15 = (p7 - p8) * cos15_32;
+
+
+ p0 = pp0 + pp7;
+ p1 = pp1 + pp6;
+ p2 = pp2 + pp5;
+ p3 = pp3 + pp4;
+ p4 = (pp0 - pp7) * cos1_16;
+ p5 = (pp1 - pp6) * cos3_16;
+ p6 = (pp2 - pp5) * cos5_16;
+ p7 = (pp3 - pp4) * cos7_16;
+ p8 = pp8 + pp15;
+ p9 = pp9 + pp14;
+ p10 = pp10 + pp13;
+ p11 = pp11 + pp12;
+ p12 = (pp8 - pp15) * cos1_16;
+ p13 = (pp9 - pp14) * cos3_16;
+ p14 = (pp10 - pp13) * cos5_16;
+ p15 = (pp11 - pp12) * cos7_16;
+
+
+ pp0 = p0 + p3;
+ pp1 = p1 + p2;
+ pp2 = (p0 - p3) * cos1_8;
+ pp3 = (p1 - p2) * cos3_8;
+ pp4 = p4 + p7;
+ pp5 = p5 + p6;
+ pp6 = (p4 - p7) * cos1_8;
+ pp7 = (p5 - p6) * cos3_8;
+ pp8 = p8 + p11;
+ pp9 = p9 + p10;
+ pp10 = (p8 - p11) * cos1_8;
+ pp11 = (p9 - p10) * cos3_8;
+ pp12 = p12 + p15;
+ pp13 = p13 + p14;
+ pp14 = (p12 - p15) * cos1_8;
+ pp15 = (p13 - p14) * cos3_8;
+
+
+ p0 = pp0 + pp1;
+ p1 = (pp0 - pp1) * cos1_4;
+ p2 = pp2 + pp3;
+ p3 = (pp2 - pp3) * cos1_4;
+ p4 = pp4 + pp5;
+ p5 = (pp4 - pp5) * cos1_4;
+ p6 = pp6 + pp7;
+ p7 = (pp6 - pp7) * cos1_4;
+ p8 = pp8 + pp9;
+ p9 = (pp8 - pp9) * cos1_4;
+ p10 = pp10 + pp11;
+ p11 = (pp10 - pp11) * cos1_4;
+ p12 = pp12 + pp13;
+ p13 = (pp12 - pp13) * cos1_4;
+ p14 = pp14 + pp15;
+ p15 = (pp14 - pp15) * cos1_4;
+
+
+ // manually doing something that a compiler should handle sucks
+ // coding like this is hard to read
+ float tmp2;
+ new_v5 = (new_v11 = (new_v13 = (new_v15 = p15) + p7) + p11)
+ + p5 + p13;
+ new_v7 = (new_v9 = p15 + p11 + p3) + p13;
+ new_v16/*33-17*/ = -(new_v1 = (tmp1 = p13 + p15 + p9) + p1) - p14;
+ new_v18/*35-17*/ = -(new_v3 = tmp1 + p5 + p7) - p6 - p14;
+
+ new_v22/*39-17*/ = (tmp1 = -p10 - p11 - p14 - p15)
+ - p13 - p2 - p3;
+ new_v20/*37-17*/ = tmp1 - p13 - p5 - p6 - p7;
+ new_v24/*41-17*/ = tmp1 - p12 - p2 - p3;
+ new_v26/*43-17*/ = tmp1 - p12 - (tmp2 = p4 + p6 + p7);
+ new_v30/*47-17*/ = (tmp1 = -p8 - p12 - p14 - p15) - p0;
+ new_v28/*45-17*/ = tmp1 - tmp2;
+
+ // insert V[0-15] (== new_v[0-15]) into actual v:
+ // float[] x2 = actual_v + actual_write_pos;
+ float dest[] = actual_v;
+
+ int pos = actual_write_pos;
+
+ dest[0 + pos] = new_v0;
+ dest[16 + pos] = new_v1;
+ dest[32 + pos] = new_v2;
+ dest[48 + pos] = new_v3;
+ dest[64 + pos] = new_v4;
+ dest[80 + pos] = new_v5;
+ dest[96 + pos] = new_v6;
+ dest[112 + pos] = new_v7;
+ dest[128 + pos] = new_v8;
+ dest[144 + pos] = new_v9;
+ dest[160 + pos] = new_v10;
+ dest[176 + pos] = new_v11;
+ dest[192 + pos] = new_v12;
+ dest[208 + pos] = new_v13;
+ dest[224 + pos] = new_v14;
+ dest[240 + pos] = new_v15;
+
+ // V[16] is always 0.0:
+ dest[256 + pos] = 0.0f;
+
+ // insert V[17-31] (== -new_v[15-1]) into actual v:
+ dest[272 + pos] = -new_v15;
+ dest[288 + pos] = -new_v14;
+ dest[304 + pos] = -new_v13;
+ dest[320 + pos] = -new_v12;
+ dest[336 + pos] = -new_v11;
+ dest[352 + pos] = -new_v10;
+ dest[368 + pos] = -new_v9;
+ dest[384 + pos] = -new_v8;
+ dest[400 + pos] = -new_v7;
+ dest[416 + pos] = -new_v6;
+ dest[432 + pos] = -new_v5;
+ dest[448 + pos] = -new_v4;
+ dest[464 + pos] = -new_v3;
+ dest[480 + pos] = -new_v2;
+ dest[496 + pos] = -new_v1;
+
+ // insert V[32] (== -new_v[0]) into other v:
+ dest = (actual_v==v1) ? v2 : v1;
+
+ dest[0 + pos] = -new_v0;
+ // insert V[33-48] (== new_v[16-31]) into other v:
+ dest[16 + pos] = new_v16;
+ dest[32 + pos] = new_v17;
+ dest[48 + pos] = new_v18;
+ dest[64 + pos] = new_v19;
+ dest[80 + pos] = new_v20;
+ dest[96 + pos] = new_v21;
+ dest[112 + pos] = new_v22;
+ dest[128 + pos] = new_v23;
+ dest[144 + pos] = new_v24;
+ dest[160 + pos] = new_v25;
+ dest[176 + pos] = new_v26;
+ dest[192 + pos] = new_v27;
+ dest[208 + pos] = new_v28;
+ dest[224 + pos] = new_v29;
+ dest[240 + pos] = new_v30;
+ dest[256 + pos] = new_v31;
+
+ // insert V[49-63] (== new_v[30-16]) into other v:
+ dest[272 + pos] = new_v30;
+ dest[288 + pos] = new_v29;
+ dest[304 + pos] = new_v28;
+ dest[320 + pos] = new_v27;
+ dest[336 + pos] = new_v26;
+ dest[352 + pos] = new_v25;
+ dest[368 + pos] = new_v24;
+ dest[384 + pos] = new_v23;
+ dest[400 + pos] = new_v22;
+ dest[416 + pos] = new_v21;
+ dest[432 + pos] = new_v20;
+ dest[448 + pos] = new_v19;
+ dest[464 + pos] = new_v18;
+ dest[480 + pos] = new_v17;
+ dest[496 + pos] = new_v16;
+/*
+ }
+ else
+ {
+ v1[0 + actual_write_pos] = -new_v0;
+ // insert V[33-48] (== new_v[16-31]) into other v:
+ v1[16 + actual_write_pos] = new_v16;
+ v1[32 + actual_write_pos] = new_v17;
+ v1[48 + actual_write_pos] = new_v18;
+ v1[64 + actual_write_pos] = new_v19;
+ v1[80 + actual_write_pos] = new_v20;
+ v1[96 + actual_write_pos] = new_v21;
+ v1[112 + actual_write_pos] = new_v22;
+ v1[128 + actual_write_pos] = new_v23;
+ v1[144 + actual_write_pos] = new_v24;
+ v1[160 + actual_write_pos] = new_v25;
+ v1[176 + actual_write_pos] = new_v26;
+ v1[192 + actual_write_pos] = new_v27;
+ v1[208 + actual_write_pos] = new_v28;
+ v1[224 + actual_write_pos] = new_v29;
+ v1[240 + actual_write_pos] = new_v30;
+ v1[256 + actual_write_pos] = new_v31;
+
+ // insert V[49-63] (== new_v[30-16]) into other v:
+ v1[272 + actual_write_pos] = new_v30;
+ v1[288 + actual_write_pos] = new_v29;
+ v1[304 + actual_write_pos] = new_v28;
+ v1[320 + actual_write_pos] = new_v27;
+ v1[336 + actual_write_pos] = new_v26;
+ v1[352 + actual_write_pos] = new_v25;
+ v1[368 + actual_write_pos] = new_v24;
+ v1[384 + actual_write_pos] = new_v23;
+ v1[400 + actual_write_pos] = new_v22;
+ v1[416 + actual_write_pos] = new_v21;
+ v1[432 + actual_write_pos] = new_v20;
+ v1[448 + actual_write_pos] = new_v19;
+ v1[464 + actual_write_pos] = new_v18;
+ v1[480 + actual_write_pos] = new_v17;
+ v1[496 + actual_write_pos] = new_v16;
+ }
+*/
+ }
+
+ /**
+ * Compute new values via a fast cosine transform.
+ */
+ private void compute_new_v_old()
+ {
+ // p is fully initialized from x1
+ //float[] p = _p;
+ // pp is fully initialized from p
+ //float[] pp = _pp;
+
+ //float[] new_v = _new_v;
+
+ float[] new_v = new float[32]; // new V[0-15] and V[33-48] of Figure 3-A.2 in ISO DIS 11172-3
+ float[] p = new float[16];
+ float[] pp = new float[16];
+
+
+ for (int i=31; i>=0; i--)
+ {
+ new_v[i] = 0.0f;
+ }
+
+// float[] new_v = new float[32]; // new V[0-15] and V[33-48] of Figure 3-A.2 in ISO DIS 11172-3
+// float[] p = new float[16];
+// float[] pp = new float[16];
+
+ float[] x1 = samples;
+
+ p[0] = x1[0] + x1[31];
+ p[1] = x1[1] + x1[30];
+ p[2] = x1[2] + x1[29];
+ p[3] = x1[3] + x1[28];
+ p[4] = x1[4] + x1[27];
+ p[5] = x1[5] + x1[26];
+ p[6] = x1[6] + x1[25];
+ p[7] = x1[7] + x1[24];
+ p[8] = x1[8] + x1[23];
+ p[9] = x1[9] + x1[22];
+ p[10] = x1[10] + x1[21];
+ p[11] = x1[11] + x1[20];
+ p[12] = x1[12] + x1[19];
+ p[13] = x1[13] + x1[18];
+ p[14] = x1[14] + x1[17];
+ p[15] = x1[15] + x1[16];
+
+ pp[0] = p[0] + p[15];
+ pp[1] = p[1] + p[14];
+ pp[2] = p[2] + p[13];
+ pp[3] = p[3] + p[12];
+ pp[4] = p[4] + p[11];
+ pp[5] = p[5] + p[10];
+ pp[6] = p[6] + p[9];
+ pp[7] = p[7] + p[8];
+ pp[8] = (p[0] - p[15]) * cos1_32;
+ pp[9] = (p[1] - p[14]) * cos3_32;
+ pp[10] = (p[2] - p[13]) * cos5_32;
+ pp[11] = (p[3] - p[12]) * cos7_32;
+ pp[12] = (p[4] - p[11]) * cos9_32;
+ pp[13] = (p[5] - p[10]) * cos11_32;
+ pp[14] = (p[6] - p[9]) * cos13_32;
+ pp[15] = (p[7] - p[8]) * cos15_32;
+
+ p[0] = pp[0] + pp[7];
+ p[1] = pp[1] + pp[6];
+ p[2] = pp[2] + pp[5];
+ p[3] = pp[3] + pp[4];
+ p[4] = (pp[0] - pp[7]) * cos1_16;
+ p[5] = (pp[1] - pp[6]) * cos3_16;
+ p[6] = (pp[2] - pp[5]) * cos5_16;
+ p[7] = (pp[3] - pp[4]) * cos7_16;
+ p[8] = pp[8] + pp[15];
+ p[9] = pp[9] + pp[14];
+ p[10] = pp[10] + pp[13];
+ p[11] = pp[11] + pp[12];
+ p[12] = (pp[8] - pp[15]) * cos1_16;
+ p[13] = (pp[9] - pp[14]) * cos3_16;
+ p[14] = (pp[10] - pp[13]) * cos5_16;
+ p[15] = (pp[11] - pp[12]) * cos7_16;
+
+
+ pp[0] = p[0] + p[3];
+ pp[1] = p[1] + p[2];
+ pp[2] = (p[0] - p[3]) * cos1_8;
+ pp[3] = (p[1] - p[2]) * cos3_8;
+ pp[4] = p[4] + p[7];
+ pp[5] = p[5] + p[6];
+ pp[6] = (p[4] - p[7]) * cos1_8;
+ pp[7] = (p[5] - p[6]) * cos3_8;
+ pp[8] = p[8] + p[11];
+ pp[9] = p[9] + p[10];
+ pp[10] = (p[8] - p[11]) * cos1_8;
+ pp[11] = (p[9] - p[10]) * cos3_8;
+ pp[12] = p[12] + p[15];
+ pp[13] = p[13] + p[14];
+ pp[14] = (p[12] - p[15]) * cos1_8;
+ pp[15] = (p[13] - p[14]) * cos3_8;
+
+ p[0] = pp[0] + pp[1];
+ p[1] = (pp[0] - pp[1]) * cos1_4;
+ p[2] = pp[2] + pp[3];
+ p[3] = (pp[2] - pp[3]) * cos1_4;
+ p[4] = pp[4] + pp[5];
+ p[5] = (pp[4] - pp[5]) * cos1_4;
+ p[6] = pp[6] + pp[7];
+ p[7] = (pp[6] - pp[7]) * cos1_4;
+ p[8] = pp[8] + pp[9];
+ p[9] = (pp[8] - pp[9]) * cos1_4;
+ p[10] = pp[10] + pp[11];
+ p[11] = (pp[10] - pp[11]) * cos1_4;
+ p[12] = pp[12] + pp[13];
+ p[13] = (pp[12] - pp[13]) * cos1_4;
+ p[14] = pp[14] + pp[15];
+ p[15] = (pp[14] - pp[15]) * cos1_4;
+
+ // this is pretty insane coding
+ float tmp1;
+ new_v[36-17] = -(new_v[4] = (new_v[12] = p[7]) + p[5]) - p[6];
+ new_v[44-17] = -p[6] - p[7] - p[4];
+ new_v[6] = (new_v[10] = (new_v[14] = p[15]) + p[11]) + p[13];
+ new_v[34-17] = -(new_v[2] = p[15] + p[13] + p[9]) - p[14];
+ new_v[38-17] = (tmp1 = -p[14] - p[15] - p[10] - p[11]) - p[13];
+ new_v[46-17] = -p[14] - p[15] - p[12] - p[8];
+ new_v[42-17] = tmp1 - p[12];
+ new_v[48-17] = -p[0];
+ new_v[0] = p[1];
+ new_v[40-17] = -(new_v[8] = p[3]) - p[2];
+
+ p[0] = (x1[0] - x1[31]) * cos1_64;
+ p[1] = (x1[1] - x1[30]) * cos3_64;
+ p[2] = (x1[2] - x1[29]) * cos5_64;
+ p[3] = (x1[3] - x1[28]) * cos7_64;
+ p[4] = (x1[4] - x1[27]) * cos9_64;
+ p[5] = (x1[5] - x1[26]) * cos11_64;
+ p[6] = (x1[6] - x1[25]) * cos13_64;
+ p[7] = (x1[7] - x1[24]) * cos15_64;
+ p[8] = (x1[8] - x1[23]) * cos17_64;
+ p[9] = (x1[9] - x1[22]) * cos19_64;
+ p[10] = (x1[10] - x1[21]) * cos21_64;
+ p[11] = (x1[11] - x1[20]) * cos23_64;
+ p[12] = (x1[12] - x1[19]) * cos25_64;
+ p[13] = (x1[13] - x1[18]) * cos27_64;
+ p[14] = (x1[14] - x1[17]) * cos29_64;
+ p[15] = (x1[15] - x1[16]) * cos31_64;
+
+
+ pp[0] = p[0] + p[15];
+ pp[1] = p[1] + p[14];
+ pp[2] = p[2] + p[13];
+ pp[3] = p[3] + p[12];
+ pp[4] = p[4] + p[11];
+ pp[5] = p[5] + p[10];
+ pp[6] = p[6] + p[9];
+ pp[7] = p[7] + p[8];
+ pp[8] = (p[0] - p[15]) * cos1_32;
+ pp[9] = (p[1] - p[14]) * cos3_32;
+ pp[10] = (p[2] - p[13]) * cos5_32;
+ pp[11] = (p[3] - p[12]) * cos7_32;
+ pp[12] = (p[4] - p[11]) * cos9_32;
+ pp[13] = (p[5] - p[10]) * cos11_32;
+ pp[14] = (p[6] - p[9]) * cos13_32;
+ pp[15] = (p[7] - p[8]) * cos15_32;
+
+
+ p[0] = pp[0] + pp[7];
+ p[1] = pp[1] + pp[6];
+ p[2] = pp[2] + pp[5];
+ p[3] = pp[3] + pp[4];
+ p[4] = (pp[0] - pp[7]) * cos1_16;
+ p[5] = (pp[1] - pp[6]) * cos3_16;
+ p[6] = (pp[2] - pp[5]) * cos5_16;
+ p[7] = (pp[3] - pp[4]) * cos7_16;
+ p[8] = pp[8] + pp[15];
+ p[9] = pp[9] + pp[14];
+ p[10] = pp[10] + pp[13];
+ p[11] = pp[11] + pp[12];
+ p[12] = (pp[8] - pp[15]) * cos1_16;
+ p[13] = (pp[9] - pp[14]) * cos3_16;
+ p[14] = (pp[10] - pp[13]) * cos5_16;
+ p[15] = (pp[11] - pp[12]) * cos7_16;
+
+
+ pp[0] = p[0] + p[3];
+ pp[1] = p[1] + p[2];
+ pp[2] = (p[0] - p[3]) * cos1_8;
+ pp[3] = (p[1] - p[2]) * cos3_8;
+ pp[4] = p[4] + p[7];
+ pp[5] = p[5] + p[6];
+ pp[6] = (p[4] - p[7]) * cos1_8;
+ pp[7] = (p[5] - p[6]) * cos3_8;
+ pp[8] = p[8] + p[11];
+ pp[9] = p[9] + p[10];
+ pp[10] = (p[8] - p[11]) * cos1_8;
+ pp[11] = (p[9] - p[10]) * cos3_8;
+ pp[12] = p[12] + p[15];
+ pp[13] = p[13] + p[14];
+ pp[14] = (p[12] - p[15]) * cos1_8;
+ pp[15] = (p[13] - p[14]) * cos3_8;
+
+
+ p[0] = pp[0] + pp[1];
+ p[1] = (pp[0] - pp[1]) * cos1_4;
+ p[2] = pp[2] + pp[3];
+ p[3] = (pp[2] - pp[3]) * cos1_4;
+ p[4] = pp[4] + pp[5];
+ p[5] = (pp[4] - pp[5]) * cos1_4;
+ p[6] = pp[6] + pp[7];
+ p[7] = (pp[6] - pp[7]) * cos1_4;
+ p[8] = pp[8] + pp[9];
+ p[9] = (pp[8] - pp[9]) * cos1_4;
+ p[10] = pp[10] + pp[11];
+ p[11] = (pp[10] - pp[11]) * cos1_4;
+ p[12] = pp[12] + pp[13];
+ p[13] = (pp[12] - pp[13]) * cos1_4;
+ p[14] = pp[14] + pp[15];
+ p[15] = (pp[14] - pp[15]) * cos1_4;
+
+
+ // manually doing something that a compiler should handle sucks
+ // coding like this is hard to read
+ float tmp2;
+ new_v[5] = (new_v[11] = (new_v[13] = (new_v[15] = p[15]) + p[7]) + p[11])
+ + p[5] + p[13];
+ new_v[7] = (new_v[9] = p[15] + p[11] + p[3]) + p[13];
+ new_v[33-17] = -(new_v[1] = (tmp1 = p[13] + p[15] + p[9]) + p[1]) - p[14];
+ new_v[35-17] = -(new_v[3] = tmp1 + p[5] + p[7]) - p[6] - p[14];
+
+ new_v[39-17] = (tmp1 = -p[10] - p[11] - p[14] - p[15])
+ - p[13] - p[2] - p[3];
+ new_v[37-17] = tmp1 - p[13] - p[5] - p[6] - p[7];
+ new_v[41-17] = tmp1 - p[12] - p[2] - p[3];
+ new_v[43-17] = tmp1 - p[12] - (tmp2 = p[4] + p[6] + p[7]);
+ new_v[47-17] = (tmp1 = -p[8] - p[12] - p[14] - p[15]) - p[0];
+ new_v[45-17] = tmp1 - tmp2;
+
+ // insert V[0-15] (== new_v[0-15]) into actual v:
+ x1 = new_v;
+ // float[] x2 = actual_v + actual_write_pos;
+ float[] dest = actual_v;
+
+ dest[0 + actual_write_pos] = x1[0];
+ dest[16 + actual_write_pos] = x1[1];
+ dest[32 + actual_write_pos] = x1[2];
+ dest[48 + actual_write_pos] = x1[3];
+ dest[64 + actual_write_pos] = x1[4];
+ dest[80 + actual_write_pos] = x1[5];
+ dest[96 + actual_write_pos] = x1[6];
+ dest[112 + actual_write_pos] = x1[7];
+ dest[128 + actual_write_pos] = x1[8];
+ dest[144 + actual_write_pos] = x1[9];
+ dest[160 + actual_write_pos] = x1[10];
+ dest[176 + actual_write_pos] = x1[11];
+ dest[192 + actual_write_pos] = x1[12];
+ dest[208 + actual_write_pos] = x1[13];
+ dest[224 + actual_write_pos] = x1[14];
+ dest[240 + actual_write_pos] = x1[15];
+
+ // V[16] is always 0.0:
+ dest[256 + actual_write_pos] = 0.0f;
+
+ // insert V[17-31] (== -new_v[15-1]) into actual v:
+ dest[272 + actual_write_pos] = -x1[15];
+ dest[288 + actual_write_pos] = -x1[14];
+ dest[304 + actual_write_pos] = -x1[13];
+ dest[320 + actual_write_pos] = -x1[12];
+ dest[336 + actual_write_pos] = -x1[11];
+ dest[352 + actual_write_pos] = -x1[10];
+ dest[368 + actual_write_pos] = -x1[9];
+ dest[384 + actual_write_pos] = -x1[8];
+ dest[400 + actual_write_pos] = -x1[7];
+ dest[416 + actual_write_pos] = -x1[6];
+ dest[432 + actual_write_pos] = -x1[5];
+ dest[448 + actual_write_pos] = -x1[4];
+ dest[464 + actual_write_pos] = -x1[3];
+ dest[480 + actual_write_pos] = -x1[2];
+ dest[496 + actual_write_pos] = -x1[1];
+
+ // insert V[32] (== -new_v[0]) into other v:
+
+ }
+
+ /**
+ * Compute PCM Samples.
+ */
+
+ private float[] _tmpOut = new float[32];
+
+
+ private void compute_pcm_samples0(Obuffer buffer)
+ {
+ final float[] vp = actual_v;
+ //int inc = v_inc;
+ final float[] tmpOut = _tmpOut;
+ int dvp =0;
+
+ // fat chance of having this loop unroll
+ for( int i=0; i<32; i++)
+ {
+ float pcm_sample;
+ final float[] dp = d16[i];
+ pcm_sample = (float)(((vp[0 + dvp] * dp[0]) +
+ (vp[15 + dvp] * dp[1]) +
+ (vp[14 + dvp] * dp[2]) +
+ (vp[13 + dvp] * dp[3]) +
+ (vp[12 + dvp] * dp[4]) +
+ (vp[11 + dvp] * dp[5]) +
+ (vp[10 + dvp] * dp[6]) +
+ (vp[9 + dvp] * dp[7]) +
+ (vp[8 + dvp] * dp[8]) +
+ (vp[7 + dvp] * dp[9]) +
+ (vp[6 + dvp] * dp[10]) +
+ (vp[5 + dvp] * dp[11]) +
+ (vp[4 + dvp] * dp[12]) +
+ (vp[3 + dvp] * dp[13]) +
+ (vp[2 + dvp] * dp[14]) +
+ (vp[1 + dvp] * dp[15])
+ ) * scalefactor);
+
+ tmpOut[i] = pcm_sample;
+
+ dvp += 16;
+ } // for
+ }
+
+ private void compute_pcm_samples1(Obuffer buffer)
+ {
+ final float[] vp = actual_v;
+ //int inc = v_inc;
+ final float[] tmpOut = _tmpOut;
+ int dvp =0;
+
+ // fat chance of having this loop unroll
+ for( int i=0; i<32; i++)
+ {
+ final float[] dp = d16[i];
+ float pcm_sample;
+
+ pcm_sample = (float)(((vp[1 + dvp] * dp[0]) +
+ (vp[0 + dvp] * dp[1]) +
+ (vp[15 + dvp] * dp[2]) +
+ (vp[14 + dvp] * dp[3]) +
+ (vp[13 + dvp] * dp[4]) +
+ (vp[12 + dvp] * dp[5]) +
+ (vp[11 + dvp] * dp[6]) +
+ (vp[10 + dvp] * dp[7]) +
+ (vp[9 + dvp] * dp[8]) +
+ (vp[8 + dvp] * dp[9]) +
+ (vp[7 + dvp] * dp[10]) +
+ (vp[6 + dvp] * dp[11]) +
+ (vp[5 + dvp] * dp[12]) +
+ (vp[4 + dvp] * dp[13]) +
+ (vp[3 + dvp] * dp[14]) +
+ (vp[2 + dvp] * dp[15])
+ ) * scalefactor);
+
+ tmpOut[i] = pcm_sample;
+
+ dvp += 16;
+ } // for
+ }
+ private void compute_pcm_samples2(Obuffer buffer)
+ {
+ final float[] vp = actual_v;
+
+ //int inc = v_inc;
+ final float[] tmpOut = _tmpOut;
+ int dvp =0;
+
+ // fat chance of having this loop unroll
+ for( int i=0; i<32; i++)
+ {
+ final float[] dp = d16[i];
+ float pcm_sample;
+
+ pcm_sample = (float)(((vp[2 + dvp] * dp[0]) +
+ (vp[1 + dvp] * dp[1]) +
+ (vp[0 + dvp] * dp[2]) +
+ (vp[15 + dvp] * dp[3]) +
+ (vp[14 + dvp] * dp[4]) +
+ (vp[13 + dvp] * dp[5]) +
+ (vp[12 + dvp] * dp[6]) +
+ (vp[11 + dvp] * dp[7]) +
+ (vp[10 + dvp] * dp[8]) +
+ (vp[9 + dvp] * dp[9]) +
+ (vp[8 + dvp] * dp[10]) +
+ (vp[7 + dvp] * dp[11]) +
+ (vp[6 + dvp] * dp[12]) +
+ (vp[5 + dvp] * dp[13]) +
+ (vp[4 + dvp] * dp[14]) +
+ (vp[3 + dvp] * dp[15])
+ ) * scalefactor);
+
+ tmpOut[i] = pcm_sample;
+
+ dvp += 16;
+ } // for
+ }
+
+ private void compute_pcm_samples3(Obuffer buffer)
+ {
+ final float[] vp = actual_v;
+
+ int idx = 0;
+ //int inc = v_inc;
+ final float[] tmpOut = _tmpOut;
+ int dvp =0;
+
+ // fat chance of having this loop unroll
+ for( int i=0; i<32; i++)
+ {
+ final float[] dp = d16[i];
+ float pcm_sample;
+
+ pcm_sample = (float)(((vp[3 + dvp] * dp[0]) +
+ (vp[2 + dvp] * dp[1]) +
+ (vp[1 + dvp] * dp[2]) +
+ (vp[0 + dvp] * dp[3]) +
+ (vp[15 + dvp] * dp[4]) +
+ (vp[14 + dvp] * dp[5]) +
+ (vp[13 + dvp] * dp[6]) +
+ (vp[12 + dvp] * dp[7]) +
+ (vp[11 + dvp] * dp[8]) +
+ (vp[10 + dvp] * dp[9]) +
+ (vp[9 + dvp] * dp[10]) +
+ (vp[8 + dvp] * dp[11]) +
+ (vp[7 + dvp] * dp[12]) +
+ (vp[6 + dvp] * dp[13]) +
+ (vp[5 + dvp] * dp[14]) +
+ (vp[4 + dvp] * dp[15])
+ ) * scalefactor);
+
+ tmpOut[i] = pcm_sample;
+
+ dvp += 16;
+ } // for
+ }
+
+ private void compute_pcm_samples4(Obuffer buffer)
+ {
+ final float[] vp = actual_v;
+
+ //int inc = v_inc;
+ final float[] tmpOut = _tmpOut;
+ int dvp =0;
+
+ // fat chance of having this loop unroll
+ for( int i=0; i<32; i++)
+ {
+ final float[] dp = d16[i];
+ float pcm_sample;
+
+ pcm_sample = (float)(((vp[4 + dvp] * dp[0]) +
+ (vp[3 + dvp] * dp[1]) +
+ (vp[2 + dvp] * dp[2]) +
+ (vp[1 + dvp] * dp[3]) +
+ (vp[0 + dvp] * dp[4]) +
+ (vp[15 + dvp] * dp[5]) +
+ (vp[14 + dvp] * dp[6]) +
+ (vp[13 + dvp] * dp[7]) +
+ (vp[12 + dvp] * dp[8]) +
+ (vp[11 + dvp] * dp[9]) +
+ (vp[10 + dvp] * dp[10]) +
+ (vp[9 + dvp] * dp[11]) +
+ (vp[8 + dvp] * dp[12]) +
+ (vp[7 + dvp] * dp[13]) +
+ (vp[6 + dvp] * dp[14]) +
+ (vp[5 + dvp] * dp[15])
+ ) * scalefactor);
+
+ tmpOut[i] = pcm_sample;
+
+ dvp += 16;
+ } // for
+ }
+
+ private void compute_pcm_samples5(Obuffer buffer)
+ {
+ final float[] vp = actual_v;
+
+ //int inc = v_inc;
+ final float[] tmpOut = _tmpOut;
+ int dvp =0;
+
+ // fat chance of having this loop unroll
+ for( int i=0; i<32; i++)
+ {
+ final float[] dp = d16[i];
+ float pcm_sample;
+
+ pcm_sample = (float)(((vp[5 + dvp] * dp[0]) +
+ (vp[4 + dvp] * dp[1]) +
+ (vp[3 + dvp] * dp[2]) +
+ (vp[2 + dvp] * dp[3]) +
+ (vp[1 + dvp] * dp[4]) +
+ (vp[0 + dvp] * dp[5]) +
+ (vp[15 + dvp] * dp[6]) +
+ (vp[14 + dvp] * dp[7]) +
+ (vp[13 + dvp] * dp[8]) +
+ (vp[12 + dvp] * dp[9]) +
+ (vp[11 + dvp] * dp[10]) +
+ (vp[10 + dvp] * dp[11]) +
+ (vp[9 + dvp] * dp[12]) +
+ (vp[8 + dvp] * dp[13]) +
+ (vp[7 + dvp] * dp[14]) +
+ (vp[6 + dvp] * dp[15])
+ ) * scalefactor);
+
+ tmpOut[i] = pcm_sample;
+
+ dvp += 16;
+ } // for
+ }
+
+ private void compute_pcm_samples6(Obuffer buffer)
+ {
+ final float[] vp = actual_v;
+ //int inc = v_inc;
+ final float[] tmpOut = _tmpOut;
+ int dvp =0;
+
+ // fat chance of having this loop unroll
+ for( int i=0; i<32; i++)
+ {
+ final float[] dp = d16[i];
+ float pcm_sample;
+
+ pcm_sample = (float)(((vp[6 + dvp] * dp[0]) +
+ (vp[5 + dvp] * dp[1]) +
+ (vp[4 + dvp] * dp[2]) +
+ (vp[3 + dvp] * dp[3]) +
+ (vp[2 + dvp] * dp[4]) +
+ (vp[1 + dvp] * dp[5]) +
+ (vp[0 + dvp] * dp[6]) +
+ (vp[15 + dvp] * dp[7]) +
+ (vp[14 + dvp] * dp[8]) +
+ (vp[13 + dvp] * dp[9]) +
+ (vp[12 + dvp] * dp[10]) +
+ (vp[11 + dvp] * dp[11]) +
+ (vp[10 + dvp] * dp[12]) +
+ (vp[9 + dvp] * dp[13]) +
+ (vp[8 + dvp] * dp[14]) +
+ (vp[7 + dvp] * dp[15])
+ ) * scalefactor);
+
+ tmpOut[i] = pcm_sample;
+
+ dvp += 16;
+ } // for
+ }
+
+ private void compute_pcm_samples7(Obuffer buffer)
+ {
+ final float[] vp = actual_v;
+
+ //int inc = v_inc;
+ final float[] tmpOut = _tmpOut;
+ int dvp =0;
+
+ // fat chance of having this loop unroll
+ for( int i=0; i<32; i++)
+ {
+ final float[] dp = d16[i];
+ float pcm_sample;
+
+ pcm_sample = (float)(((vp[7 + dvp] * dp[0]) +
+ (vp[6 + dvp] * dp[1]) +
+ (vp[5 + dvp] * dp[2]) +
+ (vp[4 + dvp] * dp[3]) +
+ (vp[3 + dvp] * dp[4]) +
+ (vp[2 + dvp] * dp[5]) +
+ (vp[1 + dvp] * dp[6]) +
+ (vp[0 + dvp] * dp[7]) +
+ (vp[15 + dvp] * dp[8]) +
+ (vp[14 + dvp] * dp[9]) +
+ (vp[13 + dvp] * dp[10]) +
+ (vp[12 + dvp] * dp[11]) +
+ (vp[11 + dvp] * dp[12]) +
+ (vp[10 + dvp] * dp[13]) +
+ (vp[9 + dvp] * dp[14]) +
+ (vp[8 + dvp] * dp[15])
+ ) * scalefactor);
+
+ tmpOut[i] = pcm_sample;
+
+ dvp += 16;
+ } // for
+ }
+ private void compute_pcm_samples8(Obuffer buffer)
+ {
+ final float[] vp = actual_v;
+
+ //int inc = v_inc;
+ final float[] tmpOut = _tmpOut;
+ int dvp =0;
+
+ // fat chance of having this loop unroll
+ for( int i=0; i<32; i++)
+ {
+ final float[] dp = d16[i];
+ float pcm_sample;
+
+ pcm_sample = (float)(((vp[8 + dvp] * dp[0]) +
+ (vp[7 + dvp] * dp[1]) +
+ (vp[6 + dvp] * dp[2]) +
+ (vp[5 + dvp] * dp[3]) +
+ (vp[4 + dvp] * dp[4]) +
+ (vp[3 + dvp] * dp[5]) +
+ (vp[2 + dvp] * dp[6]) +
+ (vp[1 + dvp] * dp[7]) +
+ (vp[0 + dvp] * dp[8]) +
+ (vp[15 + dvp] * dp[9]) +
+ (vp[14 + dvp] * dp[10]) +
+ (vp[13 + dvp] * dp[11]) +
+ (vp[12 + dvp] * dp[12]) +
+ (vp[11 + dvp] * dp[13]) +
+ (vp[10 + dvp] * dp[14]) +
+ (vp[9 + dvp] * dp[15])
+ ) * scalefactor);
+
+ tmpOut[i] = pcm_sample;
+
+ dvp += 16;
+ } // for
+ }
+
+ private void compute_pcm_samples9(Obuffer buffer)
+ {
+ final float[] vp = actual_v;
+
+ //int inc = v_inc;
+ final float[] tmpOut = _tmpOut;
+ int dvp =0;
+
+ // fat chance of having this loop unroll
+ for( int i=0; i<32; i++)
+ {
+ final float[] dp = d16[i];
+ float pcm_sample;
+
+ pcm_sample = (float)(((vp[9 + dvp] * dp[0]) +
+ (vp[8 + dvp] * dp[1]) +
+ (vp[7 + dvp] * dp[2]) +
+ (vp[6 + dvp] * dp[3]) +
+ (vp[5 + dvp] * dp[4]) +
+ (vp[4 + dvp] * dp[5]) +
+ (vp[3 + dvp] * dp[6]) +
+ (vp[2 + dvp] * dp[7]) +
+ (vp[1 + dvp] * dp[8]) +
+ (vp[0 + dvp] * dp[9]) +
+ (vp[15 + dvp] * dp[10]) +
+ (vp[14 + dvp] * dp[11]) +
+ (vp[13 + dvp] * dp[12]) +
+ (vp[12 + dvp] * dp[13]) +
+ (vp[11 + dvp] * dp[14]) +
+ (vp[10 + dvp] * dp[15])
+ ) * scalefactor);
+
+ tmpOut[i] = pcm_sample;
+
+ dvp += 16;
+ } // for
+ }
+
+ private void compute_pcm_samples10(Obuffer buffer)
+ {
+ final float[] vp = actual_v;
+ //int inc = v_inc;
+ final float[] tmpOut = _tmpOut;
+ int dvp =0;
+
+ // fat chance of having this loop unroll
+ for( int i=0; i<32; i++)
+ {
+ final float[] dp = d16[i];
+ float pcm_sample;
+
+ pcm_sample = (float)(((vp[10 + dvp] * dp[0]) +
+ (vp[9 + dvp] * dp[1]) +
+ (vp[8 + dvp] * dp[2]) +
+ (vp[7 + dvp] * dp[3]) +
+ (vp[6 + dvp] * dp[4]) +
+ (vp[5 + dvp] * dp[5]) +
+ (vp[4 + dvp] * dp[6]) +
+ (vp[3 + dvp] * dp[7]) +
+ (vp[2 + dvp] * dp[8]) +
+ (vp[1 + dvp] * dp[9]) +
+ (vp[0 + dvp] * dp[10]) +
+ (vp[15 + dvp] * dp[11]) +
+ (vp[14 + dvp] * dp[12]) +
+ (vp[13 + dvp] * dp[13]) +
+ (vp[12 + dvp] * dp[14]) +
+ (vp[11 + dvp] * dp[15])
+ ) * scalefactor);
+
+ tmpOut[i] = pcm_sample;
+
+ dvp += 16;
+ } // for
+ }
+ private void compute_pcm_samples11(Obuffer buffer)
+ {
+ final float[] vp = actual_v;
+
+ //int inc = v_inc;
+ final float[] tmpOut = _tmpOut;
+ int dvp =0;
+
+ // fat chance of having this loop unroll
+ for( int i=0; i<32; i++)
+ {
+ final float[] dp = d16[i];
+ float pcm_sample;
+
+ pcm_sample = (float)(((vp[11 + dvp] * dp[0]) +
+ (vp[10 + dvp] * dp[1]) +
+ (vp[9 + dvp] * dp[2]) +
+ (vp[8 + dvp] * dp[3]) +
+ (vp[7 + dvp] * dp[4]) +
+ (vp[6 + dvp] * dp[5]) +
+ (vp[5 + dvp] * dp[6]) +
+ (vp[4 + dvp] * dp[7]) +
+ (vp[3 + dvp] * dp[8]) +
+ (vp[2 + dvp] * dp[9]) +
+ (vp[1 + dvp] * dp[10]) +
+ (vp[0 + dvp] * dp[11]) +
+ (vp[15 + dvp] * dp[12]) +
+ (vp[14 + dvp] * dp[13]) +
+ (vp[13 + dvp] * dp[14]) +
+ (vp[12 + dvp] * dp[15])
+ ) * scalefactor);
+
+ tmpOut[i] = pcm_sample;
+
+ dvp += 16;
+ } // for
+ }
+ private void compute_pcm_samples12(Obuffer buffer)
+ {
+ final float[] vp = actual_v;
+ //int inc = v_inc;
+ final float[] tmpOut = _tmpOut;
+ int dvp =0;
+
+ // fat chance of having this loop unroll
+ for( int i=0; i<32; i++)
+ {
+ final float[] dp = d16[i];
+ float pcm_sample;
+
+ pcm_sample = (float)(((vp[12 + dvp] * dp[0]) +
+ (vp[11 + dvp] * dp[1]) +
+ (vp[10 + dvp] * dp[2]) +
+ (vp[9 + dvp] * dp[3]) +
+ (vp[8 + dvp] * dp[4]) +
+ (vp[7 + dvp] * dp[5]) +
+ (vp[6 + dvp] * dp[6]) +
+ (vp[5 + dvp] * dp[7]) +
+ (vp[4 + dvp] * dp[8]) +
+ (vp[3 + dvp] * dp[9]) +
+ (vp[2 + dvp] * dp[10]) +
+ (vp[1 + dvp] * dp[11]) +
+ (vp[0 + dvp] * dp[12]) +
+ (vp[15 + dvp] * dp[13]) +
+ (vp[14 + dvp] * dp[14]) +
+ (vp[13 + dvp] * dp[15])
+ ) * scalefactor);
+
+ tmpOut[i] = pcm_sample;
+
+ dvp += 16;
+ } // for
+ }
+ private void compute_pcm_samples13(Obuffer buffer)
+ {
+ final float[] vp = actual_v;
+
+ //int inc = v_inc;
+ final float[] tmpOut = _tmpOut;
+ int dvp =0;
+
+ // fat chance of having this loop unroll
+ for( int i=0; i<32; i++)
+ {
+ final float[] dp = d16[i];
+ float pcm_sample;
+
+ pcm_sample = (float)(((vp[13 + dvp] * dp[0]) +
+ (vp[12 + dvp] * dp[1]) +
+ (vp[11 + dvp] * dp[2]) +
+ (vp[10 + dvp] * dp[3]) +
+ (vp[9 + dvp] * dp[4]) +
+ (vp[8 + dvp] * dp[5]) +
+ (vp[7 + dvp] * dp[6]) +
+ (vp[6 + dvp] * dp[7]) +
+ (vp[5 + dvp] * dp[8]) +
+ (vp[4 + dvp] * dp[9]) +
+ (vp[3 + dvp] * dp[10]) +
+ (vp[2 + dvp] * dp[11]) +
+ (vp[1 + dvp] * dp[12]) +
+ (vp[0 + dvp] * dp[13]) +
+ (vp[15 + dvp] * dp[14]) +
+ (vp[14 + dvp] * dp[15])
+ ) * scalefactor);
+
+ tmpOut[i] = pcm_sample;
+
+ dvp += 16;
+ } // for
+ }
+ private void compute_pcm_samples14(Obuffer buffer)
+ {
+ final float[] vp = actual_v;
+
+ //int inc = v_inc;
+ final float[] tmpOut = _tmpOut;
+ int dvp =0;
+
+ // fat chance of having this loop unroll
+ for( int i=0; i<32; i++)
+ {
+ final float[] dp = d16[i];
+ float pcm_sample;
+
+ pcm_sample = (float)(((vp[14 + dvp] * dp[0]) +
+ (vp[13 + dvp] * dp[1]) +
+ (vp[12 + dvp] * dp[2]) +
+ (vp[11 + dvp] * dp[3]) +
+ (vp[10 + dvp] * dp[4]) +
+ (vp[9 + dvp] * dp[5]) +
+ (vp[8 + dvp] * dp[6]) +
+ (vp[7 + dvp] * dp[7]) +
+ (vp[6 + dvp] * dp[8]) +
+ (vp[5 + dvp] * dp[9]) +
+ (vp[4 + dvp] * dp[10]) +
+ (vp[3 + dvp] * dp[11]) +
+ (vp[2 + dvp] * dp[12]) +
+ (vp[1 + dvp] * dp[13]) +
+ (vp[0 + dvp] * dp[14]) +
+ (vp[15 + dvp] * dp[15])
+ ) * scalefactor);
+
+ tmpOut[i] = pcm_sample;
+
+ dvp += 16;
+ } // for
+ }
+ private void compute_pcm_samples15(Obuffer buffer)
+ {
+ final float[] vp = actual_v;
+
+ //int inc = v_inc;
+ final float[] tmpOut = _tmpOut;
+ int dvp =0;
+
+ // fat chance of having this loop unroll
+ for( int i=0; i<32; i++)
+ {
+ float pcm_sample;
+ final float dp[] = d16[i];
+ pcm_sample = (float)(((vp[15 + dvp] * dp[0]) +
+ (vp[14 + dvp] * dp[1]) +
+ (vp[13 + dvp] * dp[2]) +
+ (vp[12 + dvp] * dp[3]) +
+ (vp[11 + dvp] * dp[4]) +
+ (vp[10 + dvp] * dp[5]) +
+ (vp[9 + dvp] * dp[6]) +
+ (vp[8 + dvp] * dp[7]) +
+ (vp[7 + dvp] * dp[8]) +
+ (vp[6 + dvp] * dp[9]) +
+ (vp[5 + dvp] * dp[10]) +
+ (vp[4 + dvp] * dp[11]) +
+ (vp[3 + dvp] * dp[12]) +
+ (vp[2 + dvp] * dp[13]) +
+ (vp[1 + dvp] * dp[14]) +
+ (vp[0 + dvp] * dp[15])
+ ) * scalefactor);
+
+ tmpOut[i] = pcm_sample;
+ dvp += 16;
+ } // for
+ }
+
+private void compute_pcm_samples(Obuffer buffer)
+{
+
+ switch (actual_write_pos)
+ {
+ case 0:
+ compute_pcm_samples0(buffer);
+ break;
+ case 1:
+ compute_pcm_samples1(buffer);
+ break;
+ case 2:
+ compute_pcm_samples2(buffer);
+ break;
+ case 3:
+ compute_pcm_samples3(buffer);
+ break;
+ case 4:
+ compute_pcm_samples4(buffer);
+ break;
+ case 5:
+ compute_pcm_samples5(buffer);
+ break;
+ case 6:
+ compute_pcm_samples6(buffer);
+ break;
+ case 7:
+ compute_pcm_samples7(buffer);
+ break;
+ case 8:
+ compute_pcm_samples8(buffer);
+ break;
+ case 9:
+ compute_pcm_samples9(buffer);
+ break;
+ case 10:
+ compute_pcm_samples10(buffer);
+ break;
+ case 11:
+ compute_pcm_samples11(buffer);
+ break;
+ case 12:
+ compute_pcm_samples12(buffer);
+ break;
+ case 13:
+ compute_pcm_samples13(buffer);
+ break;
+ case 14:
+ compute_pcm_samples14(buffer);
+ break;
+ case 15:
+ compute_pcm_samples15(buffer);
+ break;
+ }
+
+ if (buffer!=null)
+ {
+ buffer.appendSamples(channel, _tmpOut);
+ }
+
+/*
+ // MDM: I was considering putting in quality control for
+ // low-spec CPUs, but the performance gain (about 10-15%)
+ // did not justify the considerable drop in audio quality.
+ switch (inc)
+ {
+ case 16:
+ buffer.appendSamples(channel, tmpOut);
+ break;
+ case 32:
+ for (int i=0; i<16; i++)
+ {
+ buffer.append(channel, (short)tmpOut[i]);
+ buffer.append(channel, (short)tmpOut[i]);
+ }
+ break;
+ case 64:
+ for (int i=0; i<8; i++)
+ {
+ buffer.append(channel, (short)tmpOut[i]);
+ buffer.append(channel, (short)tmpOut[i]);
+ buffer.append(channel, (short)tmpOut[i]);
+ buffer.append(channel, (short)tmpOut[i]);
+ }
+ break;
+
+ }
+*/
+ }
+
+ /**
+ * Calculate 32 PCM samples and put the into the Obuffer-object.
+ */
+
+ public void calculate_pcm_samples(Obuffer buffer)
+ {
+ compute_new_v();
+ compute_pcm_samples(buffer);
+
+ actual_write_pos = (actual_write_pos + 1) & 0xf;
+ actual_v = (actual_v == v1) ? v2 : v1;
+
+ // initialize samples[]:
+ //for (register float *floatp = samples + 32; floatp > samples; )
+ // *--floatp = 0.0f;
+
+ // MDM: this may not be necessary. The Layer III decoder always
+ // outputs 32 subband samples, but I haven't checked layer I & II.
+ for (int p=0;p<32;p++)
+ samples[p] = 0.0f;
+ }
+
+
+ private static final double MY_PI = 3.14159265358979323846;
+ private static final float cos1_64 =(float) (1.0 / (2.0 * Math.cos(MY_PI / 64.0)));
+ private static final float cos3_64 =(float) (1.0 / (2.0 * Math.cos(MY_PI * 3.0 / 64.0)));
+ private static final float cos5_64 =(float) (1.0 / (2.0 * Math.cos(MY_PI * 5.0 / 64.0)));
+ private static final float cos7_64 =(float) (1.0 / (2.0 * Math.cos(MY_PI * 7.0 / 64.0)));
+ private static final float cos9_64 =(float) (1.0 / (2.0 * Math.cos(MY_PI * 9.0 / 64.0)));
+ private static final float cos11_64 =(float) (1.0 / (2.0 * Math.cos(MY_PI * 11.0 / 64.0)));
+ private static final float cos13_64 =(float) (1.0 / (2.0 * Math.cos(MY_PI * 13.0 / 64.0)));
+ private static final float cos15_64 =(float) (1.0 / (2.0 * Math.cos(MY_PI * 15.0 / 64.0)));
+ private static final float cos17_64 =(float) (1.0 / (2.0 * Math.cos(MY_PI * 17.0 / 64.0)));
+ private static final float cos19_64 =(float) (1.0 / (2.0 * Math.cos(MY_PI * 19.0 / 64.0)));
+ private static final float cos21_64 =(float) (1.0 / (2.0 * Math.cos(MY_PI * 21.0 / 64.0)));
+ private static final float cos23_64 =(float) (1.0 / (2.0 * Math.cos(MY_PI * 23.0 / 64.0)));
+ private static final float cos25_64 =(float) (1.0 / (2.0 * Math.cos(MY_PI * 25.0 / 64.0)));
+ private static final float cos27_64 =(float) (1.0 / (2.0 * Math.cos(MY_PI * 27.0 / 64.0)));
+ private static final float cos29_64 =(float) (1.0 / (2.0 * Math.cos(MY_PI * 29.0 / 64.0)));
+ private static final float cos31_64 =(float) (1.0 / (2.0 * Math.cos(MY_PI * 31.0 / 64.0)));
+ private static final float cos1_32 =(float) (1.0 / (2.0 * Math.cos(MY_PI / 32.0)));
+ private static final float cos3_32 =(float) (1.0 / (2.0 * Math.cos(MY_PI * 3.0 / 32.0)));
+ private static final float cos5_32 =(float) (1.0 / (2.0 * Math.cos(MY_PI * 5.0 / 32.0)));
+ private static final float cos7_32 =(float) (1.0 / (2.0 * Math.cos(MY_PI * 7.0 / 32.0)));
+ private static final float cos9_32 =(float) (1.0 / (2.0 * Math.cos(MY_PI * 9.0 / 32.0)));
+ private static final float cos11_32 =(float) (1.0 / (2.0 * Math.cos(MY_PI * 11.0 / 32.0)));
+ private static final float cos13_32 =(float) (1.0 / (2.0 * Math.cos(MY_PI * 13.0 / 32.0)));
+ private static final float cos15_32 =(float) (1.0 / (2.0 * Math.cos(MY_PI * 15.0 / 32.0)));
+ private static final float cos1_16 =(float) (1.0 / (2.0 * Math.cos(MY_PI / 16.0)));
+ private static final float cos3_16 =(float) (1.0 / (2.0 * Math.cos(MY_PI * 3.0 / 16.0)));
+ private static final float cos5_16 =(float) (1.0 / (2.0 * Math.cos(MY_PI * 5.0 / 16.0)));
+ private static final float cos7_16 =(float) (1.0 / (2.0 * Math.cos(MY_PI * 7.0 / 16.0)));
+ private static final float cos1_8 =(float) (1.0 / (2.0 * Math.cos(MY_PI / 8.0)));
+ private static final float cos3_8 =(float) (1.0 / (2.0 * Math.cos(MY_PI * 3.0 / 8.0)));
+ private static final float cos1_4 =(float) (1.0 / (2.0 * Math.cos(MY_PI / 4.0)));
+
+ // Note: These values are not in the same order
+ // as in Annex 3-B.3 of the ISO/IEC DIS 11172-3
+ // private float d[] = {0.000000000, -4.000442505};
+
+ private static float d[] = null;
+
+ /**
+ * d[] split into subarrays of length 16. This provides for
+ * more faster access by allowing a block of 16 to be addressed
+ * with constant offset.
+ **/
+ private static float d16[][] = null;
+
+ /**
+ * Loads the data for the d[] from the resource SFd.ser.
+ * @return the loaded values for d[].
+ */
+ static private float[] load_d()
+ {
+ try
+ {
+ Class elemType = Float.TYPE;
+ Object o = JavaLayerUtils.deserializeArrayResource("sfd.ser", elemType, 512);
+ return (float[])o;
+ }
+ catch (IOException ex)
+ {
+ throw new ExceptionInInitializerError(ex);
+ }
+ }
+
+ /**
+ * Converts a 1D array into a number of smaller arrays. This is used
+ * to achieve offset + constant indexing into an array. Each sub-array
+ * represents a block of values of the original array.
+ * @param array The array to split up into blocks.
+ * @param blockSize The size of the blocks to split the array
+ * into. This must be an exact divisor of
+ * the length of the array, or some data
+ * will be lost from the main array.
+ *
+ * @return An array of arrays in which each element in the returned
+ * array will be of length <code>blockSize</code>.
+ */
+ static private float[][] splitArray(final float[] array, final int blockSize)
+ {
+ int size = array.length / blockSize;
+ float[][] split = new float[size][];
+ for (int i=0; i<size; i++)
+ {
+ split[i] = subArray(array, i*blockSize, blockSize);
+ }
+ return split;
+ }
+
+ /**
+ * Returns a subarray of an existing array.
+ *
+ * @param array The array to retrieve a subarra from.
+ * @param offs The offset in the array that corresponds to
+ * the first index of the subarray.
+ * @param len The number of indeces in the subarray.
+ * @return The subarray, which may be of length 0.
+ */
+ static private float[] subArray(final float[] array, final int offs, int len)
+ {
+ if (offs+len > array.length)
+ {
+ len = array.length-offs;
+ }
+
+ if (len < 0)
+ len = 0;
+
+ float[] subarray = new float[len];
+ for (int i=0; i<len; i++)
+ {
+ subarray[i] = array[offs+i];
+ }
+
+ return subarray;
+ }
+
+ // The original data for d[]. This data is loaded from a file
+ // to reduce the overall package size and to improve performance.
+/*
+ static final float d_data[] = {
+ 0.000000000f, -0.000442505f, 0.003250122f, -0.007003784f,
+ 0.031082153f, -0.078628540f, 0.100311279f, -0.572036743f,
+ 1.144989014f, 0.572036743f, 0.100311279f, 0.078628540f,
+ 0.031082153f, 0.007003784f, 0.003250122f, 0.000442505f,
+ -0.000015259f, -0.000473022f, 0.003326416f, -0.007919312f,
+ 0.030517578f, -0.084182739f, 0.090927124f, -0.600219727f,
+ 1.144287109f, 0.543823242f, 0.108856201f, 0.073059082f,
+ 0.031478882f, 0.006118774f, 0.003173828f, 0.000396729f,
+ -0.000015259f, -0.000534058f, 0.003387451f, -0.008865356f,
+ 0.029785156f, -0.089706421f, 0.080688477f, -0.628295898f,
+ 1.142211914f, 0.515609741f, 0.116577148f, 0.067520142f,
+ 0.031738281f, 0.005294800f, 0.003082275f, 0.000366211f,
+ -0.000015259f, -0.000579834f, 0.003433228f, -0.009841919f,
+ 0.028884888f, -0.095169067f, 0.069595337f, -0.656219482f,
+ 1.138763428f, 0.487472534f, 0.123474121f, 0.061996460f,
+ 0.031845093f, 0.004486084f, 0.002990723f, 0.000320435f,
+ -0.000015259f, -0.000625610f, 0.003463745f, -0.010848999f,
+ 0.027801514f, -0.100540161f, 0.057617188f, -0.683914185f,
+ 1.133926392f, 0.459472656f, 0.129577637f, 0.056533813f,
+ 0.031814575f, 0.003723145f, 0.002899170f, 0.000289917f,
+ -0.000015259f, -0.000686646f, 0.003479004f, -0.011886597f,
+ 0.026535034f, -0.105819702f, 0.044784546f, -0.711318970f,
+ 1.127746582f, 0.431655884f, 0.134887695f, 0.051132202f,
+ 0.031661987f, 0.003005981f, 0.002792358f, 0.000259399f,
+ -0.000015259f, -0.000747681f, 0.003479004f, -0.012939453f,
+ 0.025085449f, -0.110946655f, 0.031082153f, -0.738372803f,
+ 1.120223999f, 0.404083252f, 0.139450073f, 0.045837402f,
+ 0.031387329f, 0.002334595f, 0.002685547f, 0.000244141f,
+ -0.000030518f, -0.000808716f, 0.003463745f, -0.014022827f,
+ 0.023422241f, -0.115921021f, 0.016510010f, -0.765029907f,
+ 1.111373901f, 0.376800537f, 0.143264771f, 0.040634155f,
+ 0.031005859f, 0.001693726f, 0.002578735f, 0.000213623f,
+ -0.000030518f, -0.000885010f, 0.003417969f, -0.015121460f,
+ 0.021575928f, -0.120697021f, 0.001068115f, -0.791213989f,
+ 1.101211548f, 0.349868774f, 0.146362305f, 0.035552979f,
+ 0.030532837f, 0.001098633f, 0.002456665f, 0.000198364f,
+ -0.000030518f, -0.000961304f, 0.003372192f, -0.016235352f,
+ 0.019531250f, -0.125259399f, -0.015228271f, -0.816864014f,
+ 1.089782715f, 0.323318481f, 0.148773193f, 0.030609131f,
+ 0.029937744f, 0.000549316f, 0.002349854f, 0.000167847f,
+ -0.000030518f, -0.001037598f, 0.003280640f, -0.017349243f,
+ 0.017257690f, -0.129562378f, -0.032379150f, -0.841949463f,
+ 1.077117920f, 0.297210693f, 0.150497437f, 0.025817871f,
+ 0.029281616f, 0.000030518f, 0.002243042f, 0.000152588f,
+ -0.000045776f, -0.001113892f, 0.003173828f, -0.018463135f,
+ 0.014801025f, -0.133590698f, -0.050354004f, -0.866363525f,
+ 1.063217163f, 0.271591187f, 0.151596069f, 0.021179199f,
+ 0.028533936f, -0.000442505f, 0.002120972f, 0.000137329f,
+ -0.000045776f, -0.001205444f, 0.003051758f, -0.019577026f,
+ 0.012115479f, -0.137298584f, -0.069168091f, -0.890090942f,
+ 1.048156738f, 0.246505737f, 0.152069092f, 0.016708374f,
+ 0.027725220f, -0.000869751f, 0.002014160f, 0.000122070f,
+ -0.000061035f, -0.001296997f, 0.002883911f, -0.020690918f,
+ 0.009231567f, -0.140670776f, -0.088775635f, -0.913055420f,
+ 1.031936646f, 0.221984863f, 0.151962280f, 0.012420654f,
+ 0.026840210f, -0.001266479f, 0.001907349f, 0.000106812f,
+ -0.000061035f, -0.001388550f, 0.002700806f, -0.021789551f,
+ 0.006134033f, -0.143676758f, -0.109161377f, -0.935195923f,
+ 1.014617920f, 0.198059082f, 0.151306152f, 0.008316040f,
+ 0.025909424f, -0.001617432f, 0.001785278f, 0.000106812f,
+ -0.000076294f, -0.001480103f, 0.002487183f, -0.022857666f,
+ 0.002822876f, -0.146255493f, -0.130310059f, -0.956481934f,
+ 0.996246338f, 0.174789429f, 0.150115967f, 0.004394531f,
+ 0.024932861f, -0.001937866f, 0.001693726f, 0.000091553f,
+ -0.000076294f, -0.001586914f, 0.002227783f, -0.023910522f,
+ -0.000686646f, -0.148422241f, -0.152206421f, -0.976852417f,
+ 0.976852417f, 0.152206421f, 0.148422241f, 0.000686646f,
+ 0.023910522f, -0.002227783f, 0.001586914f, 0.000076294f,
+ -0.000091553f, -0.001693726f, 0.001937866f, -0.024932861f,
+ -0.004394531f, -0.150115967f, -0.174789429f, -0.996246338f,
+ 0.956481934f, 0.130310059f, 0.146255493f, -0.002822876f,
+ 0.022857666f, -0.002487183f, 0.001480103f, 0.000076294f,
+ -0.000106812f, -0.001785278f, 0.001617432f, -0.025909424f,
+ -0.008316040f, -0.151306152f, -0.198059082f, -1.014617920f,
+ 0.935195923f, 0.109161377f, 0.143676758f, -0.006134033f,
+ 0.021789551f, -0.002700806f, 0.001388550f, 0.000061035f,
+ -0.000106812f, -0.001907349f, 0.001266479f, -0.026840210f,
+ -0.012420654f, -0.151962280f, -0.221984863f, -1.031936646f,
+ 0.913055420f, 0.088775635f, 0.140670776f, -0.009231567f,
+ 0.020690918f, -0.002883911f, 0.001296997f, 0.000061035f,
+ -0.000122070f, -0.002014160f, 0.000869751f, -0.027725220f,
+ -0.016708374f, -0.152069092f, -0.246505737f, -1.048156738f,
+ 0.890090942f, 0.069168091f, 0.137298584f, -0.012115479f,
+ 0.019577026f, -0.003051758f, 0.001205444f, 0.000045776f,
+ -0.000137329f, -0.002120972f, 0.000442505f, -0.028533936f,
+ -0.021179199f, -0.151596069f, -0.271591187f, -1.063217163f,
+ 0.866363525f, 0.050354004f, 0.133590698f, -0.014801025f,
+ 0.018463135f, -0.003173828f, 0.001113892f, 0.000045776f,
+ -0.000152588f, -0.002243042f, -0.000030518f, -0.029281616f,
+ -0.025817871f, -0.150497437f, -0.297210693f, -1.077117920f,
+ 0.841949463f, 0.032379150f, 0.129562378f, -0.017257690f,
+ 0.017349243f, -0.003280640f, 0.001037598f, 0.000030518f,
+ -0.000167847f, -0.002349854f, -0.000549316f, -0.029937744f,
+ -0.030609131f, -0.148773193f, -0.323318481f, -1.089782715f,
+ 0.816864014f, 0.015228271f, 0.125259399f, -0.019531250f,
+ 0.016235352f, -0.003372192f, 0.000961304f, 0.000030518f,
+ -0.000198364f, -0.002456665f, -0.001098633f, -0.030532837f,
+ -0.035552979f, -0.146362305f, -0.349868774f, -1.101211548f,
+ 0.791213989f, -0.001068115f, 0.120697021f, -0.021575928f,
+ 0.015121460f, -0.003417969f, 0.000885010f, 0.000030518f,
+ -0.000213623f, -0.002578735f, -0.001693726f, -0.031005859f,
+ -0.040634155f, -0.143264771f, -0.376800537f, -1.111373901f,
+ 0.765029907f, -0.016510010f, 0.115921021f, -0.023422241f,
+ 0.014022827f, -0.003463745f, 0.000808716f, 0.000030518f,
+ -0.000244141f, -0.002685547f, -0.002334595f, -0.031387329f,
+ -0.045837402f, -0.139450073f, -0.404083252f, -1.120223999f,
+ 0.738372803f, -0.031082153f, 0.110946655f, -0.025085449f,
+ 0.012939453f, -0.003479004f, 0.000747681f, 0.000015259f,
+ -0.000259399f, -0.002792358f, -0.003005981f, -0.031661987f,
+ -0.051132202f, -0.134887695f, -0.431655884f, -1.127746582f,
+ 0.711318970f, -0.044784546f, 0.105819702f, -0.026535034f,
+ 0.011886597f, -0.003479004f, 0.000686646f, 0.000015259f,
+ -0.000289917f, -0.002899170f, -0.003723145f, -0.031814575f,
+ -0.056533813f, -0.129577637f, -0.459472656f, -1.133926392f,
+ 0.683914185f, -0.057617188f, 0.100540161f, -0.027801514f,
+ 0.010848999f, -0.003463745f, 0.000625610f, 0.000015259f,
+ -0.000320435f, -0.002990723f, -0.004486084f, -0.031845093f,
+ -0.061996460f, -0.123474121f, -0.487472534f, -1.138763428f,
+ 0.656219482f, -0.069595337f, 0.095169067f, -0.028884888f,
+ 0.009841919f, -0.003433228f, 0.000579834f, 0.000015259f,
+ -0.000366211f, -0.003082275f, -0.005294800f, -0.031738281f,
+ -0.067520142f, -0.116577148f, -0.515609741f, -1.142211914f,
+ 0.628295898f, -0.080688477f, 0.089706421f, -0.029785156f,
+ 0.008865356f, -0.003387451f, 0.000534058f, 0.000015259f,
+ -0.000396729f, -0.003173828f, -0.006118774f, -0.031478882f,
+ -0.073059082f, -0.108856201f, -0.543823242f, -1.144287109f,
+ 0.600219727f, -0.090927124f, 0.084182739f, -0.030517578f,
+ 0.007919312f, -0.003326416f, 0.000473022f, 0.000015259f
+ };
+ */
+
+}
diff --git a/Robust/src/Tests/ssJava/mp3decoder/huffcodetab.java b/Robust/src/Tests/ssJava/mp3decoder/huffcodetab.java
new file mode 100644
index 00000000..64c98816
--- /dev/null
+++ b/Robust/src/Tests/ssJava/mp3decoder/huffcodetab.java
@@ -0,0 +1,600 @@
+/*
+ * 11/19/04 1.0 moved to LGPL.
+ * 16/11/99 Renamed class, added javadoc, and changed table
+ * name from String to 3 chars. mdm@techie.com
+ * 02/15/99 Java Conversion by E.B, javalayer@javazoom.net
+ *
+ * 04/19/97 : Adapted from the ISO MPEG Audio Subgroup Software Simulation
+ * Group's public c source for its MPEG audio decoder. Miscellaneous
+ * changes by Jeff Tsay (ctsay@pasteur.eecs.berkeley.edu).
+ *-----------------------------------------------------------------------
+ * Copyright (c) 1991 MPEG/audio software simulation group, All Rights Reserved
+ * MPEG/audio coding/decoding software, work in progress
+ * NOT for public distribution until verified and approved by the
+ * MPEG/audio committee. For further information, please contact
+ * Davis Pan, 508-493-2241, e-mail: pan@3d.enet.dec.com
+ *
+ * VERSION 4.1
+ * changes made since last update:
+ * date programmers comment
+ * 27.2.92 F.O.Witte (ITT Intermetall)
+ * 8/24/93 M. Iwadare Changed for 1 pass decoding.
+ * 7/14/94 J. Koller useless 'typedef' before huffcodetab removed
+ *-----------------------------------------------------------------------
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Library 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 Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *----------------------------------------------------------------------
+ */
+
+package javazoom.jl.decoder;
+
+/**
+ * Class to implements Huffman decoder.
+ */
+final class huffcodetab
+{
+ private static final int MXOFF=250;
+ private static final int HTN=34;
+
+ private char tablename0 = ' '; /* string, containing table_description */
+ private char tablename1 = ' '; /* string, containing table_description */
+ private char tablename2 = ' '; /* string, containing table_description */
+
+ private int xlen; /* max. x-index+ */
+ private int ylen; /* max. y-index+ */
+ private int linbits; /* number of linbits */
+ private int linmax; /* max number to be stored in linbits */
+ private int ref; /* a positive value indicates a reference */
+ private int[] table=null; /* pointer to array[xlen][ylen] */
+ private int[] hlen=null; /* pointer to array[xlen][ylen] */
+ private int[][] val=null; /* decoder tree */
+ private int treelen; /* length of decoder tree */
+
+ private static int ValTab0[][] = {
+ {0,0} // dummy
+ };
+
+ private static int ValTab1[][] = {
+ {2,1},{0,0},{2,1},{0,16},{2,1},{0,1},{0,17},
+ };
+
+ private static int ValTab2[][] = {
+ {2,1},{0,0},{4,1},{2,1},{0,16},{0,1},{2,1},{0,17},{4,1},{2,1},
+ {0,32},{0,33},{2,1},{0,18},{2,1},{0,2},{0,34},
+ };
+
+ private static int ValTab3[][] = {
+ {4,1},{2,1},{0,0},{0,1},{2,1},{0,17},{2,1},{0,16},{4,1},{2,1},
+ {0,32},{0,33},{2,1},{0,18},{2,1},{0,2},{0,34},
+ };
+
+ private static int ValTab4[][] = {{0,0}}; // dummy
+
+ private static int ValTab5[][] = {
+ {2,1},{0,0},{4,1},{2,1},{0,16},{0,1},{2,1},{0,17},{8,1},{4,1},
+ {2,1},{0,32},{0,2},{2,1},{0,33},{0,18},{8,1},{4,1},{2,1},{0,34},
+ {0,48},{2,1},{0,3},{0,19},{2,1},{0,49},{2,1},{0,50},{2,1},{0,35},
+ {0,51},
+ };
+
+ private static int ValTab6[][] = {
+ {6,1},{4,1},{2,1},{0,0},{0,16},{0,17},{6,1},{2,1},{0,1},{2,1},
+ {0,32},{0,33},{6,1},{2,1},{0,18},{2,1},{0,2},{0,34},{4,1},{2,1},
+ {0,49},{0,19},{4,1},{2,1},{0,48},{0,50},{2,1},{0,35},{2,1},{0,3},
+ {0,51},
+ };
+
+ private static int ValTab7[][] = {
+ {2,1},{0,0},{4,1},{2,1},{0,16},{0,1},{8,1},{2,1},{0,17},{4,1},
+ {2,1},{0,32},{0,2},{0,33},{18,1},{6,1},{2,1},{0,18},{2,1},{0,34},
+ {0,48},{4,1},{2,1},{0,49},{0,19},{4,1},{2,1},{0,3},{0,50},{2,1},
+ {0,35},{0,4},{10,1},{4,1},{2,1},{0,64},{0,65},{2,1},{0,20},{2,1},
+ {0,66},{0,36},{12,1},{6,1},{4,1},{2,1},{0,51},{0,67},{0,80},{4,1},
+ {2,1},{0,52},{0,5},{0,81},{6,1},{2,1},{0,21},{2,1},{0,82},{0,37},
+ {4,1},{2,1},{0,68},{0,53},{4,1},{2,1},{0,83},{0,84},{2,1},{0,69},
+ {0,85},
+ };
+
+ private static int ValTab8[][] = {
+ {6,1},{2,1},{0,0},{2,1},{0,16},{0,1},{2,1},{0,17},{4,1},{2,1},
+ {0,33},{0,18},{14,1},{4,1},{2,1},{0,32},{0,2},{2,1},{0,34},{4,1},
+ {2,1},{0,48},{0,3},{2,1},{0,49},{0,19},{14,1},{8,1},{4,1},{2,1},
+ {0,50},{0,35},{2,1},{0,64},{0,4},{2,1},{0,65},{2,1},{0,20},{0,66},
+ {12,1},{6,1},{2,1},{0,36},{2,1},{0,51},{0,80},{4,1},{2,1},{0,67},
+ {0,52},{0,81},{6,1},{2,1},{0,21},{2,1},{0,5},{0,82},{6,1},{2,1},
+ {0,37},{2,1},{0,68},{0,53},{2,1},{0,83},{2,1},{0,69},{2,1},{0,84},
+ {0,85},
+ };
+
+ private static int ValTab9[][] = {
+ {8,1},{4,1},{2,1},{0,0},{0,16},{2,1},{0,1},{0,17},{10,1},{4,1},
+ {2,1},{0,32},{0,33},{2,1},{0,18},{2,1},{0,2},{0,34},{12,1},{6,1},
+ {4,1},{2,1},{0,48},{0,3},{0,49},{2,1},{0,19},{2,1},{0,50},{0,35},
+ {12,1},{4,1},{2,1},{0,65},{0,20},{4,1},{2,1},{0,64},{0,51},{2,1},
+ {0,66},{0,36},{10,1},{6,1},{4,1},{2,1},{0,4},{0,80},{0,67},{2,1},
+ {0,52},{0,81},{8,1},{4,1},{2,1},{0,21},{0,82},{2,1},{0,37},{0,68},
+ {6,1},{4,1},{2,1},{0,5},{0,84},{0,83},{2,1},{0,53},{2,1},{0,69},
+ {0,85},
+ };
+
+ private static int ValTab10[][] = {
+ {2,1},{0,0},{4,1},{2,1},{0,16},{0,1},{10,1},{2,1},{0,17},{4,1},
+ {2,1},{0,32},{0,2},{2,1},{0,33},{0,18},{28,1},{8,1},{4,1},{2,1},
+ {0,34},{0,48},{2,1},{0,49},{0,19},{8,1},{4,1},{2,1},{0,3},{0,50},
+ {2,1},{0,35},{0,64},{4,1},{2,1},{0,65},{0,20},{4,1},{2,1},{0,4},
+ {0,51},{2,1},{0,66},{0,36},{28,1},{10,1},{6,1},{4,1},{2,1},{0,80},
+ {0,5},{0,96},{2,1},{0,97},{0,22},{12,1},{6,1},{4,1},{2,1},{0,67},
+ {0,52},{0,81},{2,1},{0,21},{2,1},{0,82},{0,37},{4,1},{2,1},{0,38},
+ {0,54},{0,113},{20,1},{8,1},{2,1},{0,23},{4,1},{2,1},{0,68},{0,83},
+ {0,6},{6,1},{4,1},{2,1},{0,53},{0,69},{0,98},{2,1},{0,112},{2,1},
+ {0,7},{0,100},{14,1},{4,1},{2,1},{0,114},{0,39},{6,1},{2,1},{0,99},
+ {2,1},{0,84},{0,85},{2,1},{0,70},{0,115},{8,1},{4,1},{2,1},{0,55},
+ {0,101},{2,1},{0,86},{0,116},{6,1},{2,1},{0,71},{2,1},{0,102},{0,117},
+ {4,1},{2,1},{0,87},{0,118},{2,1},{0,103},{0,119},
+ };
+
+ private static int ValTab11[][] = {
+ {6,1},{2,1},{0,0},{2,1},{0,16},{0,1},{8,1},{2,1},{0,17},{4,1},
+ {2,1},{0,32},{0,2},{0,18},{24,1},{8,1},{2,1},{0,33},{2,1},{0,34},
+ {2,1},{0,48},{0,3},{4,1},{2,1},{0,49},{0,19},{4,1},{2,1},{0,50},
+ {0,35},{4,1},{2,1},{0,64},{0,4},{2,1},{0,65},{0,20},{30,1},{16,1},
+ {10,1},{4,1},{2,1},{0,66},{0,36},{4,1},{2,1},{0,51},{0,67},{0,80},
+ {4,1},{2,1},{0,52},{0,81},{0,97},{6,1},{2,1},{0,22},{2,1},{0,6},
+ {0,38},{2,1},{0,98},{2,1},{0,21},{2,1},{0,5},{0,82},{16,1},{10,1},
+ {6,1},{4,1},{2,1},{0,37},{0,68},{0,96},{2,1},{0,99},{0,54},{4,1},
+ {2,1},{0,112},{0,23},{0,113},{16,1},{6,1},{4,1},{2,1},{0,7},{0,100},
+ {0,114},{2,1},{0,39},{4,1},{2,1},{0,83},{0,53},{2,1},{0,84},{0,69},
+ {10,1},{4,1},{2,1},{0,70},{0,115},{2,1},{0,55},{2,1},{0,101},{0,86},
+ {10,1},{6,1},{4,1},{2,1},{0,85},{0,87},{0,116},{2,1},{0,71},{0,102},
+ {4,1},{2,1},{0,117},{0,118},{2,1},{0,103},{0,119},
+ };
+
+ private static int ValTab12[][] = {
+ {12,1},{4,1},{2,1},{0,16},{0,1},{2,1},{0,17},{2,1},{0,0},{2,1},
+ {0,32},{0,2},{16,1},{4,1},{2,1},{0,33},{0,18},{4,1},{2,1},{0,34},
+ {0,49},{2,1},{0,19},{2,1},{0,48},{2,1},{0,3},{0,64},{26,1},{8,1},
+ {4,1},{2,1},{0,50},{0,35},{2,1},{0,65},{0,51},{10,1},{4,1},{2,1},
+ {0,20},{0,66},{2,1},{0,36},{2,1},{0,4},{0,80},{4,1},{2,1},{0,67},
+ {0,52},{2,1},{0,81},{0,21},{28,1},{14,1},{8,1},{4,1},{2,1},{0,82},
+ {0,37},{2,1},{0,83},{0,53},{4,1},{2,1},{0,96},{0,22},{0,97},{4,1},
+ {2,1},{0,98},{0,38},{6,1},{4,1},{2,1},{0,5},{0,6},{0,68},{2,1},
+ {0,84},{0,69},{18,1},{10,1},{4,1},{2,1},{0,99},{0,54},{4,1},{2,1},
+ {0,112},{0,7},{0,113},{4,1},{2,1},{0,23},{0,100},{2,1},{0,70},{0,114},
+ {10,1},{6,1},{2,1},{0,39},{2,1},{0,85},{0,115},{2,1},{0,55},{0,86},
+ {8,1},{4,1},{2,1},{0,101},{0,116},{2,1},{0,71},{0,102},{4,1},{2,1},
+ {0,117},{0,87},{2,1},{0,118},{2,1},{0,103},{0,119},
+ };
+
+ private static int ValTab13[][] = {
+ {2,1},{0,0},{6,1},{2,1},{0,16},{2,1},{0,1},{0,17},{28,1},{8,1},
+ {4,1},{2,1},{0,32},{0,2},{2,1},{0,33},{0,18},{8,1},{4,1},{2,1},
+ {0,34},{0,48},{2,1},{0,3},{0,49},{6,1},{2,1},{0,19},{2,1},{0,50},
+ {0,35},{4,1},{2,1},{0,64},{0,4},{0,65},{70,1},{28,1},{14,1},{6,1},
+ {2,1},{0,20},{2,1},{0,51},{0,66},{4,1},{2,1},{0,36},{0,80},{2,1},
+ {0,67},{0,52},{4,1},{2,1},{0,81},{0,21},{4,1},{2,1},{0,5},{0,82},
+ {2,1},{0,37},{2,1},{0,68},{0,83},{14,1},{8,1},{4,1},{2,1},{0,96},
+ {0,6},{2,1},{0,97},{0,22},{4,1},{2,1},{0,128},{0,8},{0,129},{16,1},
+ {8,1},{4,1},{2,1},{0,53},{0,98},{2,1},{0,38},{0,84},{4,1},{2,1},
+ {0,69},{0,99},{2,1},{0,54},{0,112},{6,1},{4,1},{2,1},{0,7},{0,85},
+ {0,113},{2,1},{0,23},{2,1},{0,39},{0,55},{72,1},{24,1},{12,1},{4,1},
+ {2,1},{0,24},{0,130},{2,1},{0,40},{4,1},{2,1},{0,100},{0,70},{0,114},
+ {8,1},{4,1},{2,1},{0,132},{0,72},{2,1},{0,144},{0,9},{2,1},{0,145},
+ {0,25},{24,1},{14,1},{8,1},{4,1},{2,1},{0,115},{0,101},{2,1},{0,86},
+ {0,116},{4,1},{2,1},{0,71},{0,102},{0,131},{6,1},{2,1},{0,56},{2,1},
+ {0,117},{0,87},{2,1},{0,146},{0,41},{14,1},{8,1},{4,1},{2,1},{0,103},
+ {0,133},{2,1},{0,88},{0,57},{2,1},{0,147},{2,1},{0,73},{0,134},{6,1},
+ {2,1},{0,160},{2,1},{0,104},{0,10},{2,1},{0,161},{0,26},{68,1},{24,1},
+ {12,1},{4,1},{2,1},{0,162},{0,42},{4,1},{2,1},{0,149},{0,89},{2,1},
+ {0,163},{0,58},{8,1},{4,1},{2,1},{0,74},{0,150},{2,1},{0,176},{0,11},
+ {2,1},{0,177},{0,27},{20,1},{8,1},{2,1},{0,178},{4,1},{2,1},{0,118},
+ {0,119},{0,148},{6,1},{4,1},{2,1},{0,135},{0,120},{0,164},{4,1},{2,1},
+ {0,105},{0,165},{0,43},{12,1},{6,1},{4,1},{2,1},{0,90},{0,136},{0,179},
+ {2,1},{0,59},{2,1},{0,121},{0,166},{6,1},{4,1},{2,1},{0,106},{0,180},
+ {0,192},{4,1},{2,1},{0,12},{0,152},{0,193},{60,1},{22,1},{10,1},{6,1},
+ {2,1},{0,28},{2,1},{0,137},{0,181},{2,1},{0,91},{0,194},{4,1},{2,1},
+ {0,44},{0,60},{4,1},{2,1},{0,182},{0,107},{2,1},{0,196},{0,76},{16,1},
+ {8,1},{4,1},{2,1},{0,168},{0,138},{2,1},{0,208},{0,13},{2,1},{0,209},
+ {2,1},{0,75},{2,1},{0,151},{0,167},{12,1},{6,1},{2,1},{0,195},{2,1},
+ {0,122},{0,153},{4,1},{2,1},{0,197},{0,92},{0,183},{4,1},{2,1},{0,29},
+ {0,210},{2,1},{0,45},{2,1},{0,123},{0,211},{52,1},{28,1},{12,1},{4,1},
+ {2,1},{0,61},{0,198},{4,1},{2,1},{0,108},{0,169},{2,1},{0,154},{0,212},
+ {8,1},{4,1},{2,1},{0,184},{0,139},{2,1},{0,77},{0,199},{4,1},{2,1},
+ {0,124},{0,213},{2,1},{0,93},{0,224},{10,1},{4,1},{2,1},{0,225},{0,30},
+ {4,1},{2,1},{0,14},{0,46},{0,226},{8,1},{4,1},{2,1},{0,227},{0,109},
+ {2,1},{0,140},{0,228},{4,1},{2,1},{0,229},{0,186},{0,240},{38,1},{16,1},
+ {4,1},{2,1},{0,241},{0,31},{6,1},{4,1},{2,1},{0,170},{0,155},{0,185},
+ {2,1},{0,62},{2,1},{0,214},{0,200},{12,1},{6,1},{2,1},{0,78},{2,1},
+ {0,215},{0,125},{2,1},{0,171},{2,1},{0,94},{0,201},{6,1},{2,1},{0,15},
+ {2,1},{0,156},{0,110},{2,1},{0,242},{0,47},{32,1},{16,1},{6,1},{4,1},
+ {2,1},{0,216},{0,141},{0,63},{6,1},{2,1},{0,243},{2,1},{0,230},{0,202},
+ {2,1},{0,244},{0,79},{8,1},{4,1},{2,1},{0,187},{0,172},{2,1},{0,231},
+ {0,245},{4,1},{2,1},{0,217},{0,157},{2,1},{0,95},{0,232},{30,1},{12,1},
+ {6,1},{2,1},{0,111},{2,1},{0,246},{0,203},{4,1},{2,1},{0,188},{0,173},
+ {0,218},{8,1},{2,1},{0,247},{4,1},{2,1},{0,126},{0,127},{0,142},{6,1},
+ {4,1},{2,1},{0,158},{0,174},{0,204},{2,1},{0,248},{0,143},{18,1},{8,1},
+ {4,1},{2,1},{0,219},{0,189},{2,1},{0,234},{0,249},{4,1},{2,1},{0,159},
+ {0,235},{2,1},{0,190},{2,1},{0,205},{0,250},{14,1},{4,1},{2,1},{0,221},
+ {0,236},{6,1},{4,1},{2,1},{0,233},{0,175},{0,220},{2,1},{0,206},{0,251},
+ {8,1},{4,1},{2,1},{0,191},{0,222},{2,1},{0,207},{0,238},{4,1},{2,1},
+ {0,223},{0,239},{2,1},{0,255},{2,1},{0,237},{2,1},{0,253},{2,1},{0,252},
+ {0,254},
+ };
+
+ private static int ValTab14[][] = {
+ {0,0} // dummy
+ };
+
+ private static int ValTab15[][] = {
+ {16,1},{6,1},{2,1},{0,0},{2,1},{0,16},{0,1},{2,1},{0,17},{4,1},
+ {2,1},{0,32},{0,2},{2,1},{0,33},{0,18},{50,1},{16,1},{6,1},{2,1},
+ {0,34},{2,1},{0,48},{0,49},{6,1},{2,1},{0,19},{2,1},{0,3},{0,64},
+ {2,1},{0,50},{0,35},{14,1},{6,1},{4,1},{2,1},{0,4},{0,20},{0,65},
+ {4,1},{2,1},{0,51},{0,66},{2,1},{0,36},{0,67},{10,1},{6,1},{2,1},
+ {0,52},{2,1},{0,80},{0,5},{2,1},{0,81},{0,21},{4,1},{2,1},{0,82},
+ {0,37},{4,1},{2,1},{0,68},{0,83},{0,97},{90,1},{36,1},{18,1},{10,1},
+ {6,1},{2,1},{0,53},{2,1},{0,96},{0,6},{2,1},{0,22},{0,98},{4,1},
+ {2,1},{0,38},{0,84},{2,1},{0,69},{0,99},{10,1},{6,1},{2,1},{0,54},
+ {2,1},{0,112},{0,7},{2,1},{0,113},{0,85},{4,1},{2,1},{0,23},{0,100},
+ {2,1},{0,114},{0,39},{24,1},{16,1},{8,1},{4,1},{2,1},{0,70},{0,115},
+ {2,1},{0,55},{0,101},{4,1},{2,1},{0,86},{0,128},{2,1},{0,8},{0,116},
+ {4,1},{2,1},{0,129},{0,24},{2,1},{0,130},{0,40},{16,1},{8,1},{4,1},
+ {2,1},{0,71},{0,102},{2,1},{0,131},{0,56},{4,1},{2,1},{0,117},{0,87},
+ {2,1},{0,132},{0,72},{6,1},{4,1},{2,1},{0,144},{0,25},{0,145},{4,1},
+ {2,1},{0,146},{0,118},{2,1},{0,103},{0,41},{92,1},{36,1},{18,1},{10,1},
+ {4,1},{2,1},{0,133},{0,88},{4,1},{2,1},{0,9},{0,119},{0,147},{4,1},
+ {2,1},{0,57},{0,148},{2,1},{0,73},{0,134},{10,1},{6,1},{2,1},{0,104},
+ {2,1},{0,160},{0,10},{2,1},{0,161},{0,26},{4,1},{2,1},{0,162},{0,42},
+ {2,1},{0,149},{0,89},{26,1},{14,1},{6,1},{2,1},{0,163},{2,1},{0,58},
+ {0,135},{4,1},{2,1},{0,120},{0,164},{2,1},{0,74},{0,150},{6,1},{4,1},
+ {2,1},{0,105},{0,176},{0,177},{4,1},{2,1},{0,27},{0,165},{0,178},{14,1},
+ {8,1},{4,1},{2,1},{0,90},{0,43},{2,1},{0,136},{0,151},{2,1},{0,179},
+ {2,1},{0,121},{0,59},{8,1},{4,1},{2,1},{0,106},{0,180},{2,1},{0,75},
+ {0,193},{4,1},{2,1},{0,152},{0,137},{2,1},{0,28},{0,181},{80,1},{34,1},
+ {16,1},{6,1},{4,1},{2,1},{0,91},{0,44},{0,194},{6,1},{4,1},{2,1},
+ {0,11},{0,192},{0,166},{2,1},{0,167},{0,122},{10,1},{4,1},{2,1},{0,195},
+ {0,60},{4,1},{2,1},{0,12},{0,153},{0,182},{4,1},{2,1},{0,107},{0,196},
+ {2,1},{0,76},{0,168},{20,1},{10,1},{4,1},{2,1},{0,138},{0,197},{4,1},
+ {2,1},{0,208},{0,92},{0,209},{4,1},{2,1},{0,183},{0,123},{2,1},{0,29},
+ {2,1},{0,13},{0,45},{12,1},{4,1},{2,1},{0,210},{0,211},{4,1},{2,1},
+ {0,61},{0,198},{2,1},{0,108},{0,169},{6,1},{4,1},{2,1},{0,154},{0,184},
+ {0,212},{4,1},{2,1},{0,139},{0,77},{2,1},{0,199},{0,124},{68,1},{34,1},
+ {18,1},{10,1},{4,1},{2,1},{0,213},{0,93},{4,1},{2,1},{0,224},{0,14},
+ {0,225},{4,1},{2,1},{0,30},{0,226},{2,1},{0,170},{0,46},{8,1},{4,1},
+ {2,1},{0,185},{0,155},{2,1},{0,227},{0,214},{4,1},{2,1},{0,109},{0,62},
+ {2,1},{0,200},{0,140},{16,1},{8,1},{4,1},{2,1},{0,228},{0,78},{2,1},
+ {0,215},{0,125},{4,1},{2,1},{0,229},{0,186},{2,1},{0,171},{0,94},{8,1},
+ {4,1},{2,1},{0,201},{0,156},{2,1},{0,241},{0,31},{6,1},{4,1},{2,1},
+ {0,240},{0,110},{0,242},{2,1},{0,47},{0,230},{38,1},{18,1},{8,1},{4,1},
+ {2,1},{0,216},{0,243},{2,1},{0,63},{0,244},{6,1},{2,1},{0,79},{2,1},
+ {0,141},{0,217},{2,1},{0,187},{0,202},{8,1},{4,1},{2,1},{0,172},{0,231},
+ {2,1},{0,126},{0,245},{8,1},{4,1},{2,1},{0,157},{0,95},{2,1},{0,232},
+ {0,142},{2,1},{0,246},{0,203},{34,1},{18,1},{10,1},{6,1},{4,1},{2,1},
+ {0,15},{0,174},{0,111},{2,1},{0,188},{0,218},{4,1},{2,1},{0,173},{0,247},
+ {2,1},{0,127},{0,233},{8,1},{4,1},{2,1},{0,158},{0,204},{2,1},{0,248},
+ {0,143},{4,1},{2,1},{0,219},{0,189},{2,1},{0,234},{0,249},{16,1},{8,1},
+ {4,1},{2,1},{0,159},{0,220},{2,1},{0,205},{0,235},{4,1},{2,1},{0,190},
+ {0,250},{2,1},{0,175},{0,221},{14,1},{6,1},{4,1},{2,1},{0,236},{0,206},
+ {0,251},{4,1},{2,1},{0,191},{0,237},{2,1},{0,222},{0,252},{6,1},{4,1},
+ {2,1},{0,207},{0,253},{0,238},{4,1},{2,1},{0,223},{0,254},{2,1},{0,239},
+ {0,255},
+ };
+
+ private static int ValTab16[][] = {
+ {2,1},{0,0},{6,1},{2,1},{0,16},{2,1},{0,1},{0,17},{42,1},{8,1},
+ {4,1},{2,1},{0,32},{0,2},{2,1},{0,33},{0,18},{10,1},{6,1},{2,1},
+ {0,34},{2,1},{0,48},{0,3},{2,1},{0,49},{0,19},{10,1},{4,1},{2,1},
+ {0,50},{0,35},{4,1},{2,1},{0,64},{0,4},{0,65},{6,1},{2,1},{0,20},
+ {2,1},{0,51},{0,66},{4,1},{2,1},{0,36},{0,80},{2,1},{0,67},{0,52},
+ {138,1},{40,1},{16,1},{6,1},{4,1},{2,1},{0,5},{0,21},{0,81},{4,1},
+ {2,1},{0,82},{0,37},{4,1},{2,1},{0,68},{0,53},{0,83},{10,1},{6,1},
+ {4,1},{2,1},{0,96},{0,6},{0,97},{2,1},{0,22},{0,98},{8,1},{4,1},
+ {2,1},{0,38},{0,84},{2,1},{0,69},{0,99},{4,1},{2,1},{0,54},{0,112},
+ {0,113},{40,1},{18,1},{8,1},{2,1},{0,23},{2,1},{0,7},{2,1},{0,85},
+ {0,100},{4,1},{2,1},{0,114},{0,39},{4,1},{2,1},{0,70},{0,101},{0,115},
+ {10,1},{6,1},{2,1},{0,55},{2,1},{0,86},{0,8},{2,1},{0,128},{0,129},
+ {6,1},{2,1},{0,24},{2,1},{0,116},{0,71},{2,1},{0,130},{2,1},{0,40},
+ {0,102},{24,1},{14,1},{8,1},{4,1},{2,1},{0,131},{0,56},{2,1},{0,117},
+ {0,132},{4,1},{2,1},{0,72},{0,144},{0,145},{6,1},{2,1},{0,25},{2,1},
+ {0,9},{0,118},{2,1},{0,146},{0,41},{14,1},{8,1},{4,1},{2,1},{0,133},
+ {0,88},{2,1},{0,147},{0,57},{4,1},{2,1},{0,160},{0,10},{0,26},{8,1},
+ {2,1},{0,162},{2,1},{0,103},{2,1},{0,87},{0,73},{6,1},{2,1},{0,148},
+ {2,1},{0,119},{0,134},{2,1},{0,161},{2,1},{0,104},{0,149},{220,1},{126,1},
+ {50,1},{26,1},{12,1},{6,1},{2,1},{0,42},{2,1},{0,89},{0,58},{2,1},
+ {0,163},{2,1},{0,135},{0,120},{8,1},{4,1},{2,1},{0,164},{0,74},{2,1},
+ {0,150},{0,105},{4,1},{2,1},{0,176},{0,11},{0,177},{10,1},{4,1},{2,1},
+ {0,27},{0,178},{2,1},{0,43},{2,1},{0,165},{0,90},{6,1},{2,1},{0,179},
+ {2,1},{0,166},{0,106},{4,1},{2,1},{0,180},{0,75},{2,1},{0,12},{0,193},
+ {30,1},{14,1},{6,1},{4,1},{2,1},{0,181},{0,194},{0,44},{4,1},{2,1},
+ {0,167},{0,195},{2,1},{0,107},{0,196},{8,1},{2,1},{0,29},{4,1},{2,1},
+ {0,136},{0,151},{0,59},{4,1},{2,1},{0,209},{0,210},{2,1},{0,45},{0,211},
+ {18,1},{6,1},{4,1},{2,1},{0,30},{0,46},{0,226},{6,1},{4,1},{2,1},
+ {0,121},{0,152},{0,192},{2,1},{0,28},{2,1},{0,137},{0,91},{14,1},{6,1},
+ {2,1},{0,60},{2,1},{0,122},{0,182},{4,1},{2,1},{0,76},{0,153},{2,1},
+ {0,168},{0,138},{6,1},{2,1},{0,13},{2,1},{0,197},{0,92},{4,1},{2,1},
+ {0,61},{0,198},{2,1},{0,108},{0,154},{88,1},{86,1},{36,1},{16,1},{8,1},
+ {4,1},{2,1},{0,139},{0,77},{2,1},{0,199},{0,124},{4,1},{2,1},{0,213},
+ {0,93},{2,1},{0,224},{0,14},{8,1},{2,1},{0,227},{4,1},{2,1},{0,208},
+ {0,183},{0,123},{6,1},{4,1},{2,1},{0,169},{0,184},{0,212},{2,1},{0,225},
+ {2,1},{0,170},{0,185},{24,1},{10,1},{6,1},{4,1},{2,1},{0,155},{0,214},
+ {0,109},{2,1},{0,62},{0,200},{6,1},{4,1},{2,1},{0,140},{0,228},{0,78},
+ {4,1},{2,1},{0,215},{0,229},{2,1},{0,186},{0,171},{12,1},{4,1},{2,1},
+ {0,156},{0,230},{4,1},{2,1},{0,110},{0,216},{2,1},{0,141},{0,187},{8,1},
+ {4,1},{2,1},{0,231},{0,157},{2,1},{0,232},{0,142},{4,1},{2,1},{0,203},
+ {0,188},{0,158},{0,241},{2,1},{0,31},{2,1},{0,15},{0,47},{66,1},{56,1},
+ {2,1},{0,242},{52,1},{50,1},{20,1},{8,1},{2,1},{0,189},{2,1},{0,94},
+ {2,1},{0,125},{0,201},{6,1},{2,1},{0,202},{2,1},{0,172},{0,126},{4,1},
+ {2,1},{0,218},{0,173},{0,204},{10,1},{6,1},{2,1},{0,174},{2,1},{0,219},
+ {0,220},{2,1},{0,205},{0,190},{6,1},{4,1},{2,1},{0,235},{0,237},{0,238},
+ {6,1},{4,1},{2,1},{0,217},{0,234},{0,233},{2,1},{0,222},{4,1},{2,1},
+ {0,221},{0,236},{0,206},{0,63},{0,240},{4,1},{2,1},{0,243},{0,244},{2,1},
+ {0,79},{2,1},{0,245},{0,95},{10,1},{2,1},{0,255},{4,1},{2,1},{0,246},
+ {0,111},{2,1},{0,247},{0,127},{12,1},{6,1},{2,1},{0,143},{2,1},{0,248},
+ {0,249},{4,1},{2,1},{0,159},{0,250},{0,175},{8,1},{4,1},{2,1},{0,251},
+ {0,191},{2,1},{0,252},{0,207},{4,1},{2,1},{0,253},{0,223},{2,1},{0,254},
+ {0,239},
+ };
+
+ private static int ValTab24[][] = {
+ {60,1},{8,1},{4,1},{2,1},{0,0},{0,16},{2,1},{0,1},{0,17},{14,1},
+ {6,1},{4,1},{2,1},{0,32},{0,2},{0,33},{2,1},{0,18},{2,1},{0,34},
+ {2,1},{0,48},{0,3},{14,1},{4,1},{2,1},{0,49},{0,19},{4,1},{2,1},
+ {0,50},{0,35},{4,1},{2,1},{0,64},{0,4},{0,65},{8,1},{4,1},{2,1},
+ {0,20},{0,51},{2,1},{0,66},{0,36},{6,1},{4,1},{2,1},{0,67},{0,52},
+ {0,81},{6,1},{4,1},{2,1},{0,80},{0,5},{0,21},{2,1},{0,82},{0,37},
+ {250,1},{98,1},{34,1},{18,1},{10,1},{4,1},{2,1},{0,68},{0,83},{2,1},
+ {0,53},{2,1},{0,96},{0,6},{4,1},{2,1},{0,97},{0,22},{2,1},{0,98},
+ {0,38},{8,1},{4,1},{2,1},{0,84},{0,69},{2,1},{0,99},{0,54},{4,1},
+ {2,1},{0,113},{0,85},{2,1},{0,100},{0,70},{32,1},{14,1},{6,1},{2,1},
+ {0,114},{2,1},{0,39},{0,55},{2,1},{0,115},{4,1},{2,1},{0,112},{0,7},
+ {0,23},{10,1},{4,1},{2,1},{0,101},{0,86},{4,1},{2,1},{0,128},{0,8},
+ {0,129},{4,1},{2,1},{0,116},{0,71},{2,1},{0,24},{0,130},{16,1},{8,1},
+ {4,1},{2,1},{0,40},{0,102},{2,1},{0,131},{0,56},{4,1},{2,1},{0,117},
+ {0,87},{2,1},{0,132},{0,72},{8,1},{4,1},{2,1},{0,145},{0,25},{2,1},
+ {0,146},{0,118},{4,1},{2,1},{0,103},{0,41},{2,1},{0,133},{0,88},{92,1},
+ {34,1},{16,1},{8,1},{4,1},{2,1},{0,147},{0,57},{2,1},{0,148},{0,73},
+ {4,1},{2,1},{0,119},{0,134},{2,1},{0,104},{0,161},{8,1},{4,1},{2,1},
+ {0,162},{0,42},{2,1},{0,149},{0,89},{4,1},{2,1},{0,163},{0,58},{2,1},
+ {0,135},{2,1},{0,120},{0,74},{22,1},{12,1},{4,1},{2,1},{0,164},{0,150},
+ {4,1},{2,1},{0,105},{0,177},{2,1},{0,27},{0,165},{6,1},{2,1},{0,178},
+ {2,1},{0,90},{0,43},{2,1},{0,136},{0,179},{16,1},{10,1},{6,1},{2,1},
+ {0,144},{2,1},{0,9},{0,160},{2,1},{0,151},{0,121},{4,1},{2,1},{0,166},
+ {0,106},{0,180},{12,1},{6,1},{2,1},{0,26},{2,1},{0,10},{0,176},{2,1},
+ {0,59},{2,1},{0,11},{0,192},{4,1},{2,1},{0,75},{0,193},{2,1},{0,152},
+ {0,137},{67,1},{34,1},{16,1},{8,1},{4,1},{2,1},{0,28},{0,181},{2,1},
+ {0,91},{0,194},{4,1},{2,1},{0,44},{0,167},{2,1},{0,122},{0,195},{10,1},
+ {6,1},{2,1},{0,60},{2,1},{0,12},{0,208},{2,1},{0,182},{0,107},{4,1},
+ {2,1},{0,196},{0,76},{2,1},{0,153},{0,168},{16,1},{8,1},{4,1},{2,1},
+ {0,138},{0,197},{2,1},{0,92},{0,209},{4,1},{2,1},{0,183},{0,123},{2,1},
+ {0,29},{0,210},{9,1},{4,1},{2,1},{0,45},{0,211},{2,1},{0,61},{0,198},
+ {85,250},{4,1},{2,1},{0,108},{0,169},{2,1},{0,154},{0,212},{32,1},{16,1},
+ {8,1},{4,1},{2,1},{0,184},{0,139},{2,1},{0,77},{0,199},{4,1},{2,1},
+ {0,124},{0,213},{2,1},{0,93},{0,225},{8,1},{4,1},{2,1},{0,30},{0,226},
+ {2,1},{0,170},{0,185},{4,1},{2,1},{0,155},{0,227},{2,1},{0,214},{0,109},
+ {20,1},{10,1},{6,1},{2,1},{0,62},{2,1},{0,46},{0,78},{2,1},{0,200},
+ {0,140},{4,1},{2,1},{0,228},{0,215},{4,1},{2,1},{0,125},{0,171},{0,229},
+ {10,1},{4,1},{2,1},{0,186},{0,94},{2,1},{0,201},{2,1},{0,156},{0,110},
+ {8,1},{2,1},{0,230},{2,1},{0,13},{2,1},{0,224},{0,14},{4,1},{2,1},
+ {0,216},{0,141},{2,1},{0,187},{0,202},{74,1},{2,1},{0,255},{64,1},{58,1},
+ {32,1},{16,1},{8,1},{4,1},{2,1},{0,172},{0,231},{2,1},{0,126},{0,217},
+ {4,1},{2,1},{0,157},{0,232},{2,1},{0,142},{0,203},{8,1},{4,1},{2,1},
+ {0,188},{0,218},{2,1},{0,173},{0,233},{4,1},{2,1},{0,158},{0,204},{2,1},
+ {0,219},{0,189},{16,1},{8,1},{4,1},{2,1},{0,234},{0,174},{2,1},{0,220},
+ {0,205},{4,1},{2,1},{0,235},{0,190},{2,1},{0,221},{0,236},{8,1},{4,1},
+ {2,1},{0,206},{0,237},{2,1},{0,222},{0,238},{0,15},{4,1},{2,1},{0,240},
+ {0,31},{0,241},{4,1},{2,1},{0,242},{0,47},{2,1},{0,243},{0,63},{18,1},
+ {8,1},{4,1},{2,1},{0,244},{0,79},{2,1},{0,245},{0,95},{4,1},{2,1},
+ {0,246},{0,111},{2,1},{0,247},{2,1},{0,127},{0,143},{10,1},{4,1},{2,1},
+ {0,248},{0,249},{4,1},{2,1},{0,159},{0,175},{0,250},{8,1},{4,1},{2,1},
+ {0,251},{0,191},{2,1},{0,252},{0,207},{4,1},{2,1},{0,253},{0,223},{2,1},
+ {0,254},{0,239},
+ };
+
+ private static int ValTab32[][] = {
+ {2,1},{0,0},{8,1},{4,1},{2,1},{0,8},{0,4},{2,1},{0,1},{0,2},
+ {8,1},{4,1},{2,1},{0,12},{0,10},{2,1},{0,3},{0,6},{6,1},{2,1},
+ {0,9},{2,1},{0,5},{0,7},{4,1},{2,1},{0,14},{0,13},{2,1},{0,15},
+ {0,11},
+ };
+
+ private static int ValTab33[][] = {
+ {16,1},{8,1},{4,1},{2,1},{0,0},{0,1},{2,1},{0,2},{0,3},{4,1},
+ {2,1},{0,4},{0,5},{2,1},{0,6},{0,7},{8,1},{4,1},{2,1},{0,8},
+ {0,9},{2,1},{0,10},{0,11},{4,1},{2,1},{0,12},{0,13},{2,1},{0,14},
+ {0,15},
+ };
+
+
+ public static huffcodetab[] ht = null; /* Simulate extern struct */
+
+ private static int[] bitbuf = new int[32];
+
+ /**
+ * Big Constructor : Computes all Huffman Tables.
+ */
+ private huffcodetab(String S,int XLEN, int YLEN, int LINBITS, int LINMAX, int REF,
+ int[] TABLE, int[] HLEN, int[][] VAL, int TREELEN)
+ {
+ tablename0 = S.charAt(0);
+ tablename1 = S.charAt(1);
+ tablename2 = S.charAt(2);
+ xlen = XLEN;
+ ylen = YLEN;
+ linbits = LINBITS;
+ linmax = LINMAX;
+ ref = REF;
+ table = TABLE;
+ hlen = HLEN;
+ val = VAL;
+ treelen = TREELEN;
+ }
+
+
+
+ /**
+ * Do the huffman-decoding.
+ * note! for counta,countb -the 4 bit value is returned in y,
+ * discard x.
+ */
+ public static int huffman_decoder(huffcodetab h, int[] x, int[] y, int[] v, int[] w, BitReserve br)
+ {
+ // array of all huffcodtable headers
+ // 0..31 Huffman code table 0..31
+ // 32,33 count1-tables
+
+ int dmask = 1 << ((4 * 8) - 1);
+ int hs = 4 * 8;
+ int level;
+ int point = 0;
+ int error = 1;
+ level = dmask;
+
+ if (h.val == null) return 2;
+
+ /* table 0 needs no bits */
+ if ( h.treelen == 0)
+ {
+ x[0] = y[0] = 0;
+ return 0;
+ }
+
+ /* Lookup in Huffman table. */
+
+ /*int bitsAvailable = 0;
+ int bitIndex = 0;
+
+ int bits[] = bitbuf;*/
+ do
+ {
+ if (h.val[point][0]==0)
+ { /*end of tree*/
+ x[0] = h.val[point][1] >>> 4;
+ y[0] = h.val[point][1] & 0xf;
+ error = 0;
+ break;
+ }
+
+ // hget1bit() is called thousands of times, and so needs to be
+ // ultra fast.
+ /*
+ if (bitIndex==bitsAvailable)
+ {
+ bitsAvailable = br.readBits(bits, 32);
+ bitIndex = 0;
+ }
+ */
+ //if (bits[bitIndex++]!=0)
+ if (br.hget1bit()!=0)
+ {
+ while (h.val[point][1] >= MXOFF) point += h.val[point][1];
+ point += h.val[point][1];
+ }
+ else
+ {
+ while (h.val[point][0] >= MXOFF) point += h.val[point][0];
+ point += h.val[point][0];
+ }
+ level >>>= 1;
+ // MDM: ht[0] is always 0;
+ } while ((level !=0 ) || (point < 0 /*ht[0].treelen*/) );
+
+ // put back any bits not consumed
+ /*
+ int unread = (bitsAvailable-bitIndex);
+ if (unread>0)
+ br.rewindNbits(unread);
+ */
+ /* Process sign encodings for quadruples tables. */
+ // System.out.println(h.tablename);
+ if (h.tablename0 == '3' && (h.tablename1 == '2' || h.tablename1 == '3'))
+ {
+ v[0] = (y[0]>>3) & 1;
+ w[0] = (y[0]>>2) & 1;
+ x[0] = (y[0]>>1) & 1;
+ y[0] = y[0] & 1;
+
+ /* v, w, x and y are reversed in the bitstream.
+ switch them around to make test bistream work. */
+
+ if (v[0]!=0)
+ if (br.hget1bit() != 0) v[0] = -v[0];
+ if (w[0]!=0)
+ if (br.hget1bit() != 0) w[0] = -w[0];
+ if (x[0]!=0)
+ if (br.hget1bit() != 0) x[0] = -x[0];
+ if (y[0]!=0)
+ if (br.hget1bit() != 0) y[0] = -y[0];
+ }
+ else
+ {
+ // Process sign and escape encodings for dual tables.
+ // x and y are reversed in the test bitstream.
+ // Reverse x and y here to make test bitstream work.
+
+ if (h.linbits != 0)
+ if ((h.xlen-1) == x[0])
+ x[0] += br.hgetbits(h.linbits);
+ if (x[0] != 0)
+ if (br.hget1bit() != 0) x[0] = -x[0];
+ if (h.linbits != 0)
+ if ((h.ylen-1) == y[0])
+ y[0] += br.hgetbits(h.linbits);
+ if (y[0] != 0)
+ if (br.hget1bit() != 0) y[0] = -y[0];
+ }
+ return error;
+ }
+
+ public static void inithuff()
+ {
+
+ if (ht!=null)
+ return;
+
+ ht = new huffcodetab[HTN];
+ ht[0] = new huffcodetab("0 ",0,0,0,0,-1,null,null,ValTab0,0);
+ ht[1] = new huffcodetab("1 ",2,2,0,0,-1,null,null,ValTab1,7);
+ ht[2] = new huffcodetab("2 ",3,3,0,0,-1,null,null,ValTab2,17);
+ ht[3] = new huffcodetab("3 ",3,3,0,0,-1,null,null,ValTab3,17);
+ ht[4] = new huffcodetab("4 ",0,0,0,0,-1,null,null,ValTab4,0);
+ ht[5] = new huffcodetab("5 ",4,4,0,0,-1,null,null,ValTab5,31);
+ ht[6] = new huffcodetab("6 ",4,4,0,0,-1,null,null,ValTab6,31);
+ ht[7] = new huffcodetab("7 ",6,6,0,0,-1,null,null,ValTab7,71);
+ ht[8] = new huffcodetab("8 ",6,6,0,0,-1,null,null,ValTab8,71);
+ ht[9] = new huffcodetab("9 ",6,6,0,0,-1,null,null,ValTab9,71);
+ ht[10] = new huffcodetab("10 ",8,8,0,0,-1,null,null,ValTab10,127);
+ ht[11] = new huffcodetab("11 ",8,8,0,0,-1,null,null,ValTab11,127);
+ ht[12] = new huffcodetab("12 ",8,8,0,0,-1,null,null,ValTab12,127);
+ ht[13] = new huffcodetab("13 ",16,16,0,0,-1,null,null,ValTab13,511);
+ ht[14] = new huffcodetab("14 ",0,0,0,0,-1,null,null,ValTab14,0);
+ ht[15] = new huffcodetab("15 ",16,16,0,0,-1,null,null,ValTab15,511);
+ ht[16] = new huffcodetab("16 ",16,16,1,1,-1,null,null,ValTab16,511);
+ ht[17] = new huffcodetab("17 ",16,16,2,3,16,null,null,ValTab16,511);
+ ht[18] = new huffcodetab("18 ",16,16,3,7,16,null,null,ValTab16,511);
+ ht[19] = new huffcodetab("19 ",16,16,4,15,16,null,null,ValTab16,511);
+ ht[20] = new huffcodetab("20 ",16,16,6,63,16,null,null,ValTab16,511);
+ ht[21] = new huffcodetab("21 ",16,16,8,255,16,null,null,ValTab16,511);
+ ht[22] = new huffcodetab("22 ",16,16,10,1023,16,null,null,ValTab16,511);
+ ht[23] = new huffcodetab("23 ",16,16,13,8191,16,null,null,ValTab16,511);
+ ht[24] = new huffcodetab("24 ",16,16,4,15,-1,null,null,ValTab24,512);
+ ht[25] = new huffcodetab("25 ",16,16,5,31,24,null,null,ValTab24,512);
+ ht[26] = new huffcodetab("26 ",16,16,6,63,24,null,null,ValTab24,512);
+ ht[27] = new huffcodetab("27 ",16,16,7,127,24,null,null,ValTab24,512);
+ ht[28] = new huffcodetab("28 ",16,16,8,255,24,null,null,ValTab24,512);
+ ht[29] = new huffcodetab("29 ",16,16,9,511,24,null,null,ValTab24,512);
+ ht[30] = new huffcodetab("30 ",16,16,11,2047,24,null,null,ValTab24,512);
+ ht[31] = new huffcodetab("31 ",16,16,13,8191,24,null,null,ValTab24,512);
+ ht[32] = new huffcodetab("32 ",1,16,0,0,-1,null,null,ValTab32,31);
+ ht[33] = new huffcodetab("33 ",1,16,0,0,-1,null,null,ValTab33,31);
+ }
+}