Lines Matching refs:data
19 static BROTLI_INLINE uint32_t Hash(const uint8_t* data) {
20 uint32_t h = BROTLI_UNALIGNED_LOAD32LE(data) * kDictHashMul32;
33 const uint8_t* data,
38 return FindMatchLengthWithLimit(&dictionary->data[offset], data,
43 DictWord w, const uint8_t* data, size_t max_length) {
49 const uint8_t* dict = &dictionary->data[offset];
53 TO_BROTLI_BOOL(FindMatchLengthWithLimit(dict, data, w.len) == w.len);
58 (dict[0] ^ 32) == data[0] &&
59 FindMatchLengthWithLimit(&dict[1], &data[1], w.len - 1u) ==
67 if ((dict[i] ^ 32) != data[i]) return BROTLI_FALSE;
69 if (dict[i] != data[i]) return BROTLI_FALSE;
78 const BrotliEncoderDictionary* dictionary, const uint8_t* data,
82 size_t offset = dictionary->buckets[Hash(data)];
93 DictMatchLength(dictionary->words, data, id, l, max_length);
108 data[l - 1] == 'i' && data[l] == 'n' && data[l + 1] == 'g' &&
109 data[l + 2] == ' ') {
128 s = &data[l];
282 if (!IsMatch(dictionary->words, w, data, max_length)) {
292 s = &data[l];
325 if (max_length >= 5 && (data[0] == ' ' || data[0] == '.')) {
326 BROTLI_BOOL is_space = TO_BROTLI_BOOL(data[0] == ' ');
327 size_t offset = dictionary->buckets[Hash(&data[1])];
338 if (!IsMatch(dictionary->words, w, &data[1], max_length - 1)) {
351 s = &data[l + 1];
382 if (!IsMatch(dictionary->words, w, &data[1], max_length - 1)) {
392 s = &data[l + 1];
419 if ((data[1] == ' ' &&
420 (data[0] == 'e' || data[0] == 's' || data[0] == ',')) ||
421 (data[0] == 0xC2 && data[1] == 0xA0)) {
422 size_t offset = dictionary->buckets[Hash(&data[2])];
432 IsMatch(dictionary->words, w, &data[2], max_length - 2)) {
433 if (data[0] == 0xC2) {
436 } else if (l + 2 < max_length && data[l + 2] == ' ') {
437 size_t t = data[0] == 'e' ? 18 : (data[0] == 's' ? 7 : 13);
447 if ((data[0] == ' ' && data[1] == 't' && data[2] == 'h' &&
448 data[3] == 'e' && data[4] == ' ') ||
449 (data[0] == '.' && data[1] == 'c' && data[2] == 'o' &&
450 data[3] == 'm' && data[4] == '/')) {
451 size_t offset = dictionary->buckets[Hash(&data[5])];
461 IsMatch(dictionary->words, w, &data[5], max_length - 5)) {
462 AddMatch(id + (data[0] == ' ' ? 41 : 72) * n, l + 5, l, matches);
465 const uint8_t* s = &data[l + 5];
466 if (data[0] == ' ') {