Cross Reference: /external/open-vcdiff/src/blockhash.h

Lines Matching defs:kBlockSize
31 // of size kBlockSize in both the incrementally processed target data
36 // entry in the BlockHash corresponding to each kBlockSize bytes
43 //   (== kBlockSize * block_number).  This greatly reduces the size
50   // Using (for example) kBlockSize = 4 guarantees that no match smaller
56   // Increasing kBlockSize by a factor of two will halve the amount of
64   // matches found, and a low value of kBlockSize will waste time
68   // It is suggested that different values of kBlockSize be tried against
72   // If you change kBlockSize to a smaller value, please increase
74   static const int kBlockSize = 16;
115   // will contain one entry for each kBlockSize-byte block in the
176   // called for every kBlockSize-byte block in the target data, regardless
186   // Calls AddBlock() for each kBlockSize-byte block in the range
187   // (last_block_added_ * kBlockSize, end_index), exclusive of the endpoints.
188   // If end_index <= the last index added (last_block_added_ * kBlockSize),
197   // Example: assume kBlockSize = 4, last_block_added_ = 1, and there are
211   // (target_candidate_start) and the hash value of the kBlockSize bytes
246   //         RollingHash<BlockHash::kBlockSize>::Hash(target_candidate_start);
270   //    kBlockSize: 4
323   // with the inverse of kBlockSize, but here a linear scale is used
325   static const int kMaxMatchesToCheck = (kBlockSize >= 32) ? 32 :
326                                             (32 * (32 / kBlockSize));
332   // Internal routine which calculates a hash table size based on kBlockSize and
339     return source_size_ / kBlockSize;
351     return (last_block_added_ + 1) * kBlockSize;
360   // kBlockSize, starting at source_data_[block_number * kBlockSize],
366   // Calls AddBlock() for each complete kBlockSize-byte block between
372   // Returns true if the contents of the kBlockSize-byte block
452   // least one element for each kBlockSize-byte block in the source data.