Home
last modified time | relevance | path

Searched refs:Huffman (Results 1 – 25 of 92) sorted by relevance

1234

/third_party/flutter/skia/third_party/externals/wuffs/test/data/artificial/
Ddeflate-degenerate-huffman-unused.deflate.commentary.txt5 000000 0x0000 . 0x05 0b_...._.101 Dynamic Huffman block, final
11 Decode the H-CL Huffman table (NumCLCodeLengths = 18). Recall the peculiar
22 The H-CL Huffman table is:
28 Decode the H-L Huffman table (NumLCodes = 257):
46 The H-L Huffman table is:
51 Decode the H-D Huffman table (NumDCodes = 1):
55 The H-D Huffman table is:
Ddeflate-backref-crosses-blocks.deflate.commentary.txt15 The fixed Huffman block contains a back-reference (into the previous block)
19 000009 0x0009 . 0x03 0b_...._.011 Fixed Huffman block, final
Ddeflate-distance-code-31.deflate.commentary.txt5 000000 0x0000 . 0x03 0b_...._.011 Fixed Huffman block, final
Ddeflate-distance-code-31.deflate.make-artificial.txt5 # RFC 1951 section 3.2.6 says that for fixed Huffman codes, "distance codes
/third_party/flutter/skia/third_party/externals/wuffs/std/deflate/
Ddecode_deflate.wuffs15 pub status "#bad Huffman code (over-subscribed)"
16 pub status "#bad Huffman code (under-subscribed)"
17 pub status "#bad Huffman code length count"
18 pub status "#bad Huffman code length repetition"
19 pub status "#bad Huffman code"
20 pub status "#bad Huffman minimum code length"
27 pub status "#no Huffman codes"
29 pri status "#internal error: inconsistent Huffman decoder state"
83 // huffs and n_huffs_bits are the lookup tables for Huffman decodings.
85 // There are up to 2 Huffman decoders active at any one time. As per this
[all …]
DREADME.md3 Deflate is a general purpose compression format, using Huffman codes and
111 a block that's compressed with dynamic Huffman codes.
113 There are 3 block types: uncompressed, compressed with fixed Huffman codes and
114 compressed with dynamic Huffman codes. The first type is straightforward:
121 ## Dynamic Huffman Blocks
130 As per the RFC section 3.2.7. Compression with dynamic Huffman codes, three
208 4-bit code and 2 5-bit codes. The canonical Huffman encoding's map from bits to
223 Call that Huffman table `H-CL`.
239 When decoding via a Huffman table, bits are read in LSB to MSB order,
305 12 9-bit codes. The canonical Huffman encoding's map from bits to `lcode`
[all …]
Ddecode_huffman_slow.wuffs106 return "#internal error: inconsistent Huffman decoder state"
108 return "#bad Huffman code"
110 return "#internal error: inconsistent Huffman decoder state"
114 return "#bad Huffman code"
116 return "#internal error: inconsistent Huffman decoder state"
177 return "#bad Huffman code"
179 return "#internal error: inconsistent Huffman decoder state"
Ddecode_huffman_fast.wuffs149 return "#internal error: inconsistent Huffman decoder state"
151 return "#bad Huffman code"
153 return "#internal error: inconsistent Huffman decoder state"
160 return "#bad Huffman code"
162 return "#internal error: inconsistent Huffman decoder state"
254 return "#bad Huffman code"
256 return "#internal error: inconsistent Huffman decoder state"
/third_party/flutter/skia/third_party/externals/spirv-tools/test/
Dhuffman_codec.cpp70 TEST(Huffman, PrintTree) { in TEST() argument
96 TEST(Huffman, PrintTable) { in TEST() argument
122 TEST(Huffman, TestValidity) { in TEST() argument
142 TEST(Huffman, TestEncode) { in TEST() argument
163 TEST(Huffman, TestDecode) { in TEST() argument
190 TEST(Huffman, TestDecodeNumbers) { in TEST() argument
/third_party/boost/tools/boost_install/test/iostreams/zlib-1.2.11/doc/
Drfc1951.txt43 compresses data using a combination of the LZ77 algorithm and Huffman
77 3.2.1. Synopsis of prefix and Huffman coding ............... 6
78 3.2.2. Use of Huffman coding in the "deflate" format ....... 7
82 3.2.6. Compression with fixed Huffman codes (BTYPE=01) .... 12
83 3.2.7. Compression with dynamic Huffman codes (BTYPE=10) .. 13
146 representations. Familiarity with the technique of Huffman coding
194 and Huffman coding. The Huffman trees for each block are independent
199 Each block consists of two parts: a pair of Huffman code trees that
201 compressed data part. (The Huffman trees themselves are compressed
202 using Huffman encoding.) The compressed data consists of a series of
[all …]
Dalgorithm.txt13 Literals or match lengths are compressed with one Huffman tree, and
28 favor small distances and thus take advantage of the Huffman encoding.
62 The key question is how to represent a Huffman code (or any prefix code) so
95 looks like. You are correct that it's not a Huffman tree. It is simply a
96 lookup table for the first, let's say, nine bits of a Huffman symbol. The
124 that's essentially a Huffman tree. But then you spend too much time
183 compared to 16 entries for a Huffman tree (six two entry tables and one four
187 Huffman tree.
/third_party/zlib/doc/
Drfc1951.txt43 compresses data using a combination of the LZ77 algorithm and Huffman
77 3.2.1. Synopsis of prefix and Huffman coding ............... 6
78 3.2.2. Use of Huffman coding in the "deflate" format ....... 7
82 3.2.6. Compression with fixed Huffman codes (BTYPE=01) .... 12
83 3.2.7. Compression with dynamic Huffman codes (BTYPE=10) .. 13
146 representations. Familiarity with the technique of Huffman coding
194 and Huffman coding. The Huffman trees for each block are independent
199 Each block consists of two parts: a pair of Huffman code trees that
201 compressed data part. (The Huffman trees themselves are compressed
202 using Huffman encoding.) The compressed data consists of a series of
[all …]
Dalgorithm.txt13 Literals or match lengths are compressed with one Huffman tree, and
28 favor small distances and thus take advantage of the Huffman encoding.
62 The key question is how to represent a Huffman code (or any prefix code) so
95 looks like. You are correct that it's not a Huffman tree. It is simply a
96 lookup table for the first, let's say, nine bits of a Huffman symbol. The
124 that's essentially a Huffman tree. But then you spend too much time
183 compared to 16 entries for a Huffman tree (six two entry tables and one four
187 Huffman tree.
/third_party/boost/libs/beast/test/extern/zlib-1.2.11/doc/
Drfc1951.txt43 compresses data using a combination of the LZ77 algorithm and Huffman
77 3.2.1. Synopsis of prefix and Huffman coding ............... 6
78 3.2.2. Use of Huffman coding in the "deflate" format ....... 7
82 3.2.6. Compression with fixed Huffman codes (BTYPE=01) .... 12
83 3.2.7. Compression with dynamic Huffman codes (BTYPE=10) .. 13
146 representations. Familiarity with the technique of Huffman coding
194 and Huffman coding. The Huffman trees for each block are independent
199 Each block consists of two parts: a pair of Huffman code trees that
201 compressed data part. (The Huffman trees themselves are compressed
202 using Huffman encoding.) The compressed data consists of a series of
[all …]
Dalgorithm.txt13 Literals or match lengths are compressed with one Huffman tree, and
28 favor small distances and thus take advantage of the Huffman encoding.
62 The key question is how to represent a Huffman code (or any prefix code) so
95 looks like. You are correct that it's not a Huffman tree. It is simply a
96 lookup table for the first, let's say, nine bits of a Huffman symbol. The
124 that's essentially a Huffman tree. But then you spend too much time
183 compared to 16 entries for a Huffman tree (six two entry tables and one four
187 Huffman tree.
/third_party/skia/third_party/externals/brotli/csharp/org/brotli/dec/
DHuffmanTreeGroup.cs31 group.codes = new int[n * Org.Brotli.Dec.Huffman.HuffmanMaxTableSize]; in Init()
46 next += Org.Brotli.Dec.Huffman.HuffmanMaxTableSize; in Decode()
DState.cs18 internal readonly int[] blockTypeTrees = new int[3 * Org.Brotli.Dec.Huffman.HuffmanMaxTableSize];
20 internal readonly int[] blockLenTrees = new int[3 * Org.Brotli.Dec.Huffman.HuffmanMaxTableSize];
DDecode.cs188 Org.Brotli.Dec.Huffman.BuildHuffmanTable(table, 0, 5, codeLengthCodeLengths, CodeLengthCodes); in ReadHuffmanCodeLengths()
346 …Org.Brotli.Dec.Huffman.BuildHuffmanTable(table, offset, HuffmanTableBits, codeLengths, alphabetSiz… in ReadHuffmanCode()
364 int[] table = new int[Org.Brotli.Dec.Huffman.HuffmanMaxTableSize]; in DecodeContextMap()
410 …int blockType = ReadSymbol(state.blockTypeTrees, treeType * Org.Brotli.Dec.Huffman.HuffmanMaxTable… in DecodeBlockTypeAndLength()
411 …eeType] = ReadBlockLength(state.blockLenTrees, treeType * Org.Brotli.Dec.Huffman.HuffmanMaxTableSi… in DecodeBlockTypeAndLength()
555 …ReadHuffmanCode(state.numBlockTypes[i] + 2, state.blockTypeTrees, i * Org.Brotli.Dec.Huffman.Huffm… in ReadMetablockHuffmanCodesAndContextMaps()
556 …ReadHuffmanCode(NumBlockLengthCodes, state.blockLenTrees, i * Org.Brotli.Dec.Huffman.HuffmanMaxTab… in ReadMetablockHuffmanCodesAndContextMaps()
557 …state.blockLength[i] = ReadBlockLength(state.blockLenTrees, i * Org.Brotli.Dec.Huffman.HuffmanMaxT… in ReadMetablockHuffmanCodesAndContextMaps()
/third_party/skia/third_party/externals/libjpeg-turbo/
DChangeLog.md14 3. Fixed an issue in the Arm Neon SIMD Huffman encoders that caused the
26 result in an error ("Missing Huffman code table entry") and an invalid JPEG
59 1. The build system, x86-64 SIMD extensions, and accelerated Huffman codec now
99 5. The SSE2 (x86 SIMD) and C Huffman encoding algorithms have been
103 0-23% on platforms that do not have a SIMD-accelerated Huffman encoding
107 progressive Huffman-encoded JPEG images has been improved in the following
122 7. Added SIMD acceleration for progressive Huffman encoding on Arm platforms.
182 - 64-bit Huffman encoding
290 legitimate JPEG compressor) could cause the Huffman encoder's local buffer to
332 error ("Missing Huffman code table entry") and an invalid JPEG image.
[all …]
/third_party/flutter/skia/third_party/externals/libjpeg-turbo/
DChangeLog.md64 9. Fixed a signed integer overflow in the progressive Huffman decoder, detected
205 15. Added SIMD acceleration for progressive Huffman encoding on SSE2-capable
423 path" of libjpeg-turbo's Huffman decoder to read from uninitialized memory.
446 5. Fixed an issue in the ARM 32-bit SIMD-accelerated Huffman encoder that
506 allows the Huffman codec to determine the word size at compile time. Since
521 12. Added SIMD acceleration for Huffman encoding on SSE2-capable x86 and x86-64
526 when compiling the C version of the Huffman encoder
528 benchmarking or regression testing, SIMD-accelerated Huffman encoding can be
538 14. Added SIMD acceleration for Huffman encoding on NEON-capable ARM 32-bit
546 the C Huffman encoder as well as GCC does.
[all …]
/third_party/libjpeg-turbo/
DChangeLog.md81 legitimate JPEG compressor) could cause the Huffman encoder's local buffer to
123 error ("Missing Huffman code table entry") and an invalid JPEG image.
256 9. Fixed a signed integer overflow in the progressive Huffman decoder, detected
388 15. Added SIMD acceleration for progressive Huffman encoding on SSE2-capable
606 path" of libjpeg-turbo's Huffman decoder to read from uninitialized memory.
629 5. Fixed an issue in the ARM 32-bit SIMD-accelerated Huffman encoder that
689 allows the Huffman codec to determine the word size at compile time. Since
704 12. Added SIMD acceleration for Huffman encoding on SSE2-capable x86 and x86-64
709 when compiling the C version of the Huffman encoder
711 benchmarking or regression testing, SIMD-accelerated Huffman encoding can be
[all …]
/third_party/skia/third_party/externals/brotli/
DREADME4 using a combination of a modern variant of the LZ77 algorithm, Huffman coding
/third_party/libjpeg-turbo/simd/x86_64/
Djchuff-sse2.asm2 ; jchuff-sse2.asm - Huffman entropy encoding (64-bit SSE2)
17 ; This file contains an SSE2 implementation for Huffman coding of one block.
225 ; Emit the Huffman-coded symbol for the number of bits
299 ; Emit Huffman symbol for run length / number of bits
/third_party/flutter/skia/third_party/externals/libjpeg-turbo/simd/x86_64/
Djchuff-sse2.asm2 ; jchuff-sse2.asm - Huffman entropy encoding (64-bit SSE2)
17 ; This file contains an SSE2 implementation for Huffman coding of one block.
227 ; Emit the Huffman-coded symbol for the number of bits
301 ; Emit Huffman symbol for run length / number of bits
/third_party/libjpeg-turbo/simd/i386/
Djchuff-sse2.asm2 ; jchuff-sse2.asm - Huffman entropy encoding (SSE2)
17 ; This file contains an SSE2 implementation for Huffman coding of one block.
237 ; Emit the Huffman-coded symbol for the number of bits
308 ; Emit Huffman symbol for run length / number of bits
376 ; Emit Huffman symbol for run length / number of bits

1234