Lines Matching defs:code
78 /* Stores code in table[0], table[step], table[2*step], ..., table[end] */
82 HuffmanCode code) {
85 table[end] = code;
90 of bit lengths for the remaining symbols, |len| is the code length of the
107 HuffmanCode code; /* current table entry */
109 brotli_reg_t key; /* prefix code */
110 brotli_reg_t key_step; /* prefix code addend */
113 int sorted[BROTLI_CODE_LENGTH_CODES]; /* symbols sorted by code length */
121 /* Generate offsets into sorted symbol table by code length. */
129 /* Symbols with code length 0 are placed after all other symbols. */
143 /* Special case: all symbols but one have 0 code length. */
145 code = ConstructHuffmanCode(0, (uint16_t)sorted[0]);
147 table[key] = code;
160 code = ConstructHuffmanCode((uint8_t)bits, (uint16_t)sorted[symbol++]);
161 ReplicateValue(&table[BrotliReverseBits(key)], step, table_size, code);
173 HuffmanCode code; /* current table entry */
175 int len; /* current code length */
177 brotli_reg_t key; /* prefix code */
178 brotli_reg_t key_step; /* prefix code addend */
179 brotli_reg_t sub_key; /* 2nd level table prefix code */
180 brotli_reg_t sub_key_step; /* 2nd level table prefix code addend */
215 code = ConstructHuffmanCode((uint8_t)bits, (uint16_t)symbol);
216 ReplicateValue(&table[BrotliReverseBits(key)], step, table_size, code);
250 code = ConstructHuffmanCode((uint8_t)(len - root_bits), (uint16_t)symbol);
252 &table[BrotliReverseBits(sub_key)], step, table_size, code);