/src/ghostpdl/brotli/c/enc/static_dict.c
Line | Count | Source |
1 | | /* Copyright 2013 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 "static_dict.h" |
8 | | |
9 | | #include "../common/dictionary.h" |
10 | | #include "../common/platform.h" |
11 | | #include "../common/transform.h" |
12 | | #include "encoder_dict.h" |
13 | | #include "find_match_length.h" |
14 | | #include "hash_base.h" |
15 | | |
16 | | #if defined(__cplusplus) || defined(c_plusplus) |
17 | | extern "C" { |
18 | | #endif |
19 | | |
20 | | static BROTLI_INLINE void AddMatch(size_t distance, size_t len, size_t len_code, |
21 | 0 | uint32_t* matches) { |
22 | 0 | uint32_t match = (uint32_t)((distance << 5) + len_code); |
23 | 0 | matches[len] = BROTLI_MIN(uint32_t, matches[len], match); |
24 | 0 | } |
25 | | |
26 | | static BROTLI_INLINE size_t DictMatchLength(const BrotliDictionary* dictionary, |
27 | | const uint8_t* data, |
28 | | size_t id, |
29 | | size_t len, |
30 | 0 | size_t maxlen) { |
31 | 0 | const size_t offset = dictionary->offsets_by_length[len] + len * id; |
32 | 0 | return FindMatchLengthWithLimit(&dictionary->data[offset], data, |
33 | 0 | BROTLI_MIN(size_t, len, maxlen)); |
34 | 0 | } |
35 | | |
36 | | static BROTLI_INLINE BROTLI_BOOL IsMatch(const BrotliDictionary* dictionary, |
37 | 0 | DictWord w, const uint8_t* data, size_t max_length) { |
38 | 0 | if (w.len > max_length) { |
39 | 0 | return BROTLI_FALSE; |
40 | 0 | } else { |
41 | 0 | const size_t offset = dictionary->offsets_by_length[w.len] + |
42 | 0 | (size_t)w.len * (size_t)w.idx; |
43 | 0 | const uint8_t* dict = &dictionary->data[offset]; |
44 | 0 | if (w.transform == 0) { |
45 | | /* Match against base dictionary word. */ |
46 | 0 | return |
47 | 0 | TO_BROTLI_BOOL(FindMatchLengthWithLimit(dict, data, w.len) == w.len); |
48 | 0 | } else if (w.transform == 10) { |
49 | | /* Match against uppercase first transform. |
50 | | Note that there are only ASCII uppercase words in the lookup table. */ |
51 | 0 | return TO_BROTLI_BOOL(dict[0] >= 'a' && dict[0] <= 'z' && |
52 | 0 | (dict[0] ^ 32) == data[0] && |
53 | 0 | FindMatchLengthWithLimit(&dict[1], &data[1], w.len - 1u) == |
54 | 0 | w.len - 1u); |
55 | 0 | } else { |
56 | | /* Match against uppercase all transform. |
57 | | Note that there are only ASCII uppercase words in the lookup table. */ |
58 | 0 | size_t i; |
59 | 0 | for (i = 0; i < w.len; ++i) { |
60 | 0 | if (dict[i] >= 'a' && dict[i] <= 'z') { |
61 | 0 | if ((dict[i] ^ 32) != data[i]) return BROTLI_FALSE; |
62 | 0 | } else { |
63 | 0 | if (dict[i] != data[i]) return BROTLI_FALSE; |
64 | 0 | } |
65 | 0 | } |
66 | 0 | return BROTLI_TRUE; |
67 | 0 | } |
68 | 0 | } |
69 | 0 | } |
70 | | |
71 | | /* Finds matches for a single static dictionary */ |
72 | | static BROTLI_BOOL BrotliFindAllStaticDictionaryMatchesFor( |
73 | | const BrotliEncoderDictionary* dictionary, const uint8_t* data, |
74 | 0 | size_t min_length, size_t max_length, uint32_t* matches) { |
75 | 0 | BROTLI_BOOL has_found_match = BROTLI_FALSE; |
76 | | #if defined(BROTLI_EXPERIMENTAL) |
77 | | if (dictionary->has_words_heavy) { |
78 | | const BrotliTrieNode* node = &dictionary->trie.root; |
79 | | size_t l = 0; |
80 | | while (node && l < max_length) { |
81 | | uint8_t c; |
82 | | if (l >= min_length && node->len_) { |
83 | | AddMatch(node->idx_, l, node->len_, matches); |
84 | | has_found_match = BROTLI_TRUE; |
85 | | } |
86 | | c = data[l++]; |
87 | | node = BrotliTrieSub(&dictionary->trie, node, c); |
88 | | } |
89 | | return has_found_match; |
90 | | } |
91 | | #endif /* BROTLI_EXPERIMENTAL */ |
92 | 0 | { |
93 | 0 | size_t offset = dictionary->buckets[Hash15(data)]; |
94 | 0 | BROTLI_BOOL end = !offset; |
95 | 0 | while (!end) { |
96 | 0 | DictWord w = dictionary->dict_words[offset++]; |
97 | 0 | const size_t l = w.len & 0x1F; |
98 | 0 | const size_t n = (size_t)1 << dictionary->words->size_bits_by_length[l]; |
99 | 0 | const size_t id = w.idx; |
100 | 0 | end = !!(w.len & 0x80); |
101 | 0 | w.len = (uint8_t)l; |
102 | 0 | if (w.transform == 0) { |
103 | 0 | const size_t matchlen = |
104 | 0 | DictMatchLength(dictionary->words, data, id, l, max_length); |
105 | 0 | const uint8_t* s; |
106 | 0 | size_t minlen; |
107 | 0 | size_t maxlen; |
108 | 0 | size_t len; |
109 | | /* Transform "" + BROTLI_TRANSFORM_IDENTITY + "" */ |
110 | 0 | if (matchlen == l) { |
111 | 0 | AddMatch(id, l, l, matches); |
112 | 0 | has_found_match = BROTLI_TRUE; |
113 | 0 | } |
114 | | /* Transforms "" + BROTLI_TRANSFORM_OMIT_LAST_1 + "" and |
115 | | "" + BROTLI_TRANSFORM_OMIT_LAST_1 + "ing " */ |
116 | 0 | if (matchlen >= l - 1) { |
117 | 0 | AddMatch(id + 12 * n, l - 1, l, matches); |
118 | 0 | if (l + 2 < max_length && |
119 | 0 | data[l - 1] == 'i' && data[l] == 'n' && data[l + 1] == 'g' && |
120 | 0 | data[l + 2] == ' ') { |
121 | 0 | AddMatch(id + 49 * n, l + 3, l, matches); |
122 | 0 | } |
123 | 0 | has_found_match = BROTLI_TRUE; |
124 | 0 | } |
125 | | /* Transform "" + BROTLI_TRANSFORM_OMIT_LAST_# + "" (# = 2 .. 9) */ |
126 | 0 | minlen = min_length; |
127 | 0 | if (l > 9) minlen = BROTLI_MAX(size_t, minlen, l - 9); |
128 | 0 | maxlen = BROTLI_MIN(size_t, matchlen, l - 2); |
129 | 0 | for (len = minlen; len <= maxlen; ++len) { |
130 | 0 | size_t cut = l - len; |
131 | 0 | size_t transform_id = (cut << 2) + |
132 | 0 | (size_t)((dictionary->cutoffTransforms >> (cut * 6)) & 0x3F); |
133 | 0 | AddMatch(id + transform_id * n, len, l, matches); |
134 | 0 | has_found_match = BROTLI_TRUE; |
135 | 0 | } |
136 | 0 | if (matchlen < l || l + 6 >= max_length) { |
137 | 0 | continue; |
138 | 0 | } |
139 | 0 | s = &data[l]; |
140 | | /* Transforms "" + BROTLI_TRANSFORM_IDENTITY + <suffix> */ |
141 | 0 | if (s[0] == ' ') { |
142 | 0 | AddMatch(id + n, l + 1, l, matches); |
143 | 0 | if (s[1] == 'a') { |
144 | 0 | if (s[2] == ' ') { |
145 | 0 | AddMatch(id + 28 * n, l + 3, l, matches); |
146 | 0 | } else if (s[2] == 's') { |
147 | 0 | if (s[3] == ' ') AddMatch(id + 46 * n, l + 4, l, matches); |
148 | 0 | } else if (s[2] == 't') { |
149 | 0 | if (s[3] == ' ') AddMatch(id + 60 * n, l + 4, l, matches); |
150 | 0 | } else if (s[2] == 'n') { |
151 | 0 | if (s[3] == 'd' && s[4] == ' ') { |
152 | 0 | AddMatch(id + 10 * n, l + 5, l, matches); |
153 | 0 | } |
154 | 0 | } |
155 | 0 | } else if (s[1] == 'b') { |
156 | 0 | if (s[2] == 'y' && s[3] == ' ') { |
157 | 0 | AddMatch(id + 38 * n, l + 4, l, matches); |
158 | 0 | } |
159 | 0 | } else if (s[1] == 'i') { |
160 | 0 | if (s[2] == 'n') { |
161 | 0 | if (s[3] == ' ') AddMatch(id + 16 * n, l + 4, l, matches); |
162 | 0 | } else if (s[2] == 's') { |
163 | 0 | if (s[3] == ' ') AddMatch(id + 47 * n, l + 4, l, matches); |
164 | 0 | } |
165 | 0 | } else if (s[1] == 'f') { |
166 | 0 | if (s[2] == 'o') { |
167 | 0 | if (s[3] == 'r' && s[4] == ' ') { |
168 | 0 | AddMatch(id + 25 * n, l + 5, l, matches); |
169 | 0 | } |
170 | 0 | } else if (s[2] == 'r') { |
171 | 0 | if (s[3] == 'o' && s[4] == 'm' && s[5] == ' ') { |
172 | 0 | AddMatch(id + 37 * n, l + 6, l, matches); |
173 | 0 | } |
174 | 0 | } |
175 | 0 | } else if (s[1] == 'o') { |
176 | 0 | if (s[2] == 'f') { |
177 | 0 | if (s[3] == ' ') AddMatch(id + 8 * n, l + 4, l, matches); |
178 | 0 | } else if (s[2] == 'n') { |
179 | 0 | if (s[3] == ' ') AddMatch(id + 45 * n, l + 4, l, matches); |
180 | 0 | } |
181 | 0 | } else if (s[1] == 'n') { |
182 | 0 | if (s[2] == 'o' && s[3] == 't' && s[4] == ' ') { |
183 | 0 | AddMatch(id + 80 * n, l + 5, l, matches); |
184 | 0 | } |
185 | 0 | } else if (s[1] == 't') { |
186 | 0 | if (s[2] == 'h') { |
187 | 0 | if (s[3] == 'e') { |
188 | 0 | if (s[4] == ' ') AddMatch(id + 5 * n, l + 5, l, matches); |
189 | 0 | } else if (s[3] == 'a') { |
190 | 0 | if (s[4] == 't' && s[5] == ' ') { |
191 | 0 | AddMatch(id + 29 * n, l + 6, l, matches); |
192 | 0 | } |
193 | 0 | } |
194 | 0 | } else if (s[2] == 'o') { |
195 | 0 | if (s[3] == ' ') AddMatch(id + 17 * n, l + 4, l, matches); |
196 | 0 | } |
197 | 0 | } else if (s[1] == 'w') { |
198 | 0 | if (s[2] == 'i' && s[3] == 't' && s[4] == 'h' && s[5] == ' ') { |
199 | 0 | AddMatch(id + 35 * n, l + 6, l, matches); |
200 | 0 | } |
201 | 0 | } |
202 | 0 | } else if (s[0] == '"') { |
203 | 0 | AddMatch(id + 19 * n, l + 1, l, matches); |
204 | 0 | if (s[1] == '>') { |
205 | 0 | AddMatch(id + 21 * n, l + 2, l, matches); |
206 | 0 | } |
207 | 0 | } else if (s[0] == '.') { |
208 | 0 | AddMatch(id + 20 * n, l + 1, l, matches); |
209 | 0 | if (s[1] == ' ') { |
210 | 0 | AddMatch(id + 31 * n, l + 2, l, matches); |
211 | 0 | if (s[2] == 'T' && s[3] == 'h') { |
212 | 0 | if (s[4] == 'e') { |
213 | 0 | if (s[5] == ' ') AddMatch(id + 43 * n, l + 6, l, matches); |
214 | 0 | } else if (s[4] == 'i') { |
215 | 0 | if (s[5] == 's' && s[6] == ' ') { |
216 | 0 | AddMatch(id + 75 * n, l + 7, l, matches); |
217 | 0 | } |
218 | 0 | } |
219 | 0 | } |
220 | 0 | } |
221 | 0 | } else if (s[0] == ',') { |
222 | 0 | AddMatch(id + 76 * n, l + 1, l, matches); |
223 | 0 | if (s[1] == ' ') { |
224 | 0 | AddMatch(id + 14 * n, l + 2, l, matches); |
225 | 0 | } |
226 | 0 | } else if (s[0] == '\n') { |
227 | 0 | AddMatch(id + 22 * n, l + 1, l, matches); |
228 | 0 | if (s[1] == '\t') { |
229 | 0 | AddMatch(id + 50 * n, l + 2, l, matches); |
230 | 0 | } |
231 | 0 | } else if (s[0] == ']') { |
232 | 0 | AddMatch(id + 24 * n, l + 1, l, matches); |
233 | 0 | } else if (s[0] == '\'') { |
234 | 0 | AddMatch(id + 36 * n, l + 1, l, matches); |
235 | 0 | } else if (s[0] == ':') { |
236 | 0 | AddMatch(id + 51 * n, l + 1, l, matches); |
237 | 0 | } else if (s[0] == '(') { |
238 | 0 | AddMatch(id + 57 * n, l + 1, l, matches); |
239 | 0 | } else if (s[0] == '=') { |
240 | 0 | if (s[1] == '"') { |
241 | 0 | AddMatch(id + 70 * n, l + 2, l, matches); |
242 | 0 | } else if (s[1] == '\'') { |
243 | 0 | AddMatch(id + 86 * n, l + 2, l, matches); |
244 | 0 | } |
245 | 0 | } else if (s[0] == 'a') { |
246 | 0 | if (s[1] == 'l' && s[2] == ' ') { |
247 | 0 | AddMatch(id + 84 * n, l + 3, l, matches); |
248 | 0 | } |
249 | 0 | } else if (s[0] == 'e') { |
250 | 0 | if (s[1] == 'd') { |
251 | 0 | if (s[2] == ' ') AddMatch(id + 53 * n, l + 3, l, matches); |
252 | 0 | } else if (s[1] == 'r') { |
253 | 0 | if (s[2] == ' ') AddMatch(id + 82 * n, l + 3, l, matches); |
254 | 0 | } else if (s[1] == 's') { |
255 | 0 | if (s[2] == 't' && s[3] == ' ') { |
256 | 0 | AddMatch(id + 95 * n, l + 4, l, matches); |
257 | 0 | } |
258 | 0 | } |
259 | 0 | } else if (s[0] == 'f') { |
260 | 0 | if (s[1] == 'u' && s[2] == 'l' && s[3] == ' ') { |
261 | 0 | AddMatch(id + 90 * n, l + 4, l, matches); |
262 | 0 | } |
263 | 0 | } else if (s[0] == 'i') { |
264 | 0 | if (s[1] == 'v') { |
265 | 0 | if (s[2] == 'e' && s[3] == ' ') { |
266 | 0 | AddMatch(id + 92 * n, l + 4, l, matches); |
267 | 0 | } |
268 | 0 | } else if (s[1] == 'z') { |
269 | 0 | if (s[2] == 'e' && s[3] == ' ') { |
270 | 0 | AddMatch(id + 100 * n, l + 4, l, matches); |
271 | 0 | } |
272 | 0 | } |
273 | 0 | } else if (s[0] == 'l') { |
274 | 0 | if (s[1] == 'e') { |
275 | 0 | if (s[2] == 's' && s[3] == 's' && s[4] == ' ') { |
276 | 0 | AddMatch(id + 93 * n, l + 5, l, matches); |
277 | 0 | } |
278 | 0 | } else if (s[1] == 'y') { |
279 | 0 | if (s[2] == ' ') AddMatch(id + 61 * n, l + 3, l, matches); |
280 | 0 | } |
281 | 0 | } else if (s[0] == 'o') { |
282 | 0 | if (s[1] == 'u' && s[2] == 's' && s[3] == ' ') { |
283 | 0 | AddMatch(id + 106 * n, l + 4, l, matches); |
284 | 0 | } |
285 | 0 | } |
286 | 0 | } else { |
287 | | /* Set is_all_caps=0 for BROTLI_TRANSFORM_UPPERCASE_FIRST and |
288 | | is_all_caps=1 otherwise (BROTLI_TRANSFORM_UPPERCASE_ALL) |
289 | | transform. */ |
290 | 0 | const BROTLI_BOOL is_all_caps = |
291 | 0 | TO_BROTLI_BOOL(w.transform != BROTLI_TRANSFORM_UPPERCASE_FIRST); |
292 | 0 | const uint8_t* s; |
293 | 0 | if (!IsMatch(dictionary->words, w, data, max_length)) { |
294 | 0 | continue; |
295 | 0 | } |
296 | | /* Transform "" + kUppercase{First,All} + "" */ |
297 | 0 | AddMatch(id + (is_all_caps ? 44 : 9) * n, l, l, matches); |
298 | 0 | has_found_match = BROTLI_TRUE; |
299 | 0 | if (l + 1 >= max_length) { |
300 | 0 | continue; |
301 | 0 | } |
302 | | /* Transforms "" + kUppercase{First,All} + <suffix> */ |
303 | 0 | s = &data[l]; |
304 | 0 | if (s[0] == ' ') { |
305 | 0 | AddMatch(id + (is_all_caps ? 68 : 4) * n, l + 1, l, matches); |
306 | 0 | } else if (s[0] == '"') { |
307 | 0 | AddMatch(id + (is_all_caps ? 87 : 66) * n, l + 1, l, matches); |
308 | 0 | if (s[1] == '>') { |
309 | 0 | AddMatch(id + (is_all_caps ? 97 : 69) * n, l + 2, l, matches); |
310 | 0 | } |
311 | 0 | } else if (s[0] == '.') { |
312 | 0 | AddMatch(id + (is_all_caps ? 101 : 79) * n, l + 1, l, matches); |
313 | 0 | if (s[1] == ' ') { |
314 | 0 | AddMatch(id + (is_all_caps ? 114 : 88) * n, l + 2, l, matches); |
315 | 0 | } |
316 | 0 | } else if (s[0] == ',') { |
317 | 0 | AddMatch(id + (is_all_caps ? 112 : 99) * n, l + 1, l, matches); |
318 | 0 | if (s[1] == ' ') { |
319 | 0 | AddMatch(id + (is_all_caps ? 107 : 58) * n, l + 2, l, matches); |
320 | 0 | } |
321 | 0 | } else if (s[0] == '\'') { |
322 | 0 | AddMatch(id + (is_all_caps ? 94 : 74) * n, l + 1, l, matches); |
323 | 0 | } else if (s[0] == '(') { |
324 | 0 | AddMatch(id + (is_all_caps ? 113 : 78) * n, l + 1, l, matches); |
325 | 0 | } else if (s[0] == '=') { |
326 | 0 | if (s[1] == '"') { |
327 | 0 | AddMatch(id + (is_all_caps ? 105 : 104) * n, l + 2, l, matches); |
328 | 0 | } else if (s[1] == '\'') { |
329 | 0 | AddMatch(id + (is_all_caps ? 116 : 108) * n, l + 2, l, matches); |
330 | 0 | } |
331 | 0 | } |
332 | 0 | } |
333 | 0 | } |
334 | 0 | } |
335 | | /* Transforms with prefixes " " and "." */ |
336 | 0 | if (max_length >= 5 && (data[0] == ' ' || data[0] == '.')) { |
337 | 0 | BROTLI_BOOL is_space = TO_BROTLI_BOOL(data[0] == ' '); |
338 | 0 | size_t offset = dictionary->buckets[Hash15(&data[1])]; |
339 | 0 | BROTLI_BOOL end = !offset; |
340 | 0 | while (!end) { |
341 | 0 | DictWord w = dictionary->dict_words[offset++]; |
342 | 0 | const size_t l = w.len & 0x1F; |
343 | 0 | const size_t n = (size_t)1 << dictionary->words->size_bits_by_length[l]; |
344 | 0 | const size_t id = w.idx; |
345 | 0 | end = !!(w.len & 0x80); |
346 | 0 | w.len = (uint8_t)l; |
347 | 0 | if (w.transform == 0) { |
348 | 0 | const uint8_t* s; |
349 | 0 | if (!IsMatch(dictionary->words, w, &data[1], max_length - 1)) { |
350 | 0 | continue; |
351 | 0 | } |
352 | | /* Transforms " " + BROTLI_TRANSFORM_IDENTITY + "" and |
353 | | "." + BROTLI_TRANSFORM_IDENTITY + "" */ |
354 | 0 | AddMatch(id + (is_space ? 6 : 32) * n, l + 1, l, matches); |
355 | 0 | has_found_match = BROTLI_TRUE; |
356 | 0 | if (l + 2 >= max_length) { |
357 | 0 | continue; |
358 | 0 | } |
359 | | /* Transforms " " + BROTLI_TRANSFORM_IDENTITY + <suffix> and |
360 | | "." + BROTLI_TRANSFORM_IDENTITY + <suffix> |
361 | | */ |
362 | 0 | s = &data[l + 1]; |
363 | 0 | if (s[0] == ' ') { |
364 | 0 | AddMatch(id + (is_space ? 2 : 77) * n, l + 2, l, matches); |
365 | 0 | } else if (s[0] == '(') { |
366 | 0 | AddMatch(id + (is_space ? 89 : 67) * n, l + 2, l, matches); |
367 | 0 | } else if (is_space) { |
368 | 0 | if (s[0] == ',') { |
369 | 0 | AddMatch(id + 103 * n, l + 2, l, matches); |
370 | 0 | if (s[1] == ' ') { |
371 | 0 | AddMatch(id + 33 * n, l + 3, l, matches); |
372 | 0 | } |
373 | 0 | } else if (s[0] == '.') { |
374 | 0 | AddMatch(id + 71 * n, l + 2, l, matches); |
375 | 0 | if (s[1] == ' ') { |
376 | 0 | AddMatch(id + 52 * n, l + 3, l, matches); |
377 | 0 | } |
378 | 0 | } else if (s[0] == '=') { |
379 | 0 | if (s[1] == '"') { |
380 | 0 | AddMatch(id + 81 * n, l + 3, l, matches); |
381 | 0 | } else if (s[1] == '\'') { |
382 | 0 | AddMatch(id + 98 * n, l + 3, l, matches); |
383 | 0 | } |
384 | 0 | } |
385 | 0 | } |
386 | 0 | } else if (is_space) { |
387 | | /* Set is_all_caps=0 for BROTLI_TRANSFORM_UPPERCASE_FIRST and |
388 | | is_all_caps=1 otherwise (BROTLI_TRANSFORM_UPPERCASE_ALL) |
389 | | transform. */ |
390 | 0 | const BROTLI_BOOL is_all_caps = |
391 | 0 | TO_BROTLI_BOOL(w.transform != BROTLI_TRANSFORM_UPPERCASE_FIRST); |
392 | 0 | const uint8_t* s; |
393 | 0 | if (!IsMatch(dictionary->words, w, &data[1], max_length - 1)) { |
394 | 0 | continue; |
395 | 0 | } |
396 | | /* Transforms " " + kUppercase{First,All} + "" */ |
397 | 0 | AddMatch(id + (is_all_caps ? 85 : 30) * n, l + 1, l, matches); |
398 | 0 | has_found_match = BROTLI_TRUE; |
399 | 0 | if (l + 2 >= max_length) { |
400 | 0 | continue; |
401 | 0 | } |
402 | | /* Transforms " " + kUppercase{First,All} + <suffix> */ |
403 | 0 | s = &data[l + 1]; |
404 | 0 | if (s[0] == ' ') { |
405 | 0 | AddMatch(id + (is_all_caps ? 83 : 15) * n, l + 2, l, matches); |
406 | 0 | } else if (s[0] == ',') { |
407 | 0 | if (!is_all_caps) { |
408 | 0 | AddMatch(id + 109 * n, l + 2, l, matches); |
409 | 0 | } |
410 | 0 | if (s[1] == ' ') { |
411 | 0 | AddMatch(id + (is_all_caps ? 111 : 65) * n, l + 3, l, matches); |
412 | 0 | } |
413 | 0 | } else if (s[0] == '.') { |
414 | 0 | AddMatch(id + (is_all_caps ? 115 : 96) * n, l + 2, l, matches); |
415 | 0 | if (s[1] == ' ') { |
416 | 0 | AddMatch(id + (is_all_caps ? 117 : 91) * n, l + 3, l, matches); |
417 | 0 | } |
418 | 0 | } else if (s[0] == '=') { |
419 | 0 | if (s[1] == '"') { |
420 | 0 | AddMatch(id + (is_all_caps ? 110 : 118) * n, l + 3, l, matches); |
421 | 0 | } else if (s[1] == '\'') { |
422 | 0 | AddMatch(id + (is_all_caps ? 119 : 120) * n, l + 3, l, matches); |
423 | 0 | } |
424 | 0 | } |
425 | 0 | } |
426 | 0 | } |
427 | 0 | } |
428 | 0 | if (max_length >= 6) { |
429 | | /* Transforms with prefixes "e ", "s ", ", " and "\xC2\xA0" */ |
430 | 0 | if ((data[1] == ' ' && |
431 | 0 | (data[0] == 'e' || data[0] == 's' || data[0] == ',')) || |
432 | 0 | (data[0] == 0xC2 && data[1] == 0xA0)) { |
433 | 0 | size_t offset = dictionary->buckets[Hash15(&data[2])]; |
434 | 0 | BROTLI_BOOL end = !offset; |
435 | 0 | while (!end) { |
436 | 0 | DictWord w = dictionary->dict_words[offset++]; |
437 | 0 | const size_t l = w.len & 0x1F; |
438 | 0 | const size_t n = (size_t)1 << dictionary->words->size_bits_by_length[l]; |
439 | 0 | const size_t id = w.idx; |
440 | 0 | end = !!(w.len & 0x80); |
441 | 0 | w.len = (uint8_t)l; |
442 | 0 | if (w.transform == 0 && |
443 | 0 | IsMatch(dictionary->words, w, &data[2], max_length - 2)) { |
444 | 0 | if (data[0] == 0xC2) { |
445 | 0 | AddMatch(id + 102 * n, l + 2, l, matches); |
446 | 0 | has_found_match = BROTLI_TRUE; |
447 | 0 | } else if (l + 2 < max_length && data[l + 2] == ' ') { |
448 | 0 | size_t t = data[0] == 'e' ? 18 : (data[0] == 's' ? 7 : 13); |
449 | 0 | AddMatch(id + t * n, l + 3, l, matches); |
450 | 0 | has_found_match = BROTLI_TRUE; |
451 | 0 | } |
452 | 0 | } |
453 | 0 | } |
454 | 0 | } |
455 | 0 | } |
456 | 0 | if (max_length >= 9) { |
457 | | /* Transforms with prefixes " the " and ".com/" */ |
458 | 0 | if ((data[0] == ' ' && data[1] == 't' && data[2] == 'h' && |
459 | 0 | data[3] == 'e' && data[4] == ' ') || |
460 | 0 | (data[0] == '.' && data[1] == 'c' && data[2] == 'o' && |
461 | 0 | data[3] == 'm' && data[4] == '/')) { |
462 | 0 | size_t offset = dictionary->buckets[Hash15(&data[5])]; |
463 | 0 | BROTLI_BOOL end = !offset; |
464 | 0 | while (!end) { |
465 | 0 | DictWord w = dictionary->dict_words[offset++]; |
466 | 0 | const size_t l = w.len & 0x1F; |
467 | 0 | const size_t n = (size_t)1 << dictionary->words->size_bits_by_length[l]; |
468 | 0 | const size_t id = w.idx; |
469 | 0 | end = !!(w.len & 0x80); |
470 | 0 | w.len = (uint8_t)l; |
471 | 0 | if (w.transform == 0 && |
472 | 0 | IsMatch(dictionary->words, w, &data[5], max_length - 5)) { |
473 | 0 | AddMatch(id + (data[0] == ' ' ? 41 : 72) * n, l + 5, l, matches); |
474 | 0 | has_found_match = BROTLI_TRUE; |
475 | 0 | if (l + 5 < max_length) { |
476 | 0 | const uint8_t* s = &data[l + 5]; |
477 | 0 | if (data[0] == ' ') { |
478 | 0 | if (l + 8 < max_length && |
479 | 0 | s[0] == ' ' && s[1] == 'o' && s[2] == 'f' && s[3] == ' ') { |
480 | 0 | AddMatch(id + 62 * n, l + 9, l, matches); |
481 | 0 | if (l + 12 < max_length && |
482 | 0 | s[4] == 't' && s[5] == 'h' && s[6] == 'e' && s[7] == ' ') { |
483 | 0 | AddMatch(id + 73 * n, l + 13, l, matches); |
484 | 0 | } |
485 | 0 | } |
486 | 0 | } |
487 | 0 | } |
488 | 0 | } |
489 | 0 | } |
490 | 0 | } |
491 | 0 | } |
492 | 0 | return has_found_match; |
493 | 0 | } |
494 | | |
495 | | /* Finds matches for one or more dictionaries, if multiple are present |
496 | | in the contextual dictionary */ |
497 | | BROTLI_BOOL BrotliFindAllStaticDictionaryMatches( |
498 | | const BrotliEncoderDictionary* dictionary, const uint8_t* data, |
499 | 0 | size_t min_length, size_t max_length, uint32_t* matches) { |
500 | 0 | BROTLI_BOOL has_found_match = |
501 | 0 | BrotliFindAllStaticDictionaryMatchesFor( |
502 | 0 | dictionary, data, min_length, max_length, matches); |
503 | |
|
504 | 0 | if (!!dictionary->parent && dictionary->parent->num_dictionaries > 1) { |
505 | 0 | uint32_t matches2[BROTLI_MAX_STATIC_DICTIONARY_MATCH_LEN + 1]; |
506 | 0 | int l; |
507 | 0 | const BrotliEncoderDictionary* dictionary2 = dictionary->parent->dict[0]; |
508 | 0 | if (dictionary2 == dictionary) { |
509 | 0 | dictionary2 = dictionary->parent->dict[1]; |
510 | 0 | } |
511 | |
|
512 | 0 | for (l = 0; l < BROTLI_MAX_STATIC_DICTIONARY_MATCH_LEN + 1; l++) { |
513 | 0 | matches2[l] = kInvalidMatch; |
514 | 0 | } |
515 | |
|
516 | 0 | has_found_match |= BrotliFindAllStaticDictionaryMatchesFor( |
517 | 0 | dictionary2, data, min_length, max_length, matches2); |
518 | |
|
519 | 0 | for (l = 0; l < BROTLI_MAX_STATIC_DICTIONARY_MATCH_LEN + 1; l++) { |
520 | 0 | if (matches2[l] != kInvalidMatch) { |
521 | 0 | uint32_t dist = (uint32_t)(matches2[l] >> 5); |
522 | 0 | uint32_t len_code = matches2[l] & 31; |
523 | 0 | uint32_t skipdist = (uint32_t)((uint32_t)(1 << dictionary->words-> |
524 | 0 | size_bits_by_length[len_code]) & ~1u) * |
525 | 0 | (uint32_t)dictionary->num_transforms; |
526 | | /* TODO(lode): check for dist overflow */ |
527 | 0 | dist += skipdist; |
528 | 0 | AddMatch(dist, (size_t)l, len_code, matches); |
529 | 0 | } |
530 | 0 | } |
531 | 0 | } |
532 | 0 | return has_found_match; |
533 | 0 | } |
534 | | #if defined(__cplusplus) || defined(c_plusplus) |
535 | | } /* extern "C" */ |
536 | | #endif |