annotate src/zlib-1.2.8/examples/zran.c @ 56:af97cad61ff0

Add updated build of PortAudio for OSX
author Chris Cannam <cannam@all-day-breakfast.com>
date Tue, 03 Jan 2017 15:10:52 +0000
parents 5ea0608b923f
children
rev   line source
Chris@43 1 /* zran.c -- example of zlib/gzip stream indexing and random access
Chris@43 2 * Copyright (C) 2005, 2012 Mark Adler
Chris@43 3 * For conditions of distribution and use, see copyright notice in zlib.h
Chris@43 4 Version 1.1 29 Sep 2012 Mark Adler */
Chris@43 5
Chris@43 6 /* Version History:
Chris@43 7 1.0 29 May 2005 First version
Chris@43 8 1.1 29 Sep 2012 Fix memory reallocation error
Chris@43 9 */
Chris@43 10
Chris@43 11 /* Illustrate the use of Z_BLOCK, inflatePrime(), and inflateSetDictionary()
Chris@43 12 for random access of a compressed file. A file containing a zlib or gzip
Chris@43 13 stream is provided on the command line. The compressed stream is decoded in
Chris@43 14 its entirety, and an index built with access points about every SPAN bytes
Chris@43 15 in the uncompressed output. The compressed file is left open, and can then
Chris@43 16 be read randomly, having to decompress on the average SPAN/2 uncompressed
Chris@43 17 bytes before getting to the desired block of data.
Chris@43 18
Chris@43 19 An access point can be created at the start of any deflate block, by saving
Chris@43 20 the starting file offset and bit of that block, and the 32K bytes of
Chris@43 21 uncompressed data that precede that block. Also the uncompressed offset of
Chris@43 22 that block is saved to provide a referece for locating a desired starting
Chris@43 23 point in the uncompressed stream. build_index() works by decompressing the
Chris@43 24 input zlib or gzip stream a block at a time, and at the end of each block
Chris@43 25 deciding if enough uncompressed data has gone by to justify the creation of
Chris@43 26 a new access point. If so, that point is saved in a data structure that
Chris@43 27 grows as needed to accommodate the points.
Chris@43 28
Chris@43 29 To use the index, an offset in the uncompressed data is provided, for which
Chris@43 30 the latest accees point at or preceding that offset is located in the index.
Chris@43 31 The input file is positioned to the specified location in the index, and if
Chris@43 32 necessary the first few bits of the compressed data is read from the file.
Chris@43 33 inflate is initialized with those bits and the 32K of uncompressed data, and
Chris@43 34 the decompression then proceeds until the desired offset in the file is
Chris@43 35 reached. Then the decompression continues to read the desired uncompressed
Chris@43 36 data from the file.
Chris@43 37
Chris@43 38 Another approach would be to generate the index on demand. In that case,
Chris@43 39 requests for random access reads from the compressed data would try to use
Chris@43 40 the index, but if a read far enough past the end of the index is required,
Chris@43 41 then further index entries would be generated and added.
Chris@43 42
Chris@43 43 There is some fair bit of overhead to starting inflation for the random
Chris@43 44 access, mainly copying the 32K byte dictionary. So if small pieces of the
Chris@43 45 file are being accessed, it would make sense to implement a cache to hold
Chris@43 46 some lookahead and avoid many calls to extract() for small lengths.
Chris@43 47
Chris@43 48 Another way to build an index would be to use inflateCopy(). That would
Chris@43 49 not be constrained to have access points at block boundaries, but requires
Chris@43 50 more memory per access point, and also cannot be saved to file due to the
Chris@43 51 use of pointers in the state. The approach here allows for storage of the
Chris@43 52 index in a file.
Chris@43 53 */
Chris@43 54
Chris@43 55 #include <stdio.h>
Chris@43 56 #include <stdlib.h>
Chris@43 57 #include <string.h>
Chris@43 58 #include "zlib.h"
Chris@43 59
Chris@43 60 #define local static
Chris@43 61
Chris@43 62 #define SPAN 1048576L /* desired distance between access points */
Chris@43 63 #define WINSIZE 32768U /* sliding window size */
Chris@43 64 #define CHUNK 16384 /* file input buffer size */
Chris@43 65
Chris@43 66 /* access point entry */
Chris@43 67 struct point {
Chris@43 68 off_t out; /* corresponding offset in uncompressed data */
Chris@43 69 off_t in; /* offset in input file of first full byte */
Chris@43 70 int bits; /* number of bits (1-7) from byte at in - 1, or 0 */
Chris@43 71 unsigned char window[WINSIZE]; /* preceding 32K of uncompressed data */
Chris@43 72 };
Chris@43 73
Chris@43 74 /* access point list */
Chris@43 75 struct access {
Chris@43 76 int have; /* number of list entries filled in */
Chris@43 77 int size; /* number of list entries allocated */
Chris@43 78 struct point *list; /* allocated list */
Chris@43 79 };
Chris@43 80
Chris@43 81 /* Deallocate an index built by build_index() */
Chris@43 82 local void free_index(struct access *index)
Chris@43 83 {
Chris@43 84 if (index != NULL) {
Chris@43 85 free(index->list);
Chris@43 86 free(index);
Chris@43 87 }
Chris@43 88 }
Chris@43 89
Chris@43 90 /* Add an entry to the access point list. If out of memory, deallocate the
Chris@43 91 existing list and return NULL. */
Chris@43 92 local struct access *addpoint(struct access *index, int bits,
Chris@43 93 off_t in, off_t out, unsigned left, unsigned char *window)
Chris@43 94 {
Chris@43 95 struct point *next;
Chris@43 96
Chris@43 97 /* if list is empty, create it (start with eight points) */
Chris@43 98 if (index == NULL) {
Chris@43 99 index = malloc(sizeof(struct access));
Chris@43 100 if (index == NULL) return NULL;
Chris@43 101 index->list = malloc(sizeof(struct point) << 3);
Chris@43 102 if (index->list == NULL) {
Chris@43 103 free(index);
Chris@43 104 return NULL;
Chris@43 105 }
Chris@43 106 index->size = 8;
Chris@43 107 index->have = 0;
Chris@43 108 }
Chris@43 109
Chris@43 110 /* if list is full, make it bigger */
Chris@43 111 else if (index->have == index->size) {
Chris@43 112 index->size <<= 1;
Chris@43 113 next = realloc(index->list, sizeof(struct point) * index->size);
Chris@43 114 if (next == NULL) {
Chris@43 115 free_index(index);
Chris@43 116 return NULL;
Chris@43 117 }
Chris@43 118 index->list = next;
Chris@43 119 }
Chris@43 120
Chris@43 121 /* fill in entry and increment how many we have */
Chris@43 122 next = index->list + index->have;
Chris@43 123 next->bits = bits;
Chris@43 124 next->in = in;
Chris@43 125 next->out = out;
Chris@43 126 if (left)
Chris@43 127 memcpy(next->window, window + WINSIZE - left, left);
Chris@43 128 if (left < WINSIZE)
Chris@43 129 memcpy(next->window + left, window, WINSIZE - left);
Chris@43 130 index->have++;
Chris@43 131
Chris@43 132 /* return list, possibly reallocated */
Chris@43 133 return index;
Chris@43 134 }
Chris@43 135
Chris@43 136 /* Make one entire pass through the compressed stream and build an index, with
Chris@43 137 access points about every span bytes of uncompressed output -- span is
Chris@43 138 chosen to balance the speed of random access against the memory requirements
Chris@43 139 of the list, about 32K bytes per access point. Note that data after the end
Chris@43 140 of the first zlib or gzip stream in the file is ignored. build_index()
Chris@43 141 returns the number of access points on success (>= 1), Z_MEM_ERROR for out
Chris@43 142 of memory, Z_DATA_ERROR for an error in the input file, or Z_ERRNO for a
Chris@43 143 file read error. On success, *built points to the resulting index. */
Chris@43 144 local int build_index(FILE *in, off_t span, struct access **built)
Chris@43 145 {
Chris@43 146 int ret;
Chris@43 147 off_t totin, totout; /* our own total counters to avoid 4GB limit */
Chris@43 148 off_t last; /* totout value of last access point */
Chris@43 149 struct access *index; /* access points being generated */
Chris@43 150 z_stream strm;
Chris@43 151 unsigned char input[CHUNK];
Chris@43 152 unsigned char window[WINSIZE];
Chris@43 153
Chris@43 154 /* initialize inflate */
Chris@43 155 strm.zalloc = Z_NULL;
Chris@43 156 strm.zfree = Z_NULL;
Chris@43 157 strm.opaque = Z_NULL;
Chris@43 158 strm.avail_in = 0;
Chris@43 159 strm.next_in = Z_NULL;
Chris@43 160 ret = inflateInit2(&strm, 47); /* automatic zlib or gzip decoding */
Chris@43 161 if (ret != Z_OK)
Chris@43 162 return ret;
Chris@43 163
Chris@43 164 /* inflate the input, maintain a sliding window, and build an index -- this
Chris@43 165 also validates the integrity of the compressed data using the check
Chris@43 166 information at the end of the gzip or zlib stream */
Chris@43 167 totin = totout = last = 0;
Chris@43 168 index = NULL; /* will be allocated by first addpoint() */
Chris@43 169 strm.avail_out = 0;
Chris@43 170 do {
Chris@43 171 /* get some compressed data from input file */
Chris@43 172 strm.avail_in = fread(input, 1, CHUNK, in);
Chris@43 173 if (ferror(in)) {
Chris@43 174 ret = Z_ERRNO;
Chris@43 175 goto build_index_error;
Chris@43 176 }
Chris@43 177 if (strm.avail_in == 0) {
Chris@43 178 ret = Z_DATA_ERROR;
Chris@43 179 goto build_index_error;
Chris@43 180 }
Chris@43 181 strm.next_in = input;
Chris@43 182
Chris@43 183 /* process all of that, or until end of stream */
Chris@43 184 do {
Chris@43 185 /* reset sliding window if necessary */
Chris@43 186 if (strm.avail_out == 0) {
Chris@43 187 strm.avail_out = WINSIZE;
Chris@43 188 strm.next_out = window;
Chris@43 189 }
Chris@43 190
Chris@43 191 /* inflate until out of input, output, or at end of block --
Chris@43 192 update the total input and output counters */
Chris@43 193 totin += strm.avail_in;
Chris@43 194 totout += strm.avail_out;
Chris@43 195 ret = inflate(&strm, Z_BLOCK); /* return at end of block */
Chris@43 196 totin -= strm.avail_in;
Chris@43 197 totout -= strm.avail_out;
Chris@43 198 if (ret == Z_NEED_DICT)
Chris@43 199 ret = Z_DATA_ERROR;
Chris@43 200 if (ret == Z_MEM_ERROR || ret == Z_DATA_ERROR)
Chris@43 201 goto build_index_error;
Chris@43 202 if (ret == Z_STREAM_END)
Chris@43 203 break;
Chris@43 204
Chris@43 205 /* if at end of block, consider adding an index entry (note that if
Chris@43 206 data_type indicates an end-of-block, then all of the
Chris@43 207 uncompressed data from that block has been delivered, and none
Chris@43 208 of the compressed data after that block has been consumed,
Chris@43 209 except for up to seven bits) -- the totout == 0 provides an
Chris@43 210 entry point after the zlib or gzip header, and assures that the
Chris@43 211 index always has at least one access point; we avoid creating an
Chris@43 212 access point after the last block by checking bit 6 of data_type
Chris@43 213 */
Chris@43 214 if ((strm.data_type & 128) && !(strm.data_type & 64) &&
Chris@43 215 (totout == 0 || totout - last > span)) {
Chris@43 216 index = addpoint(index, strm.data_type & 7, totin,
Chris@43 217 totout, strm.avail_out, window);
Chris@43 218 if (index == NULL) {
Chris@43 219 ret = Z_MEM_ERROR;
Chris@43 220 goto build_index_error;
Chris@43 221 }
Chris@43 222 last = totout;
Chris@43 223 }
Chris@43 224 } while (strm.avail_in != 0);
Chris@43 225 } while (ret != Z_STREAM_END);
Chris@43 226
Chris@43 227 /* clean up and return index (release unused entries in list) */
Chris@43 228 (void)inflateEnd(&strm);
Chris@43 229 index->list = realloc(index->list, sizeof(struct point) * index->have);
Chris@43 230 index->size = index->have;
Chris@43 231 *built = index;
Chris@43 232 return index->size;
Chris@43 233
Chris@43 234 /* return error */
Chris@43 235 build_index_error:
Chris@43 236 (void)inflateEnd(&strm);
Chris@43 237 if (index != NULL)
Chris@43 238 free_index(index);
Chris@43 239 return ret;
Chris@43 240 }
Chris@43 241
Chris@43 242 /* Use the index to read len bytes from offset into buf, return bytes read or
Chris@43 243 negative for error (Z_DATA_ERROR or Z_MEM_ERROR). If data is requested past
Chris@43 244 the end of the uncompressed data, then extract() will return a value less
Chris@43 245 than len, indicating how much as actually read into buf. This function
Chris@43 246 should not return a data error unless the file was modified since the index
Chris@43 247 was generated. extract() may also return Z_ERRNO if there is an error on
Chris@43 248 reading or seeking the input file. */
Chris@43 249 local int extract(FILE *in, struct access *index, off_t offset,
Chris@43 250 unsigned char *buf, int len)
Chris@43 251 {
Chris@43 252 int ret, skip;
Chris@43 253 z_stream strm;
Chris@43 254 struct point *here;
Chris@43 255 unsigned char input[CHUNK];
Chris@43 256 unsigned char discard[WINSIZE];
Chris@43 257
Chris@43 258 /* proceed only if something reasonable to do */
Chris@43 259 if (len < 0)
Chris@43 260 return 0;
Chris@43 261
Chris@43 262 /* find where in stream to start */
Chris@43 263 here = index->list;
Chris@43 264 ret = index->have;
Chris@43 265 while (--ret && here[1].out <= offset)
Chris@43 266 here++;
Chris@43 267
Chris@43 268 /* initialize file and inflate state to start there */
Chris@43 269 strm.zalloc = Z_NULL;
Chris@43 270 strm.zfree = Z_NULL;
Chris@43 271 strm.opaque = Z_NULL;
Chris@43 272 strm.avail_in = 0;
Chris@43 273 strm.next_in = Z_NULL;
Chris@43 274 ret = inflateInit2(&strm, -15); /* raw inflate */
Chris@43 275 if (ret != Z_OK)
Chris@43 276 return ret;
Chris@43 277 ret = fseeko(in, here->in - (here->bits ? 1 : 0), SEEK_SET);
Chris@43 278 if (ret == -1)
Chris@43 279 goto extract_ret;
Chris@43 280 if (here->bits) {
Chris@43 281 ret = getc(in);
Chris@43 282 if (ret == -1) {
Chris@43 283 ret = ferror(in) ? Z_ERRNO : Z_DATA_ERROR;
Chris@43 284 goto extract_ret;
Chris@43 285 }
Chris@43 286 (void)inflatePrime(&strm, here->bits, ret >> (8 - here->bits));
Chris@43 287 }
Chris@43 288 (void)inflateSetDictionary(&strm, here->window, WINSIZE);
Chris@43 289
Chris@43 290 /* skip uncompressed bytes until offset reached, then satisfy request */
Chris@43 291 offset -= here->out;
Chris@43 292 strm.avail_in = 0;
Chris@43 293 skip = 1; /* while skipping to offset */
Chris@43 294 do {
Chris@43 295 /* define where to put uncompressed data, and how much */
Chris@43 296 if (offset == 0 && skip) { /* at offset now */
Chris@43 297 strm.avail_out = len;
Chris@43 298 strm.next_out = buf;
Chris@43 299 skip = 0; /* only do this once */
Chris@43 300 }
Chris@43 301 if (offset > WINSIZE) { /* skip WINSIZE bytes */
Chris@43 302 strm.avail_out = WINSIZE;
Chris@43 303 strm.next_out = discard;
Chris@43 304 offset -= WINSIZE;
Chris@43 305 }
Chris@43 306 else if (offset != 0) { /* last skip */
Chris@43 307 strm.avail_out = (unsigned)offset;
Chris@43 308 strm.next_out = discard;
Chris@43 309 offset = 0;
Chris@43 310 }
Chris@43 311
Chris@43 312 /* uncompress until avail_out filled, or end of stream */
Chris@43 313 do {
Chris@43 314 if (strm.avail_in == 0) {
Chris@43 315 strm.avail_in = fread(input, 1, CHUNK, in);
Chris@43 316 if (ferror(in)) {
Chris@43 317 ret = Z_ERRNO;
Chris@43 318 goto extract_ret;
Chris@43 319 }
Chris@43 320 if (strm.avail_in == 0) {
Chris@43 321 ret = Z_DATA_ERROR;
Chris@43 322 goto extract_ret;
Chris@43 323 }
Chris@43 324 strm.next_in = input;
Chris@43 325 }
Chris@43 326 ret = inflate(&strm, Z_NO_FLUSH); /* normal inflate */
Chris@43 327 if (ret == Z_NEED_DICT)
Chris@43 328 ret = Z_DATA_ERROR;
Chris@43 329 if (ret == Z_MEM_ERROR || ret == Z_DATA_ERROR)
Chris@43 330 goto extract_ret;
Chris@43 331 if (ret == Z_STREAM_END)
Chris@43 332 break;
Chris@43 333 } while (strm.avail_out != 0);
Chris@43 334
Chris@43 335 /* if reach end of stream, then don't keep trying to get more */
Chris@43 336 if (ret == Z_STREAM_END)
Chris@43 337 break;
Chris@43 338
Chris@43 339 /* do until offset reached and requested data read, or stream ends */
Chris@43 340 } while (skip);
Chris@43 341
Chris@43 342 /* compute number of uncompressed bytes read after offset */
Chris@43 343 ret = skip ? 0 : len - strm.avail_out;
Chris@43 344
Chris@43 345 /* clean up and return bytes read or error */
Chris@43 346 extract_ret:
Chris@43 347 (void)inflateEnd(&strm);
Chris@43 348 return ret;
Chris@43 349 }
Chris@43 350
Chris@43 351 /* Demonstrate the use of build_index() and extract() by processing the file
Chris@43 352 provided on the command line, and the extracting 16K from about 2/3rds of
Chris@43 353 the way through the uncompressed output, and writing that to stdout. */
Chris@43 354 int main(int argc, char **argv)
Chris@43 355 {
Chris@43 356 int len;
Chris@43 357 off_t offset;
Chris@43 358 FILE *in;
Chris@43 359 struct access *index = NULL;
Chris@43 360 unsigned char buf[CHUNK];
Chris@43 361
Chris@43 362 /* open input file */
Chris@43 363 if (argc != 2) {
Chris@43 364 fprintf(stderr, "usage: zran file.gz\n");
Chris@43 365 return 1;
Chris@43 366 }
Chris@43 367 in = fopen(argv[1], "rb");
Chris@43 368 if (in == NULL) {
Chris@43 369 fprintf(stderr, "zran: could not open %s for reading\n", argv[1]);
Chris@43 370 return 1;
Chris@43 371 }
Chris@43 372
Chris@43 373 /* build index */
Chris@43 374 len = build_index(in, SPAN, &index);
Chris@43 375 if (len < 0) {
Chris@43 376 fclose(in);
Chris@43 377 switch (len) {
Chris@43 378 case Z_MEM_ERROR:
Chris@43 379 fprintf(stderr, "zran: out of memory\n");
Chris@43 380 break;
Chris@43 381 case Z_DATA_ERROR:
Chris@43 382 fprintf(stderr, "zran: compressed data error in %s\n", argv[1]);
Chris@43 383 break;
Chris@43 384 case Z_ERRNO:
Chris@43 385 fprintf(stderr, "zran: read error on %s\n", argv[1]);
Chris@43 386 break;
Chris@43 387 default:
Chris@43 388 fprintf(stderr, "zran: error %d while building index\n", len);
Chris@43 389 }
Chris@43 390 return 1;
Chris@43 391 }
Chris@43 392 fprintf(stderr, "zran: built index with %d access points\n", len);
Chris@43 393
Chris@43 394 /* use index by reading some bytes from an arbitrary offset */
Chris@43 395 offset = (index->list[index->have - 1].out << 1) / 3;
Chris@43 396 len = extract(in, index, offset, buf, CHUNK);
Chris@43 397 if (len < 0)
Chris@43 398 fprintf(stderr, "zran: extraction failed: %s error\n",
Chris@43 399 len == Z_MEM_ERROR ? "out of memory" : "input corrupted");
Chris@43 400 else {
Chris@43 401 fwrite(buf, 1, len, stdout);
Chris@43 402 fprintf(stderr, "zran: extracted %d bytes at %llu\n", len, offset);
Chris@43 403 }
Chris@43 404
Chris@43 405 /* clean up and exit */
Chris@43 406 free_index(index);
Chris@43 407 fclose(in);
Chris@43 408 return 0;
Chris@43 409 }