Rebasing the Inflater support on jzlib which, unlike GNU ClassPath, has correct implementation of Huffman code. Making the implementation more easily testable by turning Inflater and ZipInputStream into pure delegates. Current implementation is going to need proper long support.
1 /* -*-mode:java; c-basic-offset:2; -*- */
3 Copyright (c) 2000-2011 ymnk, JCraft,Inc. All rights reserved.
5 Redistribution and use in source and binary forms, with or without
6 modification, are permitted provided that the following conditions are met:
8 1. Redistributions of source code must retain the above copyright notice,
9 this list of conditions and the following disclaimer.
11 2. Redistributions in binary form must reproduce the above copyright
12 notice, this list of conditions and the following disclaimer in
13 the documentation and/or other materials provided with the distribution.
15 3. The names of the authors may not be used to endorse or promote products
16 derived from this software without specific prior written permission.
18 THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
19 INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
20 FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
21 INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
22 INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
23 LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
24 OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
25 LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
26 NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
27 EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 * This program is based on zlib-1.1.3, so all credit should go authors
31 * Jean-loup Gailly(jloup@gzip.org) and Mark Adler(madler@alumni.caltech.edu)
32 * and contributors of zlib.
35 package org.apidesign.bck2brwsr.emul.zip;
37 final class Adler32 implements Checksum {
39 // largest prime smaller than 65536
40 static final private int BASE=65521;
41 // NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1
42 static final private int NMAX=5552;
47 public void reset(long init){
57 public long getValue(){
61 public void update(byte[] buf, int index, int len){
64 s1+=buf[index++]&0xff; s2+=s1;
76 s1+=buf[index++]&0xff; s2+=s1;
85 s1+=buf[index++]&0xff; s2+=s1;
91 public Adler32 copy(){
92 Adler32 foo = new Adler32();
98 // The following logic has come from zlib.1.2.
99 static long combine(long adler1, long adler2, long len2){
100 long BASEL = (long)BASE;
103 long rem; // unsigned int
106 sum1 = adler1 & 0xffffL;
108 sum2 %= BASEL; // MOD(sum2);
109 sum1 += (adler2 & 0xffffL) + BASEL - 1;
110 sum2 += ((adler1 >> 16) & 0xffffL) + ((adler2 >> 16) & 0xffffL) + BASEL - rem;
111 if (sum1 >= BASEL) sum1 -= BASEL;
112 if (sum1 >= BASEL) sum1 -= BASEL;
113 if (sum2 >= (BASEL << 1)) sum2 -= (BASEL << 1);
114 if (sum2 >= BASEL) sum2 -= BASEL;
115 return sum1 | (sum2 << 16);
119 private java.util.zip.Adler32 adler=new java.util.zip.Adler32();
120 public void update(byte[] buf, int index, int len){
121 if(buf==null) {adler.reset();}
122 else{adler.update(buf, index, len);}
127 public void reset(long init){
132 System.err.println("unsupported operation");
135 public long getValue(){
136 return adler.getValue();