HomeSort by: relevance | last modified time | path
    Searched defs:codes (Results 1 - 6 of 6) sorted by relevancy

  /src/common/dist/zlib/contrib/infback9/
inflate9.h 30 Read deflate codes:
43 code FAR *next; /* next available space in codes[] */
46 code codes[ENOUGH]; /* space for code tables */ member in struct:inflate_state
  /src/usr.sbin/gspa/gspa/
gsp_out.c 45 u_int16_t codes[5]; variable in typeref:typename:u_int16_t[5]
90 codes[code_idx] = v;
242 fprintf(listfile, " %.4X", codes[i]);
  /src/common/dist/zlib/contrib/puff/
puff.c 49 * - Fix fixed codes table error
63 * 1.8 9 Jan 2004 - Added some comments on no distance codes case
79 * 2.3 21 Jan 2013 - Check for invalid code length codes in dynamic blocks
92 #define MAXLCODES 286 /* maximum number of literal/length codes */
93 #define MAXDCODES 30 /* maximum number of distance codes */
94 #define MAXCODES (MAXLCODES+MAXDCODES) /* maximum codes lengths to read */
95 #define FIXLCODES 288 /* number of fixed literal/length codes */
219 * - The codes as stored in the compressed data are bit-reversed relative to
220 * a simple integer ordering of codes of the same lengths. Hence below the
226 * - The first code for the shortest length is all zeros. Subsequent codes o
436 local int codes(struct state *s, function in typeref:typename:local int
    [all...]
  /src/common/dist/zlib/
inflate.h 72 Read deflate codes in fixed or dynamic block:
110 code const FAR *lencode; /* starting table for length/literal codes */
111 code const FAR *distcode; /* starting table for distance codes */
119 code FAR *next; /* next available space in codes[] */
122 code codes[ENOUGH]; /* space for code tables */ member in struct:inflate_state
  /src/sys/dev/stbi/
stb_image.c 2222 // DEFLATE spec for generating codes
2370 if (z < 0) return e("bad huffman code","Corrupt PNG"); // error in huffman codes
4328 stbi_gif_lzw codes[4096]; member in struct:stbi_gif_struct
4428 if (g->codes[code].prefix >= 0)
4429 stbi_out_gif_code(g, g->codes[code].prefix);
4434 c = &g->color_table[g->codes[code].suffix * 4];
4472 g->codes[code].prefix = -1;
4473 g->codes[code].first = (uint8) code;
4474 g->codes[code].suffix = (uint8) code;
4512 p = &g->codes[avail++]
    [all...]
  /src/sys/net/
zlib.c 309 /* number of length codes, not counting the special END_BLOCK code */
315 /* number of Literal or Length codes, including the END_BLOCK code */
318 /* number of distance codes */
321 /* number of codes used to transfer the bit lengths */
327 /* All codes must not exceed MAX_BITS bits */
474 /* number of codes at each bit length for an optimal tree */
822 * output size for (length,distance) codes is <= 24 bits.
2017 /* Bit length codes must not exceed MAX_BL_BITS bits */
2042 /* The lengths of the bit length codes are sent in order of decreasing
2043 * probability, to avoid transmitting the lengths for unused bit length codes
3908 *codes; member in struct:inflate_blocks_state::__anon0201f1530a0a::__anon0201f1530c08
    [all...]

Completed in 18 milliseconds