Lines Matching defs:len
26 static BROTLI_INLINE void AddMatch(size_t distance, size_t len, size_t len_code,
29 matches[len] = BROTLI_MIN(uint32_t, matches[len], match);
35 size_t len,
37 const size_t offset = dictionary->offsets_by_length[len] + len * id;
39 BROTLI_MIN(size_t, len, maxlen));
44 if (w.len > max_length) {
47 const size_t offset = dictionary->offsets_by_length[w.len] +
48 (size_t)w.len * (size_t)w.idx;
53 TO_BROTLI_BOOL(FindMatchLengthWithLimit(dict, data, w.len) == w.len);
59 FindMatchLengthWithLimit(&dict[1], &data[1], w.len - 1u) ==
60 w.len - 1u);
65 for (i = 0; i < w.len; ++i) {
86 const size_t l = w.len & 0x1F;
89 end = !!(w.len & 0x80);
90 w.len = (uint8_t)l;
97 size_t len;
118 for (len = minlen; len <= maxlen; ++len) {
119 size_t cut = l - len;
122 AddMatch(id + transform_id * n, len, l, matches);
331 const size_t l = w.len & 0x1F;
334 end = !!(w.len & 0x80);
335 w.len = (uint8_t)l;
426 const size_t l = w.len & 0x1F;
429 end = !!(w.len & 0x80);
430 w.len = (uint8_t)l;
455 const size_t l = w.len & 0x1F;
458 end = !!(w.len & 0x80);
459 w.len = (uint8_t)l;