HomeSort by relevance Sort by last modified time
    Searched refs:huffman (Results 1 - 24 of 24) sorted by null

  /hardware/intel/common/libva/va/
va_enc_jpeg.h 79 * \brief huffman:
80 * 0 - arithmetic, 1 - huffman
82 unsigned int huffman : 1; member in struct:_VAEncPictureParameterBufferJPEG::__anon31290::__anon31291
va_trace.c     [all...]
  /external/zlib/src/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...]
  /external/zlib/src/contrib/blast/
blast.c 93 * Huffman code decoding tables. count[1..MAXBITS] is the number of symbols of
99 struct huffman { struct
105 * Decode a code from the stream s using huffman table h. Return the symbol or
125 local int decode(struct state *s, struct huffman *h)
175 * Huffman code for n symbols, construct the tables required to decode those
187 local int construct(struct huffman *h, const unsigned char *rep, int n)
250 * terminated by an end code. Literals are either Huffman coded or
291 static struct huffman litcode = {litcnt, litsym}; /* length code */
292 static struct huffman lencode = {lencnt, lensym}; /* length code */
293 static struct huffman distcode = {distcnt, distsym};/* distance code *
    [all...]
  /external/bzip2/
Android.mk 28 huffman.c \
Makefile 31 huffman.o \
119 huffman.o: huffman.c
120 $(CC) $(CFLAGS) -c huffman.c
146 $(DISTNAME)/huffman.c \
  /external/webp/src/
Android.mk 72 utils/huffman.c \
144 utils/huffman.c \
  /prebuilts/go/darwin-x86/src/image/jpeg/
huffman.go 11 // maxCodeLength is the maximum (inclusive) number of bits in a Huffman code.
14 // maxNCodes is the maximum (inclusive) number of codes in a Huffman tree.
17 // lutSize is the log-2 size of the Huffman decoder's look-up table.
20 // huffman is a Huffman decoder, specified in section C.
21 type huffman struct { type
42 // Huffman data.
43 var errShortHuffmanData = FormatError("short Huffman data")
89 // processDHT processes a Define Huffman Table marker, and initializes a huffman
    [all...]
scan.go 355 // Reset the Huffman decoder.
370 func (d *decoder) refine(b *block, h *huffman, zigStart, zigEnd, delta int32) error {
422 return FormatError("unexpected Huffman code")
reader.go 54 dhtMarker = 0xc4 // Define Huffman Table.
139 huff [maxTc + 1][maxTh + 1]huffman
167 // giving a byte of data back from d.bits to d.bytes. The Huffman look-up table
168 // requires at least 8 bits for look-up, which means that Huffman decoding can
199 // readByteStuffedByte is like readByte but is for byte-stuffed Huffman data.
  /prebuilts/go/linux-x86/src/image/jpeg/
huffman.go 11 // maxCodeLength is the maximum (inclusive) number of bits in a Huffman code.
14 // maxNCodes is the maximum (inclusive) number of codes in a Huffman tree.
17 // lutSize is the log-2 size of the Huffman decoder's look-up table.
20 // huffman is a Huffman decoder, specified in section C.
21 type huffman struct { type
42 // Huffman data.
43 var errShortHuffmanData = FormatError("short Huffman data")
89 // processDHT processes a Define Huffman Table marker, and initializes a huffman
    [all...]
scan.go 355 // Reset the Huffman decoder.
370 func (d *decoder) refine(b *block, h *huffman, zigStart, zigEnd, delta int32) error {
422 return FormatError("unexpected Huffman code")
reader.go 54 dhtMarker = 0xc4 // Define Huffman Table.
139 huff [maxTc + 1][maxTh + 1]huffman
167 // giving a byte of data back from d.bits to d.bytes. The Huffman look-up table
168 // requires at least 8 bits for look-up, which means that Huffman decoding can
199 // readByteStuffedByte is like readByte but is for byte-stuffed Huffman data.
  /prebuilts/go/darwin-x86/src/compress/gzip/
gunzip_test.go 26 { // has 1 empty fixed-huffman block
38 { // has 1 non-empty fixed huffman block
73 { // has a fixed huffman block with some length-distance pairs
89 { // has dynamic huffman blocks
227 { // has 1 non-empty fixed huffman block then garbage
241 { // has 1 non-empty fixed huffman block not enough header
255 { // has 1 non-empty fixed huffman block but corrupt checksum
269 { // has 1 non-empty fixed huffman block but corrupt size
  /prebuilts/go/linux-x86/src/compress/gzip/
gunzip_test.go 26 { // has 1 empty fixed-huffman block
38 { // has 1 non-empty fixed huffman block
73 { // has a fixed huffman block with some length-distance pairs
89 { // has dynamic huffman blocks
227 { // has 1 non-empty fixed huffman block then garbage
241 { // has 1 non-empty fixed huffman block not enough header
255 { // has 1 non-empty fixed huffman block but corrupt checksum
269 { // has 1 non-empty fixed huffman block but corrupt size
  /external/libvorbis/doc/
03-codebook.tex 10 decoding configuration, VQ and Huffman, into the bitstream itself in
13 Huffman-equivalent representation for decoding compressed codewords as
15 decoded Huffman value is applied as an offset, generating the final
198 \paragraph{Huffman decision tree representation}
201 \varname{[codebook_entries]} value uniquely define the Huffman decision
206 lowest valued unused binary Huffman codeword possible. Assume the
243 It is clear that the codeword length list represents a Huffman
249 \captionof{figure}{huffman tree illustration}
256 Note that it's possible to underspecify or overspecify a Huffman tree
262 \captionof{figure}{underspecified huffman tree illustration
    [all...]
  /hardware/intel/img/psb_video/src/
pnw_jpeg.c 341 ((pBuffer->pic_flags).bits.huffman != 1) || /* Only "1 - huffman" is supported */
tng_jpegES.c 120 /* Definitions for the huffman table specification in the Marker segment */
192 /* Specifies the huffman table used for encoding the luminance DC */
210 /* Specifies the huffman table used for encoding the luminance AC */
240 /* Specifies the huffman table used for encoding the chrominance DC */
259 /* Specifies the huffman table used for encoding the chrominance AC */
680 /* Writing the huffman tables for luminance dc coeffs */
687 /* Writing the huffman tables for luminance ac coeffs *
    [all...]
  /prebuilts/go/darwin-x86/src/compress/flate/
inflate.go 19 maxCodeLen = 16 // max length of Huffman code
26 numCodes = 19 // number of codes in Huffman meta-code
72 // fixed huffman tables so they can be included statically.
74 // The data structure for decoding Huffman tables is based on that of
83 // filled. Since the extra bits are zero, and the DEFLATE Huffman codes
105 // Initialize Huffman decoding tables from array of code lengths.
111 // Sanity enables additional runtime tests during Huffman
271 // Huffman decoders for literal/length, distance.
274 // Length arrays used to define Huffman codes.
321 // compressed, fixed Huffman table
    [all...]
huffman_bit_writer.go 294 // Write the header of a dynamic Huffman block to the output stream.
362 // Indicate that we are a fixed Huffman block
409 // we should count at least one offset to be sure that the offset huffman tree could be encoded.
440 // Fixed Huffman baseline.
448 // Dynamic Huffman?
482 // Huffman.
  /prebuilts/go/linux-x86/src/compress/flate/
inflate.go 19 maxCodeLen = 16 // max length of Huffman code
26 numCodes = 19 // number of codes in Huffman meta-code
72 // fixed huffman tables so they can be included statically.
74 // The data structure for decoding Huffman tables is based on that of
83 // filled. Since the extra bits are zero, and the DEFLATE Huffman codes
105 // Initialize Huffman decoding tables from array of code lengths.
111 // Sanity enables additional runtime tests during Huffman
271 // Huffman decoders for literal/length, distance.
274 // Length arrays used to define Huffman codes.
321 // compressed, fixed Huffman table
    [all...]
huffman_bit_writer.go 294 // Write the header of a dynamic Huffman block to the output stream.
362 // Indicate that we are a fixed Huffman block
409 // we should count at least one offset to be sure that the offset huffman tree could be encoded.
440 // Fixed Huffman baseline.
448 // Dynamic Huffman?
482 // Huffman.
  /prebuilts/go/darwin-x86/src/syscall/
unzip_nacl.go 13 maxCodeLen = 16 // max length of Huffman code
17 numCodes = 19 // number of codes in Huffman meta-code
29 bits [maxLit + maxDist]int // lengths defining Huffman codes
48 // compressed, fixed Huffman tables
51 // compressed, dynamic Huffman tables
63 // Compression with dynamic Huffman codes
102 // using the code length Huffman code.
163 // Decode a single Huffman block from f.
164 // hl and hd are the Huffman states for the lit/length values
166 // fixed distance encoding associated with fixed Huffman blocks
    [all...]
  /prebuilts/go/linux-x86/src/syscall/
unzip_nacl.go 13 maxCodeLen = 16 // max length of Huffman code
17 numCodes = 19 // number of codes in Huffman meta-code
29 bits [maxLit + maxDist]int // lengths defining Huffman codes
48 // compressed, fixed Huffman tables
51 // compressed, dynamic Huffman tables
63 // Compression with dynamic Huffman codes
102 // using the code length Huffman code.
163 // Decode a single Huffman block from f.
164 // hl and hd are the Huffman states for the lit/length values
166 // fixed distance encoding associated with fixed Huffman blocks
    [all...]

Completed in 1654 milliseconds