Searched defs:code (Results 1 - 5 of 5) sorted by relevance

/lib/zlib_inflate/
H A Dinftrees.h15 information needed to do the operation requested by the code that
17 table that indexes more bits of the code. op indicates whether
19 distance, an end-of-block, or an invalid code. For a table
22 is the number of extra bits to get after the code. bits is
23 the number of bits in this code or part of the code to drop off
29 unsigned char bits; /* bits in this part of the code */
30 unsigned short val; /* offset in table or code value */
31 } code; typedef in typeref:struct:__anon31
38 01000000 - invalid code
[all...]
/lib/zlib_deflate/
H A Ddeftree.c13 * Each code tree is stored in a compressed form which is itself
14 * a Huffman encoding of the lengths of all the code strings (in
15 * ascending order by source values). The actual code strings are
52 /* end of block literal code */
63 static const int extra_lbits[LENGTH_CODES] /* extra bits for each length code */
66 static const int extra_dbits[D_CODES] /* extra bits for each distance code */
69 static const int extra_blbits[BL_CODES]/* extra bits for each bit length code */
106 /* length code for each normalized match length (0 == MIN_MATCH) */
109 /* First normalized length for each code (0 = MIN_MATCH) */
112 /* First normalized distance for each code (
231 int code; /* code value */ local
502 ush code = 0; /* running code value */ local
1027 unsigned code; /* the code to send */ local
[all...]
H A Ddefutil.h13 /* number of length codes, not counting the special END_BLOCK code */
19 /* number of Literal or Length codes, including the END_BLOCK code */
39 /* Data structure describing a single value and its code string. */
43 ush code; /* bit string */ member in union:ct_data_s::__anon28
52 #define Code fc.code
60 int max_code; /* largest code with non zero frequency */
205 * example a binary file with poorly compressible code followed by
215 /* Buffer for distances. To simplify the code, d_buf and l_buf have
224 int last_eob_len; /* bit length of EOB code for last block */
271 /* In order to simplify the code, particularl
300 bi_reverse(unsigned code, int len) argument
[all...]
/lib/
H A Ddecompress_unlzma.c73 uint32_t code; member in struct:rc
114 rc->code = 0;
125 rc->code = (rc->code << 8) | *rc->ptr++;
136 rc->code = (rc->code << 8) | *rc->ptr++;
146 *Because we want to always expose (rc->code < rc->bound) to optimizer
157 return rc->code < t;
169 rc->code -= rc->bound;
192 if (rc->code >
[all...]
/lib/xz/
H A Dxz_dec_lzma2.c97 uint32_t code; member in struct:rc_dec
255 * The order below is important on x86 to reduce code size and
441 rc->code = 0;
446 * Read the first five initial bytes into rc->code if they haven't been
455 rc->code = (rc->code << 8) + b->in[b->in_pos++];
474 return rc->code == 0;
482 rc->code = (rc->code << RC_SHIFT_BITS) + rc->in[rc->in_pos++];
491 * on x86). Using a non-splitted version results in nicer looking code to
[all...]

Completed in 94 milliseconds