search the index in the array, that has the largest value smaller than or equal to the given value, given array must be sorted (if no value is smaller

Kudos to Rich Taylor for figuring out SMaL's compression algorithm. */

create the png data from post-deflated data

decode one 64-entry block--

get some unsigned bits

set up the kernels

returns 1 if success, 0 if failure ==> nothing done*/

swap endianess

returns 1 if success, 0 if failure ==> nothing done*/

wpos = pos & (windowsize - 1)*/

returns true on success

write the lz77-encoded data, which has lit, len and dist codes, to compressed stream using huffman trees. tree_ll: the tree for lit and len codes. tre

in: Adam7 interlaced image, with no padding bits between scanlines, but between reduced images so that each reduced image starts at a byte. out: the

in: non-interlaced image with size w*h out: the same pixels, but re-ordered according to PNG's Adam7 interlacing, with no padding bits between scanli

Converts the NULL terminated 'hexstring' which contains 2-byte character representations of hex values to raw data. 'hexstring' may contain values con

the tree representation used by the decoder. return value is error*/

Boundary Package Merge step, numpresent is the amount of leaves, and c is the current chain.*/

sort the leaves with stable mergesort*/

Return values: 0 = white 1 = near white 2 = not white */

Return 0 if the image starts with compressed data, 1 if it starts with uncompressed low-order bits. In Canon compressed data, 0xff is always fo

CIFF block 0x1030 contains an 8x8 white sample. Load this into white[][] for use in scale_colors(). */

compute CRC32 (Slicing-by-16 algorithm, prefetch upcoming data blocks)

read a PNG, the result will be in the same color type as the PNG (hence "generic")*/

When decoding progressively, this is a separate thread (so a partially loaded animation keeps playing while decoding more detail)

Deflate for a block of type "dynamic", that is, with freely, optimally, created huffman trees*/