1 /* Copyright 2015 Google Inc. All Rights Reserved. 2 3 Distributed under MIT license. 4 See file LICENSE for detail or copy at https://opensource.org/licenses/MIT 5 */ 6 7 #include "./state.h" 8 9 #include <stdlib.h> /* free, malloc */ 10 11 #include <brotli/types.h> 12 #include "./huffman.h" 13 14 #if defined(__cplusplus) || defined(c_plusplus) 15 extern "C" { 16 #endif 17 18 static void* DefaultAllocFunc(void* opaque, size_t size) { 19 BROTLI_UNUSED(opaque); 20 return malloc(size); 21 } 22 23 static void DefaultFreeFunc(void* opaque, void* address) { 24 BROTLI_UNUSED(opaque); 25 free(address); 26 } 27 28 void BrotliDecoderStateInit(BrotliDecoderState* s) { 29 BrotliDecoderStateInitWithCustomAllocators(s, 0, 0, 0); 30 } 31 32 void BrotliDecoderStateInitWithCustomAllocators(BrotliDecoderState* s, 33 brotli_alloc_func alloc_func, brotli_free_func free_func, void* opaque) { 34 if (!alloc_func) { 35 s->alloc_func = DefaultAllocFunc; 36 s->free_func = DefaultFreeFunc; 37 s->memory_manager_opaque = 0; 38 } else { 39 s->alloc_func = alloc_func; 40 s->free_func = free_func; 41 s->memory_manager_opaque = opaque; 42 } 43 44 BrotliInitBitReader(&s->br); 45 s->state = BROTLI_STATE_UNINITED; 46 s->substate_metablock_header = BROTLI_STATE_METABLOCK_HEADER_NONE; 47 s->substate_tree_group = BROTLI_STATE_TREE_GROUP_NONE; 48 s->substate_context_map = BROTLI_STATE_CONTEXT_MAP_NONE; 49 s->substate_uncompressed = BROTLI_STATE_UNCOMPRESSED_NONE; 50 s->substate_huffman = BROTLI_STATE_HUFFMAN_NONE; 51 s->substate_decode_uint8 = BROTLI_STATE_DECODE_UINT8_NONE; 52 s->substate_read_block_length = BROTLI_STATE_READ_BLOCK_LENGTH_NONE; 53 54 s->dictionary = BrotliGetDictionary(); 55 56 s->buffer_length = 0; 57 s->loop_counter = 0; 58 s->pos = 0; 59 s->rb_roundtrips = 0; 60 s->partial_pos_out = 0; 61 62 s->block_type_trees = NULL; 63 s->block_len_trees = NULL; 64 s->ringbuffer = NULL; 65 s->ringbuffer_size = 0; 66 s->new_ringbuffer_size = 0; 67 s->ringbuffer_mask = 0; 68 69 s->context_map = NULL; 70 s->context_modes = NULL; 71 s->dist_context_map = NULL; 72 s->context_map_slice = NULL; 73 s->dist_context_map_slice = NULL; 74 75 s->sub_loop_counter = 0; 76 77 s->literal_hgroup.codes = NULL; 78 s->literal_hgroup.htrees = NULL; 79 s->insert_copy_hgroup.codes = NULL; 80 s->insert_copy_hgroup.htrees = NULL; 81 s->distance_hgroup.codes = NULL; 82 s->distance_hgroup.htrees = NULL; 83 84 s->custom_dict = NULL; 85 s->custom_dict_size = 0; 86 87 s->is_last_metablock = 0; 88 s->should_wrap_ringbuffer = 0; 89 s->window_bits = 0; 90 s->max_distance = 0; 91 s->dist_rb[0] = 16; 92 s->dist_rb[1] = 15; 93 s->dist_rb[2] = 11; 94 s->dist_rb[3] = 4; 95 s->dist_rb_idx = 0; 96 s->block_type_trees = NULL; 97 s->block_len_trees = NULL; 98 99 /* Make small negative indexes addressable. */ 100 s->symbol_lists = &s->symbols_lists_array[BROTLI_HUFFMAN_MAX_CODE_LENGTH + 1]; 101 102 s->mtf_upper_bound = 63; 103 } 104 105 void BrotliDecoderStateMetablockBegin(BrotliDecoderState* s) { 106 s->meta_block_remaining_len = 0; 107 s->block_length[0] = 1U << 28; 108 s->block_length[1] = 1U << 28; 109 s->block_length[2] = 1U << 28; 110 s->num_block_types[0] = 1; 111 s->num_block_types[1] = 1; 112 s->num_block_types[2] = 1; 113 s->block_type_rb[0] = 1; 114 s->block_type_rb[1] = 0; 115 s->block_type_rb[2] = 1; 116 s->block_type_rb[3] = 0; 117 s->block_type_rb[4] = 1; 118 s->block_type_rb[5] = 0; 119 s->context_map = NULL; 120 s->context_modes = NULL; 121 s->dist_context_map = NULL; 122 s->context_map_slice = NULL; 123 s->literal_htree = NULL; 124 s->dist_context_map_slice = NULL; 125 s->dist_htree_index = 0; 126 s->context_lookup1 = NULL; 127 s->context_lookup2 = NULL; 128 s->literal_hgroup.codes = NULL; 129 s->literal_hgroup.htrees = NULL; 130 s->insert_copy_hgroup.codes = NULL; 131 s->insert_copy_hgroup.htrees = NULL; 132 s->distance_hgroup.codes = NULL; 133 s->distance_hgroup.htrees = NULL; 134 } 135 136 void BrotliDecoderStateCleanupAfterMetablock(BrotliDecoderState* s) { 137 BROTLI_FREE(s, s->context_modes); 138 BROTLI_FREE(s, s->context_map); 139 BROTLI_FREE(s, s->dist_context_map); 140 BROTLI_FREE(s, s->literal_hgroup.htrees); 141 BROTLI_FREE(s, s->insert_copy_hgroup.htrees); 142 BROTLI_FREE(s, s->distance_hgroup.htrees); 143 } 144 145 void BrotliDecoderStateCleanup(BrotliDecoderState* s) { 146 BrotliDecoderStateCleanupAfterMetablock(s); 147 148 BROTLI_FREE(s, s->ringbuffer); 149 BROTLI_FREE(s, s->block_type_trees); 150 } 151 152 BROTLI_BOOL BrotliDecoderHuffmanTreeGroupInit(BrotliDecoderState* s, 153 HuffmanTreeGroup* group, uint32_t alphabet_size, uint32_t ntrees) { 154 /* Pack two allocations into one */ 155 const size_t max_table_size = kMaxHuffmanTableSize[(alphabet_size + 31) >> 5]; 156 const size_t code_size = sizeof(HuffmanCode) * ntrees * max_table_size; 157 const size_t htree_size = sizeof(HuffmanCode*) * ntrees; 158 /* Pointer alignment is, hopefully, wider than sizeof(HuffmanCode). */ 159 HuffmanCode** p = (HuffmanCode**)BROTLI_ALLOC(s, code_size + htree_size); 160 group->alphabet_size = (uint16_t)alphabet_size; 161 group->num_htrees = (uint16_t)ntrees; 162 group->htrees = p; 163 group->codes = (HuffmanCode*)(&p[ntrees]); 164 return !!p; 165 } 166 167 #if defined(__cplusplus) || defined(c_plusplus) 168 } /* extern "C" */ 169 #endif 170
