diff options
author | Mark Adler <madler@alumni.caltech.edu> | 2011-09-09 23:10:21 -0700 |
---|---|---|
committer | Mark Adler <madler@alumni.caltech.edu> | 2011-09-09 23:10:21 -0700 |
commit | 25e5325501edade156e897f95afdaa2be78ad9a3 (patch) | |
tree | 82687eec194357f9f94f6f137697ffd7a600c1cf /inftrees.c | |
parent | 23c69f10698301ae97709eb0bbfb371d66b99a08 (diff) | |
download | zlib-0.95.tar.gz zlib-0.95.tar.bz2 zlib-0.95.zip |
zlib 0.95v0.95
Diffstat (limited to 'inftrees.c')
-rw-r--r-- | inftrees.c | 18 |
1 files changed, 9 insertions, 9 deletions
@@ -25,14 +25,14 @@ local int huft_build OF(( | |||
25 | uIntf *, /* maximum lookup bits (returns actual) */ | 25 | uIntf *, /* maximum lookup bits (returns actual) */ |
26 | z_stream *)); /* for zalloc function */ | 26 | z_stream *)); /* for zalloc function */ |
27 | 27 | ||
28 | local voidp falloc OF(( | 28 | local voidpf falloc OF(( |
29 | voidp, /* opaque pointer (not used) */ | 29 | voidpf, /* opaque pointer (not used) */ |
30 | uInt, /* number of items */ | 30 | uInt, /* number of items */ |
31 | uInt)); /* size of item */ | 31 | uInt)); /* size of item */ |
32 | 32 | ||
33 | local void ffree OF(( | 33 | local void ffree OF(( |
34 | voidp q, /* opaque pointer (not used) */ | 34 | voidpf q, /* opaque pointer (not used) */ |
35 | voidp p)); /* what to free (not used) */ | 35 | voidpf p)); /* what to free (not used) */ |
36 | 36 | ||
37 | /* Tables for deflate from PKZIP's appnote.txt. */ | 37 | /* Tables for deflate from PKZIP's appnote.txt. */ |
38 | local uInt cplens[] = { /* Copy lengths for literal codes 257..285 */ | 38 | local uInt cplens[] = { /* Copy lengths for literal codes 257..285 */ |
@@ -377,8 +377,8 @@ local inflate_huft *fixed_tl; | |||
377 | local inflate_huft *fixed_td; | 377 | local inflate_huft *fixed_td; |
378 | 378 | ||
379 | 379 | ||
380 | local voidp falloc(q, n, s) | 380 | local voidpf falloc(q, n, s) |
381 | voidp q; /* opaque pointer (not used) */ | 381 | voidpf q; /* opaque pointer (not used) */ |
382 | uInt n; /* number of items */ | 382 | uInt n; /* number of items */ |
383 | uInt s; /* size of item */ | 383 | uInt s; /* size of item */ |
384 | { | 384 | { |
@@ -386,13 +386,13 @@ uInt s; /* size of item */ | |||
386 | "inflate_trees falloc overflow"); | 386 | "inflate_trees falloc overflow"); |
387 | if (q) s++; /* to make some compilers happy */ | 387 | if (q) s++; /* to make some compilers happy */ |
388 | fixed_left -= n; | 388 | fixed_left -= n; |
389 | return (voidp)(fixed_mem + fixed_left); | 389 | return (voidpf)(fixed_mem + fixed_left); |
390 | } | 390 | } |
391 | 391 | ||
392 | 392 | ||
393 | local void ffree(q, p) | 393 | local void ffree(q, p) |
394 | voidp q; | 394 | voidpf q; |
395 | voidp p; | 395 | voidpf p; |
396 | { | 396 | { |
397 | Assert(0, "inflate_trees ffree called!"); | 397 | Assert(0, "inflate_trees ffree called!"); |
398 | if (q) q = p; /* to make some compilers happy */ | 398 | if (q) q = p; /* to make some compilers happy */ |