580 	int n, ndx, off, size;  in hash_access()  local
598 	for (bp = (u_int16_t *)rbufp->page, n = *bp++, ndx = 1; ndx < n;)  in hash_access()
609 			ndx += 2;  in hash_access()
619 			ndx = 1;  in hash_access()
622 			if ((ndx =  in hash_access()
623 			    __find_bigpair(hashp, rbufp, ndx, kp, size)) > 0)  in hash_access()
625 			if (ndx == -2) {  in hash_access()
629 					ndx = 0;  in hash_access()
641 				ndx = 1;  in hash_access()
674 		if (bp[ndx + 1] < REAL_KEY) {  in hash_access()
675 			if (__big_return(hashp, rbufp, ndx, val, 0))  in hash_access()
678 			val->data = (u_char *)rbufp->page + (int)bp[ndx + 1];  in hash_access()
679 			val->size = bp[ndx] - bp[ndx + 1];  in hash_access()
683 		if ((__delpair(hashp, rbufp, ndx)) ||  in hash_access()
690 		if (__delpair(hashp, rbufp, ndx))  in hash_access()
706 	u_int16_t *bp, ndx;  in hash_seq()  local
770 	ndx = hashp->cndx;  in hash_seq()
771 	if (bp[ndx + 1] < REAL_KEY) {  in hash_seq()
777 		key->data = (u_char *)hashp->cpage->page + bp[ndx];  in hash_seq()
778 		key->size = (ndx > 1 ? bp[ndx - 1] : hashp->BSIZE) - bp[ndx];  in hash_seq()
779 		data->data = (u_char *)hashp->cpage->page + bp[ndx + 1];  in hash_seq()
780 		data->size = bp[ndx] - bp[ndx + 1];  in hash_seq()