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