Deflater.java 16.9 KB
Newer Older
Tom Tromey committed
1
/* Deflater.java - Compress a data stream
2
   Copyright (C) 1999, 2000, 2001, 2004, 2005 Free Software Foundation, Inc.
Tom Tromey committed
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43

This file is part of GNU Classpath.

GNU Classpath is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.

GNU Classpath is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
General Public License for more details.

You should have received a copy of the GNU General Public License
along with GNU Classpath; see the file COPYING.  If not, write to the
Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301 USA.

Linking this library statically or dynamically with other modules is
making a combined work based on this library.  Thus, the terms and
conditions of the GNU General Public License cover the whole
combination.

As a special exception, the copyright holders of this library give you
permission to link this library with independent modules to produce an
executable, regardless of the license terms of these independent
modules, and to copy and distribute the resulting executable under
terms of your choice, provided that you also meet, for each linked
independent module, the terms and conditions of the license of that
module.  An independent module is a module which is not derived from
or based on this library.  If you modify this library, you may extend
this exception to your version of the library, but you are not
obligated to do so.  If you do not wish to do so, delete this
exception statement from your version. */

package java.util.zip;

/**
 * This is the Deflater class.  The deflater class compresses input
 * with the deflate algorithm described in RFC 1951.  It has several
 * compression levels and three different strategies described below.
44
 *
Tom Tromey committed
45 46
 * This class is <i>not</i> thread safe.  This is inherent in the API, due
 * to the split of deflate and setInput.
47
 *
Tom Tromey committed
48 49 50 51 52 53 54
 * @author Jochen Hoenicke
 * @author Tom Tromey
 */
public class Deflater
{
  /**
   * The best and slowest compression level.  This tries to find very
55
   * long and distant string repetitions.
Tom Tromey committed
56 57 58
   */
  public static final int BEST_COMPRESSION = 9;
  /**
59
   * The worst but fastest compression level.
Tom Tromey committed
60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80
   */
  public static final int BEST_SPEED = 1;
  /**
   * The default compression level.
   */
  public static final int DEFAULT_COMPRESSION = -1;
  /**
   * This level won't compress at all but output uncompressed blocks.
   */
  public static final int NO_COMPRESSION = 0;

  /**
   * The default strategy.
   */
  public static final int DEFAULT_STRATEGY = 0;
  /**
   * This strategy will only allow longer string repetitions.  It is
   * useful for random data with a small character set.
   */
  public static final int FILTERED = 1;

81
  /**
Tom Tromey committed
82 83
   * This strategy will not look for string repetitions at all.  It
   * only encodes with Huffman trees (which means, that more common
84
   * characters get a smaller encoding.
Tom Tromey committed
85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125
   */
  public static final int HUFFMAN_ONLY = 2;

  /**
   * The compression method.  This is the only method supported so far.
   * There is no need to use this constant at all.
   */
  public static final int DEFLATED = 8;

  /*
   * The Deflater can do the following state transitions:
   *
   * (1) -> INIT_STATE   ----> INIT_FINISHING_STATE ---.
   *        /  | (2)      (5)                         |
   *       /   v          (5)                         |
   *   (3)| SETDICT_STATE ---> SETDICT_FINISHING_STATE |(3)
   *       \   | (3)                 |        ,-------'
   *        |  |                     | (3)   /
   *        v  v          (5)        v      v
   * (1) -> BUSY_STATE   ----> FINISHING_STATE
   *                                | (6)
   *                                v
   *                           FINISHED_STATE
   *    \_____________________________________/
   *          | (7)
   *          v
   *        CLOSED_STATE
   *
   * (1) If we should produce a header we start in INIT_STATE, otherwise
   *     we start in BUSY_STATE.
   * (2) A dictionary may be set only when we are in INIT_STATE, then
   *     we change the state as indicated.
   * (3) Whether a dictionary is set or not, on the first call of deflate
   *     we change to BUSY_STATE.
   * (4) -- intentionally left blank -- :)
   * (5) FINISHING_STATE is entered, when flush() is called to indicate that
   *     there is no more INPUT.  There are also states indicating, that
   *     the header wasn't written yet.
   * (6) FINISHED_STATE is entered, when everything has been flushed to the
   *     internal pending output buffer.
   * (7) At any time (7)
126
   *
Tom Tromey committed
127 128 129 130 131
   */

  private static final int IS_SETDICT              = 0x01;
  private static final int IS_FLUSHING             = 0x04;
  private static final int IS_FINISHING            = 0x08;
132

Tom Tromey committed
133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152
  private static final int INIT_STATE              = 0x00;
  private static final int SETDICT_STATE           = 0x01;
  private static final int INIT_FINISHING_STATE    = 0x08;
  private static final int SETDICT_FINISHING_STATE = 0x09;
  private static final int BUSY_STATE              = 0x10;
  private static final int FLUSHING_STATE          = 0x14;
  private static final int FINISHING_STATE         = 0x1c;
  private static final int FINISHED_STATE          = 0x1e;
  private static final int CLOSED_STATE            = 0x7f;

  /** Compression level. */
  private int level;

  /** should we include a header. */
  private boolean noHeader;

  /** The current state. */
  private int state;

  /** The total bytes of output written. */
153
  private long totalOut;
154

Tom Tromey committed
155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171
  /** The pending output. */
  private DeflaterPending pending;

  /** The deflater engine. */
  private DeflaterEngine engine;

  /**
   * Creates a new deflater with default compression level.
   */
  public Deflater()
  {
    this(DEFAULT_COMPRESSION, false);
  }

  /**
   * Creates a new deflater with given compression level.
   * @param lvl the compression level, a value between NO_COMPRESSION
172
   * and BEST_COMPRESSION, or DEFAULT_COMPRESSION.
Tom Tromey committed
173 174 175 176 177 178 179 180 181 182
   * @exception IllegalArgumentException if lvl is out of range.
   */
  public Deflater(int lvl)
  {
    this(lvl, false);
  }

  /**
   * Creates a new deflater with given compression level.
   * @param lvl the compression level, a value between NO_COMPRESSION
183
   * and BEST_COMPRESSION.
Tom Tromey committed
184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203
   * @param nowrap true, iff we should suppress the deflate header at the
   * beginning and the adler checksum at the end of the output.  This is
   * useful for the GZIP format.
   * @exception IllegalArgumentException if lvl is out of range.
   */
  public Deflater(int lvl, boolean nowrap)
  {
    if (lvl == DEFAULT_COMPRESSION)
      lvl = 6;
    else if (lvl < NO_COMPRESSION || lvl > BEST_COMPRESSION)
      throw new IllegalArgumentException();

    pending = new DeflaterPending();
    engine = new DeflaterEngine(pending);
    this.noHeader = nowrap;
    setStrategy(DEFAULT_STRATEGY);
    setLevel(lvl);
    reset();
  }

204
  /**
Tom Tromey committed
205 206
   * Resets the deflater.  The deflater acts afterwards as if it was
   * just created with the same compression level and strategy as it
207
   * had before.
Tom Tromey committed
208
   */
209
  public void reset()
Tom Tromey committed
210 211 212 213 214 215
  {
    state = (noHeader ? BUSY_STATE : INIT_STATE);
    totalOut = 0;
    pending.reset();
    engine.reset();
  }
216

Tom Tromey committed
217 218 219 220 221 222
  /**
   * Frees all objects allocated by the compressor.  There's no
   * reason to call this, since you can just rely on garbage
   * collection.  Exists only for compatibility against Sun's JDK,
   * where the compressor allocates native memory.
   * If you call any method (even reset) afterwards the behaviour is
223
   * <i>undefined</i>.
Tom Tromey committed
224 225 226 227 228 229 230 231
   */
  public void end()
  {
    engine = null;
    pending = null;
    state = CLOSED_STATE;
  }

232
  /**
Tom Tromey committed
233 234 235 236 237 238 239 240
   * Gets the current adler checksum of the data that was processed so
   * far.
   */
  public int getAdler()
  {
    return engine.getAdler();
  }

241
  /**
Tom Tromey committed
242 243 244 245
   * Gets the number of input bytes processed so far.
   */
  public int getTotalIn()
  {
246 247 248
    return (int) engine.getTotalIn();
  }

249
  /**
250 251 252 253 254
   * Gets the number of input bytes processed so far.
   * @since 1.5
   */
  public long getBytesRead()
  {
Tom Tromey committed
255 256 257
    return engine.getTotalIn();
  }

258
  /**
Tom Tromey committed
259 260 261 262
   * Gets the number of output bytes so far.
   */
  public int getTotalOut()
  {
263 264 265
    return (int) totalOut;
  }

266
  /**
267 268 269 270 271
   * Gets the number of output bytes so far.
   * @since 1.5
   */
  public long getBytesWritten()
  {
Tom Tromey committed
272 273 274
    return totalOut;
  }

275
  /**
Tom Tromey committed
276 277 278 279 280 281 282
   * Finalizes this object.
   */
  protected void finalize()
  {
    /* Exists solely for compatibility.  We don't have any native state. */
  }

283
  /**
Tom Tromey committed
284 285 286 287 288 289 290 291 292 293
   * Flushes the current input block.  Further calls to deflate() will
   * produce enough output to inflate everything in the current input
   * block.  This is not part of Sun's JDK so I have made it package
   * private.  It is used by DeflaterOutputStream to implement
   * flush().
   */
  void flush() {
    state |= IS_FLUSHING;
  }

294
  /**
Tom Tromey committed
295 296 297 298 299 300 301 302
   * Finishes the deflater with the current input block.  It is an error
   * to give more input after this method was called.  This method must
   * be called to force all bytes to be flushed.
   */
  public void finish() {
    state |= IS_FLUSHING | IS_FINISHING;
  }

303
  /**
Tom Tromey committed
304 305 306 307 308 309 310 311 312 313 314 315 316
   * Returns true iff the stream was finished and no more output bytes
   * are available.
   */
  public boolean finished()
  {
    return state == FINISHED_STATE && pending.isFlushed();
  }

  /**
   * Returns true, if the input buffer is empty.
   * You should then call setInput(). <br>
   *
   * <em>NOTE</em>: This method can also return true when the stream
317
   * was finished.
Tom Tromey committed
318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346
   */
  public boolean needsInput()
  {
    return engine.needsInput();
  }

  /**
   * Sets the data which should be compressed next.  This should be only
   * called when needsInput indicates that more input is needed.
   * If you call setInput when needsInput() returns false, the
   * previous input that is still pending will be thrown away.
   * The given byte array should not be changed, before needsInput() returns
   * true again.
   * This call is equivalent to <code>setInput(input, 0, input.length)</code>.
   * @param input the buffer containing the input data.
   * @exception IllegalStateException if the buffer was finished() or ended().
   */
  public void setInput(byte[] input)
  {
    setInput(input, 0, input.length);
  }

  /**
   * Sets the data which should be compressed next.  This should be
   * only called when needsInput indicates that more input is needed.
   * The given byte array should not be changed, before needsInput() returns
   * true again.
   * @param input the buffer containing the input data.
   * @param off the start of the data.
347
   * @param len the length of the data.
Tom Tromey committed
348 349 350 351 352 353 354 355 356 357
   * @exception IllegalStateException if the buffer was finished() or ended()
   * or if previous input is still pending.
   */
  public void setInput(byte[] input, int off, int len)
  {
    if ((state & IS_FINISHING) != 0)
      throw new IllegalStateException("finish()/end() already called");
    engine.setInput(input, off, len);
  }

358
  /**
Tom Tromey committed
359 360 361
   * Sets the compression level.  There is no guarantee of the exact
   * position of the change, but if you call this when needsInput is
   * true the change of compression level will occur somewhere near
362
   * before the end of the so far given input.
Tom Tromey committed
363 364 365 366 367 368 369 370 371 372 373 374
   * @param lvl the new compression level.
   */
  public void setLevel(int lvl)
  {
    if (lvl == DEFAULT_COMPRESSION)
      lvl = 6;
    else if (lvl < NO_COMPRESSION || lvl > BEST_COMPRESSION)
      throw new IllegalArgumentException();


    if (level != lvl)
      {
375 376
        level = lvl;
        engine.setLevel(lvl);
Tom Tromey committed
377 378 379
      }
  }

380
  /**
Tom Tromey committed
381 382 383 384 385 386 387 388 389
   * Sets the compression strategy. Strategy is one of
   * DEFAULT_STRATEGY, HUFFMAN_ONLY and FILTERED.  For the exact
   * position where the strategy is changed, the same as for
   * setLevel() applies.
   * @param stgy the new compression strategy.
   */
  public void setStrategy(int stgy)
  {
    if (stgy != DEFAULT_STRATEGY && stgy != FILTERED
390
        && stgy != HUFFMAN_ONLY)
Tom Tromey committed
391 392 393 394 395
      throw new IllegalArgumentException();
    engine.setStrategy(stgy);
  }

  /**
396 397
   * Deflates the current input block to the given array.  It returns
   * the number of bytes compressed, or 0 if either
Tom Tromey committed
398 399 400 401 402 403 404 405 406
   * needsInput() or finished() returns true or length is zero.
   * @param output the buffer where to write the compressed data.
   */
  public int deflate(byte[] output)
  {
    return deflate(output, 0, output.length);
  }

  /**
407 408
   * Deflates the current input block to the given array.  It returns
   * the number of bytes compressed, or 0 if either
Tom Tromey committed
409 410 411 412 413 414
   * needsInput() or finished() returns true or length is zero.
   * @param output the buffer where to write the compressed data.
   * @param offset the offset into the output array.
   * @param length the maximum number of bytes that may be written.
   * @exception IllegalStateException if end() was called.
   * @exception IndexOutOfBoundsException if offset and/or length
415
   * don't match the array length.
Tom Tromey committed
416 417 418 419 420 421 422 423 424 425
   */
  public int deflate(byte[] output, int offset, int length)
  {
    int origLength = length;

    if (state == CLOSED_STATE)
      throw new IllegalStateException("Deflater closed");

    if (state < BUSY_STATE)
      {
426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447
        /* output header */
        int header = (DEFLATED +
                      ((DeflaterConstants.MAX_WBITS - 8) << 4)) << 8;
        int level_flags = (level - 1) >> 1;
        if (level_flags < 0 || level_flags > 3)
          level_flags = 3;
        header |= level_flags << 6;
        if ((state & IS_SETDICT) != 0)
          /* Dictionary was set */
          header |= DeflaterConstants.PRESET_DICT;
        header += 31 - (header % 31);

        pending.writeShortMSB(header);
        if ((state & IS_SETDICT) != 0)
          {
            int chksum = engine.getAdler();
            engine.resetAdler();
            pending.writeShortMSB(chksum >> 16);
            pending.writeShortMSB(chksum & 0xffff);
          }

        state = BUSY_STATE | (state & (IS_FLUSHING | IS_FINISHING));
Tom Tromey committed
448 449 450 451
      }

    for (;;)
      {
452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497
        int count = pending.flush(output, offset, length);
        offset += count;
        totalOut += count;
        length -= count;
        if (length == 0 || state == FINISHED_STATE)
          break;

        if (!engine.deflate((state & IS_FLUSHING) != 0,
                            (state & IS_FINISHING) != 0))
          {
            if (state == BUSY_STATE)
              /* We need more input now */
              return origLength - length;
            else if (state == FLUSHING_STATE)
              {
                if (level != NO_COMPRESSION)
                  {
                    /* We have to supply some lookahead.  8 bit lookahead
                     * are needed by the zlib inflater, and we must fill
                     * the next byte, so that all bits are flushed.
                     */
                    int neededbits = 8 + ((-pending.getBitCount()) & 7);
                    while (neededbits > 0)
                      {
                        /* write a static tree block consisting solely of
                         * an EOF:
                         */
                        pending.writeBits(2, 10);
                        neededbits -= 10;
                      }
                  }
                state = BUSY_STATE;
              }
            else if (state == FINISHING_STATE)
              {
                pending.alignToByte();
                /* We have completed the stream */
                if (!noHeader)
                  {
                    int adler = engine.getAdler();
                    pending.writeShortMSB(adler >> 16);
                    pending.writeShortMSB(adler & 0xffff);
                  }
                state = FINISHED_STATE;
              }
          }
Tom Tromey committed
498 499 500 501 502 503 504 505
      }

    return origLength - length;
  }

  /**
   * Sets the dictionary which should be used in the deflate process.
   * This call is equivalent to <code>setDictionary(dict, 0,
506 507
   * dict.length)</code>.
   * @param dict the dictionary.
Tom Tromey committed
508
   * @exception IllegalStateException if setInput () or deflate ()
509
   * were already called or another dictionary was already set.
Tom Tromey committed
510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537
   */
  public void setDictionary(byte[] dict)
  {
    setDictionary(dict, 0, dict.length);
  }

  /**
   * Sets the dictionary which should be used in the deflate process.
   * The dictionary should be a byte array containing strings that are
   * likely to occur in the data which should be compressed.  The
   * dictionary is not stored in the compressed output, only a
   * checksum.  To decompress the output you need to supply the same
   * dictionary again.
   * @param dict the dictionary.
   * @param offset an offset into the dictionary.
   * @param length the length of the dictionary.
   * @exception IllegalStateException if setInput () or deflate () were
   * already called or another dictionary was already set.
   */
  public void setDictionary(byte[] dict, int offset, int length)
  {
    if (state != INIT_STATE)
      throw new IllegalStateException();

    state = SETDICT_STATE;
    engine.setDictionary(dict, offset, length);
  }
}