MdeModulePkg: Copy Brotli algorithm 3rd party source code for library

[mirror_edk2.git] / MdeModulePkg / Library / BrotliCustomDecompressLib / dec / state.c

/* Copyright 2015 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
#include "./state.h"\r
\r
#include <stdlib.h>  /* free, malloc */\r
\r
#include "../common/types.h"\r
#include "./huffman.h"\r
\r
#if defined(__cplusplus) || defined(c_plusplus)\r
extern "C" {\r
#endif\r
\r
static void* DefaultAllocFunc(void* opaque, size_t size) {\r
  BROTLI_UNUSED(opaque);\r
  return malloc(size);\r
}\r
\r
static void DefaultFreeFunc(void* opaque, void* address) {\r
  BROTLI_UNUSED(opaque);\r
  free(address);\r
}\r
\r
void BrotliDecoderStateInit(BrotliDecoderState* s) {\r
  BrotliDecoderStateInitWithCustomAllocators(s, 0, 0, 0);\r
}\r
\r
void BrotliDecoderStateInitWithCustomAllocators(BrotliDecoderState* s,\r
    brotli_alloc_func alloc_func, brotli_free_func free_func, void* opaque) {\r
  if (!alloc_func) {\r
    s->alloc_func = DefaultAllocFunc;\r
    s->free_func = DefaultFreeFunc;\r
    s->memory_manager_opaque = 0;\r
  } else {\r
    s->alloc_func = alloc_func;\r
    s->free_func = free_func;\r
    s->memory_manager_opaque = opaque;\r
  }\r
\r
  BrotliInitBitReader(&s->br);\r
  s->state = BROTLI_STATE_UNINITED;\r
  s->substate_metablock_header = BROTLI_STATE_METABLOCK_HEADER_NONE;\r
  s->substate_tree_group = BROTLI_STATE_TREE_GROUP_NONE;\r
  s->substate_context_map = BROTLI_STATE_CONTEXT_MAP_NONE;\r
  s->substate_uncompressed = BROTLI_STATE_UNCOMPRESSED_NONE;\r
  s->substate_huffman = BROTLI_STATE_HUFFMAN_NONE;\r
  s->substate_decode_uint8 = BROTLI_STATE_DECODE_UINT8_NONE;\r
  s->substate_read_block_length = BROTLI_STATE_READ_BLOCK_LENGTH_NONE;\r
\r
  s->buffer_length = 0;\r
  s->loop_counter = 0;\r
  s->pos = 0;\r
  s->rb_roundtrips = 0;\r
  s->partial_pos_out = 0;\r
\r
  s->block_type_trees = NULL;\r
  s->block_len_trees = NULL;\r
  s->ringbuffer = NULL;\r
\r
  s->context_map = NULL;\r
  s->context_modes = NULL;\r
  s->dist_context_map = NULL;\r
  s->context_map_slice = NULL;\r
  s->dist_context_map_slice = NULL;\r
\r
  s->sub_loop_counter = 0;\r
\r
  s->literal_hgroup.codes = NULL;\r
  s->literal_hgroup.htrees = NULL;\r
  s->insert_copy_hgroup.codes = NULL;\r
  s->insert_copy_hgroup.htrees = NULL;\r
  s->distance_hgroup.codes = NULL;\r
  s->distance_hgroup.htrees = NULL;\r
\r
  s->custom_dict = NULL;\r
  s->custom_dict_size = 0;\r
\r
  s->is_last_metablock = 0;\r
  s->window_bits = 0;\r
  s->max_distance = 0;\r
  s->dist_rb[0] = 16;\r
  s->dist_rb[1] = 15;\r
  s->dist_rb[2] = 11;\r
  s->dist_rb[3] = 4;\r
  s->dist_rb_idx = 0;\r
  s->block_type_trees = NULL;\r
  s->block_len_trees = NULL;\r
\r
  /* Make small negative indexes addressable. */\r
  s->symbol_lists = &s->symbols_lists_array[BROTLI_HUFFMAN_MAX_CODE_LENGTH + 1];\r
\r
  s->mtf_upper_bound = 255;\r
}\r
\r
void BrotliDecoderStateMetablockBegin(BrotliDecoderState* s) {\r
  s->meta_block_remaining_len = 0;\r
  s->block_length[0] = 1U << 28;\r
  s->block_length[1] = 1U << 28;\r
  s->block_length[2] = 1U << 28;\r
  s->num_block_types[0] = 1;\r
  s->num_block_types[1] = 1;\r
  s->num_block_types[2] = 1;\r
  s->block_type_rb[0] = 1;\r
  s->block_type_rb[1] = 0;\r
  s->block_type_rb[2] = 1;\r
  s->block_type_rb[3] = 0;\r
  s->block_type_rb[4] = 1;\r
  s->block_type_rb[5] = 0;\r
  s->context_map = NULL;\r
  s->context_modes = NULL;\r
  s->dist_context_map = NULL;\r
  s->context_map_slice = NULL;\r
  s->literal_htree = NULL;\r
  s->dist_context_map_slice = NULL;\r
  s->dist_htree_index = 0;\r
  s->context_lookup1 = NULL;\r
  s->context_lookup2 = NULL;\r
  s->literal_hgroup.codes = NULL;\r
  s->literal_hgroup.htrees = NULL;\r
  s->insert_copy_hgroup.codes = NULL;\r
  s->insert_copy_hgroup.htrees = NULL;\r
  s->distance_hgroup.codes = NULL;\r
  s->distance_hgroup.htrees = NULL;\r
}\r
\r
void BrotliDecoderStateCleanupAfterMetablock(BrotliDecoderState* s) {\r
  BROTLI_FREE(s, s->context_modes);\r
  BROTLI_FREE(s, s->context_map);\r
  BROTLI_FREE(s, s->dist_context_map);\r
\r
  BrotliDecoderHuffmanTreeGroupRelease(s, &s->literal_hgroup);\r
  BrotliDecoderHuffmanTreeGroupRelease(s, &s->insert_copy_hgroup);\r
  BrotliDecoderHuffmanTreeGroupRelease(s, &s->distance_hgroup);\r
}\r
\r
void BrotliDecoderStateCleanup(BrotliDecoderState* s) {\r
  BrotliDecoderStateCleanupAfterMetablock(s);\r
\r
  BROTLI_FREE(s, s->ringbuffer);\r
  BROTLI_FREE(s, s->block_type_trees);\r
}\r
\r
void BrotliDecoderHuffmanTreeGroupInit(BrotliDecoderState* s,\r
    HuffmanTreeGroup* group, uint32_t alphabet_size, uint32_t ntrees) {\r
  /* Pack two allocations into one */\r
  const size_t max_table_size = kMaxHuffmanTableSize[(alphabet_size + 31) >> 5];\r
  const size_t code_size = sizeof(HuffmanCode) * ntrees * max_table_size;\r
  const size_t htree_size = sizeof(HuffmanCode*) * ntrees;\r
  char* p = (char*)BROTLI_ALLOC(s, code_size + htree_size);\r
  group->alphabet_size = (uint16_t)alphabet_size;\r
  group->num_htrees = (uint16_t)ntrees;\r
  group->codes = (HuffmanCode*)p;\r
  group->htrees = (HuffmanCode**)(p + code_size);\r
}\r
\r
void BrotliDecoderHuffmanTreeGroupRelease(\r
    BrotliDecoderState* s, HuffmanTreeGroup* group) {\r
  BROTLI_FREE(s, group->codes);\r
  group->htrees = NULL;\r
}\r
\r
#if defined(__cplusplus) || defined(c_plusplus)\r
}  /* extern "C" */\r
#endif\r