Lines Matching refs:codes
1838 // skip 5 & 6 byte codes
1931 * Convert a string to a "binary string" : a string containing only char codes between 0 and 255.
3767 // skip 5 & 6 byte codes
3866 /* Return codes for the compression/decompression functions. Negative values
3967 /* Return codes for the compression/decompression functions. Negative values
4015 /* number of length codes, not counting the special END_BLOCK code */
4019 /* number of Literal or Length codes, including the END_BLOCK code */
4021 /* number of distance codes */
4023 /* number of codes used to transfer the bit lengths */
4027 /* All codes must not exceed MAX_BITS bits */
5132 /* number of codes at each bit length for an optimal tree */
5759 Decode literal, length, and distance codes and write out the resulting
5811 var lmask; /* mask for first level of length codes */
5812 var dmask; /* mask for first level of distance codes */
6106 /* Return codes for the compression/decompression functions. Negative values
6212 this.lencode = null; /* starting table for length/literal codes */
6213 this.distcode = null; /* starting table for distance codes */
6222 this.next = null; /* next available space in codes[] */
6229 as buffers so we don't need codes
6231 //this.codes = new utils.Buf32(ENOUGH); /* space for code tables */
6232 this.lendyn = null; /* dynamic table for length/literal codes (JS specific) */
6233 this.distdyn = null; /* dynamic table for distance codes (JS specific) */
6256 //state.lencode = state.distcode = state.next = state.codes;
6860 //Tracev((stderr, "inflate: fixed codes block%s\n",
6862 state.mode = LEN_; /* decode codes */
6872 //Tracev((stderr, "inflate: dynamic codes block%s\n",
6990 //state.next = state.codes;
7141 //state.distcode.copy(state.codes);
7156 //Tracev((stderr, 'inflate: codes ok\n'));
7597 var lbase = [ /* Length codes 257..285 base */
7602 var lext = [ /* Length codes 257..285 extra */
7607 var dbase = [ /* Distance codes 0..29 base */
7613 var dext = [ /* Distance codes 0..29 extra */
7619 module.exports = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts)
7630 var left = 0; /* number of prefix codes available */
7642 var count = new utils.Buf16(MAXBITS+1); //[MAXBITS+1]; /* number of codes of each length */
7651 code lengths are lens[0..codes-1]. Each length corresponds to the
7652 symbols 0..codes-1. The Huffman code is generated by first sorting the
7654 for codes with equal lengths. Then the code starts with all zero bits
7655 for the first code of the shortest length, and the codes are integer
7659 decoding tables are built in the large loop below, the integer codes
7667 The codes are sorted by computing a count of codes for each length,
7674 the minimum and maximum length codes, determining if there are any
7675 codes at all, checking for a valid set of lengths, and looking ahead
7680 /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
7684 for (sym = 0; sym < codes; sym++) {
7738 for (sym = 0; sym < codes; sym++) {
7748 bits off of the bottom. For codes where len is less than drop + curr,
7760 counts are used for this, and so count[] is decremented as codes are
7770 all codes of length max, i.e. all codes, have been processed. This
7771 routine permits incomplete codes, so another loop after this one fills
7811 /* process all codes and make table entries */
7967 /* number of length codes, not counting the special END_BLOCK code */
7973 /* number of Literal or Length codes, including the END_BLOCK code */
7976 /* number of distance codes */
7979 /* number of codes used to transfer the bit lengths */
7985 /* All codes must not exceed MAX_BITS bits */
7996 /* Bit length codes must not exceed MAX_BL_BITS bits */
8021 /* The lengths of the bit length codes are sent in order of decreasing
8022 * probability, to avoid transmitting the lengths for unused bit length codes.
8037 * need for the L_CODES extra codes used during heap construction. However
8038 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init
8044 /* The static distance tree. (Actually a trivial tree since all codes use
8050 /* Distance codes. The first 256 values correspond to the distances
8074 this.max_length = max_length; /* max bit length for the codes */
8266 * Generate the codes for a given tree and bit counts (which need not be
8276 // ushf *bl_count; /* number of codes at each bit length */
8318 /* number of codes at each bit length for an optimal tree */
8365 /* Construct the codes of the static literal tree */
8609 * two codes of non zero frequency.
8664 /* The field len is now set, we can generate the bit codes */
8670 * Scan a literal or distance tree to determine the frequencies of the codes
8736 * Send a literal or distance tree in compressed form, using the codes in
8820 * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.
8823 /* Determine the number of bit length codes to send. The pkzip format
8824 * requires that at least 4 bit length codes be sent. (appnote.txt says
8843 * lengths of the bit length codes, the literal tree and the distance tree.
8848 // int lcodes, dcodes, blcodes; /* number of codes for each tree */
8852 //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
8854 // "too many codes");