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

  /src/common/dist/zlib/contrib/blast/
blast.c 97 * Huffman code decoding tables. count[1..MAXBITS] is the number of symbols of
103 struct huffman { struct
109 * Decode a code from the stream s using huffman table h. Return the symbol or
129 local int decode(struct state *s, struct huffman *h)
179 * Huffman code for n symbols, construct the tables required to decode those
191 local int construct(struct huffman *h, const unsigned char *rep, int n)
254 * terminated by an end code. Literals are either Huffman coded or
295 static struct huffman litcode = {litcnt, litsym}; /* length code */
296 static struct huffman lencode = {lencnt, lensym}; /* length code */
297 static struct huffman distcode = {distcnt, distsym};/* distance code *
    [all...]
  /src/common/dist/zlib/contrib/puff/
puff.c 38 * - Remove longest from struct huffman -- not needed
200 * Huffman code decoding tables. count[1..MAXBITS] is the number of symbols of
206 struct huffman { struct
212 * Decode a code from the stream s using huffman table h. Return the symbol or
235 local int decode(struct state *s, const struct huffman *h)
263 local int decode(struct state *s, const struct huffman *h)
310 * Huffman code for n symbols, construct the tables required to decode those
340 local int construct(struct huffman *h, const short *length, int n)
388 * pairs terminated by and end-of-block code. Literals are simply Huffman
437 const struct huffman *lencode
    [all...]
  /src/external/gpl3/binutils/dist/zlib/contrib/blast/
blast.c 97 * Huffman code decoding tables. count[1..MAXBITS] is the number of symbols of
103 struct huffman { struct
109 * Decode a code from the stream s using huffman table h. Return the symbol or
129 local int decode(struct state *s, struct huffman *h)
179 * Huffman code for n symbols, construct the tables required to decode those
191 local int construct(struct huffman *h, const unsigned char *rep, int n)
254 * terminated by an end code. Literals are either Huffman coded or
295 static struct huffman litcode = {litcnt, litsym}; /* length code */
296 static struct huffman lencode = {lencnt, lensym}; /* length code */
297 static struct huffman distcode = {distcnt, distsym};/* distance code *
    [all...]
  /src/external/gpl3/binutils/dist/zlib/contrib/puff/
puff.c 38 * - Remove longest from struct huffman -- not needed
200 * Huffman code decoding tables. count[1..MAXBITS] is the number of symbols of
206 struct huffman { struct
212 * Decode a code from the stream s using huffman table h. Return the symbol or
235 local int decode(struct state *s, const struct huffman *h)
263 local int decode(struct state *s, const struct huffman *h)
310 * Huffman code for n symbols, construct the tables required to decode those
340 local int construct(struct huffman *h, const short *length, int n)
388 * pairs terminated by and end-of-block code. Literals are simply Huffman
437 const struct huffman *lencode
    [all...]
  /src/external/gpl3/binutils.old/dist/zlib/contrib/blast/
blast.c 97 * Huffman code decoding tables. count[1..MAXBITS] is the number of symbols of
103 struct huffman { struct
109 * Decode a code from the stream s using huffman table h. Return the symbol or
129 local int decode(struct state *s, struct huffman *h)
179 * Huffman code for n symbols, construct the tables required to decode those
191 local int construct(struct huffman *h, const unsigned char *rep, int n)
254 * terminated by an end code. Literals are either Huffman coded or
295 static struct huffman litcode = {litcnt, litsym}; /* length code */
296 static struct huffman lencode = {lencnt, lensym}; /* length code */
297 static struct huffman distcode = {distcnt, distsym};/* distance code *
    [all...]
  /src/external/gpl3/binutils.old/dist/zlib/contrib/puff/
puff.c 38 * - Remove longest from struct huffman -- not needed
200 * Huffman code decoding tables. count[1..MAXBITS] is the number of symbols of
206 struct huffman { struct
212 * Decode a code from the stream s using huffman table h. Return the symbol or
235 local int decode(struct state *s, const struct huffman *h)
263 local int decode(struct state *s, const struct huffman *h)
310 * Huffman code for n symbols, construct the tables required to decode those
340 local int construct(struct huffman *h, const short *length, int n)
388 * pairs terminated by and end-of-block code. Literals are simply Huffman
437 const struct huffman *lencode
    [all...]
  /src/external/gpl3/gdb/dist/zlib/contrib/blast/
blast.c 97 * Huffman code decoding tables. count[1..MAXBITS] is the number of symbols of
103 struct huffman { struct
109 * Decode a code from the stream s using huffman table h. Return the symbol or
129 local int decode(struct state *s, struct huffman *h)
179 * Huffman code for n symbols, construct the tables required to decode those
191 local int construct(struct huffman *h, const unsigned char *rep, int n)
254 * terminated by an end code. Literals are either Huffman coded or
295 static struct huffman litcode = {litcnt, litsym}; /* length code */
296 static struct huffman lencode = {lencnt, lensym}; /* length code */
297 static struct huffman distcode = {distcnt, distsym};/* distance code *
    [all...]
  /src/external/gpl3/gdb.old/dist/zlib/contrib/blast/
blast.c 97 * Huffman code decoding tables. count[1..MAXBITS] is the number of symbols of
103 struct huffman { struct
109 * Decode a code from the stream s using huffman table h. Return the symbol or
129 local int decode(struct state *s, struct huffman *h)
179 * Huffman code for n symbols, construct the tables required to decode those
191 local int construct(struct huffman *h, const unsigned char *rep, int n)
254 * terminated by an end code. Literals are either Huffman coded or
295 static struct huffman litcode = {litcnt, litsym}; /* length code */
296 static struct huffman lencode = {lencnt, lensym}; /* length code */
297 static struct huffman distcode = {distcnt, distsym};/* distance code *
    [all...]
  /src/external/gpl3/gdb.old/dist/zlib/contrib/puff/
puff.c 38 * - Remove longest from struct huffman -- not needed
200 * Huffman code decoding tables. count[1..MAXBITS] is the number of symbols of
206 struct huffman { struct
212 * Decode a code from the stream s using huffman table h. Return the symbol or
235 local int decode(struct state *s, const struct huffman *h)
263 local int decode(struct state *s, const struct huffman *h)
310 * Huffman code for n symbols, construct the tables required to decode those
340 local int construct(struct huffman *h, const short *length, int n)
388 * pairs terminated by and end-of-block code. Literals are simply Huffman
437 const struct huffman *lencode
    [all...]
  /src/external/gpl3/gdb/dist/zlib/contrib/puff/
puff.c 38 * - Remove longest from struct huffman -- not needed
200 * Huffman code decoding tables. count[1..MAXBITS] is the number of symbols of
206 struct huffman { struct
212 * Decode a code from the stream s using huffman table h. Return the symbol or
235 local int decode(struct state *s, const struct huffman *h)
263 local int decode(struct state *s, const struct huffman *h)
310 * Huffman code for n symbols, construct the tables required to decode those
340 local int construct(struct huffman *h, const short *length, int n)
388 * pairs terminated by and end-of-block code. Literals are simply Huffman
437 const struct huffman *lencode
    [all...]
  /src/external/bsd/libarchive/dist/libarchive/
archive_read_support_format_cab.c 107 * Huffman coding.
109 struct huffman { struct in struct:lzx_dec
115 * Use a index table. It's faster than searching a huffman
342 static int lzx_read_bitlen(struct lzx_stream *, struct huffman *, int);
343 static int lzx_huffman_init(struct huffman *, size_t, int);
344 static void lzx_huffman_free(struct huffman *);
345 static int lzx_make_huffman_table(struct huffman *);
346 static inline int lzx_decode_huffman(struct huffman *, unsigned);
2752 struct huffman *at = &(ds->at), *lt = &(ds->lt), *mt = &(ds->mt);
3047 lzx_read_bitlen(struct lzx_stream *strm, struct huffman *d, int end
    [all...]
archive_read_support_format_lha.c 100 * Huffman coding.
102 struct huffman { struct in struct:lzh_dec
110 * Use a index table. It's faster than searching a huffman
248 static int lzh_huffman_init(struct huffman *, size_t, int);
249 static void lzh_huffman_free(struct huffman *);
251 static int lzh_make_fake_table(struct huffman *, uint16_t);
252 static int lzh_make_huffman_table(struct huffman *);
253 static inline int lzh_decode_huffman(struct huffman *, unsigned);
254 static int lzh_decode_huffman_tree(struct huffman *, unsigned, int);
2128 * Read a literal table compressed in huffman
    [all...]
  /src/sys/dev/stbi/
stb_image.c 1099 // - fast huffman; reasonable integer IDCT
1108 // huffman decoding acceleration
1120 } huffman; typedef in typeref:struct:__anon3675
1128 huffman huff_dc[4];
1129 huffman huff_ac[4];
1161 static int build_huffman(huffman *h, int *count)
1222 // decode a jpeg huffman value from the bitstream
1223 __forceinline static int decode(jpeg *j, huffman *h)
1262 // convert the huffman code to the symbol id
1317 static int decode_block(jpeg *j, short data[64], huffman *hdc, huffman *hac, int b
    [all...]

Completed in 35 milliseconds