Lines Matching defs:ip
460 const uint8_t* ip;
490 /* "ip" is the input pointer. */
491 ip = input;
505 for (next_hash = Hash(++ip, shift); ; ) {
523 const uint8_t* next_ip = ip;
525 assert(next_emit < ip);
531 ip = next_ip;
532 next_ip = ip + bytes_between_hash_lookups;
537 candidate = ip - last_distance;
538 if (IsMatch(ip, candidate)) {
539 if (BROTLI_PREDICT_TRUE(candidate < ip)) {
540 table[hash] = (int)(ip - base_ip);
546 assert(candidate < ip);
548 table[hash] = (int)(ip - base_ip);
549 } while (BROTLI_PREDICT_TRUE(!IsMatch(ip, candidate)));
553 if (ip - candidate > MAX_DISTANCE) goto trawl;
561 /* We have a 5-byte match at ip, and we need to emit bytes in
562 [next_emit, ip). */
563 const uint8_t* base = ip;
565 candidate + 5, ip + 5, (size_t)(ip_end - ip) - 5);
568 ip += matched;
598 next_emit = ip;
599 if (BROTLI_PREDICT_FALSE(ip >= ip_limit)) {
602 /* We could immediately start working at ip now, but to improve
606 uint64_t input_bytes = BROTLI_UNALIGNED_LOAD64LE(ip - 3);
609 table[prev_hash] = (int)(ip - base_ip - 3);
611 table[prev_hash] = (int)(ip - base_ip - 2);
613 table[prev_hash] = (int)(ip - base_ip - 1);
616 table[cur_hash] = (int)(ip - base_ip);
620 while (IsMatch(ip, candidate)) {
621 /* We have a 5-byte match at ip, and no need to emit any literal bytes
622 prior to ip. */
623 const uint8_t* base = ip;
625 candidate + 5, ip + 5, (size_t)(ip_end - ip) - 5);
626 if (ip - candidate > MAX_DISTANCE) break;
627 ip += matched;
635 next_emit = ip;
636 if (BROTLI_PREDICT_FALSE(ip >= ip_limit)) {
639 /* We could immediately start working at ip now, but to improve
643 uint64_t input_bytes = BROTLI_UNALIGNED_LOAD64LE(ip - 3);
646 table[prev_hash] = (int)(ip - base_ip - 3);
648 table[prev_hash] = (int)(ip - base_ip - 2);
650 table[prev_hash] = (int)(ip - base_ip - 1);
653 table[cur_hash] = (int)(ip - base_ip);
657 next_hash = Hash(++ip, shift);
