trees.c revision 17b20e6f38ad2263e47a6884c4f68ce9773d8b29
18b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* trees.c -- output deflated data using Huffman coding 217b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner * Copyright (C) 1995-2012 Jean-loup Gailly 317b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner * detect_data_type() function provided freely by Cosmin Truta, 2006 48b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * For conditions of distribution and use, see copyright notice in zlib.h 58b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 68b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 78b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* 88b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * ALGORITHM 98b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * 108b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * The "deflation" process uses several Huffman trees. The more 118b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * common source values are represented by shorter bit sequences. 128b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * 138b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Each code tree is stored in a compressed form which is itself 148b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * a Huffman encoding of the lengths of all the code strings (in 158b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * ascending order by source values). The actual code strings are 168b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * reconstructed from the lengths in the inflate process, as described 178b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * in the deflate specification. 188b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * 198b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * REFERENCES 208b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * 218b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Deutsch, L.P.,"'Deflate' Compressed Data Format Specification". 228b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Available in ftp.uu.net:/pub/archiving/zip/doc/deflate-1.1.doc 238b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * 248b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Storer, James A. 258b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Data Compression: Methods and Theory, pp. 49-50. 268b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Computer Science Press, 1988. ISBN 0-7167-8156-5. 278b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * 288b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Sedgewick, R. 298b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Algorithms, p290. 308b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Addison-Wesley, 1983. ISBN 0-201-06672-6. 318b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 328b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 338b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* @(#) $Id$ */ 348b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 358b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* #define GEN_TREES_H */ 368b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 378b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#include "deflate.h" 388b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 398b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#ifdef DEBUG 408b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project# include <ctype.h> 418b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#endif 428b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 438b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 448b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Constants 458b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 468b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 478b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#define MAX_BL_BITS 7 488b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* Bit length codes must not exceed MAX_BL_BITS bits */ 498b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 508b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#define END_BLOCK 256 518b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* end of block literal code */ 528b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 538b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#define REP_3_6 16 548b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* repeat previous bit length 3-6 times (2 bits of repeat count) */ 558b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 568b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#define REPZ_3_10 17 578b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* repeat a zero length 3-10 times (3 bits of repeat count) */ 588b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 598b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#define REPZ_11_138 18 608b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* repeat a zero length 11-138 times (7 bits of repeat count) */ 618b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 628b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal const int extra_lbits[LENGTH_CODES] /* extra bits for each length code */ 638b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project = {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}; 648b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 658b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal const int extra_dbits[D_CODES] /* extra bits for each distance code */ 668b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project = {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}; 678b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 688b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal const int extra_blbits[BL_CODES]/* extra bits for each bit length code */ 698b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7}; 708b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 718b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal const uch bl_order[BL_CODES] 728b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project = {16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15}; 738b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* The lengths of the bit length codes are sent in order of decreasing 748b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * probability, to avoid transmitting the lengths for unused bit length codes. 758b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 768b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 778b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 788b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Local data. These are initialized only once. 798b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 808b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 818b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#define DIST_CODE_LEN 512 /* see definition of array dist_code below */ 828b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 838b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#if defined(GEN_TREES_H) || !defined(STDC) 848b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* non ANSI compilers may not accept trees.h */ 858b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 868b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal ct_data static_ltree[L_CODES+2]; 878b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* The static literal tree. Since the bit lengths are imposed, there is no 888b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * need for the L_CODES extra codes used during heap construction. However 898b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * The codes 286 and 287 are needed to build a canonical tree (see _tr_init 908b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * below). 918b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 928b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 938b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal ct_data static_dtree[D_CODES]; 948b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* The static distance tree. (Actually a trivial tree since all codes use 958b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * 5 bits.) 968b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 978b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 988b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectuch _dist_code[DIST_CODE_LEN]; 998b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* Distance codes. The first 256 values correspond to the distances 1008b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * 3 .. 258, the last 256 values correspond to the top 8 bits of 1018b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * the 15 bit distances. 1028b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 1038b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 1048b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectuch _length_code[MAX_MATCH-MIN_MATCH+1]; 1058b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* length code for each normalized match length (0 == MIN_MATCH) */ 1068b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 1078b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal int base_length[LENGTH_CODES]; 1088b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* First normalized length for each code (0 = MIN_MATCH) */ 1098b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 1108b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal int base_dist[D_CODES]; 1118b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* First normalized distance for each code (0 = distance of 1) */ 1128b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 1138b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#else 1148b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project# include "trees.h" 1158b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#endif /* GEN_TREES_H */ 1168b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 1178b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectstruct static_tree_desc_s { 1188b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project const ct_data *static_tree; /* static tree or NULL */ 1198b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project const intf *extra_bits; /* extra bits for each code or NULL */ 1208b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int extra_base; /* base index for extra_bits */ 1218b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int elems; /* max number of elements in the tree */ 1228b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int max_length; /* max bit length for the codes */ 1238b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project}; 1248b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 1258b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal static_tree_desc static_l_desc = 1268b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS}; 1278b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 1288b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal static_tree_desc static_d_desc = 1298b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{static_dtree, extra_dbits, 0, D_CODES, MAX_BITS}; 1308b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 1318b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal static_tree_desc static_bl_desc = 1328b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS}; 1338b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 1348b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 1358b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Local (static) routines in this file. 1368b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 1378b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 1388b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void tr_static_init OF((void)); 1398b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void init_block OF((deflate_state *s)); 1408b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void pqdownheap OF((deflate_state *s, ct_data *tree, int k)); 1418b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void gen_bitlen OF((deflate_state *s, tree_desc *desc)); 1428b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count)); 1438b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void build_tree OF((deflate_state *s, tree_desc *desc)); 1448b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void scan_tree OF((deflate_state *s, ct_data *tree, int max_code)); 1458b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void send_tree OF((deflate_state *s, ct_data *tree, int max_code)); 1468b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal int build_bl_tree OF((deflate_state *s)); 1478b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void send_all_trees OF((deflate_state *s, int lcodes, int dcodes, 1488b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int blcodes)); 14917b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turnerlocal void compress_block OF((deflate_state *s, const ct_data *ltree, 15017b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner const ct_data *dtree)); 15117b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turnerlocal int detect_data_type OF((deflate_state *s)); 1528b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal unsigned bi_reverse OF((unsigned value, int length)); 1538b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void bi_windup OF((deflate_state *s)); 1548b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void bi_flush OF((deflate_state *s)); 1558b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void copy_block OF((deflate_state *s, charf *buf, unsigned len, 1568b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int header)); 1578b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 1588b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#ifdef GEN_TREES_H 1598b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void gen_trees_header OF((void)); 1608b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#endif 1618b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 1628b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#ifndef DEBUG 1638b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) 1648b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Send a code of the given tree. c and tree must not have side effects */ 1658b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 1668b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#else /* DEBUG */ 1678b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project# define send_code(s, c, tree) \ 1688b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project { if (z_verbose>2) fprintf(stderr,"\ncd %3d ",(c)); \ 1698b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project send_bits(s, tree[c].Code, tree[c].Len); } 1708b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#endif 1718b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 1728b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 1738b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Output a short LSB first on the stream. 1748b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * IN assertion: there is enough room in pendingBuf. 1758b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 1768b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#define put_short(s, w) { \ 1778b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project put_byte(s, (uch)((w) & 0xff)); \ 1788b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project put_byte(s, (uch)((ush)(w) >> 8)); \ 1798b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project} 1808b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 1818b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 1828b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Send a value on a given number of bits. 1838b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * IN assertion: length <= 16 and value fits in length bits. 1848b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 1858b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#ifdef DEBUG 1868b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void send_bits OF((deflate_state *s, int value, int length)); 1878b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 1888b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void send_bits(s, value, length) 1898b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project deflate_state *s; 1908b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int value; /* value to send */ 1918b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int length; /* number of bits */ 1928b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{ 1938b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Tracevv((stderr," l %2d v %4x ", length, value)); 1948b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Assert(length > 0 && length <= 15, "invalid length"); 1958b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bits_sent += (ulg)length; 1968b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 1978b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* If not enough room in bi_buf, use (valid) bits from bi_buf and 1988b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * (16 - bi_valid) bits from value, leaving (width - (16-bi_valid)) 1998b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * unused bits in value. 2008b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 2018b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (s->bi_valid > (int)Buf_size - length) { 20217b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner s->bi_buf |= (ush)value << s->bi_valid; 2038b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project put_short(s, s->bi_buf); 2048b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bi_buf = (ush)value >> (Buf_size - s->bi_valid); 2058b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bi_valid += length - Buf_size; 2068b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } else { 20717b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner s->bi_buf |= (ush)value << s->bi_valid; 2088b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bi_valid += length; 2098b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 2108b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project} 2118b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#else /* !DEBUG */ 2128b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 2138b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#define send_bits(s, value, length) \ 2148b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{ int len = length;\ 2158b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (s->bi_valid > (int)Buf_size - len) {\ 2168b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int val = value;\ 21717b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner s->bi_buf |= (ush)val << s->bi_valid;\ 2188b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project put_short(s, s->bi_buf);\ 2198b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\ 2208b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bi_valid += len - Buf_size;\ 2218b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } else {\ 22217b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner s->bi_buf |= (ush)(value) << s->bi_valid;\ 2238b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bi_valid += len;\ 2248b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project }\ 2258b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project} 2268b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#endif /* DEBUG */ 2278b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 2288b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 2298b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* the arguments must not have side effects */ 2308b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 2318b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 2328b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Initialize the various 'constant' tables. 2338b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 2348b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void tr_static_init() 2358b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{ 2368b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#if defined(GEN_TREES_H) || !defined(STDC) 2378b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project static int static_init_done = 0; 2388b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int n; /* iterates over tree elements */ 2398b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int bits; /* bit counter */ 2408b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int length; /* length value */ 2418b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int code; /* code value */ 2428b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int dist; /* distance index */ 2438b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project ush bl_count[MAX_BITS+1]; 2448b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* number of codes at each bit length for an optimal tree */ 2458b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 2468b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (static_init_done) return; 2478b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 2488b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* For some embedded targets, global variables are not initialized: */ 24917b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner#ifdef NO_INIT_GLOBAL_POINTERS 2508b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project static_l_desc.static_tree = static_ltree; 2518b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project static_l_desc.extra_bits = extra_lbits; 2528b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project static_d_desc.static_tree = static_dtree; 2538b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project static_d_desc.extra_bits = extra_dbits; 2548b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project static_bl_desc.extra_bits = extra_blbits; 25517b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner#endif 2568b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 2578b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Initialize the mapping length (0..255) -> length code (0..28) */ 2588b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project length = 0; 2598b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (code = 0; code < LENGTH_CODES-1; code++) { 2608b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project base_length[code] = length; 2618b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (n = 0; n < (1<<extra_lbits[code]); n++) { 2628b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project _length_code[length++] = (uch)code; 2638b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 2648b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 2658b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Assert (length == 256, "tr_static_init: length != 256"); 2668b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Note that the length 255 (match length 258) can be represented 2678b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * in two different ways: code 284 + 5 bits or code 285, so we 2688b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * overwrite length_code[255] to use the best encoding: 2698b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 2708b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project _length_code[length-1] = (uch)code; 2718b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 2728b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Initialize the mapping dist (0..32K) -> dist code (0..29) */ 2738b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project dist = 0; 2748b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (code = 0 ; code < 16; code++) { 2758b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project base_dist[code] = dist; 2768b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (n = 0; n < (1<<extra_dbits[code]); n++) { 2778b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project _dist_code[dist++] = (uch)code; 2788b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 2798b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 2808b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Assert (dist == 256, "tr_static_init: dist != 256"); 2818b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project dist >>= 7; /* from now on, all distances are divided by 128 */ 2828b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for ( ; code < D_CODES; code++) { 2838b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project base_dist[code] = dist << 7; 2848b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (n = 0; n < (1<<(extra_dbits[code]-7)); n++) { 2858b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project _dist_code[256 + dist++] = (uch)code; 2868b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 2878b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 2888b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Assert (dist == 256, "tr_static_init: 256+dist != 512"); 2898b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 2908b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Construct the codes of the static literal tree */ 2918b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0; 2928b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project n = 0; 2938b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; 2948b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; 2958b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; 2968b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; 2978b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Codes 286 and 287 do not exist, but we must include them in the 2988b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * tree construction to get a canonical Huffman tree (longest code 2998b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * all ones) 3008b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 3018b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); 3028b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 3038b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* The static distance tree is trivial: */ 3048b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (n = 0; n < D_CODES; n++) { 3058b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project static_dtree[n].Len = 5; 3068b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project static_dtree[n].Code = bi_reverse((unsigned)n, 5); 3078b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 3088b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project static_init_done = 1; 3098b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 3108b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project# ifdef GEN_TREES_H 3118b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project gen_trees_header(); 3128b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project# endif 3138b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#endif /* defined(GEN_TREES_H) || !defined(STDC) */ 3148b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project} 3158b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 3168b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 3178b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Genererate the file trees.h describing the static trees. 3188b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 3198b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#ifdef GEN_TREES_H 3208b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project# ifndef DEBUG 3218b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project# include <stdio.h> 3228b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project# endif 3238b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 3248b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project# define SEPARATOR(i, last, width) \ 3258b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project ((i) == (last)? "\n};\n\n" : \ 3268b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project ((i) % (width) == (width)-1 ? ",\n" : ", ")) 3278b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 3288b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectvoid gen_trees_header() 3298b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{ 3308b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project FILE *header = fopen("trees.h", "w"); 3318b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int i; 3328b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 3338b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Assert (header != NULL, "Can't open trees.h"); 3348b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project fprintf(header, 3358b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project "/* header created automatically with -DGEN_TREES_H */\n\n"); 3368b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 3378b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n"); 3388b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (i = 0; i < L_CODES+2; i++) { 3398b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project fprintf(header, "{{%3u},{%3u}}%s", static_ltree[i].Code, 3408b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5)); 3418b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 3428b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 3438b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project fprintf(header, "local const ct_data static_dtree[D_CODES] = {\n"); 3448b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (i = 0; i < D_CODES; i++) { 3458b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project fprintf(header, "{{%2u},{%2u}}%s", static_dtree[i].Code, 3468b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5)); 3478b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 3488b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 34917b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner fprintf(header, "const uch ZLIB_INTERNAL _dist_code[DIST_CODE_LEN] = {\n"); 3508b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (i = 0; i < DIST_CODE_LEN; i++) { 3518b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project fprintf(header, "%2u%s", _dist_code[i], 3528b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project SEPARATOR(i, DIST_CODE_LEN-1, 20)); 3538b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 3548b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 35517b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner fprintf(header, 35617b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner "const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {\n"); 3578b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { 3588b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project fprintf(header, "%2u%s", _length_code[i], 3598b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); 3608b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 3618b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 3628b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project fprintf(header, "local const int base_length[LENGTH_CODES] = {\n"); 3638b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (i = 0; i < LENGTH_CODES; i++) { 3648b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project fprintf(header, "%1u%s", base_length[i], 3658b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project SEPARATOR(i, LENGTH_CODES-1, 20)); 3668b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 3678b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 3688b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project fprintf(header, "local const int base_dist[D_CODES] = {\n"); 3698b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (i = 0; i < D_CODES; i++) { 3708b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project fprintf(header, "%5u%s", base_dist[i], 3718b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project SEPARATOR(i, D_CODES-1, 10)); 3728b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 3738b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 3748b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project fclose(header); 3758b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project} 3768b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#endif /* GEN_TREES_H */ 3778b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 3788b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 3798b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Initialize the tree data structures for a new zlib stream. 3808b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 38117b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turnervoid ZLIB_INTERNAL _tr_init(s) 3828b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project deflate_state *s; 3838b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{ 3848b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project tr_static_init(); 3858b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 3868b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->l_desc.dyn_tree = s->dyn_ltree; 3878b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->l_desc.stat_desc = &static_l_desc; 3888b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 3898b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->d_desc.dyn_tree = s->dyn_dtree; 3908b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->d_desc.stat_desc = &static_d_desc; 3918b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 3928b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bl_desc.dyn_tree = s->bl_tree; 3938b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bl_desc.stat_desc = &static_bl_desc; 3948b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 3958b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bi_buf = 0; 3968b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bi_valid = 0; 3978b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#ifdef DEBUG 3988b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->compressed_len = 0L; 3998b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bits_sent = 0L; 4008b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#endif 4018b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 4028b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Initialize the first block of the first file: */ 4038b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project init_block(s); 4048b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project} 4058b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 4068b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 4078b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Initialize a new block. 4088b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 4098b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void init_block(s) 4108b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project deflate_state *s; 4118b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{ 4128b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int n; /* iterates over tree elements */ 4138b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 4148b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Initialize the trees. */ 4158b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; 4168b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; 4178b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; 4188b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 4198b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->dyn_ltree[END_BLOCK].Freq = 1; 4208b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->opt_len = s->static_len = 0L; 4218b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->last_lit = s->matches = 0; 4228b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project} 4238b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 4248b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#define SMALLEST 1 4258b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* Index within the heap array of least frequent node in the Huffman tree */ 4268b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 4278b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 4288b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 4298b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Remove the smallest element from the heap and recreate the heap with 4308b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * one less element. Updates heap and heap_len. 4318b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 4328b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#define pqremove(s, tree, top) \ 4338b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{\ 4348b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project top = s->heap[SMALLEST]; \ 4358b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->heap[SMALLEST] = s->heap[s->heap_len--]; \ 4368b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project pqdownheap(s, tree, SMALLEST); \ 4378b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project} 4388b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 4398b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 4408b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Compares to subtrees, using the tree depth as tie breaker when 4418b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * the subtrees have equal frequency. This minimizes the worst case length. 4428b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 4438b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#define smaller(tree, n, m, depth) \ 4448b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project (tree[n].Freq < tree[m].Freq || \ 4458b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m])) 4468b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 4478b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 4488b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Restore the heap property by moving down the tree starting at node k, 4498b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * exchanging a node with the smallest of its two sons if necessary, stopping 4508b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * when the heap property is re-established (each father smaller than its 4518b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * two sons). 4528b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 4538b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void pqdownheap(s, tree, k) 4548b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project deflate_state *s; 4558b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project ct_data *tree; /* the tree to restore */ 4568b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int k; /* node to move down */ 4578b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{ 4588b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int v = s->heap[k]; 4598b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int j = k << 1; /* left son of k */ 4608b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project while (j <= s->heap_len) { 4618b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Set j to the smallest of the two sons: */ 4628b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (j < s->heap_len && 4638b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project smaller(tree, s->heap[j+1], s->heap[j], s->depth)) { 4648b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project j++; 4658b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 4668b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Exit if v is smaller than both sons */ 4678b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (smaller(tree, v, s->heap[j], s->depth)) break; 4688b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 4698b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Exchange v with the smallest son */ 4708b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->heap[k] = s->heap[j]; k = j; 4718b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 4728b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* And continue down the tree, setting j to the left son of k */ 4738b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project j <<= 1; 4748b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 4758b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->heap[k] = v; 4768b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project} 4778b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 4788b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 4798b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Compute the optimal bit lengths for a tree and update the total bit length 4808b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * for the current block. 4818b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * IN assertion: the fields freq and dad are set, heap[heap_max] and 4828b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * above are the tree nodes sorted by increasing frequency. 4838b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * OUT assertions: the field len is set to the optimal bit length, the 4848b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * array bl_count contains the frequencies for each bit length. 4858b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * The length opt_len is updated; static_len is also updated if stree is 4868b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * not null. 4878b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 4888b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void gen_bitlen(s, desc) 4898b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project deflate_state *s; 4908b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project tree_desc *desc; /* the tree descriptor */ 4918b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{ 4928b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project ct_data *tree = desc->dyn_tree; 4938b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int max_code = desc->max_code; 4948b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project const ct_data *stree = desc->stat_desc->static_tree; 4958b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project const intf *extra = desc->stat_desc->extra_bits; 4968b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int base = desc->stat_desc->extra_base; 4978b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int max_length = desc->stat_desc->max_length; 4988b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int h; /* heap index */ 4998b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int n, m; /* iterate over the tree elements */ 5008b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int bits; /* bit length */ 5018b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int xbits; /* extra bits */ 5028b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project ush f; /* frequency */ 5038b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int overflow = 0; /* number of elements with bit length too large */ 5048b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 5058b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0; 5068b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 5078b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* In a first pass, compute the optimal bit lengths (which may 5088b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * overflow in the case of the bit length tree). 5098b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 5108b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */ 5118b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 5128b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (h = s->heap_max+1; h < HEAP_SIZE; h++) { 5138b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project n = s->heap[h]; 5148b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project bits = tree[tree[n].Dad].Len + 1; 5158b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (bits > max_length) bits = max_length, overflow++; 5168b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project tree[n].Len = (ush)bits; 5178b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* We overwrite tree[n].Dad which is no longer needed */ 5188b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 5198b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (n > max_code) continue; /* not a leaf node */ 5208b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 5218b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bl_count[bits]++; 5228b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project xbits = 0; 5238b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (n >= base) xbits = extra[n-base]; 5248b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project f = tree[n].Freq; 5258b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->opt_len += (ulg)f * (bits + xbits); 5268b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits); 5278b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 5288b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (overflow == 0) return; 5298b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 5308b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Trace((stderr,"\nbit length overflow\n")); 5318b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* This happens for example on obj2 and pic of the Calgary corpus */ 5328b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 5338b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Find the first bit length which could increase: */ 5348b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project do { 5358b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project bits = max_length-1; 5368b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project while (s->bl_count[bits] == 0) bits--; 5378b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bl_count[bits]--; /* move one leaf down the tree */ 5388b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bl_count[bits+1] += 2; /* move one overflow item as its brother */ 5398b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bl_count[max_length]--; 5408b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* The brother of the overflow item also moves one step up, 5418b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * but this does not affect bl_count[max_length] 5428b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 5438b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project overflow -= 2; 5448b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } while (overflow > 0); 5458b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 5468b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Now recompute all bit lengths, scanning in increasing frequency. 5478b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all 5488b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * lengths instead of fixing only the wrong ones. This idea is taken 5498b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * from 'ar' written by Haruhiko Okumura.) 5508b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 5518b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (bits = max_length; bits != 0; bits--) { 5528b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project n = s->bl_count[bits]; 5538b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project while (n != 0) { 5548b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project m = s->heap[--h]; 5558b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (m > max_code) continue; 5568b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if ((unsigned) tree[m].Len != (unsigned) bits) { 5578b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits)); 5588b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->opt_len += ((long)bits - (long)tree[m].Len) 5598b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project *(long)tree[m].Freq; 5608b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project tree[m].Len = (ush)bits; 5618b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 5628b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project n--; 5638b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 5648b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 5658b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project} 5668b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 5678b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 5688b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Generate the codes for a given tree and bit counts (which need not be 5698b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * optimal). 5708b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * IN assertion: the array bl_count contains the bit length statistics for 5718b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * the given tree and the field len is set for all tree elements. 5728b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * OUT assertion: the field code is set for all tree elements of non 5738b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * zero code length. 5748b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 5758b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void gen_codes (tree, max_code, bl_count) 5768b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project ct_data *tree; /* the tree to decorate */ 5778b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int max_code; /* largest code with non zero frequency */ 5788b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project ushf *bl_count; /* number of codes at each bit length */ 5798b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{ 5808b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project ush next_code[MAX_BITS+1]; /* next code value for each bit length */ 5818b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project ush code = 0; /* running code value */ 5828b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int bits; /* bit index */ 5838b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int n; /* code index */ 5848b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 5858b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* The distribution counts are first used to generate the code values 5868b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * without bit reversal. 5878b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 5888b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (bits = 1; bits <= MAX_BITS; bits++) { 5898b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project next_code[bits] = code = (code + bl_count[bits-1]) << 1; 5908b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 5918b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Check that the bit counts in bl_count are consistent. The last code 5928b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * must be all ones. 5938b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 5948b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1, 5958b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project "inconsistent bit counts"); 5968b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Tracev((stderr,"\ngen_codes: max_code %d ", max_code)); 5978b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 5988b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (n = 0; n <= max_code; n++) { 5998b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int len = tree[n].Len; 6008b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (len == 0) continue; 6018b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Now reverse the bits */ 6028b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project tree[n].Code = bi_reverse(next_code[len]++, len); 6038b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 6048b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ", 6058b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1)); 6068b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 6078b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project} 6088b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 6098b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 6108b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Construct one Huffman tree and assigns the code bit strings and lengths. 6118b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Update the total bit length for the current block. 6128b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * IN assertion: the field freq is set for all tree elements. 6138b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * OUT assertions: the fields len and code are set to the optimal bit length 6148b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * and corresponding code. The length opt_len is updated; static_len is 6158b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * also updated if stree is not null. The field max_code is set. 6168b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 6178b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void build_tree(s, desc) 6188b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project deflate_state *s; 6198b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project tree_desc *desc; /* the tree descriptor */ 6208b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{ 6218b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project ct_data *tree = desc->dyn_tree; 6228b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project const ct_data *stree = desc->stat_desc->static_tree; 6238b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int elems = desc->stat_desc->elems; 6248b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int n, m; /* iterate over heap elements */ 6258b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int max_code = -1; /* largest code with non zero frequency */ 6268b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int node; /* new node being created */ 6278b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 6288b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Construct the initial heap, with least frequent element in 6298b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1]. 6308b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * heap[0] is not used. 6318b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 6328b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->heap_len = 0, s->heap_max = HEAP_SIZE; 6338b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 6348b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (n = 0; n < elems; n++) { 6358b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (tree[n].Freq != 0) { 6368b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->heap[++(s->heap_len)] = max_code = n; 6378b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->depth[n] = 0; 6388b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } else { 6398b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project tree[n].Len = 0; 6408b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 6418b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 6428b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 6438b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* The pkzip format requires that at least one distance code exists, 6448b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * and that at least one bit should be sent even if there is only one 6458b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * possible code. So to avoid special checks later on we force at least 6468b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * two codes of non zero frequency. 6478b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 6488b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project while (s->heap_len < 2) { 6498b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); 6508b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project tree[node].Freq = 1; 6518b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->depth[node] = 0; 6528b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->opt_len--; if (stree) s->static_len -= stree[node].Len; 6538b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* node is 0 or 1 so it does not have extra bits */ 6548b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 6558b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project desc->max_code = max_code; 6568b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 6578b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree, 6588b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * establish sub-heaps of increasing lengths: 6598b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 6608b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n); 6618b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 6628b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Construct the Huffman tree by repeatedly combining the least two 6638b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * frequent nodes. 6648b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 6658b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project node = elems; /* next internal node of the tree */ 6668b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project do { 6678b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project pqremove(s, tree, n); /* n = node of least frequency */ 6688b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project m = s->heap[SMALLEST]; /* m = node of next least frequency */ 6698b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 6708b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */ 6718b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->heap[--(s->heap_max)] = m; 6728b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 6738b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Create a new node father of n and m */ 6748b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project tree[node].Freq = tree[n].Freq + tree[m].Freq; 6758b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->depth[node] = (uch)((s->depth[n] >= s->depth[m] ? 6768b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->depth[n] : s->depth[m]) + 1); 6778b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project tree[n].Dad = tree[m].Dad = (ush)node; 6788b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#ifdef DUMP_BL_TREE 6798b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (tree == s->bl_tree) { 6808b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project fprintf(stderr,"\nnode %d(%d), sons %d(%d) %d(%d)", 6818b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq); 6828b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 6838b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#endif 6848b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* and insert the new node in the heap */ 6858b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->heap[SMALLEST] = node++; 6868b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project pqdownheap(s, tree, SMALLEST); 6878b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 6888b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } while (s->heap_len >= 2); 6898b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 6908b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->heap[--(s->heap_max)] = s->heap[SMALLEST]; 6918b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 6928b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* At this point, the fields freq and dad are set. We can now 6938b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * generate the bit lengths. 6948b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 6958b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project gen_bitlen(s, (tree_desc *)desc); 6968b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 6978b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* The field len is now set, we can generate the bit codes */ 6988b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project gen_codes ((ct_data *)tree, max_code, s->bl_count); 6998b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project} 7008b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 7018b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 7028b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Scan a literal or distance tree to determine the frequencies of the codes 7038b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * in the bit length tree. 7048b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 7058b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void scan_tree (s, tree, max_code) 7068b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project deflate_state *s; 7078b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project ct_data *tree; /* the tree to be scanned */ 7088b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int max_code; /* and its largest code of non zero frequency */ 7098b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{ 7108b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int n; /* iterates over all tree elements */ 7118b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int prevlen = -1; /* last emitted length */ 7128b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int curlen; /* length of current code */ 7138b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int nextlen = tree[0].Len; /* length of next code */ 7148b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int count = 0; /* repeat count of the current code */ 7158b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int max_count = 7; /* max repeat count */ 7168b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int min_count = 4; /* min repeat count */ 7178b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 7188b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (nextlen == 0) max_count = 138, min_count = 3; 7198b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project tree[max_code+1].Len = (ush)0xffff; /* guard */ 7208b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 7218b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (n = 0; n <= max_code; n++) { 7228b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project curlen = nextlen; nextlen = tree[n+1].Len; 7238b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (++count < max_count && curlen == nextlen) { 7248b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project continue; 7258b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } else if (count < min_count) { 7268b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bl_tree[curlen].Freq += count; 7278b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } else if (curlen != 0) { 7288b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (curlen != prevlen) s->bl_tree[curlen].Freq++; 7298b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bl_tree[REP_3_6].Freq++; 7308b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } else if (count <= 10) { 7318b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bl_tree[REPZ_3_10].Freq++; 7328b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } else { 7338b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bl_tree[REPZ_11_138].Freq++; 7348b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 7358b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project count = 0; prevlen = curlen; 7368b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (nextlen == 0) { 7378b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project max_count = 138, min_count = 3; 7388b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } else if (curlen == nextlen) { 7398b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project max_count = 6, min_count = 3; 7408b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } else { 7418b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project max_count = 7, min_count = 4; 7428b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 7438b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 7448b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project} 7458b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 7468b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 7478b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Send a literal or distance tree in compressed form, using the codes in 7488b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * bl_tree. 7498b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 7508b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void send_tree (s, tree, max_code) 7518b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project deflate_state *s; 7528b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project ct_data *tree; /* the tree to be scanned */ 7538b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int max_code; /* and its largest code of non zero frequency */ 7548b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{ 7558b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int n; /* iterates over all tree elements */ 7568b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int prevlen = -1; /* last emitted length */ 7578b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int curlen; /* length of current code */ 7588b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int nextlen = tree[0].Len; /* length of next code */ 7598b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int count = 0; /* repeat count of the current code */ 7608b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int max_count = 7; /* max repeat count */ 7618b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int min_count = 4; /* min repeat count */ 7628b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 7638b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* tree[max_code+1].Len = -1; */ /* guard already set */ 7648b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (nextlen == 0) max_count = 138, min_count = 3; 7658b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 7668b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (n = 0; n <= max_code; n++) { 7678b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project curlen = nextlen; nextlen = tree[n+1].Len; 7688b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (++count < max_count && curlen == nextlen) { 7698b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project continue; 7708b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } else if (count < min_count) { 7718b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project do { send_code(s, curlen, s->bl_tree); } while (--count != 0); 7728b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 7738b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } else if (curlen != 0) { 7748b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (curlen != prevlen) { 7758b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project send_code(s, curlen, s->bl_tree); count--; 7768b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 7778b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Assert(count >= 3 && count <= 6, " 3_6?"); 7788b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project send_code(s, REP_3_6, s->bl_tree); send_bits(s, count-3, 2); 7798b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 7808b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } else if (count <= 10) { 7818b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project send_code(s, REPZ_3_10, s->bl_tree); send_bits(s, count-3, 3); 7828b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 7838b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } else { 7848b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project send_code(s, REPZ_11_138, s->bl_tree); send_bits(s, count-11, 7); 7858b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 7868b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project count = 0; prevlen = curlen; 7878b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (nextlen == 0) { 7888b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project max_count = 138, min_count = 3; 7898b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } else if (curlen == nextlen) { 7908b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project max_count = 6, min_count = 3; 7918b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } else { 7928b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project max_count = 7, min_count = 4; 7938b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 7948b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 7958b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project} 7968b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 7978b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 7988b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Construct the Huffman tree for the bit lengths and return the index in 7998b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * bl_order of the last bit length code to send. 8008b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 8018b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal int build_bl_tree(s) 8028b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project deflate_state *s; 8038b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{ 8048b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int max_blindex; /* index of last bit length code of non zero freq */ 8058b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 8068b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Determine the bit length frequencies for literal and distance trees */ 8078b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code); 8088b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); 8098b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 8108b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Build the bit length tree: */ 8118b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project build_tree(s, (tree_desc *)(&(s->bl_desc))); 8128b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* opt_len now includes the length of the tree representations, except 8138b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * the lengths of the bit lengths codes and the 5+5+4 bits for the counts. 8148b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 8158b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 8168b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Determine the number of bit length codes to send. The pkzip format 8178b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * requires that at least 4 bit length codes be sent. (appnote.txt says 8188b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * 3 but the actual value used is 4.) 8198b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 8208b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) { 8218b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (s->bl_tree[bl_order[max_blindex]].Len != 0) break; 8228b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 8238b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Update opt_len to include the bit length tree and counts */ 8248b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->opt_len += 3*(max_blindex+1) + 5+5+4; 8258b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld", 8268b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->opt_len, s->static_len)); 8278b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 8288b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project return max_blindex; 8298b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project} 8308b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 8318b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 8328b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Send the header for a block using dynamic Huffman trees: the counts, the 8338b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * lengths of the bit length codes, the literal tree and the distance tree. 8348b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4. 8358b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 8368b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void send_all_trees(s, lcodes, dcodes, blcodes) 8378b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project deflate_state *s; 8388b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int lcodes, dcodes, blcodes; /* number of codes for each tree */ 8398b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{ 8408b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int rank; /* index in bl_order */ 8418b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 8428b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); 8438b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, 8448b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project "too many codes"); 8458b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Tracev((stderr, "\nbl counts: ")); 8468b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */ 8478b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project send_bits(s, dcodes-1, 5); 8488b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */ 8498b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (rank = 0; rank < blcodes; rank++) { 8508b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Tracev((stderr, "\nbl code %2d ", bl_order[rank])); 8518b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project send_bits(s, s->bl_tree[bl_order[rank]].Len, 3); 8528b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 8538b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent)); 8548b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 8558b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */ 8568b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent)); 8578b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 8588b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ 8598b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent)); 8608b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project} 8618b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 8628b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 8638b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Send a stored block 8648b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 86517b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turnervoid ZLIB_INTERNAL _tr_stored_block(s, buf, stored_len, last) 8668b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project deflate_state *s; 8678b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project charf *buf; /* input block */ 8688b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project ulg stored_len; /* length of input block */ 86917b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner int last; /* one if this is the last block for a file */ 8708b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{ 87117b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner send_bits(s, (STORED_BLOCK<<1)+last, 3); /* send block type */ 8728b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#ifdef DEBUG 8738b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->compressed_len = (s->compressed_len + 3 + 7) & (ulg)~7L; 8748b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->compressed_len += (stored_len + 4) << 3; 8758b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#endif 8768b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project copy_block(s, buf, (unsigned)stored_len, 1); /* with header */ 8778b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project} 8788b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 8798b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 88017b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner * Flush the bits in the bit buffer to pending output (leaves at most 7 bits) 88117b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner */ 88217b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turnervoid ZLIB_INTERNAL _tr_flush_bits(s) 88317b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner deflate_state *s; 88417b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner{ 88517b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner bi_flush(s); 88617b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner} 88717b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner 88817b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner/* =========================================================================== 8898b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Send one empty static block to give enough lookahead for inflate. 8908b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * This takes 10 bits, of which 7 may remain in the bit buffer. 8918b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 89217b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turnervoid ZLIB_INTERNAL _tr_align(s) 8938b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project deflate_state *s; 8948b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{ 8958b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project send_bits(s, STATIC_TREES<<1, 3); 8968b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project send_code(s, END_BLOCK, static_ltree); 8978b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#ifdef DEBUG 8988b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->compressed_len += 10L; /* 3 for block type, 7 for EOB */ 8998b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#endif 9008b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project bi_flush(s); 9018b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project} 9028b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 9038b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 9048b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Determine the best encoding for the current block: dynamic trees, static 9058b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * trees or store, and output the encoded block to the zip file. 9068b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 90717b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turnervoid ZLIB_INTERNAL _tr_flush_block(s, buf, stored_len, last) 9088b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project deflate_state *s; 9098b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project charf *buf; /* input block, or NULL if too old */ 9108b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project ulg stored_len; /* length of input block */ 91117b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner int last; /* one if this is the last block for a file */ 9128b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{ 9138b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */ 9148b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int max_blindex = 0; /* index of last bit length code of non zero freq */ 9158b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 9168b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Build the Huffman trees unless a stored block is forced */ 9178b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (s->level > 0) { 9188b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 9198b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Check if the file is binary or text */ 92017b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner if (s->strm->data_type == Z_UNKNOWN) 92117b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner s->strm->data_type = detect_data_type(s); 9228b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 9238b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Construct the literal and distance trees */ 9248b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project build_tree(s, (tree_desc *)(&(s->l_desc))); 9258b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len, 9268b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->static_len)); 9278b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 9288b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project build_tree(s, (tree_desc *)(&(s->d_desc))); 9298b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len, 9308b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->static_len)); 9318b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* At this point, opt_len and static_len are the total bit lengths of 9328b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * the compressed block data, excluding the tree representations. 9338b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 9348b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 9358b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Build the bit length tree for the above two trees, and get the index 9368b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * in bl_order of the last bit length code to send. 9378b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 9388b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project max_blindex = build_bl_tree(s); 9398b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 9408b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Determine the best encoding. Compute the block lengths in bytes. */ 9418b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project opt_lenb = (s->opt_len+3+7)>>3; 9428b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project static_lenb = (s->static_len+3+7)>>3; 9438b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 9448b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Tracev((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u ", 9458b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len, 9468b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->last_lit)); 9478b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 9488b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (static_lenb <= opt_lenb) opt_lenb = static_lenb; 9498b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 9508b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } else { 9518b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Assert(buf != (char*)0, "lost buf"); 9528b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project opt_lenb = static_lenb = stored_len + 5; /* force a stored block */ 9538b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 9548b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 9558b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#ifdef FORCE_STORED 9568b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (buf != (char*)0) { /* force stored block */ 9578b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#else 9588b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (stored_len+4 <= opt_lenb && buf != (char*)0) { 9598b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* 4: two words for the lengths */ 9608b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#endif 9618b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE. 9628b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Otherwise we can't have processed more than WSIZE input bytes since 9638b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * the last block flush, because compression would have been 9648b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to 9658b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * transform a block into a stored block. 9668b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 96717b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner _tr_stored_block(s, buf, stored_len, last); 9688b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 9698b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#ifdef FORCE_STATIC 9708b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } else if (static_lenb >= 0) { /* force static trees */ 9718b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#else 9728b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } else if (s->strategy == Z_FIXED || static_lenb == opt_lenb) { 9738b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#endif 97417b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner send_bits(s, (STATIC_TREES<<1)+last, 3); 97517b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner compress_block(s, (const ct_data *)static_ltree, 97617b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner (const ct_data *)static_dtree); 9778b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#ifdef DEBUG 9788b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->compressed_len += 3 + s->static_len; 9798b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#endif 9808b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } else { 98117b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner send_bits(s, (DYN_TREES<<1)+last, 3); 9828b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1, 9838b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project max_blindex+1); 98417b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner compress_block(s, (const ct_data *)s->dyn_ltree, 98517b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner (const ct_data *)s->dyn_dtree); 9868b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#ifdef DEBUG 9878b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->compressed_len += 3 + s->opt_len; 9888b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#endif 9898b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 9908b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Assert (s->compressed_len == s->bits_sent, "bad compressed size"); 9918b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* The above check is made mod 2^32, for files larger than 512 MB 9928b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * and uLong implemented on 32 bits. 9938b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 9948b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project init_block(s); 9958b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 99617b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner if (last) { 9978b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project bi_windup(s); 9988b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#ifdef DEBUG 9998b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->compressed_len += 7; /* align on byte boundary */ 10008b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#endif 10018b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 10028b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Tracev((stderr,"\ncomprlen %lu(%lu) ", s->compressed_len>>3, 100317b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner s->compressed_len-7*last)); 10048b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project} 10058b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 10068b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 10078b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Save the match info and tally the frequency counts. Return true if 10088b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * the current block must be flushed. 10098b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 101017b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turnerint ZLIB_INTERNAL _tr_tally (s, dist, lc) 10118b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project deflate_state *s; 10128b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project unsigned dist; /* distance of matched string */ 10138b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */ 10148b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{ 10158b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->d_buf[s->last_lit] = (ush)dist; 10168b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->l_buf[s->last_lit++] = (uch)lc; 10178b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (dist == 0) { 10188b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* lc is the unmatched char */ 10198b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->dyn_ltree[lc].Freq++; 10208b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } else { 10218b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->matches++; 10228b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Here, lc is the match length - MIN_MATCH */ 10238b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project dist--; /* dist = match distance - 1 */ 10248b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Assert((ush)dist < (ush)MAX_DIST(s) && 10258b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && 10268b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match"); 10278b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 10288b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++; 10298b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->dyn_dtree[d_code(dist)].Freq++; 10308b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 10318b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 10328b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#ifdef TRUNCATE_BLOCK 10338b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Try to guess if it is profitable to stop the current block here */ 10348b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if ((s->last_lit & 0x1fff) == 0 && s->level > 2) { 10358b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Compute an upper bound for the compressed length */ 10368b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project ulg out_length = (ulg)s->last_lit*8L; 10378b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project ulg in_length = (ulg)((long)s->strstart - s->block_start); 10388b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int dcode; 10398b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project for (dcode = 0; dcode < D_CODES; dcode++) { 10408b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project out_length += (ulg)s->dyn_dtree[dcode].Freq * 10418b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project (5L+extra_dbits[dcode]); 10428b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 10438b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project out_length >>= 3; 10448b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Tracev((stderr,"\nlast_lit %u, in %ld, out ~%ld(%ld%%) ", 10458b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->last_lit, in_length, out_length, 10468b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 100L - out_length*100L/in_length)); 10478b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (s->matches < s->last_lit/2 && out_length < in_length/2) return 1; 10488b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 10498b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#endif 10508b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project return (s->last_lit == s->lit_bufsize-1); 10518b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* We avoid equality with lit_bufsize because of wraparound at 64K 10528b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * on 16 bit machines and because stored blocks are restricted to 10538b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * 64K-1 bytes. 10548b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 10558b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project} 10568b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 10578b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 10588b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Send the block data compressed using the given Huffman trees 10598b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 10608b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void compress_block(s, ltree, dtree) 10618b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project deflate_state *s; 106217b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner const ct_data *ltree; /* literal tree */ 106317b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner const ct_data *dtree; /* distance tree */ 10648b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{ 10658b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project unsigned dist; /* distance of matched string */ 10668b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int lc; /* match length or unmatched char (if dist == 0) */ 10678b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project unsigned lx = 0; /* running index in l_buf */ 10688b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project unsigned code; /* the code to send */ 10698b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int extra; /* number of extra bits to send */ 10708b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 10718b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (s->last_lit != 0) do { 10728b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project dist = s->d_buf[lx]; 10738b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project lc = s->l_buf[lx++]; 10748b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (dist == 0) { 10758b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project send_code(s, lc, ltree); /* send a literal byte */ 10768b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Tracecv(isgraph(lc), (stderr," '%c' ", lc)); 10778b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } else { 10788b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Here, lc is the match length - MIN_MATCH */ 10798b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project code = _length_code[lc]; 10808b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project send_code(s, code+LITERALS+1, ltree); /* send the length code */ 10818b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project extra = extra_lbits[code]; 10828b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (extra != 0) { 10838b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project lc -= base_length[code]; 10848b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project send_bits(s, lc, extra); /* send the extra length bits */ 10858b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 10868b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project dist--; /* dist is now the match distance - 1 */ 10878b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project code = d_code(dist); 10888b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Assert (code < D_CODES, "bad d_code"); 10898b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 10908b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project send_code(s, code, dtree); /* send the distance code */ 10918b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project extra = extra_dbits[code]; 10928b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (extra != 0) { 10938b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project dist -= base_dist[code]; 10948b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project send_bits(s, dist, extra); /* send the extra distance bits */ 10958b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 10968b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } /* literal or match pair ? */ 10978b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 10988b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */ 10998b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx, 11008b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project "pendingBuf overflow"); 11018b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 11028b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } while (lx < s->last_lit); 11038b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 11048b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project send_code(s, END_BLOCK, ltree); 11058b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project} 11068b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 11078b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 110817b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner * Check if the data type is TEXT or BINARY, using the following algorithm: 110917b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner * - TEXT if the two conditions below are satisfied: 111017b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner * a) There are no non-portable control characters belonging to the 111117b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner * "black list" (0..6, 14..25, 28..31). 111217b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner * b) There is at least one printable character belonging to the 111317b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner * "white list" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255). 111417b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner * - BINARY otherwise. 111517b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner * - The following partially-portable control characters form a 111617b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner * "gray list" that is ignored in this detection algorithm: 111717b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner * (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}). 11188b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * IN assertion: the fields Freq of dyn_ltree are set. 11198b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 112017b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turnerlocal int detect_data_type(s) 11218b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project deflate_state *s; 11228b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{ 112317b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner /* black_mask is the bit mask of black-listed bytes 112417b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner * set bits 0..6, 14..25, and 28..31 112517b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner * 0xf3ffc07f = binary 11110011111111111100000001111111 112617b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner */ 112717b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner unsigned long black_mask = 0xf3ffc07fUL; 11288b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int n; 11298b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 113017b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner /* Check for non-textual ("black-listed") bytes. */ 113117b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner for (n = 0; n <= 31; n++, black_mask >>= 1) 113217b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner if ((black_mask & 1) && (s->dyn_ltree[n].Freq != 0)) 113317b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner return Z_BINARY; 113417b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner 113517b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner /* Check for textual ("white-listed") bytes. */ 113617b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0 113717b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner || s->dyn_ltree[13].Freq != 0) 113817b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner return Z_TEXT; 113917b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner for (n = 32; n < LITERALS; n++) 11408b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (s->dyn_ltree[n].Freq != 0) 114117b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner return Z_TEXT; 114217b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner 114317b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner /* There are no "black-listed" or "white-listed" bytes: 114417b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner * this stream either is empty or has tolerated ("gray-listed") bytes only. 114517b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner */ 114617b20e6f38ad2263e47a6884c4f68ce9773d8b29David 'Digit' Turner return Z_BINARY; 11478b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project} 11488b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 11498b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 11508b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Reverse the first len bits of a code, using straightforward code (a faster 11518b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * method would use a table) 11528b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * IN assertion: 1 <= len <= 15 11538b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 11548b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal unsigned bi_reverse(code, len) 11558b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project unsigned code; /* the value to invert */ 11568b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int len; /* its bit length */ 11578b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{ 11588b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project register unsigned res = 0; 11598b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project do { 11608b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project res |= code & 1; 11618b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project code >>= 1, res <<= 1; 11628b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } while (--len > 0); 11638b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project return res >> 1; 11648b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project} 11658b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 11668b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 11678b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Flush the bit buffer, keeping at most 7 bits in it. 11688b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 11698b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void bi_flush(s) 11708b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project deflate_state *s; 11718b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{ 11728b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (s->bi_valid == 16) { 11738b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project put_short(s, s->bi_buf); 11748b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bi_buf = 0; 11758b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bi_valid = 0; 11768b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } else if (s->bi_valid >= 8) { 11778b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project put_byte(s, (Byte)s->bi_buf); 11788b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bi_buf >>= 8; 11798b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bi_valid -= 8; 11808b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 11818b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project} 11828b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 11838b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 11848b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Flush the bit buffer and align the output on a byte boundary 11858b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 11868b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void bi_windup(s) 11878b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project deflate_state *s; 11888b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{ 11898b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (s->bi_valid > 8) { 11908b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project put_short(s, s->bi_buf); 11918b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } else if (s->bi_valid > 0) { 11928b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project put_byte(s, (Byte)s->bi_buf); 11938b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 11948b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bi_buf = 0; 11958b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bi_valid = 0; 11968b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#ifdef DEBUG 11978b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bits_sent = (s->bits_sent+7) & ~7; 11988b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#endif 11998b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project} 12008b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 12018b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project/* =========================================================================== 12028b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * Copy a stored block, storing first the length and its 12038b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project * one's complement if requested. 12048b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project */ 12058b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Projectlocal void copy_block(s, buf, len, header) 12068b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project deflate_state *s; 12078b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project charf *buf; /* the input data */ 12088b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project unsigned len; /* its length */ 12098b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project int header; /* true if block header must be written */ 12108b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project{ 12118b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project bi_windup(s); /* align on byte boundary */ 12128b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project 12138b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project if (header) { 12148b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project put_short(s, (ush)len); 12158b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project put_short(s, (ush)~len); 12168b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#ifdef DEBUG 12178b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bits_sent += 2*16; 12188b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#endif 12198b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 12208b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#ifdef DEBUG 12218b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project s->bits_sent += (ulg)len<<3; 12228b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project#endif 12238b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project while (len--) { 12248b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project put_byte(s, *buf++); 12258b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project } 12268b23a6c7e1aee255004dd19098d4c2462b61b849The Android Open Source Project} 1227