aboutsummaryrefslogtreecommitdiff
path: root/trees.c
diff options
context:
space:
mode:
authorMark Adler <madler@alumni.caltech.edu>2011-09-09 23:35:10 -0700
committerMark Adler <madler@alumni.caltech.edu>2011-09-09 23:35:10 -0700
commit9712272c78b9d9c93746d9c8e156a3728c65ca72 (patch)
tree61cc13495f0688608e4f368ab5b8385f6ca0f858 /trees.c
parent73014202489f913dbffc91d22089ea8a8920c054 (diff)
downloadzlib-9712272c78b9d9c93746d9c8e156a3728c65ca72.tar.gz
zlib-9712272c78b9d9c93746d9c8e156a3728c65ca72.tar.bz2
zlib-9712272c78b9d9c93746d9c8e156a3728c65ca72.zip
zlib 1.2.5v1.2.5
Diffstat (limited to 'trees.c')
-rw-r--r--trees.c7
1 files changed, 4 insertions, 3 deletions
diff --git a/trees.c b/trees.c
index 423340c..56e9bb1 100644
--- a/trees.c
+++ b/trees.c
@@ -1,5 +1,5 @@
1/* trees.c -- output deflated data using Huffman coding 1/* trees.c -- output deflated data using Huffman coding
2 * Copyright (C) 1995-2009 Jean-loup Gailly 2 * Copyright (C) 1995-2010 Jean-loup Gailly
3 * detect_data_type() function provided freely by Cosmin Truta, 2006 3 * detect_data_type() function provided freely by Cosmin Truta, 2006
4 * For conditions of distribution and use, see copyright notice in zlib.h 4 * For conditions of distribution and use, see copyright notice in zlib.h
5 */ 5 */
@@ -351,13 +351,14 @@ void gen_trees_header()
351 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5)); 351 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));
352 } 352 }
353 353
354 fprintf(header, "const uch _dist_code[DIST_CODE_LEN] = {\n"); 354 fprintf(header, "const uch ZLIB_INTERNAL _dist_code[DIST_CODE_LEN] = {\n");
355 for (i = 0; i < DIST_CODE_LEN; i++) { 355 for (i = 0; i < DIST_CODE_LEN; i++) {
356 fprintf(header, "%2u%s", _dist_code[i], 356 fprintf(header, "%2u%s", _dist_code[i],
357 SEPARATOR(i, DIST_CODE_LEN-1, 20)); 357 SEPARATOR(i, DIST_CODE_LEN-1, 20));
358 } 358 }
359 359
360 fprintf(header, "const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {\n"); 360 fprintf(header,
361 "const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {\n");
361 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { 362 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) {
362 fprintf(header, "%2u%s", _length_code[i], 363 fprintf(header, "%2u%s", _length_code[i],
363 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); 364 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20));