Lines Matching refs:candidate
523 const uint8_t* candidate;
536 candidate = ip - last_distance;
537 if (IsMatch(ip, candidate)) {
538 if (BROTLI_PREDICT_TRUE(candidate < ip)) {
543 candidate = base_ip + table[hash];
544 BROTLI_DCHECK(candidate >= base_ip);
545 BROTLI_DCHECK(candidate < ip);
548 } while (BROTLI_PREDICT_TRUE(!IsMatch(ip, candidate)));
550 /* Check copy distance. If candidate is not feasible, continue search.
552 if (ip - candidate > MAX_DISTANCE) goto trawl;
564 candidate + 5, ip + 5, (size_t)(ip_end - ip) - 5);
565 int distance = (int)(base - candidate); /* > 0 */
568 BROTLI_DCHECK(0 == memcmp(base, candidate, matched));
614 candidate = base_ip + table[cur_hash];
619 while (IsMatch(ip, candidate)) {
624 candidate + 5, ip + 5, (size_t)(ip_end - ip) - 5);
625 if (ip - candidate > MAX_DISTANCE) break;
627 last_distance = (int)(base - candidate); /* > 0 */
628 BROTLI_DCHECK(0 == memcmp(base, candidate, matched));
651 candidate = base_ip + table[cur_hash];