• Home
  • Raw
  • Download

Lines Matching refs:kBlockSize

104   template<int kBlockSize> static void BM_DefaultHash(int iterations,  in BM_DefaultHash()
106 RollingHash<kBlockSize> hasher; in BM_DefaultHash()
115 template<int kBlockSize> static void BM_UpdateHash(int iterations, in BM_UpdateHash()
117 RollingHash<kBlockSize> hasher; in BM_UpdateHash()
124 buffer[i + kBlockSize]); in BM_UpdateHash()
137 template<int kBlockSize> void UpdateHashMatchesHashForBlockSize() { in UpdateHashMatchesHashForBlockSize()
138 RollingHash<kBlockSize>::Init(); in UpdateHashMatchesHashForBlockSize()
139 RollingHash<kBlockSize> hasher; in UpdateHashMatchesHashForBlockSize()
142 PortableRandomInRange(kUpdateHashBlocks - 1) + kBlockSize; in UpdateHashMatchesHashForBlockSize()
145 for (int i = kBlockSize; i < random_buffer_size; ++i) { in UpdateHashMatchesHashForBlockSize()
148 buffer_[i - kBlockSize], in UpdateHashMatchesHashForBlockSize()
152 EXPECT_EQ(running_hash, hasher.Hash(&buffer_[i + 1 - kBlockSize])); in UpdateHashMatchesHashForBlockSize()
157 template<int kBlockSize> double DefaultHashTimingTest() { in DefaultHashTimingTest()
160 const int kTimingTestIterations = kTimingTestSize / kBlockSize; in DefaultHashTimingTest()
163 BM_DefaultHash<kBlockSize>(kTimingTestIterations, buffer_); in DefaultHashTimingTest()
169 template<int kBlockSize> double RollingTimingTest() { in RollingTimingTest()
175 BM_UpdateHash<kBlockSize>(kTimingTestIterations, buffer_); in RollingTimingTest()
189 template<int kBlockSize> void RunTimingTestForBlockSize() { in RunTimingTestForBlockSize()
190 RollingHash<kBlockSize>::Init(); in RunTimingTestForBlockSize()
192 const double time_for_default_hash = DefaultHashTimingTest<kBlockSize>(); in RunTimingTestForBlockSize()
193 const double time_for_rolling_hash = RollingTimingTest<kBlockSize>(); in RunTimingTestForBlockSize()
195 kBlockSize, in RunTimingTestForBlockSize()
201 if (kBlockSize > 16) { in RunTimingTestForBlockSize()