--- /dev/null
+/* Copyright 2013 Google Inc. All Rights Reserved.\r
+\r
+ Distributed under MIT license.\r
+ See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\r
+*/\r
+\r
+/* Implementation of Brotli compressor. */\r
+\r
+#include "./encode.h"\r
+\r
+#include <stdlib.h> /* free, malloc */\r
+#include <string.h> /* memcpy, memset */\r
+\r
+#include "./backward_references.h"\r
+#include "./bit_cost.h"\r
+#include "./brotli_bit_stream.h"\r
+#include "./compress_fragment.h"\r
+#include "./compress_fragment_two_pass.h"\r
+#include "./context.h"\r
+#include "./entropy_encode.h"\r
+#include "./fast_log.h"\r
+#include "./hash.h"\r
+#include "./histogram.h"\r
+#include "./memory.h"\r
+#include "./metablock.h"\r
+#include "./port.h"\r
+#include "./prefix.h"\r
+#include "./quality.h"\r
+#include "./ringbuffer.h"\r
+#include "./utf8_util.h"\r
+#include "./write_bits.h"\r
+\r
+#if defined(__cplusplus) || defined(c_plusplus)\r
+extern "C" {\r
+#endif\r
+\r
+#define COPY_ARRAY(dst, src) memcpy(dst, src, sizeof(src));\r
+\r
+typedef enum BrotliEncoderStreamState {\r
+ /* Default state. */\r
+ BROTLI_STREAM_PROCESSING = 0,\r
+ /* Intermediate state; after next block is emitted, byte-padding should be\r
+ performed before getting back to default state. */\r
+ BROTLI_STREAM_FLUSH_REQUESTED = 1,\r
+ /* Last metablock was produced; no more input is acceptable. */\r
+ BROTLI_STREAM_FINISHED = 2\r
+} BrotliEncoderStreamState;\r
+\r
+typedef struct BrotliEncoderStateStruct {\r
+ BrotliEncoderParams params;\r
+\r
+ MemoryManager memory_manager_;\r
+\r
+ Hashers hashers_;\r
+ uint64_t input_pos_;\r
+ RingBuffer ringbuffer_;\r
+ size_t cmd_alloc_size_;\r
+ Command* commands_;\r
+ size_t num_commands_;\r
+ size_t num_literals_;\r
+ size_t last_insert_len_;\r
+ uint64_t last_flush_pos_;\r
+ uint64_t last_processed_pos_;\r
+ int dist_cache_[4];\r
+ int saved_dist_cache_[4];\r
+ uint8_t last_byte_;\r
+ uint8_t last_byte_bits_;\r
+ uint8_t prev_byte_;\r
+ uint8_t prev_byte2_;\r
+ size_t storage_size_;\r
+ uint8_t* storage_;\r
+ /* Hash table for FAST_ONE_PASS_COMPRESSION_QUALITY mode. */\r
+ int small_table_[1 << 10]; /* 4KiB */\r
+ int* large_table_; /* Allocated only when needed */\r
+ size_t large_table_size_;\r
+ /* Command and distance prefix codes (each 64 symbols, stored back-to-back)\r
+ used for the next block in FAST_ONE_PASS_COMPRESSION_QUALITY. The command\r
+ prefix code is over a smaller alphabet with the following 64 symbols:\r
+ 0 - 15: insert length code 0, copy length code 0 - 15, same distance\r
+ 16 - 39: insert length code 0, copy length code 0 - 23\r
+ 40 - 63: insert length code 0 - 23, copy length code 0\r
+ Note that symbols 16 and 40 represent the same code in the full alphabet,\r
+ but we do not use either of them in FAST_ONE_PASS_COMPRESSION_QUALITY. */\r
+ uint8_t cmd_depths_[128];\r
+ uint16_t cmd_bits_[128];\r
+ /* The compressed form of the command and distance prefix codes for the next\r
+ block in FAST_ONE_PASS_COMPRESSION_QUALITY. */\r
+ uint8_t cmd_code_[512];\r
+ size_t cmd_code_numbits_;\r
+ /* Command and literal buffers for FAST_TWO_PASS_COMPRESSION_QUALITY. */\r
+ uint32_t* command_buf_;\r
+ uint8_t* literal_buf_;\r
+\r
+ uint8_t* next_out_;\r
+ size_t available_out_;\r
+ size_t total_out_;\r
+ uint8_t flush_buf_[2];\r
+ BrotliEncoderStreamState stream_state_;\r
+\r
+ BROTLI_BOOL is_last_block_emitted_;\r
+ BROTLI_BOOL is_initialized_;\r
+} BrotliEncoderStateStruct;\r
+\r
+static BROTLI_BOOL EnsureInitialized(BrotliEncoderState* s);\r
+\r
+size_t BrotliEncoderInputBlockSize(BrotliEncoderState* s) {\r
+ if (!EnsureInitialized(s)) return 0;\r
+ return (size_t)1 << s->params.lgblock;\r
+}\r
+\r
+static uint64_t UnprocessedInputSize(BrotliEncoderState* s) {\r
+ return s->input_pos_ - s->last_processed_pos_;\r
+}\r
+\r
+static size_t RemainingInputBlockSize(BrotliEncoderState* s) {\r
+ const uint64_t delta = UnprocessedInputSize(s);\r
+ size_t block_size = BrotliEncoderInputBlockSize(s);\r
+ if (delta >= block_size) return 0;\r
+ return block_size - (size_t)delta;\r
+}\r
+\r
+BROTLI_BOOL BrotliEncoderSetParameter(\r
+ BrotliEncoderState* state, BrotliEncoderParameter p, uint32_t value) {\r
+ /* Changing parameters on the fly is not implemented yet. */\r
+ if (state->is_initialized_) return BROTLI_FALSE;\r
+ /* TODO: Validate/clamp params here. */\r
+ switch (p) {\r
+ case BROTLI_PARAM_MODE:\r
+ state->params.mode = (BrotliEncoderMode)value;\r
+ return BROTLI_TRUE;\r
+\r
+ case BROTLI_PARAM_QUALITY:\r
+ state->params.quality = (int)value;\r
+ return BROTLI_TRUE;\r
+\r
+ case BROTLI_PARAM_LGWIN:\r
+ state->params.lgwin = (int)value;\r
+ return BROTLI_TRUE;\r
+\r
+ case BROTLI_PARAM_LGBLOCK:\r
+ state->params.lgblock = (int)value;\r
+ return BROTLI_TRUE;\r
+\r
+ default: return BROTLI_FALSE;\r
+ }\r
+}\r
+\r
+static void RecomputeDistancePrefixes(Command* cmds,\r
+ size_t num_commands,\r
+ uint32_t num_direct_distance_codes,\r
+ uint32_t distance_postfix_bits) {\r
+ size_t i;\r
+ if (num_direct_distance_codes == 0 && distance_postfix_bits == 0) {\r
+ return;\r
+ }\r
+ for (i = 0; i < num_commands; ++i) {\r
+ Command* cmd = &cmds[i];\r
+ if (CommandCopyLen(cmd) && cmd->cmd_prefix_ >= 128) {\r
+ PrefixEncodeCopyDistance(CommandDistanceCode(cmd),\r
+ num_direct_distance_codes,\r
+ distance_postfix_bits,\r
+ &cmd->dist_prefix_,\r
+ &cmd->dist_extra_);\r
+ }\r
+ }\r
+}\r
+\r
+/* Wraps 64-bit input position to 32-bit ringbuffer position preserving\r
+ "not-a-first-lap" feature. */\r
+static uint32_t WrapPosition(uint64_t position) {\r
+ uint32_t result = (uint32_t)position;\r
+ uint64_t gb = position >> 30;\r
+ if (gb > 2) {\r
+ /* Wrap every 2GiB; The first 3GB are continous. */\r
+ result = (result & ((1u << 30) - 1)) | ((uint32_t)((gb - 1) & 1) + 1) << 30;\r
+ }\r
+ return result;\r
+}\r
+\r
+static uint8_t* GetBrotliStorage(BrotliEncoderState* s, size_t size) {\r
+ MemoryManager* m = &s->memory_manager_;\r
+ if (s->storage_size_ < size) {\r
+ BROTLI_FREE(m, s->storage_);\r
+ s->storage_ = BROTLI_ALLOC(m, uint8_t, size);\r
+ if (BROTLI_IS_OOM(m)) return NULL;\r
+ s->storage_size_ = size;\r
+ }\r
+ return s->storage_;\r
+}\r
+\r
+static size_t HashTableSize(size_t max_table_size, size_t input_size) {\r
+ size_t htsize = 256;\r
+ while (htsize < max_table_size && htsize < input_size) {\r
+ htsize <<= 1;\r
+ }\r
+ return htsize;\r
+}\r
+\r
+static int* GetHashTable(BrotliEncoderState* s, int quality,\r
+ size_t input_size, size_t* table_size) {\r
+ /* Use smaller hash table when input.size() is smaller, since we\r
+ fill the table, incurring O(hash table size) overhead for\r
+ compression, and if the input is short, we won't need that\r
+ many hash table entries anyway. */\r
+ MemoryManager* m = &s->memory_manager_;\r
+ const size_t max_table_size = MaxHashTableSize(quality);\r
+ size_t htsize = HashTableSize(max_table_size, input_size);\r
+ int* table;\r
+ assert(max_table_size >= 256);\r
+\r
+ if (htsize <= sizeof(s->small_table_) / sizeof(s->small_table_[0])) {\r
+ table = s->small_table_;\r
+ } else {\r
+ if (htsize > s->large_table_size_) {\r
+ s->large_table_size_ = htsize;\r
+ BROTLI_FREE(m, s->large_table_);\r
+ s->large_table_ = BROTLI_ALLOC(m, int, htsize);\r
+ if (BROTLI_IS_OOM(m)) return 0;\r
+ }\r
+ table = s->large_table_;\r
+ }\r
+\r
+ *table_size = htsize;\r
+ memset(table, 0, htsize * sizeof(*table));\r
+ return table;\r
+}\r
+\r
+static void EncodeWindowBits(int lgwin, uint8_t* last_byte,\r
+ uint8_t* last_byte_bits) {\r
+ if (lgwin == 16) {\r
+ *last_byte = 0;\r
+ *last_byte_bits = 1;\r
+ } else if (lgwin == 17) {\r
+ *last_byte = 1;\r
+ *last_byte_bits = 7;\r
+ } else if (lgwin > 17) {\r
+ *last_byte = (uint8_t)(((lgwin - 17) << 1) | 1);\r
+ *last_byte_bits = 4;\r
+ } else {\r
+ *last_byte = (uint8_t)(((lgwin - 8) << 4) | 1);\r
+ *last_byte_bits = 7;\r
+ }\r
+}\r
+\r
+/* Initializes the command and distance prefix codes for the first block. */\r
+static void InitCommandPrefixCodes(uint8_t cmd_depths[128],\r
+ uint16_t cmd_bits[128],\r
+ uint8_t cmd_code[512],\r
+ size_t* cmd_code_numbits) {\r
+ static const uint8_t kDefaultCommandDepths[128] = {\r
+ 0, 4, 4, 5, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8,\r
+ 0, 0, 0, 4, 4, 4, 4, 4, 5, 5, 6, 6, 6, 6, 7, 7,\r
+ 7, 7, 10, 10, 10, 10, 10, 10, 0, 4, 4, 5, 5, 5, 6, 6,\r
+ 7, 8, 8, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10,\r
+ 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\r
+ 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4,\r
+ 4, 4, 4, 5, 5, 5, 5, 5, 5, 6, 6, 7, 7, 7, 8, 10,\r
+ 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12,\r
+ };\r
+ static const uint16_t kDefaultCommandBits[128] = {\r
+ 0, 0, 8, 9, 3, 35, 7, 71,\r
+ 39, 103, 23, 47, 175, 111, 239, 31,\r
+ 0, 0, 0, 4, 12, 2, 10, 6,\r
+ 13, 29, 11, 43, 27, 59, 87, 55,\r
+ 15, 79, 319, 831, 191, 703, 447, 959,\r
+ 0, 14, 1, 25, 5, 21, 19, 51,\r
+ 119, 159, 95, 223, 479, 991, 63, 575,\r
+ 127, 639, 383, 895, 255, 767, 511, 1023,\r
+ 14, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\r
+ 27, 59, 7, 39, 23, 55, 30, 1, 17, 9, 25, 5, 0, 8, 4, 12,\r
+ 2, 10, 6, 21, 13, 29, 3, 19, 11, 15, 47, 31, 95, 63, 127, 255,\r
+ 767, 2815, 1791, 3839, 511, 2559, 1535, 3583, 1023, 3071, 2047, 4095,\r
+ };\r
+ static const uint8_t kDefaultCommandCode[] = {\r
+ 0xff, 0x77, 0xd5, 0xbf, 0xe7, 0xde, 0xea, 0x9e, 0x51, 0x5d, 0xde, 0xc6,\r
+ 0x70, 0x57, 0xbc, 0x58, 0x58, 0x58, 0xd8, 0xd8, 0x58, 0xd5, 0xcb, 0x8c,\r
+ 0xea, 0xe0, 0xc3, 0x87, 0x1f, 0x83, 0xc1, 0x60, 0x1c, 0x67, 0xb2, 0xaa,\r
+ 0x06, 0x83, 0xc1, 0x60, 0x30, 0x18, 0xcc, 0xa1, 0xce, 0x88, 0x54, 0x94,\r
+ 0x46, 0xe1, 0xb0, 0xd0, 0x4e, 0xb2, 0xf7, 0x04, 0x00,\r
+ };\r
+ static const size_t kDefaultCommandCodeNumBits = 448;\r
+ COPY_ARRAY(cmd_depths, kDefaultCommandDepths);\r
+ COPY_ARRAY(cmd_bits, kDefaultCommandBits);\r
+\r
+ /* Initialize the pre-compressed form of the command and distance prefix\r
+ codes. */\r
+ COPY_ARRAY(cmd_code, kDefaultCommandCode);\r
+ *cmd_code_numbits = kDefaultCommandCodeNumBits;\r
+}\r
+\r
+/* Decide about the context map based on the ability of the prediction\r
+ ability of the previous byte UTF8-prefix on the next byte. The\r
+ prediction ability is calculated as shannon entropy. Here we need\r
+ shannon entropy instead of 'BitsEntropy' since the prefix will be\r
+ encoded with the remaining 6 bits of the following byte, and\r
+ BitsEntropy will assume that symbol to be stored alone using Huffman\r
+ coding. */\r
+static void ChooseContextMap(int quality,\r
+ uint32_t* bigram_histo,\r
+ size_t* num_literal_contexts,\r
+ const uint32_t** literal_context_map) {\r
+ static const uint32_t kStaticContextMapContinuation[64] = {\r
+ 1, 1, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\r
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\r
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\r
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\r
+ };\r
+ static const uint32_t kStaticContextMapSimpleUTF8[64] = {\r
+ 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\r
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\r
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\r
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\r
+ };\r
+\r
+ uint32_t monogram_histo[3] = { 0 };\r
+ uint32_t two_prefix_histo[6] = { 0 };\r
+ size_t total = 0;\r
+ size_t i;\r
+ size_t dummy;\r
+ double entropy[4];\r
+ for (i = 0; i < 9; ++i) {\r
+ size_t j = i;\r
+ total += bigram_histo[i];\r
+ monogram_histo[i % 3] += bigram_histo[i];\r
+ if (j >= 6) {\r
+ j -= 6;\r
+ }\r
+ two_prefix_histo[j] += bigram_histo[i];\r
+ }\r
+ entropy[1] = ShannonEntropy(monogram_histo, 3, &dummy);\r
+ entropy[2] = (ShannonEntropy(two_prefix_histo, 3, &dummy) +\r
+ ShannonEntropy(two_prefix_histo + 3, 3, &dummy));\r
+ entropy[3] = 0;\r
+ for (i = 0; i < 3; ++i) {\r
+ entropy[3] += ShannonEntropy(bigram_histo + 3 * i, 3, &dummy);\r
+ }\r
+\r
+ assert(total != 0);\r
+ entropy[0] = 1.0 / (double)total;\r
+ entropy[1] *= entropy[0];\r
+ entropy[2] *= entropy[0];\r
+ entropy[3] *= entropy[0];\r
+\r
+ if (quality < MIN_QUALITY_FOR_HQ_CONTEXT_MODELING) {\r
+ /* 3 context models is a bit slower, don't use it at lower qualities. */\r
+ entropy[3] = entropy[1] * 10;\r
+ }\r
+ /* If expected savings by symbol are less than 0.2 bits, skip the\r
+ context modeling -- in exchange for faster decoding speed. */\r
+ if (entropy[1] - entropy[2] < 0.2 &&\r
+ entropy[1] - entropy[3] < 0.2) {\r
+ *num_literal_contexts = 1;\r
+ } else if (entropy[2] - entropy[3] < 0.02) {\r
+ *num_literal_contexts = 2;\r
+ *literal_context_map = kStaticContextMapSimpleUTF8;\r
+ } else {\r
+ *num_literal_contexts = 3;\r
+ *literal_context_map = kStaticContextMapContinuation;\r
+ }\r
+}\r
+\r
+static void DecideOverLiteralContextModeling(const uint8_t* input,\r
+ size_t start_pos, size_t length, size_t mask, int quality,\r
+ ContextType* literal_context_mode, size_t* num_literal_contexts,\r
+ const uint32_t** literal_context_map) {\r
+ if (quality < MIN_QUALITY_FOR_CONTEXT_MODELING || length < 64) {\r
+ return;\r
+ } else {\r
+ /* Gather bigram data of the UTF8 byte prefixes. To make the analysis of\r
+ UTF8 data faster we only examine 64 byte long strides at every 4kB\r
+ intervals. */\r
+ const size_t end_pos = start_pos + length;\r
+ uint32_t bigram_prefix_histo[9] = { 0 };\r
+ for (; start_pos + 64 <= end_pos; start_pos += 4096) {\r
+ static const int lut[4] = { 0, 0, 1, 2 };\r
+ const size_t stride_end_pos = start_pos + 64;\r
+ int prev = lut[input[start_pos & mask] >> 6] * 3;\r
+ size_t pos;\r
+ for (pos = start_pos + 1; pos < stride_end_pos; ++pos) {\r
+ const uint8_t literal = input[pos & mask];\r
+ ++bigram_prefix_histo[prev + lut[literal >> 6]];\r
+ prev = lut[literal >> 6] * 3;\r
+ }\r
+ }\r
+ *literal_context_mode = CONTEXT_UTF8;\r
+ ChooseContextMap(quality, &bigram_prefix_histo[0], num_literal_contexts,\r
+ literal_context_map);\r
+ }\r
+}\r
+\r
+static BROTLI_BOOL ShouldCompress(\r
+ const uint8_t* data, const size_t mask, const uint64_t last_flush_pos,\r
+ const size_t bytes, const size_t num_literals, const size_t num_commands) {\r
+ if (num_commands < (bytes >> 8) + 2) {\r
+ if (num_literals > 0.99 * (double)bytes) {\r
+ uint32_t literal_histo[256] = { 0 };\r
+ static const uint32_t kSampleRate = 13;\r
+ static const double kMinEntropy = 7.92;\r
+ const double bit_cost_threshold =\r
+ (double)bytes * kMinEntropy / kSampleRate;\r
+ size_t t = (bytes + kSampleRate - 1) / kSampleRate;\r
+ uint32_t pos = (uint32_t)last_flush_pos;\r
+ size_t i;\r
+ for (i = 0; i < t; i++) {\r
+ ++literal_histo[data[pos & mask]];\r
+ pos += kSampleRate;\r
+ }\r
+ if (BitsEntropy(literal_histo, 256) > bit_cost_threshold) {\r
+ return BROTLI_FALSE;\r
+ }\r
+ }\r
+ }\r
+ return BROTLI_TRUE;\r
+}\r
+\r
+static void WriteMetaBlockInternal(MemoryManager* m,\r
+ const uint8_t* data,\r
+ const size_t mask,\r
+ const uint64_t last_flush_pos,\r
+ const size_t bytes,\r
+ const BROTLI_BOOL is_last,\r
+ const BrotliEncoderParams* params,\r
+ const uint8_t prev_byte,\r
+ const uint8_t prev_byte2,\r
+ const size_t num_literals,\r
+ const size_t num_commands,\r
+ Command* commands,\r
+ const int* saved_dist_cache,\r
+ int* dist_cache,\r
+ size_t* storage_ix,\r
+ uint8_t* storage) {\r
+ const uint32_t wrapped_last_flush_pos = WrapPosition(last_flush_pos);\r
+ uint8_t last_byte;\r
+ uint8_t last_byte_bits;\r
+ uint32_t num_direct_distance_codes = 0;\r
+ uint32_t distance_postfix_bits = 0;\r
+\r
+ if (bytes == 0) {\r
+ /* Write the ISLAST and ISEMPTY bits. */\r
+ BrotliWriteBits(2, 3, storage_ix, storage);\r
+ *storage_ix = (*storage_ix + 7u) & ~7u;\r
+ return;\r
+ }\r
+\r
+ if (!ShouldCompress(data, mask, last_flush_pos, bytes,\r
+ num_literals, num_commands)) {\r
+ /* Restore the distance cache, as its last update by\r
+ CreateBackwardReferences is now unused. */\r
+ memcpy(dist_cache, saved_dist_cache, 4 * sizeof(dist_cache[0]));\r
+ BrotliStoreUncompressedMetaBlock(is_last, data,\r
+ wrapped_last_flush_pos, mask, bytes,\r
+ storage_ix, storage);\r
+ return;\r
+ }\r
+\r
+ last_byte = storage[0];\r
+ last_byte_bits = (uint8_t)(*storage_ix & 0xff);\r
+ if (params->quality >= MIN_QUALITY_FOR_RECOMPUTE_DISTANCE_PREFIXES &&\r
+ params->mode == BROTLI_MODE_FONT) {\r
+ num_direct_distance_codes = 12;\r
+ distance_postfix_bits = 1;\r
+ RecomputeDistancePrefixes(commands,\r
+ num_commands,\r
+ num_direct_distance_codes,\r
+ distance_postfix_bits);\r
+ }\r
+ if (params->quality <= MAX_QUALITY_FOR_STATIC_ENRTOPY_CODES) {\r
+ BrotliStoreMetaBlockFast(m, data, wrapped_last_flush_pos,\r
+ bytes, mask, is_last,\r
+ commands, num_commands,\r
+ storage_ix, storage);\r
+ if (BROTLI_IS_OOM(m)) return;\r
+ } else if (params->quality < MIN_QUALITY_FOR_BLOCK_SPLIT) {\r
+ BrotliStoreMetaBlockTrivial(m, data, wrapped_last_flush_pos,\r
+ bytes, mask, is_last,\r
+ commands, num_commands,\r
+ storage_ix, storage);\r
+ if (BROTLI_IS_OOM(m)) return;\r
+ } else {\r
+ ContextType literal_context_mode = CONTEXT_UTF8;\r
+ MetaBlockSplit mb;\r
+ InitMetaBlockSplit(&mb);\r
+ if (params->quality < MIN_QUALITY_FOR_HQ_BLOCK_SPLITTING) {\r
+ size_t num_literal_contexts = 1;\r
+ const uint32_t* literal_context_map = NULL;\r
+ DecideOverLiteralContextModeling(data, wrapped_last_flush_pos,\r
+ bytes, mask,\r
+ params->quality,\r
+ &literal_context_mode,\r
+ &num_literal_contexts,\r
+ &literal_context_map);\r
+ if (literal_context_map == NULL) {\r
+ BrotliBuildMetaBlockGreedy(m, data, wrapped_last_flush_pos, mask,\r
+ commands, num_commands, &mb);\r
+ if (BROTLI_IS_OOM(m)) return;\r
+ } else {\r
+ BrotliBuildMetaBlockGreedyWithContexts(m, data,\r
+ wrapped_last_flush_pos,\r
+ mask,\r
+ prev_byte, prev_byte2,\r
+ literal_context_mode,\r
+ num_literal_contexts,\r
+ literal_context_map,\r
+ commands, num_commands,\r
+ &mb);\r
+ if (BROTLI_IS_OOM(m)) return;\r
+ }\r
+ } else {\r
+ if (!BrotliIsMostlyUTF8(data, wrapped_last_flush_pos, mask, bytes,\r
+ kMinUTF8Ratio)) {\r
+ literal_context_mode = CONTEXT_SIGNED;\r
+ }\r
+ BrotliBuildMetaBlock(m, data, wrapped_last_flush_pos, mask, params,\r
+ prev_byte, prev_byte2,\r
+ commands, num_commands,\r
+ literal_context_mode,\r
+ &mb);\r
+ if (BROTLI_IS_OOM(m)) return;\r
+ }\r
+ if (params->quality >= MIN_QUALITY_FOR_OPTIMIZE_HISTOGRAMS) {\r
+ BrotliOptimizeHistograms(num_direct_distance_codes,\r
+ distance_postfix_bits,\r
+ &mb);\r
+ }\r
+ BrotliStoreMetaBlock(m, data, wrapped_last_flush_pos, bytes, mask,\r
+ prev_byte, prev_byte2,\r
+ is_last,\r
+ num_direct_distance_codes,\r
+ distance_postfix_bits,\r
+ literal_context_mode,\r
+ commands, num_commands,\r
+ &mb,\r
+ storage_ix, storage);\r
+ if (BROTLI_IS_OOM(m)) return;\r
+ DestroyMetaBlockSplit(m, &mb);\r
+ }\r
+ if (bytes + 4 < (*storage_ix >> 3)) {\r
+ /* Restore the distance cache and last byte. */\r
+ memcpy(dist_cache, saved_dist_cache, 4 * sizeof(dist_cache[0]));\r
+ storage[0] = last_byte;\r
+ *storage_ix = last_byte_bits;\r
+ BrotliStoreUncompressedMetaBlock(is_last, data,\r
+ wrapped_last_flush_pos, mask,\r
+ bytes, storage_ix, storage);\r
+ }\r
+}\r
+\r
+static BROTLI_BOOL EnsureInitialized(BrotliEncoderState* s) {\r
+ if (BROTLI_IS_OOM(&s->memory_manager_)) return BROTLI_FALSE;\r
+ if (s->is_initialized_) return BROTLI_TRUE;\r
+\r
+ SanitizeParams(&s->params);\r
+ s->params.lgblock = ComputeLgBlock(&s->params);\r
+\r
+ RingBufferSetup(&s->params, &s->ringbuffer_);\r
+\r
+ /* Initialize last byte with stream header. */\r
+ EncodeWindowBits(s->params.lgwin, &s->last_byte_, &s->last_byte_bits_);\r
+\r
+ if (s->params.quality == FAST_ONE_PASS_COMPRESSION_QUALITY) {\r
+ InitCommandPrefixCodes(s->cmd_depths_, s->cmd_bits_,\r
+ s->cmd_code_, &s->cmd_code_numbits_);\r
+ }\r
+\r
+ /* Initialize hashers. */\r
+ HashersSetup(&s->memory_manager_, &s->hashers_, ChooseHasher(&s->params));\r
+ if (BROTLI_IS_OOM(&s->memory_manager_)) return BROTLI_FALSE;\r
+\r
+ s->is_initialized_ = BROTLI_TRUE;\r
+ return BROTLI_TRUE;\r
+}\r
+\r
+static void BrotliEncoderInitState(BrotliEncoderState* s) {\r
+ s->params.mode = BROTLI_DEFAULT_MODE;\r
+ s->params.quality = BROTLI_DEFAULT_QUALITY;\r
+ s->params.lgwin = BROTLI_DEFAULT_WINDOW;\r
+ s->params.lgblock = 0;\r
+\r
+ s->input_pos_ = 0;\r
+ s->num_commands_ = 0;\r
+ s->num_literals_ = 0;\r
+ s->last_insert_len_ = 0;\r
+ s->last_flush_pos_ = 0;\r
+ s->last_processed_pos_ = 0;\r
+ s->prev_byte_ = 0;\r
+ s->prev_byte2_ = 0;\r
+ s->storage_size_ = 0;\r
+ s->storage_ = 0;\r
+ s->large_table_ = NULL;\r
+ s->large_table_size_ = 0;\r
+ s->cmd_code_numbits_ = 0;\r
+ s->command_buf_ = NULL;\r
+ s->literal_buf_ = NULL;\r
+ s->next_out_ = NULL;\r
+ s->available_out_ = 0;\r
+ s->total_out_ = 0;\r
+ s->stream_state_ = BROTLI_STREAM_PROCESSING;\r
+ s->is_last_block_emitted_ = BROTLI_FALSE;\r
+ s->is_initialized_ = BROTLI_FALSE;\r
+\r
+ InitHashers(&s->hashers_);\r
+\r
+ RingBufferInit(&s->ringbuffer_);\r
+\r
+ s->commands_ = 0;\r
+ s->cmd_alloc_size_ = 0;\r
+\r
+ /* Initialize distance cache. */\r
+ s->dist_cache_[0] = 4;\r
+ s->dist_cache_[1] = 11;\r
+ s->dist_cache_[2] = 15;\r
+ s->dist_cache_[3] = 16;\r
+ /* Save the state of the distance cache in case we need to restore it for\r
+ emitting an uncompressed block. */\r
+ memcpy(s->saved_dist_cache_, s->dist_cache_, sizeof(s->dist_cache_));\r
+}\r
+\r
+BrotliEncoderState* BrotliEncoderCreateInstance(brotli_alloc_func alloc_func,\r
+ brotli_free_func free_func,\r
+ void* opaque) {\r
+ BrotliEncoderState* state = 0;\r
+ if (!alloc_func && !free_func) {\r
+ state = (BrotliEncoderState*)malloc(sizeof(BrotliEncoderState));\r
+ } else if (alloc_func && free_func) {\r
+ state = (BrotliEncoderState*)alloc_func(opaque, sizeof(BrotliEncoderState));\r
+ }\r
+ if (state == 0) {\r
+ /* BROTLI_DUMP(); */\r
+ return 0;\r
+ }\r
+ BrotliInitMemoryManager(\r
+ &state->memory_manager_, alloc_func, free_func, opaque);\r
+ BrotliEncoderInitState(state);\r
+ return state;\r
+}\r
+\r
+static void BrotliEncoderCleanupState(BrotliEncoderState* s) {\r
+ MemoryManager* m = &s->memory_manager_;\r
+ if (BROTLI_IS_OOM(m)) {\r
+ BrotliWipeOutMemoryManager(m);\r
+ return;\r
+ }\r
+ BROTLI_FREE(m, s->storage_);\r
+ BROTLI_FREE(m, s->commands_);\r
+ RingBufferFree(m, &s->ringbuffer_);\r
+ DestroyHashers(m, &s->hashers_);\r
+ BROTLI_FREE(m, s->large_table_);\r
+ BROTLI_FREE(m, s->command_buf_);\r
+ BROTLI_FREE(m, s->literal_buf_);\r
+}\r
+\r
+/* Deinitializes and frees BrotliEncoderState instance. */\r
+void BrotliEncoderDestroyInstance(BrotliEncoderState* state) {\r
+ if (!state) {\r
+ return;\r
+ } else {\r
+ MemoryManager* m = &state->memory_manager_;\r
+ brotli_free_func free_func = m->free_func;\r
+ void* opaque = m->opaque;\r
+ BrotliEncoderCleanupState(state);\r
+ free_func(opaque, state);\r
+ }\r
+}\r
+\r
+void BrotliEncoderCopyInputToRingBuffer(BrotliEncoderState* s,\r
+ const size_t input_size,\r
+ const uint8_t* input_buffer) {\r
+ RingBuffer* ringbuffer_ = &s->ringbuffer_;\r
+ MemoryManager* m = &s->memory_manager_;\r
+ if (!EnsureInitialized(s)) return;\r
+ RingBufferWrite(m, input_buffer, input_size, ringbuffer_);\r
+ if (BROTLI_IS_OOM(m)) return;\r
+ s->input_pos_ += input_size;\r
+\r
+ /* TL;DR: If needed, initialize 7 more bytes in the ring buffer to make the\r
+ hashing not depend on uninitialized data. This makes compression\r
+ deterministic and it prevents uninitialized memory warnings in Valgrind.\r
+ Even without erasing, the output would be valid (but nondeterministic).\r
+\r
+ Background information: The compressor stores short (at most 8 bytes)\r
+ substrings of the input already read in a hash table, and detects\r
+ repetitions by looking up such substrings in the hash table. If it\r
+ can find a substring, it checks whether the substring is really there\r
+ in the ring buffer (or it's just a hash collision). Should the hash\r
+ table become corrupt, this check makes sure that the output is\r
+ still valid, albeit the compression ratio would be bad.\r
+\r
+ The compressor populates the hash table from the ring buffer as it's\r
+ reading new bytes from the input. However, at the last few indexes of\r
+ the ring buffer, there are not enough bytes to build full-length\r
+ substrings from. Since the hash table always contains full-length\r
+ substrings, we erase with dummy 0s here to make sure that those\r
+ substrings will contain 0s at the end instead of uninitialized\r
+ data.\r
+\r
+ Please note that erasing is not necessary (because the\r
+ memory region is already initialized since he ring buffer\r
+ has a `tail' that holds a copy of the beginning,) so we\r
+ skip erasing if we have already gone around at least once in\r
+ the ring buffer.\r
+\r
+ Only clear during the first round of ringbuffer writes. On\r
+ subsequent rounds data in the ringbuffer would be affected. */\r
+ if (ringbuffer_->pos_ <= ringbuffer_->mask_) {\r
+ /* This is the first time when the ring buffer is being written.\r
+ We clear 7 bytes just after the bytes that have been copied from\r
+ the input buffer.\r
+\r
+ The ringbuffer has a "tail" that holds a copy of the beginning,\r
+ but only once the ring buffer has been fully written once, i.e.,\r
+ pos <= mask. For the first time, we need to write values\r
+ in this tail (where index may be larger than mask), so that\r
+ we have exactly defined behavior and don't read un-initialized\r
+ memory. Due to performance reasons, hashing reads data using a\r
+ LOAD64, which can go 7 bytes beyond the bytes written in the\r
+ ringbuffer. */\r
+ memset(ringbuffer_->buffer_ + ringbuffer_->pos_, 0, 7);\r
+ }\r
+}\r
+\r
+void BrotliEncoderSetCustomDictionary(BrotliEncoderState* s, size_t size,\r
+ const uint8_t* dict) {\r
+ size_t max_dict_size = MaxBackwardLimit(s->params.lgwin);\r
+ size_t dict_size = size;\r
+ MemoryManager* m = &s->memory_manager_;\r
+\r
+ if (!EnsureInitialized(s)) return;\r
+\r
+ if (dict_size == 0 ||\r
+ s->params.quality == FAST_ONE_PASS_COMPRESSION_QUALITY ||\r
+ s->params.quality == FAST_TWO_PASS_COMPRESSION_QUALITY) {\r
+ return;\r
+ }\r
+ if (size > max_dict_size) {\r
+ dict += size - max_dict_size;\r
+ dict_size = max_dict_size;\r
+ }\r
+ BrotliEncoderCopyInputToRingBuffer(s, dict_size, dict);\r
+ s->last_flush_pos_ = dict_size;\r
+ s->last_processed_pos_ = dict_size;\r
+ if (dict_size > 0) {\r
+ s->prev_byte_ = dict[dict_size - 1];\r
+ }\r
+ if (dict_size > 1) {\r
+ s->prev_byte2_ = dict[dict_size - 2];\r
+ }\r
+ HashersPrependCustomDictionary(m, &s->hashers_, &s->params, dict_size, dict);\r
+ if (BROTLI_IS_OOM(m)) return;\r
+}\r
+\r
+/* Marks all input as processed.\r
+ Returns true if position wrapping occurs. */\r
+static BROTLI_BOOL UpdateLastProcessedPos(BrotliEncoderState* s) {\r
+ uint32_t wrapped_last_processed_pos = WrapPosition(s->last_processed_pos_);\r
+ uint32_t wrapped_input_pos = WrapPosition(s->input_pos_);\r
+ s->last_processed_pos_ = s->input_pos_;\r
+ return TO_BROTLI_BOOL(wrapped_input_pos < wrapped_last_processed_pos);\r
+}\r
+\r
+BROTLI_BOOL BrotliEncoderWriteData(\r
+ BrotliEncoderState* s, const BROTLI_BOOL is_last,\r
+ const BROTLI_BOOL force_flush, size_t* out_size, uint8_t** output) {\r
+ const uint64_t delta = UnprocessedInputSize(s);\r
+ const uint32_t bytes = (uint32_t)delta;\r
+ const uint32_t wrapped_last_processed_pos =\r
+ WrapPosition(s->last_processed_pos_);\r
+ uint8_t* data;\r
+ uint32_t mask;\r
+ MemoryManager* m = &s->memory_manager_;\r
+\r
+ if (!EnsureInitialized(s)) return BROTLI_FALSE;\r
+ data = s->ringbuffer_.buffer_;\r
+ mask = s->ringbuffer_.mask_;\r
+\r
+ /* Adding more blocks after "last" block is forbidden. */\r
+ if (s->is_last_block_emitted_) return BROTLI_FALSE;\r
+ if (is_last) s->is_last_block_emitted_ = BROTLI_TRUE;\r
+\r
+ if (delta > BrotliEncoderInputBlockSize(s)) {\r
+ return BROTLI_FALSE;\r
+ }\r
+ if (s->params.quality == FAST_TWO_PASS_COMPRESSION_QUALITY &&\r
+ !s->command_buf_) {\r
+ s->command_buf_ =\r
+ BROTLI_ALLOC(m, uint32_t, kCompressFragmentTwoPassBlockSize);\r
+ s->literal_buf_ =\r
+ BROTLI_ALLOC(m, uint8_t, kCompressFragmentTwoPassBlockSize);\r
+ if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\r
+ }\r
+\r
+ if (s->params.quality == FAST_ONE_PASS_COMPRESSION_QUALITY ||\r
+ s->params.quality == FAST_TWO_PASS_COMPRESSION_QUALITY) {\r
+ uint8_t* storage;\r
+ size_t storage_ix = s->last_byte_bits_;\r
+ size_t table_size;\r
+ int* table;\r
+\r
+ if (delta == 0 && !is_last) {\r
+ /* We have no new input data and we don't have to finish the stream, so\r
+ nothing to do. */\r
+ *out_size = 0;\r
+ return BROTLI_TRUE;\r
+ }\r
+ storage = GetBrotliStorage(s, 2 * bytes + 500);\r
+ if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\r
+ storage[0] = s->last_byte_;\r
+ table = GetHashTable(s, s->params.quality, bytes, &table_size);\r
+ if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\r
+ if (s->params.quality == FAST_ONE_PASS_COMPRESSION_QUALITY) {\r
+ BrotliCompressFragmentFast(\r
+ m, &data[wrapped_last_processed_pos & mask],\r
+ bytes, is_last,\r
+ table, table_size,\r
+ s->cmd_depths_, s->cmd_bits_,\r
+ &s->cmd_code_numbits_, s->cmd_code_,\r
+ &storage_ix, storage);\r
+ if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\r
+ } else {\r
+ BrotliCompressFragmentTwoPass(\r
+ m, &data[wrapped_last_processed_pos & mask],\r
+ bytes, is_last,\r
+ s->command_buf_, s->literal_buf_,\r
+ table, table_size,\r
+ &storage_ix, storage);\r
+ if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\r
+ }\r
+ s->last_byte_ = storage[storage_ix >> 3];\r
+ s->last_byte_bits_ = storage_ix & 7u;\r
+ UpdateLastProcessedPos(s);\r
+ *output = &storage[0];\r
+ *out_size = storage_ix >> 3;\r
+ return BROTLI_TRUE;\r
+ }\r
+\r
+ {\r
+ /* Theoretical max number of commands is 1 per 2 bytes. */\r
+ size_t newsize = s->num_commands_ + bytes / 2 + 1;\r
+ if (newsize > s->cmd_alloc_size_) {\r
+ Command* new_commands;\r
+ /* Reserve a bit more memory to allow merging with a next block\r
+ without realloc: that would impact speed. */\r
+ newsize += (bytes / 4) + 16;\r
+ s->cmd_alloc_size_ = newsize;\r
+ new_commands = BROTLI_ALLOC(m, Command, newsize);\r
+ if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\r
+ if (s->commands_) {\r
+ memcpy(new_commands, s->commands_, sizeof(Command) * s->num_commands_);\r
+ BROTLI_FREE(m, s->commands_);\r
+ }\r
+ s->commands_ = new_commands;\r
+ }\r
+ }\r
+\r
+ BrotliCreateBackwardReferences(m, bytes, wrapped_last_processed_pos,\r
+ is_last, data, mask,\r
+ &s->params,\r
+ &s->hashers_,\r
+ s->dist_cache_,\r
+ &s->last_insert_len_,\r
+ &s->commands_[s->num_commands_],\r
+ &s->num_commands_,\r
+ &s->num_literals_);\r
+ if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\r
+\r
+ {\r
+ const size_t max_length = MaxMetablockSize(&s->params);\r
+ const size_t max_literals = max_length / 8;\r
+ const size_t max_commands = max_length / 8;\r
+ const size_t processed_bytes = (size_t)(s->input_pos_ - s->last_flush_pos_);\r
+ /* If maximal possible additional block doesn't fit metablock, flush now. */\r
+ /* TODO: Postpone decision until next block arrives? */\r
+ const BROTLI_BOOL next_input_fits_metablock = TO_BROTLI_BOOL(\r
+ processed_bytes + BrotliEncoderInputBlockSize(s) <= max_length);\r
+ /* If block splitting is not used, then flush as soon as there is some\r
+ amount of commands / literals produced. */\r
+ const BROTLI_BOOL should_flush = TO_BROTLI_BOOL(\r
+ s->params.quality < MIN_QUALITY_FOR_BLOCK_SPLIT &&\r
+ s->num_literals_ + s->num_commands_ >= MAX_NUM_DELAYED_SYMBOLS);\r
+ if (!is_last && !force_flush && !should_flush &&\r
+ next_input_fits_metablock &&\r
+ s->num_literals_ < max_literals &&\r
+ s->num_commands_ < max_commands) {\r
+ /* Merge with next input block. Everything will happen later. */\r
+ if (UpdateLastProcessedPos(s)) {\r
+ HashersReset(&s->hashers_, ChooseHasher(&s->params));\r
+ }\r
+ *out_size = 0;\r
+ return BROTLI_TRUE;\r
+ }\r
+ }\r
+\r
+ /* Create the last insert-only command. */\r
+ if (s->last_insert_len_ > 0) {\r
+ InitInsertCommand(&s->commands_[s->num_commands_++], s->last_insert_len_);\r
+ s->num_literals_ += s->last_insert_len_;\r
+ s->last_insert_len_ = 0;\r
+ }\r
+\r
+ if (!is_last && s->input_pos_ == s->last_flush_pos_) {\r
+ /* We have no new input data and we don't have to finish the stream, so\r
+ nothing to do. */\r
+ *out_size = 0;\r
+ return BROTLI_TRUE;\r
+ }\r
+ assert(s->input_pos_ >= s->last_flush_pos_);\r
+ assert(s->input_pos_ > s->last_flush_pos_ || is_last);\r
+ assert(s->input_pos_ - s->last_flush_pos_ <= 1u << 24);\r
+ {\r
+ const uint32_t metablock_size =\r
+ (uint32_t)(s->input_pos_ - s->last_flush_pos_);\r
+ uint8_t* storage = GetBrotliStorage(s, 2 * metablock_size + 500);\r
+ size_t storage_ix = s->last_byte_bits_;\r
+ if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\r
+ storage[0] = s->last_byte_;\r
+ WriteMetaBlockInternal(\r
+ m, data, mask, s->last_flush_pos_, metablock_size, is_last,\r
+ &s->params, s->prev_byte_, s->prev_byte2_,\r
+ s->num_literals_, s->num_commands_, s->commands_, s->saved_dist_cache_,\r
+ s->dist_cache_, &storage_ix, storage);\r
+ if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\r
+ s->last_byte_ = storage[storage_ix >> 3];\r
+ s->last_byte_bits_ = storage_ix & 7u;\r
+ s->last_flush_pos_ = s->input_pos_;\r
+ if (UpdateLastProcessedPos(s)) {\r
+ HashersReset(&s->hashers_, ChooseHasher(&s->params));\r
+ }\r
+ if (s->last_flush_pos_ > 0) {\r
+ s->prev_byte_ = data[((uint32_t)s->last_flush_pos_ - 1) & mask];\r
+ }\r
+ if (s->last_flush_pos_ > 1) {\r
+ s->prev_byte2_ = data[(uint32_t)(s->last_flush_pos_ - 2) & mask];\r
+ }\r
+ s->num_commands_ = 0;\r
+ s->num_literals_ = 0;\r
+ /* Save the state of the distance cache in case we need to restore it for\r
+ emitting an uncompressed block. */\r
+ memcpy(s->saved_dist_cache_, s->dist_cache_, sizeof(s->dist_cache_));\r
+ *output = &storage[0];\r
+ *out_size = storage_ix >> 3;\r
+ return BROTLI_TRUE;\r
+ }\r
+}\r
+\r
+BROTLI_BOOL BrotliEncoderWriteMetaBlock(\r
+ BrotliEncoderState* s, const size_t input_size, const uint8_t* input_buffer,\r
+ const BROTLI_BOOL is_last, size_t* encoded_size, uint8_t* encoded_buffer) {\r
+ size_t out_size = 0;\r
+ uint8_t* output;\r
+ int result;\r
+ if (!EnsureInitialized(s)) return BROTLI_FALSE;\r
+ BrotliEncoderCopyInputToRingBuffer(s, input_size, input_buffer);\r
+ result = BrotliEncoderWriteData(\r
+ s, is_last, /* force_flush */ BROTLI_TRUE, &out_size, &output);\r
+ if (!result || out_size > *encoded_size) {\r
+ return BROTLI_FALSE;\r
+ }\r
+ if (out_size > 0) {\r
+ memcpy(encoded_buffer, output, out_size);\r
+ }\r
+ *encoded_size = out_size;\r
+ return BROTLI_TRUE;\r
+}\r
+\r
+BROTLI_BOOL BrotliEncoderWriteMetadata(\r
+ BrotliEncoderState* s, const size_t input_size, const uint8_t* input_buffer,\r
+ const BROTLI_BOOL is_last, size_t* encoded_size, uint8_t* encoded_buffer) {\r
+ uint64_t hdr_buffer_data[2];\r
+ uint8_t* hdr_buffer = (uint8_t*)&hdr_buffer_data[0];\r
+ size_t storage_ix;\r
+ if (!EnsureInitialized(s)) return BROTLI_FALSE;\r
+ if (input_size > (1 << 24) || input_size + 6 > *encoded_size) {\r
+ return BROTLI_FALSE;\r
+ }\r
+ storage_ix = s->last_byte_bits_;\r
+ hdr_buffer[0] = s->last_byte_;\r
+ BrotliWriteBits(1, 0, &storage_ix, hdr_buffer);\r
+ BrotliWriteBits(2, 3, &storage_ix, hdr_buffer);\r
+ BrotliWriteBits(1, 0, &storage_ix, hdr_buffer);\r
+ if (input_size == 0) {\r
+ BrotliWriteBits(2, 0, &storage_ix, hdr_buffer);\r
+ *encoded_size = (storage_ix + 7u) >> 3;\r
+ memcpy(encoded_buffer, hdr_buffer, *encoded_size);\r
+ } else {\r
+ uint32_t nbits = (input_size == 1) ? 0 :\r
+ (Log2FloorNonZero((uint32_t)input_size - 1) + 1);\r
+ uint32_t nbytes = (nbits + 7) / 8;\r
+ size_t hdr_size;\r
+ BrotliWriteBits(2, nbytes, &storage_ix, hdr_buffer);\r
+ BrotliWriteBits(8 * nbytes, input_size - 1, &storage_ix, hdr_buffer);\r
+ hdr_size = (storage_ix + 7u) >> 3;\r
+ memcpy(encoded_buffer, hdr_buffer, hdr_size);\r
+ memcpy(&encoded_buffer[hdr_size], input_buffer, input_size);\r
+ *encoded_size = hdr_size + input_size;\r
+ }\r
+ if (is_last) {\r
+ encoded_buffer[(*encoded_size)++] = 3;\r
+ }\r
+ s->last_byte_ = 0;\r
+ s->last_byte_bits_ = 0;\r
+ return BROTLI_TRUE;\r
+}\r
+\r
+BROTLI_BOOL BrotliEncoderFinishStream(\r
+ BrotliEncoderState* s, size_t* encoded_size, uint8_t* encoded_buffer) {\r
+ if (!EnsureInitialized(s)) return BROTLI_FALSE;\r
+ return BrotliEncoderWriteMetaBlock(\r
+ s, 0, NULL, 1, encoded_size, encoded_buffer);\r
+}\r
+\r
+static BROTLI_BOOL BrotliCompressBufferQuality10(\r
+ int lgwin, size_t input_size, const uint8_t* input_buffer,\r
+ size_t* encoded_size, uint8_t* encoded_buffer) {\r
+ MemoryManager memory_manager;\r
+ MemoryManager* m = &memory_manager;\r
+\r
+ const size_t mask = BROTLI_SIZE_MAX >> 1;\r
+ const size_t max_backward_limit = MaxBackwardLimit(lgwin);\r
+ int dist_cache[4] = { 4, 11, 15, 16 };\r
+ int saved_dist_cache[4] = { 4, 11, 15, 16 };\r
+ BROTLI_BOOL ok = BROTLI_TRUE;\r
+ const size_t max_out_size = *encoded_size;\r
+ size_t total_out_size = 0;\r
+ uint8_t last_byte;\r
+ uint8_t last_byte_bits;\r
+ H10* hasher;\r
+\r
+ const size_t hasher_eff_size =\r
+ BROTLI_MIN(size_t, input_size, max_backward_limit + 16);\r
+\r
+ BrotliEncoderParams params;\r
+\r
+ const int lgmetablock = BROTLI_MIN(int, 24, lgwin + 1);\r
+ size_t max_block_size;\r
+ const size_t max_metablock_size = (size_t)1 << lgmetablock;\r
+ const size_t max_literals_per_metablock = max_metablock_size / 8;\r
+ const size_t max_commands_per_metablock = max_metablock_size / 8;\r
+ size_t metablock_start = 0;\r
+ uint8_t prev_byte = 0;\r
+ uint8_t prev_byte2 = 0;\r
+\r
+ params.mode = BROTLI_DEFAULT_MODE;\r
+ params.quality = 10;\r
+ params.lgwin = lgwin;\r
+ params.lgblock = 0;\r
+ SanitizeParams(¶ms);\r
+ params.lgblock = ComputeLgBlock(¶ms);\r
+ max_block_size = (size_t)1 << params.lgblock;\r
+\r
+ BrotliInitMemoryManager(m, 0, 0, 0);\r
+\r
+ assert(input_size <= mask + 1);\r
+ EncodeWindowBits(lgwin, &last_byte, &last_byte_bits);\r
+ hasher = BROTLI_ALLOC(m, H10, 1);\r
+ if (BROTLI_IS_OOM(m)) goto oom;\r
+ InitializeH10(hasher);\r
+ InitH10(m, hasher, input_buffer, ¶ms, 0, hasher_eff_size, 1);\r
+ if (BROTLI_IS_OOM(m)) goto oom;\r
+\r
+ while (ok && metablock_start < input_size) {\r
+ const size_t metablock_end =\r
+ BROTLI_MIN(size_t, input_size, metablock_start + max_metablock_size);\r
+ const size_t expected_num_commands =\r
+ (metablock_end - metablock_start) / 12 + 16;\r
+ Command* commands = 0;\r
+ size_t num_commands = 0;\r
+ size_t last_insert_len = 0;\r
+ size_t num_literals = 0;\r
+ size_t metablock_size = 0;\r
+ size_t cmd_alloc_size = 0;\r
+ BROTLI_BOOL is_last;\r
+ uint8_t* storage;\r
+ size_t storage_ix;\r
+\r
+ size_t block_start;\r
+ for (block_start = metablock_start; block_start < metablock_end; ) {\r
+ size_t block_size =\r
+ BROTLI_MIN(size_t, metablock_end - block_start, max_block_size);\r
+ ZopfliNode* nodes = BROTLI_ALLOC(m, ZopfliNode, block_size + 1);\r
+ size_t path_size;\r
+ size_t new_cmd_alloc_size;\r
+ if (BROTLI_IS_OOM(m)) goto oom;\r
+ BrotliInitZopfliNodes(nodes, block_size + 1);\r
+ StitchToPreviousBlockH10(hasher, block_size, block_start,\r
+ input_buffer, mask);\r
+ path_size = BrotliZopfliComputeShortestPath(\r
+ m, block_size, block_start, input_buffer, mask, ¶ms,\r
+ max_backward_limit, dist_cache, hasher, nodes);\r
+ if (BROTLI_IS_OOM(m)) goto oom;\r
+ /* We allocate a command buffer in the first iteration of this loop that\r
+ will be likely big enough for the whole metablock, so that for most\r
+ inputs we will not have to reallocate in later iterations. We do the\r
+ allocation here and not before the loop, because if the input is small,\r
+ this will be allocated after the zopfli cost model is freed, so this\r
+ will not increase peak memory usage.\r
+ TODO: If the first allocation is too small, increase command\r
+ buffer size exponentially. */\r
+ new_cmd_alloc_size = BROTLI_MAX(size_t, expected_num_commands,\r
+ num_commands + path_size + 1);\r
+ if (cmd_alloc_size != new_cmd_alloc_size) {\r
+ Command* new_commands = BROTLI_ALLOC(m, Command, new_cmd_alloc_size);\r
+ if (BROTLI_IS_OOM(m)) goto oom;\r
+ cmd_alloc_size = new_cmd_alloc_size;\r
+ if (commands) {\r
+ memcpy(new_commands, commands, sizeof(Command) * num_commands);\r
+ BROTLI_FREE(m, commands);\r
+ }\r
+ commands = new_commands;\r
+ }\r
+ BrotliZopfliCreateCommands(block_size, block_start, max_backward_limit,\r
+ &nodes[0], dist_cache, &last_insert_len,\r
+ &commands[num_commands], &num_literals);\r
+ num_commands += path_size;\r
+ block_start += block_size;\r
+ metablock_size += block_size;\r
+ BROTLI_FREE(m, nodes);\r
+ if (num_literals > max_literals_per_metablock ||\r
+ num_commands > max_commands_per_metablock) {\r
+ break;\r
+ }\r
+ }\r
+\r
+ if (last_insert_len > 0) {\r
+ InitInsertCommand(&commands[num_commands++], last_insert_len);\r
+ num_literals += last_insert_len;\r
+ }\r
+\r
+ is_last = TO_BROTLI_BOOL(metablock_start + metablock_size == input_size);\r
+ storage = NULL;\r
+ storage_ix = last_byte_bits;\r
+\r
+ if (metablock_size == 0) {\r
+ /* Write the ISLAST and ISEMPTY bits. */\r
+ storage = BROTLI_ALLOC(m, uint8_t, 16);\r
+ if (BROTLI_IS_OOM(m)) goto oom;\r
+ storage[0] = last_byte;\r
+ BrotliWriteBits(2, 3, &storage_ix, storage);\r
+ storage_ix = (storage_ix + 7u) & ~7u;\r
+ } else if (!ShouldCompress(input_buffer, mask, metablock_start,\r
+ metablock_size, num_literals, num_commands)) {\r
+ /* Restore the distance cache, as its last update by\r
+ CreateBackwardReferences is now unused. */\r
+ memcpy(dist_cache, saved_dist_cache, 4 * sizeof(dist_cache[0]));\r
+ storage = BROTLI_ALLOC(m, uint8_t, metablock_size + 16);\r
+ if (BROTLI_IS_OOM(m)) goto oom;\r
+ storage[0] = last_byte;\r
+ BrotliStoreUncompressedMetaBlock(is_last, input_buffer,\r
+ metablock_start, mask, metablock_size,\r
+ &storage_ix, storage);\r
+ } else {\r
+ uint32_t num_direct_distance_codes = 0;\r
+ uint32_t distance_postfix_bits = 0;\r
+ ContextType literal_context_mode = CONTEXT_UTF8;\r
+ MetaBlockSplit mb;\r
+ InitMetaBlockSplit(&mb);\r
+ if (!BrotliIsMostlyUTF8(input_buffer, metablock_start, mask,\r
+ metablock_size, kMinUTF8Ratio)) {\r
+ literal_context_mode = CONTEXT_SIGNED;\r
+ }\r
+ BrotliBuildMetaBlock(m, input_buffer, metablock_start, mask, ¶ms,\r
+ prev_byte, prev_byte2,\r
+ commands, num_commands,\r
+ literal_context_mode,\r
+ &mb);\r
+ if (BROTLI_IS_OOM(m)) goto oom;\r
+ BrotliOptimizeHistograms(num_direct_distance_codes,\r
+ distance_postfix_bits,\r
+ &mb);\r
+ storage = BROTLI_ALLOC(m, uint8_t, 2 * metablock_size + 500);\r
+ if (BROTLI_IS_OOM(m)) goto oom;\r
+ storage[0] = last_byte;\r
+ BrotliStoreMetaBlock(m, input_buffer, metablock_start, metablock_size,\r
+ mask, prev_byte, prev_byte2,\r
+ is_last,\r
+ num_direct_distance_codes,\r
+ distance_postfix_bits,\r
+ literal_context_mode,\r
+ commands, num_commands,\r
+ &mb,\r
+ &storage_ix, storage);\r
+ if (BROTLI_IS_OOM(m)) goto oom;\r
+ if (metablock_size + 4 < (storage_ix >> 3)) {\r
+ /* Restore the distance cache and last byte. */\r
+ memcpy(dist_cache, saved_dist_cache, 4 * sizeof(dist_cache[0]));\r
+ storage[0] = last_byte;\r
+ storage_ix = last_byte_bits;\r
+ BrotliStoreUncompressedMetaBlock(is_last, input_buffer,\r
+ metablock_start, mask,\r
+ metablock_size, &storage_ix, storage);\r
+ }\r
+ DestroyMetaBlockSplit(m, &mb);\r
+ }\r
+ last_byte = storage[storage_ix >> 3];\r
+ last_byte_bits = storage_ix & 7u;\r
+ metablock_start += metablock_size;\r
+ prev_byte = input_buffer[metablock_start - 1];\r
+ prev_byte2 = input_buffer[metablock_start - 2];\r
+ /* Save the state of the distance cache in case we need to restore it for\r
+ emitting an uncompressed block. */\r
+ memcpy(saved_dist_cache, dist_cache, 4 * sizeof(dist_cache[0]));\r
+\r
+ {\r
+ const size_t out_size = storage_ix >> 3;\r
+ total_out_size += out_size;\r
+ if (total_out_size <= max_out_size) {\r
+ memcpy(encoded_buffer, storage, out_size);\r
+ encoded_buffer += out_size;\r
+ } else {\r
+ ok = BROTLI_FALSE;\r
+ }\r
+ }\r
+ BROTLI_FREE(m, storage);\r
+ BROTLI_FREE(m, commands);\r
+ }\r
+\r
+ *encoded_size = total_out_size;\r
+ CleanupH10(m, hasher);\r
+ BROTLI_FREE(m, hasher);\r
+ return ok;\r
+\r
+oom:\r
+ BrotliWipeOutMemoryManager(m);\r
+ return BROTLI_FALSE;\r
+}\r
+\r
+size_t BrotliEncoderMaxCompressedSize(size_t input_size) {\r
+ /* [window bits / empty metadata] + N * [uncompressed] + [last empty] */\r
+ size_t num_large_blocks = input_size >> 24;\r
+ size_t tail = input_size - (num_large_blocks << 24);\r
+ size_t tail_overhead = (tail > (1 << 20)) ? 4 : 3;\r
+ size_t overhead = 2 + (4 * num_large_blocks) + tail_overhead + 1;\r
+ size_t result = input_size + overhead;\r
+ if (input_size == 0) return 1;\r
+ return (result < input_size) ? 0 : result;\r
+}\r
+\r
+/* Wraps data to uncompressed brotli stream with minimal window size.\r
+ |output| should point at region with at least BrotliEncoderMaxCompressedSize\r
+ addressable bytes.\r
+ Returns the length of stream. */\r
+static size_t MakeUncompressedStream(\r
+ const uint8_t* input, size_t input_size, uint8_t* output) {\r
+ size_t size = input_size;\r
+ size_t result = 0;\r
+ size_t offset = 0;\r
+ if (input_size == 0) {\r
+ output[0] = 6;\r
+ return 1;\r
+ }\r
+ output[result++] = 0x21; /* window bits = 10, is_last = false */\r
+ output[result++] = 0x03; /* empty metadata, padding */\r
+ while (size > 0) {\r
+ uint32_t nibbles = 0;\r
+ uint32_t chunk_size;\r
+ uint32_t bits;\r
+ chunk_size = (size > (1u << 24)) ? (1u << 24) : (uint32_t)size;\r
+ if (chunk_size > (1u << 16)) nibbles = (chunk_size > (1u << 20)) ? 2 : 1;\r
+ bits =\r
+ (nibbles << 1) | ((chunk_size - 1) << 3) | (1u << (19 + 4 * nibbles));\r
+ output[result++] = (uint8_t)bits;\r
+ output[result++] = (uint8_t)(bits >> 8);\r
+ output[result++] = (uint8_t)(bits >> 16);\r
+ if (nibbles == 2) output[result++] = (uint8_t)(bits >> 24);\r
+ memcpy(&output[result], &input[offset], chunk_size);\r
+ result += chunk_size;\r
+ offset += chunk_size;\r
+ size -= chunk_size;\r
+ }\r
+ output[result++] = 3;\r
+ return result;\r
+}\r
+\r
+BROTLI_BOOL BrotliEncoderCompress(\r
+ int quality, int lgwin, BrotliEncoderMode mode, size_t input_size,\r
+ const uint8_t* input_buffer, size_t* encoded_size,\r
+ uint8_t* encoded_buffer) {\r
+ BrotliEncoderState* s;\r
+ size_t out_size = *encoded_size;\r
+ const uint8_t* input_start = input_buffer;\r
+ uint8_t* output_start = encoded_buffer;\r
+ size_t max_out_size = BrotliEncoderMaxCompressedSize(input_size);\r
+ if (out_size == 0) {\r
+ /* Output buffer needs at least one byte. */\r
+ return BROTLI_FALSE;\r
+ }\r
+ if (input_size == 0) {\r
+ /* Handle the special case of empty input. */\r
+ *encoded_size = 1;\r
+ *encoded_buffer = 6;\r
+ return BROTLI_TRUE;\r
+ }\r
+ if (quality == 10) {\r
+ /* TODO: Implement this direct path for all quality levels. */\r
+ const int lg_win = BROTLI_MIN(int, 24, BROTLI_MAX(int, 16, lgwin));\r
+ int ok = BrotliCompressBufferQuality10(lg_win, input_size, input_buffer,\r
+ encoded_size, encoded_buffer);\r
+ if (!ok || (max_out_size && *encoded_size > max_out_size)) {\r
+ goto fallback;\r
+ }\r
+ return BROTLI_TRUE;\r
+ }\r
+\r
+ s = BrotliEncoderCreateInstance(0, 0, 0);\r
+ if (!s) {\r
+ return BROTLI_FALSE;\r
+ } else {\r
+ size_t available_in = input_size;\r
+ const uint8_t* next_in = input_buffer;\r
+ size_t available_out = *encoded_size;\r
+ uint8_t* next_out = encoded_buffer;\r
+ size_t total_out = 0;\r
+ BROTLI_BOOL result = BROTLI_FALSE;\r
+ BrotliEncoderSetParameter(s, BROTLI_PARAM_QUALITY, (uint32_t)quality);\r
+ BrotliEncoderSetParameter(s, BROTLI_PARAM_LGWIN, (uint32_t)lgwin);\r
+ BrotliEncoderSetParameter(s, BROTLI_PARAM_MODE, (uint32_t)mode);\r
+ result = BrotliEncoderCompressStream(s, BROTLI_OPERATION_FINISH,\r
+ &available_in, &next_in, &available_out, &next_out, &total_out);\r
+ if (!BrotliEncoderIsFinished(s)) result = 0;\r
+ *encoded_size = total_out;\r
+ BrotliEncoderDestroyInstance(s);\r
+ if (!result || (max_out_size && *encoded_size > max_out_size)) {\r
+ goto fallback;\r
+ }\r
+ return BROTLI_TRUE;\r
+ }\r
+fallback:\r
+ *encoded_size = 0;\r
+ if (!max_out_size) return BROTLI_FALSE;\r
+ if (out_size >= max_out_size) {\r
+ *encoded_size =\r
+ MakeUncompressedStream(input_start, input_size, output_start);\r
+ return BROTLI_TRUE;\r
+ }\r
+ return BROTLI_FALSE;\r
+}\r
+\r
+static void InjectBytePaddingBlock(BrotliEncoderState* s) {\r
+ uint32_t seal = s->last_byte_;\r
+ size_t seal_bits = s->last_byte_bits_;\r
+ s->last_byte_ = 0;\r
+ s->last_byte_bits_ = 0;\r
+ /* is_last = 0, data_nibbles = 11, reseved = 0, meta_nibbles = 00 */\r
+ seal |= 0x6u << seal_bits;\r
+ seal_bits += 6;\r
+ s->flush_buf_[0] = (uint8_t)seal;\r
+ if (seal_bits > 8) s->flush_buf_[1] = (uint8_t)(seal >> 8);\r
+ s->next_out_ = s->flush_buf_;\r
+ s->available_out_ = (seal_bits + 7) >> 3;\r
+}\r
+\r
+static BROTLI_BOOL BrotliEncoderCompressStreamFast(\r
+ BrotliEncoderState* s, BrotliEncoderOperation op, size_t* available_in,\r
+ const uint8_t** next_in, size_t* available_out, uint8_t** next_out,\r
+ size_t* total_out) {\r
+ const size_t block_size_limit = (size_t)1 << s->params.lgwin;\r
+ const size_t buf_size = BROTLI_MIN(size_t, kCompressFragmentTwoPassBlockSize,\r
+ BROTLI_MIN(size_t, *available_in, block_size_limit));\r
+ uint32_t* tmp_command_buf = NULL;\r
+ uint32_t* command_buf = NULL;\r
+ uint8_t* tmp_literal_buf = NULL;\r
+ uint8_t* literal_buf = NULL;\r
+ MemoryManager* m = &s->memory_manager_;\r
+ if (s->params.quality != FAST_ONE_PASS_COMPRESSION_QUALITY &&\r
+ s->params.quality != FAST_TWO_PASS_COMPRESSION_QUALITY) {\r
+ return BROTLI_FALSE;\r
+ }\r
+ if (s->params.quality == FAST_TWO_PASS_COMPRESSION_QUALITY) {\r
+ if (!s->command_buf_ && buf_size == kCompressFragmentTwoPassBlockSize) {\r
+ s->command_buf_ =\r
+ BROTLI_ALLOC(m, uint32_t, kCompressFragmentTwoPassBlockSize);\r
+ s->literal_buf_ =\r
+ BROTLI_ALLOC(m, uint8_t, kCompressFragmentTwoPassBlockSize);\r
+ if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\r
+ }\r
+ if (s->command_buf_) {\r
+ command_buf = s->command_buf_;\r
+ literal_buf = s->literal_buf_;\r
+ } else {\r
+ tmp_command_buf = BROTLI_ALLOC(m, uint32_t, buf_size);\r
+ tmp_literal_buf = BROTLI_ALLOC(m, uint8_t, buf_size);\r
+ if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\r
+ command_buf = tmp_command_buf;\r
+ literal_buf = tmp_literal_buf;\r
+ }\r
+ }\r
+\r
+ while (BROTLI_TRUE) {\r
+ if (s->available_out_ == 0 &&\r
+ s->stream_state_ == BROTLI_STREAM_FLUSH_REQUESTED) {\r
+ s->stream_state_ = BROTLI_STREAM_PROCESSING;\r
+ if (s->last_byte_bits_ == 0) break;\r
+ InjectBytePaddingBlock(s);\r
+ continue;\r
+ }\r
+\r
+ if (s->available_out_ != 0 && *available_out != 0) {\r
+ size_t copy_output_size =\r
+ BROTLI_MIN(size_t, s->available_out_, *available_out);\r
+ memcpy(*next_out, s->next_out_, copy_output_size);\r
+ *next_out += copy_output_size;\r
+ *available_out -= copy_output_size;\r
+ s->next_out_ += copy_output_size;\r
+ s->available_out_ -= copy_output_size;\r
+ s->total_out_ += copy_output_size;\r
+ if (total_out) *total_out = s->total_out_;\r
+ continue;\r
+ }\r
+\r
+ /* Compress block only when internal output buffer is empty, stream is not\r
+ finished, there is no pending flush request, and there is either\r
+ additional input or pending operation. */\r
+ if (s->available_out_ == 0 &&\r
+ s->stream_state_ == BROTLI_STREAM_PROCESSING &&\r
+ (*available_in != 0 || op != BROTLI_OPERATION_PROCESS)) {\r
+ size_t block_size = BROTLI_MIN(size_t, block_size_limit, *available_in);\r
+ BROTLI_BOOL is_last =\r
+ (*available_in == block_size) && (op == BROTLI_OPERATION_FINISH);\r
+ BROTLI_BOOL force_flush =\r
+ (*available_in == block_size) && (op == BROTLI_OPERATION_FLUSH);\r
+ size_t max_out_size = 2 * block_size + 500;\r
+ BROTLI_BOOL inplace = BROTLI_TRUE;\r
+ uint8_t* storage = NULL;\r
+ size_t storage_ix = s->last_byte_bits_;\r
+ size_t table_size;\r
+ int* table;\r
+\r
+ if (force_flush && block_size == 0) {\r
+ s->stream_state_ = BROTLI_STREAM_FLUSH_REQUESTED;\r
+ continue;\r
+ }\r
+ if (max_out_size <= *available_out) {\r
+ storage = *next_out;\r
+ } else {\r
+ inplace = 0;\r
+ storage = GetBrotliStorage(s, max_out_size);\r
+ if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\r
+ }\r
+ storage[0] = s->last_byte_;\r
+ table = GetHashTable(s, s->params.quality, block_size, &table_size);\r
+ if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\r
+\r
+ if (s->params.quality == FAST_ONE_PASS_COMPRESSION_QUALITY) {\r
+ BrotliCompressFragmentFast(m, *next_in, block_size, is_last, table,\r
+ table_size, s->cmd_depths_, s->cmd_bits_, &s->cmd_code_numbits_,\r
+ s->cmd_code_, &storage_ix, storage);\r
+ if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\r
+ } else {\r
+ BrotliCompressFragmentTwoPass(m, *next_in, block_size, is_last,\r
+ command_buf, literal_buf, table, table_size,\r
+ &storage_ix, storage);\r
+ if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\r
+ }\r
+ *next_in += block_size;\r
+ *available_in -= block_size;\r
+ if (inplace) {\r
+ size_t out_bytes = storage_ix >> 3;\r
+ assert(out_bytes <= *available_out);\r
+ assert((storage_ix & 7) == 0 || out_bytes < *available_out);\r
+ *next_out += out_bytes;\r
+ *available_out -= out_bytes;\r
+ s->total_out_ += out_bytes;\r
+ if (total_out) *total_out = s->total_out_;\r
+ } else {\r
+ size_t out_bytes = storage_ix >> 3;\r
+ s->next_out_ = storage;\r
+ s->available_out_ = out_bytes;\r
+ }\r
+ s->last_byte_ = storage[storage_ix >> 3];\r
+ s->last_byte_bits_ = storage_ix & 7u;\r
+\r
+ if (force_flush) s->stream_state_ = BROTLI_STREAM_FLUSH_REQUESTED;\r
+ if (is_last) s->stream_state_ = BROTLI_STREAM_FINISHED;\r
+ continue;\r
+ }\r
+ break;\r
+ }\r
+ BROTLI_FREE(m, tmp_command_buf);\r
+ BROTLI_FREE(m, tmp_literal_buf);\r
+ return BROTLI_TRUE;\r
+}\r
+\r
+BROTLI_BOOL BrotliEncoderCompressStream(\r
+ BrotliEncoderState* s, BrotliEncoderOperation op, size_t* available_in,\r
+ const uint8_t** next_in, size_t* available_out,uint8_t** next_out,\r
+ size_t* total_out) {\r
+ if (!EnsureInitialized(s)) return BROTLI_FALSE;\r
+\r
+ if (s->stream_state_ != BROTLI_STREAM_PROCESSING && *available_in != 0) {\r
+ return BROTLI_FALSE;\r
+ }\r
+ if (s->params.quality == FAST_ONE_PASS_COMPRESSION_QUALITY ||\r
+ s->params.quality == FAST_TWO_PASS_COMPRESSION_QUALITY) {\r
+ return BrotliEncoderCompressStreamFast(s, op, available_in, next_in,\r
+ available_out, next_out, total_out);\r
+ }\r
+ while (BROTLI_TRUE) {\r
+ size_t remaining_block_size = RemainingInputBlockSize(s);\r
+\r
+ if (remaining_block_size != 0 && *available_in != 0) {\r
+ size_t copy_input_size =\r
+ BROTLI_MIN(size_t, remaining_block_size, *available_in);\r
+ BrotliEncoderCopyInputToRingBuffer(s, copy_input_size, *next_in);\r
+ *next_in += copy_input_size;\r
+ *available_in -= copy_input_size;\r
+ continue;\r
+ }\r
+\r
+ if (s->available_out_ == 0 &&\r
+ s->stream_state_ == BROTLI_STREAM_FLUSH_REQUESTED) {\r
+ s->stream_state_ = BROTLI_STREAM_PROCESSING;\r
+ if (s->last_byte_bits_ == 0) break;\r
+ InjectBytePaddingBlock(s);\r
+ continue;\r
+ }\r
+\r
+ if (s->available_out_ != 0 && *available_out != 0) {\r
+ size_t copy_output_size =\r
+ BROTLI_MIN(size_t, s->available_out_, *available_out);\r
+ memcpy(*next_out, s->next_out_, copy_output_size);\r
+ *next_out += copy_output_size;\r
+ *available_out -= copy_output_size;\r
+ s->next_out_ += copy_output_size;\r
+ s->available_out_ -= copy_output_size;\r
+ s->total_out_ += copy_output_size;\r
+ if (total_out) *total_out = s->total_out_;\r
+ continue;\r
+ }\r
+\r
+ /* Compress data only when internal outpuf buffer is empty, stream is not\r
+ finished and there is no pending flush request. */\r
+ if (s->available_out_ == 0 &&\r
+ s->stream_state_ == BROTLI_STREAM_PROCESSING) {\r
+ if (remaining_block_size == 0 || op != BROTLI_OPERATION_PROCESS) {\r
+ BROTLI_BOOL is_last = TO_BROTLI_BOOL(\r
+ (*available_in == 0) && op == BROTLI_OPERATION_FINISH);\r
+ BROTLI_BOOL force_flush = TO_BROTLI_BOOL(\r
+ (*available_in == 0) && op == BROTLI_OPERATION_FLUSH);\r
+ BROTLI_BOOL result = BrotliEncoderWriteData(s, is_last, force_flush,\r
+ &s->available_out_, &s->next_out_);\r
+ if (!result) return BROTLI_FALSE;\r
+ if (force_flush) s->stream_state_ = BROTLI_STREAM_FLUSH_REQUESTED;\r
+ if (is_last) s->stream_state_ = BROTLI_STREAM_FINISHED;\r
+ continue;\r
+ }\r
+ }\r
+ break;\r
+ }\r
+ return BROTLI_TRUE;\r
+}\r
+\r
+BROTLI_BOOL BrotliEncoderIsFinished(BrotliEncoderState* s) {\r
+ return TO_BROTLI_BOOL(s->stream_state_ == BROTLI_STREAM_FINISHED &&\r
+ !BrotliEncoderHasMoreOutput(s));\r
+}\r
+\r
+BROTLI_BOOL BrotliEncoderHasMoreOutput(BrotliEncoderState* s) {\r
+ return TO_BROTLI_BOOL(s->available_out_ != 0);\r
+}\r
+\r
+\r
+#if defined(__cplusplus) || defined(c_plusplus)\r
+} /* extern "C" */\r
+#endif\r
projects / mirror_edk2.git / blobdiff