cannam@128: /* zran.c -- example of zlib/gzip stream indexing and random access cannam@128: * Copyright (C) 2005, 2012 Mark Adler cannam@128: * For conditions of distribution and use, see copyright notice in zlib.h cannam@128: Version 1.1 29 Sep 2012 Mark Adler */ cannam@128: cannam@128: /* Version History: cannam@128: 1.0 29 May 2005 First version cannam@128: 1.1 29 Sep 2012 Fix memory reallocation error cannam@128: */ cannam@128: cannam@128: /* Illustrate the use of Z_BLOCK, inflatePrime(), and inflateSetDictionary() cannam@128: for random access of a compressed file. A file containing a zlib or gzip cannam@128: stream is provided on the command line. The compressed stream is decoded in cannam@128: its entirety, and an index built with access points about every SPAN bytes cannam@128: in the uncompressed output. The compressed file is left open, and can then cannam@128: be read randomly, having to decompress on the average SPAN/2 uncompressed cannam@128: bytes before getting to the desired block of data. cannam@128: cannam@128: An access point can be created at the start of any deflate block, by saving cannam@128: the starting file offset and bit of that block, and the 32K bytes of cannam@128: uncompressed data that precede that block. Also the uncompressed offset of cannam@128: that block is saved to provide a referece for locating a desired starting cannam@128: point in the uncompressed stream. build_index() works by decompressing the cannam@128: input zlib or gzip stream a block at a time, and at the end of each block cannam@128: deciding if enough uncompressed data has gone by to justify the creation of cannam@128: a new access point. If so, that point is saved in a data structure that cannam@128: grows as needed to accommodate the points. cannam@128: cannam@128: To use the index, an offset in the uncompressed data is provided, for which cannam@128: the latest accees point at or preceding that offset is located in the index. cannam@128: The input file is positioned to the specified location in the index, and if cannam@128: necessary the first few bits of the compressed data is read from the file. cannam@128: inflate is initialized with those bits and the 32K of uncompressed data, and cannam@128: the decompression then proceeds until the desired offset in the file is cannam@128: reached. Then the decompression continues to read the desired uncompressed cannam@128: data from the file. cannam@128: cannam@128: Another approach would be to generate the index on demand. In that case, cannam@128: requests for random access reads from the compressed data would try to use cannam@128: the index, but if a read far enough past the end of the index is required, cannam@128: then further index entries would be generated and added. cannam@128: cannam@128: There is some fair bit of overhead to starting inflation for the random cannam@128: access, mainly copying the 32K byte dictionary. So if small pieces of the cannam@128: file are being accessed, it would make sense to implement a cache to hold cannam@128: some lookahead and avoid many calls to extract() for small lengths. cannam@128: cannam@128: Another way to build an index would be to use inflateCopy(). That would cannam@128: not be constrained to have access points at block boundaries, but requires cannam@128: more memory per access point, and also cannot be saved to file due to the cannam@128: use of pointers in the state. The approach here allows for storage of the cannam@128: index in a file. cannam@128: */ cannam@128: cannam@128: #include cannam@128: #include cannam@128: #include cannam@128: #include "zlib.h" cannam@128: cannam@128: #define local static cannam@128: cannam@128: #define SPAN 1048576L /* desired distance between access points */ cannam@128: #define WINSIZE 32768U /* sliding window size */ cannam@128: #define CHUNK 16384 /* file input buffer size */ cannam@128: cannam@128: /* access point entry */ cannam@128: struct point { cannam@128: off_t out; /* corresponding offset in uncompressed data */ cannam@128: off_t in; /* offset in input file of first full byte */ cannam@128: int bits; /* number of bits (1-7) from byte at in - 1, or 0 */ cannam@128: unsigned char window[WINSIZE]; /* preceding 32K of uncompressed data */ cannam@128: }; cannam@128: cannam@128: /* access point list */ cannam@128: struct access { cannam@128: int have; /* number of list entries filled in */ cannam@128: int size; /* number of list entries allocated */ cannam@128: struct point *list; /* allocated list */ cannam@128: }; cannam@128: cannam@128: /* Deallocate an index built by build_index() */ cannam@128: local void free_index(struct access *index) cannam@128: { cannam@128: if (index != NULL) { cannam@128: free(index->list); cannam@128: free(index); cannam@128: } cannam@128: } cannam@128: cannam@128: /* Add an entry to the access point list. If out of memory, deallocate the cannam@128: existing list and return NULL. */ cannam@128: local struct access *addpoint(struct access *index, int bits, cannam@128: off_t in, off_t out, unsigned left, unsigned char *window) cannam@128: { cannam@128: struct point *next; cannam@128: cannam@128: /* if list is empty, create it (start with eight points) */ cannam@128: if (index == NULL) { cannam@128: index = malloc(sizeof(struct access)); cannam@128: if (index == NULL) return NULL; cannam@128: index->list = malloc(sizeof(struct point) << 3); cannam@128: if (index->list == NULL) { cannam@128: free(index); cannam@128: return NULL; cannam@128: } cannam@128: index->size = 8; cannam@128: index->have = 0; cannam@128: } cannam@128: cannam@128: /* if list is full, make it bigger */ cannam@128: else if (index->have == index->size) { cannam@128: index->size <<= 1; cannam@128: next = realloc(index->list, sizeof(struct point) * index->size); cannam@128: if (next == NULL) { cannam@128: free_index(index); cannam@128: return NULL; cannam@128: } cannam@128: index->list = next; cannam@128: } cannam@128: cannam@128: /* fill in entry and increment how many we have */ cannam@128: next = index->list + index->have; cannam@128: next->bits = bits; cannam@128: next->in = in; cannam@128: next->out = out; cannam@128: if (left) cannam@128: memcpy(next->window, window + WINSIZE - left, left); cannam@128: if (left < WINSIZE) cannam@128: memcpy(next->window + left, window, WINSIZE - left); cannam@128: index->have++; cannam@128: cannam@128: /* return list, possibly reallocated */ cannam@128: return index; cannam@128: } cannam@128: cannam@128: /* Make one entire pass through the compressed stream and build an index, with cannam@128: access points about every span bytes of uncompressed output -- span is cannam@128: chosen to balance the speed of random access against the memory requirements cannam@128: of the list, about 32K bytes per access point. Note that data after the end cannam@128: of the first zlib or gzip stream in the file is ignored. build_index() cannam@128: returns the number of access points on success (>= 1), Z_MEM_ERROR for out cannam@128: of memory, Z_DATA_ERROR for an error in the input file, or Z_ERRNO for a cannam@128: file read error. On success, *built points to the resulting index. */ cannam@128: local int build_index(FILE *in, off_t span, struct access **built) cannam@128: { cannam@128: int ret; cannam@128: off_t totin, totout; /* our own total counters to avoid 4GB limit */ cannam@128: off_t last; /* totout value of last access point */ cannam@128: struct access *index; /* access points being generated */ cannam@128: z_stream strm; cannam@128: unsigned char input[CHUNK]; cannam@128: unsigned char window[WINSIZE]; cannam@128: cannam@128: /* initialize inflate */ cannam@128: strm.zalloc = Z_NULL; cannam@128: strm.zfree = Z_NULL; cannam@128: strm.opaque = Z_NULL; cannam@128: strm.avail_in = 0; cannam@128: strm.next_in = Z_NULL; cannam@128: ret = inflateInit2(&strm, 47); /* automatic zlib or gzip decoding */ cannam@128: if (ret != Z_OK) cannam@128: return ret; cannam@128: cannam@128: /* inflate the input, maintain a sliding window, and build an index -- this cannam@128: also validates the integrity of the compressed data using the check cannam@128: information at the end of the gzip or zlib stream */ cannam@128: totin = totout = last = 0; cannam@128: index = NULL; /* will be allocated by first addpoint() */ cannam@128: strm.avail_out = 0; cannam@128: do { cannam@128: /* get some compressed data from input file */ cannam@128: strm.avail_in = fread(input, 1, CHUNK, in); cannam@128: if (ferror(in)) { cannam@128: ret = Z_ERRNO; cannam@128: goto build_index_error; cannam@128: } cannam@128: if (strm.avail_in == 0) { cannam@128: ret = Z_DATA_ERROR; cannam@128: goto build_index_error; cannam@128: } cannam@128: strm.next_in = input; cannam@128: cannam@128: /* process all of that, or until end of stream */ cannam@128: do { cannam@128: /* reset sliding window if necessary */ cannam@128: if (strm.avail_out == 0) { cannam@128: strm.avail_out = WINSIZE; cannam@128: strm.next_out = window; cannam@128: } cannam@128: cannam@128: /* inflate until out of input, output, or at end of block -- cannam@128: update the total input and output counters */ cannam@128: totin += strm.avail_in; cannam@128: totout += strm.avail_out; cannam@128: ret = inflate(&strm, Z_BLOCK); /* return at end of block */ cannam@128: totin -= strm.avail_in; cannam@128: totout -= strm.avail_out; cannam@128: if (ret == Z_NEED_DICT) cannam@128: ret = Z_DATA_ERROR; cannam@128: if (ret == Z_MEM_ERROR || ret == Z_DATA_ERROR) cannam@128: goto build_index_error; cannam@128: if (ret == Z_STREAM_END) cannam@128: break; cannam@128: cannam@128: /* if at end of block, consider adding an index entry (note that if cannam@128: data_type indicates an end-of-block, then all of the cannam@128: uncompressed data from that block has been delivered, and none cannam@128: of the compressed data after that block has been consumed, cannam@128: except for up to seven bits) -- the totout == 0 provides an cannam@128: entry point after the zlib or gzip header, and assures that the cannam@128: index always has at least one access point; we avoid creating an cannam@128: access point after the last block by checking bit 6 of data_type cannam@128: */ cannam@128: if ((strm.data_type & 128) && !(strm.data_type & 64) && cannam@128: (totout == 0 || totout - last > span)) { cannam@128: index = addpoint(index, strm.data_type & 7, totin, cannam@128: totout, strm.avail_out, window); cannam@128: if (index == NULL) { cannam@128: ret = Z_MEM_ERROR; cannam@128: goto build_index_error; cannam@128: } cannam@128: last = totout; cannam@128: } cannam@128: } while (strm.avail_in != 0); cannam@128: } while (ret != Z_STREAM_END); cannam@128: cannam@128: /* clean up and return index (release unused entries in list) */ cannam@128: (void)inflateEnd(&strm); cannam@128: index->list = realloc(index->list, sizeof(struct point) * index->have); cannam@128: index->size = index->have; cannam@128: *built = index; cannam@128: return index->size; cannam@128: cannam@128: /* return error */ cannam@128: build_index_error: cannam@128: (void)inflateEnd(&strm); cannam@128: if (index != NULL) cannam@128: free_index(index); cannam@128: return ret; cannam@128: } cannam@128: cannam@128: /* Use the index to read len bytes from offset into buf, return bytes read or cannam@128: negative for error (Z_DATA_ERROR or Z_MEM_ERROR). If data is requested past cannam@128: the end of the uncompressed data, then extract() will return a value less cannam@128: than len, indicating how much as actually read into buf. This function cannam@128: should not return a data error unless the file was modified since the index cannam@128: was generated. extract() may also return Z_ERRNO if there is an error on cannam@128: reading or seeking the input file. */ cannam@128: local int extract(FILE *in, struct access *index, off_t offset, cannam@128: unsigned char *buf, int len) cannam@128: { cannam@128: int ret, skip; cannam@128: z_stream strm; cannam@128: struct point *here; cannam@128: unsigned char input[CHUNK]; cannam@128: unsigned char discard[WINSIZE]; cannam@128: cannam@128: /* proceed only if something reasonable to do */ cannam@128: if (len < 0) cannam@128: return 0; cannam@128: cannam@128: /* find where in stream to start */ cannam@128: here = index->list; cannam@128: ret = index->have; cannam@128: while (--ret && here[1].out <= offset) cannam@128: here++; cannam@128: cannam@128: /* initialize file and inflate state to start there */ cannam@128: strm.zalloc = Z_NULL; cannam@128: strm.zfree = Z_NULL; cannam@128: strm.opaque = Z_NULL; cannam@128: strm.avail_in = 0; cannam@128: strm.next_in = Z_NULL; cannam@128: ret = inflateInit2(&strm, -15); /* raw inflate */ cannam@128: if (ret != Z_OK) cannam@128: return ret; cannam@128: ret = fseeko(in, here->in - (here->bits ? 1 : 0), SEEK_SET); cannam@128: if (ret == -1) cannam@128: goto extract_ret; cannam@128: if (here->bits) { cannam@128: ret = getc(in); cannam@128: if (ret == -1) { cannam@128: ret = ferror(in) ? Z_ERRNO : Z_DATA_ERROR; cannam@128: goto extract_ret; cannam@128: } cannam@128: (void)inflatePrime(&strm, here->bits, ret >> (8 - here->bits)); cannam@128: } cannam@128: (void)inflateSetDictionary(&strm, here->window, WINSIZE); cannam@128: cannam@128: /* skip uncompressed bytes until offset reached, then satisfy request */ cannam@128: offset -= here->out; cannam@128: strm.avail_in = 0; cannam@128: skip = 1; /* while skipping to offset */ cannam@128: do { cannam@128: /* define where to put uncompressed data, and how much */ cannam@128: if (offset == 0 && skip) { /* at offset now */ cannam@128: strm.avail_out = len; cannam@128: strm.next_out = buf; cannam@128: skip = 0; /* only do this once */ cannam@128: } cannam@128: if (offset > WINSIZE) { /* skip WINSIZE bytes */ cannam@128: strm.avail_out = WINSIZE; cannam@128: strm.next_out = discard; cannam@128: offset -= WINSIZE; cannam@128: } cannam@128: else if (offset != 0) { /* last skip */ cannam@128: strm.avail_out = (unsigned)offset; cannam@128: strm.next_out = discard; cannam@128: offset = 0; cannam@128: } cannam@128: cannam@128: /* uncompress until avail_out filled, or end of stream */ cannam@128: do { cannam@128: if (strm.avail_in == 0) { cannam@128: strm.avail_in = fread(input, 1, CHUNK, in); cannam@128: if (ferror(in)) { cannam@128: ret = Z_ERRNO; cannam@128: goto extract_ret; cannam@128: } cannam@128: if (strm.avail_in == 0) { cannam@128: ret = Z_DATA_ERROR; cannam@128: goto extract_ret; cannam@128: } cannam@128: strm.next_in = input; cannam@128: } cannam@128: ret = inflate(&strm, Z_NO_FLUSH); /* normal inflate */ cannam@128: if (ret == Z_NEED_DICT) cannam@128: ret = Z_DATA_ERROR; cannam@128: if (ret == Z_MEM_ERROR || ret == Z_DATA_ERROR) cannam@128: goto extract_ret; cannam@128: if (ret == Z_STREAM_END) cannam@128: break; cannam@128: } while (strm.avail_out != 0); cannam@128: cannam@128: /* if reach end of stream, then don't keep trying to get more */ cannam@128: if (ret == Z_STREAM_END) cannam@128: break; cannam@128: cannam@128: /* do until offset reached and requested data read, or stream ends */ cannam@128: } while (skip); cannam@128: cannam@128: /* compute number of uncompressed bytes read after offset */ cannam@128: ret = skip ? 0 : len - strm.avail_out; cannam@128: cannam@128: /* clean up and return bytes read or error */ cannam@128: extract_ret: cannam@128: (void)inflateEnd(&strm); cannam@128: return ret; cannam@128: } cannam@128: cannam@128: /* Demonstrate the use of build_index() and extract() by processing the file cannam@128: provided on the command line, and the extracting 16K from about 2/3rds of cannam@128: the way through the uncompressed output, and writing that to stdout. */ cannam@128: int main(int argc, char **argv) cannam@128: { cannam@128: int len; cannam@128: off_t offset; cannam@128: FILE *in; cannam@128: struct access *index = NULL; cannam@128: unsigned char buf[CHUNK]; cannam@128: cannam@128: /* open input file */ cannam@128: if (argc != 2) { cannam@128: fprintf(stderr, "usage: zran file.gz\n"); cannam@128: return 1; cannam@128: } cannam@128: in = fopen(argv[1], "rb"); cannam@128: if (in == NULL) { cannam@128: fprintf(stderr, "zran: could not open %s for reading\n", argv[1]); cannam@128: return 1; cannam@128: } cannam@128: cannam@128: /* build index */ cannam@128: len = build_index(in, SPAN, &index); cannam@128: if (len < 0) { cannam@128: fclose(in); cannam@128: switch (len) { cannam@128: case Z_MEM_ERROR: cannam@128: fprintf(stderr, "zran: out of memory\n"); cannam@128: break; cannam@128: case Z_DATA_ERROR: cannam@128: fprintf(stderr, "zran: compressed data error in %s\n", argv[1]); cannam@128: break; cannam@128: case Z_ERRNO: cannam@128: fprintf(stderr, "zran: read error on %s\n", argv[1]); cannam@128: break; cannam@128: default: cannam@128: fprintf(stderr, "zran: error %d while building index\n", len); cannam@128: } cannam@128: return 1; cannam@128: } cannam@128: fprintf(stderr, "zran: built index with %d access points\n", len); cannam@128: cannam@128: /* use index by reading some bytes from an arbitrary offset */ cannam@128: offset = (index->list[index->have - 1].out << 1) / 3; cannam@128: len = extract(in, index, offset, buf, CHUNK); cannam@128: if (len < 0) cannam@128: fprintf(stderr, "zran: extraction failed: %s error\n", cannam@128: len == Z_MEM_ERROR ? "out of memory" : "input corrupted"); cannam@128: else { cannam@128: fwrite(buf, 1, len, stdout); cannam@128: fprintf(stderr, "zran: extracted %d bytes at %llu\n", len, offset); cannam@128: } cannam@128: cannam@128: /* clean up and exit */ cannam@128: free_index(index); cannam@128: fclose(in); cannam@128: return 0; cannam@128: }