![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to ztrees.c CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [PGP] / pgp / src|
Return to ztrees.c CVS log | Up to [PGP] / pgp / src |
1.1.1.6 ! root 1: /* ! 2: ! 3: Copyright (C) 1990-1992 Mark Adler, Richard B. Wales, Jean-loup Gailly, ! 4: Kai Uwe Rommel and Igor Mandrichenko. ! 5: Permission is granted to any individual or institution to use, copy, or ! 6: redistribute this software so long as all of the original files are included ! 7: unmodified, that it is not sold for profit, and that this copyright notice ! 8: is retained. ! 9: ! 10: */ ! 11: ! 12: /* ! 13: * trees.c by Jean-loup Gailly ! 14: * ! 15: * This is a new version of im_ctree.c originally written by Richard B. Wales ! 16: * for the defunct implosion method. ! 17: * ! 18: * PURPOSE ! 19: * ! 20: * Encode various sets of source values using variable-length ! 21: * binary code trees. ! 22: * ! 23: * DISCUSSION ! 24: * ! 25: * The PKZIP "deflation" process uses several Huffman trees. The more ! 26: * common source values are represented by shorter bit sequences. ! 27: * ! 28: * Each code tree is stored in the ZIP file in a compressed form ! 29: * which is itself a Huffman encoding of the lengths of ! 30: * all the code strings (in ascending order by source values). ! 31: * The actual code strings are reconstructed from the lengths in ! 32: * the UNZIP process, as described in the "application note" ! 33: * (APPNOTE.TXT) distributed as part of PKWARE's PKZIP program. ! 34: * ! 35: * REFERENCES ! 36: * ! 37: * Lynch, Thomas J. ! 38: * Data Compression: Techniques and Applications, pp. 53-55. ! 39: * Lifetime Learning Publications, 1985. ISBN 0-534-03418-7. ! 40: * ! 41: * Storer, James A. ! 42: * Data Compression: Methods and Theory, pp. 49-50. ! 43: * Computer Science Press, 1988. ISBN 0-7167-8156-5. ! 44: * ! 45: * Sedgewick, R. ! 46: * Algorithms, p290. ! 47: * Addison-Wesley, 1983. ISBN 0-201-06672-6. ! 48: * ! 49: * INTERFACE ! 50: * ! 51: * void ct_init (ush *attr, int *method) ! 52: * Allocate the match buffer, initialize the various tables and save ! 53: * the location of the internal file attribute (ascii/binary) and ! 54: * method (DEFLATE/STORE) ! 55: * ! 56: * void ct_tally (int dist, int lc); ! 57: * Save the match info and tally the frequency counts. ! 58: * ! 59: * long flush_block (char *buf, ulg stored_len, int eof) ! 60: * Determine the best encoding for the current block: dynamic trees, ! 61: * static trees or store, and output the encoded block to the zip ! 62: * file. Returns the total compressed length for the file so far. ! 63: * ! 64: */ ! 65: ! 66: #include <ctype.h> ! 67: #include "zip.h" ! 68: ! 69: /* =========================================================================== ! 70: * Constants ! 71: */ ! 72: ! 73: #define MAX_BITS 15 ! 74: /* All codes must not exceed MAX_BITS bits */ ! 75: ! 76: #define MAX_BL_BITS 7 ! 77: /* Bit length codes must not exceed MAX_BL_BITS bits */ ! 78: ! 79: #define LENGTH_CODES 29 ! 80: /* number of length codes, not counting the special END_BLOCK code */ ! 81: ! 82: #define LITERALS 256 ! 83: /* number of literal bytes 0..255 */ ! 84: ! 85: #define END_BLOCK 256 ! 86: /* end of block literal code */ ! 87: ! 88: #define L_CODES (LITERALS+1+LENGTH_CODES) ! 89: /* number of Literal or Length codes, including the END_BLOCK code */ ! 90: ! 91: #define D_CODES 30 ! 92: /* number of distance codes */ ! 93: ! 94: #define BL_CODES 19 ! 95: /* number of codes used to transfer the bit lengths */ ! 96: ! 97: ! 98: local int near extra_lbits[LENGTH_CODES] /* extra bits for each length code */ ! 99: = {0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0}; ! 100: ! 101: local int near extra_dbits[D_CODES] /* extra bits for each distance code */ ! 102: = {0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13}; ! 103: ! 104: local int near extra_blbits[BL_CODES]/* extra bits for each bit length code */ ! 105: = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7}; ! 106: ! 107: #define STORED_BLOCK 0 ! 108: #define STATIC_TREES 1 ! 109: #define DYN_TREES 2 ! 110: /* The three kinds of block type */ ! 111: ! 112: #ifndef LIT_BUFSIZE ! 113: # ifdef SMALL_MEM ! 114: # define LIT_BUFSIZE 0x2000 ! 115: # else ! 116: # ifdef MEDIUM_MEM ! 117: # define LIT_BUFSIZE 0x4000 ! 118: # else ! 119: # define LIT_BUFSIZE 0x8000 ! 120: # endif ! 121: # endif ! 122: #endif ! 123: #define DIST_BUFSIZE LIT_BUFSIZE ! 124: /* Sizes of match buffers for literals/lengths and distances. There are ! 125: * 4 reasons for limiting LIT_BUFSIZE to 64K: ! 126: * - frequencies can be kept in 16 bit counters ! 127: * - if compression is not successful for the first block, all input data is ! 128: * still in the window so we can still emit a stored block even when input ! 129: * comes from standard input. (This can also be done for all blocks if ! 130: * LIT_BUFSIZE is not greater than 32K.) ! 131: * - if compression is not successful for a file smaller than 64K, we can ! 132: * even emit a stored file instead of a stored block (saving 5 bytes). ! 133: * - creating new Huffman trees less frequently may not provide fast ! 134: * adaptation to changes in the input data statistics. (Take for ! 135: * example a binary file with poorly compressible code followed by ! 136: * a highly compressible string table.) Smaller buffer sizes give ! 137: * fast adaptation but have of course the overhead of transmitting trees ! 138: * more frequently. ! 139: * - I can't count above 4 ! 140: * The current code is general and allows DIST_BUFSIZE < LIT_BUFSIZE (to save ! 141: * memory at the expense of compression). Some optimizations would be possible ! 142: * if we rely on DIST_BUFSIZE == LIT_BUFSIZE. ! 143: */ ! 144: ! 145: #define REP_3_6 16 ! 146: /* repeat previous bit length 3-6 times (2 bits of repeat count) */ ! 147: ! 148: #define REPZ_3_10 17 ! 149: /* repeat a zero length 3-10 times (3 bits of repeat count) */ ! 150: ! 151: #define REPZ_11_138 18 ! 152: /* repeat a zero length 11-138 times (7 bits of repeat count) */ ! 153: ! 154: /* =========================================================================== ! 155: * Local data ! 156: */ ! 157: ! 158: /* Data structure describing a single value and its code string. */ ! 159: typedef struct ct_data { ! 160: union { ! 161: ush freq; /* frequency count */ ! 162: ush code; /* bit string */ ! 163: } fc; ! 164: union { ! 165: ush dad; /* father node in Huffman tree */ ! 166: ush len; /* length of bit string */ ! 167: } dl; ! 168: } ct_data; ! 169: ! 170: #define Freq fc.freq ! 171: #define Code fc.code ! 172: #define Dad dl.dad ! 173: #define Len dl.len ! 174: ! 175: #define HEAP_SIZE (2*L_CODES+1) ! 176: /* maximum heap size */ ! 177: ! 178: local ct_data near dyn_ltree[HEAP_SIZE]; /* literal and length tree */ ! 179: local ct_data near dyn_dtree[2*D_CODES+1]; /* distance tree */ ! 180: ! 181: local ct_data near static_ltree[L_CODES+2]; ! 182: /* The static literal tree. Since the bit lengths are imposed, there is no ! 183: * need for the L_CODES extra codes used during heap construction. However ! 184: * The codes 286 and 287 are needed to build a canonical tree (see ct_init ! 185: * below). ! 186: */ ! 187: ! 188: local ct_data near static_dtree[D_CODES]; ! 189: /* The static distance tree. (Actually a trivial tree since all codes use ! 190: * 5 bits.) ! 191: */ ! 192: ! 193: local ct_data near bl_tree[2*BL_CODES+1]; ! 194: /* Huffman tree for the bit lengths */ ! 195: ! 196: typedef struct tree_desc { ! 197: ct_data near *dyn_tree; /* the dynamic tree */ ! 198: ct_data near *static_tree; /* corresponding static tree or NULL */ ! 199: int near *extra_bits; /* extra bits for each code or NULL */ ! 200: int extra_base; /* base index for extra_bits */ ! 201: int elems; /* max number of elements in the tree */ ! 202: int max_length; /* max bit length for the codes */ ! 203: int max_code; /* largest code with non zero frequency */ ! 204: } tree_desc; ! 205: ! 206: local tree_desc near l_desc = ! 207: {dyn_ltree, static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS, 0}; ! 208: ! 209: local tree_desc near d_desc = ! 210: {dyn_dtree, static_dtree, extra_dbits, 0, D_CODES, MAX_BITS, 0}; ! 211: ! 212: local tree_desc near bl_desc = ! 213: {bl_tree, NULL, extra_blbits, 0, BL_CODES, MAX_BL_BITS, 0}; ! 214: ! 215: ! 216: local ush near bl_count[MAX_BITS+1]; ! 217: /* number of codes at each bit length for an optimal tree */ ! 218: ! 219: local uch near bl_order[BL_CODES] ! 220: = {16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15}; ! 221: /* The lengths of the bit length codes are sent in order of decreasing ! 222: * probability, to avoid transmitting the lengths for unused bit length codes. ! 223: */ ! 224: ! 225: local int near heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ ! 226: local int heap_len; /* number of elements in the heap */ ! 227: local int heap_max; /* element of largest frequency */ ! 228: /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used. ! 229: * The same heap array is used to build all trees. ! 230: */ ! 231: ! 232: local uch near depth[2*L_CODES+1]; ! 233: /* Depth of each subtree used as tie breaker for trees of equal frequency */ ! 234: ! 235: local uch length_code[MAX_MATCH-MIN_MATCH+1]; ! 236: /* length code for each normalized match length (0 == MIN_MATCH) */ ! 237: ! 238: local uch dist_code[512]; ! 239: /* distance codes. The first 256 values correspond to the distances ! 240: * 3 .. 258, the last 256 values correspond to the top 8 bits of ! 241: * the 15 bit distances. ! 242: */ ! 243: ! 244: local int near base_length[LENGTH_CODES]; ! 245: /* First normalized length for each code (0 = MIN_MATCH) */ ! 246: ! 247: local int near base_dist[D_CODES]; ! 248: /* First normalized distance for each code (0 = distance of 1) */ ! 249: ! 250: #ifndef DYN_ALLOC ! 251: local uch far l_buf[LIT_BUFSIZE]; /* buffer for literals/lengths */ ! 252: local ush far d_buf[DIST_BUFSIZE]; /* buffer for distances */ ! 253: #else ! 254: local uch far *l_buf; ! 255: local ush far *d_buf; ! 256: #endif ! 257: ! 258: local uch near flag_buf[(LIT_BUFSIZE/8)]; ! 259: /* flag_buf is a bit array distinguishing literals from lengths in ! 260: * l_buf, and thus indicating the presence or absence of a distance. ! 261: */ ! 262: ! 263: local unsigned last_lit; /* running index in l_buf */ ! 264: local unsigned last_dist; /* running index in d_buf */ ! 265: local unsigned last_flags; /* running index in flag_buf */ ! 266: local uch flags; /* current flags not yet saved in flag_buf */ ! 267: local uch flag_bit; /* current bit used in flags */ ! 268: /* bits are filled in flags starting at bit 0 (least significant). ! 269: * Note: these flags are overkill in the current code since we don't ! 270: * take advantage of DIST_BUFSIZE == LIT_BUFSIZE. ! 271: */ ! 272: ! 273: local ulg opt_len; /* bit length of current block with optimal trees */ ! 274: local ulg static_len; /* bit length of current block with static trees */ ! 275: ! 276: local ulg compressed_len; /* total bit length of compressed file */ ! 277: ! 278: local ulg input_len; /* total byte length of input file */ ! 279: /* input_len is for debugging only since we can get it by other means. */ ! 280: ! 281: static ush *file_type; /* pointer to UNKNOWN, BINARY or ASCII */ ! 282: static int *file_method; /* pointer to DEFLATE or STORE */ ! 283: ! 284: #ifdef DEBUG ! 285: extern ulg bits_sent; /* bit length of the compressed data */ ! 286: extern ulg isize; /* byte length of input file */ ! 287: #endif ! 288: ! 289: extern long block_start; /* window offset of current block */ ! 290: extern unsigned near strstart; /* window offset of current string */ ! 291: ! 292: /* =========================================================================== ! 293: * Local (static) routines in this file. ! 294: */ ! 295: ! 296: local void init_block OF((void)); ! 297: local void pqdownheap OF((ct_data near *tree, int k)); ! 298: local void gen_bitlen OF((tree_desc near *desc)); ! 299: local void gen_codes OF((ct_data near *tree, int max_code)); ! 300: local void build_tree OF((tree_desc near *desc)); ! 301: local void scan_tree OF((ct_data near *tree, int max_code)); ! 302: local void send_tree OF((ct_data near *tree, int max_code)); ! 303: local int build_bl_tree OF((void)); ! 304: local void send_all_trees OF((int lcodes, int dcodes, int blcodes)); ! 305: local void compress_block OF((ct_data near *ltree, ct_data near *dtree)); ! 306: local void set_file_type OF((void)); ! 307: ! 308: ! 309: #ifndef DEBUG ! 310: # define send_code(c, tree) send_bits(tree[c].Code, tree[c].Len) ! 311: /* Send a code of the given tree. c and tree must not have side effects */ ! 312: ! 313: #else /* DEBUG */ ! 314: # define send_code(c, tree) \ ! 315: { if (verbose>1) fprintf(stderr,"\ncd %3d ",(c)); \ ! 316: send_bits(tree[c].Code, tree[c].Len); } ! 317: #endif ! 318: ! 319: #define d_code(dist) \ ! 320: ((dist) < 256 ? dist_code[dist] : dist_code[256+((dist)>>7)]) ! 321: /* Mapping from a distance to a distance code. dist is the distance - 1 and ! 322: * must not have side effects. dist_code[256] and dist_code[257] are never ! 323: * used. ! 324: */ ! 325: ! 326: #define MAX(a,b) (a >= b ? a : b) ! 327: /* the arguments must not have side effects */ ! 328: ! 329: /* =========================================================================== ! 330: * Allocate the match buffer, initialize the various tables and save the ! 331: * location of the internal file attribute (ascii/binary) and method ! 332: * (DEFLATE/STORE). ! 333: */ ! 334: void ct_init(attr, Method) ! 335: ush *attr; /* pointer to internal file attribute */ ! 336: int *Method; /* pointer to compression method */ ! 337: { ! 338: int n; /* iterates over tree elements */ ! 339: int bits; /* bit counter */ ! 340: int length; /* length value */ ! 341: int code; /* code value */ ! 342: int dist; /* distance index */ ! 343: ! 344: file_type = attr; ! 345: file_method = Method; ! 346: compressed_len = input_len = 0L; ! 347: ! 348: #ifdef DYN_ALLOC ! 349: d_buf = (ush far*) fcalloc(DIST_BUFSIZE, sizeof(ush)); ! 350: l_buf = (uch far*) fcalloc(LIT_BUFSIZE/2, 2); ! 351: /* Avoid using the value 64K on 16 bit machines */ ! 352: if (l_buf == NULL || d_buf == NULL) error("ct_init: out of memory"); ! 353: #endif ! 354: ! 355: if (static_dtree[0].Len != 0) return; /* ct_init already called */ ! 356: ! 357: /* Initialize the mapping length (0..255) -> length code (0..28) */ ! 358: length = 0; ! 359: for (code = 0; code < LENGTH_CODES-1; code++) { ! 360: base_length[code] = length; ! 361: for (n = 0; n < (1<<extra_lbits[code]); n++) { ! 362: length_code[length++] = (uch)code; ! 363: } ! 364: } ! 365: Assert (length == 256, "ct_init: length != 256"); ! 366: /* Note that the length 255 (match length 258) can be represented ! 367: * in two different ways: code 284 + 5 bits or code 285, so we ! 368: * overwrite length_code[255] to use the best encoding: ! 369: */ ! 370: length_code[length-1] = (uch)code; ! 371: ! 372: /* Initialize the mapping dist (0..32K) -> dist code (0..29) */ ! 373: dist = 0; ! 374: for (code = 0 ; code < 16; code++) { ! 375: base_dist[code] = dist; ! 376: for (n = 0; n < (1<<extra_dbits[code]); n++) { ! 377: dist_code[dist++] = (uch)code; ! 378: } ! 379: } ! 380: Assert (dist == 256, "ct_init: dist != 256"); ! 381: dist >>= 7; /* from now on, all distances are divided by 128 */ ! 382: for ( ; code < D_CODES; code++) { ! 383: base_dist[code] = dist << 7; ! 384: for (n = 0; n < (1<<(extra_dbits[code]-7)); n++) { ! 385: dist_code[256 + dist++] = (uch)code; ! 386: } ! 387: } ! 388: Assert (dist == 256, "ct_init: 256+dist != 512"); ! 389: ! 390: /* Construct the codes of the static literal tree */ ! 391: for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0; ! 392: n = 0; ! 393: while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; ! 394: while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; ! 395: while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; ! 396: while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; ! 397: /* Codes 286 and 287 do not exist, but we must include them in the ! 398: * tree construction to get a canonical Huffman tree (longest code ! 399: * all ones) ! 400: */ ! 401: gen_codes(static_ltree, L_CODES+1); ! 402: ! 403: /* The static distance tree is trivial: */ ! 404: for (n = 0; n < D_CODES; n++) { ! 405: static_dtree[n].Len = 5; ! 406: static_dtree[n].Code = bi_reverse(n, 5); ! 407: } ! 408: ! 409: /* Initialize the first block of the first file: */ ! 410: init_block(); ! 411: } ! 412: ! 413: void ct_free() ! 414: { ! 415: #ifdef DYN_ALLOC ! 416: #ifndef __TURBOC__ /*EWS*/ ! 417: fcfree(d_buf); ! 418: fcfree(l_buf); ! 419: #else ! 420: free(d_buf); ! 421: free(l_buf); ! 422: #endif ! 423: d_buf = NULL; ! 424: l_buf = NULL; ! 425: #endif ! 426: } ! 427: ! 428: /* =========================================================================== ! 429: * Initialize a new block. ! 430: */ ! 431: local void init_block() ! 432: { ! 433: int n; /* iterates over tree elements */ ! 434: ! 435: /* Initialize the trees. */ ! 436: for (n = 0; n < L_CODES; n++) dyn_ltree[n].Freq = 0; ! 437: for (n = 0; n < D_CODES; n++) dyn_dtree[n].Freq = 0; ! 438: for (n = 0; n < BL_CODES; n++) bl_tree[n].Freq = 0; ! 439: ! 440: dyn_ltree[END_BLOCK].Freq = 1; ! 441: opt_len = static_len = 0L; ! 442: last_lit = last_dist = last_flags = 0; ! 443: flags = 0; flag_bit = 1; ! 444: } ! 445: ! 446: #define SMALLEST 1 ! 447: /* Index within the heap array of least frequent node in the Huffman tree */ ! 448: ! 449: ! 450: /* =========================================================================== ! 451: * Remove the smallest element from the heap and recreate the heap with ! 452: * one less element. Updates heap and heap_len. ! 453: */ ! 454: #define pqremove(tree, top) \ ! 455: {\ ! 456: top = heap[SMALLEST]; \ ! 457: heap[SMALLEST] = heap[heap_len--]; \ ! 458: pqdownheap(tree, SMALLEST); \ ! 459: } ! 460: ! 461: /* =========================================================================== ! 462: * Compares to subtrees, using the tree depth as tie breaker when ! 463: * the subtrees have equal frequency. This minimizes the worst case length. ! 464: */ ! 465: #define smaller(tree, n, m) \ ! 466: (tree[n].Freq < tree[m].Freq || \ ! 467: (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m])) ! 468: ! 469: /* =========================================================================== ! 470: * Restore the heap property by moving down the tree starting at node k, ! 471: * exchanging a node with the smallest of its two sons if necessary, stopping ! 472: * when the heap property is re-established (each father smaller than its ! 473: * two sons). ! 474: */ ! 475: local void pqdownheap(tree, k) ! 476: ct_data near *tree; /* the tree to restore */ ! 477: int k; /* node to move down */ ! 478: { ! 479: int v = heap[k]; ! 480: int j = k << 1; /* left son of k */ ! 481: while (j <= heap_len) { ! 482: /* Set j to the smallest of the two sons: */ ! 483: if (j < heap_len && smaller(tree, heap[j+1], heap[j])) j++; ! 484: ! 485: /* Exit if v is smaller than both sons */ ! 486: if (smaller(tree, v, heap[j])) break; ! 487: ! 488: /* Exchange v with the smallest son */ ! 489: heap[k] = heap[j], k = j; ! 490: ! 491: /* And continue down the tree, setting j to the left son of k */ ! 492: j <<= 1; ! 493: } ! 494: heap[k] = v; ! 495: } ! 496: ! 497: /* =========================================================================== ! 498: * Compute the optimal bit lengths for a tree and update the total bit length ! 499: * for the current block. ! 500: * IN assertion: the fields freq and dad are set, heap[heap_max] and ! 501: * above are the tree nodes sorted by increasing frequency. ! 502: * OUT assertions: the field len is set to the optimal bit length, the ! 503: * array bl_count contains the frequencies for each bit length. ! 504: * The length opt_len is updated; static_len is also updated if stree is ! 505: * not null. ! 506: */ ! 507: local void gen_bitlen(desc) ! 508: tree_desc near *desc; /* the tree descriptor */ ! 509: { ! 510: ct_data near *tree = desc->dyn_tree; ! 511: int near *extra = desc->extra_bits; ! 512: int base = desc->extra_base; ! 513: int max_code = desc->max_code; ! 514: int max_length = desc->max_length; ! 515: ct_data near *stree = desc->static_tree; ! 516: int h; /* heap index */ ! 517: int n, m; /* iterate over the tree elements */ ! 518: int bits; /* bit length */ ! 519: int xbits; /* extra bits */ ! 520: ush f; /* frequency */ ! 521: int overflow = 0; /* number of elements with bit length too large */ ! 522: ! 523: for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0; ! 524: ! 525: /* In a first pass, compute the optimal bit lengths (which may ! 526: * overflow in the case of the bit length tree). ! 527: */ ! 528: tree[heap[heap_max]].Len = 0; /* root of the heap */ ! 529: ! 530: for (h = heap_max+1; h < HEAP_SIZE; h++) { ! 531: n = heap[h]; ! 532: bits = tree[tree[n].Dad].Len + 1; ! 533: if (bits > max_length) bits = max_length, overflow++; ! 534: tree[n].Len = bits; ! 535: /* We overwrite tree[n].Dad which is no longer needed */ ! 536: ! 537: if (n > max_code) continue; /* not a leaf node */ ! 538: ! 539: bl_count[bits]++; ! 540: xbits = 0; ! 541: if (n >= base) xbits = extra[n-base]; ! 542: f = tree[n].Freq; ! 543: opt_len += (ulg)f * (bits + xbits); ! 544: if (stree) static_len += (ulg)f * (stree[n].Len + xbits); ! 545: } ! 546: if (overflow == 0) return; ! 547: ! 548: Trace((stderr,"\nbit length overflow\n")); ! 549: /* This happens for example on obj2 and pic of the Calgary corpus */ ! 550: ! 551: /* Find the first bit length which could increase: */ ! 552: do { ! 553: bits = max_length-1; ! 554: while (bl_count[bits] == 0) bits--; ! 555: bl_count[bits]--; /* move one leaf down the tree */ ! 556: bl_count[bits+1] += 2; /* move one overflow item as its brother */ ! 557: bl_count[max_length]--; ! 558: /* The brother of the overflow item also moves one step up, ! 559: * but this does not affect bl_count[max_length] ! 560: */ ! 561: overflow -= 2; ! 562: } while (overflow > 0); ! 563: ! 564: /* Now recompute all bit lengths, scanning in increasing frequency. ! 565: * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all ! 566: * lengths instead of fixing only the wrong ones. This idea is taken ! 567: * from 'ar' written by Haruhiko Okumura.) ! 568: */ ! 569: for (bits = max_length; bits != 0; bits--) { ! 570: n = bl_count[bits]; ! 571: while (n != 0) { ! 572: m = heap[--h]; ! 573: if (m > max_code) continue; ! 574: if (tree[m].Len != (unsigned) bits) { ! 575: Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits)); ! 576: opt_len += ((long)bits-(long)tree[m].Len)*(long)tree[m].Freq; ! 577: tree[m].Len = bits; ! 578: } ! 579: n--; ! 580: } ! 581: } ! 582: } ! 583: ! 584: /* =========================================================================== ! 585: * Generate the codes for a given tree and bit counts (which need not be ! 586: * optimal). ! 587: * IN assertion: the array bl_count contains the bit length statistics for ! 588: * the given tree and the field len is set for all tree elements. ! 589: * OUT assertion: the field code is set for all tree elements of non ! 590: * zero code length. ! 591: */ ! 592: local void gen_codes (tree, max_code) ! 593: ct_data near *tree; /* the tree to decorate */ ! 594: int max_code; /* largest code with non zero frequency */ ! 595: { ! 596: ush next_code[MAX_BITS+1]; /* next code value for each bit length */ ! 597: ush code = 0; /* running code value */ ! 598: int bits; /* bit index */ ! 599: int n; /* code index */ ! 600: ! 601: /* The distribution counts are first used to generate the code values ! 602: * without bit reversal. ! 603: */ ! 604: for (bits = 1; bits <= MAX_BITS; bits++) { ! 605: next_code[bits] = code = (code + bl_count[bits-1]) << 1; ! 606: } ! 607: /* Check that the bit counts in bl_count are consistent. The last code ! 608: * must be all ones. ! 609: */ ! 610: Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1, ! 611: "inconsistent bit counts"); ! 612: Tracev((stderr,"\ngen_codes: max_code %d ", max_code)); ! 613: ! 614: for (n = 0; n <= max_code; n++) { ! 615: int len = tree[n].Len; ! 616: if (len == 0) continue; ! 617: /* Now reverse the bits */ ! 618: tree[n].Code = bi_reverse(next_code[len]++, len); ! 619: ! 620: Tracec(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ", ! 621: n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1)); ! 622: } ! 623: } ! 624: ! 625: /* =========================================================================== ! 626: * Construct one Huffman tree and assigns the code bit strings and lengths. ! 627: * Update the total bit length for the current block. ! 628: * IN assertion: the field freq is set for all tree elements. ! 629: * OUT assertions: the fields len and code are set to the optimal bit length ! 630: * and corresponding code. The length opt_len is updated; static_len is ! 631: * also updated if stree is not null. The field max_code is set. ! 632: */ ! 633: local void build_tree(desc) ! 634: tree_desc near *desc; /* the tree descriptor */ ! 635: { ! 636: ct_data near *tree = desc->dyn_tree; ! 637: ct_data near *stree = desc->static_tree; ! 638: int elems = desc->elems; ! 639: int n, m; /* iterate over heap elements */ ! 640: int max_code = -1; /* largest code with non zero frequency */ ! 641: int node = elems; /* next internal node of the tree */ ! 642: ! 643: /* Construct the initial heap, with least frequent element in ! 644: * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1]. ! 645: * heap[0] is not used. ! 646: */ ! 647: heap_len = 0, heap_max = HEAP_SIZE; ! 648: ! 649: for (n = 0; n < elems; n++) { ! 650: if (tree[n].Freq != 0) { ! 651: heap[++heap_len] = max_code = n; ! 652: depth[n] = 0; ! 653: } else { ! 654: tree[n].Len = 0; ! 655: } ! 656: } ! 657: ! 658: /* The pkzip format requires that at least one distance code exists, ! 659: * and that at least one bit should be sent even if there is only one ! 660: * possible code. So to avoid special checks later on we force at least ! 661: * two codes of non zero frequency. ! 662: */ ! 663: while (heap_len < 2) { ! 664: int new = heap[++heap_len] = (max_code < 2 ? ++max_code : 0); ! 665: tree[new].Freq = 1; ! 666: depth[new] = 0; ! 667: opt_len--; if (stree) static_len -= stree[new].Len; ! 668: /* new is 0 or 1 so it does not have extra bits */ ! 669: } ! 670: desc->max_code = max_code; ! 671: ! 672: /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree, ! 673: * establish sub-heaps of increasing lengths: ! 674: */ ! 675: for (n = heap_len/2; n >= 1; n--) pqdownheap(tree, n); ! 676: ! 677: /* Construct the Huffman tree by repeatedly combining the least two ! 678: * frequent nodes. ! 679: */ ! 680: do { ! 681: pqremove(tree, n); /* n = node of least frequency */ ! 682: m = heap[SMALLEST]; /* m = node of next least frequency */ ! 683: ! 684: heap[--heap_max] = n; /* keep the nodes sorted by frequency */ ! 685: heap[--heap_max] = m; ! 686: ! 687: /* Create a new node father of n and m */ ! 688: tree[node].Freq = tree[n].Freq + tree[m].Freq; ! 689: depth[node] = (uch) (MAX(depth[n], depth[m]) + 1); ! 690: tree[n].Dad = tree[m].Dad = node; ! 691: #ifdef DUMP_BL_TREE ! 692: if (tree == bl_tree) { ! 693: fprintf(stderr,"\nnode %d(%d), sons %d(%d) %d(%d)", ! 694: node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq); ! 695: } ! 696: #endif ! 697: /* and insert the new node in the heap */ ! 698: heap[SMALLEST] = node++; ! 699: pqdownheap(tree, SMALLEST); ! 700: ! 701: } while (heap_len >= 2); ! 702: ! 703: heap[--heap_max] = heap[SMALLEST]; ! 704: ! 705: /* At this point, the fields freq and dad are set. We can now ! 706: * generate the bit lengths. ! 707: */ ! 708: gen_bitlen(desc); ! 709: ! 710: /* The field len is now set, we can generate the bit codes */ ! 711: gen_codes (tree, max_code); ! 712: } ! 713: ! 714: /* =========================================================================== ! 715: * Scan a literal or distance tree to determine the frequencies of the codes ! 716: * in the bit length tree. Updates opt_len to take into account the repeat ! 717: * counts. (The contribution of the bit length codes will be added later ! 718: * during the construction of bl_tree.) ! 719: */ ! 720: local void scan_tree (tree, max_code) ! 721: ct_data near *tree; /* the tree to be scanned */ ! 722: int max_code; /* and its largest code of non zero frequency */ ! 723: { ! 724: int n; /* iterates over all tree elements */ ! 725: int prevlen = -1; /* last emitted length */ ! 726: int curlen; /* length of current code */ ! 727: int nextlen = tree[0].Len; /* length of next code */ ! 728: int count = 0; /* repeat count of the current code */ ! 729: int max_count = 7; /* max repeat count */ ! 730: int min_count = 4; /* min repeat count */ ! 731: ! 732: if (nextlen == 0) max_count = 138, min_count = 3; ! 733: tree[max_code+1].Len = (ush)-1; /* guard */ ! 734: ! 735: for (n = 0; n <= max_code; n++) { ! 736: curlen = nextlen; nextlen = tree[n+1].Len; ! 737: if (++count < max_count && curlen == nextlen) { ! 738: continue; ! 739: } else if (count < min_count) { ! 740: bl_tree[curlen].Freq += count; ! 741: } else if (curlen != 0) { ! 742: if (curlen != prevlen) bl_tree[curlen].Freq++; ! 743: bl_tree[REP_3_6].Freq++; ! 744: } else if (count <= 10) { ! 745: bl_tree[REPZ_3_10].Freq++; ! 746: } else { ! 747: bl_tree[REPZ_11_138].Freq++; ! 748: } ! 749: count = 0; prevlen = curlen; ! 750: if (nextlen == 0) { ! 751: max_count = 138, min_count = 3; ! 752: } else if (curlen == nextlen) { ! 753: max_count = 6, min_count = 3; ! 754: } else { ! 755: max_count = 7, min_count = 4; ! 756: } ! 757: } ! 758: } ! 759: ! 760: /* =========================================================================== ! 761: * Send a literal or distance tree in compressed form, using the codes in ! 762: * bl_tree. ! 763: */ ! 764: local void send_tree (tree, max_code) ! 765: ct_data near *tree; /* the tree to be scanned */ ! 766: int max_code; /* and its largest code of non zero frequency */ ! 767: { ! 768: int n; /* iterates over all tree elements */ ! 769: int prevlen = -1; /* last emitted length */ ! 770: int curlen; /* length of current code */ ! 771: int nextlen = tree[0].Len; /* length of next code */ ! 772: int count = 0; /* repeat count of the current code */ ! 773: int max_count = 7; /* max repeat count */ ! 774: int min_count = 4; /* min repeat count */ ! 775: ! 776: /* tree[max_code+1].Len = -1; */ /* guard already set */ ! 777: if (nextlen == 0) max_count = 138, min_count = 3; ! 778: ! 779: for (n = 0; n <= max_code; n++) { ! 780: curlen = nextlen; nextlen = tree[n+1].Len; ! 781: if (++count < max_count && curlen == nextlen) { ! 782: continue; ! 783: } else if (count < min_count) { ! 784: do { send_code(curlen, bl_tree); } while (--count != 0); ! 785: ! 786: } else if (curlen != 0) { ! 787: if (curlen != prevlen) { ! 788: send_code(curlen, bl_tree); count--; ! 789: } ! 790: Assert(count >= 3 && count <= 6, " 3_6?"); ! 791: send_code(REP_3_6, bl_tree); send_bits(count-3, 2); ! 792: ! 793: } else if (count <= 10) { ! 794: send_code(REPZ_3_10, bl_tree); send_bits(count-3, 3); ! 795: ! 796: } else { ! 797: send_code(REPZ_11_138, bl_tree); send_bits(count-11, 7); ! 798: } ! 799: count = 0; prevlen = curlen; ! 800: if (nextlen == 0) { ! 801: max_count = 138, min_count = 3; ! 802: } else if (curlen == nextlen) { ! 803: max_count = 6, min_count = 3; ! 804: } else { ! 805: max_count = 7, min_count = 4; ! 806: } ! 807: } ! 808: } ! 809: ! 810: /* =========================================================================== ! 811: * Construct the Huffman tree for the bit lengths and return the index in ! 812: * bl_order of the last bit length code to send. ! 813: */ ! 814: local int build_bl_tree() ! 815: { ! 816: int max_blindex; /* index of last bit length code of non zero freq */ ! 817: ! 818: /* Determine the bit length frequencies for literal and distance trees */ ! 819: scan_tree(dyn_ltree, l_desc.max_code); ! 820: scan_tree(dyn_dtree, d_desc.max_code); ! 821: ! 822: /* Build the bit length tree: */ ! 823: build_tree(&bl_desc); ! 824: /* opt_len now includes the length of the tree representations, except ! 825: * the lengths of the bit lengths codes and the 5+5+4 bits for the counts. ! 826: */ ! 827: ! 828: /* Determine the number of bit length codes to send. The pkzip format ! 829: * requires that at least 4 bit length codes be sent. (appnote.txt says ! 830: * 3 but the actual value used is 4.) ! 831: */ ! 832: for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) { ! 833: if (bl_tree[bl_order[max_blindex]].Len != 0) break; ! 834: } ! 835: /* Update opt_len to include the bit length tree and counts */ ! 836: opt_len += 3*(max_blindex+1) + 5+5+4; ! 837: Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld", opt_len, static_len)); ! 838: ! 839: return max_blindex; ! 840: } ! 841: ! 842: /* =========================================================================== ! 843: * Send the header for a block using dynamic Huffman trees: the counts, the ! 844: * lengths of the bit length codes, the literal tree and the distance tree. ! 845: * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4. ! 846: */ ! 847: local void send_all_trees(lcodes, dcodes, blcodes) ! 848: int lcodes, dcodes, blcodes; /* number of codes for each tree */ ! 849: { ! 850: int rank; /* index in bl_order */ ! 851: ! 852: Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); ! 853: Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, ! 854: "too many codes"); ! 855: Tracev((stderr, "\nbl counts: ")); ! 856: send_bits(lcodes-257, 5); /* not -255 as stated in appnote.txt */ ! 857: send_bits(dcodes-1, 5); ! 858: send_bits(blcodes-4, 4); /* not -3 as stated in appnote.txt */ ! 859: for (rank = 0; rank < blcodes; rank++) { ! 860: Tracev((stderr, "\nbl code %2d ", bl_order[rank])); ! 861: send_bits(bl_tree[bl_order[rank]].Len, 3); ! 862: } ! 863: Tracev((stderr, "\nbl tree: sent %ld", bits_sent)); ! 864: ! 865: send_tree(dyn_ltree, lcodes-1); /* send the literal tree */ ! 866: Tracev((stderr, "\nlit tree: sent %ld", bits_sent)); ! 867: ! 868: send_tree(dyn_dtree, dcodes-1); /* send the distance tree */ ! 869: Tracev((stderr, "\ndist tree: sent %ld", bits_sent)); ! 870: } ! 871: ! 872: /* =========================================================================== ! 873: * Determine the best encoding for the current block: dynamic trees, static ! 874: * trees or store, and output the encoded block to the zip file. This function ! 875: * returns the total compressed length for the file so far. ! 876: */ ! 877: ulg flush_block(buf, stored_len, eof) ! 878: char *buf; /* input block, or NULL if too old */ ! 879: ulg stored_len; /* length of input block */ ! 880: int eof; /* true if this is the last block for a file */ ! 881: { ! 882: ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */ ! 883: int max_blindex; /* index of last bit length code of non zero freq */ ! 884: ! 885: flag_buf[last_flags] = flags; /* Save the flags for the last 8 items */ ! 886: ! 887: /* Check if the file is ascii or binary */ ! 888: if (*file_type == (ush)UNKNOWN) set_file_type(); ! 889: ! 890: /* Construct the literal and distance trees */ ! 891: build_tree(&l_desc); ! 892: Tracev((stderr, "\nlit data: dyn %ld, stat %ld", opt_len, static_len)); ! 893: ! 894: build_tree(&d_desc); ! 895: Tracev((stderr, "\ndist data: dyn %ld, stat %ld", opt_len, static_len)); ! 896: /* At this point, opt_len and static_len are the total bit lengths of ! 897: * the compressed block data, excluding the tree representations. ! 898: */ ! 899: ! 900: /* Build the bit length tree for the above two trees, and get the index ! 901: * in bl_order of the last bit length code to send. ! 902: */ ! 903: max_blindex = build_bl_tree(); ! 904: ! 905: /* Determine the best encoding. Compute first the block length in bytes */ ! 906: opt_lenb = (opt_len+3+7)>>3; ! 907: static_lenb = (static_len+3+7)>>3; ! 908: input_len += stored_len; /* for debugging only */ ! 909: ! 910: Trace((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u dist %u ", ! 911: opt_lenb, opt_len, static_lenb, static_len, stored_len, ! 912: last_lit, last_dist)); ! 913: ! 914: if (static_lenb <= opt_lenb) opt_lenb = static_lenb; ! 915: ! 916: #ifdef ZIP /* not ok for PGP */ ! 917: /* If compression failed and this is the first and last block, ! 918: * and if the zip file can be seeked (to rewrite the local header), ! 919: * the whole file is transformed into a stored file: ! 920: */ ! 921: #ifdef FORCE_METHOD ! 922: if (level == 1 && eof && compressed_len == 0L) { /* force stored file */ ! 923: #else ! 924: if (stored_len <= opt_lenb && eof && compressed_len == 0L && seekable()) { ! 925: #endif ! 926: /* Since LIT_BUFSIZE <= 2*WSIZE, the input data must be there: */ ! 927: if (buf == NULL) error ("block vanished"); ! 928: ! 929: copy_block(buf, (unsigned)stored_len, 0); /* without header */ ! 930: compressed_len = stored_len << 3; ! 931: *file_method = STORE; ! 932: } else ! 933: #endif /* ZIP */ ! 934: ! 935: #ifdef FORCE_METHOD ! 936: if (level == 2 && buf != NULL) { /* force stored block */ ! 937: #else ! 938: if ((stored_len+4 <= opt_lenb) && (buf != (char *)NULL)) { ! 939: /* 4: two words for the lengths */ ! 940: #endif ! 941: /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE. ! 942: * Otherwise we can't have processed more than WSIZE input bytes since ! 943: * the last block flush, because compression would have been ! 944: * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to ! 945: * transform a block into a stored block. ! 946: */ ! 947: send_bits((STORED_BLOCK<<1)+eof, 3); /* send block type */ ! 948: compressed_len = (compressed_len + 3 + 7) & ~7L; ! 949: compressed_len += (stored_len + 4) << 3; ! 950: ! 951: copy_block(buf, (unsigned)stored_len, 1); /* with header */ ! 952: ! 953: #ifdef FORCE_METHOD ! 954: } else if (level == 3) { /* force static trees */ ! 955: #else ! 956: } else if (static_lenb == opt_lenb) { ! 957: #endif ! 958: send_bits((STATIC_TREES<<1)+eof, 3); ! 959: compress_block(static_ltree, static_dtree); ! 960: compressed_len += 3 + static_len; ! 961: } else { ! 962: send_bits((DYN_TREES<<1)+eof, 3); ! 963: send_all_trees(l_desc.max_code+1, d_desc.max_code+1, max_blindex+1); ! 964: compress_block(dyn_ltree, dyn_dtree); ! 965: compressed_len += 3 + opt_len; ! 966: } ! 967: Assert (compressed_len == bits_sent, "bad compressed size"); ! 968: init_block(); ! 969: ! 970: if (eof) { ! 971: #ifndef ZIP ! 972: /* Wipe out sensitive data for pgp */ ! 973: # ifdef DYN_ALLOC ! 974: extern uch *slide; ! 975: # else ! 976: extern uch slide[]; ! 977: # endif ! 978: memset(slide, 0, (unsigned)(2*WSIZE-1)); /* -1 needed if WSIZE=32K */ ! 979: #endif /* ZIP */ ! 980: ! 981: #if 0 ! 982: Assert (input_len == isize, "bad input size"); ! 983: #endif ! 984: bi_windup(); ! 985: compressed_len += 7; /* align on byte boundary */ ! 986: } ! 987: Tracev((stderr,"\ncomprlen %lu(%lu) ", compressed_len>>3, ! 988: compressed_len-7*eof)); ! 989: ! 990: return compressed_len >> 3; ! 991: } ! 992: ! 993: /* =========================================================================== ! 994: * Save the match info and tally the frequency counts. Return true if ! 995: * the current block must be flushed. ! 996: */ ! 997: int ct_tally (dist, lc) ! 998: int dist; /* distance of matched string */ ! 999: int lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */ ! 1000: { ! 1001: l_buf[last_lit++] = (uch)lc; ! 1002: if (dist == 0) { ! 1003: /* lc is the unmatched char */ ! 1004: dyn_ltree[lc].Freq++; ! 1005: } else { ! 1006: /* Here, lc is the match length - MIN_MATCH */ ! 1007: dist--; /* dist = match distance - 1 */ ! 1008: Assert((ush)dist < (ush)MAX_DIST && ! 1009: (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && ! 1010: (ush)d_code(dist) < (ush)D_CODES, "ct_tally: bad match"); ! 1011: ! 1012: dyn_ltree[length_code[lc]+LITERALS+1].Freq++; ! 1013: dyn_dtree[d_code(dist)].Freq++; ! 1014: ! 1015: d_buf[last_dist++] = dist; ! 1016: flags |= flag_bit; ! 1017: } ! 1018: flag_bit <<= 1; ! 1019: ! 1020: /* Output the flags if they fill a byte: */ ! 1021: if ((last_lit & 7) == 0) { ! 1022: flag_buf[last_flags++] = flags; ! 1023: flags = 0, flag_bit = 1; ! 1024: } ! 1025: /* Try to guess if it is profitable to stop the current block here */ ! 1026: if (level > 2 && (last_lit & 0xfff) == 0) { ! 1027: /* Compute an upper bound for the compressed length */ ! 1028: ulg out_length = (ulg)last_lit*8L; ! 1029: ulg in_length = (ulg)strstart-block_start; ! 1030: int dcode; ! 1031: for (dcode = 0; dcode < D_CODES; dcode++) { ! 1032: out_length += (ulg)dyn_dtree[dcode].Freq*(5L+extra_dbits[dcode]); ! 1033: } ! 1034: out_length >>= 3; ! 1035: Trace((stderr,"\nlast_lit %u, last_dist %u, in %ld, out ~%ld(%ld%%) ", ! 1036: last_lit, last_dist, in_length, out_length, ! 1037: 100L - out_length*100L/in_length)); ! 1038: if (last_dist < last_lit/2 && out_length < in_length/2) return 1; ! 1039: } ! 1040: return (last_lit == LIT_BUFSIZE-1 || last_dist == DIST_BUFSIZE); ! 1041: /* We avoid equality with LIT_BUFSIZE because of wraparound at 64K ! 1042: * on 16 bit machines and because stored blocks are restricted to ! 1043: * 64K-1 bytes. ! 1044: */ ! 1045: } ! 1046: ! 1047: /* =========================================================================== ! 1048: * Send the block data compressed using the given Huffman trees ! 1049: */ ! 1050: local void compress_block(ltree, dtree) ! 1051: ct_data near *ltree; /* literal tree */ ! 1052: ct_data near *dtree; /* distance tree */ ! 1053: { ! 1054: unsigned dist; /* distance of matched string */ ! 1055: int lc; /* match length or unmatched char (if dist == 0) */ ! 1056: unsigned lx = 0; /* running index in l_buf */ ! 1057: unsigned dx = 0; /* running index in d_buf */ ! 1058: unsigned fx = 0; /* running index in flag_buf */ ! 1059: uch flag = 0; /* current flags */ ! 1060: unsigned code; /* the code to send */ ! 1061: int extra; /* number of extra bits to send */ ! 1062: ! 1063: if (last_lit != 0) do { ! 1064: if ((lx & 7) == 0) flag = flag_buf[fx++]; ! 1065: lc = l_buf[lx++]; ! 1066: if ((flag & 1) == 0) { ! 1067: send_code(lc, ltree); /* send a literal byte */ ! 1068: Tracecv(isgraph(lc), (stderr," '%c' ", lc)); ! 1069: } else { ! 1070: /* Here, lc is the match length - MIN_MATCH */ ! 1071: code = length_code[lc]; ! 1072: send_code(code+LITERALS+1, ltree); /* send the length code */ ! 1073: extra = extra_lbits[code]; ! 1074: if (extra != 0) { ! 1075: lc -= base_length[code]; ! 1076: send_bits(lc, extra); /* send the extra length bits */ ! 1077: } ! 1078: dist = d_buf[dx++]; ! 1079: /* Here, dist is the match distance - 1 */ ! 1080: code = d_code(dist); ! 1081: Assert (code < D_CODES, "bad d_code"); ! 1082: ! 1083: send_code(code, dtree); /* send the distance code */ ! 1084: extra = extra_dbits[code]; ! 1085: if (extra != 0) { ! 1086: dist -= base_dist[code]; ! 1087: send_bits(dist, extra); /* send the extra distance bits */ ! 1088: } ! 1089: } /* literal or match pair ? */ ! 1090: flag >>= 1; ! 1091: } while (lx < last_lit); ! 1092: ! 1093: send_code(END_BLOCK, ltree); ! 1094: } ! 1095: ! 1096: /* =========================================================================== ! 1097: * Set the file type to ASCII or BINARY, using a crude approximation: ! 1098: * binary if more than 20% of the bytes are <= 6 or >= 128, ascii otherwise. ! 1099: * IN assertion: the fields freq of dyn_ltree are set and the total of all ! 1100: * frequencies does not exceed 64K (to fit in an int on 16 bit machines). ! 1101: */ ! 1102: local void set_file_type() ! 1103: { ! 1104: int n = 0; ! 1105: unsigned ascii_freq = 0; ! 1106: unsigned bin_freq = 0; ! 1107: while (n < 7) bin_freq += dyn_ltree[n++].Freq; ! 1108: while (n < 128) ascii_freq += dyn_ltree[n++].Freq; ! 1109: while (n < LITERALS) bin_freq += dyn_ltree[n++].Freq; ! 1110: *file_type = bin_freq > (ascii_freq >> 2) ? BINARY : ASCII; ! 1111: #ifdef ZIP ! 1112: if (*file_type == BINARY && translate_eol) { ! 1113: warn("-l used on binary file", ""); ! 1114: } ! 1115: #endif ! 1116: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.