Lines Matching defs:sr
45 HasherSearchResult sr;
46 sr.len = 0;
47 sr.len_code_delta = 0;
48 sr.distance = 0;
49 sr.score = kMinScore;
52 max_distance, dictionary_start + gap, params->dist.max_distance, &sr);
53 if (sr.score > kMinScore) {
61 BROTLI_MIN(size_t, sr.len - 1, max_length) : 0;
73 if (sr2.score >= sr.score + cost_diff_lazy) {
78 sr = sr2;
87 position + 2 * sr.len + random_heuristics_window_size;
94 sr.distance, dictionary_start + gap, dist_cache);
95 if ((sr.distance <= (dictionary_start + gap)) && distance_code > 0) {
99 dist_cache[0] = (int)sr.distance;
103 sr.len, sr.len_code_delta, distance_code);
113 size_t range_end = BROTLI_MIN(size_t, position + sr.len, store_end);
114 if (sr.distance < (sr.len >> 2)) {
116 range_start, position + sr.len - (sr.distance << 2)));
121 position += sr.len;