Lines Matching defs:code
52 /* Static prefix code for the complex code length code lengths. */
113 /* Saves error code and converts it to BrotliDecoderResult. */
346 /* Decodes the Huffman code.
366 /* Reads and decodes the next Huffman code from bit-stream.
440 /* Decodes the next Huffman code using data prepared by PreloadSymbol.
512 /* Process single decoded symbol code length:
514 B) remember code length (if it is not 0)
535 /* Process repeated symbol code length.
690 /* Reads and decodes 15..18 codes using static prefix code.
691 Each code is 2..4 bits long. In total 30..72 bits are used. */
739 A) Huffman code contains only few symbols (1..4). Those symbols are read
740 directly; their code lengths are defined by the number of symbols.
744 B.1) Small Huffman table is decoded; it is specified with code lengths
745 encoded with predefined entropy code. 32 - 74 bits are used.
746 B.2) Decoded table is used to decode code lengths of symbols in resulting
764 1 for simple code;
765 0 for no skipping, 2 skips 2 code lengths, 3 skips 3 code lengths */
779 /* Read symbols, codes & code lengths directly. */
816 /* Decode Huffman-coded code lengths. */
875 uint32_t code;
877 code = ReadSymbol(table, br);
878 nbits = _kBrotliPrefixCodeRanges[code].nbits; /* nbits == 2..24 */
879 return _kBrotliPrefixCodeRanges[code].offset + BrotliReadBits24(br, nbits);
1045 h->code = 0xFFFF;
1054 uint32_t code = h->code;
1055 BROTLI_BOOL skip_preamble = (code != 0xFFFF);
1058 if (!SafeReadSymbol(h->context_map_table, br, &code)) {
1059 h->code = 0xFFFF;
1063 BROTLI_LOG_UINT(code);
1065 if (code == 0) {
1069 if (code > max_run_length_prefix) {
1071 (uint8_t)(code - max_run_length_prefix);
1080 if (!BrotliSafeReadBits(br, code, &reps)) {
1081 h->code = code;
1085 reps += 1U << code;
1519 Each distance ... is represented with a pair <distance code, extra bits>...
1520 The distance code is encoded using a prefix code... The number of extra bits
1621 uint32_t code;
1626 code = ReadSymbol(distance_tree, br);
1629 if (!SafeReadSymbol(distance_tree, br, &code)) {
1634 /* Convert the distance code to the actual distance by possibly
1637 if ((code & ~0xFu) == 0) {
1638 s->distance_code = (int)code;
1643 bits = BrotliReadBits32(br, b->dist_extra_bits[code]);
1645 if (!SafeReadBits32(br, b->dist_extra_bits[code], &bits)) {
1652 (int)(b->dist_offset[code] + (bits << s->distance_postfix_bits));
1881 /* Read distance code in the command, unless it was implicitly zero. */
1899 a special distance code (e.g., after adding 3 to the last distance). */