Lines Matching refs:kBlockSize
40 // kBlockSize must be at least 2 to be meaningful. Since it's a compile-time
43 COMPILE_ASSERT(BlockHash::kBlockSize >= 2, kBlockSize_must_be_at_least_2);
45 // kBlockSize is required to be a power of 2 because multiplication
46 // (n * kBlockSize), division (n / kBlockSize) and MOD (n % kBlockSize)
47 // are commonly-used operations. If kBlockSize is a compile-time
52 COMPILE_ASSERT((BlockHash::kBlockSize & (BlockHash::kBlockSize - 1)) == 0,
112 // probability of a hash collision to (sizeof(int) / kblockSize),
161 static_cast<int>(source_size_ / kBlockSize); // round down
210 const int last_index_added = last_block_added_ * kBlockSize;
220 // The Hash function extends (kBlockSize - 1) bytes past the index,
222 int last_legal_hash_index = static_cast<int>(source_size() - kBlockSize);
229 AddBlock(RollingHash<kBlockSize>::Hash(block_ptr));
230 block_ptr += kBlockSize;
234 COMPILE_ASSERT((BlockHash::kBlockSize % sizeof(uword_t)) == 0,
271 static const size_t kWordsPerBlock = BlockHash::kBlockSize / sizeof(uword_t);
289 return memcmp(block1, block2, BlockHash::kBlockSize) == 0;
302 &source_data_[block_number * kBlockSize])) {
401 int source_match_offset = block_number * kBlockSize;
402 const int source_match_end = source_match_offset + kBlockSize;
406 const int target_match_end = target_match_offset + kBlockSize;
408 size_t match_size = kBlockSize;
