Lines Matching refs:hash

298       UInt32 *hash, UInt32 hashMask, UInt32 *heads, UInt32 numHeads, const UInt32 *crc)

304 *heads++ = pos - hash[value]; \
305 hash[value] = pos++; }
335 h0 = hash[v0]; hash[v0] = pos; heads[0] = pos - h0; pos++;
336 h1 = hash[v1]; hash[v1] = pos; heads[1] = pos - h1; pos++;
342 *heads = pos - hash[v0];
343 hash[v0] = pos;
523 MatchFinder_Normalize3(subValue, mf->hash + mf->fixedHashSize, (size_t)mf->hashMask + 1);
527 mt->GetHeadsFunc(mf->buffer, mf->pos, mf->hash + mf->fixedHashSize, mf->hashMask, heads + 2, num, mf->crc);
564 UInt32 _cutValue, UInt32 *d, size_t _maxLen, const UInt32 *hash, const UInt32 *limit, const UInt32 *size,
617 if avail was increased with new hash block */
907 p->hash = mf->hash;
976 MatchFinder_Normalize3(subValue, p->hash, p->fixedHashSize);
1007 UInt32 *hash = p->hash;
1012 c2 = hash[h2];
1013 hash[h2] = m;
1031 UInt32 *hash = p->hash;
1036 c2 = hash[h2];
1037 c3 = (hash + kFix3HashSize)[h3];
1039 hash[h2] = m;
1040 (hash + kFix3HashSize)[h3] = m;
1113 UInt32 *hash = p->hash;
1118 c2 = hash[h2];
1119 c3 = (hash + kFix3HashSize)[h3];
1121 hash[h2] = m;
1122 (hash + kFix3HashSize)[h3] = m;
1169 UInt32 *hash = p->hash;
1174 c2 = hash[h2];
1175 c3 = (hash + kFix3HashSize)[h3];
1176 // c4 = (hash + kFix4HashSize)[h4];
1178 hash[h2] = m;
1179 (hash + kFix3HashSize)[h3] = m;
1180 // (hash + kFix4HashSize)[h4] = m;
1295 MixMatchesFunc() inserts only hash matches that are nearer than (match_dist)
1315 #define SKIP_HEADER_MT(n) SKIP_HEADER2_MT if (p->btNumAvailBytes-- >= (n)) { const Byte *cur = p->pointerToCurPos; UInt32 *hash = p->hash;
1329 hash[h2] = p->lzPos;
1338 (hash + kFix3HashSize)[h3] =
1339 hash[ h2] =
1346 // The difference is that MatchFinderMt3_Skip() updates hash for last 3 bytes of stream.
1354 // (hash + kFix4HashSize)[h4] =
1355 (hash + kFix3HashSize)[h3] =
1356 hash[ h2] =