| /external/brotli/c/enc/ |
| compress_fragment.c | 78 size_t* storage_ix,
114 depths, bits, storage_ix, storage);
129 uint8_t depth[128], uint16_t bits[128], size_t* storage_ix,
172 cmd_depth, BROTLI_NUM_COMMAND_SYMBOLS, tree, storage_ix, storage);
174 BrotliStoreHuffmanTree(&depth[64], 64, tree, storage_ix, storage);
182 size_t* storage_ix,
186 BrotliWriteBits(depth[code], bits[code], storage_ix, storage);
193 BrotliWriteBits(depth[inscode], bits[inscode], storage_ix, storage);
194 BrotliWriteBits(nbits, tail - (prefix << nbits), storage_ix, storage);
200 BrotliWriteBits(depth[code], bits[code], storage_ix, storage)
[all...] |
| brotli_bit_stream.c | 101 const Command* cmd, size_t* storage_ix, uint8_t* storage) {
110 insnumextra + GetCopyExtra(copycode), bits, storage_ix, storage);
124 static void StoreVarLenUint8(size_t n, size_t* storage_ix, uint8_t* storage) {
126 BrotliWriteBits(1, 0, storage_ix, storage);
129 BrotliWriteBits(1, 1, storage_ix, storage);
130 BrotliWriteBits(3, nbits, storage_ix, storage);
131 BrotliWriteBits(nbits, n - ((size_t)1 << nbits), storage_ix, storage);
140 size_t* storage_ix,
147 BrotliWriteBits(1, (uint64_t)is_final_block, storage_ix, storage);
150 BrotliWriteBits(1, 0, storage_ix, storage)
[all...] |
| brotli_bit_stream.h | 13 is called "storage" and the index to the bit is called storage_ix
31 /* All Store functions here will use a storage_ix, which is always the bit
35 HuffmanTree* tree, size_t *storage_ix, uint8_t *storage);
39 const size_t max_bits, uint8_t* depth, uint16_t* bits, size_t* storage_ix,
58 size_t* storage_ix,
73 size_t* storage_ix,
88 size_t* storage_ix,
97 size_t mask, size_t len, size_t* storage_ix, uint8_t* storage);
|
| compress_fragment_two_pass.h | 27 meta-blocks, and updates the "*storage_ix" bit position.
47 size_t* storage_ix,
|
| compress_fragment_two_pass.c | 70 size_t* storage_ix, uint8_t* storage) {
111 cmd_depth, BROTLI_NUM_COMMAND_SYMBOLS, tree, storage_ix, storage);
113 BrotliStoreHuffmanTree(&depth[64], 64, tree, storage_ix, storage);
221 size_t len, BROTLI_BOOL is_uncompressed, size_t* storage_ix,
225 BrotliWriteBits(1, 0, storage_ix, storage);
231 BrotliWriteBits(2, nibbles - 4, storage_ix, storage);
232 BrotliWriteBits(nibbles * 4, len - 1, storage_ix, storage);
234 BrotliWriteBits(1, (uint64_t)is_uncompressed, storage_ix, storage);
427 size_t* storage_ix, uint8_t* storage) {
455 storage_ix, storage)
[all...] |
| block_encoder_inc.h | 16 HuffmanTree* tree, size_t* storage_ix, uint8_t* storage) {
28 &self->depths_[ix], &self->bits_[ix], storage_ix, storage);
|
| compress_fragment.h | 24 meta-blocks, and updates the "*storage_ix" bit position.
54 size_t* storage_ix,
|
| encode.c | 536 size_t* storage_ix,
546 BrotliWriteBits(2, 3, storage_ix, storage);
547 *storage_ix = (*storage_ix + 7u) & ~7u;
558 storage_ix, storage);
563 last_byte_bits = (uint8_t)(*storage_ix & 0xff);
577 storage_ix, storage);
583 storage_ix, storage);
627 storage_ix, storage);
631 if (bytes + 4 < (*storage_ix >> 3))
887 size_t storage_ix = s->last_byte_bits_; local
1019 size_t storage_ix = s->last_byte_bits_; local
1057 size_t storage_ix; local
1138 size_t storage_ix; local
1515 size_t storage_ix = s->last_byte_bits_; local
[all...] |
| entropy_encode_static.h | 84 size_t* storage_ix, uint8_t* storage) {
86 40, BROTLI_MAKE_UINT64_T(0x0000ffU, 0x55555554U), storage_ix, storage);
517 size_t* storage_ix, uint8_t* storage) {
519 56, BROTLI_MAKE_UINT64_T(0x926244U, 0x16307003U), storage_ix, storage);
520 BrotliWriteBits(3, 0x00000000U, storage_ix, storage);
531 size_t* storage_ix, uint8_t* storage) {
532 BrotliWriteBits(28, 0x0369dc03U, storage_ix, storage);
[all...] |
