+ OFF_T offset;
+ int j,k;
+ int end;
+ char sum2[SUM_LENGTH];
+ uint32 s1, s2, sum;
+ schar *map;
+
+ if (verbose > 2)
+ rprintf(FINFO,"hash search b=%d len=%d\n",s->n,(int)len);
+
+ k = MIN(len, s->n);
+
+ map = (schar *)map_ptr(buf,0,k);
+
+ sum = get_checksum1((char *)map, k);
+ s1 = sum & 0xFFFF;
+ s2 = sum >> 16;
+ if (verbose > 3)
+ rprintf(FINFO, "sum=%.8x k=%d\n", sum, k);
+
+ offset = 0;
+
+ end = len + 1 - s->sums[s->count-1].len;
+
+ if (verbose > 3)
+ rprintf(FINFO,"hash search s->n=%d len=%d count=%d\n",
+ s->n,(int)len,s->count);
+
+ do {
+ tag t = gettag2(s1,s2);
+ int done_csum2 = 0;
+
+ j = tag_table[t];
+ if (verbose > 4)
+ rprintf(FINFO,"offset=%d sum=%08x\n",(int)offset,sum);
+
+ if (j == NULL_TAG) {
+ goto null_tag;
+ }
+
+ sum = (s1 & 0xffff) | (s2 << 16);
+ tag_hits++;
+ for (; j<s->count && targets[j].t == t; j++) {
+ int i = targets[j].i;
+
+ if (sum != s->sums[i].sum1) continue;
+
+ if (verbose > 3)
+ rprintf(FINFO,"potential match at %d target=%d %d sum=%08x\n",
+ (int)offset,j,i,sum);
+
+ if (!done_csum2) {
+ int l = MIN(s->n,len-offset);
+ map = (schar *)map_ptr(buf,offset,l);
+ get_checksum2((char *)map,l,sum2);
+ done_csum2 = 1;
+ }
+
+ if (memcmp(sum2,s->sums[i].sum2,csum_length) != 0) {
+ false_alarms++;
+ continue;
+ }
+
+ matched(f,s,buf,offset,i);
+ offset += s->sums[i].len - 1;
+ k = MIN((len-offset), s->n);
+ map = (schar *)map_ptr(buf,offset,k);
+ sum = get_checksum1((char *)map, k);
+ s1 = sum & 0xFFFF;
+ s2 = sum >> 16;
+ matches++;
+ break;
+ }
+
+ null_tag:
+ /* Trim off the first byte from the checksum */
+ map = (schar *)map_ptr(buf,offset,k+1);
+ s1 -= map[0] + CHAR_OFFSET;
+ s2 -= k * (map[0]+CHAR_OFFSET);
+
+ /* Add on the next byte (if there is one) to the checksum */
+ if (k < (len-offset)) {
+ s1 += (map[k]+CHAR_OFFSET);
+ s2 += s1;
+ } else {
+ --k;
+ }
+
+ } while (++offset < end);
+
+ matched(f,s,buf,len,-1);
+ map_ptr(buf,len-1,1);
+}