Lines Matching defs:backward
16 // help create backward references to previous data.
63 // Usually, we always choose the longest backward reference. This function
66 // If we choose a backward reference that is further away, it will
74 // This function is used to sometimes discard a longer backward reference
115 // help create backward references to previous data.
159 // Find a longest backward match of &data[cur_ix] up to the length of
230 const size_t backward = cur_ix - prev_ix;
231 if (PREDICT_FALSE(backward > max_backward)) {
246 // a few unnecessary binary logarithms in backward reference score,
257 best_ix = backward;
263 *in_dictionary = backward > max_backward;
273 const size_t backward = cur_ix - prev_ix;
274 if (PREDICT_FALSE(backward > max_backward)) {
283 const double score = start_cost2 - 2.3 * Log2Floor(backward);
288 best_ix = backward;
302 const size_t backward = cur_ix - prev_ix;
303 if (PREDICT_FALSE(backward > max_backward)) {
317 // for a few unnecessary binary logarithms in backward reference
323 len, backward);
327 best_ix = backward;
348 const size_t backward = max_backward + word_id + 1;
353 len, backward);
357 best_ix = backward;
390 // Only kBlockSize newest backward references are kept,
400 // Buckets containing kBlockSize of backward references.