mirror of
https://github.com/catfoolyou/Project164.git
synced 2025-05-28 13:40:57 -05:00
Add mp-server
This commit is contained in:
parent
3f7df728c9
commit
1740bd5e4c
@ -1,3 +1,2 @@
|
||||
#!/bin/sh
|
||||
cd epkcompiler
|
||||
./run_unix.sh
|
||||
java -jar CompilePackage.jar "./lwjgl-rundir/resources" "./javascript/assets.epk"
|
||||
|
@ -1,6 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<classpath>
|
||||
<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER/org.eclipse.jdt.internal.debug.ui.launcher.StandardVMType/jdk1.8.0_231"/>
|
||||
<classpathentry kind="src" path="src"/>
|
||||
<classpathentry kind="output" path="bin"/>
|
||||
</classpath>
|
@ -1,17 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<projectDescription>
|
||||
<name>PackageCompiler</name>
|
||||
<comment></comment>
|
||||
<projects>
|
||||
</projects>
|
||||
<buildSpec>
|
||||
<buildCommand>
|
||||
<name>org.eclipse.jdt.core.javabuilder</name>
|
||||
<arguments>
|
||||
</arguments>
|
||||
</buildCommand>
|
||||
</buildSpec>
|
||||
<natures>
|
||||
<nature>org.eclipse.jdt.core.javanature</nature>
|
||||
</natures>
|
||||
</projectDescription>
|
@ -1,12 +0,0 @@
|
||||
TO QUICKLY MAKE RESOURCE PACK:
|
||||
1. make your changes to the files in '/lwjgl-rundir/resources'
|
||||
2. double click 'run.bat' on windows, or run './run_unix.sh' in terminal on mac
|
||||
3. copy 'assets.epk from '/javascript' to your web directory
|
||||
|
||||
To manually use the CompilePackage.jar on a custom directory, run the jar file like this:
|
||||
|
||||
java -jar CompilePackage.jar <source directory> <output file>
|
||||
|
||||
To recompile the assets.epk file found in /javascript, run:
|
||||
|
||||
java -jar CompilePackage.jar "../lwjgl-rundir/resources" "../javascript/assets.epk"
|
@ -1,6 +0,0 @@
|
||||
@echo off
|
||||
title epkcompiler
|
||||
echo compiling, please wait...
|
||||
java -jar CompilePackage.jar "../lwjgl-rundir/resources" "../javascript/assets.epk"
|
||||
echo finished compiling epk
|
||||
pause
|
@ -1,2 +0,0 @@
|
||||
#!/bin/sh
|
||||
java -jar CompilePackage.jar "../lwjgl-rundir/resources" "../javascript/assets.epk"
|
@ -1,169 +0,0 @@
|
||||
import java.io.ByteArrayOutputStream;
|
||||
import java.io.File;
|
||||
import java.io.FileInputStream;
|
||||
import java.io.FileOutputStream;
|
||||
import java.io.IOException;
|
||||
import java.io.InputStream;
|
||||
import java.io.OutputStream;
|
||||
import java.nio.charset.Charset;
|
||||
import java.nio.charset.StandardCharsets;
|
||||
import java.text.SimpleDateFormat;
|
||||
import java.util.ArrayList;
|
||||
import java.util.Date;
|
||||
|
||||
import com.jcraft.jzlib.CRC32;
|
||||
import com.jcraft.jzlib.Deflater;
|
||||
import com.jcraft.jzlib.DeflaterOutputStream;
|
||||
import com.jcraft.jzlib.GZIPOutputStream;
|
||||
|
||||
public class CompilePackage {
|
||||
|
||||
private static ArrayList<File> files = new ArrayList();
|
||||
|
||||
public static void main(String[] args) throws IOException {
|
||||
if(args.length < 2 || args.length > 4) {
|
||||
System.out.println("Usage: java -jar CompilePackage.jar <input directory> <output file> [gzip|zlib|none] [file-type]");
|
||||
return;
|
||||
}
|
||||
|
||||
File root = new File(args[0]);
|
||||
File output = new File(args[1]);
|
||||
char compressionType;
|
||||
|
||||
if(args.length > 2) {
|
||||
if(args[2].equalsIgnoreCase("gzip")) {
|
||||
compressionType = 'G';
|
||||
}else if(args[2].equalsIgnoreCase("zlib")) {
|
||||
compressionType = 'Z';
|
||||
}else if(args[2].equalsIgnoreCase("none")) {
|
||||
compressionType = '0';
|
||||
}else {
|
||||
throw new IllegalArgumentException("Unknown compression method: " + args[2]);
|
||||
}
|
||||
}else {
|
||||
compressionType = 'G';
|
||||
}
|
||||
|
||||
listDirectory(root);
|
||||
ByteArrayOutputStream osb = new ByteArrayOutputStream();
|
||||
String start = root.getAbsolutePath();
|
||||
|
||||
osb.write("EAGPKG$$".getBytes(Charset.forName("UTF-8")));
|
||||
|
||||
String chars = "ver2.0";
|
||||
osb.write(chars.length());
|
||||
osb.write(chars.getBytes(StandardCharsets.US_ASCII));
|
||||
|
||||
Date d = new Date();
|
||||
|
||||
String comment = "\n\n # Eagler EPK v2.0 (c) " + (new SimpleDateFormat("yyyy")).format(d) + " Calder Young\n" +
|
||||
" # update: on " + (new SimpleDateFormat("MM/dd/yyyy")).format(d) + " at " +
|
||||
(new SimpleDateFormat("hh:mm:ss aa")).format(d) + "\n\n";
|
||||
|
||||
String nm = output.getName();
|
||||
osb.write(nm.length());
|
||||
osb.write(nm.getBytes(StandardCharsets.US_ASCII));
|
||||
|
||||
writeShort(comment.length(), osb);
|
||||
osb.write(comment.getBytes(StandardCharsets.US_ASCII));
|
||||
|
||||
writeLong(d.getTime(), osb);
|
||||
writeInt(files.size() + 1, osb);
|
||||
|
||||
osb.write(compressionType);
|
||||
|
||||
OutputStream os;
|
||||
|
||||
if(compressionType == 'G') {
|
||||
os = new GZIPOutputStream(osb, new Deflater(9, 15+16), 16384, true);
|
||||
}else if(compressionType == 'Z') {
|
||||
os = new DeflaterOutputStream(osb, new Deflater(9), 16384, true);
|
||||
}else {
|
||||
os = osb;
|
||||
}
|
||||
|
||||
os.write("HEAD".getBytes(StandardCharsets.US_ASCII));
|
||||
String key = "file-type";
|
||||
os.write(key.length());
|
||||
os.write(key.getBytes(StandardCharsets.US_ASCII));
|
||||
String value;
|
||||
if(args.length > 3) {
|
||||
value = args[3];
|
||||
}else {
|
||||
value = "epk/resources";
|
||||
}
|
||||
writeInt(value.length(), os);
|
||||
os.write(value.getBytes(StandardCharsets.US_ASCII));
|
||||
os.write('>');
|
||||
|
||||
CRC32 checkSum = new CRC32();
|
||||
for(File f : files) {
|
||||
InputStream stream = new FileInputStream(f);
|
||||
byte[] targetArray = new byte[(int)f.length()];
|
||||
stream.read(targetArray);
|
||||
stream.close();
|
||||
|
||||
checkSum.reset();
|
||||
checkSum.update(targetArray, 0, targetArray.length);
|
||||
int ch = (int)checkSum.getValue();
|
||||
|
||||
os.write("FILE".getBytes(StandardCharsets.US_ASCII));
|
||||
|
||||
String p = f.getAbsolutePath().replace(start, "").replace('\\', '/');
|
||||
if(p.startsWith("/")) {
|
||||
p = p.substring(1);
|
||||
}
|
||||
os.write(p.length());
|
||||
os.write(p.getBytes(StandardCharsets.US_ASCII));
|
||||
writeInt(targetArray.length + 5, os);
|
||||
writeInt(ch, os);
|
||||
|
||||
os.write(targetArray);
|
||||
os.write(':');
|
||||
os.write('>');
|
||||
}
|
||||
|
||||
os.write("END$".getBytes(StandardCharsets.US_ASCII));
|
||||
os.close();
|
||||
|
||||
osb.write(":::YEE:>".getBytes(StandardCharsets.US_ASCII));
|
||||
|
||||
FileOutputStream out = new FileOutputStream(output);
|
||||
out.write(osb.toByteArray());
|
||||
out.close();
|
||||
}
|
||||
|
||||
public static void writeShort(int i, OutputStream os) throws IOException {
|
||||
os.write((i >> 8) & 0xFF);
|
||||
os.write(i & 0xFF);
|
||||
}
|
||||
|
||||
public static void writeInt(int i, OutputStream os) throws IOException {
|
||||
os.write((i >> 24) & 0xFF);
|
||||
os.write((i >> 16) & 0xFF);
|
||||
os.write((i >> 8) & 0xFF);
|
||||
os.write(i & 0xFF);
|
||||
}
|
||||
|
||||
public static void writeLong(long i, OutputStream os) throws IOException {
|
||||
os.write((int)((i >> 56) & 0xFF));
|
||||
os.write((int)((i >> 48) & 0xFF));
|
||||
os.write((int)((i >> 40) & 0xFF));
|
||||
os.write((int)((i >> 32) & 0xFF));
|
||||
os.write((int)((i >> 24) & 0xFF));
|
||||
os.write((int)((i >> 16) & 0xFF));
|
||||
os.write((int)((i >> 8) & 0xFF));
|
||||
os.write((int)(i & 0xFF));
|
||||
}
|
||||
|
||||
public static void listDirectory(File dir) {
|
||||
for(File f : dir.listFiles()) {
|
||||
if(f.isDirectory()) {
|
||||
listDirectory(f);
|
||||
}else {
|
||||
files.add(f);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
}
|
@ -1,118 +0,0 @@
|
||||
/* -*-mode:java; c-basic-offset:2; -*- */
|
||||
/*
|
||||
Copyright (c) 2000-2011 ymnk, JCraft,Inc. All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are met:
|
||||
|
||||
1. Redistributions of source code must retain the above copyright notice,
|
||||
this list of conditions and the following disclaimer.
|
||||
|
||||
2. Redistributions in binary form must reproduce the above copyright
|
||||
notice, this list of conditions and the following disclaimer in
|
||||
the documentation and/or other materials provided with the distribution.
|
||||
|
||||
3. The names of the authors may not be used to endorse or promote products
|
||||
derived from this software without specific prior written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
|
||||
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
||||
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
|
||||
INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||||
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
|
||||
OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||||
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||||
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
|
||||
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
/*
|
||||
* This program is based on zlib-1.1.3, so all credit should go authors
|
||||
* Jean-loup Gailly(jloup@gzip.org) and Mark Adler(madler@alumni.caltech.edu)
|
||||
* and contributors of zlib.
|
||||
*/
|
||||
|
||||
package com.jcraft.jzlib;
|
||||
|
||||
final public class Adler32 implements Checksum {
|
||||
|
||||
// largest prime smaller than 65536
|
||||
static final private int BASE=65521;
|
||||
// NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1
|
||||
static final private int NMAX=5552;
|
||||
|
||||
private long s1=1L;
|
||||
private long s2=0L;
|
||||
|
||||
public void reset(long init){
|
||||
s1=init&0xffff;
|
||||
s2=(init>>16)&0xffff;
|
||||
}
|
||||
|
||||
public void reset(){
|
||||
s1=1L;
|
||||
s2=0L;
|
||||
}
|
||||
|
||||
public long getValue(){
|
||||
return ((s2<<16)|s1);
|
||||
}
|
||||
|
||||
public void update(byte[] buf, int index, int len){
|
||||
|
||||
if(len==1){
|
||||
s1+=buf[index++]&0xff; s2+=s1;
|
||||
s1%=BASE;
|
||||
s2%=BASE;
|
||||
return;
|
||||
}
|
||||
|
||||
int len1 = len/NMAX;
|
||||
int len2 = len%NMAX;
|
||||
while(len1-->0) {
|
||||
int k=NMAX;
|
||||
len-=k;
|
||||
while(k-->0){
|
||||
s1+=buf[index++]&0xff; s2+=s1;
|
||||
}
|
||||
s1%=BASE;
|
||||
s2%=BASE;
|
||||
}
|
||||
|
||||
int k=len2;
|
||||
len-=k;
|
||||
while(k-->0){
|
||||
s1+=buf[index++]&0xff; s2+=s1;
|
||||
}
|
||||
s1%=BASE;
|
||||
s2%=BASE;
|
||||
}
|
||||
|
||||
public Adler32 copy(){
|
||||
Adler32 foo = new Adler32();
|
||||
foo.s1 = this.s1;
|
||||
foo.s2 = this.s2;
|
||||
return foo;
|
||||
}
|
||||
|
||||
// The following logic has come from zlib.1.2.
|
||||
static long combine(long adler1, long adler2, long len2){
|
||||
long BASEL = (long)BASE;
|
||||
long sum1;
|
||||
long sum2;
|
||||
long rem; // unsigned int
|
||||
|
||||
rem = len2 % BASEL;
|
||||
sum1 = adler1 & 0xffffL;
|
||||
sum2 = rem * sum1;
|
||||
sum2 %= BASEL; // MOD(sum2);
|
||||
sum1 += (adler2 & 0xffffL) + BASEL - 1;
|
||||
sum2 += ((adler1 >> 16) & 0xffffL) + ((adler2 >> 16) & 0xffffL) + BASEL - rem;
|
||||
if (sum1 >= BASEL) sum1 -= BASEL;
|
||||
if (sum1 >= BASEL) sum1 -= BASEL;
|
||||
if (sum2 >= (BASEL << 1)) sum2 -= (BASEL << 1);
|
||||
if (sum2 >= BASEL) sum2 -= BASEL;
|
||||
return sum1 | (sum2 << 16);
|
||||
}
|
||||
|
||||
}
|
@ -1,157 +0,0 @@
|
||||
/* -*-mode:java; c-basic-offset:2; -*- */
|
||||
/*
|
||||
Copyright (c) 2011 ymnk, JCraft,Inc. All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are met:
|
||||
|
||||
1. Redistributions of source code must retain the above copyright notice,
|
||||
this list of conditions and the following disclaimer.
|
||||
|
||||
2. Redistributions in binary form must reproduce the above copyright
|
||||
notice, this list of conditions and the following disclaimer in
|
||||
the documentation and/or other materials provided with the distribution.
|
||||
|
||||
3. The names of the authors may not be used to endorse or promote products
|
||||
derived from this software without specific prior written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
|
||||
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
||||
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
|
||||
INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||||
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
|
||||
OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||||
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||||
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
|
||||
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
/*
|
||||
* This program is based on zlib-1.1.3, so all credit should go authors
|
||||
* Jean-loup Gailly(jloup@gzip.org) and Mark Adler(madler@alumni.caltech.edu)
|
||||
* and contributors of zlib.
|
||||
*/
|
||||
|
||||
package com.jcraft.jzlib;
|
||||
|
||||
final public class CRC32 implements Checksum {
|
||||
|
||||
/*
|
||||
* The following logic has come from RFC1952.
|
||||
*/
|
||||
private int v = 0;
|
||||
private static int[] crc_table = null;
|
||||
static {
|
||||
crc_table = new int[256];
|
||||
for (int n = 0; n < 256; n++) {
|
||||
int c = n;
|
||||
for (int k = 8; --k >= 0; ) {
|
||||
if ((c & 1) != 0)
|
||||
c = 0xedb88320 ^ (c >>> 1);
|
||||
else
|
||||
c = c >>> 1;
|
||||
}
|
||||
crc_table[n] = c;
|
||||
}
|
||||
}
|
||||
|
||||
public void update (byte[] buf, int index, int len) {
|
||||
int c = ~v;
|
||||
while (--len >= 0)
|
||||
c = crc_table[(c^buf[index++])&0xff]^(c >>> 8);
|
||||
v = ~c;
|
||||
}
|
||||
|
||||
public void reset(){
|
||||
v = 0;
|
||||
}
|
||||
|
||||
public void reset(long vv){
|
||||
v = (int)(vv&0xffffffffL);
|
||||
}
|
||||
|
||||
public long getValue(){
|
||||
return (long)(v&0xffffffffL);
|
||||
}
|
||||
|
||||
// The following logic has come from zlib.1.2.
|
||||
private static final int GF2_DIM = 32;
|
||||
static long combine(long crc1, long crc2, long len2){
|
||||
long row;
|
||||
long[] even = new long[GF2_DIM];
|
||||
long[] odd = new long[GF2_DIM];
|
||||
|
||||
// degenerate case (also disallow negative lengths)
|
||||
if (len2 <= 0)
|
||||
return crc1;
|
||||
|
||||
// put operator for one zero bit in odd
|
||||
odd[0] = 0xedb88320L; // CRC-32 polynomial
|
||||
row = 1;
|
||||
for (int n = 1; n < GF2_DIM; n++) {
|
||||
odd[n] = row;
|
||||
row <<= 1;
|
||||
}
|
||||
|
||||
// put operator for two zero bits in even
|
||||
gf2_matrix_square(even, odd);
|
||||
|
||||
// put operator for four zero bits in odd
|
||||
gf2_matrix_square(odd, even);
|
||||
|
||||
// apply len2 zeros to crc1 (first square will put the operator for one
|
||||
// zero byte, eight zero bits, in even)
|
||||
do {
|
||||
// apply zeros operator for this bit of len2
|
||||
gf2_matrix_square(even, odd);
|
||||
if ((len2 & 1)!=0)
|
||||
crc1 = gf2_matrix_times(even, crc1);
|
||||
len2 >>= 1;
|
||||
|
||||
// if no more bits set, then done
|
||||
if (len2 == 0)
|
||||
break;
|
||||
|
||||
// another iteration of the loop with odd and even swapped
|
||||
gf2_matrix_square(odd, even);
|
||||
if ((len2 & 1)!=0)
|
||||
crc1 = gf2_matrix_times(odd, crc1);
|
||||
len2 >>= 1;
|
||||
|
||||
// if no more bits set, then done
|
||||
} while (len2 != 0);
|
||||
|
||||
/* return combined crc */
|
||||
crc1 ^= crc2;
|
||||
return crc1;
|
||||
}
|
||||
|
||||
private static long gf2_matrix_times(long[] mat, long vec){
|
||||
long sum = 0;
|
||||
int index = 0;
|
||||
while (vec!=0) {
|
||||
if ((vec & 1)!=0)
|
||||
sum ^= mat[index];
|
||||
vec >>= 1;
|
||||
index++;
|
||||
}
|
||||
return sum;
|
||||
}
|
||||
|
||||
static final void gf2_matrix_square(long[] square, long[] mat) {
|
||||
for (int n = 0; n < GF2_DIM; n++)
|
||||
square[n] = gf2_matrix_times(mat, mat[n]);
|
||||
}
|
||||
|
||||
public CRC32 copy(){
|
||||
CRC32 foo = new CRC32();
|
||||
foo.v = this.v;
|
||||
return foo;
|
||||
}
|
||||
|
||||
public static int[] getCRC32Table(){
|
||||
int[] tmp = new int[crc_table.length];
|
||||
System.arraycopy(crc_table, 0, tmp, 0, tmp.length);
|
||||
return tmp;
|
||||
}
|
||||
}
|
@ -1,43 +0,0 @@
|
||||
/* -*-mode:java; c-basic-offset:2; -*- */
|
||||
/*
|
||||
Copyright (c) 2011 ymnk, JCraft,Inc. All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are met:
|
||||
|
||||
1. Redistributions of source code must retain the above copyright notice,
|
||||
this list of conditions and the following disclaimer.
|
||||
|
||||
2. Redistributions in binary form must reproduce the above copyright
|
||||
notice, this list of conditions and the following disclaimer in
|
||||
the documentation and/or other materials provided with the distribution.
|
||||
|
||||
3. The names of the authors may not be used to endorse or promote products
|
||||
derived from this software without specific prior written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
|
||||
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
||||
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
|
||||
INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||||
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
|
||||
OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||||
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||||
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
|
||||
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
/*
|
||||
* This program is based on zlib-1.1.3, so all credit should go authors
|
||||
* Jean-loup Gailly(jloup@gzip.org) and Mark Adler(madler@alumni.caltech.edu)
|
||||
* and contributors of zlib.
|
||||
*/
|
||||
|
||||
package com.jcraft.jzlib;
|
||||
|
||||
interface Checksum {
|
||||
void update(byte[] buf, int index, int len);
|
||||
void reset();
|
||||
void reset(long init);
|
||||
long getValue();
|
||||
Checksum copy();
|
||||
}
|
File diff suppressed because it is too large
Load Diff
@ -1,171 +0,0 @@
|
||||
/* -*-mode:java; c-basic-offset:2; indent-tabs-mode:nil -*- */
|
||||
/*
|
||||
Copyright (c) 2011 ymnk, JCraft,Inc. All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are met:
|
||||
|
||||
1. Redistributions of source code must retain the above copyright notice,
|
||||
this list of conditions and the following disclaimer.
|
||||
|
||||
2. Redistributions in binary form must reproduce the above copyright
|
||||
notice, this list of conditions and the following disclaimer in
|
||||
the documentation and/or other materials provided with the distribution.
|
||||
|
||||
3. The names of the authors may not be used to endorse or promote products
|
||||
derived from this software without specific prior written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
|
||||
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
||||
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
|
||||
INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||||
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
|
||||
OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||||
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||||
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
|
||||
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
/*
|
||||
* This program is based on zlib-1.1.3, so all credit should go authors
|
||||
* Jean-loup Gailly(jloup@gzip.org) and Mark Adler(madler@alumni.caltech.edu)
|
||||
* and contributors of zlib.
|
||||
*/
|
||||
|
||||
package com.jcraft.jzlib;
|
||||
|
||||
final public class Deflater extends ZStream{
|
||||
|
||||
static final private int MAX_WBITS=15; // 32K LZ77 window
|
||||
static final private int DEF_WBITS=MAX_WBITS;
|
||||
|
||||
static final private int Z_NO_FLUSH=0;
|
||||
static final private int Z_PARTIAL_FLUSH=1;
|
||||
static final private int Z_SYNC_FLUSH=2;
|
||||
static final private int Z_FULL_FLUSH=3;
|
||||
static final private int Z_FINISH=4;
|
||||
|
||||
static final private int MAX_MEM_LEVEL=9;
|
||||
|
||||
static final private int Z_OK=0;
|
||||
static final private int Z_STREAM_END=1;
|
||||
static final private int Z_NEED_DICT=2;
|
||||
static final private int Z_ERRNO=-1;
|
||||
static final private int Z_STREAM_ERROR=-2;
|
||||
static final private int Z_DATA_ERROR=-3;
|
||||
static final private int Z_MEM_ERROR=-4;
|
||||
static final private int Z_BUF_ERROR=-5;
|
||||
static final private int Z_VERSION_ERROR=-6;
|
||||
|
||||
private boolean finished = false;
|
||||
|
||||
public Deflater(){
|
||||
super();
|
||||
}
|
||||
|
||||
public Deflater(int level) throws GZIPException {
|
||||
this(level, MAX_WBITS);
|
||||
}
|
||||
|
||||
public Deflater(int level, boolean nowrap) throws GZIPException {
|
||||
this(level, MAX_WBITS, nowrap);
|
||||
}
|
||||
|
||||
public Deflater(int level, int bits) throws GZIPException {
|
||||
this(level, bits, false);
|
||||
}
|
||||
|
||||
public Deflater(int level, int bits, boolean nowrap) throws GZIPException {
|
||||
super();
|
||||
int ret = init(level, bits, nowrap);
|
||||
if(ret!=Z_OK)
|
||||
throw new GZIPException(ret+": "+msg);
|
||||
}
|
||||
|
||||
public Deflater(int level, int bits, int memlevel, JZlib.WrapperType wrapperType) throws GZIPException {
|
||||
super();
|
||||
int ret = init(level, bits, memlevel, wrapperType);
|
||||
if(ret!=Z_OK)
|
||||
throw new GZIPException(ret+": "+msg);
|
||||
}
|
||||
|
||||
public Deflater(int level, int bits, int memlevel) throws GZIPException {
|
||||
super();
|
||||
int ret = init(level, bits, memlevel);
|
||||
if(ret!=Z_OK)
|
||||
throw new GZIPException(ret+": "+msg);
|
||||
}
|
||||
|
||||
public int init(int level){
|
||||
return init(level, MAX_WBITS);
|
||||
}
|
||||
public int init(int level, boolean nowrap){
|
||||
return init(level, MAX_WBITS, nowrap);
|
||||
}
|
||||
public int init(int level, int bits){
|
||||
return init(level, bits, false);
|
||||
}
|
||||
public int init(int level, int bits, int memlevel, JZlib.WrapperType wrapperType){
|
||||
if(bits < 9 || bits > 15){
|
||||
return Z_STREAM_ERROR;
|
||||
}
|
||||
if(wrapperType == JZlib.W_NONE) {
|
||||
bits *= -1;
|
||||
}
|
||||
else if(wrapperType == JZlib.W_GZIP) {
|
||||
bits += 16;
|
||||
}
|
||||
else if(wrapperType == JZlib.W_ANY) {
|
||||
return Z_STREAM_ERROR;
|
||||
}
|
||||
else if(wrapperType == JZlib.W_ZLIB) {
|
||||
}
|
||||
return init(level, bits, memlevel);
|
||||
}
|
||||
public int init(int level, int bits, int memlevel){
|
||||
finished = false;
|
||||
dstate=new Deflate(this);
|
||||
return dstate.deflateInit(level, bits, memlevel);
|
||||
}
|
||||
public int init(int level, int bits, boolean nowrap){
|
||||
finished = false;
|
||||
dstate=new Deflate(this);
|
||||
return dstate.deflateInit(level, nowrap?-bits:bits);
|
||||
}
|
||||
|
||||
public int deflate(int flush){
|
||||
if(dstate==null){
|
||||
return Z_STREAM_ERROR;
|
||||
}
|
||||
int ret = dstate.deflate(flush);
|
||||
if(ret == Z_STREAM_END)
|
||||
finished = true;
|
||||
return ret;
|
||||
}
|
||||
public int end(){
|
||||
finished = true;
|
||||
if(dstate==null) return Z_STREAM_ERROR;
|
||||
int ret=dstate.deflateEnd();
|
||||
dstate=null;
|
||||
free();
|
||||
return ret;
|
||||
}
|
||||
public int params(int level, int strategy){
|
||||
if(dstate==null) return Z_STREAM_ERROR;
|
||||
return dstate.deflateParams(level, strategy);
|
||||
}
|
||||
public int setDictionary (byte[] dictionary, int dictLength){
|
||||
if(dstate == null)
|
||||
return Z_STREAM_ERROR;
|
||||
return dstate.deflateSetDictionary(dictionary, dictLength);
|
||||
}
|
||||
|
||||
public boolean finished(){
|
||||
return finished;
|
||||
}
|
||||
|
||||
public int copy(Deflater src){
|
||||
this.finished = src.finished;
|
||||
return Deflate.deflateCopy(this, src);
|
||||
}
|
||||
}
|
@ -1,181 +0,0 @@
|
||||
/* -*-mode:java; c-basic-offset:2; indent-tabs-mode:nil -*- */
|
||||
/*
|
||||
Copyright (c) 2011 ymnk, JCraft,Inc. All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are met:
|
||||
|
||||
1. Redistributions of source code must retain the above copyright notice,
|
||||
this list of conditions and the following disclaimer.
|
||||
|
||||
2. Redistributions in binary form must reproduce the above copyright
|
||||
notice, this list of conditions and the following disclaimer in
|
||||
the documentation and/or other materials provided with the distribution.
|
||||
|
||||
3. The names of the authors may not be used to endorse or promote products
|
||||
derived from this software without specific prior written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
|
||||
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
||||
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
|
||||
INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||||
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
|
||||
OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||||
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||||
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
|
||||
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
package com.jcraft.jzlib;
|
||||
import java.io.*;
|
||||
|
||||
public class DeflaterOutputStream extends FilterOutputStream {
|
||||
|
||||
protected final Deflater deflater;
|
||||
|
||||
protected byte[] buffer;
|
||||
|
||||
private boolean closed = false;
|
||||
|
||||
private boolean syncFlush = false;
|
||||
|
||||
private final byte[] buf1 = new byte[1];
|
||||
|
||||
protected boolean mydeflater = false;
|
||||
|
||||
private boolean close_out = true;
|
||||
|
||||
protected static final int DEFAULT_BUFSIZE = 512;
|
||||
|
||||
public DeflaterOutputStream(OutputStream out) throws IOException {
|
||||
this(out,
|
||||
new Deflater(JZlib.Z_DEFAULT_COMPRESSION),
|
||||
DEFAULT_BUFSIZE, true);
|
||||
mydeflater = true;
|
||||
}
|
||||
|
||||
public DeflaterOutputStream(OutputStream out, Deflater def) throws IOException {
|
||||
this(out, def, DEFAULT_BUFSIZE, true);
|
||||
}
|
||||
|
||||
public DeflaterOutputStream(OutputStream out,
|
||||
Deflater deflater,
|
||||
int size) throws IOException {
|
||||
this(out, deflater, size, true);
|
||||
}
|
||||
public DeflaterOutputStream(OutputStream out,
|
||||
Deflater deflater,
|
||||
int size,
|
||||
boolean close_out) throws IOException {
|
||||
super(out);
|
||||
if (out == null || deflater == null) {
|
||||
throw new NullPointerException();
|
||||
}
|
||||
else if (size <= 0) {
|
||||
throw new IllegalArgumentException("buffer size must be greater than 0");
|
||||
}
|
||||
this.deflater = deflater;
|
||||
buffer = new byte[size];
|
||||
this.close_out = close_out;
|
||||
}
|
||||
|
||||
public void write(int b) throws IOException {
|
||||
buf1[0] = (byte)(b & 0xff);
|
||||
write(buf1, 0, 1);
|
||||
}
|
||||
|
||||
public void write(byte[] b, int off, int len) throws IOException {
|
||||
if (deflater.finished()) {
|
||||
throw new IOException("finished");
|
||||
}
|
||||
else if (off<0 | len<0 | off+len>b.length) {
|
||||
throw new IndexOutOfBoundsException();
|
||||
}
|
||||
else if (len == 0) {
|
||||
return;
|
||||
}
|
||||
else {
|
||||
int flush = syncFlush ? JZlib.Z_SYNC_FLUSH : JZlib.Z_NO_FLUSH;
|
||||
deflater.setInput(b, off, len, true);
|
||||
while (deflater.avail_in>0) {
|
||||
int err = deflate(flush);
|
||||
if (err == JZlib.Z_STREAM_END)
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
public void finish() throws IOException {
|
||||
while (!deflater.finished()) {
|
||||
deflate(JZlib.Z_FINISH);
|
||||
}
|
||||
}
|
||||
|
||||
public void close() throws IOException {
|
||||
if (!closed) {
|
||||
finish();
|
||||
if (mydeflater){
|
||||
deflater.end();
|
||||
}
|
||||
if(close_out)
|
||||
out.close();
|
||||
closed = true;
|
||||
}
|
||||
}
|
||||
|
||||
protected int deflate(int flush) throws IOException {
|
||||
deflater.setOutput(buffer, 0, buffer.length);
|
||||
int err = deflater.deflate(flush);
|
||||
switch(err) {
|
||||
case JZlib.Z_OK:
|
||||
case JZlib.Z_STREAM_END:
|
||||
break;
|
||||
case JZlib.Z_BUF_ERROR:
|
||||
if(deflater.avail_in<=0 && flush!=JZlib.Z_FINISH){
|
||||
// flush() without any data
|
||||
break;
|
||||
}
|
||||
default:
|
||||
throw new IOException("failed to deflate: error="+err+" avail_out="+deflater.avail_out);
|
||||
}
|
||||
int len = deflater.next_out_index;
|
||||
if (len > 0) {
|
||||
out.write(buffer, 0, len);
|
||||
}
|
||||
return err;
|
||||
}
|
||||
|
||||
public void flush() throws IOException {
|
||||
if (syncFlush && !deflater.finished()) {
|
||||
while (true) {
|
||||
int err = deflate(JZlib.Z_SYNC_FLUSH);
|
||||
if (deflater.next_out_index < buffer.length)
|
||||
break;
|
||||
if (err == JZlib.Z_STREAM_END)
|
||||
break;
|
||||
}
|
||||
}
|
||||
out.flush();
|
||||
}
|
||||
|
||||
public long getTotalIn() {
|
||||
return deflater.getTotalIn();
|
||||
}
|
||||
|
||||
public long getTotalOut() {
|
||||
return deflater.getTotalOut();
|
||||
}
|
||||
|
||||
public void setSyncFlush(boolean syncFlush){
|
||||
this.syncFlush = syncFlush;
|
||||
}
|
||||
|
||||
public boolean getSyncFlush(){
|
||||
return this.syncFlush;
|
||||
}
|
||||
|
||||
public Deflater getDeflater(){
|
||||
return deflater;
|
||||
}
|
||||
}
|
@ -1,44 +0,0 @@
|
||||
/* -*-mode:java; c-basic-offset:2; -*- */
|
||||
/*
|
||||
Copyright (c) 2011 ymnk, JCraft,Inc. All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are met:
|
||||
|
||||
1. Redistributions of source code must retain the above copyright notice,
|
||||
this list of conditions and the following disclaimer.
|
||||
|
||||
2. Redistributions in binary form must reproduce the above copyright
|
||||
notice, this list of conditions and the following disclaimer in
|
||||
the documentation and/or other materials provided with the distribution.
|
||||
|
||||
3. The names of the authors may not be used to endorse or promote products
|
||||
derived from this software without specific prior written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
|
||||
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
||||
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
|
||||
INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||||
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
|
||||
OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||||
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||||
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
|
||||
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
/*
|
||||
* This program is based on zlib-1.1.3, so all credit should go authors
|
||||
* Jean-loup Gailly(jloup@gzip.org) and Mark Adler(madler@alumni.caltech.edu)
|
||||
* and contributors of zlib.
|
||||
*/
|
||||
|
||||
package com.jcraft.jzlib;
|
||||
|
||||
public class GZIPException extends java.io.IOException {
|
||||
public GZIPException() {
|
||||
super();
|
||||
}
|
||||
public GZIPException(String s) {
|
||||
super(s);
|
||||
}
|
||||
}
|
@ -1,214 +0,0 @@
|
||||
/* -*-mode:java; c-basic-offset:2; -*- */
|
||||
/*
|
||||
Copyright (c) 2011 ymnk, JCraft,Inc. All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are met:
|
||||
|
||||
1. Redistributions of source code must retain the above copyright notice,
|
||||
this list of conditions and the following disclaimer.
|
||||
|
||||
2. Redistributions in binary form must reproduce the above copyright
|
||||
notice, this list of conditions and the following disclaimer in
|
||||
the documentation and/or other materials provided with the distribution.
|
||||
|
||||
3. The names of the authors may not be used to endorse or promote products
|
||||
derived from this software without specific prior written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
|
||||
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
||||
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
|
||||
INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||||
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
|
||||
OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||||
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||||
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
|
||||
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
/*
|
||||
* This program is based on zlib-1.1.3, so all credit should go authors
|
||||
* Jean-loup Gailly(jloup@gzip.org) and Mark Adler(madler@alumni.caltech.edu)
|
||||
* and contributors of zlib.
|
||||
*/
|
||||
|
||||
package com.jcraft.jzlib;
|
||||
|
||||
import java.io.UnsupportedEncodingException;
|
||||
|
||||
/**
|
||||
* @see "http://www.ietf.org/rfc/rfc1952.txt"
|
||||
*/
|
||||
public class GZIPHeader implements Cloneable {
|
||||
|
||||
public static final byte OS_MSDOS = (byte) 0x00;
|
||||
public static final byte OS_AMIGA = (byte) 0x01;
|
||||
public static final byte OS_VMS = (byte) 0x02;
|
||||
public static final byte OS_UNIX = (byte) 0x03;
|
||||
public static final byte OS_ATARI = (byte) 0x05;
|
||||
public static final byte OS_OS2 = (byte) 0x06;
|
||||
public static final byte OS_MACOS = (byte) 0x07;
|
||||
public static final byte OS_TOPS20 = (byte) 0x0a;
|
||||
public static final byte OS_WIN32 = (byte) 0x0b;
|
||||
public static final byte OS_VMCMS = (byte) 0x04;
|
||||
public static final byte OS_ZSYSTEM = (byte) 0x08;
|
||||
public static final byte OS_CPM = (byte) 0x09;
|
||||
public static final byte OS_QDOS = (byte) 0x0c;
|
||||
public static final byte OS_RISCOS = (byte) 0x0d;
|
||||
public static final byte OS_UNKNOWN = (byte) 0xff;
|
||||
|
||||
boolean text = false;
|
||||
private boolean fhcrc = false;
|
||||
long time;
|
||||
int xflags;
|
||||
int os = 255;
|
||||
byte[] extra;
|
||||
byte[] name;
|
||||
byte[] comment;
|
||||
int hcrc;
|
||||
long crc;
|
||||
boolean done = false;
|
||||
long mtime = 0;
|
||||
|
||||
public void setModifiedTime(long mtime) {
|
||||
this.mtime = mtime;
|
||||
}
|
||||
|
||||
public long getModifiedTime() {
|
||||
return mtime;
|
||||
}
|
||||
|
||||
public void setOS(int os) {
|
||||
if((0<=os && os <=13) || os==255)
|
||||
this.os=os;
|
||||
else
|
||||
throw new IllegalArgumentException("os: "+os);
|
||||
}
|
||||
|
||||
public int getOS(){
|
||||
return os;
|
||||
}
|
||||
|
||||
public void setName(String name) {
|
||||
try{
|
||||
this.name=name.getBytes("ISO-8859-1");
|
||||
}
|
||||
catch(UnsupportedEncodingException e){
|
||||
throw new IllegalArgumentException("name must be in ISO-8859-1 "+name);
|
||||
}
|
||||
}
|
||||
|
||||
public String getName(){
|
||||
if(name==null) return "";
|
||||
try {
|
||||
return new String(name, "ISO-8859-1");
|
||||
}
|
||||
catch (UnsupportedEncodingException e) {
|
||||
throw new InternalError(e.toString());
|
||||
}
|
||||
}
|
||||
|
||||
public void setComment(String comment) {
|
||||
try{
|
||||
this.comment=comment.getBytes("ISO-8859-1");
|
||||
}
|
||||
catch(UnsupportedEncodingException e){
|
||||
throw new IllegalArgumentException("comment must be in ISO-8859-1 "+name);
|
||||
}
|
||||
}
|
||||
|
||||
public String getComment(){
|
||||
if(comment==null) return "";
|
||||
try {
|
||||
return new String(comment, "ISO-8859-1");
|
||||
}
|
||||
catch (UnsupportedEncodingException e) {
|
||||
throw new InternalError(e.toString());
|
||||
}
|
||||
}
|
||||
|
||||
public void setCRC(long crc){
|
||||
this.crc = crc;
|
||||
}
|
||||
|
||||
public long getCRC(){
|
||||
return crc;
|
||||
}
|
||||
|
||||
void put(Deflate d){
|
||||
int flag = 0;
|
||||
if(text){
|
||||
flag |= 1; // FTEXT
|
||||
}
|
||||
if(fhcrc){
|
||||
flag |= 2; // FHCRC
|
||||
}
|
||||
if(extra!=null){
|
||||
flag |= 4; // FEXTRA
|
||||
}
|
||||
if(name!=null){
|
||||
flag |= 8; // FNAME
|
||||
}
|
||||
if(comment!=null){
|
||||
flag |= 16; // FCOMMENT
|
||||
}
|
||||
int xfl = 0;
|
||||
if(d.level == JZlib.Z_BEST_SPEED){
|
||||
xfl |= 4;
|
||||
}
|
||||
else if (d.level == JZlib.Z_BEST_COMPRESSION){
|
||||
xfl |= 2;
|
||||
}
|
||||
|
||||
d.put_short((short)0x8b1f); // ID1 ID2
|
||||
d.put_byte((byte)8); // CM(Compression Method)
|
||||
d.put_byte((byte)flag);
|
||||
d.put_byte((byte)mtime);
|
||||
d.put_byte((byte)(mtime>>8));
|
||||
d.put_byte((byte)(mtime>>16));
|
||||
d.put_byte((byte)(mtime>>24));
|
||||
d.put_byte((byte)xfl);
|
||||
d.put_byte((byte)os);
|
||||
|
||||
if(extra!=null){
|
||||
d.put_byte((byte)extra.length);
|
||||
d.put_byte((byte)(extra.length>>8));
|
||||
d.put_byte(extra, 0, extra.length);
|
||||
}
|
||||
|
||||
if(name!=null){
|
||||
d.put_byte(name, 0, name.length);
|
||||
d.put_byte((byte)0);
|
||||
}
|
||||
|
||||
if(comment!=null){
|
||||
d.put_byte(comment, 0, comment.length);
|
||||
d.put_byte((byte)0);
|
||||
}
|
||||
}
|
||||
|
||||
@Override
|
||||
public Object clone() throws CloneNotSupportedException {
|
||||
GZIPHeader gheader = (GZIPHeader)super.clone();
|
||||
byte[] tmp;
|
||||
if(gheader.extra!=null){
|
||||
tmp=new byte[gheader.extra.length];
|
||||
System.arraycopy(gheader.extra, 0, tmp, 0, tmp.length);
|
||||
gheader.extra = tmp;
|
||||
}
|
||||
|
||||
if(gheader.name!=null){
|
||||
tmp=new byte[gheader.name.length];
|
||||
System.arraycopy(gheader.name, 0, tmp, 0, tmp.length);
|
||||
gheader.name = tmp;
|
||||
}
|
||||
|
||||
if(gheader.comment!=null){
|
||||
tmp=new byte[gheader.comment.length];
|
||||
System.arraycopy(gheader.comment, 0, tmp, 0, tmp.length);
|
||||
gheader.comment = tmp;
|
||||
}
|
||||
|
||||
return gheader;
|
||||
}
|
||||
}
|
@ -1,145 +0,0 @@
|
||||
/* -*-mode:java; c-basic-offset:2; indent-tabs-mode:nil -*- */
|
||||
/*
|
||||
Copyright (c) 2011 ymnk, JCraft,Inc. All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are met:
|
||||
|
||||
1. Redistributions of source code must retain the above copyright notice,
|
||||
this list of conditions and the following disclaimer.
|
||||
|
||||
2. Redistributions in binary form must reproduce the above copyright
|
||||
notice, this list of conditions and the following disclaimer in
|
||||
the documentation and/or other materials provided with the distribution.
|
||||
|
||||
3. The names of the authors may not be used to endorse or promote products
|
||||
derived from this software without specific prior written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
|
||||
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
||||
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
|
||||
INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||||
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
|
||||
OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||||
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||||
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
|
||||
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
package com.jcraft.jzlib;
|
||||
import java.io.*;
|
||||
|
||||
public class GZIPInputStream extends InflaterInputStream {
|
||||
|
||||
public GZIPInputStream(InputStream in) throws IOException {
|
||||
this(in, DEFAULT_BUFSIZE, true);
|
||||
}
|
||||
|
||||
public GZIPInputStream(InputStream in,
|
||||
int size,
|
||||
boolean close_in) throws IOException {
|
||||
this(in, new Inflater(15+16), size, close_in);
|
||||
myinflater = true;
|
||||
}
|
||||
|
||||
public GZIPInputStream(InputStream in,
|
||||
Inflater inflater,
|
||||
int size,
|
||||
boolean close_in) throws IOException {
|
||||
super(in, inflater, size, close_in);
|
||||
}
|
||||
|
||||
public long getModifiedtime() {
|
||||
return inflater.istate.getGZIPHeader().getModifiedTime();
|
||||
}
|
||||
|
||||
public int getOS() {
|
||||
return inflater.istate.getGZIPHeader().getOS();
|
||||
}
|
||||
|
||||
public String getName() {
|
||||
return inflater.istate.getGZIPHeader().getName();
|
||||
}
|
||||
|
||||
public String getComment() {
|
||||
return inflater.istate.getGZIPHeader().getComment();
|
||||
}
|
||||
|
||||
public long getCRC() throws GZIPException {
|
||||
if(inflater.istate.mode != 12 /*DONE*/)
|
||||
throw new GZIPException("checksum is not calculated yet.");
|
||||
return inflater.istate.getGZIPHeader().getCRC();
|
||||
}
|
||||
|
||||
public void readHeader() throws IOException {
|
||||
|
||||
byte[] empty = "".getBytes();
|
||||
inflater.setOutput(empty, 0, 0);
|
||||
inflater.setInput(empty, 0, 0, false);
|
||||
|
||||
byte[] b = new byte[10];
|
||||
|
||||
int n = fill(b);
|
||||
if(n!=10){
|
||||
if(n>0){
|
||||
inflater.setInput(b, 0, n, false);
|
||||
//inflater.next_in_index = n;
|
||||
inflater.next_in_index = 0;
|
||||
inflater.avail_in = n;
|
||||
}
|
||||
throw new IOException("no input");
|
||||
}
|
||||
|
||||
inflater.setInput(b, 0, n, false);
|
||||
|
||||
byte[] b1 = new byte[1];
|
||||
do{
|
||||
if(inflater.avail_in<=0){
|
||||
int i = in.read(b1);
|
||||
if(i<=0)
|
||||
throw new IOException("no input");
|
||||
inflater.setInput(b1, 0, 1, true);
|
||||
}
|
||||
|
||||
int err = inflater.inflate(JZlib.Z_NO_FLUSH);
|
||||
|
||||
if(err!=0/*Z_OK*/){
|
||||
int len = 2048-inflater.next_in.length;
|
||||
if(len>0){
|
||||
byte[] tmp = new byte[len];
|
||||
n = fill(tmp);
|
||||
if(n>0){
|
||||
inflater.avail_in += inflater.next_in_index;
|
||||
inflater.next_in_index = 0;
|
||||
inflater.setInput(tmp, 0, n, true);
|
||||
}
|
||||
}
|
||||
//inflater.next_in_index = inflater.next_in.length;
|
||||
inflater.avail_in += inflater.next_in_index;
|
||||
inflater.next_in_index = 0;
|
||||
throw new IOException(inflater.msg);
|
||||
}
|
||||
}
|
||||
while(inflater.istate.inParsingHeader());
|
||||
}
|
||||
|
||||
private int fill(byte[] buf) {
|
||||
int len = buf.length;
|
||||
int n = 0;
|
||||
do{
|
||||
int i = -1;
|
||||
try {
|
||||
i = in.read(buf, n, buf.length - n);
|
||||
}
|
||||
catch(IOException e){
|
||||
}
|
||||
if(i == -1){
|
||||
break;
|
||||
}
|
||||
n+=i;
|
||||
}
|
||||
while(n<len);
|
||||
return n;
|
||||
}
|
||||
}
|
@ -1,90 +0,0 @@
|
||||
/* -*-mode:java; c-basic-offset:2; indent-tabs-mode:nil -*- */
|
||||
/*
|
||||
Copyright (c) 2011 ymnk, JCraft,Inc. All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are met:
|
||||
|
||||
1. Redistributions of source code must retain the above copyright notice,
|
||||
this list of conditions and the following disclaimer.
|
||||
|
||||
2. Redistributions in binary form must reproduce the above copyright
|
||||
notice, this list of conditions and the following disclaimer in
|
||||
the documentation and/or other materials provided with the distribution.
|
||||
|
||||
3. The names of the authors may not be used to endorse or promote products
|
||||
derived from this software without specific prior written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
|
||||
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
||||
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
|
||||
INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||||
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
|
||||
OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||||
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||||
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
|
||||
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
package com.jcraft.jzlib;
|
||||
import java.io.*;
|
||||
|
||||
public class GZIPOutputStream extends DeflaterOutputStream {
|
||||
|
||||
public GZIPOutputStream(OutputStream out) throws IOException {
|
||||
this(out, DEFAULT_BUFSIZE);
|
||||
}
|
||||
|
||||
public GZIPOutputStream(OutputStream out, int size) throws IOException {
|
||||
this(out, size, true);
|
||||
}
|
||||
|
||||
public GZIPOutputStream(OutputStream out,
|
||||
int size,
|
||||
boolean close_out) throws IOException {
|
||||
this(out,
|
||||
new Deflater(JZlib.Z_DEFAULT_COMPRESSION, 15+16),
|
||||
size, close_out);
|
||||
mydeflater=true;
|
||||
}
|
||||
|
||||
public GZIPOutputStream(OutputStream out,
|
||||
Deflater deflater,
|
||||
int size,
|
||||
boolean close_out) throws IOException{
|
||||
super(out, deflater, size, close_out);
|
||||
}
|
||||
|
||||
|
||||
private void check() throws GZIPException {
|
||||
if(deflater.dstate.status != 42 /*INIT_STATUS*/)
|
||||
throw new GZIPException("header is already written.");
|
||||
}
|
||||
|
||||
public void setModifiedTime(long mtime) throws GZIPException {
|
||||
check();
|
||||
deflater.dstate.getGZIPHeader().setModifiedTime(mtime);
|
||||
}
|
||||
|
||||
public void setOS(int os) throws GZIPException {
|
||||
check();
|
||||
deflater.dstate.getGZIPHeader().setOS(os);
|
||||
}
|
||||
|
||||
public void setName(String name) throws GZIPException {
|
||||
check();
|
||||
deflater.dstate.getGZIPHeader().setName(name);
|
||||
}
|
||||
|
||||
public void setComment(String comment) throws GZIPException {
|
||||
check();
|
||||
deflater.dstate.getGZIPHeader().setComment(comment);
|
||||
}
|
||||
|
||||
public long getCRC() throws GZIPException {
|
||||
if(deflater.dstate.status != 666 /*FINISH_STATE*/)
|
||||
throw new GZIPException("checksum is not calculated yet.");
|
||||
return deflater.dstate.getGZIPHeader().getCRC();
|
||||
}
|
||||
}
|
@ -1,614 +0,0 @@
|
||||
/* -*-mode:java; c-basic-offset:2; -*- */
|
||||
/*
|
||||
Copyright (c) 2011 ymnk, JCraft,Inc. All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are met:
|
||||
|
||||
1. Redistributions of source code must retain the above copyright notice,
|
||||
this list of conditions and the following disclaimer.
|
||||
|
||||
2. Redistributions in binary form must reproduce the above copyright
|
||||
notice, this list of conditions and the following disclaimer in
|
||||
the documentation and/or other materials provided with the distribution.
|
||||
|
||||
3. The names of the authors may not be used to endorse or promote products
|
||||
derived from this software without specific prior written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
|
||||
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
||||
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
|
||||
INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||||
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
|
||||
OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||||
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||||
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
|
||||
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
/*
|
||||
* This program is based on zlib-1.1.3, so all credit should go authors
|
||||
* Jean-loup Gailly(jloup@gzip.org) and Mark Adler(madler@alumni.caltech.edu)
|
||||
* and contributors of zlib.
|
||||
*/
|
||||
|
||||
package com.jcraft.jzlib;
|
||||
|
||||
final class InfBlocks{
|
||||
static final private int MANY=1440;
|
||||
|
||||
// And'ing with mask[n] masks the lower n bits
|
||||
static final private int[] inflate_mask = {
|
||||
0x00000000, 0x00000001, 0x00000003, 0x00000007, 0x0000000f,
|
||||
0x0000001f, 0x0000003f, 0x0000007f, 0x000000ff, 0x000001ff,
|
||||
0x000003ff, 0x000007ff, 0x00000fff, 0x00001fff, 0x00003fff,
|
||||
0x00007fff, 0x0000ffff
|
||||
};
|
||||
|
||||
// Table for deflate from PKZIP's appnote.txt.
|
||||
static final int[] border = { // Order of the bit length code lengths
|
||||
16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15
|
||||
};
|
||||
|
||||
static final private int Z_OK=0;
|
||||
static final private int Z_STREAM_END=1;
|
||||
static final private int Z_NEED_DICT=2;
|
||||
static final private int Z_ERRNO=-1;
|
||||
static final private int Z_STREAM_ERROR=-2;
|
||||
static final private int Z_DATA_ERROR=-3;
|
||||
static final private int Z_MEM_ERROR=-4;
|
||||
static final private int Z_BUF_ERROR=-5;
|
||||
static final private int Z_VERSION_ERROR=-6;
|
||||
|
||||
static final private int TYPE=0; // get type bits (3, including end bit)
|
||||
static final private int LENS=1; // get lengths for stored
|
||||
static final private int STORED=2;// processing stored block
|
||||
static final private int TABLE=3; // get table lengths
|
||||
static final private int BTREE=4; // get bit lengths tree for a dynamic block
|
||||
static final private int DTREE=5; // get length, distance trees for a dynamic block
|
||||
static final private int CODES=6; // processing fixed or dynamic block
|
||||
static final private int DRY=7; // output remaining window bytes
|
||||
static final private int DONE=8; // finished last block, done
|
||||
static final private int BAD=9; // ot a data error--stuck here
|
||||
|
||||
int mode; // current inflate_block mode
|
||||
|
||||
int left; // if STORED, bytes left to copy
|
||||
|
||||
int table; // table lengths (14 bits)
|
||||
int index; // index into blens (or border)
|
||||
int[] blens; // bit lengths of codes
|
||||
int[] bb=new int[1]; // bit length tree depth
|
||||
int[] tb=new int[1]; // bit length decoding tree
|
||||
|
||||
int[] bl=new int[1];
|
||||
int[] bd=new int[1];
|
||||
|
||||
int[][] tl=new int[1][];
|
||||
int[][] td=new int[1][];
|
||||
int[] tli=new int[1]; // tl_index
|
||||
int[] tdi=new int[1]; // td_index
|
||||
|
||||
private final InfCodes codes; // if CODES, current state
|
||||
|
||||
int last; // true if this block is the last block
|
||||
|
||||
// mode independent information
|
||||
int bitk; // bits in bit buffer
|
||||
int bitb; // bit buffer
|
||||
int[] hufts; // single malloc for tree space
|
||||
byte[] window; // sliding window
|
||||
int end; // one byte after sliding window
|
||||
int read; // window read pointer
|
||||
int write; // window write pointer
|
||||
private boolean check;
|
||||
|
||||
private final InfTree inftree=new InfTree();
|
||||
|
||||
private final ZStream z;
|
||||
|
||||
InfBlocks(ZStream z, int w){
|
||||
this.z=z;
|
||||
this.codes=new InfCodes(this.z, this);
|
||||
hufts=new int[MANY*3];
|
||||
window=new byte[w];
|
||||
end=w;
|
||||
this.check = (z.istate.wrap==0) ? false : true;
|
||||
mode = TYPE;
|
||||
reset();
|
||||
}
|
||||
|
||||
void reset(){
|
||||
if(mode==BTREE || mode==DTREE){
|
||||
}
|
||||
if(mode==CODES){
|
||||
codes.free(z);
|
||||
}
|
||||
mode=TYPE;
|
||||
bitk=0;
|
||||
bitb=0;
|
||||
read=write=0;
|
||||
if(check){
|
||||
z.adler.reset();
|
||||
}
|
||||
}
|
||||
|
||||
int proc(int r){
|
||||
int t; // temporary storage
|
||||
int b; // bit buffer
|
||||
int k; // bits in bit buffer
|
||||
int p; // input data pointer
|
||||
int n; // bytes available there
|
||||
int q; // output window write pointer
|
||||
int m; // bytes to end of window or read pointer
|
||||
|
||||
// copy input/output information to locals (UPDATE macro restores)
|
||||
{p=z.next_in_index;n=z.avail_in;b=bitb;k=bitk;}
|
||||
{q=write;m=(int)(q<read?read-q-1:end-q);}
|
||||
|
||||
// process input based on current state
|
||||
while(true){
|
||||
switch (mode){
|
||||
case TYPE:
|
||||
|
||||
while(k<(3)){
|
||||
if(n!=0){
|
||||
r=Z_OK;
|
||||
}
|
||||
else{
|
||||
bitb=b; bitk=k;
|
||||
z.avail_in=n;
|
||||
z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
write=q;
|
||||
return inflate_flush(r);
|
||||
};
|
||||
n--;
|
||||
b|=(z.next_in[p++]&0xff)<<k;
|
||||
k+=8;
|
||||
}
|
||||
t = (int)(b & 7);
|
||||
last = t & 1;
|
||||
|
||||
switch (t >>> 1){
|
||||
case 0: // stored
|
||||
{b>>>=(3);k-=(3);}
|
||||
t = k & 7; // go to byte boundary
|
||||
|
||||
{b>>>=(t);k-=(t);}
|
||||
mode = LENS; // get length of stored block
|
||||
break;
|
||||
case 1: // fixed
|
||||
InfTree.inflate_trees_fixed(bl, bd, tl, td, z);
|
||||
codes.init(bl[0], bd[0], tl[0], 0, td[0], 0);
|
||||
|
||||
{b>>>=(3);k-=(3);}
|
||||
|
||||
mode = CODES;
|
||||
break;
|
||||
case 2: // dynamic
|
||||
|
||||
{b>>>=(3);k-=(3);}
|
||||
|
||||
mode = TABLE;
|
||||
break;
|
||||
case 3: // illegal
|
||||
|
||||
{b>>>=(3);k-=(3);}
|
||||
mode = BAD;
|
||||
z.msg = "invalid block type";
|
||||
r = Z_DATA_ERROR;
|
||||
|
||||
bitb=b; bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
write=q;
|
||||
return inflate_flush(r);
|
||||
}
|
||||
break;
|
||||
case LENS:
|
||||
|
||||
while(k<(32)){
|
||||
if(n!=0){
|
||||
r=Z_OK;
|
||||
}
|
||||
else{
|
||||
bitb=b; bitk=k;
|
||||
z.avail_in=n;
|
||||
z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
write=q;
|
||||
return inflate_flush(r);
|
||||
};
|
||||
n--;
|
||||
b|=(z.next_in[p++]&0xff)<<k;
|
||||
k+=8;
|
||||
}
|
||||
|
||||
if ((((~b) >>> 16) & 0xffff) != (b & 0xffff)){
|
||||
mode = BAD;
|
||||
z.msg = "invalid stored block lengths";
|
||||
r = Z_DATA_ERROR;
|
||||
|
||||
bitb=b; bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
write=q;
|
||||
return inflate_flush(r);
|
||||
}
|
||||
left = (b & 0xffff);
|
||||
b = k = 0; // dump bits
|
||||
mode = left!=0 ? STORED : (last!=0 ? DRY : TYPE);
|
||||
break;
|
||||
case STORED:
|
||||
if (n == 0){
|
||||
bitb=b; bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
write=q;
|
||||
return inflate_flush(r);
|
||||
}
|
||||
|
||||
if(m==0){
|
||||
if(q==end&&read!=0){
|
||||
q=0; m=(int)(q<read?read-q-1:end-q);
|
||||
}
|
||||
if(m==0){
|
||||
write=q;
|
||||
r=inflate_flush(r);
|
||||
q=write;m=(int)(q<read?read-q-1:end-q);
|
||||
if(q==end&&read!=0){
|
||||
q=0; m=(int)(q<read?read-q-1:end-q);
|
||||
}
|
||||
if(m==0){
|
||||
bitb=b; bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
write=q;
|
||||
return inflate_flush(r);
|
||||
}
|
||||
}
|
||||
}
|
||||
r=Z_OK;
|
||||
|
||||
t = left;
|
||||
if(t>n) t = n;
|
||||
if(t>m) t = m;
|
||||
System.arraycopy(z.next_in, p, window, q, t);
|
||||
p += t; n -= t;
|
||||
q += t; m -= t;
|
||||
if ((left -= t) != 0)
|
||||
break;
|
||||
mode = last!=0 ? DRY : TYPE;
|
||||
break;
|
||||
case TABLE:
|
||||
|
||||
while(k<(14)){
|
||||
if(n!=0){
|
||||
r=Z_OK;
|
||||
}
|
||||
else{
|
||||
bitb=b; bitk=k;
|
||||
z.avail_in=n;
|
||||
z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
write=q;
|
||||
return inflate_flush(r);
|
||||
};
|
||||
n--;
|
||||
b|=(z.next_in[p++]&0xff)<<k;
|
||||
k+=8;
|
||||
}
|
||||
|
||||
table = t = (b & 0x3fff);
|
||||
if ((t & 0x1f) > 29 || ((t >> 5) & 0x1f) > 29)
|
||||
{
|
||||
mode = BAD;
|
||||
z.msg = "too many length or distance symbols";
|
||||
r = Z_DATA_ERROR;
|
||||
|
||||
bitb=b; bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
write=q;
|
||||
return inflate_flush(r);
|
||||
}
|
||||
t = 258 + (t & 0x1f) + ((t >> 5) & 0x1f);
|
||||
if(blens==null || blens.length<t){
|
||||
blens=new int[t];
|
||||
}
|
||||
else{
|
||||
for(int i=0; i<t; i++){blens[i]=0;}
|
||||
}
|
||||
|
||||
{b>>>=(14);k-=(14);}
|
||||
|
||||
index = 0;
|
||||
mode = BTREE;
|
||||
case BTREE:
|
||||
while (index < 4 + (table >>> 10)){
|
||||
while(k<(3)){
|
||||
if(n!=0){
|
||||
r=Z_OK;
|
||||
}
|
||||
else{
|
||||
bitb=b; bitk=k;
|
||||
z.avail_in=n;
|
||||
z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
write=q;
|
||||
return inflate_flush(r);
|
||||
};
|
||||
n--;
|
||||
b|=(z.next_in[p++]&0xff)<<k;
|
||||
k+=8;
|
||||
}
|
||||
|
||||
blens[border[index++]] = b&7;
|
||||
|
||||
{b>>>=(3);k-=(3);}
|
||||
}
|
||||
|
||||
while(index < 19){
|
||||
blens[border[index++]] = 0;
|
||||
}
|
||||
|
||||
bb[0] = 7;
|
||||
t = inftree.inflate_trees_bits(blens, bb, tb, hufts, z);
|
||||
if (t != Z_OK){
|
||||
r = t;
|
||||
if (r == Z_DATA_ERROR){
|
||||
blens=null;
|
||||
mode = BAD;
|
||||
}
|
||||
|
||||
bitb=b; bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
write=q;
|
||||
return inflate_flush(r);
|
||||
}
|
||||
|
||||
index = 0;
|
||||
mode = DTREE;
|
||||
case DTREE:
|
||||
while (true){
|
||||
t = table;
|
||||
if(!(index < 258 + (t & 0x1f) + ((t >> 5) & 0x1f))){
|
||||
break;
|
||||
}
|
||||
|
||||
int[] h;
|
||||
int i, j, c;
|
||||
|
||||
t = bb[0];
|
||||
|
||||
while(k<(t)){
|
||||
if(n!=0){
|
||||
r=Z_OK;
|
||||
}
|
||||
else{
|
||||
bitb=b; bitk=k;
|
||||
z.avail_in=n;
|
||||
z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
write=q;
|
||||
return inflate_flush(r);
|
||||
};
|
||||
n--;
|
||||
b|=(z.next_in[p++]&0xff)<<k;
|
||||
k+=8;
|
||||
}
|
||||
|
||||
if(tb[0]==-1){
|
||||
//System.err.println("null...");
|
||||
}
|
||||
|
||||
t=hufts[(tb[0]+(b&inflate_mask[t]))*3+1];
|
||||
c=hufts[(tb[0]+(b&inflate_mask[t]))*3+2];
|
||||
|
||||
if (c < 16){
|
||||
b>>>=(t);k-=(t);
|
||||
blens[index++] = c;
|
||||
}
|
||||
else { // c == 16..18
|
||||
i = c == 18 ? 7 : c - 14;
|
||||
j = c == 18 ? 11 : 3;
|
||||
|
||||
while(k<(t+i)){
|
||||
if(n!=0){
|
||||
r=Z_OK;
|
||||
}
|
||||
else{
|
||||
bitb=b; bitk=k;
|
||||
z.avail_in=n;
|
||||
z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
write=q;
|
||||
return inflate_flush(r);
|
||||
};
|
||||
n--;
|
||||
b|=(z.next_in[p++]&0xff)<<k;
|
||||
k+=8;
|
||||
}
|
||||
|
||||
b>>>=(t);k-=(t);
|
||||
|
||||
j += (b & inflate_mask[i]);
|
||||
|
||||
b>>>=(i);k-=(i);
|
||||
|
||||
i = index;
|
||||
t = table;
|
||||
if (i + j > 258 + (t & 0x1f) + ((t >> 5) & 0x1f) ||
|
||||
(c == 16 && i < 1)){
|
||||
blens=null;
|
||||
mode = BAD;
|
||||
z.msg = "invalid bit length repeat";
|
||||
r = Z_DATA_ERROR;
|
||||
|
||||
bitb=b; bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
write=q;
|
||||
return inflate_flush(r);
|
||||
}
|
||||
|
||||
c = c == 16 ? blens[i-1] : 0;
|
||||
do{
|
||||
blens[i++] = c;
|
||||
}
|
||||
while (--j!=0);
|
||||
index = i;
|
||||
}
|
||||
}
|
||||
|
||||
tb[0]=-1;
|
||||
{
|
||||
bl[0] = 9; // must be <= 9 for lookahead assumptions
|
||||
bd[0] = 6; // must be <= 9 for lookahead assumptions
|
||||
t = table;
|
||||
t = inftree.inflate_trees_dynamic(257 + (t & 0x1f),
|
||||
1 + ((t >> 5) & 0x1f),
|
||||
blens, bl, bd, tli, tdi, hufts, z);
|
||||
|
||||
if (t != Z_OK){
|
||||
if (t == Z_DATA_ERROR){
|
||||
blens=null;
|
||||
mode = BAD;
|
||||
}
|
||||
r = t;
|
||||
|
||||
bitb=b; bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
write=q;
|
||||
return inflate_flush(r);
|
||||
}
|
||||
codes.init(bl[0], bd[0], hufts, tli[0], hufts, tdi[0]);
|
||||
}
|
||||
mode = CODES;
|
||||
case CODES:
|
||||
bitb=b; bitk=k;
|
||||
z.avail_in=n; z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
write=q;
|
||||
|
||||
if ((r = codes.proc(r)) != Z_STREAM_END){
|
||||
return inflate_flush(r);
|
||||
}
|
||||
r = Z_OK;
|
||||
codes.free(z);
|
||||
|
||||
p=z.next_in_index; n=z.avail_in;b=bitb;k=bitk;
|
||||
q=write;m=(int)(q<read?read-q-1:end-q);
|
||||
|
||||
if (last==0){
|
||||
mode = TYPE;
|
||||
break;
|
||||
}
|
||||
mode = DRY;
|
||||
case DRY:
|
||||
write=q;
|
||||
r=inflate_flush(r);
|
||||
q=write; m=(int)(q<read?read-q-1:end-q);
|
||||
if (read != write){
|
||||
bitb=b; bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
write=q;
|
||||
return inflate_flush(r);
|
||||
}
|
||||
mode = DONE;
|
||||
case DONE:
|
||||
r = Z_STREAM_END;
|
||||
|
||||
bitb=b; bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
write=q;
|
||||
return inflate_flush(r);
|
||||
case BAD:
|
||||
r = Z_DATA_ERROR;
|
||||
|
||||
bitb=b; bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
write=q;
|
||||
return inflate_flush(r);
|
||||
|
||||
default:
|
||||
r = Z_STREAM_ERROR;
|
||||
|
||||
bitb=b; bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
write=q;
|
||||
return inflate_flush(r);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void free(){
|
||||
reset();
|
||||
window=null;
|
||||
hufts=null;
|
||||
//ZFREE(z, s);
|
||||
}
|
||||
|
||||
void set_dictionary(byte[] d, int start, int n){
|
||||
System.arraycopy(d, start, window, 0, n);
|
||||
read = write = n;
|
||||
}
|
||||
|
||||
// Returns true if inflate is currently at the end of a block generated
|
||||
// by Z_SYNC_FLUSH or Z_FULL_FLUSH.
|
||||
int sync_point(){
|
||||
return mode == LENS ? 1 : 0;
|
||||
}
|
||||
|
||||
// copy as much as possible from the sliding window to the output area
|
||||
int inflate_flush(int r){
|
||||
int n;
|
||||
int p;
|
||||
int q;
|
||||
|
||||
// local copies of source and destination pointers
|
||||
p = z.next_out_index;
|
||||
q = read;
|
||||
|
||||
// compute number of bytes to copy as far as end of window
|
||||
n = (int)((q <= write ? write : end) - q);
|
||||
if(n > z.avail_out) n = z.avail_out;
|
||||
if(n!=0 && r == Z_BUF_ERROR) r = Z_OK;
|
||||
|
||||
// update counters
|
||||
z.avail_out -= n;
|
||||
z.total_out += n;
|
||||
|
||||
// update check information
|
||||
if(check && n>0){
|
||||
z.adler.update(window, q, n);
|
||||
}
|
||||
|
||||
// copy as far as end of window
|
||||
System.arraycopy(window, q, z.next_out, p, n);
|
||||
p += n;
|
||||
q += n;
|
||||
|
||||
// see if more to copy at beginning of window
|
||||
if (q == end){
|
||||
// wrap pointers
|
||||
q = 0;
|
||||
if (write == end)
|
||||
write = 0;
|
||||
|
||||
// compute bytes to copy
|
||||
n = write - q;
|
||||
if (n > z.avail_out) n = z.avail_out;
|
||||
if (n!=0 && r == Z_BUF_ERROR) r = Z_OK;
|
||||
|
||||
// update counters
|
||||
z.avail_out -= n;
|
||||
z.total_out += n;
|
||||
|
||||
// update check information
|
||||
if(check && n>0){
|
||||
z.adler.update(window, q, n);
|
||||
}
|
||||
|
||||
// copy
|
||||
System.arraycopy(window, q, z.next_out, p, n);
|
||||
p += n;
|
||||
q += n;
|
||||
}
|
||||
|
||||
// update pointers
|
||||
z.next_out_index = p;
|
||||
read = q;
|
||||
|
||||
// done
|
||||
return r;
|
||||
}
|
||||
}
|
@ -1,610 +0,0 @@
|
||||
/* -*-mode:java; c-basic-offset:2; -*- */
|
||||
/*
|
||||
Copyright (c) 2000,2001,2002,2003 ymnk, JCraft,Inc. All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are met:
|
||||
|
||||
1. Redistributions of source code must retain the above copyright notice,
|
||||
this list of conditions and the following disclaimer.
|
||||
|
||||
2. Redistributions in binary form must reproduce the above copyright
|
||||
notice, this list of conditions and the following disclaimer in
|
||||
the documentation and/or other materials provided with the distribution.
|
||||
|
||||
3. The names of the authors may not be used to endorse or promote products
|
||||
derived from this software without specific prior written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
|
||||
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
||||
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
|
||||
INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||||
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
|
||||
OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||||
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||||
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
|
||||
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
/*
|
||||
* This program is based on zlib-1.1.3, so all credit should go authors
|
||||
* Jean-loup Gailly(jloup@gzip.org) and Mark Adler(madler@alumni.caltech.edu)
|
||||
* and contributors of zlib.
|
||||
*/
|
||||
|
||||
package com.jcraft.jzlib;
|
||||
|
||||
final class InfCodes{
|
||||
|
||||
static final private int[] inflate_mask = {
|
||||
0x00000000, 0x00000001, 0x00000003, 0x00000007, 0x0000000f,
|
||||
0x0000001f, 0x0000003f, 0x0000007f, 0x000000ff, 0x000001ff,
|
||||
0x000003ff, 0x000007ff, 0x00000fff, 0x00001fff, 0x00003fff,
|
||||
0x00007fff, 0x0000ffff
|
||||
};
|
||||
|
||||
static final private int Z_OK=0;
|
||||
static final private int Z_STREAM_END=1;
|
||||
static final private int Z_NEED_DICT=2;
|
||||
static final private int Z_ERRNO=-1;
|
||||
static final private int Z_STREAM_ERROR=-2;
|
||||
static final private int Z_DATA_ERROR=-3;
|
||||
static final private int Z_MEM_ERROR=-4;
|
||||
static final private int Z_BUF_ERROR=-5;
|
||||
static final private int Z_VERSION_ERROR=-6;
|
||||
|
||||
// waiting for "i:"=input,
|
||||
// "o:"=output,
|
||||
// "x:"=nothing
|
||||
static final private int START=0; // x: set up for LEN
|
||||
static final private int LEN=1; // i: get length/literal/eob next
|
||||
static final private int LENEXT=2; // i: getting length extra (have base)
|
||||
static final private int DIST=3; // i: get distance next
|
||||
static final private int DISTEXT=4;// i: getting distance extra
|
||||
static final private int COPY=5; // o: copying bytes in window, waiting for space
|
||||
static final private int LIT=6; // o: got literal, waiting for output space
|
||||
static final private int WASH=7; // o: got eob, possibly still output waiting
|
||||
static final private int END=8; // x: got eob and all data flushed
|
||||
static final private int BADCODE=9;// x: got error
|
||||
|
||||
int mode; // current inflate_codes mode
|
||||
|
||||
// mode dependent information
|
||||
int len;
|
||||
|
||||
int[] tree; // pointer into tree
|
||||
int tree_index=0;
|
||||
int need; // bits needed
|
||||
|
||||
int lit;
|
||||
|
||||
// if EXT or COPY, where and how much
|
||||
int get; // bits to get for extra
|
||||
int dist; // distance back to copy from
|
||||
|
||||
byte lbits; // ltree bits decoded per branch
|
||||
byte dbits; // dtree bits decoder per branch
|
||||
int[] ltree; // literal/length/eob tree
|
||||
int ltree_index; // literal/length/eob tree
|
||||
int[] dtree; // distance tree
|
||||
int dtree_index; // distance tree
|
||||
|
||||
private final ZStream z;
|
||||
private final InfBlocks s;
|
||||
InfCodes(ZStream z, InfBlocks s){
|
||||
this.z=z;
|
||||
this.s=s;
|
||||
}
|
||||
|
||||
void init(int bl, int bd,
|
||||
int[] tl, int tl_index,
|
||||
int[] td, int td_index){
|
||||
mode=START;
|
||||
lbits=(byte)bl;
|
||||
dbits=(byte)bd;
|
||||
ltree=tl;
|
||||
ltree_index=tl_index;
|
||||
dtree = td;
|
||||
dtree_index=td_index;
|
||||
tree=null;
|
||||
}
|
||||
|
||||
int proc(int r){
|
||||
int j; // temporary storage
|
||||
int[] t; // temporary pointer
|
||||
int tindex; // temporary pointer
|
||||
int e; // extra bits or operation
|
||||
int b=0; // bit buffer
|
||||
int k=0; // bits in bit buffer
|
||||
int p=0; // input data pointer
|
||||
int n; // bytes available there
|
||||
int q; // output window write pointer
|
||||
int m; // bytes to end of window or read pointer
|
||||
int f; // pointer to copy strings from
|
||||
|
||||
// copy input/output information to locals (UPDATE macro restores)
|
||||
p=z.next_in_index;n=z.avail_in;b=s.bitb;k=s.bitk;
|
||||
q=s.write;m=q<s.read?s.read-q-1:s.end-q;
|
||||
|
||||
// process input and output based on current state
|
||||
while (true){
|
||||
switch (mode){
|
||||
// waiting for "i:"=input, "o:"=output, "x:"=nothing
|
||||
case START: // x: set up for LEN
|
||||
if (m >= 258 && n >= 10){
|
||||
|
||||
s.bitb=b;s.bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
s.write=q;
|
||||
r = inflate_fast(lbits, dbits,
|
||||
ltree, ltree_index,
|
||||
dtree, dtree_index,
|
||||
s, z);
|
||||
|
||||
p=z.next_in_index;n=z.avail_in;b=s.bitb;k=s.bitk;
|
||||
q=s.write;m=q<s.read?s.read-q-1:s.end-q;
|
||||
|
||||
if (r != Z_OK){
|
||||
mode = r == Z_STREAM_END ? WASH : BADCODE;
|
||||
break;
|
||||
}
|
||||
}
|
||||
need = lbits;
|
||||
tree = ltree;
|
||||
tree_index=ltree_index;
|
||||
|
||||
mode = LEN;
|
||||
case LEN: // i: get length/literal/eob next
|
||||
j = need;
|
||||
|
||||
while(k<(j)){
|
||||
if(n!=0)r=Z_OK;
|
||||
else{
|
||||
|
||||
s.bitb=b;s.bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
s.write=q;
|
||||
return s.inflate_flush(r);
|
||||
}
|
||||
n--;
|
||||
b|=(z.next_in[p++]&0xff)<<k;
|
||||
k+=8;
|
||||
}
|
||||
|
||||
tindex=(tree_index+(b&inflate_mask[j]))*3;
|
||||
|
||||
b>>>=(tree[tindex+1]);
|
||||
k-=(tree[tindex+1]);
|
||||
|
||||
e=tree[tindex];
|
||||
|
||||
if(e == 0){ // literal
|
||||
lit = tree[tindex+2];
|
||||
mode = LIT;
|
||||
break;
|
||||
}
|
||||
if((e & 16)!=0 ){ // length
|
||||
get = e & 15;
|
||||
len = tree[tindex+2];
|
||||
mode = LENEXT;
|
||||
break;
|
||||
}
|
||||
if ((e & 64) == 0){ // next table
|
||||
need = e;
|
||||
tree_index = tindex/3+tree[tindex+2];
|
||||
break;
|
||||
}
|
||||
if ((e & 32)!=0){ // end of block
|
||||
mode = WASH;
|
||||
break;
|
||||
}
|
||||
mode = BADCODE; // invalid code
|
||||
z.msg = "invalid literal/length code";
|
||||
r = Z_DATA_ERROR;
|
||||
|
||||
s.bitb=b;s.bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
s.write=q;
|
||||
return s.inflate_flush(r);
|
||||
|
||||
case LENEXT: // i: getting length extra (have base)
|
||||
j = get;
|
||||
|
||||
while(k<(j)){
|
||||
if(n!=0)r=Z_OK;
|
||||
else{
|
||||
|
||||
s.bitb=b;s.bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
s.write=q;
|
||||
return s.inflate_flush(r);
|
||||
}
|
||||
n--; b|=(z.next_in[p++]&0xff)<<k;
|
||||
k+=8;
|
||||
}
|
||||
|
||||
len += (b & inflate_mask[j]);
|
||||
|
||||
b>>=j;
|
||||
k-=j;
|
||||
|
||||
need = dbits;
|
||||
tree = dtree;
|
||||
tree_index=dtree_index;
|
||||
mode = DIST;
|
||||
case DIST: // i: get distance next
|
||||
j = need;
|
||||
|
||||
while(k<(j)){
|
||||
if(n!=0)r=Z_OK;
|
||||
else{
|
||||
|
||||
s.bitb=b;s.bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
s.write=q;
|
||||
return s.inflate_flush(r);
|
||||
}
|
||||
n--; b|=(z.next_in[p++]&0xff)<<k;
|
||||
k+=8;
|
||||
}
|
||||
|
||||
tindex=(tree_index+(b & inflate_mask[j]))*3;
|
||||
|
||||
b>>=tree[tindex+1];
|
||||
k-=tree[tindex+1];
|
||||
|
||||
e = (tree[tindex]);
|
||||
if((e & 16)!=0){ // distance
|
||||
get = e & 15;
|
||||
dist = tree[tindex+2];
|
||||
mode = DISTEXT;
|
||||
break;
|
||||
}
|
||||
if ((e & 64) == 0){ // next table
|
||||
need = e;
|
||||
tree_index = tindex/3 + tree[tindex+2];
|
||||
break;
|
||||
}
|
||||
mode = BADCODE; // invalid code
|
||||
z.msg = "invalid distance code";
|
||||
r = Z_DATA_ERROR;
|
||||
|
||||
s.bitb=b;s.bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
s.write=q;
|
||||
return s.inflate_flush(r);
|
||||
|
||||
case DISTEXT: // i: getting distance extra
|
||||
j = get;
|
||||
|
||||
while(k<(j)){
|
||||
if(n!=0)r=Z_OK;
|
||||
else{
|
||||
|
||||
s.bitb=b;s.bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
s.write=q;
|
||||
return s.inflate_flush(r);
|
||||
}
|
||||
n--; b|=(z.next_in[p++]&0xff)<<k;
|
||||
k+=8;
|
||||
}
|
||||
|
||||
dist += (b & inflate_mask[j]);
|
||||
|
||||
b>>=j;
|
||||
k-=j;
|
||||
|
||||
mode = COPY;
|
||||
case COPY: // o: copying bytes in window, waiting for space
|
||||
f = q - dist;
|
||||
while(f < 0){ // modulo window size-"while" instead
|
||||
f += s.end; // of "if" handles invalid distances
|
||||
}
|
||||
while (len!=0){
|
||||
|
||||
if(m==0){
|
||||
if(q==s.end&&s.read!=0){q=0;m=q<s.read?s.read-q-1:s.end-q;}
|
||||
if(m==0){
|
||||
s.write=q; r=s.inflate_flush(r);
|
||||
q=s.write;m=q<s.read?s.read-q-1:s.end-q;
|
||||
|
||||
if(q==s.end&&s.read!=0){q=0;m=q<s.read?s.read-q-1:s.end-q;}
|
||||
|
||||
if(m==0){
|
||||
s.bitb=b;s.bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
s.write=q;
|
||||
return s.inflate_flush(r);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
s.window[q++]=s.window[f++]; m--;
|
||||
|
||||
if (f == s.end)
|
||||
f = 0;
|
||||
len--;
|
||||
}
|
||||
mode = START;
|
||||
break;
|
||||
case LIT: // o: got literal, waiting for output space
|
||||
if(m==0){
|
||||
if(q==s.end&&s.read!=0){q=0;m=q<s.read?s.read-q-1:s.end-q;}
|
||||
if(m==0){
|
||||
s.write=q; r=s.inflate_flush(r);
|
||||
q=s.write;m=q<s.read?s.read-q-1:s.end-q;
|
||||
|
||||
if(q==s.end&&s.read!=0){q=0;m=q<s.read?s.read-q-1:s.end-q;}
|
||||
if(m==0){
|
||||
s.bitb=b;s.bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
s.write=q;
|
||||
return s.inflate_flush(r);
|
||||
}
|
||||
}
|
||||
}
|
||||
r=Z_OK;
|
||||
|
||||
s.window[q++]=(byte)lit; m--;
|
||||
|
||||
mode = START;
|
||||
break;
|
||||
case WASH: // o: got eob, possibly more output
|
||||
if (k > 7){ // return unused byte, if any
|
||||
k -= 8;
|
||||
n++;
|
||||
p--; // can always return one
|
||||
}
|
||||
|
||||
s.write=q; r=s.inflate_flush(r);
|
||||
q=s.write;m=q<s.read?s.read-q-1:s.end-q;
|
||||
|
||||
if (s.read != s.write){
|
||||
s.bitb=b;s.bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
s.write=q;
|
||||
return s.inflate_flush(r);
|
||||
}
|
||||
mode = END;
|
||||
case END:
|
||||
r = Z_STREAM_END;
|
||||
s.bitb=b;s.bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
s.write=q;
|
||||
return s.inflate_flush(r);
|
||||
|
||||
case BADCODE: // x: got error
|
||||
|
||||
r = Z_DATA_ERROR;
|
||||
|
||||
s.bitb=b;s.bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
s.write=q;
|
||||
return s.inflate_flush(r);
|
||||
|
||||
default:
|
||||
r = Z_STREAM_ERROR;
|
||||
|
||||
s.bitb=b;s.bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
s.write=q;
|
||||
return s.inflate_flush(r);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void free(ZStream z){
|
||||
// ZFREE(z, c);
|
||||
}
|
||||
|
||||
// Called with number of bytes left to write in window at least 258
|
||||
// (the maximum string length) and number of input bytes available
|
||||
// at least ten. The ten bytes are six bytes for the longest length/
|
||||
// distance pair plus four bytes for overloading the bit buffer.
|
||||
|
||||
int inflate_fast(int bl, int bd,
|
||||
int[] tl, int tl_index,
|
||||
int[] td, int td_index,
|
||||
InfBlocks s, ZStream z){
|
||||
int t; // temporary pointer
|
||||
int[] tp; // temporary pointer
|
||||
int tp_index; // temporary pointer
|
||||
int e; // extra bits or operation
|
||||
int b; // bit buffer
|
||||
int k; // bits in bit buffer
|
||||
int p; // input data pointer
|
||||
int n; // bytes available there
|
||||
int q; // output window write pointer
|
||||
int m; // bytes to end of window or read pointer
|
||||
int ml; // mask for literal/length tree
|
||||
int md; // mask for distance tree
|
||||
int c; // bytes to copy
|
||||
int d; // distance back to copy from
|
||||
int r; // copy source pointer
|
||||
|
||||
int tp_index_t_3; // (tp_index+t)*3
|
||||
|
||||
// load input, output, bit values
|
||||
p=z.next_in_index;n=z.avail_in;b=s.bitb;k=s.bitk;
|
||||
q=s.write;m=q<s.read?s.read-q-1:s.end-q;
|
||||
|
||||
// initialize masks
|
||||
ml = inflate_mask[bl];
|
||||
md = inflate_mask[bd];
|
||||
|
||||
// do until not enough input or output space for fast loop
|
||||
do { // assume called with m >= 258 && n >= 10
|
||||
// get literal/length code
|
||||
while(k<(20)){ // max bits for literal/length code
|
||||
n--;
|
||||
b|=(z.next_in[p++]&0xff)<<k;k+=8;
|
||||
}
|
||||
|
||||
t= b&ml;
|
||||
tp=tl;
|
||||
tp_index=tl_index;
|
||||
tp_index_t_3=(tp_index+t)*3;
|
||||
if ((e = tp[tp_index_t_3]) == 0){
|
||||
b>>=(tp[tp_index_t_3+1]); k-=(tp[tp_index_t_3+1]);
|
||||
|
||||
s.window[q++] = (byte)tp[tp_index_t_3+2];
|
||||
m--;
|
||||
continue;
|
||||
}
|
||||
do {
|
||||
|
||||
b>>=(tp[tp_index_t_3+1]); k-=(tp[tp_index_t_3+1]);
|
||||
|
||||
if((e&16)!=0){
|
||||
e &= 15;
|
||||
c = tp[tp_index_t_3+2] + ((int)b & inflate_mask[e]);
|
||||
|
||||
b>>=e; k-=e;
|
||||
|
||||
// decode distance base of block to copy
|
||||
while(k<(15)){ // max bits for distance code
|
||||
n--;
|
||||
b|=(z.next_in[p++]&0xff)<<k;k+=8;
|
||||
}
|
||||
|
||||
t= b&md;
|
||||
tp=td;
|
||||
tp_index=td_index;
|
||||
tp_index_t_3=(tp_index+t)*3;
|
||||
e = tp[tp_index_t_3];
|
||||
|
||||
do {
|
||||
|
||||
b>>=(tp[tp_index_t_3+1]); k-=(tp[tp_index_t_3+1]);
|
||||
|
||||
if((e&16)!=0){
|
||||
// get extra bits to add to distance base
|
||||
e &= 15;
|
||||
while(k<(e)){ // get extra bits (up to 13)
|
||||
n--;
|
||||
b|=(z.next_in[p++]&0xff)<<k;k+=8;
|
||||
}
|
||||
|
||||
d = tp[tp_index_t_3+2] + (b&inflate_mask[e]);
|
||||
|
||||
b>>=(e); k-=(e);
|
||||
|
||||
// do the copy
|
||||
m -= c;
|
||||
if (q >= d){ // offset before dest
|
||||
// just copy
|
||||
r=q-d;
|
||||
if(q-r>0 && 2>(q-r)){
|
||||
s.window[q++]=s.window[r++]; // minimum count is three,
|
||||
s.window[q++]=s.window[r++]; // so unroll loop a little
|
||||
c-=2;
|
||||
}
|
||||
else{
|
||||
System.arraycopy(s.window, r, s.window, q, 2);
|
||||
q+=2; r+=2; c-=2;
|
||||
}
|
||||
}
|
||||
else{ // else offset after destination
|
||||
r=q-d;
|
||||
do{
|
||||
r+=s.end; // force pointer in window
|
||||
}while(r<0); // covers invalid distances
|
||||
e=s.end-r;
|
||||
if(c>e){ // if source crosses,
|
||||
c-=e; // wrapped copy
|
||||
if(q-r>0 && e>(q-r)){
|
||||
do{s.window[q++] = s.window[r++];}
|
||||
while(--e!=0);
|
||||
}
|
||||
else{
|
||||
System.arraycopy(s.window, r, s.window, q, e);
|
||||
q+=e; r+=e; e=0;
|
||||
}
|
||||
r = 0; // copy rest from start of window
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
// copy all or what's left
|
||||
if(q-r>0 && c>(q-r)){
|
||||
do{s.window[q++] = s.window[r++];}
|
||||
while(--c!=0);
|
||||
}
|
||||
else{
|
||||
System.arraycopy(s.window, r, s.window, q, c);
|
||||
q+=c; r+=c; c=0;
|
||||
}
|
||||
break;
|
||||
}
|
||||
else if((e&64)==0){
|
||||
t+=tp[tp_index_t_3+2];
|
||||
t+=(b&inflate_mask[e]);
|
||||
tp_index_t_3=(tp_index+t)*3;
|
||||
e=tp[tp_index_t_3];
|
||||
}
|
||||
else{
|
||||
z.msg = "invalid distance code";
|
||||
|
||||
c=z.avail_in-n;c=(k>>3)<c?k>>3:c;n+=c;p-=c;k-=c<<3;
|
||||
|
||||
s.bitb=b;s.bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
s.write=q;
|
||||
|
||||
return Z_DATA_ERROR;
|
||||
}
|
||||
}
|
||||
while(true);
|
||||
break;
|
||||
}
|
||||
|
||||
if((e&64)==0){
|
||||
t+=tp[tp_index_t_3+2];
|
||||
t+=(b&inflate_mask[e]);
|
||||
tp_index_t_3=(tp_index+t)*3;
|
||||
if((e=tp[tp_index_t_3])==0){
|
||||
|
||||
b>>=(tp[tp_index_t_3+1]); k-=(tp[tp_index_t_3+1]);
|
||||
|
||||
s.window[q++]=(byte)tp[tp_index_t_3+2];
|
||||
m--;
|
||||
break;
|
||||
}
|
||||
}
|
||||
else if((e&32)!=0){
|
||||
|
||||
c=z.avail_in-n;c=(k>>3)<c?k>>3:c;n+=c;p-=c;k-=c<<3;
|
||||
|
||||
s.bitb=b;s.bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
s.write=q;
|
||||
|
||||
return Z_STREAM_END;
|
||||
}
|
||||
else{
|
||||
z.msg="invalid literal/length code";
|
||||
|
||||
c=z.avail_in-n;c=(k>>3)<c?k>>3:c;n+=c;p-=c;k-=c<<3;
|
||||
|
||||
s.bitb=b;s.bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
s.write=q;
|
||||
|
||||
return Z_DATA_ERROR;
|
||||
}
|
||||
}
|
||||
while(true);
|
||||
}
|
||||
while(m>=258 && n>= 10);
|
||||
|
||||
// not enough input or output--restore pointers and return
|
||||
c=z.avail_in-n;c=(k>>3)<c?k>>3:c;n+=c;p-=c;k-=c<<3;
|
||||
|
||||
s.bitb=b;s.bitk=k;
|
||||
z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;
|
||||
s.write=q;
|
||||
|
||||
return Z_OK;
|
||||
}
|
||||
}
|
@ -1,518 +0,0 @@
|
||||
/* -*-mode:java; c-basic-offset:2; indent-tabs-mode:nil -*- */
|
||||
/*
|
||||
Copyright (c) 2000,2001,2002,2003 ymnk, JCraft,Inc. All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are met:
|
||||
|
||||
1. Redistributions of source code must retain the above copyright notice,
|
||||
this list of conditions and the following disclaimer.
|
||||
|
||||
2. Redistributions in binary form must reproduce the above copyright
|
||||
notice, this list of conditions and the following disclaimer in
|
||||
the documentation and/or other materials provided with the distribution.
|
||||
|
||||
3. The names of the authors may not be used to endorse or promote products
|
||||
derived from this software without specific prior written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
|
||||
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
||||
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
|
||||
INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||||
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
|
||||
OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||||
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||||
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
|
||||
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
/*
|
||||
* This program is based on zlib-1.1.3, so all credit should go authors
|
||||
* Jean-loup Gailly(jloup@gzip.org) and Mark Adler(madler@alumni.caltech.edu)
|
||||
* and contributors of zlib.
|
||||
*/
|
||||
|
||||
package com.jcraft.jzlib;
|
||||
|
||||
final class InfTree{
|
||||
|
||||
static final private int MANY=1440;
|
||||
|
||||
static final private int Z_OK=0;
|
||||
static final private int Z_STREAM_END=1;
|
||||
static final private int Z_NEED_DICT=2;
|
||||
static final private int Z_ERRNO=-1;
|
||||
static final private int Z_STREAM_ERROR=-2;
|
||||
static final private int Z_DATA_ERROR=-3;
|
||||
static final private int Z_MEM_ERROR=-4;
|
||||
static final private int Z_BUF_ERROR=-5;
|
||||
static final private int Z_VERSION_ERROR=-6;
|
||||
|
||||
static final int fixed_bl = 9;
|
||||
static final int fixed_bd = 5;
|
||||
|
||||
static final int[] fixed_tl = {
|
||||
96,7,256, 0,8,80, 0,8,16, 84,8,115,
|
||||
82,7,31, 0,8,112, 0,8,48, 0,9,192,
|
||||
80,7,10, 0,8,96, 0,8,32, 0,9,160,
|
||||
0,8,0, 0,8,128, 0,8,64, 0,9,224,
|
||||
80,7,6, 0,8,88, 0,8,24, 0,9,144,
|
||||
83,7,59, 0,8,120, 0,8,56, 0,9,208,
|
||||
81,7,17, 0,8,104, 0,8,40, 0,9,176,
|
||||
0,8,8, 0,8,136, 0,8,72, 0,9,240,
|
||||
80,7,4, 0,8,84, 0,8,20, 85,8,227,
|
||||
83,7,43, 0,8,116, 0,8,52, 0,9,200,
|
||||
81,7,13, 0,8,100, 0,8,36, 0,9,168,
|
||||
0,8,4, 0,8,132, 0,8,68, 0,9,232,
|
||||
80,7,8, 0,8,92, 0,8,28, 0,9,152,
|
||||
84,7,83, 0,8,124, 0,8,60, 0,9,216,
|
||||
82,7,23, 0,8,108, 0,8,44, 0,9,184,
|
||||
0,8,12, 0,8,140, 0,8,76, 0,9,248,
|
||||
80,7,3, 0,8,82, 0,8,18, 85,8,163,
|
||||
83,7,35, 0,8,114, 0,8,50, 0,9,196,
|
||||
81,7,11, 0,8,98, 0,8,34, 0,9,164,
|
||||
0,8,2, 0,8,130, 0,8,66, 0,9,228,
|
||||
80,7,7, 0,8,90, 0,8,26, 0,9,148,
|
||||
84,7,67, 0,8,122, 0,8,58, 0,9,212,
|
||||
82,7,19, 0,8,106, 0,8,42, 0,9,180,
|
||||
0,8,10, 0,8,138, 0,8,74, 0,9,244,
|
||||
80,7,5, 0,8,86, 0,8,22, 192,8,0,
|
||||
83,7,51, 0,8,118, 0,8,54, 0,9,204,
|
||||
81,7,15, 0,8,102, 0,8,38, 0,9,172,
|
||||
0,8,6, 0,8,134, 0,8,70, 0,9,236,
|
||||
80,7,9, 0,8,94, 0,8,30, 0,9,156,
|
||||
84,7,99, 0,8,126, 0,8,62, 0,9,220,
|
||||
82,7,27, 0,8,110, 0,8,46, 0,9,188,
|
||||
0,8,14, 0,8,142, 0,8,78, 0,9,252,
|
||||
96,7,256, 0,8,81, 0,8,17, 85,8,131,
|
||||
82,7,31, 0,8,113, 0,8,49, 0,9,194,
|
||||
80,7,10, 0,8,97, 0,8,33, 0,9,162,
|
||||
0,8,1, 0,8,129, 0,8,65, 0,9,226,
|
||||
80,7,6, 0,8,89, 0,8,25, 0,9,146,
|
||||
83,7,59, 0,8,121, 0,8,57, 0,9,210,
|
||||
81,7,17, 0,8,105, 0,8,41, 0,9,178,
|
||||
0,8,9, 0,8,137, 0,8,73, 0,9,242,
|
||||
80,7,4, 0,8,85, 0,8,21, 80,8,258,
|
||||
83,7,43, 0,8,117, 0,8,53, 0,9,202,
|
||||
81,7,13, 0,8,101, 0,8,37, 0,9,170,
|
||||
0,8,5, 0,8,133, 0,8,69, 0,9,234,
|
||||
80,7,8, 0,8,93, 0,8,29, 0,9,154,
|
||||
84,7,83, 0,8,125, 0,8,61, 0,9,218,
|
||||
82,7,23, 0,8,109, 0,8,45, 0,9,186,
|
||||
0,8,13, 0,8,141, 0,8,77, 0,9,250,
|
||||
80,7,3, 0,8,83, 0,8,19, 85,8,195,
|
||||
83,7,35, 0,8,115, 0,8,51, 0,9,198,
|
||||
81,7,11, 0,8,99, 0,8,35, 0,9,166,
|
||||
0,8,3, 0,8,131, 0,8,67, 0,9,230,
|
||||
80,7,7, 0,8,91, 0,8,27, 0,9,150,
|
||||
84,7,67, 0,8,123, 0,8,59, 0,9,214,
|
||||
82,7,19, 0,8,107, 0,8,43, 0,9,182,
|
||||
0,8,11, 0,8,139, 0,8,75, 0,9,246,
|
||||
80,7,5, 0,8,87, 0,8,23, 192,8,0,
|
||||
83,7,51, 0,8,119, 0,8,55, 0,9,206,
|
||||
81,7,15, 0,8,103, 0,8,39, 0,9,174,
|
||||
0,8,7, 0,8,135, 0,8,71, 0,9,238,
|
||||
80,7,9, 0,8,95, 0,8,31, 0,9,158,
|
||||
84,7,99, 0,8,127, 0,8,63, 0,9,222,
|
||||
82,7,27, 0,8,111, 0,8,47, 0,9,190,
|
||||
0,8,15, 0,8,143, 0,8,79, 0,9,254,
|
||||
96,7,256, 0,8,80, 0,8,16, 84,8,115,
|
||||
82,7,31, 0,8,112, 0,8,48, 0,9,193,
|
||||
|
||||
80,7,10, 0,8,96, 0,8,32, 0,9,161,
|
||||
0,8,0, 0,8,128, 0,8,64, 0,9,225,
|
||||
80,7,6, 0,8,88, 0,8,24, 0,9,145,
|
||||
83,7,59, 0,8,120, 0,8,56, 0,9,209,
|
||||
81,7,17, 0,8,104, 0,8,40, 0,9,177,
|
||||
0,8,8, 0,8,136, 0,8,72, 0,9,241,
|
||||
80,7,4, 0,8,84, 0,8,20, 85,8,227,
|
||||
83,7,43, 0,8,116, 0,8,52, 0,9,201,
|
||||
81,7,13, 0,8,100, 0,8,36, 0,9,169,
|
||||
0,8,4, 0,8,132, 0,8,68, 0,9,233,
|
||||
80,7,8, 0,8,92, 0,8,28, 0,9,153,
|
||||
84,7,83, 0,8,124, 0,8,60, 0,9,217,
|
||||
82,7,23, 0,8,108, 0,8,44, 0,9,185,
|
||||
0,8,12, 0,8,140, 0,8,76, 0,9,249,
|
||||
80,7,3, 0,8,82, 0,8,18, 85,8,163,
|
||||
83,7,35, 0,8,114, 0,8,50, 0,9,197,
|
||||
81,7,11, 0,8,98, 0,8,34, 0,9,165,
|
||||
0,8,2, 0,8,130, 0,8,66, 0,9,229,
|
||||
80,7,7, 0,8,90, 0,8,26, 0,9,149,
|
||||
84,7,67, 0,8,122, 0,8,58, 0,9,213,
|
||||
82,7,19, 0,8,106, 0,8,42, 0,9,181,
|
||||
0,8,10, 0,8,138, 0,8,74, 0,9,245,
|
||||
80,7,5, 0,8,86, 0,8,22, 192,8,0,
|
||||
83,7,51, 0,8,118, 0,8,54, 0,9,205,
|
||||
81,7,15, 0,8,102, 0,8,38, 0,9,173,
|
||||
0,8,6, 0,8,134, 0,8,70, 0,9,237,
|
||||
80,7,9, 0,8,94, 0,8,30, 0,9,157,
|
||||
84,7,99, 0,8,126, 0,8,62, 0,9,221,
|
||||
82,7,27, 0,8,110, 0,8,46, 0,9,189,
|
||||
0,8,14, 0,8,142, 0,8,78, 0,9,253,
|
||||
96,7,256, 0,8,81, 0,8,17, 85,8,131,
|
||||
82,7,31, 0,8,113, 0,8,49, 0,9,195,
|
||||
80,7,10, 0,8,97, 0,8,33, 0,9,163,
|
||||
0,8,1, 0,8,129, 0,8,65, 0,9,227,
|
||||
80,7,6, 0,8,89, 0,8,25, 0,9,147,
|
||||
83,7,59, 0,8,121, 0,8,57, 0,9,211,
|
||||
81,7,17, 0,8,105, 0,8,41, 0,9,179,
|
||||
0,8,9, 0,8,137, 0,8,73, 0,9,243,
|
||||
80,7,4, 0,8,85, 0,8,21, 80,8,258,
|
||||
83,7,43, 0,8,117, 0,8,53, 0,9,203,
|
||||
81,7,13, 0,8,101, 0,8,37, 0,9,171,
|
||||
0,8,5, 0,8,133, 0,8,69, 0,9,235,
|
||||
80,7,8, 0,8,93, 0,8,29, 0,9,155,
|
||||
84,7,83, 0,8,125, 0,8,61, 0,9,219,
|
||||
82,7,23, 0,8,109, 0,8,45, 0,9,187,
|
||||
0,8,13, 0,8,141, 0,8,77, 0,9,251,
|
||||
80,7,3, 0,8,83, 0,8,19, 85,8,195,
|
||||
83,7,35, 0,8,115, 0,8,51, 0,9,199,
|
||||
81,7,11, 0,8,99, 0,8,35, 0,9,167,
|
||||
0,8,3, 0,8,131, 0,8,67, 0,9,231,
|
||||
80,7,7, 0,8,91, 0,8,27, 0,9,151,
|
||||
84,7,67, 0,8,123, 0,8,59, 0,9,215,
|
||||
82,7,19, 0,8,107, 0,8,43, 0,9,183,
|
||||
0,8,11, 0,8,139, 0,8,75, 0,9,247,
|
||||
80,7,5, 0,8,87, 0,8,23, 192,8,0,
|
||||
83,7,51, 0,8,119, 0,8,55, 0,9,207,
|
||||
81,7,15, 0,8,103, 0,8,39, 0,9,175,
|
||||
0,8,7, 0,8,135, 0,8,71, 0,9,239,
|
||||
80,7,9, 0,8,95, 0,8,31, 0,9,159,
|
||||
84,7,99, 0,8,127, 0,8,63, 0,9,223,
|
||||
82,7,27, 0,8,111, 0,8,47, 0,9,191,
|
||||
0,8,15, 0,8,143, 0,8,79, 0,9,255
|
||||
};
|
||||
static final int[] fixed_td = {
|
||||
80,5,1, 87,5,257, 83,5,17, 91,5,4097,
|
||||
81,5,5, 89,5,1025, 85,5,65, 93,5,16385,
|
||||
80,5,3, 88,5,513, 84,5,33, 92,5,8193,
|
||||
82,5,9, 90,5,2049, 86,5,129, 192,5,24577,
|
||||
80,5,2, 87,5,385, 83,5,25, 91,5,6145,
|
||||
81,5,7, 89,5,1537, 85,5,97, 93,5,24577,
|
||||
80,5,4, 88,5,769, 84,5,49, 92,5,12289,
|
||||
82,5,13, 90,5,3073, 86,5,193, 192,5,24577
|
||||
};
|
||||
|
||||
// Tables for deflate from PKZIP's appnote.txt.
|
||||
static final int[] cplens = { // Copy lengths for literal codes 257..285
|
||||
3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,
|
||||
35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0
|
||||
};
|
||||
|
||||
// see note #13 above about 258
|
||||
static final int[] cplext = { // Extra bits for literal codes 257..285
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2,
|
||||
3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, 112, 112 // 112==invalid
|
||||
};
|
||||
|
||||
static final int[] cpdist = { // Copy offsets for distance codes 0..29
|
||||
1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,
|
||||
257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,
|
||||
8193, 12289, 16385, 24577
|
||||
};
|
||||
|
||||
static final int[] cpdext = { // Extra bits for distance codes
|
||||
0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6,
|
||||
7, 7, 8, 8, 9, 9, 10, 10, 11, 11,
|
||||
12, 12, 13, 13};
|
||||
|
||||
// If BMAX needs to be larger than 16, then h and x[] should be uLong.
|
||||
static final int BMAX=15; // maximum bit length of any code
|
||||
|
||||
int[] hn = null; // hufts used in space
|
||||
int[] v = null; // work area for huft_build
|
||||
int[] c = null; // bit length count table
|
||||
int[] r = null; // table entry for structure assignment
|
||||
int[] u = null; // table stack
|
||||
int[] x = null; // bit offsets, then code stack
|
||||
|
||||
private int huft_build(int[] b, // code lengths in bits (all assumed <= BMAX)
|
||||
int bindex,
|
||||
int n, // number of codes (assumed <= 288)
|
||||
int s, // number of simple-valued codes (0..s-1)
|
||||
int[] d, // list of base values for non-simple codes
|
||||
int[] e, // list of extra bits for non-simple codes
|
||||
int[] t, // result: starting table
|
||||
int[] m, // maximum lookup bits, returns actual
|
||||
int[] hp,// space for trees
|
||||
int[] hn,// hufts used in space
|
||||
int[] v // working area: values in order of bit length
|
||||
){
|
||||
// Given a list of code lengths and a maximum table size, make a set of
|
||||
// tables to decode that set of codes. Return Z_OK on success, Z_BUF_ERROR
|
||||
// if the given code set is incomplete (the tables are still built in this
|
||||
// case), Z_DATA_ERROR if the input is invalid (an over-subscribed set of
|
||||
// lengths), or Z_MEM_ERROR if not enough memory.
|
||||
|
||||
int a; // counter for codes of length k
|
||||
int f; // i repeats in table every f entries
|
||||
int g; // maximum code length
|
||||
int h; // table level
|
||||
int i; // counter, current code
|
||||
int j; // counter
|
||||
int k; // number of bits in current code
|
||||
int l; // bits per table (returned in m)
|
||||
int mask; // (1 << w) - 1, to avoid cc -O bug on HP
|
||||
int p; // pointer into c[], b[], or v[]
|
||||
int q; // points to current table
|
||||
int w; // bits before this table == (l * h)
|
||||
int xp; // pointer into x
|
||||
int y; // number of dummy codes added
|
||||
int z; // number of entries in current table
|
||||
|
||||
// Generate counts for each bit length
|
||||
|
||||
p = 0; i = n;
|
||||
do {
|
||||
c[b[bindex+p]]++; p++; i--; // assume all entries <= BMAX
|
||||
}while(i!=0);
|
||||
|
||||
if(c[0] == n){ // null input--all zero length codes
|
||||
t[0] = -1;
|
||||
m[0] = 0;
|
||||
return Z_OK;
|
||||
}
|
||||
|
||||
// Find minimum and maximum length, bound *m by those
|
||||
l = m[0];
|
||||
for (j = 1; j <= BMAX; j++)
|
||||
if(c[j]!=0) break;
|
||||
k = j; // minimum code length
|
||||
if(l < j){
|
||||
l = j;
|
||||
}
|
||||
for (i = BMAX; i!=0; i--){
|
||||
if(c[i]!=0) break;
|
||||
}
|
||||
g = i; // maximum code length
|
||||
if(l > i){
|
||||
l = i;
|
||||
}
|
||||
m[0] = l;
|
||||
|
||||
// Adjust last length count to fill out codes, if needed
|
||||
for (y = 1 << j; j < i; j++, y <<= 1){
|
||||
if ((y -= c[j]) < 0){
|
||||
return Z_DATA_ERROR;
|
||||
}
|
||||
}
|
||||
if ((y -= c[i]) < 0){
|
||||
return Z_DATA_ERROR;
|
||||
}
|
||||
c[i] += y;
|
||||
|
||||
// Generate starting offsets into the value table for each length
|
||||
x[1] = j = 0;
|
||||
p = 1; xp = 2;
|
||||
while (--i!=0) { // note that i == g from above
|
||||
x[xp] = (j += c[p]);
|
||||
xp++;
|
||||
p++;
|
||||
}
|
||||
|
||||
// Make a table of values in order of bit lengths
|
||||
i = 0; p = 0;
|
||||
do {
|
||||
if ((j = b[bindex+p]) != 0){
|
||||
v[x[j]++] = i;
|
||||
}
|
||||
p++;
|
||||
}
|
||||
while (++i < n);
|
||||
n = x[g]; // set n to length of v
|
||||
|
||||
// Generate the Huffman codes and for each, make the table entries
|
||||
x[0] = i = 0; // first Huffman code is zero
|
||||
p = 0; // grab values in bit order
|
||||
h = -1; // no tables yet--level -1
|
||||
w = -l; // bits decoded == (l * h)
|
||||
u[0] = 0; // just to keep compilers happy
|
||||
q = 0; // ditto
|
||||
z = 0; // ditto
|
||||
|
||||
// go through the bit lengths (k already is bits in shortest code)
|
||||
for (; k <= g; k++){
|
||||
a = c[k];
|
||||
while (a--!=0){
|
||||
// here i is the Huffman code of length k bits for value *p
|
||||
// make tables up to required level
|
||||
while (k > w + l){
|
||||
h++;
|
||||
w += l; // previous table always l bits
|
||||
// compute minimum size table less than or equal to l bits
|
||||
z = g - w;
|
||||
z = (z > l) ? l : z; // table size upper limit
|
||||
if((f=1<<(j=k-w))>a+1){ // try a k-w bit table
|
||||
// too few codes for k-w bit table
|
||||
f -= a + 1; // deduct codes from patterns left
|
||||
xp = k;
|
||||
if(j < z){
|
||||
while (++j < z){ // try smaller tables up to z bits
|
||||
if((f <<= 1) <= c[++xp])
|
||||
break; // enough codes to use up j bits
|
||||
f -= c[xp]; // else deduct codes from patterns
|
||||
}
|
||||
}
|
||||
}
|
||||
z = 1 << j; // table entries for j-bit table
|
||||
|
||||
// allocate new table
|
||||
if (hn[0] + z > MANY){ // (note: doesn't matter for fixed)
|
||||
return Z_DATA_ERROR; // overflow of MANY
|
||||
}
|
||||
u[h] = q = /*hp+*/ hn[0]; // DEBUG
|
||||
hn[0] += z;
|
||||
|
||||
// connect to last table, if there is one
|
||||
if(h!=0){
|
||||
x[h]=i; // save pattern for backing up
|
||||
r[0]=(byte)j; // bits in this table
|
||||
r[1]=(byte)l; // bits to dump before this table
|
||||
j=i>>>(w - l);
|
||||
r[2] = (int)(q - u[h-1] - j); // offset to this table
|
||||
System.arraycopy(r, 0, hp, (u[h-1]+j)*3, 3); // connect to last table
|
||||
}
|
||||
else{
|
||||
t[0] = q; // first table is returned result
|
||||
}
|
||||
}
|
||||
|
||||
// set up table entry in r
|
||||
r[1] = (byte)(k - w);
|
||||
if (p >= n){
|
||||
r[0] = 128 + 64; // out of values--invalid code
|
||||
}
|
||||
else if (v[p] < s){
|
||||
r[0] = (byte)(v[p] < 256 ? 0 : 32 + 64); // 256 is end-of-block
|
||||
r[2] = v[p++]; // simple code is just the value
|
||||
}
|
||||
else{
|
||||
r[0]=(byte)(e[v[p]-s]+16+64); // non-simple--look up in lists
|
||||
r[2]=d[v[p++] - s];
|
||||
}
|
||||
|
||||
// fill code-like entries with r
|
||||
f=1<<(k-w);
|
||||
for (j=i>>>w;j<z;j+=f){
|
||||
System.arraycopy(r, 0, hp, (q+j)*3, 3);
|
||||
}
|
||||
|
||||
// backwards increment the k-bit code i
|
||||
for (j = 1 << (k - 1); (i & j)!=0; j >>>= 1){
|
||||
i ^= j;
|
||||
}
|
||||
i ^= j;
|
||||
|
||||
// backup over finished tables
|
||||
mask = (1 << w) - 1; // needed on HP, cc -O bug
|
||||
while ((i & mask) != x[h]){
|
||||
h--; // don't need to update q
|
||||
w -= l;
|
||||
mask = (1 << w) - 1;
|
||||
}
|
||||
}
|
||||
}
|
||||
// Return Z_BUF_ERROR if we were given an incomplete table
|
||||
return y != 0 && g != 1 ? Z_BUF_ERROR : Z_OK;
|
||||
}
|
||||
|
||||
int inflate_trees_bits(int[] c, // 19 code lengths
|
||||
int[] bb, // bits tree desired/actual depth
|
||||
int[] tb, // bits tree result
|
||||
int[] hp, // space for trees
|
||||
ZStream z // for messages
|
||||
){
|
||||
int result;
|
||||
initWorkArea(19);
|
||||
hn[0]=0;
|
||||
result = huft_build(c, 0, 19, 19, null, null, tb, bb, hp, hn, v);
|
||||
|
||||
if(result == Z_DATA_ERROR){
|
||||
z.msg = "oversubscribed dynamic bit lengths tree";
|
||||
}
|
||||
else if(result == Z_BUF_ERROR || bb[0] == 0){
|
||||
z.msg = "incomplete dynamic bit lengths tree";
|
||||
result = Z_DATA_ERROR;
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
int inflate_trees_dynamic(int nl, // number of literal/length codes
|
||||
int nd, // number of distance codes
|
||||
int[] c, // that many (total) code lengths
|
||||
int[] bl, // literal desired/actual bit depth
|
||||
int[] bd, // distance desired/actual bit depth
|
||||
int[] tl, // literal/length tree result
|
||||
int[] td, // distance tree result
|
||||
int[] hp, // space for trees
|
||||
ZStream z // for messages
|
||||
){
|
||||
int result;
|
||||
|
||||
// build literal/length tree
|
||||
initWorkArea(288);
|
||||
hn[0]=0;
|
||||
result = huft_build(c, 0, nl, 257, cplens, cplext, tl, bl, hp, hn, v);
|
||||
if (result != Z_OK || bl[0] == 0){
|
||||
if(result == Z_DATA_ERROR){
|
||||
z.msg = "oversubscribed literal/length tree";
|
||||
}
|
||||
else if (result != Z_MEM_ERROR){
|
||||
z.msg = "incomplete literal/length tree";
|
||||
result = Z_DATA_ERROR;
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
// build distance tree
|
||||
initWorkArea(288);
|
||||
result = huft_build(c, nl, nd, 0, cpdist, cpdext, td, bd, hp, hn, v);
|
||||
|
||||
if (result != Z_OK || (bd[0] == 0 && nl > 257)){
|
||||
if (result == Z_DATA_ERROR){
|
||||
z.msg = "oversubscribed distance tree";
|
||||
}
|
||||
else if (result == Z_BUF_ERROR) {
|
||||
z.msg = "incomplete distance tree";
|
||||
result = Z_DATA_ERROR;
|
||||
}
|
||||
else if (result != Z_MEM_ERROR){
|
||||
z.msg = "empty distance tree with lengths";
|
||||
result = Z_DATA_ERROR;
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
return Z_OK;
|
||||
}
|
||||
|
||||
static int inflate_trees_fixed(int[] bl, //literal desired/actual bit depth
|
||||
int[] bd, //distance desired/actual bit depth
|
||||
int[][] tl,//literal/length tree result
|
||||
int[][] td,//distance tree result
|
||||
ZStream z //for memory allocation
|
||||
){
|
||||
bl[0]=fixed_bl;
|
||||
bd[0]=fixed_bd;
|
||||
tl[0]=fixed_tl;
|
||||
td[0]=fixed_td;
|
||||
return Z_OK;
|
||||
}
|
||||
|
||||
private void initWorkArea(int vsize){
|
||||
if(hn==null){
|
||||
hn=new int[1];
|
||||
v=new int[vsize];
|
||||
c=new int[BMAX+1];
|
||||
r=new int[3];
|
||||
u=new int[BMAX];
|
||||
x=new int[BMAX+1];
|
||||
}
|
||||
if(v.length<vsize){ v=new int[vsize]; }
|
||||
for(int i=0; i<vsize; i++){v[i]=0;}
|
||||
for(int i=0; i<BMAX+1; i++){c[i]=0;}
|
||||
for(int i=0; i<3; i++){r[i]=0;}
|
||||
System.arraycopy(c, 0, u, 0, BMAX);
|
||||
System.arraycopy(c, 0, x, 0, BMAX+1);
|
||||
}
|
||||
}
|
@ -1,751 +0,0 @@
|
||||
/* -*-mode:java; c-basic-offset:2; -*- */
|
||||
/*
|
||||
Copyright (c) 2000-2011 ymnk, JCraft,Inc. All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are met:
|
||||
|
||||
1. Redistributions of source code must retain the above copyright notice,
|
||||
this list of conditions and the following disclaimer.
|
||||
|
||||
2. Redistributions in binary form must reproduce the above copyright
|
||||
notice, this list of conditions and the following disclaimer in
|
||||
the documentation and/or other materials provided with the distribution.
|
||||
|
||||
3. The names of the authors may not be used to endorse or promote products
|
||||
derived from this software without specific prior written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
|
||||
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
||||
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
|
||||
INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||||
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
|
||||
OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||||
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||||
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
|
||||
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
/*
|
||||
* This program is based on zlib-1.1.3, so all credit should go authors
|
||||
* Jean-loup Gailly(jloup@gzip.org) and Mark Adler(madler@alumni.caltech.edu)
|
||||
* and contributors of zlib.
|
||||
*/
|
||||
|
||||
package com.jcraft.jzlib;
|
||||
|
||||
final class Inflate{
|
||||
|
||||
static final private int MAX_WBITS=15; // 32K LZ77 window
|
||||
|
||||
// preset dictionary flag in zlib header
|
||||
static final private int PRESET_DICT=0x20;
|
||||
|
||||
static final int Z_NO_FLUSH=0;
|
||||
static final int Z_PARTIAL_FLUSH=1;
|
||||
static final int Z_SYNC_FLUSH=2;
|
||||
static final int Z_FULL_FLUSH=3;
|
||||
static final int Z_FINISH=4;
|
||||
|
||||
static final private int Z_DEFLATED=8;
|
||||
|
||||
static final private int Z_OK=0;
|
||||
static final private int Z_STREAM_END=1;
|
||||
static final private int Z_NEED_DICT=2;
|
||||
static final private int Z_ERRNO=-1;
|
||||
static final private int Z_STREAM_ERROR=-2;
|
||||
static final private int Z_DATA_ERROR=-3;
|
||||
static final private int Z_MEM_ERROR=-4;
|
||||
static final private int Z_BUF_ERROR=-5;
|
||||
static final private int Z_VERSION_ERROR=-6;
|
||||
|
||||
static final private int METHOD=0; // waiting for method byte
|
||||
static final private int FLAG=1; // waiting for flag byte
|
||||
static final private int DICT4=2; // four dictionary check bytes to go
|
||||
static final private int DICT3=3; // three dictionary check bytes to go
|
||||
static final private int DICT2=4; // two dictionary check bytes to go
|
||||
static final private int DICT1=5; // one dictionary check byte to go
|
||||
static final private int DICT0=6; // waiting for inflateSetDictionary
|
||||
static final private int BLOCKS=7; // decompressing blocks
|
||||
static final private int CHECK4=8; // four check bytes to go
|
||||
static final private int CHECK3=9; // three check bytes to go
|
||||
static final private int CHECK2=10; // two check bytes to go
|
||||
static final private int CHECK1=11; // one check byte to go
|
||||
static final private int DONE=12; // finished check, done
|
||||
static final private int BAD=13; // got an error--stay here
|
||||
|
||||
static final private int HEAD=14;
|
||||
static final private int LENGTH=15;
|
||||
static final private int TIME=16;
|
||||
static final private int OS=17;
|
||||
static final private int EXLEN=18;
|
||||
static final private int EXTRA=19;
|
||||
static final private int NAME=20;
|
||||
static final private int COMMENT=21;
|
||||
static final private int HCRC=22;
|
||||
static final private int FLAGS=23;
|
||||
|
||||
static final int INFLATE_ANY=0x40000000;
|
||||
|
||||
int mode; // current inflate mode
|
||||
|
||||
// mode dependent information
|
||||
int method; // if FLAGS, method byte
|
||||
|
||||
// if CHECK, check values to compare
|
||||
long was = -1; // computed check value
|
||||
long need; // stream check value
|
||||
|
||||
// if BAD, inflateSync's marker bytes count
|
||||
int marker;
|
||||
|
||||
// mode independent information
|
||||
int wrap; // flag for no wrapper
|
||||
// 0: no wrapper
|
||||
// 1: zlib header
|
||||
// 2: gzip header
|
||||
// 4: auto detection
|
||||
|
||||
int wbits; // log2(window size) (8..15, defaults to 15)
|
||||
|
||||
InfBlocks blocks; // current inflate_blocks state
|
||||
|
||||
private final ZStream z;
|
||||
|
||||
private int flags;
|
||||
|
||||
private int need_bytes = -1;
|
||||
private byte[] crcbuf=new byte[4];
|
||||
|
||||
GZIPHeader gheader = null;
|
||||
|
||||
int inflateReset(){
|
||||
if(z == null) return Z_STREAM_ERROR;
|
||||
|
||||
z.total_in = z.total_out = 0;
|
||||
z.msg = null;
|
||||
this.mode = HEAD;
|
||||
this.need_bytes = -1;
|
||||
this.blocks.reset();
|
||||
return Z_OK;
|
||||
}
|
||||
|
||||
int inflateEnd(){
|
||||
if(blocks != null){
|
||||
blocks.free();
|
||||
}
|
||||
return Z_OK;
|
||||
}
|
||||
|
||||
Inflate(ZStream z){
|
||||
this.z=z;
|
||||
}
|
||||
|
||||
int inflateInit(int w){
|
||||
z.msg = null;
|
||||
blocks = null;
|
||||
|
||||
// handle undocumented wrap option (no zlib header or check)
|
||||
wrap = 0;
|
||||
if(w < 0){
|
||||
w = - w;
|
||||
}
|
||||
else if((w&INFLATE_ANY) != 0){
|
||||
wrap = 4;
|
||||
w &= ~INFLATE_ANY;
|
||||
if(w < 48)
|
||||
w &= 15;
|
||||
}
|
||||
else if((w & ~31) != 0) { // for example, DEF_WBITS + 32
|
||||
wrap = 4; // zlib and gzip wrapped data should be accepted.
|
||||
w &= 15;
|
||||
}
|
||||
else {
|
||||
wrap = (w >> 4) + 1;
|
||||
if(w < 48)
|
||||
w &= 15;
|
||||
}
|
||||
|
||||
if(w<8 ||w>15){
|
||||
inflateEnd();
|
||||
return Z_STREAM_ERROR;
|
||||
}
|
||||
if(blocks != null && wbits != w){
|
||||
blocks.free();
|
||||
blocks=null;
|
||||
}
|
||||
|
||||
// set window size
|
||||
wbits=w;
|
||||
|
||||
this.blocks=new InfBlocks(z, 1<<w);
|
||||
|
||||
// reset state
|
||||
inflateReset();
|
||||
|
||||
return Z_OK;
|
||||
}
|
||||
|
||||
int inflate(int f){
|
||||
int hold = 0;
|
||||
|
||||
int r;
|
||||
int b;
|
||||
|
||||
if(z == null || z.next_in == null){
|
||||
if(f == Z_FINISH && this.mode==HEAD)
|
||||
return Z_OK;
|
||||
return Z_STREAM_ERROR;
|
||||
}
|
||||
|
||||
f = f == Z_FINISH ? Z_BUF_ERROR : Z_OK;
|
||||
r = Z_BUF_ERROR;
|
||||
while (true){
|
||||
|
||||
switch (this.mode){
|
||||
case HEAD:
|
||||
if(wrap==0){
|
||||
this.mode = BLOCKS;
|
||||
break;
|
||||
}
|
||||
|
||||
try { r=readBytes(2, r, f); }
|
||||
catch(Return e){ return e.r; }
|
||||
|
||||
if((wrap == 4 || (wrap&2)!=0) &&
|
||||
this.need == 0x8b1fL) { // gzip header
|
||||
if(wrap == 4){
|
||||
wrap = 2;
|
||||
}
|
||||
z.adler=new CRC32();
|
||||
checksum(2, this.need);
|
||||
|
||||
if(gheader==null)
|
||||
gheader=new GZIPHeader();
|
||||
|
||||
this.mode = FLAGS;
|
||||
break;
|
||||
}
|
||||
|
||||
if((wrap&2) != 0){
|
||||
this.mode = BAD;
|
||||
z.msg = "incorrect header check";
|
||||
break;
|
||||
}
|
||||
|
||||
flags = 0;
|
||||
|
||||
this.method = ((int)this.need)&0xff;
|
||||
b=((int)(this.need>>8))&0xff;
|
||||
|
||||
if(((wrap&1)==0 || // check if zlib header allowed
|
||||
(((this.method << 8)+b) % 31)!=0) &&
|
||||
(this.method&0xf)!=Z_DEFLATED){
|
||||
if(wrap == 4){
|
||||
z.next_in_index -= 2;
|
||||
z.avail_in += 2;
|
||||
z.total_in -= 2;
|
||||
wrap = 0;
|
||||
this.mode = BLOCKS;
|
||||
break;
|
||||
}
|
||||
this.mode = BAD;
|
||||
z.msg = "incorrect header check";
|
||||
// since zlib 1.2, it is allowted to inflateSync for this case.
|
||||
/*
|
||||
this.marker = 5; // can't try inflateSync
|
||||
*/
|
||||
break;
|
||||
}
|
||||
|
||||
if((this.method&0xf)!=Z_DEFLATED){
|
||||
this.mode = BAD;
|
||||
z.msg="unknown compression method";
|
||||
// since zlib 1.2, it is allowted to inflateSync for this case.
|
||||
/*
|
||||
this.marker = 5; // can't try inflateSync
|
||||
*/
|
||||
break;
|
||||
}
|
||||
|
||||
if(wrap == 4){
|
||||
wrap = 1;
|
||||
}
|
||||
|
||||
if((this.method>>4)+8>this.wbits){
|
||||
this.mode = BAD;
|
||||
z.msg="invalid window size";
|
||||
// since zlib 1.2, it is allowted to inflateSync for this case.
|
||||
/*
|
||||
this.marker = 5; // can't try inflateSync
|
||||
*/
|
||||
break;
|
||||
}
|
||||
|
||||
z.adler=new Adler32();
|
||||
|
||||
if((b&PRESET_DICT)==0){
|
||||
this.mode = BLOCKS;
|
||||
break;
|
||||
}
|
||||
this.mode = DICT4;
|
||||
case DICT4:
|
||||
|
||||
if(z.avail_in==0)return r;r=f;
|
||||
|
||||
z.avail_in--; z.total_in++;
|
||||
this.need=((z.next_in[z.next_in_index++]&0xff)<<24)&0xff000000L;
|
||||
this.mode=DICT3;
|
||||
case DICT3:
|
||||
|
||||
if(z.avail_in==0)return r;r=f;
|
||||
|
||||
z.avail_in--; z.total_in++;
|
||||
this.need+=((z.next_in[z.next_in_index++]&0xff)<<16)&0xff0000L;
|
||||
this.mode=DICT2;
|
||||
case DICT2:
|
||||
|
||||
if(z.avail_in==0)return r;r=f;
|
||||
|
||||
z.avail_in--; z.total_in++;
|
||||
this.need+=((z.next_in[z.next_in_index++]&0xff)<<8)&0xff00L;
|
||||
this.mode=DICT1;
|
||||
case DICT1:
|
||||
|
||||
if(z.avail_in==0)return r;r=f;
|
||||
|
||||
z.avail_in--; z.total_in++;
|
||||
this.need += (z.next_in[z.next_in_index++]&0xffL);
|
||||
z.adler.reset(this.need);
|
||||
this.mode = DICT0;
|
||||
return Z_NEED_DICT;
|
||||
case DICT0:
|
||||
this.mode = BAD;
|
||||
z.msg = "need dictionary";
|
||||
this.marker = 0; // can try inflateSync
|
||||
return Z_STREAM_ERROR;
|
||||
case BLOCKS:
|
||||
r = this.blocks.proc(r);
|
||||
if(r == Z_DATA_ERROR){
|
||||
this.mode = BAD;
|
||||
this.marker = 0; // can try inflateSync
|
||||
break;
|
||||
}
|
||||
if(r == Z_OK){
|
||||
r = f;
|
||||
}
|
||||
if(r != Z_STREAM_END){
|
||||
return r;
|
||||
}
|
||||
r = f;
|
||||
this.was=z.adler.getValue();
|
||||
this.blocks.reset();
|
||||
if(this.wrap==0){
|
||||
this.mode=DONE;
|
||||
break;
|
||||
}
|
||||
this.mode=CHECK4;
|
||||
case CHECK4:
|
||||
|
||||
if(z.avail_in==0)return r;r=f;
|
||||
|
||||
z.avail_in--; z.total_in++;
|
||||
this.need=((z.next_in[z.next_in_index++]&0xff)<<24)&0xff000000L;
|
||||
this.mode=CHECK3;
|
||||
case CHECK3:
|
||||
|
||||
if(z.avail_in==0)return r;r=f;
|
||||
|
||||
z.avail_in--; z.total_in++;
|
||||
this.need+=((z.next_in[z.next_in_index++]&0xff)<<16)&0xff0000L;
|
||||
this.mode = CHECK2;
|
||||
case CHECK2:
|
||||
|
||||
if(z.avail_in==0)return r;r=f;
|
||||
|
||||
z.avail_in--; z.total_in++;
|
||||
this.need+=((z.next_in[z.next_in_index++]&0xff)<<8)&0xff00L;
|
||||
this.mode = CHECK1;
|
||||
case CHECK1:
|
||||
|
||||
if(z.avail_in==0)return r;r=f;
|
||||
|
||||
z.avail_in--; z.total_in++;
|
||||
this.need+=(z.next_in[z.next_in_index++]&0xffL);
|
||||
|
||||
if(flags!=0){ // gzip
|
||||
this.need = ((this.need&0xff000000)>>24 |
|
||||
(this.need&0x00ff0000)>>8 |
|
||||
(this.need&0x0000ff00)<<8 |
|
||||
(this.need&0x0000ffff)<<24)&0xffffffffL;
|
||||
}
|
||||
|
||||
if(((int)(this.was)) != ((int)(this.need))){
|
||||
z.msg = "incorrect data check";
|
||||
// chack is delayed
|
||||
/*
|
||||
this.mode = BAD;
|
||||
this.marker = 5; // can't try inflateSync
|
||||
break;
|
||||
*/
|
||||
}
|
||||
else if(flags!=0 && gheader!=null){
|
||||
gheader.crc = this.need;
|
||||
}
|
||||
|
||||
this.mode = LENGTH;
|
||||
case LENGTH:
|
||||
if (wrap!=0 && flags!=0) {
|
||||
|
||||
try { r=readBytes(4, r, f); }
|
||||
catch(Return e){ return e.r; }
|
||||
|
||||
if(z.msg!=null && z.msg.equals("incorrect data check")){
|
||||
this.mode = BAD;
|
||||
this.marker = 5; // can't try inflateSync
|
||||
break;
|
||||
}
|
||||
|
||||
if (this.need != (z.total_out & 0xffffffffL)) {
|
||||
z.msg = "incorrect length check";
|
||||
this.mode = BAD;
|
||||
break;
|
||||
}
|
||||
z.msg = null;
|
||||
}
|
||||
else {
|
||||
if(z.msg!=null && z.msg.equals("incorrect data check")){
|
||||
this.mode = BAD;
|
||||
this.marker = 5; // can't try inflateSync
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
this.mode = DONE;
|
||||
case DONE:
|
||||
return Z_STREAM_END;
|
||||
case BAD:
|
||||
return Z_DATA_ERROR;
|
||||
|
||||
case FLAGS:
|
||||
|
||||
try { r=readBytes(2, r, f); }
|
||||
catch(Return e){ return e.r; }
|
||||
|
||||
flags = ((int)this.need)&0xffff;
|
||||
|
||||
if ((flags & 0xff) != Z_DEFLATED) {
|
||||
z.msg = "unknown compression method";
|
||||
this.mode = BAD;
|
||||
break;
|
||||
}
|
||||
if ((flags & 0xe000)!=0) {
|
||||
z.msg = "unknown header flags set";
|
||||
this.mode = BAD;
|
||||
break;
|
||||
}
|
||||
|
||||
if ((flags & 0x0200)!=0){
|
||||
checksum(2, this.need);
|
||||
}
|
||||
|
||||
this.mode = TIME;
|
||||
|
||||
case TIME:
|
||||
try { r=readBytes(4, r, f); }
|
||||
catch(Return e){ return e.r; }
|
||||
if(gheader!=null)
|
||||
gheader.time = this.need;
|
||||
if ((flags & 0x0200)!=0){
|
||||
checksum(4, this.need);
|
||||
}
|
||||
this.mode = OS;
|
||||
case OS:
|
||||
try { r=readBytes(2, r, f); }
|
||||
catch(Return e){ return e.r; }
|
||||
if(gheader!=null){
|
||||
gheader.xflags = ((int)this.need)&0xff;
|
||||
gheader.os = (((int)this.need)>>8)&0xff;
|
||||
}
|
||||
if ((flags & 0x0200)!=0){
|
||||
checksum(2, this.need);
|
||||
}
|
||||
this.mode = EXLEN;
|
||||
case EXLEN:
|
||||
if ((flags & 0x0400)!=0) {
|
||||
try { r=readBytes(2, r, f); }
|
||||
catch(Return e){ return e.r; }
|
||||
if(gheader!=null){
|
||||
gheader.extra = new byte[((int)this.need)&0xffff];
|
||||
}
|
||||
if ((flags & 0x0200)!=0){
|
||||
checksum(2, this.need);
|
||||
}
|
||||
}
|
||||
else if(gheader!=null){
|
||||
gheader.extra=null;
|
||||
}
|
||||
this.mode = EXTRA;
|
||||
|
||||
case EXTRA:
|
||||
if ((flags & 0x0400)!=0) {
|
||||
try {
|
||||
r=readBytes(r, f);
|
||||
if(gheader!=null){
|
||||
byte[] foo = tmp_string.toByteArray();
|
||||
tmp_string=null;
|
||||
if(foo.length == gheader.extra.length){
|
||||
System.arraycopy(foo, 0, gheader.extra, 0, foo.length);
|
||||
}
|
||||
else{
|
||||
z.msg = "bad extra field length";
|
||||
this.mode = BAD;
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
catch(Return e){ return e.r; }
|
||||
}
|
||||
else if(gheader!=null){
|
||||
gheader.extra=null;
|
||||
}
|
||||
this.mode = NAME;
|
||||
case NAME:
|
||||
if ((flags & 0x0800)!=0) {
|
||||
try {
|
||||
r=readString(r, f);
|
||||
if(gheader!=null){
|
||||
gheader.name=tmp_string.toByteArray();
|
||||
}
|
||||
tmp_string=null;
|
||||
}
|
||||
catch(Return e){ return e.r; }
|
||||
}
|
||||
else if(gheader!=null){
|
||||
gheader.name=null;
|
||||
}
|
||||
this.mode = COMMENT;
|
||||
case COMMENT:
|
||||
if ((flags & 0x1000)!=0) {
|
||||
try {
|
||||
r=readString(r, f);
|
||||
if(gheader!=null){
|
||||
gheader.comment=tmp_string.toByteArray();
|
||||
}
|
||||
tmp_string=null;
|
||||
}
|
||||
catch(Return e){ return e.r; }
|
||||
}
|
||||
else if(gheader!=null){
|
||||
gheader.comment=null;
|
||||
}
|
||||
this.mode = HCRC;
|
||||
case HCRC:
|
||||
if ((flags & 0x0200)!=0) {
|
||||
try { r=readBytes(2, r, f); }
|
||||
catch(Return e){ return e.r; }
|
||||
if(gheader!=null){
|
||||
gheader.hcrc=(int)(this.need&0xffff);
|
||||
}
|
||||
if(this.need != (z.adler.getValue()&0xffffL)){
|
||||
this.mode = BAD;
|
||||
z.msg = "header crc mismatch";
|
||||
this.marker = 5; // can't try inflateSync
|
||||
break;
|
||||
}
|
||||
}
|
||||
z.adler = new CRC32();
|
||||
|
||||
this.mode = BLOCKS;
|
||||
break;
|
||||
default:
|
||||
return Z_STREAM_ERROR;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
int inflateSetDictionary(byte[] dictionary, int dictLength){
|
||||
if(z==null || (this.mode != DICT0 && this.wrap != 0)){
|
||||
return Z_STREAM_ERROR;
|
||||
}
|
||||
|
||||
int index=0;
|
||||
int length = dictLength;
|
||||
|
||||
if(this.mode==DICT0){
|
||||
long adler_need=z.adler.getValue();
|
||||
z.adler.reset();
|
||||
z.adler.update(dictionary, 0, dictLength);
|
||||
if(z.adler.getValue()!=adler_need){
|
||||
return Z_DATA_ERROR;
|
||||
}
|
||||
}
|
||||
|
||||
z.adler.reset();
|
||||
|
||||
if(length >= (1<<this.wbits)){
|
||||
length = (1<<this.wbits)-1;
|
||||
index=dictLength - length;
|
||||
}
|
||||
this.blocks.set_dictionary(dictionary, index, length);
|
||||
this.mode = BLOCKS;
|
||||
return Z_OK;
|
||||
}
|
||||
|
||||
static private byte[] mark = {(byte)0, (byte)0, (byte)0xff, (byte)0xff};
|
||||
|
||||
int inflateSync(){
|
||||
int n; // number of bytes to look at
|
||||
int p; // pointer to bytes
|
||||
int m; // number of marker bytes found in a row
|
||||
long r, w; // temporaries to save total_in and total_out
|
||||
|
||||
// set up
|
||||
if(z == null)
|
||||
return Z_STREAM_ERROR;
|
||||
if(this.mode != BAD){
|
||||
this.mode = BAD;
|
||||
this.marker = 0;
|
||||
}
|
||||
if((n=z.avail_in)==0)
|
||||
return Z_BUF_ERROR;
|
||||
|
||||
p=z.next_in_index;
|
||||
m=this.marker;
|
||||
// search
|
||||
while (n!=0 && m < 4){
|
||||
if(z.next_in[p] == mark[m]){
|
||||
m++;
|
||||
}
|
||||
else if(z.next_in[p]!=0){
|
||||
m = 0;
|
||||
}
|
||||
else{
|
||||
m = 4 - m;
|
||||
}
|
||||
p++; n--;
|
||||
}
|
||||
|
||||
// restore
|
||||
z.total_in += p-z.next_in_index;
|
||||
z.next_in_index = p;
|
||||
z.avail_in = n;
|
||||
this.marker = m;
|
||||
|
||||
// return no joy or set up to restart on a new block
|
||||
if(m != 4){
|
||||
return Z_DATA_ERROR;
|
||||
}
|
||||
r=z.total_in; w=z.total_out;
|
||||
inflateReset();
|
||||
z.total_in=r; z.total_out = w;
|
||||
this.mode = BLOCKS;
|
||||
|
||||
return Z_OK;
|
||||
}
|
||||
|
||||
// Returns true if inflate is currently at the end of a block generated
|
||||
// by Z_SYNC_FLUSH or Z_FULL_FLUSH. This function is used by one PPP
|
||||
// implementation to provide an additional safety check. PPP uses Z_SYNC_FLUSH
|
||||
// but removes the length bytes of the resulting empty stored block. When
|
||||
// decompressing, PPP checks that at the end of input packet, inflate is
|
||||
// waiting for these length bytes.
|
||||
int inflateSyncPoint(){
|
||||
if(z == null || this.blocks == null)
|
||||
return Z_STREAM_ERROR;
|
||||
return this.blocks.sync_point();
|
||||
}
|
||||
|
||||
private int readBytes(int n, int r, int f) throws Return{
|
||||
if(need_bytes == -1){
|
||||
need_bytes=n;
|
||||
this.need=0;
|
||||
}
|
||||
while(need_bytes>0){
|
||||
if(z.avail_in==0){ throw new Return(r); }; r=f;
|
||||
z.avail_in--; z.total_in++;
|
||||
this.need = this.need |
|
||||
((z.next_in[z.next_in_index++]&0xff)<<((n-need_bytes)*8));
|
||||
need_bytes--;
|
||||
}
|
||||
if(n==2){
|
||||
this.need&=0xffffL;
|
||||
}
|
||||
else if(n==4) {
|
||||
this.need&=0xffffffffL;
|
||||
}
|
||||
need_bytes=-1;
|
||||
return r;
|
||||
}
|
||||
class Return extends Exception{
|
||||
int r;
|
||||
Return(int r){this.r=r; }
|
||||
}
|
||||
|
||||
private java.io.ByteArrayOutputStream tmp_string = null;
|
||||
private int readString(int r, int f) throws Return{
|
||||
if(tmp_string == null){
|
||||
tmp_string=new java.io.ByteArrayOutputStream();
|
||||
}
|
||||
int b=0;
|
||||
do {
|
||||
if(z.avail_in==0){ throw new Return(r); }; r=f;
|
||||
z.avail_in--; z.total_in++;
|
||||
b = z.next_in[z.next_in_index];
|
||||
if(b!=0) tmp_string.write(z.next_in, z.next_in_index, 1);
|
||||
z.adler.update(z.next_in, z.next_in_index, 1);
|
||||
z.next_in_index++;
|
||||
}while(b!=0);
|
||||
return r;
|
||||
}
|
||||
|
||||
private int readBytes(int r, int f) throws Return{
|
||||
if(tmp_string == null){
|
||||
tmp_string=new java.io.ByteArrayOutputStream();
|
||||
}
|
||||
int b=0;
|
||||
while(this.need>0){
|
||||
if(z.avail_in==0){ throw new Return(r); }; r=f;
|
||||
z.avail_in--; z.total_in++;
|
||||
b = z.next_in[z.next_in_index];
|
||||
tmp_string.write(z.next_in, z.next_in_index, 1);
|
||||
z.adler.update(z.next_in, z.next_in_index, 1);
|
||||
z.next_in_index++;
|
||||
this.need--;
|
||||
}
|
||||
return r;
|
||||
}
|
||||
|
||||
private void checksum(int n, long v){
|
||||
for(int i=0; i<n; i++){
|
||||
crcbuf[i]=(byte)(v&0xff);
|
||||
v>>=8;
|
||||
}
|
||||
z.adler.update(crcbuf, 0, n);
|
||||
}
|
||||
|
||||
public GZIPHeader getGZIPHeader(){
|
||||
return gheader;
|
||||
}
|
||||
|
||||
boolean inParsingHeader(){
|
||||
switch(mode){
|
||||
case HEAD:
|
||||
case DICT4:
|
||||
case DICT3:
|
||||
case DICT2:
|
||||
case DICT1:
|
||||
case FLAGS:
|
||||
case TIME:
|
||||
case OS:
|
||||
case EXLEN:
|
||||
case EXTRA:
|
||||
case NAME:
|
||||
case COMMENT:
|
||||
case HCRC:
|
||||
return true;
|
||||
default:
|
||||
return false;
|
||||
}
|
||||
}
|
||||
}
|
@ -1,168 +0,0 @@
|
||||
/* -*-mode:java; c-basic-offset:2; indent-tabs-mode:nil -*- */
|
||||
/*
|
||||
Copyright (c) 2011 ymnk, JCraft,Inc. All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are met:
|
||||
|
||||
1. Redistributions of source code must retain the above copyright notice,
|
||||
this list of conditions and the following disclaimer.
|
||||
|
||||
2. Redistributions in binary form must reproduce the above copyright
|
||||
notice, this list of conditions and the following disclaimer in
|
||||
the documentation and/or other materials provided with the distribution.
|
||||
|
||||
3. The names of the authors may not be used to endorse or promote products
|
||||
derived from this software without specific prior written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
|
||||
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
||||
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
|
||||
INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||||
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
|
||||
OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||||
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||||
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
|
||||
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
/*
|
||||
* This program is based on zlib-1.1.3, so all credit should go authors
|
||||
* Jean-loup Gailly(jloup@gzip.org) and Mark Adler(madler@alumni.caltech.edu)
|
||||
* and contributors of zlib.
|
||||
*/
|
||||
|
||||
package com.jcraft.jzlib;
|
||||
|
||||
final public class Inflater extends ZStream{
|
||||
|
||||
static final private int MAX_WBITS=15; // 32K LZ77 window
|
||||
static final private int DEF_WBITS=MAX_WBITS;
|
||||
|
||||
static final private int Z_NO_FLUSH=0;
|
||||
static final private int Z_PARTIAL_FLUSH=1;
|
||||
static final private int Z_SYNC_FLUSH=2;
|
||||
static final private int Z_FULL_FLUSH=3;
|
||||
static final private int Z_FINISH=4;
|
||||
|
||||
static final private int MAX_MEM_LEVEL=9;
|
||||
|
||||
static final private int Z_OK=0;
|
||||
static final private int Z_STREAM_END=1;
|
||||
static final private int Z_NEED_DICT=2;
|
||||
static final private int Z_ERRNO=-1;
|
||||
static final private int Z_STREAM_ERROR=-2;
|
||||
static final private int Z_DATA_ERROR=-3;
|
||||
static final private int Z_MEM_ERROR=-4;
|
||||
static final private int Z_BUF_ERROR=-5;
|
||||
static final private int Z_VERSION_ERROR=-6;
|
||||
|
||||
public Inflater() {
|
||||
super();
|
||||
init();
|
||||
}
|
||||
|
||||
public Inflater(JZlib.WrapperType wrapperType) throws GZIPException {
|
||||
this(DEF_WBITS, wrapperType);
|
||||
}
|
||||
|
||||
public Inflater(int w, JZlib.WrapperType wrapperType) throws GZIPException {
|
||||
super();
|
||||
int ret = init(w, wrapperType);
|
||||
if(ret!=Z_OK)
|
||||
throw new GZIPException(ret+": "+msg);
|
||||
}
|
||||
|
||||
public Inflater(int w) throws GZIPException {
|
||||
this(w, false);
|
||||
}
|
||||
|
||||
public Inflater(boolean nowrap) throws GZIPException {
|
||||
this(DEF_WBITS, nowrap);
|
||||
}
|
||||
|
||||
public Inflater(int w, boolean nowrap) throws GZIPException {
|
||||
super();
|
||||
int ret = init(w, nowrap);
|
||||
if(ret!=Z_OK)
|
||||
throw new GZIPException(ret+": "+msg);
|
||||
}
|
||||
|
||||
private boolean finished = false;
|
||||
|
||||
public int init(){
|
||||
return init(DEF_WBITS);
|
||||
}
|
||||
|
||||
public int init(JZlib.WrapperType wrapperType){
|
||||
return init(DEF_WBITS, wrapperType);
|
||||
}
|
||||
|
||||
public int init(int w, JZlib.WrapperType wrapperType) {
|
||||
boolean nowrap = false;
|
||||
if(wrapperType == JZlib.W_NONE){
|
||||
nowrap = true;
|
||||
}
|
||||
else if(wrapperType == JZlib.W_GZIP) {
|
||||
w += 16;
|
||||
}
|
||||
else if(wrapperType == JZlib.W_ANY) {
|
||||
w |= Inflate.INFLATE_ANY;
|
||||
}
|
||||
else if(wrapperType == JZlib.W_ZLIB) {
|
||||
}
|
||||
return init(w, nowrap);
|
||||
}
|
||||
|
||||
public int init(boolean nowrap){
|
||||
return init(DEF_WBITS, nowrap);
|
||||
}
|
||||
|
||||
public int init(int w){
|
||||
return init(w, false);
|
||||
}
|
||||
|
||||
public int init(int w, boolean nowrap){
|
||||
finished = false;
|
||||
istate=new Inflate(this);
|
||||
return istate.inflateInit(nowrap?-w:w);
|
||||
}
|
||||
|
||||
public int inflate(int f){
|
||||
if(istate==null) return Z_STREAM_ERROR;
|
||||
int ret = istate.inflate(f);
|
||||
if(ret == Z_STREAM_END)
|
||||
finished = true;
|
||||
return ret;
|
||||
}
|
||||
|
||||
public int end(){
|
||||
finished = true;
|
||||
if(istate==null) return Z_STREAM_ERROR;
|
||||
int ret=istate.inflateEnd();
|
||||
// istate = null;
|
||||
return ret;
|
||||
}
|
||||
|
||||
public int sync(){
|
||||
if(istate == null)
|
||||
return Z_STREAM_ERROR;
|
||||
return istate.inflateSync();
|
||||
}
|
||||
|
||||
public int syncPoint(){
|
||||
if(istate == null)
|
||||
return Z_STREAM_ERROR;
|
||||
return istate.inflateSyncPoint();
|
||||
}
|
||||
|
||||
public int setDictionary(byte[] dictionary, int dictLength){
|
||||
if(istate == null)
|
||||
return Z_STREAM_ERROR;
|
||||
return istate.inflateSetDictionary(dictionary, dictLength);
|
||||
}
|
||||
|
||||
public boolean finished(){
|
||||
return istate.mode==12 /*DONE*/;
|
||||
}
|
||||
}
|
@ -1,247 +0,0 @@
|
||||
/* -*-mode:java; c-basic-offset:2; indent-tabs-mode:nil -*- */
|
||||
/*
|
||||
Copyright (c) 2011 ymnk, JCraft,Inc. All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are met:
|
||||
|
||||
1. Redistributions of source code must retain the above copyright notice,
|
||||
this list of conditions and the following disclaimer.
|
||||
|
||||
2. Redistributions in binary form must reproduce the above copyright
|
||||
notice, this list of conditions and the following disclaimer in
|
||||
the documentation and/or other materials provided with the distribution.
|
||||
|
||||
3. The names of the authors may not be used to endorse or promote products
|
||||
derived from this software without specific prior written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
|
||||
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
||||
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
|
||||
INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||||
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
|
||||
OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||||
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||||
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
|
||||
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
package com.jcraft.jzlib;
|
||||
import java.io.*;
|
||||
|
||||
public class InflaterInputStream extends FilterInputStream {
|
||||
protected final Inflater inflater;
|
||||
protected byte[] buf;
|
||||
|
||||
private boolean closed = false;
|
||||
|
||||
private boolean eof = false;
|
||||
|
||||
private boolean close_in = true;
|
||||
|
||||
protected static final int DEFAULT_BUFSIZE = 512;
|
||||
|
||||
public InflaterInputStream(InputStream in) throws IOException {
|
||||
this(in, false);
|
||||
}
|
||||
|
||||
public InflaterInputStream(InputStream in, boolean nowrap) throws IOException {
|
||||
this(in, new Inflater(nowrap));
|
||||
myinflater = true;
|
||||
}
|
||||
|
||||
public InflaterInputStream(InputStream in, Inflater inflater) throws IOException {
|
||||
this(in, inflater, DEFAULT_BUFSIZE);
|
||||
}
|
||||
|
||||
public InflaterInputStream(InputStream in,
|
||||
Inflater inflater, int size) throws IOException {
|
||||
this(in, inflater, size, true);
|
||||
}
|
||||
|
||||
public InflaterInputStream(InputStream in,
|
||||
Inflater inflater,
|
||||
int size, boolean close_in) throws IOException {
|
||||
super(in);
|
||||
if (in == null || inflater == null) {
|
||||
throw new NullPointerException();
|
||||
}
|
||||
else if (size <= 0) {
|
||||
throw new IllegalArgumentException("buffer size must be greater than 0");
|
||||
}
|
||||
this.inflater = inflater;
|
||||
buf = new byte[size];
|
||||
this.close_in = close_in;
|
||||
}
|
||||
|
||||
protected boolean myinflater = false;
|
||||
|
||||
private byte[] byte1 = new byte[1];
|
||||
|
||||
public int read() throws IOException {
|
||||
if (closed) { throw new IOException("Stream closed"); }
|
||||
return read(byte1, 0, 1) == -1 ? -1 : byte1[0] & 0xff;
|
||||
}
|
||||
|
||||
public int read(byte[] b, int off, int len) throws IOException {
|
||||
if (closed) { throw new IOException("Stream closed"); }
|
||||
if (b == null) {
|
||||
throw new NullPointerException();
|
||||
}
|
||||
else if (off < 0 || len < 0 || len > b.length - off) {
|
||||
throw new IndexOutOfBoundsException();
|
||||
}
|
||||
else if (len == 0) {
|
||||
return 0;
|
||||
}
|
||||
else if (eof) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
int n = 0;
|
||||
inflater.setOutput(b, off, len);
|
||||
while(!eof) {
|
||||
if(inflater.avail_in==0)
|
||||
fill();
|
||||
int err = inflater.inflate(JZlib.Z_NO_FLUSH);
|
||||
n += inflater.next_out_index - off;
|
||||
off = inflater.next_out_index;
|
||||
switch(err) {
|
||||
case JZlib.Z_DATA_ERROR:
|
||||
throw new IOException(inflater.msg);
|
||||
case JZlib.Z_STREAM_END:
|
||||
case JZlib.Z_NEED_DICT:
|
||||
eof = true;
|
||||
if(err == JZlib.Z_NEED_DICT)
|
||||
return -1;
|
||||
break;
|
||||
default:
|
||||
}
|
||||
if(inflater.avail_out==0)
|
||||
break;
|
||||
}
|
||||
return n;
|
||||
}
|
||||
|
||||
public int available() throws IOException {
|
||||
if (closed) { throw new IOException("Stream closed"); }
|
||||
if (eof) {
|
||||
return 0;
|
||||
}
|
||||
else {
|
||||
return 1;
|
||||
}
|
||||
}
|
||||
|
||||
private byte[] b = new byte[512];
|
||||
|
||||
public long skip(long n) throws IOException {
|
||||
if (n < 0) {
|
||||
throw new IllegalArgumentException("negative skip length");
|
||||
}
|
||||
|
||||
if (closed) { throw new IOException("Stream closed"); }
|
||||
|
||||
int max = (int)Math.min(n, Integer.MAX_VALUE);
|
||||
int total = 0;
|
||||
while (total < max) {
|
||||
int len = max - total;
|
||||
if (len > b.length) {
|
||||
len = b.length;
|
||||
}
|
||||
len = read(b, 0, len);
|
||||
if (len == -1) {
|
||||
eof = true;
|
||||
break;
|
||||
}
|
||||
total += len;
|
||||
}
|
||||
return total;
|
||||
}
|
||||
|
||||
public void close() throws IOException {
|
||||
if (!closed) {
|
||||
if (myinflater)
|
||||
inflater.end();
|
||||
if(close_in)
|
||||
in.close();
|
||||
closed = true;
|
||||
}
|
||||
}
|
||||
|
||||
protected void fill() throws IOException {
|
||||
if (closed) { throw new IOException("Stream closed"); }
|
||||
int len = in.read(buf, 0, buf.length);
|
||||
if (len == -1) {
|
||||
if(inflater.istate.wrap == 0 &&
|
||||
!inflater.finished()){
|
||||
buf[0]=0;
|
||||
len=1;
|
||||
}
|
||||
else if(inflater.istate.was != -1){ // in reading trailer
|
||||
throw new IOException("footer is not found");
|
||||
}
|
||||
else{
|
||||
throw new EOFException("Unexpected end of ZLIB input stream");
|
||||
}
|
||||
}
|
||||
inflater.setInput(buf, 0, len, true);
|
||||
}
|
||||
|
||||
public boolean markSupported() {
|
||||
return false;
|
||||
}
|
||||
|
||||
public synchronized void mark(int readlimit) {
|
||||
}
|
||||
|
||||
public synchronized void reset() throws IOException {
|
||||
throw new IOException("mark/reset not supported");
|
||||
}
|
||||
|
||||
public long getTotalIn() {
|
||||
return inflater.getTotalIn();
|
||||
}
|
||||
|
||||
public long getTotalOut() {
|
||||
return inflater.getTotalOut();
|
||||
}
|
||||
|
||||
public byte[] getAvailIn() {
|
||||
if(inflater.avail_in<=0)
|
||||
return null;
|
||||
byte[] tmp = new byte[inflater.avail_in];
|
||||
System.arraycopy(inflater.next_in, inflater.next_in_index,
|
||||
tmp, 0, inflater.avail_in);
|
||||
return tmp;
|
||||
}
|
||||
|
||||
public void readHeader() throws IOException {
|
||||
|
||||
byte[] empty = "".getBytes();
|
||||
inflater.setInput(empty, 0, 0, false);
|
||||
inflater.setOutput(empty, 0, 0);
|
||||
|
||||
int err = inflater.inflate(JZlib.Z_NO_FLUSH);
|
||||
if(!inflater.istate.inParsingHeader()){
|
||||
return;
|
||||
}
|
||||
|
||||
byte[] b1 = new byte[1];
|
||||
do{
|
||||
int i = in.read(b1);
|
||||
if(i<=0)
|
||||
throw new IOException("no input");
|
||||
inflater.setInput(b1);
|
||||
err = inflater.inflate(JZlib.Z_NO_FLUSH);
|
||||
if(err!=0/*Z_OK*/)
|
||||
throw new IOException(inflater.msg);
|
||||
}
|
||||
while(inflater.istate.inParsingHeader());
|
||||
}
|
||||
|
||||
public Inflater getInflater(){
|
||||
return inflater;
|
||||
}
|
||||
}
|
@ -1,92 +0,0 @@
|
||||
/* -*-mode:java; c-basic-offset:2; -*- */
|
||||
/*
|
||||
Copyright (c) 2011 ymnk, JCraft,Inc. All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are met:
|
||||
|
||||
1. Redistributions of source code must retain the above copyright notice,
|
||||
this list of conditions and the following disclaimer.
|
||||
|
||||
2. Redistributions in binary form must reproduce the above copyright
|
||||
notice, this list of conditions and the following disclaimer in
|
||||
the documentation and/or other materials provided with the distribution.
|
||||
|
||||
3. The names of the authors may not be used to endorse or promote products
|
||||
derived from this software without specific prior written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
|
||||
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
||||
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
|
||||
INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||||
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
|
||||
OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||||
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||||
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
|
||||
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
/*
|
||||
* This program is based on zlib-1.1.3, so all credit should go authors
|
||||
* Jean-loup Gailly(jloup@gzip.org) and Mark Adler(madler@alumni.caltech.edu)
|
||||
* and contributors of zlib.
|
||||
*/
|
||||
|
||||
package com.jcraft.jzlib;
|
||||
|
||||
final public class JZlib{
|
||||
private static final String version="1.1.0";
|
||||
public static String version(){return version;}
|
||||
|
||||
static final public int MAX_WBITS=15; // 32K LZ77 window
|
||||
static final public int DEF_WBITS=MAX_WBITS;
|
||||
|
||||
public enum WrapperType {
|
||||
NONE, ZLIB, GZIP, ANY
|
||||
}
|
||||
|
||||
public static final WrapperType W_NONE = WrapperType.NONE;
|
||||
public static final WrapperType W_ZLIB = WrapperType.ZLIB;
|
||||
public static final WrapperType W_GZIP = WrapperType.GZIP;
|
||||
public static final WrapperType W_ANY = WrapperType.ANY;
|
||||
|
||||
// compression levels
|
||||
static final public int Z_NO_COMPRESSION=0;
|
||||
static final public int Z_BEST_SPEED=1;
|
||||
static final public int Z_BEST_COMPRESSION=9;
|
||||
static final public int Z_DEFAULT_COMPRESSION=(-1);
|
||||
|
||||
// compression strategy
|
||||
static final public int Z_FILTERED=1;
|
||||
static final public int Z_HUFFMAN_ONLY=2;
|
||||
static final public int Z_DEFAULT_STRATEGY=0;
|
||||
|
||||
static final public int Z_NO_FLUSH=0;
|
||||
static final public int Z_PARTIAL_FLUSH=1;
|
||||
static final public int Z_SYNC_FLUSH=2;
|
||||
static final public int Z_FULL_FLUSH=3;
|
||||
static final public int Z_FINISH=4;
|
||||
|
||||
static final public int Z_OK=0;
|
||||
static final public int Z_STREAM_END=1;
|
||||
static final public int Z_NEED_DICT=2;
|
||||
static final public int Z_ERRNO=-1;
|
||||
static final public int Z_STREAM_ERROR=-2;
|
||||
static final public int Z_DATA_ERROR=-3;
|
||||
static final public int Z_MEM_ERROR=-4;
|
||||
static final public int Z_BUF_ERROR=-5;
|
||||
static final public int Z_VERSION_ERROR=-6;
|
||||
|
||||
// The three kinds of block type
|
||||
static final public byte Z_BINARY = 0;
|
||||
static final public byte Z_ASCII = 1;
|
||||
static final public byte Z_UNKNOWN = 2;
|
||||
|
||||
public static long adler32_combine(long adler1, long adler2, long len2){
|
||||
return Adler32.combine(adler1, adler2, len2);
|
||||
}
|
||||
|
||||
public static long crc32_combine(long crc1, long crc2, long len2){
|
||||
return CRC32.combine(crc1, crc2, len2);
|
||||
}
|
||||
}
|
@ -1,148 +0,0 @@
|
||||
/* -*-mode:java; c-basic-offset:2; -*- */
|
||||
/*
|
||||
Copyright (c) 2000,2001,2002,2003 ymnk, JCraft,Inc. All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are met:
|
||||
|
||||
1. Redistributions of source code must retain the above copyright notice,
|
||||
this list of conditions and the following disclaimer.
|
||||
|
||||
2. Redistributions in binary form must reproduce the above copyright
|
||||
notice, this list of conditions and the following disclaimer in
|
||||
the documentation and/or other materials provided with the distribution.
|
||||
|
||||
3. The names of the authors may not be used to endorse or promote products
|
||||
derived from this software without specific prior written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
|
||||
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
||||
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
|
||||
INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||||
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
|
||||
OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||||
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||||
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
|
||||
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
/*
|
||||
* This program is based on zlib-1.1.3, so all credit should go authors
|
||||
* Jean-loup Gailly(jloup@gzip.org) and Mark Adler(madler@alumni.caltech.edu)
|
||||
* and contributors of zlib.
|
||||
*/
|
||||
|
||||
package com.jcraft.jzlib;
|
||||
|
||||
final class StaticTree{
|
||||
static final private int MAX_BITS=15;
|
||||
|
||||
static final private int BL_CODES=19;
|
||||
static final private int D_CODES=30;
|
||||
static final private int LITERALS=256;
|
||||
static final private int LENGTH_CODES=29;
|
||||
static final private int L_CODES=(LITERALS+1+LENGTH_CODES);
|
||||
|
||||
// Bit length codes must not exceed MAX_BL_BITS bits
|
||||
static final int MAX_BL_BITS=7;
|
||||
|
||||
static final short[] static_ltree = {
|
||||
12, 8, 140, 8, 76, 8, 204, 8, 44, 8,
|
||||
172, 8, 108, 8, 236, 8, 28, 8, 156, 8,
|
||||
92, 8, 220, 8, 60, 8, 188, 8, 124, 8,
|
||||
252, 8, 2, 8, 130, 8, 66, 8, 194, 8,
|
||||
34, 8, 162, 8, 98, 8, 226, 8, 18, 8,
|
||||
146, 8, 82, 8, 210, 8, 50, 8, 178, 8,
|
||||
114, 8, 242, 8, 10, 8, 138, 8, 74, 8,
|
||||
202, 8, 42, 8, 170, 8, 106, 8, 234, 8,
|
||||
26, 8, 154, 8, 90, 8, 218, 8, 58, 8,
|
||||
186, 8, 122, 8, 250, 8, 6, 8, 134, 8,
|
||||
70, 8, 198, 8, 38, 8, 166, 8, 102, 8,
|
||||
230, 8, 22, 8, 150, 8, 86, 8, 214, 8,
|
||||
54, 8, 182, 8, 118, 8, 246, 8, 14, 8,
|
||||
142, 8, 78, 8, 206, 8, 46, 8, 174, 8,
|
||||
110, 8, 238, 8, 30, 8, 158, 8, 94, 8,
|
||||
222, 8, 62, 8, 190, 8, 126, 8, 254, 8,
|
||||
1, 8, 129, 8, 65, 8, 193, 8, 33, 8,
|
||||
161, 8, 97, 8, 225, 8, 17, 8, 145, 8,
|
||||
81, 8, 209, 8, 49, 8, 177, 8, 113, 8,
|
||||
241, 8, 9, 8, 137, 8, 73, 8, 201, 8,
|
||||
41, 8, 169, 8, 105, 8, 233, 8, 25, 8,
|
||||
153, 8, 89, 8, 217, 8, 57, 8, 185, 8,
|
||||
121, 8, 249, 8, 5, 8, 133, 8, 69, 8,
|
||||
197, 8, 37, 8, 165, 8, 101, 8, 229, 8,
|
||||
21, 8, 149, 8, 85, 8, 213, 8, 53, 8,
|
||||
181, 8, 117, 8, 245, 8, 13, 8, 141, 8,
|
||||
77, 8, 205, 8, 45, 8, 173, 8, 109, 8,
|
||||
237, 8, 29, 8, 157, 8, 93, 8, 221, 8,
|
||||
61, 8, 189, 8, 125, 8, 253, 8, 19, 9,
|
||||
275, 9, 147, 9, 403, 9, 83, 9, 339, 9,
|
||||
211, 9, 467, 9, 51, 9, 307, 9, 179, 9,
|
||||
435, 9, 115, 9, 371, 9, 243, 9, 499, 9,
|
||||
11, 9, 267, 9, 139, 9, 395, 9, 75, 9,
|
||||
331, 9, 203, 9, 459, 9, 43, 9, 299, 9,
|
||||
171, 9, 427, 9, 107, 9, 363, 9, 235, 9,
|
||||
491, 9, 27, 9, 283, 9, 155, 9, 411, 9,
|
||||
91, 9, 347, 9, 219, 9, 475, 9, 59, 9,
|
||||
315, 9, 187, 9, 443, 9, 123, 9, 379, 9,
|
||||
251, 9, 507, 9, 7, 9, 263, 9, 135, 9,
|
||||
391, 9, 71, 9, 327, 9, 199, 9, 455, 9,
|
||||
39, 9, 295, 9, 167, 9, 423, 9, 103, 9,
|
||||
359, 9, 231, 9, 487, 9, 23, 9, 279, 9,
|
||||
151, 9, 407, 9, 87, 9, 343, 9, 215, 9,
|
||||
471, 9, 55, 9, 311, 9, 183, 9, 439, 9,
|
||||
119, 9, 375, 9, 247, 9, 503, 9, 15, 9,
|
||||
271, 9, 143, 9, 399, 9, 79, 9, 335, 9,
|
||||
207, 9, 463, 9, 47, 9, 303, 9, 175, 9,
|
||||
431, 9, 111, 9, 367, 9, 239, 9, 495, 9,
|
||||
31, 9, 287, 9, 159, 9, 415, 9, 95, 9,
|
||||
351, 9, 223, 9, 479, 9, 63, 9, 319, 9,
|
||||
191, 9, 447, 9, 127, 9, 383, 9, 255, 9,
|
||||
511, 9, 0, 7, 64, 7, 32, 7, 96, 7,
|
||||
16, 7, 80, 7, 48, 7, 112, 7, 8, 7,
|
||||
72, 7, 40, 7, 104, 7, 24, 7, 88, 7,
|
||||
56, 7, 120, 7, 4, 7, 68, 7, 36, 7,
|
||||
100, 7, 20, 7, 84, 7, 52, 7, 116, 7,
|
||||
3, 8, 131, 8, 67, 8, 195, 8, 35, 8,
|
||||
163, 8, 99, 8, 227, 8
|
||||
};
|
||||
|
||||
static final short[] static_dtree = {
|
||||
0, 5, 16, 5, 8, 5, 24, 5, 4, 5,
|
||||
20, 5, 12, 5, 28, 5, 2, 5, 18, 5,
|
||||
10, 5, 26, 5, 6, 5, 22, 5, 14, 5,
|
||||
30, 5, 1, 5, 17, 5, 9, 5, 25, 5,
|
||||
5, 5, 21, 5, 13, 5, 29, 5, 3, 5,
|
||||
19, 5, 11, 5, 27, 5, 7, 5, 23, 5
|
||||
};
|
||||
|
||||
static StaticTree static_l_desc =
|
||||
new StaticTree(static_ltree, Tree.extra_lbits,
|
||||
LITERALS+1, L_CODES, MAX_BITS);
|
||||
|
||||
static StaticTree static_d_desc =
|
||||
new StaticTree(static_dtree, Tree.extra_dbits,
|
||||
0, D_CODES, MAX_BITS);
|
||||
|
||||
static StaticTree static_bl_desc =
|
||||
new StaticTree(null, Tree.extra_blbits,
|
||||
0, BL_CODES, MAX_BL_BITS);
|
||||
|
||||
short[] static_tree; // static tree or null
|
||||
int[] extra_bits; // extra bits for each code or null
|
||||
int extra_base; // base index for extra_bits
|
||||
int elems; // max number of elements in the tree
|
||||
int max_length; // max bit length for the codes
|
||||
|
||||
private StaticTree(short[] static_tree,
|
||||
int[] extra_bits,
|
||||
int extra_base,
|
||||
int elems,
|
||||
int max_length){
|
||||
this.static_tree=static_tree;
|
||||
this.extra_bits=extra_bits;
|
||||
this.extra_base=extra_base;
|
||||
this.elems=elems;
|
||||
this.max_length=max_length;
|
||||
}
|
||||
}
|
@ -1,367 +0,0 @@
|
||||
/* -*-mode:java; c-basic-offset:2; -*- */
|
||||
/*
|
||||
Copyright (c) 2000,2001,2002,2003 ymnk, JCraft,Inc. All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are met:
|
||||
|
||||
1. Redistributions of source code must retain the above copyright notice,
|
||||
this list of conditions and the following disclaimer.
|
||||
|
||||
2. Redistributions in binary form must reproduce the above copyright
|
||||
notice, this list of conditions and the following disclaimer in
|
||||
the documentation and/or other materials provided with the distribution.
|
||||
|
||||
3. The names of the authors may not be used to endorse or promote products
|
||||
derived from this software without specific prior written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
|
||||
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
||||
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
|
||||
INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||||
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
|
||||
OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||||
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||||
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
|
||||
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
/*
|
||||
* This program is based on zlib-1.1.3, so all credit should go authors
|
||||
* Jean-loup Gailly(jloup@gzip.org) and Mark Adler(madler@alumni.caltech.edu)
|
||||
* and contributors of zlib.
|
||||
*/
|
||||
|
||||
package com.jcraft.jzlib;
|
||||
|
||||
final class Tree{
|
||||
static final private int MAX_BITS=15;
|
||||
static final private int BL_CODES=19;
|
||||
static final private int D_CODES=30;
|
||||
static final private int LITERALS=256;
|
||||
static final private int LENGTH_CODES=29;
|
||||
static final private int L_CODES=(LITERALS+1+LENGTH_CODES);
|
||||
static final private int HEAP_SIZE=(2*L_CODES+1);
|
||||
|
||||
// Bit length codes must not exceed MAX_BL_BITS bits
|
||||
static final int MAX_BL_BITS=7;
|
||||
|
||||
// end of block literal code
|
||||
static final int END_BLOCK=256;
|
||||
|
||||
// repeat previous bit length 3-6 times (2 bits of repeat count)
|
||||
static final int REP_3_6=16;
|
||||
|
||||
// repeat a zero length 3-10 times (3 bits of repeat count)
|
||||
static final int REPZ_3_10=17;
|
||||
|
||||
// repeat a zero length 11-138 times (7 bits of repeat count)
|
||||
static final int REPZ_11_138=18;
|
||||
|
||||
// extra bits for each length code
|
||||
static final int[] extra_lbits={
|
||||
0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0
|
||||
};
|
||||
|
||||
// extra bits for each distance code
|
||||
static final int[] extra_dbits={
|
||||
0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13
|
||||
};
|
||||
|
||||
// extra bits for each bit length code
|
||||
static final int[] extra_blbits={
|
||||
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7
|
||||
};
|
||||
|
||||
static final byte[] bl_order={
|
||||
16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15};
|
||||
|
||||
|
||||
// The lengths of the bit length codes are sent in order of decreasing
|
||||
// probability, to avoid transmitting the lengths for unused bit
|
||||
// length codes.
|
||||
|
||||
static final int Buf_size=8*2;
|
||||
|
||||
// see definition of array dist_code below
|
||||
static final int DIST_CODE_LEN=512;
|
||||
|
||||
static final byte[] _dist_code = {
|
||||
0, 1, 2, 3, 4, 4, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8,
|
||||
8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 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, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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, 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, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,
|
||||
14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 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, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15,
|
||||
15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15,
|
||||
15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 0, 0, 16, 17,
|
||||
18, 18, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22, 22, 22, 22, 22,
|
||||
23, 23, 23, 23, 23, 23, 23, 23, 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,
|
||||
26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 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, 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, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
|
||||
28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 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, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29,
|
||||
29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29,
|
||||
29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29
|
||||
};
|
||||
|
||||
static final byte[] _length_code={
|
||||
0, 1, 2, 3, 4, 5, 6, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 12, 12,
|
||||
13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16,
|
||||
17, 17, 17, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 18, 18, 18, 19, 19, 19, 19,
|
||||
19, 19, 19, 19, 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, 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, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
|
||||
24, 24, 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, 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, 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, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 28
|
||||
};
|
||||
|
||||
static final int[] base_length = {
|
||||
0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 20, 24, 28, 32, 40, 48, 56,
|
||||
64, 80, 96, 112, 128, 160, 192, 224, 0
|
||||
};
|
||||
|
||||
static final int[] base_dist = {
|
||||
0, 1, 2, 3, 4, 6, 8, 12, 16, 24,
|
||||
32, 48, 64, 96, 128, 192, 256, 384, 512, 768,
|
||||
1024, 1536, 2048, 3072, 4096, 6144, 8192, 12288, 16384, 24576
|
||||
};
|
||||
|
||||
// Mapping from a distance to a distance code. dist is the distance - 1 and
|
||||
// must not have side effects. _dist_code[256] and _dist_code[257] are never
|
||||
// used.
|
||||
static int d_code(int dist){
|
||||
return ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>>7)]);
|
||||
}
|
||||
|
||||
short[] dyn_tree; // the dynamic tree
|
||||
int max_code; // largest code with non zero frequency
|
||||
StaticTree stat_desc; // the corresponding static tree
|
||||
|
||||
// Compute the optimal bit lengths for a tree and update the total bit length
|
||||
// for the current block.
|
||||
// IN assertion: the fields freq and dad are set, heap[heap_max] and
|
||||
// above are the tree nodes sorted by increasing frequency.
|
||||
// OUT assertions: the field len is set to the optimal bit length, the
|
||||
// array bl_count contains the frequencies for each bit length.
|
||||
// The length opt_len is updated; static_len is also updated if stree is
|
||||
// not null.
|
||||
void gen_bitlen(Deflate s){
|
||||
short[] tree = dyn_tree;
|
||||
short[] stree = stat_desc.static_tree;
|
||||
int[] extra = stat_desc.extra_bits;
|
||||
int base = stat_desc.extra_base;
|
||||
int max_length = stat_desc.max_length;
|
||||
int h; // heap index
|
||||
int n, m; // iterate over the tree elements
|
||||
int bits; // bit length
|
||||
int xbits; // extra bits
|
||||
short f; // frequency
|
||||
int overflow = 0; // number of elements with bit length too large
|
||||
|
||||
for (bits = 0; bits <= MAX_BITS; bits++) s.bl_count[bits] = 0;
|
||||
|
||||
// In a first pass, compute the optimal bit lengths (which may
|
||||
// overflow in the case of the bit length tree).
|
||||
tree[s.heap[s.heap_max]*2+1] = 0; // root of the heap
|
||||
|
||||
for(h=s.heap_max+1; h<HEAP_SIZE; h++){
|
||||
n = s.heap[h];
|
||||
bits = tree[tree[n*2+1]*2+1] + 1;
|
||||
if (bits > max_length){ bits = max_length; overflow++; }
|
||||
tree[n*2+1] = (short)bits;
|
||||
// We overwrite tree[n*2+1] which is no longer needed
|
||||
|
||||
if (n > max_code) continue; // not a leaf node
|
||||
|
||||
s.bl_count[bits]++;
|
||||
xbits = 0;
|
||||
if (n >= base) xbits = extra[n-base];
|
||||
f = tree[n*2];
|
||||
s.opt_len += f * (bits + xbits);
|
||||
if (stree!=null) s.static_len += f * (stree[n*2+1] + xbits);
|
||||
}
|
||||
if (overflow == 0) return;
|
||||
|
||||
// This happens for example on obj2 and pic of the Calgary corpus
|
||||
// Find the first bit length which could increase:
|
||||
do {
|
||||
bits = max_length-1;
|
||||
while(s.bl_count[bits]==0) bits--;
|
||||
s.bl_count[bits]--; // move one leaf down the tree
|
||||
s.bl_count[bits+1]+=2; // move one overflow item as its brother
|
||||
s.bl_count[max_length]--;
|
||||
// The brother of the overflow item also moves one step up,
|
||||
// but this does not affect bl_count[max_length]
|
||||
overflow -= 2;
|
||||
}
|
||||
while (overflow > 0);
|
||||
|
||||
for (bits = max_length; bits != 0; bits--) {
|
||||
n = s.bl_count[bits];
|
||||
while (n != 0) {
|
||||
m = s.heap[--h];
|
||||
if (m > max_code) continue;
|
||||
if (tree[m*2+1] != bits) {
|
||||
s.opt_len += ((long)bits - (long)tree[m*2+1])*(long)tree[m*2];
|
||||
tree[m*2+1] = (short)bits;
|
||||
}
|
||||
n--;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// Construct one Huffman tree and assigns the code bit strings and lengths.
|
||||
// Update the total bit length for the current block.
|
||||
// IN assertion: the field freq is set for all tree elements.
|
||||
// OUT assertions: the fields len and code are set to the optimal bit length
|
||||
// and corresponding code. The length opt_len is updated; static_len is
|
||||
// also updated if stree is not null. The field max_code is set.
|
||||
void build_tree(Deflate s){
|
||||
short[] tree=dyn_tree;
|
||||
short[] stree=stat_desc.static_tree;
|
||||
int elems=stat_desc.elems;
|
||||
int n, m; // iterate over heap elements
|
||||
int max_code=-1; // largest code with non zero frequency
|
||||
int node; // new node being created
|
||||
|
||||
// Construct the initial heap, with least frequent element in
|
||||
// heap[1]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
|
||||
// heap[0] is not used.
|
||||
s.heap_len = 0;
|
||||
s.heap_max = HEAP_SIZE;
|
||||
|
||||
for(n=0; n<elems; n++) {
|
||||
if(tree[n*2] != 0) {
|
||||
s.heap[++s.heap_len] = max_code = n;
|
||||
s.depth[n] = 0;
|
||||
}
|
||||
else{
|
||||
tree[n*2+1] = 0;
|
||||
}
|
||||
}
|
||||
|
||||
// The pkzip format requires that at least one distance code exists,
|
||||
// and that at least one bit should be sent even if there is only one
|
||||
// possible code. So to avoid special checks later on we force at least
|
||||
// two codes of non zero frequency.
|
||||
while (s.heap_len < 2) {
|
||||
node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);
|
||||
tree[node*2] = 1;
|
||||
s.depth[node] = 0;
|
||||
s.opt_len--; if (stree!=null) s.static_len -= stree[node*2+1];
|
||||
// node is 0 or 1 so it does not have extra bits
|
||||
}
|
||||
this.max_code = max_code;
|
||||
|
||||
// The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,
|
||||
// establish sub-heaps of increasing lengths:
|
||||
|
||||
for(n=s.heap_len/2;n>=1; n--)
|
||||
s.pqdownheap(tree, n);
|
||||
|
||||
// Construct the Huffman tree by repeatedly combining the least two
|
||||
// frequent nodes.
|
||||
|
||||
node=elems; // next internal node of the tree
|
||||
do{
|
||||
// n = node of least frequency
|
||||
n=s.heap[1];
|
||||
s.heap[1]=s.heap[s.heap_len--];
|
||||
s.pqdownheap(tree, 1);
|
||||
m=s.heap[1]; // m = node of next least frequency
|
||||
|
||||
s.heap[--s.heap_max] = n; // keep the nodes sorted by frequency
|
||||
s.heap[--s.heap_max] = m;
|
||||
|
||||
// Create a new node father of n and m
|
||||
tree[node*2] = (short)(tree[n*2] + tree[m*2]);
|
||||
s.depth[node] = (byte)(Math.max(s.depth[n],s.depth[m])+1);
|
||||
tree[n*2+1] = tree[m*2+1] = (short)node;
|
||||
|
||||
// and insert the new node in the heap
|
||||
s.heap[1] = node++;
|
||||
s.pqdownheap(tree, 1);
|
||||
}
|
||||
while(s.heap_len>=2);
|
||||
|
||||
s.heap[--s.heap_max] = s.heap[1];
|
||||
|
||||
// At this point, the fields freq and dad are set. We can now
|
||||
// generate the bit lengths.
|
||||
|
||||
gen_bitlen(s);
|
||||
|
||||
// The field len is now set, we can generate the bit codes
|
||||
gen_codes(tree, max_code, s.bl_count, s.next_code);
|
||||
}
|
||||
|
||||
// Generate the codes for a given tree and bit counts (which need not be
|
||||
// optimal).
|
||||
// IN assertion: the array bl_count contains the bit length statistics for
|
||||
// the given tree and the field len is set for all tree elements.
|
||||
// OUT assertion: the field code is set for all tree elements of non
|
||||
// zero code length.
|
||||
private final static void gen_codes(
|
||||
short[] tree, // the tree to decorate
|
||||
int max_code, // largest code with non zero frequency
|
||||
short[] bl_count, // number of codes at each bit length
|
||||
short[] next_code){
|
||||
short code = 0; // running code value
|
||||
int bits; // bit index
|
||||
int n; // code index
|
||||
|
||||
// The distribution counts are first used to generate the code values
|
||||
// without bit reversal.
|
||||
next_code[0]=0;
|
||||
for (bits = 1; bits <= MAX_BITS; bits++) {
|
||||
next_code[bits] = code = (short)((code + bl_count[bits-1]) << 1);
|
||||
}
|
||||
|
||||
// Check that the bit counts in bl_count are consistent. The last code
|
||||
// must be all ones.
|
||||
//Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,
|
||||
// "inconsistent bit counts");
|
||||
//Tracev((stderr,"\ngen_codes: max_code %d ", max_code));
|
||||
|
||||
for (n = 0; n <= max_code; n++) {
|
||||
int len = tree[n*2+1];
|
||||
if (len == 0) continue;
|
||||
// Now reverse the bits
|
||||
tree[n*2] = (short)(bi_reverse(next_code[len]++, len));
|
||||
}
|
||||
}
|
||||
|
||||
// Reverse the first len bits of a code, using straightforward code (a faster
|
||||
// method would use a table)
|
||||
// IN assertion: 1 <= len <= 15
|
||||
private final static int bi_reverse(
|
||||
int code, // the value to invert
|
||||
int len // its bit length
|
||||
){
|
||||
int res = 0;
|
||||
do{
|
||||
res|=code&1;
|
||||
code>>>=1;
|
||||
res<<=1;
|
||||
}
|
||||
while(--len>0);
|
||||
return res>>>1;
|
||||
}
|
||||
}
|
||||
|
@ -1,126 +0,0 @@
|
||||
/* -*-mode:java; c-basic-offset:2; indent-tabs-mode:nil -*- */
|
||||
/*
|
||||
Copyright (c) 2011 ymnk, JCraft,Inc. All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are met:
|
||||
|
||||
1. Redistributions of source code must retain the above copyright notice,
|
||||
this list of conditions and the following disclaimer.
|
||||
|
||||
2. Redistributions in binary form must reproduce the above copyright
|
||||
notice, this list of conditions and the following disclaimer in
|
||||
the documentation and/or other materials provided with the distribution.
|
||||
|
||||
3. The names of the authors may not be used to endorse or promote products
|
||||
derived from this software without specific prior written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
|
||||
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
||||
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
|
||||
INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||||
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
|
||||
OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||||
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||||
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
|
||||
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
package com.jcraft.jzlib;
|
||||
import java.io.*;
|
||||
|
||||
/**
|
||||
* ZInputStream
|
||||
*
|
||||
* @deprecated use DeflaterOutputStream or InflaterInputStream
|
||||
*/
|
||||
@Deprecated
|
||||
public class ZInputStream extends FilterInputStream {
|
||||
|
||||
protected int flush=JZlib.Z_NO_FLUSH;
|
||||
protected boolean compress;
|
||||
protected InputStream in=null;
|
||||
|
||||
protected Deflater deflater;
|
||||
protected InflaterInputStream iis;
|
||||
|
||||
public ZInputStream(InputStream in) throws IOException {
|
||||
this(in, false);
|
||||
}
|
||||
public ZInputStream(InputStream in, boolean nowrap) throws IOException {
|
||||
super(in);
|
||||
iis = new InflaterInputStream(in, nowrap);
|
||||
compress=false;
|
||||
}
|
||||
|
||||
public ZInputStream(InputStream in, int level) throws IOException {
|
||||
super(in);
|
||||
this.in=in;
|
||||
deflater = new Deflater();
|
||||
deflater.init(level);
|
||||
compress=true;
|
||||
}
|
||||
|
||||
private byte[] buf1 = new byte[1];
|
||||
public int read() throws IOException {
|
||||
if(read(buf1, 0, 1)==-1) return -1;
|
||||
return(buf1[0]&0xFF);
|
||||
}
|
||||
|
||||
private byte[] buf = new byte[512];
|
||||
|
||||
public int read(byte[] b, int off, int len) throws IOException {
|
||||
if(compress){
|
||||
deflater.setOutput(b, off, len);
|
||||
while(true){
|
||||
int datalen = in.read(buf, 0, buf.length);
|
||||
if(datalen == -1) return -1;
|
||||
deflater.setInput(buf, 0, datalen, true);
|
||||
int err = deflater.deflate(flush);
|
||||
if(deflater.next_out_index>0)
|
||||
return deflater.next_out_index;
|
||||
if(err == JZlib.Z_STREAM_END)
|
||||
return 0;
|
||||
if(err == JZlib.Z_STREAM_ERROR ||
|
||||
err == JZlib.Z_DATA_ERROR){
|
||||
throw new ZStreamException("deflating: "+deflater.msg);
|
||||
}
|
||||
}
|
||||
}
|
||||
else{
|
||||
return iis.read(b, off, len);
|
||||
}
|
||||
}
|
||||
|
||||
public long skip(long n) throws IOException {
|
||||
int len=512;
|
||||
if(n<len)
|
||||
len=(int)n;
|
||||
byte[] tmp=new byte[len];
|
||||
return((long)read(tmp));
|
||||
}
|
||||
|
||||
public int getFlushMode() {
|
||||
return flush;
|
||||
}
|
||||
|
||||
public void setFlushMode(int flush) {
|
||||
this.flush=flush;
|
||||
}
|
||||
|
||||
public long getTotalIn() {
|
||||
if(compress) return deflater.total_in;
|
||||
else return iis.getTotalIn();
|
||||
}
|
||||
|
||||
public long getTotalOut() {
|
||||
if(compress) return deflater.total_out;
|
||||
else return iis.getTotalOut();
|
||||
}
|
||||
|
||||
public void close() throws IOException{
|
||||
if(compress) deflater.end();
|
||||
else iis.close();
|
||||
}
|
||||
}
|
@ -1,159 +0,0 @@
|
||||
/* -*-mode:java; c-basic-offset:2; indent-tabs-mode:nil -*- */
|
||||
/*
|
||||
Copyright (c) 2011 ymnk, JCraft,Inc. All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are met:
|
||||
|
||||
1. Redistributions of source code must retain the above copyright notice,
|
||||
this list of conditions and the following disclaimer.
|
||||
|
||||
2. Redistributions in binary form must reproduce the above copyright
|
||||
notice, this list of conditions and the following disclaimer in
|
||||
the documentation and/or other materials provided with the distribution.
|
||||
|
||||
3. The names of the authors may not be used to endorse or promote products
|
||||
derived from this software without specific prior written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
|
||||
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
||||
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
|
||||
INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||||
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
|
||||
OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||||
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||||
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
|
||||
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
package com.jcraft.jzlib;
|
||||
import java.io.*;
|
||||
|
||||
/**
|
||||
* ZOutputStream
|
||||
*
|
||||
* @deprecated use DeflaterOutputStream or InflaterInputStream
|
||||
*/
|
||||
@Deprecated
|
||||
public class ZOutputStream extends FilterOutputStream {
|
||||
|
||||
protected int bufsize=512;
|
||||
protected int flush=JZlib.Z_NO_FLUSH;
|
||||
protected byte[] buf=new byte[bufsize];
|
||||
protected boolean compress;
|
||||
|
||||
protected OutputStream out;
|
||||
private boolean end=false;
|
||||
|
||||
private DeflaterOutputStream dos;
|
||||
private Inflater inflater;
|
||||
|
||||
public ZOutputStream(OutputStream out) throws IOException {
|
||||
super(out);
|
||||
this.out=out;
|
||||
inflater = new Inflater();
|
||||
inflater.init();
|
||||
compress=false;
|
||||
}
|
||||
|
||||
public ZOutputStream(OutputStream out, int level) throws IOException {
|
||||
this(out, level, false);
|
||||
}
|
||||
|
||||
public ZOutputStream(OutputStream out, int level, boolean nowrap) throws IOException {
|
||||
super(out);
|
||||
this.out=out;
|
||||
Deflater deflater = new Deflater(level, nowrap);
|
||||
dos = new DeflaterOutputStream(out, deflater);
|
||||
compress=true;
|
||||
}
|
||||
|
||||
private byte[] buf1 = new byte[1];
|
||||
public void write(int b) throws IOException {
|
||||
buf1[0]=(byte)b;
|
||||
write(buf1, 0, 1);
|
||||
}
|
||||
|
||||
public void write(byte b[], int off, int len) throws IOException {
|
||||
if(len==0) return;
|
||||
if(compress){
|
||||
dos.write(b, off, len);
|
||||
}
|
||||
else {
|
||||
inflater.setInput(b, off, len, true);
|
||||
int err = JZlib.Z_OK;
|
||||
while(inflater.avail_in>0){
|
||||
inflater.setOutput(buf, 0, buf.length);
|
||||
err = inflater.inflate(flush);
|
||||
if(inflater.next_out_index>0)
|
||||
out.write(buf, 0, inflater.next_out_index);
|
||||
if(err != JZlib.Z_OK)
|
||||
break;
|
||||
}
|
||||
if(err != JZlib.Z_OK)
|
||||
throw new ZStreamException("inflating: "+inflater.msg);
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
public int getFlushMode() {
|
||||
return flush;
|
||||
}
|
||||
|
||||
public void setFlushMode(int flush) {
|
||||
this.flush=flush;
|
||||
}
|
||||
|
||||
public void finish() throws IOException {
|
||||
int err;
|
||||
if(compress){
|
||||
int tmp = flush;
|
||||
int flush = JZlib.Z_FINISH;
|
||||
try{
|
||||
write("".getBytes(), 0, 0);
|
||||
}
|
||||
finally { flush = tmp; }
|
||||
}
|
||||
else{
|
||||
dos.finish();
|
||||
}
|
||||
flush();
|
||||
}
|
||||
public synchronized void end() {
|
||||
if(end) return;
|
||||
if(compress){
|
||||
try { dos.finish(); } catch(Exception e){}
|
||||
}
|
||||
else{
|
||||
inflater.end();
|
||||
}
|
||||
end=true;
|
||||
}
|
||||
public void close() throws IOException {
|
||||
try{
|
||||
try{finish();}
|
||||
catch (IOException ignored) {}
|
||||
}
|
||||
finally{
|
||||
end();
|
||||
out.close();
|
||||
out=null;
|
||||
}
|
||||
}
|
||||
|
||||
public long getTotalIn() {
|
||||
if(compress) return dos.getTotalIn();
|
||||
else return inflater.total_in;
|
||||
}
|
||||
|
||||
public long getTotalOut() {
|
||||
if(compress) return dos.getTotalOut();
|
||||
else return inflater.total_out;
|
||||
}
|
||||
|
||||
public void flush() throws IOException {
|
||||
out.flush();
|
||||
}
|
||||
|
||||
}
|
@ -1,377 +0,0 @@
|
||||
/* -*-mode:java; c-basic-offset:2; indent-tabs-mode:nil -*- */
|
||||
/*
|
||||
Copyright (c) 2000-2011 ymnk, JCraft,Inc. All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are met:
|
||||
|
||||
1. Redistributions of source code must retain the above copyright notice,
|
||||
this list of conditions and the following disclaimer.
|
||||
|
||||
2. Redistributions in binary form must reproduce the above copyright
|
||||
notice, this list of conditions and the following disclaimer in
|
||||
the documentation and/or other materials provided with the distribution.
|
||||
|
||||
3. The names of the authors may not be used to endorse or promote products
|
||||
derived from this software without specific prior written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
|
||||
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
||||
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
|
||||
INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||||
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
|
||||
OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||||
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||||
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
|
||||
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
/*
|
||||
* This program is based on zlib-1.1.3, so all credit should go authors
|
||||
* Jean-loup Gailly(jloup@gzip.org) and Mark Adler(madler@alumni.caltech.edu)
|
||||
* and contributors of zlib.
|
||||
*/
|
||||
|
||||
package com.jcraft.jzlib;
|
||||
|
||||
/**
|
||||
* ZStream
|
||||
*
|
||||
* @deprecated Not for public use in the future.
|
||||
*/
|
||||
@Deprecated
|
||||
public class ZStream{
|
||||
|
||||
static final private int MAX_WBITS=15; // 32K LZ77 window
|
||||
static final private int DEF_WBITS=MAX_WBITS;
|
||||
|
||||
static final private int Z_NO_FLUSH=0;
|
||||
static final private int Z_PARTIAL_FLUSH=1;
|
||||
static final private int Z_SYNC_FLUSH=2;
|
||||
static final private int Z_FULL_FLUSH=3;
|
||||
static final private int Z_FINISH=4;
|
||||
|
||||
static final private int MAX_MEM_LEVEL=9;
|
||||
|
||||
static final private int Z_OK=0;
|
||||
static final private int Z_STREAM_END=1;
|
||||
static final private int Z_NEED_DICT=2;
|
||||
static final private int Z_ERRNO=-1;
|
||||
static final private int Z_STREAM_ERROR=-2;
|
||||
static final private int Z_DATA_ERROR=-3;
|
||||
static final private int Z_MEM_ERROR=-4;
|
||||
static final private int Z_BUF_ERROR=-5;
|
||||
static final private int Z_VERSION_ERROR=-6;
|
||||
|
||||
public byte[] next_in; // next input byte
|
||||
public int next_in_index;
|
||||
public int avail_in; // number of bytes available at next_in
|
||||
public long total_in; // total nb of input bytes read so far
|
||||
|
||||
public byte[] next_out; // next output byte should be put there
|
||||
public int next_out_index;
|
||||
public int avail_out; // remaining free space at next_out
|
||||
public long total_out; // total nb of bytes output so far
|
||||
|
||||
public String msg;
|
||||
|
||||
Deflate dstate;
|
||||
Inflate istate;
|
||||
|
||||
int data_type; // best guess about the data type: ascii or binary
|
||||
|
||||
Checksum adler;
|
||||
|
||||
public ZStream(){
|
||||
this(new Adler32());
|
||||
}
|
||||
|
||||
public ZStream(Checksum adler){
|
||||
this.adler=adler;
|
||||
}
|
||||
|
||||
public int inflateInit(){
|
||||
return inflateInit(DEF_WBITS);
|
||||
}
|
||||
public int inflateInit(boolean nowrap){
|
||||
return inflateInit(DEF_WBITS, nowrap);
|
||||
}
|
||||
public int inflateInit(int w){
|
||||
return inflateInit(w, false);
|
||||
}
|
||||
public int inflateInit(JZlib.WrapperType wrapperType) {
|
||||
return inflateInit(DEF_WBITS, wrapperType);
|
||||
}
|
||||
public int inflateInit(int w, JZlib.WrapperType wrapperType) {
|
||||
boolean nowrap = false;
|
||||
if(wrapperType == JZlib.W_NONE){
|
||||
nowrap = true;
|
||||
}
|
||||
else if(wrapperType == JZlib.W_GZIP) {
|
||||
w += 16;
|
||||
}
|
||||
else if(wrapperType == JZlib.W_ANY) {
|
||||
w |= Inflate.INFLATE_ANY;
|
||||
}
|
||||
else if(wrapperType == JZlib.W_ZLIB) {
|
||||
}
|
||||
return inflateInit(w, nowrap);
|
||||
}
|
||||
public int inflateInit(int w, boolean nowrap){
|
||||
istate=new Inflate(this);
|
||||
return istate.inflateInit(nowrap?-w:w);
|
||||
}
|
||||
|
||||
public int inflate(int f){
|
||||
if(istate==null) return Z_STREAM_ERROR;
|
||||
return istate.inflate(f);
|
||||
}
|
||||
public int inflateEnd(){
|
||||
if(istate==null) return Z_STREAM_ERROR;
|
||||
int ret=istate.inflateEnd();
|
||||
// istate = null;
|
||||
return ret;
|
||||
}
|
||||
public int inflateSync(){
|
||||
if(istate == null)
|
||||
return Z_STREAM_ERROR;
|
||||
return istate.inflateSync();
|
||||
}
|
||||
public int inflateSyncPoint(){
|
||||
if(istate == null)
|
||||
return Z_STREAM_ERROR;
|
||||
return istate.inflateSyncPoint();
|
||||
}
|
||||
public int inflateSetDictionary(byte[] dictionary, int dictLength){
|
||||
if(istate == null)
|
||||
return Z_STREAM_ERROR;
|
||||
return istate.inflateSetDictionary(dictionary, dictLength);
|
||||
}
|
||||
public boolean inflateFinished(){
|
||||
return istate.mode==12 /*DONE*/;
|
||||
}
|
||||
|
||||
public int deflateInit(int level){
|
||||
return deflateInit(level, MAX_WBITS);
|
||||
}
|
||||
public int deflateInit(int level, boolean nowrap){
|
||||
return deflateInit(level, MAX_WBITS, nowrap);
|
||||
}
|
||||
public int deflateInit(int level, int bits){
|
||||
return deflateInit(level, bits, false);
|
||||
}
|
||||
public int deflateInit(int level, int bits, int memlevel, JZlib.WrapperType wrapperType){
|
||||
if(bits < 9 || bits > 15){
|
||||
return Z_STREAM_ERROR;
|
||||
}
|
||||
if(wrapperType == JZlib.W_NONE) {
|
||||
bits *= -1;
|
||||
}
|
||||
else if(wrapperType == JZlib.W_GZIP) {
|
||||
bits += 16;
|
||||
}
|
||||
else if(wrapperType == JZlib.W_ANY) {
|
||||
return Z_STREAM_ERROR;
|
||||
}
|
||||
else if(wrapperType == JZlib.W_ZLIB) {
|
||||
}
|
||||
return this.deflateInit(level, bits, memlevel);
|
||||
}
|
||||
public int deflateInit(int level, int bits, int memlevel){
|
||||
dstate=new Deflate(this);
|
||||
return dstate.deflateInit(level, bits, memlevel);
|
||||
}
|
||||
public int deflateInit(int level, int bits, boolean nowrap){
|
||||
dstate=new Deflate(this);
|
||||
return dstate.deflateInit(level, nowrap?-bits:bits);
|
||||
}
|
||||
public int deflate(int flush){
|
||||
if(dstate==null){
|
||||
return Z_STREAM_ERROR;
|
||||
}
|
||||
return dstate.deflate(flush);
|
||||
}
|
||||
public int deflateEnd(){
|
||||
if(dstate==null) return Z_STREAM_ERROR;
|
||||
int ret=dstate.deflateEnd();
|
||||
dstate=null;
|
||||
return ret;
|
||||
}
|
||||
public int deflateParams(int level, int strategy){
|
||||
if(dstate==null) return Z_STREAM_ERROR;
|
||||
return dstate.deflateParams(level, strategy);
|
||||
}
|
||||
public int deflateSetDictionary (byte[] dictionary, int dictLength){
|
||||
if(dstate == null)
|
||||
return Z_STREAM_ERROR;
|
||||
return dstate.deflateSetDictionary(dictionary, dictLength);
|
||||
}
|
||||
|
||||
// Flush as much pending output as possible. All deflate() output goes
|
||||
// through this function so some applications may wish to modify it
|
||||
// to avoid allocating a large strm->next_out buffer and copying into it.
|
||||
// (See also read_buf()).
|
||||
void flush_pending(){
|
||||
int len=dstate.pending;
|
||||
|
||||
if(len>avail_out) len=avail_out;
|
||||
if(len==0) return;
|
||||
|
||||
if(dstate.pending_buf.length<=dstate.pending_out ||
|
||||
next_out.length<=next_out_index ||
|
||||
dstate.pending_buf.length<(dstate.pending_out+len) ||
|
||||
next_out.length<(next_out_index+len)){
|
||||
//System.out.println(dstate.pending_buf.length+", "+dstate.pending_out+
|
||||
// ", "+next_out.length+", "+next_out_index+", "+len);
|
||||
//System.out.println("avail_out="+avail_out);
|
||||
}
|
||||
|
||||
System.arraycopy(dstate.pending_buf, dstate.pending_out,
|
||||
next_out, next_out_index, len);
|
||||
|
||||
next_out_index+=len;
|
||||
dstate.pending_out+=len;
|
||||
total_out+=len;
|
||||
avail_out-=len;
|
||||
dstate.pending-=len;
|
||||
if(dstate.pending==0){
|
||||
dstate.pending_out=0;
|
||||
}
|
||||
}
|
||||
|
||||
// Read a new buffer from the current input stream, update the adler32
|
||||
// and total number of bytes read. All deflate() input goes through
|
||||
// this function so some applications may wish to modify it to avoid
|
||||
// allocating a large strm->next_in buffer and copying from it.
|
||||
// (See also flush_pending()).
|
||||
int read_buf(byte[] buf, int start, int size) {
|
||||
int len=avail_in;
|
||||
|
||||
if(len>size) len=size;
|
||||
if(len==0) return 0;
|
||||
|
||||
avail_in-=len;
|
||||
|
||||
if(dstate.wrap!=0) {
|
||||
adler.update(next_in, next_in_index, len);
|
||||
}
|
||||
System.arraycopy(next_in, next_in_index, buf, start, len);
|
||||
next_in_index += len;
|
||||
total_in += len;
|
||||
return len;
|
||||
}
|
||||
|
||||
public long getAdler(){
|
||||
return adler.getValue();
|
||||
}
|
||||
|
||||
public void free(){
|
||||
next_in=null;
|
||||
next_out=null;
|
||||
msg=null;
|
||||
}
|
||||
|
||||
public void setOutput(byte[] buf){
|
||||
setOutput(buf, 0, buf.length);
|
||||
}
|
||||
|
||||
public void setOutput(byte[] buf, int off, int len){
|
||||
next_out = buf;
|
||||
next_out_index = off;
|
||||
avail_out = len;
|
||||
}
|
||||
|
||||
public void setInput(byte[] buf){
|
||||
setInput(buf, 0, buf.length, false);
|
||||
}
|
||||
|
||||
public void setInput(byte[] buf, boolean append){
|
||||
setInput(buf, 0, buf.length, append);
|
||||
}
|
||||
|
||||
public void setInput(byte[] buf, int off, int len, boolean append){
|
||||
if(len<=0 && append && next_in!=null) return;
|
||||
|
||||
if(avail_in>0 && append){
|
||||
byte[] tmp = new byte[avail_in+len];
|
||||
System.arraycopy(next_in, next_in_index, tmp, 0, avail_in);
|
||||
System.arraycopy(buf, off, tmp, avail_in, len);
|
||||
next_in=tmp;
|
||||
next_in_index=0;
|
||||
avail_in+=len;
|
||||
}
|
||||
else{
|
||||
next_in=buf;
|
||||
next_in_index=off;
|
||||
avail_in=len;
|
||||
}
|
||||
}
|
||||
|
||||
public byte[] getNextIn(){
|
||||
return next_in;
|
||||
}
|
||||
|
||||
public void setNextIn(byte[] next_in){
|
||||
this.next_in = next_in;
|
||||
}
|
||||
|
||||
public int getNextInIndex(){
|
||||
return next_in_index;
|
||||
}
|
||||
|
||||
public void setNextInIndex(int next_in_index){
|
||||
this.next_in_index = next_in_index;
|
||||
}
|
||||
|
||||
public int getAvailIn(){
|
||||
return avail_in;
|
||||
}
|
||||
|
||||
public void setAvailIn(int avail_in){
|
||||
this.avail_in = avail_in;
|
||||
}
|
||||
|
||||
public byte[] getNextOut(){
|
||||
return next_out;
|
||||
}
|
||||
|
||||
public void setNextOut(byte[] next_out){
|
||||
this.next_out = next_out;
|
||||
}
|
||||
|
||||
public int getNextOutIndex(){
|
||||
return next_out_index;
|
||||
}
|
||||
|
||||
public void setNextOutIndex(int next_out_index){
|
||||
this.next_out_index = next_out_index;
|
||||
}
|
||||
|
||||
public int getAvailOut(){
|
||||
return avail_out;
|
||||
|
||||
}
|
||||
|
||||
public void setAvailOut(int avail_out){
|
||||
this.avail_out = avail_out;
|
||||
}
|
||||
|
||||
public long getTotalOut(){
|
||||
return total_out;
|
||||
}
|
||||
|
||||
public long getTotalIn(){
|
||||
return total_in;
|
||||
}
|
||||
|
||||
public String getMessage(){
|
||||
return msg;
|
||||
}
|
||||
|
||||
/**
|
||||
* Those methods are expected to be override by Inflater and Deflater.
|
||||
* In the future, they will become abstract methods.
|
||||
*/
|
||||
public int end(){ return Z_OK; }
|
||||
public boolean finished(){ return false; }
|
||||
}
|
@ -1,44 +0,0 @@
|
||||
/* -*-mode:java; c-basic-offset:2; -*- */
|
||||
/*
|
||||
Copyright (c) 2000,2001,2002,2003 ymnk, JCraft,Inc. All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are met:
|
||||
|
||||
1. Redistributions of source code must retain the above copyright notice,
|
||||
this list of conditions and the following disclaimer.
|
||||
|
||||
2. Redistributions in binary form must reproduce the above copyright
|
||||
notice, this list of conditions and the following disclaimer in
|
||||
the documentation and/or other materials provided with the distribution.
|
||||
|
||||
3. The names of the authors may not be used to endorse or promote products
|
||||
derived from this software without specific prior written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
|
||||
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
||||
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
|
||||
INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||||
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
|
||||
OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||||
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||||
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
|
||||
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
/*
|
||||
* This program is based on zlib-1.1.3, so all credit should go authors
|
||||
* Jean-loup Gailly(jloup@gzip.org) and Mark Adler(madler@alumni.caltech.edu)
|
||||
* and contributors of zlib.
|
||||
*/
|
||||
|
||||
package com.jcraft.jzlib;
|
||||
|
||||
public class ZStreamException extends java.io.IOException {
|
||||
public ZStreamException() {
|
||||
super();
|
||||
}
|
||||
public ZStreamException(String s) {
|
||||
super(s);
|
||||
}
|
||||
}
|
21998
javascript/classes.js
21998
javascript/classes.js
File diff suppressed because it is too large
Load Diff
File diff suppressed because one or more lines are too long
@ -1,5 +0,0 @@
|
||||
onmessage = function(o) {
|
||||
importScripts("classes_server.js");
|
||||
eaglercraftServerOpts = o.data;
|
||||
main();
|
||||
};
|
BIN
mp-server/bukkit_command/BitchFilterPlugin.jar
Normal file
BIN
mp-server/bukkit_command/BitchFilterPlugin.jar
Normal file
Binary file not shown.
14
mp-server/bukkit_command/SECURITY-NOTICE-PLEASE-READ.txt
Normal file
14
mp-server/bukkit_command/SECURITY-NOTICE-PLEASE-READ.txt
Normal file
@ -0,0 +1,14 @@
|
||||
|
||||
DO NOT IGNORE THIS MESSAGE, USE YOUR BRAIN AND READ!
|
||||
|
||||
Bukkit is a piece of shit, if you "/op LAX1DUDE", a player joining as 'laX1DUDE' or 'LaX1dUdE' or 'lax1dude' will all have /op too
|
||||
|
||||
Either don't use /op and install an actual permissions plugin, or move "BitchFilerPlugin.jar" into this server's "/plugins" folder and use only lowercase letters in your /op profile names!
|
||||
|
||||
Again, if you install the bitchfilter plugin, you need to /op yourself with ALL LOWERCASE LETTERS like "/op lax1dude", and then when you want to join as an op you don't type 'LAX1DUDE' you have to join as 'lax1dude' or you will be kicked by the plugin for security
|
||||
|
||||
PLEASE PLEASE PLEASE DO NOT IGNORE THIS MESSAGE!!!
|
||||
|
||||
IF YOU IGNORE THIS AND USE /op WITH MIXED CASE THEN YOU WILL BE HACKED!!!
|
||||
|
||||
DO NOT MAKE THIS MISTAKE OR YOU CAN LOSE YOUR WHOLE SERVER IN MINUTES!!!
|
3
mp-server/bukkit_command/banned-ips.txt
Normal file
3
mp-server/bukkit_command/banned-ips.txt
Normal file
@ -0,0 +1,3 @@
|
||||
# Updated 2/28/25, 1:34 PM by Minecraft 1.6.4
|
||||
# victim name | ban date | banned by | banned until | reason
|
||||
|
3
mp-server/bukkit_command/banned-players.txt
Normal file
3
mp-server/bukkit_command/banned-players.txt
Normal file
@ -0,0 +1,3 @@
|
||||
# Updated 2/28/25, 1:34 PM by Minecraft 1.6.4
|
||||
# victim name | ban date | banned by | banned until | reason
|
||||
|
45
mp-server/bukkit_command/bukkit.yml
Normal file
45
mp-server/bukkit_command/bukkit.yml
Normal file
@ -0,0 +1,45 @@
|
||||
# This is the main configuration file for Bukkit.
|
||||
# As you can see, there's actually not that much to configure without any plugins.
|
||||
# For a reference for any variable inside this file, check out the bukkit wiki at
|
||||
# http://wiki.bukkit.org/Bukkit.yml
|
||||
settings:
|
||||
allow-end: true
|
||||
warn-on-overload: true
|
||||
permissions-file: permissions.yml
|
||||
update-folder: update
|
||||
ping-packet-limit: 100
|
||||
use-exact-login-location: false
|
||||
plugin-profiling: false
|
||||
connection-throttle: 4000
|
||||
query-plugins: true
|
||||
deprecated-verbose: default
|
||||
shutdown-message: Server closed
|
||||
spawn-limits:
|
||||
monsters: 70
|
||||
animals: 15
|
||||
water-animals: 5
|
||||
ambient: 15
|
||||
chunk-gc:
|
||||
period-in-ticks: 600
|
||||
load-threshold: 0
|
||||
ticks-per:
|
||||
animal-spawns: 400
|
||||
monster-spawns: 1
|
||||
autosave: 0
|
||||
auto-updater:
|
||||
enabled: true
|
||||
on-broken:
|
||||
- warn-console
|
||||
- warn-ops
|
||||
on-update:
|
||||
- warn-console
|
||||
- warn-ops
|
||||
preferred-channel: rb
|
||||
host: dl.bukkit.org
|
||||
suggest-channels: true
|
||||
database:
|
||||
username: bukkit
|
||||
isolation: SERIALIZABLE
|
||||
driver: org.sqlite.JDBC
|
||||
password: walrus
|
||||
url: jdbc:sqlite:{DIR}{NAME}.db
|
BIN
mp-server/bukkit_command/craftbukkit-1.6.4-R2.0.jar
Normal file
BIN
mp-server/bukkit_command/craftbukkit-1.6.4-R2.0.jar
Normal file
Binary file not shown.
56
mp-server/bukkit_command/help.yml
Normal file
56
mp-server/bukkit_command/help.yml
Normal file
@ -0,0 +1,56 @@
|
||||
# This is the help configuration file for Bukkit.
|
||||
#
|
||||
# By default you do not need to modify this file. Help topics for all plugin commands are automatically provided by
|
||||
# or extracted from your installed plugins. You only need to modify this file if you wish to add new help pages to
|
||||
# your server or override the help pages of existing plugin commands.
|
||||
#
|
||||
# This file is divided up into the following parts:
|
||||
# -- general-topics: lists admin defined help topics
|
||||
# -- index-topics: lists admin defined index topics
|
||||
# -- amend-topics: lists topic amendments to apply to existing help topics
|
||||
# -- ignore-plugins: lists any plugins that should be excluded from help
|
||||
#
|
||||
# Examples are given below. When amending command topic, the string <text> will be replaced with the existing value
|
||||
# in the help topic. Color codes can be used in topic text. The color code character is & followed by 0-F.
|
||||
# ================================================================
|
||||
#
|
||||
# Set this to true to list the individual command help topics in the master help.
|
||||
# command-topics-in-master-index: true
|
||||
#
|
||||
# Each general topic will show up as a separate topic in the help index along with all the plugin command topics.
|
||||
# general-topics:
|
||||
# Rules:
|
||||
# shortText: Rules of the server
|
||||
# fullText: |
|
||||
# &61. Be kind to your fellow players.
|
||||
# &B2. No griefing.
|
||||
# &D3. No swearing.
|
||||
# permission: topics.rules
|
||||
#
|
||||
# Each index topic will show up as a separate sub-index in the help index along with all the plugin command topics.
|
||||
# To override the default help index (displayed when the user executes /help), name the index topic "Default".
|
||||
# index-topics:
|
||||
# Ban Commands:
|
||||
# shortText: Player banning commands
|
||||
# preamble: Moderator - do not abuse these commands
|
||||
# permission: op
|
||||
# commands:
|
||||
# - /ban
|
||||
# - /ban-ip
|
||||
# - /banlist
|
||||
#
|
||||
# Topic amendments are used to change the content of automatically generated plugin command topics.
|
||||
# amended-topics:
|
||||
# /stop:
|
||||
# shortText: Stops the server cold....in its tracks!
|
||||
# fullText: <text> - This kills the server.
|
||||
# permission: you.dont.have
|
||||
#
|
||||
# Any plugin in the ignored plugins list will be excluded from help. The name must match the name displayed by
|
||||
# the /plugins command. Ignore "Bukkit" to remove the standard bukkit commands from the index. Ignore "All"
|
||||
# to completely disable automatic help topic generation.
|
||||
# ignore-plugins:
|
||||
# - PluginNameOne
|
||||
# - PluginNameTwo
|
||||
# - PluginNameThree
|
||||
|
0
mp-server/bukkit_command/ops.txt
Normal file
0
mp-server/bukkit_command/ops.txt
Normal file
0
mp-server/bukkit_command/permissions.yml
Normal file
0
mp-server/bukkit_command/permissions.yml
Normal file
14
mp-server/bukkit_command/readme.txt
Normal file
14
mp-server/bukkit_command/readme.txt
Normal file
@ -0,0 +1,14 @@
|
||||
|
||||
DO NOT IGNORE THIS MESSAGE, USE YOUR BRAIN AND READ!
|
||||
|
||||
Bukkit is a piece of shit, if you "/op LAX1DUDE", a player joining as 'laX1DUDE' or 'LaX1dUdE' or 'lax1dude' will all have /op too
|
||||
|
||||
Either don't use /op and install an actual permissions plugin, or move "BitchFilerPlugin.jar" into this server's "/plugins" folder and use only lowercase letters in your /op profile names!
|
||||
|
||||
Again, if you install the bitchfilter plugin, you need to /op yourself with ALL LOWERCASE LETTERS like "/op lax1dude", and then when you want to join as an op you don't type 'LAX1DUDE' you have to join as 'lax1dude' or you will be kicked by the plugin for security
|
||||
|
||||
PLEASE PLEASE PLEASE DO NOT IGNORE THIS MESSAGE!!!
|
||||
|
||||
IF YOU IGNORE THIS AND USE /op WITH MIXED CASE THEN YOU WILL BE HACKED!!!
|
||||
|
||||
DO NOT MAKE THIS MISTAKE OR YOU CAN LOSE YOUR WHOLE SERVER IN MINUTES!!!
|
3
mp-server/bukkit_command/run.bat
Normal file
3
mp-server/bukkit_command/run.bat
Normal file
@ -0,0 +1,3 @@
|
||||
@echo off
|
||||
java -Xmx512M -Xms512M -jar craftbukkit-1.5.2-R1.0.jar
|
||||
pause
|
2
mp-server/bukkit_command/run_unix.sh
Normal file
2
mp-server/bukkit_command/run_unix.sh
Normal file
@ -0,0 +1,2 @@
|
||||
#!/bin/sh
|
||||
java -Xmx512M -Xms512M -jar craftbukkit-1.6.4-R2.0.jar
|
2596
mp-server/bukkit_command/server.log
Normal file
2596
mp-server/bukkit_command/server.log
Normal file
File diff suppressed because it is too large
Load Diff
0
mp-server/bukkit_command/server.log.lck
Normal file
0
mp-server/bukkit_command/server.log.lck
Normal file
31
mp-server/bukkit_command/server.properties
Normal file
31
mp-server/bukkit_command/server.properties
Normal file
@ -0,0 +1,31 @@
|
||||
#Minecraft server properties
|
||||
#Fri Feb 28 13:34:28 EST 2025
|
||||
view-distance=10
|
||||
max-build-height=256
|
||||
server-ip=127.0.0.1
|
||||
level-seed=
|
||||
gamemode=0
|
||||
allow-nether=true
|
||||
server-port=25569
|
||||
enable-rcon=false
|
||||
enable-query=false
|
||||
generator-settings=
|
||||
level-name=world
|
||||
player-idle-timeout=0
|
||||
motd=A Minecraft Server
|
||||
force-gamemode=false
|
||||
hardcore=false
|
||||
white-list=false
|
||||
texture-pack=
|
||||
pvp=true
|
||||
spawn-npcs=true
|
||||
spawn-animals=true
|
||||
generate-structures=true
|
||||
snooper-enabled=true
|
||||
difficulty=1
|
||||
level-type=DEFAULT
|
||||
spawn-monsters=true
|
||||
max-players=20
|
||||
spawn-protection=16
|
||||
online-mode=false
|
||||
allow-flight=false
|
0
mp-server/bukkit_command/white-list.txt
Normal file
0
mp-server/bukkit_command/white-list.txt
Normal file
BIN
mp-server/bukkit_command/world/data/Fortress.dat
Normal file
BIN
mp-server/bukkit_command/world/data/Fortress.dat
Normal file
Binary file not shown.
BIN
mp-server/bukkit_command/world/data/Mineshaft.dat
Normal file
BIN
mp-server/bukkit_command/world/data/Mineshaft.dat
Normal file
Binary file not shown.
BIN
mp-server/bukkit_command/world/data/villages.dat
Normal file
BIN
mp-server/bukkit_command/world/data/villages.dat
Normal file
Binary file not shown.
BIN
mp-server/bukkit_command/world/level.dat
Normal file
BIN
mp-server/bukkit_command/world/level.dat
Normal file
Binary file not shown.
BIN
mp-server/bukkit_command/world/level.dat_old
Normal file
BIN
mp-server/bukkit_command/world/level.dat_old
Normal file
Binary file not shown.
BIN
mp-server/bukkit_command/world/players/Catfoolyou.dat
Normal file
BIN
mp-server/bukkit_command/world/players/Catfoolyou.dat
Normal file
Binary file not shown.
BIN
mp-server/bukkit_command/world/players/Catfoolyou2.dat
Normal file
BIN
mp-server/bukkit_command/world/players/Catfoolyou2.dat
Normal file
Binary file not shown.
BIN
mp-server/bukkit_command/world/region/r.-1.-1.mca
Normal file
BIN
mp-server/bukkit_command/world/region/r.-1.-1.mca
Normal file
Binary file not shown.
BIN
mp-server/bukkit_command/world/region/r.-1.0.mca
Normal file
BIN
mp-server/bukkit_command/world/region/r.-1.0.mca
Normal file
Binary file not shown.
BIN
mp-server/bukkit_command/world/region/r.0.-1.mca
Normal file
BIN
mp-server/bukkit_command/world/region/r.0.-1.mca
Normal file
Binary file not shown.
BIN
mp-server/bukkit_command/world/region/r.0.0.mca
Normal file
BIN
mp-server/bukkit_command/world/region/r.0.0.mca
Normal file
Binary file not shown.
BIN
mp-server/bukkit_command/world/session.lock
Normal file
BIN
mp-server/bukkit_command/world/session.lock
Normal file
Binary file not shown.
1
mp-server/bukkit_command/world/uid.dat
Normal file
1
mp-server/bukkit_command/world/uid.dat
Normal file
@ -0,0 +1 @@
|
||||
8$%.<2E>EҜPB<50>ɘ<08>
|
BIN
mp-server/bukkit_command/world_nether/DIM-1/region/r.-1.-1.mca
Normal file
BIN
mp-server/bukkit_command/world_nether/DIM-1/region/r.-1.-1.mca
Normal file
Binary file not shown.
BIN
mp-server/bukkit_command/world_nether/DIM-1/region/r.-1.0.mca
Normal file
BIN
mp-server/bukkit_command/world_nether/DIM-1/region/r.-1.0.mca
Normal file
Binary file not shown.
BIN
mp-server/bukkit_command/world_nether/DIM-1/region/r.0.-1.mca
Normal file
BIN
mp-server/bukkit_command/world_nether/DIM-1/region/r.0.-1.mca
Normal file
Binary file not shown.
BIN
mp-server/bukkit_command/world_nether/DIM-1/region/r.0.0.mca
Normal file
BIN
mp-server/bukkit_command/world_nether/DIM-1/region/r.0.0.mca
Normal file
Binary file not shown.
BIN
mp-server/bukkit_command/world_nether/level.dat
Normal file
BIN
mp-server/bukkit_command/world_nether/level.dat
Normal file
Binary file not shown.
BIN
mp-server/bukkit_command/world_nether/level.dat_old
Normal file
BIN
mp-server/bukkit_command/world_nether/level.dat_old
Normal file
Binary file not shown.
BIN
mp-server/bukkit_command/world_nether/session.lock
Normal file
BIN
mp-server/bukkit_command/world_nether/session.lock
Normal file
Binary file not shown.
1
mp-server/bukkit_command/world_nether/uid.dat
Normal file
1
mp-server/bukkit_command/world_nether/uid.dat
Normal file
@ -0,0 +1 @@
|
||||
¤EŸÌuE<ƒÐSº^Éû
|
BIN
mp-server/bukkit_command/world_the_end/DIM1/region/r.-1.-1.mca
Normal file
BIN
mp-server/bukkit_command/world_the_end/DIM1/region/r.-1.-1.mca
Normal file
Binary file not shown.
BIN
mp-server/bukkit_command/world_the_end/DIM1/region/r.-1.0.mca
Normal file
BIN
mp-server/bukkit_command/world_the_end/DIM1/region/r.-1.0.mca
Normal file
Binary file not shown.
BIN
mp-server/bukkit_command/world_the_end/DIM1/region/r.0.-1.mca
Normal file
BIN
mp-server/bukkit_command/world_the_end/DIM1/region/r.0.-1.mca
Normal file
Binary file not shown.
BIN
mp-server/bukkit_command/world_the_end/DIM1/region/r.0.0.mca
Normal file
BIN
mp-server/bukkit_command/world_the_end/DIM1/region/r.0.0.mca
Normal file
Binary file not shown.
BIN
mp-server/bukkit_command/world_the_end/level.dat
Normal file
BIN
mp-server/bukkit_command/world_the_end/level.dat
Normal file
Binary file not shown.
BIN
mp-server/bukkit_command/world_the_end/level.dat_old
Normal file
BIN
mp-server/bukkit_command/world_the_end/level.dat_old
Normal file
Binary file not shown.
BIN
mp-server/bukkit_command/world_the_end/session.lock
Normal file
BIN
mp-server/bukkit_command/world_the_end/session.lock
Normal file
Binary file not shown.
1
mp-server/bukkit_command/world_the_end/uid.dat
Normal file
1
mp-server/bukkit_command/world_the_end/uid.dat
Normal file
@ -0,0 +1 @@
|
||||
<EFBFBD>/y<7F>IP<49><50><03>N끗
|
5
mp-server/bungee_command/README.md
Normal file
5
mp-server/bungee_command/README.md
Normal file
@ -0,0 +1,5 @@
|
||||
## EaglercraftBungee
|
||||
|
||||
This is regular BungeeCord except it accepts WebSockets instead of raw TCP connections
|
||||
|
||||
**To add an animated MOTD: [https://github.com/LAX1DUDE/eaglercraft-motd/](https://github.com/LAX1DUDE/eaglercraft-motd/)**
|
51
mp-server/bungee_command/bans.txt
Normal file
51
mp-server/bungee_command/bans.txt
Normal file
@ -0,0 +1,51 @@
|
||||
|
||||
#
|
||||
# This file allows you to configure bans for eaglercraftbungee
|
||||
# When it is saved, eaglercraft should reload it automatically
|
||||
# (check the console though to be safe)
|
||||
#
|
||||
# For a [Usernames] ban, just add the player's name. Use a colon ':' to put in a ban reason
|
||||
# For a [IPs] ban, just add the player's IP, or a subnet like 69.69.0.0/16 to ban all IPs beginning with 69.69.*
|
||||
# For a [Wildcards] ban, type a string and prefix and/or suffix it with * to define the wildcard
|
||||
# For a [Regex] ban, type a valid regular expression in the java.util.regex format
|
||||
#
|
||||
# All bans are case-insensitive, USERNAMES ARE CONVERTED TO LOWERCASE BEFORE BEING MATCHED VIA REGEX
|
||||
# Java regex syntax: https://docs.oracle.com/javase/7/docs/api/java/util/regex/Pattern.html
|
||||
#
|
||||
|
||||
# set this to false to use "/eag-ban" to ban on bungee instead of just "/ban"
|
||||
# (most likely needs a restart to take effect)
|
||||
replace-bukkit=false
|
||||
|
||||
|
||||
[Usernames]
|
||||
|
||||
# ban_test1: The ban hammer has spoken!
|
||||
# ban_test2: custom ban message here
|
||||
# ban_test3
|
||||
|
||||
# (remove the '#' before each line to enable)
|
||||
|
||||
[IPs]
|
||||
|
||||
# WARNING: if you're using nginx, banning any player's IP is gonna ban ALL PLAYERS on your server
|
||||
# For this reason, the ban IP command doesn't ban 127.0.0.1 or any other 'private' range IPs
|
||||
|
||||
# 101.202.69.11
|
||||
# 123.21.43.0/24
|
||||
# 2601:1062:69:418:BEEF::10
|
||||
# 2601:6090:420::/48
|
||||
|
||||
[Wildcards]
|
||||
|
||||
# *fuck*
|
||||
# shi*
|
||||
|
||||
|
||||
[Regex]
|
||||
|
||||
# you.+are.(a|the).+bitch
|
||||
|
||||
|
||||
# end of file
|
||||
|
BIN
mp-server/bungee_command/bungee-dist.jar
Normal file
BIN
mp-server/bungee_command/bungee-dist.jar
Normal file
Binary file not shown.
BIN
mp-server/bungee_command/bungee.sqlite
Normal file
BIN
mp-server/bungee_command/bungee.sqlite
Normal file
Binary file not shown.
7
mp-server/bungee_command/client.log
Normal file
7
mp-server/bungee_command/client.log
Normal file
@ -0,0 +1,7 @@
|
||||
[NetClientHandler] - processReadPackets called
|
||||
[EaglerAdapterImpl2] - Cannot read packet!
|
||||
[WebsocketNetworkManager] - readChunks is empty!
|
||||
[NetClientHandler] - processReadPackets called
|
||||
[EaglerAdapterImpl2] - Cannot read packet!
|
||||
[WebsocketNetworkManager] - readChunks is empty!
|
||||
[EaglerAdapterImpl2] - Writing packet
|
131
mp-server/bungee_command/config.yml
Normal file
131
mp-server/bungee_command/config.yml
Normal file
@ -0,0 +1,131 @@
|
||||
origin_blacklist_use_simple_whitelist: false
|
||||
server_name: EaglercraftBungee Server
|
||||
token_verify: ''
|
||||
groups: {}
|
||||
servers:
|
||||
lobby:
|
||||
address: localhost:25569
|
||||
restricted: false
|
||||
voice_turn_servers:
|
||||
openrelay3:
|
||||
password: openrelayproject
|
||||
url: turn:openrelay.metered.ca:443?transport=tcp
|
||||
username: openrelayproject
|
||||
openrelay2:
|
||||
password: openrelayproject
|
||||
url: turn:openrelay.metered.ca:443
|
||||
username: openrelayproject
|
||||
openrelay1:
|
||||
password: openrelayproject
|
||||
url: turn:openrelay.metered.ca:80
|
||||
username: openrelayproject
|
||||
voice_stun_servers:
|
||||
- stun:stun.l.google.com:19302
|
||||
- stun:stun1.l.google.com:19302
|
||||
- stun:stun2.l.google.com:19302
|
||||
- stun:stun3.l.google.com:19302
|
||||
- stun:stun4.l.google.com:19302
|
||||
- stun:openrelay.metered.ca:80
|
||||
enable_web_origin_blacklist: true
|
||||
origin_blacklist_simple_whitelist:
|
||||
- type the name of your client's domain here
|
||||
- (if 'origin_blacklist_use_simple_whitelist' is true)
|
||||
- g.lax1dude.net
|
||||
protocol_support_fix: false
|
||||
origin_blacklist_subscriptions:
|
||||
- https://g.lax1dude.net/eaglercraft/origin_blacklist.txt
|
||||
player_limit: -1
|
||||
origin_blacklist_block_invalid_origin_header: true
|
||||
voice_enabled: true
|
||||
display_ban_type_on_kick: false
|
||||
origin_blacklist_block_offline_download: false
|
||||
accept_bukkit_console_command_packets: false
|
||||
authservice:
|
||||
authfile: auths.db
|
||||
register_enabled: true
|
||||
ip_limit: 0
|
||||
join_messages:
|
||||
- '&3Welcome to my &aEaglercraftBungee &3server!'
|
||||
login_timeout: 30
|
||||
enabled: false
|
||||
disabled_commands: []
|
||||
bungee_on_bungee: false
|
||||
origin_blacklist_block_replit_clients: false
|
||||
stats: 1795b100-6c57-4568-957f-810efbd77cc3
|
||||
listeners:
|
||||
- fallback_server: lobby
|
||||
tab_list: GLOBAL_PING
|
||||
websocket: true
|
||||
texture_size: 16
|
||||
host: 0.0.0.0:25565
|
||||
forced_hosts: {}
|
||||
max_players: 60
|
||||
tab_size: 60
|
||||
default_server: lobby
|
||||
force_default_server: true
|
||||
forward_ip: false
|
||||
server_icon: server-icon.png
|
||||
motd1: '&6An Eaglercraft server'
|
||||
allow_motd: true
|
||||
allow_query: true
|
||||
request_motd_cache:
|
||||
cache_ttl: 7200
|
||||
online_server_list_animation: false
|
||||
online_server_list_results: true
|
||||
online_server_list_trending: true
|
||||
online_server_list_portfolios: false
|
||||
ratelimit:
|
||||
ip:
|
||||
enable: true
|
||||
period: 90
|
||||
limit: 60
|
||||
limit_lockout: 80
|
||||
lockout_duration: 1200
|
||||
exceptions: []
|
||||
login:
|
||||
enable: true
|
||||
period: 50
|
||||
limit: 5
|
||||
limit_lockout: 10
|
||||
lockout_duration: 300
|
||||
exceptions: []
|
||||
motd:
|
||||
enable: true
|
||||
period: 30
|
||||
limit: 5
|
||||
limit_lockout: 15
|
||||
lockout_duration: 300
|
||||
exceptions: []
|
||||
query:
|
||||
enable: true
|
||||
period: 30
|
||||
limit: 15
|
||||
limit_lockout: 25
|
||||
lockout_duration: 900
|
||||
exceptions: []
|
||||
forward_ip_header: X-Real-IP
|
||||
java_host: 'null'
|
||||
permissions:
|
||||
default:
|
||||
- bungeecord.command.server
|
||||
- bungeecord.command.list
|
||||
- bungeecord.command.eag.domain
|
||||
- bungeecord.command.eag.changepassword
|
||||
admin:
|
||||
- bungeecord.command.alert
|
||||
- bungeecord.command.end
|
||||
- bungeecord.command.ip
|
||||
- bungeecord.command.reload
|
||||
- bungeecord.command.eag.ban
|
||||
- bungeecord.command.eag.banwildcard
|
||||
- bungeecord.command.eag.banip
|
||||
- bungeecord.command.eag.banregex
|
||||
- bungeecord.command.eag.reloadban
|
||||
- bungeecord.command.eag.banned
|
||||
- bungeecord.command.eag.banlist
|
||||
- bungeecord.command.eag.unban
|
||||
- bungeecord.command.eag.ratelimit
|
||||
- bungeecord.command.eag.blockdomain
|
||||
- bungeecord.command.eag.blockdomainname
|
||||
- bungeecord.command.eag.unblockdomain
|
||||
timeout: 30000
|
3
mp-server/bungee_command/origin_blacklist.txt
Normal file
3
mp-server/bungee_command/origin_blacklist.txt
Normal file
@ -0,0 +1,3 @@
|
||||
#whitelistMode: false
|
||||
|
||||
|
83632
mp-server/bungee_command/proxy.log.0
Normal file
83632
mp-server/bungee_command/proxy.log.0
Normal file
File diff suppressed because it is too large
Load Diff
0
mp-server/bungee_command/proxy.log.0.lck
Normal file
0
mp-server/bungee_command/proxy.log.0.lck
Normal file
3
mp-server/bungee_command/run.bat
Normal file
3
mp-server/bungee_command/run.bat
Normal file
@ -0,0 +1,3 @@
|
||||
@echo off
|
||||
java -Xmx32M -Xms32M -jar bungee-dist.jar
|
||||
pause
|
2
mp-server/bungee_command/run_unix.sh
Normal file
2
mp-server/bungee_command/run_unix.sh
Normal file
@ -0,0 +1,2 @@
|
||||
#!/bin/sh
|
||||
java -Xmx32M -Xms32M -jar bungee-dist.jar
|
BIN
mp-server/bungee_command/server-icon.png
Normal file
BIN
mp-server/bungee_command/server-icon.png
Normal file
Binary file not shown.
After Width: | Height: | Size: 8.6 KiB |
@ -550,7 +550,7 @@ public abstract class MinecraftServer implements ICommandSender, Runnable, IPlay
|
||||
if (this.startProfiling)
|
||||
{
|
||||
this.startProfiling = false;
|
||||
this.theProfiler.profilingEnabled = true;
|
||||
this.theProfiler.profilingEnabled = false;
|
||||
this.theProfiler.clearProfiling();
|
||||
}
|
||||
|
||||
|
@ -727,195 +727,6 @@ public class Minecraft
|
||||
return this.currentScreen != null && this.currentScreen instanceof GuiMainMenu ? 2 : this.gameSettings.limitFramerate;
|
||||
}
|
||||
|
||||
public void freeMemory()
|
||||
{
|
||||
try
|
||||
{
|
||||
memoryReserve = new byte[0];
|
||||
this.renderGlobal.deleteAllDisplayLists();
|
||||
}
|
||||
catch (Throwable var4)
|
||||
{
|
||||
;
|
||||
}
|
||||
|
||||
try
|
||||
{
|
||||
System.gc();
|
||||
AxisAlignedBB.getAABBPool().clearPool();
|
||||
this.theWorld.getWorldVec3Pool().clearAndFreeCache();
|
||||
}
|
||||
catch (Throwable var3)
|
||||
{
|
||||
;
|
||||
}
|
||||
|
||||
try
|
||||
{
|
||||
System.gc();
|
||||
this.loadWorld((WorldClient)null);
|
||||
}
|
||||
catch (Throwable var2)
|
||||
{
|
||||
;
|
||||
}
|
||||
|
||||
System.gc();
|
||||
}
|
||||
|
||||
/**
|
||||
* Update debugProfilerName in response to number keys in debug screen
|
||||
*/
|
||||
private void updateDebugProfilerName(int par1)
|
||||
{
|
||||
List var2 = this.mcProfiler.getProfilingData(this.debugProfilerName);
|
||||
|
||||
if (var2 != null && !var2.isEmpty())
|
||||
{
|
||||
ProfilerResult var3 = (ProfilerResult)var2.remove(0);
|
||||
|
||||
if (par1 == 0)
|
||||
{
|
||||
if (var3.field_76331_c.length() > 0)
|
||||
{
|
||||
int var4 = this.debugProfilerName.lastIndexOf(".");
|
||||
|
||||
if (var4 >= 0)
|
||||
{
|
||||
this.debugProfilerName = this.debugProfilerName.substring(0, var4);
|
||||
}
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
--par1;
|
||||
|
||||
if (par1 < var2.size() && !((ProfilerResult)var2.get(par1)).field_76331_c.equals("unspecified"))
|
||||
{
|
||||
if (this.debugProfilerName.length() > 0)
|
||||
{
|
||||
this.debugProfilerName = this.debugProfilerName + ".";
|
||||
}
|
||||
|
||||
this.debugProfilerName = this.debugProfilerName + ((ProfilerResult)var2.get(par1)).field_76331_c;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
private void displayDebugInfo(long par1)
|
||||
{
|
||||
if (this.mcProfiler.profilingEnabled)
|
||||
{
|
||||
List var3 = this.mcProfiler.getProfilingData(this.debugProfilerName);
|
||||
ProfilerResult var4 = (ProfilerResult)var3.remove(0);
|
||||
EaglerAdapter.glClear(EaglerAdapter.GL_DEPTH_BUFFER_BIT);
|
||||
EaglerAdapter.glMatrixMode(EaglerAdapter.GL_PROJECTION);
|
||||
EaglerAdapter.glEnable(EaglerAdapter.GL_COLOR_MATERIAL);
|
||||
EaglerAdapter.glLoadIdentity();
|
||||
EaglerAdapter.glOrtho(0.0F, this.displayWidth, this.displayHeight, 0.0F, 1000.0F, 3000.0F);
|
||||
EaglerAdapter.glMatrixMode(EaglerAdapter.GL_MODELVIEW);
|
||||
EaglerAdapter.glLoadIdentity();
|
||||
EaglerAdapter.glTranslatef(0.0F, 0.0F, -2000.0F);
|
||||
EaglerAdapter.glLineWidth(1.0F);
|
||||
EaglerAdapter.glDisable(EaglerAdapter.GL_TEXTURE_2D);
|
||||
Tessellator var5 = Tessellator.instance;
|
||||
short var6 = 160;
|
||||
int var7 = this.displayWidth - var6 - 10;
|
||||
int var8 = this.displayHeight - var6 * 2;
|
||||
EaglerAdapter.glEnable(EaglerAdapter.GL_BLEND);
|
||||
var5.startDrawingQuads();
|
||||
var5.setColorRGBA_I(0, 200);
|
||||
var5.addVertex((double)((float)var7 - (float)var6 * 1.1F), (double)((float)var8 - (float)var6 * 0.6F - 16.0F), 0.0D);
|
||||
var5.addVertex((double)((float)var7 - (float)var6 * 1.1F), (double)(var8 + var6 * 2), 0.0D);
|
||||
var5.addVertex((double)((float)var7 + (float)var6 * 1.1F), (double)(var8 + var6 * 2), 0.0D);
|
||||
var5.addVertex((double)((float)var7 + (float)var6 * 1.1F), (double)((float)var8 - (float)var6 * 0.6F - 16.0F), 0.0D);
|
||||
var5.draw();
|
||||
EaglerAdapter.glDisable(EaglerAdapter.GL_BLEND);
|
||||
double var9 = 0.0D;
|
||||
int var13;
|
||||
|
||||
for (int var11 = 0; var11 < var3.size(); ++var11)
|
||||
{
|
||||
ProfilerResult var12 = (ProfilerResult)var3.get(var11);
|
||||
var13 = MathHelper.floor_double(var12.field_76332_a / 4.0D) + 1;
|
||||
var5.startDrawing(6);
|
||||
var5.setColorOpaque_I(var12.func_76329_a());
|
||||
var5.addVertex((double)var7, (double)var8, 0.0D);
|
||||
int var14;
|
||||
float var15;
|
||||
float var16;
|
||||
float var17;
|
||||
|
||||
for (var14 = var13; var14 >= 0; --var14)
|
||||
{
|
||||
var15 = (float)((var9 + var12.field_76332_a * (double)var14 / (double)var13) * Math.PI * 2.0D / 100.0D);
|
||||
var16 = MathHelper.sin(var15) * (float)var6;
|
||||
var17 = MathHelper.cos(var15) * (float)var6 * 0.5F;
|
||||
var5.addVertex((double)((float)var7 + var16), (double)((float)var8 - var17), 0.0D);
|
||||
}
|
||||
|
||||
var5.draw();
|
||||
var5.startDrawing(5);
|
||||
var5.setColorOpaque_I((var12.func_76329_a() & 16711422) >> 1);
|
||||
|
||||
for (var14 = var13; var14 >= 0; --var14)
|
||||
{
|
||||
var15 = (float)((var9 + var12.field_76332_a * (double)var14 / (double)var13) * Math.PI * 2.0D / 100.0D);
|
||||
var16 = MathHelper.sin(var15) * (float)var6;
|
||||
var17 = MathHelper.cos(var15) * (float)var6 * 0.5F;
|
||||
var5.addVertex((double)((float)var7 + var16), (double)((float)var8 - var17), 0.0D);
|
||||
var5.addVertex((double)((float)var7 + var16), (double)((float)var8 - var17 + 10.0F), 0.0D);
|
||||
}
|
||||
|
||||
var5.draw();
|
||||
var9 += var12.field_76332_a;
|
||||
}
|
||||
|
||||
DecimalFormat var18 = new DecimalFormat("##0.00");
|
||||
EaglerAdapter.glEnable(EaglerAdapter.GL_TEXTURE_2D);
|
||||
String var19 = "";
|
||||
|
||||
if (!var4.field_76331_c.equals("unspecified"))
|
||||
{
|
||||
var19 = var19 + "[0] ";
|
||||
}
|
||||
|
||||
if (var4.field_76331_c.length() == 0)
|
||||
{
|
||||
var19 = var19 + "ROOT ";
|
||||
}
|
||||
else
|
||||
{
|
||||
var19 = var19 + var4.field_76331_c + " ";
|
||||
}
|
||||
|
||||
var13 = 16777215;
|
||||
this.fontRenderer.drawStringWithShadow(var19, var7 - var6, var8 - var6 / 2 - 16, var13);
|
||||
this.fontRenderer.drawStringWithShadow(var19 = var18.format(var4.field_76330_b) + "%", var7 + var6 - this.fontRenderer.getStringWidth(var19), var8 - var6 / 2 - 16, var13);
|
||||
|
||||
for (int var21 = 0; var21 < var3.size(); ++var21)
|
||||
{
|
||||
ProfilerResult var20 = (ProfilerResult)var3.get(var21);
|
||||
String var22 = "";
|
||||
|
||||
if (var20.field_76331_c.equals("unspecified"))
|
||||
{
|
||||
var22 = var22 + "[?] ";
|
||||
}
|
||||
else
|
||||
{
|
||||
var22 = var22 + "[" + (var21 + 1) + "] ";
|
||||
}
|
||||
|
||||
var22 = var22 + var20.field_76331_c;
|
||||
this.fontRenderer.drawStringWithShadow(var22, var7 - var6, var8 + var6 / 2 + var21 * 8 + 20, var20.func_76329_a());
|
||||
this.fontRenderer.drawStringWithShadow(var22 = var18.format(var20.field_76332_a) + "%", var7 + var6 - 50 - this.fontRenderer.getStringWidth(var22), var8 + var6 / 2 + var21 * 8 + 20, var20.func_76329_a());
|
||||
this.fontRenderer.drawStringWithShadow(var22 = var18.format(var20.field_76330_b) + "%", var7 + var6 - this.fontRenderer.getStringWidth(var22), var8 + var6 / 2 + var21 * 8 + 20, var20.func_76329_a());
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Called when the window is closing. Sets 'running' to false which allows the game loop to exit cleanly.
|
||||
*/
|
||||
|
@ -39,17 +39,7 @@ public class Profiler
|
||||
*/
|
||||
public void startSection(String par1Str)
|
||||
{
|
||||
if (this.profilingEnabled)
|
||||
{
|
||||
if (this.profilingSection.length() > 0)
|
||||
{
|
||||
this.profilingSection = this.profilingSection + ".";
|
||||
}
|
||||
|
||||
this.profilingSection = this.profilingSection + par1Str;
|
||||
this.sectionList.add(this.profilingSection);
|
||||
this.timestampList.add(Long.valueOf(System.nanoTime()));
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
@ -57,29 +47,7 @@ public class Profiler
|
||||
*/
|
||||
public void endSection()
|
||||
{
|
||||
if (this.profilingEnabled)
|
||||
{
|
||||
long var1 = System.nanoTime();
|
||||
long var3 = ((Long)this.timestampList.remove(this.timestampList.size() - 1)).longValue();
|
||||
this.sectionList.remove(this.sectionList.size() - 1);
|
||||
long var5 = var1 - var3;
|
||||
|
||||
if (this.profilingMap.containsKey(this.profilingSection))
|
||||
{
|
||||
this.profilingMap.put(this.profilingSection, Long.valueOf(((Long)this.profilingMap.get(this.profilingSection)).longValue() + var5));
|
||||
}
|
||||
else
|
||||
{
|
||||
this.profilingMap.put(this.profilingSection, Long.valueOf(var5));
|
||||
}
|
||||
|
||||
if (var5 > 100000000L)
|
||||
{
|
||||
System.out.println("Something\'s taking too long! \'" + this.profilingSection + "\' took aprox " + (double)var5 / 1000000.0D + " ms");
|
||||
}
|
||||
|
||||
this.profilingSection = !this.sectionList.isEmpty() ? (String)this.sectionList.get(this.sectionList.size() - 1) : "";
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
@ -87,80 +55,7 @@ public class Profiler
|
||||
*/
|
||||
public List getProfilingData(String par1Str)
|
||||
{
|
||||
if (!this.profilingEnabled)
|
||||
{
|
||||
return null;
|
||||
}
|
||||
else
|
||||
{
|
||||
long var3 = this.profilingMap.containsKey("root") ? ((Long)this.profilingMap.get("root")).longValue() : 0L;
|
||||
long var5 = this.profilingMap.containsKey(par1Str) ? ((Long)this.profilingMap.get(par1Str)).longValue() : -1L;
|
||||
ArrayList var7 = new ArrayList();
|
||||
|
||||
if (par1Str.length() > 0)
|
||||
{
|
||||
par1Str = par1Str + ".";
|
||||
}
|
||||
|
||||
long var8 = 0L;
|
||||
Iterator var10 = this.profilingMap.keySet().iterator();
|
||||
|
||||
while (var10.hasNext())
|
||||
{
|
||||
String var11 = (String)var10.next();
|
||||
|
||||
if (var11.length() > par1Str.length() && var11.startsWith(par1Str) && var11.indexOf(".", par1Str.length() + 1) < 0)
|
||||
{
|
||||
var8 += ((Long)this.profilingMap.get(var11)).longValue();
|
||||
}
|
||||
}
|
||||
|
||||
float var20 = (float)var8;
|
||||
|
||||
if (var8 < var5)
|
||||
{
|
||||
var8 = var5;
|
||||
}
|
||||
|
||||
if (var3 < var8)
|
||||
{
|
||||
var3 = var8;
|
||||
}
|
||||
|
||||
Iterator var21 = this.profilingMap.keySet().iterator();
|
||||
String var12;
|
||||
|
||||
while (var21.hasNext())
|
||||
{
|
||||
var12 = (String)var21.next();
|
||||
|
||||
if (var12.length() > par1Str.length() && var12.startsWith(par1Str) && var12.indexOf(".", par1Str.length() + 1) < 0)
|
||||
{
|
||||
long var13 = ((Long)this.profilingMap.get(var12)).longValue();
|
||||
double var15 = (double)var13 * 100.0D / (double)var8;
|
||||
double var17 = (double)var13 * 100.0D / (double)var3;
|
||||
String var19 = var12.substring(par1Str.length());
|
||||
var7.add(new ProfilerResult(var19, var15, var17));
|
||||
}
|
||||
}
|
||||
|
||||
var21 = this.profilingMap.keySet().iterator();
|
||||
|
||||
while (var21.hasNext())
|
||||
{
|
||||
var12 = (String)var21.next();
|
||||
this.profilingMap.put(var12, Long.valueOf(((Long)this.profilingMap.get(var12)).longValue() * 999L / 1000L));
|
||||
}
|
||||
|
||||
if ((float)var8 > var20)
|
||||
{
|
||||
var7.add(new ProfilerResult("unspecified", (double)((float)var8 - var20) * 100.0D / (double)var8, (double)((float)var8 - var20) * 100.0D / (double)var3));
|
||||
}
|
||||
|
||||
Collections.sort(var7);
|
||||
var7.add(0, new ProfilerResult(par1Str, 100.0D, (double)var8 * 100.0D / (double)var3));
|
||||
return var7;
|
||||
}
|
||||
return null;
|
||||
}
|
||||
|
||||
/**
|
||||
@ -168,12 +63,5 @@ public class Profiler
|
||||
*/
|
||||
public void endStartSection(String par1Str)
|
||||
{
|
||||
this.endSection();
|
||||
this.startSection(par1Str);
|
||||
}
|
||||
|
||||
public String getNameOfLastSection()
|
||||
{
|
||||
return this.sectionList.size() == 0 ? "[UNKNOWN]" : (String)this.sectionList.get(this.sectionList.size() - 1);
|
||||
}
|
||||
}
|
||||
|
@ -3538,7 +3538,7 @@ public class RenderBlocks
|
||||
}
|
||||
|
||||
/**
|
||||
* Utility function to draw crossed swuares
|
||||
* Utility function to draw crossed squares
|
||||
*/
|
||||
public void drawCrossedSquares(Block par1Block, int par2, double par3, double par5, double par7, float par9)
|
||||
{
|
||||
|
Loading…
x
Reference in New Issue
Block a user