zopfli-bin 0.1.0

data/vendor/zopfli/Makefile

@@ -0,0 +1,37 @@
+CC = gcc
+CXX = g++
+
+CFLAGS = -W -Wall -Wextra -ansi -pedantic -lm -O2
+CXXFLAGS = -W -Wall -Wextra -ansi -pedantic -O2
+
+ZOPFLILIB_SRC = src/zopfli/blocksplitter.c src/zopfli/cache.c\
+                src/zopfli/deflate.c src/zopfli/gzip_container.c\
+                src/zopfli/hash.c src/zopfli/katajainen.c\
+                src/zopfli/lz77.c src/zopfli/squeeze.c\
+                src/zopfli/tree.c src/zopfli/util.c\
+                src/zopfli/zlib_container.c src/zopfli/zopfli_lib.c
+ZOPFLILIB_OBJ := $(patsubst src/zopfli/%.c,%.o,$(ZOPFLILIB_SRC))
+ZOPFLIBIN_SRC := src/zopfli/zopfli_bin.c
+LODEPNG_SRC := src/zopflipng/lodepng/lodepng.cpp src/zopflipng/lodepng/lodepng_util.cpp
+ZOPFLIPNGLIB_SRC := src/zopflipng/zopflipng_lib.cc
+ZOPFLIPNGBIN_SRC := src/zopflipng/zopflipng_bin.cc
+
+.PHONY: zopfli zopflipng
+
+# Zopfli binary
+zopfli:
+	$(CC) $(ZOPFLILIB_SRC) $(ZOPFLIBIN_SRC) $(CFLAGS) -o zopfli
+
+# Zopfli shared library
+libzopfli:
+	$(CC) $(ZOPFLILIB_SRC) $(CFLAGS) -fPIC -c
+	$(CC) $(ZOPFLILIB_OBJ) $(CFLAGS) -shared -Wl,-soname,libzopfli.so.1 -o libzopfli.so.1.0.1
+
+# ZopfliPNG binary
+zopflipng:
+	$(CC) $(ZOPFLILIB_SRC) $(CFLAGS) -c
+	$(CXX) $(ZOPFLILIB_OBJ) $(LODEPNG_SRC) $(ZOPFLIPNGLIB_SRC) $(ZOPFLIPNGBIN_SRC) $(CFLAGS) -o zopflipng
+
+# Remove all libraries and binaries
+clean:
+	rm -f zopflipng zopfli $(ZOPFLILIB_OBJ) libzopfli*

data/vendor/zopfli/README

@@ -0,0 +1,32 @@
+Zopfli Compression Algorithm is a compression library programmed in C to perform
+very good, but slow, deflate or zlib compression.
+
+The basic function to compress data is ZopfliCompress in zopfli.h. Use the
+ZopfliOptions object to set parameters that affect the speed and compression.
+Use the ZopfliInitOptions function to place the default values in the
+ZopfliOptions first.
+
+ZopfliCompress supports deflate, gzip and zlib output format with a parameter.
+To support only one individual format, you can instead use ZopfliDeflate in
+deflate.h, ZopfliZlibCompress in zlib_container.h or ZopfliGzipCompress in
+gzip_container.h.
+
+ZopfliDeflate creates a valid deflate stream in memory, see:
+http://www.ietf.org/rfc/rfc1951.txt
+ZopfliZlibCompress creates a valid zlib stream in memory, see:
+http://www.ietf.org/rfc/rfc1950.txt
+ZopfliGzipCompress creates a valid gzip stream in memory, see:
+http://www.ietf.org/rfc/rfc1952.txt
+
+This library can only compress, not decompress. Existing zlib or deflate
+libraries can decompress the data.
+
+zopfli_bin.c is separate from the library and contains an example program to
+create very well compressed gzip files. Currently the makefile builds this
+program with the library statically linked in.
+
+To build the binary, use "make". To build the library as a shared Linux library,
+use "make libzopfli". The source code of Zopfli is under src/zopfli.
+
+Zopfli Compression Algorithm was created by Lode Vandevenne and Jyrki
+Alakuijala, based on an algorithm by Jyrki Alakuijala.

data/vendor/zopfli/README.zopflipng

@@ -0,0 +1,35 @@
+ZopfliPNG is a command line program to optimize the Portable Network Graphics
+(PNG) images. This version has the following features:
+- uses Zopfli compression for the Deflate compression,
+- compares several strategies for choosing scanline filter codes,
+- chooses a suitable color type to losslessly encode the image,
+- removes all chunks that are unimportant for the typical web use (metadata,
+  text, etc...),
+- optionally alters the hidden colors of fully transparent pixels for more
+  compression, and,
+- optionally converts 16-bit color channels to 8-bit.
+
+This is an alpha-release for testing while improvements, particularly to add
+palette selection, are still being made. Feedback and bug reports are welcome.
+
+To build ZopfliPNG, use "make zopflipng", or compile all the sources except
+zopfli_bin.c.
+
+The main compression algorithm in ZopfliPNG is ported from WebP lossless, but
+naturally cannot give as much compression gain for PNGs as it does for a more
+modern compression codec like WebP
+https://developers.google.com/speed/webp/docs/webp_lossless_bitstream_specification.
+
+Compared to libpng -- an often used PNG encoder implementation -- ZopfliPNG uses
+2-3 orders of magnitude more CPU time for compression. Initial testing using a
+corpus of 1000 PNGs with translucency, randomly selected from the internet,
+gives a compression improvement of 12% compared to convert -q 95, but only 0.5%
+compared to pngout (from better of /f0 and /f5 runs).
+
+By releasing this software we hope to make images on the web load faster without
+a new image format, but the opportunities for optimization within PNG are
+limited. When targeting Android, Chrome, Opera, and Yandex browsers, or by using
+suitable plugins for other browsers, it is good to note that WebP lossless
+images are still 26 % smaller than images recompressed with ZopfliPNG.
+
+2013-05-07, Lode Vandevenne and Jyrki Alakuijala

data/vendor/zopfli/src/zopfli/blocksplitter.c

@@ -0,0 +1,342 @@
+/*
+Copyright 2011 Google Inc. All Rights Reserved.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+    http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
+
+Author: lode.vandevenne@gmail.com (Lode Vandevenne)
+Author: jyrki.alakuijala@gmail.com (Jyrki Alakuijala)
+*/
+
+#include "blocksplitter.h"
+
+#include <assert.h>
+#include <stdio.h>
+#include <stdlib.h>
+
+#include "deflate.h"
+#include "lz77.h"
+#include "squeeze.h"
+#include "tree.h"
+#include "util.h"
+
+/*
+The "f" for the FindMinimum function below.
+i: the current parameter of f(i)
+context: for your implementation
+*/
+typedef double FindMinimumFun(size_t i, void* context);
+
+/*
+Finds minimum of function f(i) where is is of type size_t, f(i) is of type
+double, i is in range start-end (excluding end).
+*/
+static size_t FindMinimum(FindMinimumFun f, void* context,
+                          size_t start, size_t end) {
+  if (end - start < 1024) {
+    double best = ZOPFLI_LARGE_FLOAT;
+    size_t result = start;
+    size_t i;
+    for (i = start; i < end; i++) {
+      double v = f(i, context);
+      if (v < best) {
+        best = v;
+        result = i;
+      }
+    }
+    return result;
+  } else {
+    /* Try to find minimum faster by recursively checking multiple points. */
+#define NUM 9  /* Good value: 9. */
+    size_t i;
+    size_t p[NUM];
+    double vp[NUM];
+    size_t besti;
+    double best;
+    double lastbest = ZOPFLI_LARGE_FLOAT;
+    size_t pos = start;
+
+    for (;;) {
+      if (end - start <= NUM) break;
+
+      for (i = 0; i < NUM; i++) {
+        p[i] = start + (i + 1) * ((end - start) / (NUM + 1));
+        vp[i] = f(p[i], context);
+      }
+      besti = 0;
+      best = vp[0];
+      for (i = 1; i < NUM; i++) {
+        if (vp[i] < best) {
+          best = vp[i];
+          besti = i;
+        }
+      }
+      if (best > lastbest) break;
+
+      start = besti == 0 ? start : p[besti - 1];
+      end = besti == NUM - 1 ? end : p[besti + 1];
+
+      pos = p[besti];
+      lastbest = best;
+    }
+    return pos;
+#undef NUM
+  }
+}
+
+/*
+Returns estimated cost of a block in bits.  It includes the size to encode the
+tree and the size to encode all literal, length and distance symbols and their
+extra bits.
+
+litlens: lz77 lit/lengths
+dists: ll77 distances
+lstart: start of block
+lend: end of block (not inclusive)
+*/
+static double EstimateCost(const unsigned short* litlens,
+                           const unsigned short* dists,
+                           size_t lstart, size_t lend) {
+  return ZopfliCalculateBlockSize(litlens, dists, lstart, lend, 2);
+}
+
+typedef struct SplitCostContext {
+  const unsigned short* litlens;
+  const unsigned short* dists;
+  size_t llsize;
+  size_t start;
+  size_t end;
+} SplitCostContext;
+
+
+/*
+Gets the cost which is the sum of the cost of the left and the right section
+of the data.
+type: FindMinimumFun
+*/
+static double SplitCost(size_t i, void* context) {
+  SplitCostContext* c = (SplitCostContext*)context;
+  return EstimateCost(c->litlens, c->dists, c->start, i) +
+      EstimateCost(c->litlens, c->dists, i, c->end);
+}
+
+static void AddSorted(size_t value, size_t** out, size_t* outsize) {
+  size_t i;
+  ZOPFLI_APPEND_DATA(value, out, outsize);
+  for (i = 0; i + 1 < *outsize; i++) {
+    if ((*out)[i] > value) {
+      size_t j;
+      for (j = *outsize - 1; j > i; j--) {
+        (*out)[j] = (*out)[j - 1];
+      }
+      (*out)[i] = value;
+      break;
+    }
+  }
+}
+
+/*
+Prints the block split points as decimal and hex values in the terminal.
+*/
+static void PrintBlockSplitPoints(const unsigned short* litlens,
+                                  const unsigned short* dists,
+                                  size_t llsize, const size_t* lz77splitpoints,
+                                  size_t nlz77points) {
+  size_t* splitpoints = 0;
+  size_t npoints = 0;
+  size_t i;
+  /* The input is given as lz77 indices, but we want to see the uncompressed
+  index values. */
+  size_t pos = 0;
+  if (nlz77points > 0) {
+    for (i = 0; i < llsize; i++) {
+      size_t length = dists[i] == 0 ? 1 : litlens[i];
+      if (lz77splitpoints[npoints] == i) {
+        ZOPFLI_APPEND_DATA(pos, &splitpoints, &npoints);
+        if (npoints == nlz77points) break;
+      }
+      pos += length;
+    }
+  }
+  assert(npoints == nlz77points);
+
+  fprintf(stderr, "block split points: ");
+  for (i = 0; i < npoints; i++) {
+    fprintf(stderr, "%d ", (int)splitpoints[i]);
+  }
+  fprintf(stderr, "(hex:");
+  for (i = 0; i < npoints; i++) {
+    fprintf(stderr, " %x", (int)splitpoints[i]);
+  }
+  fprintf(stderr, ")\n");
+
+  free(splitpoints);
+}
+
+/*
+Finds next block to try to split, the largest of the available ones.
+The largest is chosen to make sure that if only a limited amount of blocks is
+requested, their sizes are spread evenly.
+llsize: the size of the LL77 data, which is the size of the done array here.
+done: array indicating which blocks starting at that position are no longer
+    splittable (splitting them increases rather than decreases cost).
+splitpoints: the splitpoints found so far.
+npoints: the amount of splitpoints found so far.
+lstart: output variable, giving start of block.
+lend: output variable, giving end of block.
+returns 1 if a block was found, 0 if no block found (all are done).
+*/
+static int FindLargestSplittableBlock(
+    size_t llsize, const unsigned char* done,
+    const size_t* splitpoints, size_t npoints,
+    size_t* lstart, size_t* lend) {
+  size_t longest = 0;
+  int found = 0;
+  size_t i;
+  for (i = 0; i <= npoints; i++) {
+    size_t start = i == 0 ? 0 : splitpoints[i - 1];
+    size_t end = i == npoints ? llsize - 1 : splitpoints[i];
+    if (!done[start] && end - start > longest) {
+      *lstart = start;
+      *lend = end;
+      found = 1;
+      longest = end - start;
+    }
+  }
+  return found;
+}
+
+void ZopfliBlockSplitLZ77(const ZopfliOptions* options,
+                          const unsigned short* litlens,
+                          const unsigned short* dists,
+                          size_t llsize, size_t maxblocks,
+                          size_t** splitpoints, size_t* npoints) {
+  size_t lstart, lend;
+  size_t i;
+  size_t llpos = 0;
+  size_t numblocks = 1;
+  unsigned char* done;
+  double splitcost, origcost;
+
+  if (llsize < 10) return;  /* This code fails on tiny files. */
+
+  done = (unsigned char*)malloc(llsize);
+  if (!done) exit(-1); /* Allocation failed. */
+  for (i = 0; i < llsize; i++) done[i] = 0;
+
+  lstart = 0;
+  lend = llsize;
+  for (;;) {
+    SplitCostContext c;
+
+    if (maxblocks > 0 && numblocks >= maxblocks) {
+      break;
+    }
+
+    c.litlens = litlens;
+    c.dists = dists;
+    c.llsize = llsize;
+    c.start = lstart;
+    c.end = lend;
+    assert(lstart < lend);
+    llpos = FindMinimum(SplitCost, &c, lstart + 1, lend);
+
+    assert(llpos > lstart);
+    assert(llpos < lend);
+
+    splitcost = EstimateCost(litlens, dists, lstart, llpos) +
+        EstimateCost(litlens, dists, llpos, lend);
+    origcost = EstimateCost(litlens, dists, lstart, lend);
+
+    if (splitcost > origcost || llpos == lstart + 1 || llpos == lend) {
+      done[lstart] = 1;
+    } else {
+      AddSorted(llpos, splitpoints, npoints);
+      numblocks++;
+    }
+
+    if (!FindLargestSplittableBlock(
+        llsize, done, *splitpoints, *npoints, &lstart, &lend)) {
+      break;  /* No further split will probably reduce compression. */
+    }
+
+    if (lend - lstart < 10) {
+      break;
+    }
+  }
+
+  if (options->verbose) {
+    PrintBlockSplitPoints(litlens, dists, llsize, *splitpoints, *npoints);
+  }
+
+  free(done);
+}
+
+void ZopfliBlockSplit(const ZopfliOptions* options,
+                      const unsigned char* in, size_t instart, size_t inend,
+                      size_t maxblocks, size_t** splitpoints, size_t* npoints) {
+  size_t pos = 0;
+  size_t i;
+  ZopfliBlockState s;
+  size_t* lz77splitpoints = 0;
+  size_t nlz77points = 0;
+  ZopfliLZ77Store store;
+
+  ZopfliInitLZ77Store(&store);
+
+  s.options = options;
+  s.blockstart = instart;
+  s.blockend = inend;
+#ifdef ZOPFLI_LONGEST_MATCH_CACHE
+  s.lmc = 0;
+#endif
+
+  *npoints = 0;
+  *splitpoints = 0;
+
+  /* Unintuitively, Using a simple LZ77 method here instead of ZopfliLZ77Optimal
+  results in better blocks. */
+  ZopfliLZ77Greedy(&s, in, instart, inend, &store);
+
+  ZopfliBlockSplitLZ77(options,
+                       store.litlens, store.dists, store.size, maxblocks,
+                       &lz77splitpoints, &nlz77points);
+
+  /* Convert LZ77 positions to positions in the uncompressed input. */
+  pos = instart;
+  if (nlz77points > 0) {
+    for (i = 0; i < store.size; i++) {
+      size_t length = store.dists[i] == 0 ? 1 : store.litlens[i];
+      if (lz77splitpoints[*npoints] == i) {
+        ZOPFLI_APPEND_DATA(pos, splitpoints, npoints);
+        if (*npoints == nlz77points) break;
+      }
+      pos += length;
+    }
+  }
+  assert(*npoints == nlz77points);
+
+  free(lz77splitpoints);
+  ZopfliCleanLZ77Store(&store);
+}
+
+void ZopfliBlockSplitSimple(const unsigned char* in,
+                            size_t instart, size_t inend,
+                            size_t blocksize,
+                            size_t** splitpoints, size_t* npoints) {
+  size_t i = instart;
+  while (i < inend) {
+    ZOPFLI_APPEND_DATA(i, splitpoints, npoints);
+    i += blocksize;
+  }
+  (void)in;
+}