Home
last modified time | relevance | path

Searched refs:kBlockSize (Results 1 – 25 of 27) sorted by relevance

12

/external/open-vcdiff/src/
Dvcdiffengine_test.cc40 static const int kBlockSize = VCDiffEngine::kMinimumMatchSize; member in open_vcdiff::__anon3c7a0c290111::VCDiffEngineTestBase
151 for (int i = 0; i < (kBlockSize - 1); ++i) { in ExpectDataStringWithBlockSpacing()
158 for (int i = 0; i < (kBlockSize - 1); ++i) { in ExpectDataStringWithBlockSpacing()
309 kBlockSize, false); in SetUpTestCase()
310 MakeEachLetterABlock(target_without_spaces_, &target_, kBlockSize, false); in SetUpTestCase()
423 if (!ExpectAddCopyInstruction(kBlockSize, (3 * kBlockSize) - 1, in TEST_F()
425 ExpectCopyInstruction((3 * kBlockSize) - 1, VCD_SELF_MODE); in TEST_F()
428 ExpectCopyInstruction((6 * kBlockSize) - 1, VCD_SELF_MODE); in TEST_F()
429 ExpectCopyInstruction(11 * kBlockSize, in TEST_F()
431 if (!ExpectAddCopyInstruction(1, (2 * kBlockSize) - 1, VCD_SELF_MODE)) { in TEST_F()
[all …]
Dblockhash_test.cc28 const int kBlockSize = BlockHash::kBlockSize; variable
82 CHECK(n < kBlockSize); in InitBlocksToDifferAtNthByte()
85 for (int index = n; index < kTimingTestSize; index += kBlockSize) { in InitBlocksToDifferAtNthByte()
115 char* padded_text = new char[(kBlockSize * length_without_spaces) + 1]; in MakeEachLetterABlock()
116 memset(padded_text, ' ', kBlockSize * length_without_spaces); in MakeEachLetterABlock()
117 char* padded_text_ptr = padded_text + (kBlockSize - 1); in MakeEachLetterABlock()
120 padded_text_ptr += kBlockSize; in MakeEachLetterABlock()
122 padded_text[kBlockSize * length_without_spaces] = '\0'; in MakeEachLetterABlock()
140 char* new_test_string_unaligned_e = new char[kBlockSize]; in SetUpTestCase()
141 memset(new_test_string_unaligned_e, ' ', kBlockSize); in SetUpTestCase()
[all …]
Drolling_hash_test.cc104 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()
[all …]
Dblockhash.cc44 VCD_COMPILE_ASSERT(BlockHash::kBlockSize >= 2, kBlockSize_must_be_at_least_2);
53 VCD_COMPILE_ASSERT((BlockHash::kBlockSize & (BlockHash::kBlockSize - 1)) == 0,
162 static_cast<int>(source_size_ / kBlockSize); // round down in AddBlock()
211 const int last_index_added = last_block_added_ * kBlockSize; in AddAllBlocksThroughIndex()
223 int last_legal_hash_index = static_cast<int>(source_size() - kBlockSize); in AddAllBlocksThroughIndex()
230 AddBlock(RollingHash<kBlockSize>::Hash(block_ptr)); in AddAllBlocksThroughIndex()
231 block_ptr += kBlockSize; in AddAllBlocksThroughIndex()
235 VCD_COMPILE_ASSERT((BlockHash::kBlockSize % sizeof(uword_t)) == 0,
272 static const size_t kWordsPerBlock = BlockHash::kBlockSize / sizeof(uword_t); in BlockCompareWordsInline()
290 return memcmp(block1, block2, BlockHash::kBlockSize) == 0; in BlockContentsMatchInline()
[all …]
Dblockhash.h74 static const int kBlockSize = 16;
325 static const int kMaxMatchesToCheck = (kBlockSize >= 32) ? 32 :
326 (32 * (32 / kBlockSize));
339 return source_size_ / kBlockSize; in GetNumberOfBlocks()
351 return (last_block_added_ + 1) * kBlockSize; in NextIndexToAdd()
Dvcdiffengine.cc57 RollingHash<BlockHash::kBlockSize>::Init(); in Init()
162 if (target_size < static_cast<size_t>(BlockHash::kBlockSize)) { in EncodeInternal()
167 RollingHash<BlockHash::kBlockSize> hasher; in EncodeInternal()
181 const char* const start_of_last_block = target_end - BlockHash::kBlockSize; in EncodeInternal()
225 candidate_pos[BlockHash::kBlockSize]); in EncodeInternal()
Dvcencoder_test.cc752 if (BlockHash::kBlockSize < 16) { in TEST_F()
772 } else if (BlockHash::kBlockSize <= 56) { in TEST_F()
945 if (BlockHash::kBlockSize <= 8) { in TEST_F()
988 if (BlockHash::kBlockSize <= 8) { in TEST_F()
/external/chromium/sdch/open-vcdiff/src/
Dvcdiffengine_test.cc41 static const int kBlockSize = VCDiffEngine::kMinimumMatchSize; member in open_vcdiff::__anon5d88d20d0111::VCDiffEngineTestBase
153 for (int i = 0; i < (kBlockSize - 1); ++i) { in ExpectDataStringWithBlockSpacing()
160 for (int i = 0; i < (kBlockSize - 1); ++i) { in ExpectDataStringWithBlockSpacing()
330 kBlockSize, false); in SetUpTestCase()
331 MakeEachLetterABlock(target_without_spaces_, &target_, kBlockSize, false); in SetUpTestCase()
446 if (!ExpectAddCopyInstruction(kBlockSize, (3 * kBlockSize) - 1, in TEST_F()
448 ExpectCopyInstruction((3 * kBlockSize) - 1, VCD_SELF_MODE); in TEST_F()
451 ExpectCopyInstruction((6 * kBlockSize) - 1, VCD_SELF_MODE); in TEST_F()
452 ExpectCopyInstruction(11 * kBlockSize, in TEST_F()
454 if (!ExpectAddCopyInstruction(1, (2 * kBlockSize) - 1, VCD_SELF_MODE)) { in TEST_F()
[all …]
Dblockhash_test.cc28 const int kBlockSize = BlockHash::kBlockSize; variable
82 CHECK(n < kBlockSize); in InitBlocksToDifferAtNthByte()
85 for (int index = n; index < kTimingTestSize; index += kBlockSize) { in InitBlocksToDifferAtNthByte()
115 char* padded_text = new char[(kBlockSize * length_without_spaces) + 1]; in MakeEachLetterABlock()
116 memset(padded_text, ' ', kBlockSize * length_without_spaces); in MakeEachLetterABlock()
117 char* padded_text_ptr = padded_text + (kBlockSize - 1); in MakeEachLetterABlock()
120 padded_text_ptr += kBlockSize; in MakeEachLetterABlock()
122 padded_text[kBlockSize * length_without_spaces] = '\0'; in MakeEachLetterABlock()
140 char* new_test_string_unaligned_e = new char[kBlockSize]; in SetUpTestCase()
141 memset(new_test_string_unaligned_e, ' ', kBlockSize); in SetUpTestCase()
[all …]
Drolling_hash_test.cc104 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()
[all …]
Dblockhash.cc43 COMPILE_ASSERT(BlockHash::kBlockSize >= 2, kBlockSize_must_be_at_least_2);
52 COMPILE_ASSERT((BlockHash::kBlockSize & (BlockHash::kBlockSize - 1)) == 0,
161 static_cast<int>(source_size_ / kBlockSize); // round down in AddBlock()
210 const int last_index_added = last_block_added_ * kBlockSize; in AddAllBlocksThroughIndex()
222 int last_legal_hash_index = static_cast<int>(source_size() - kBlockSize); in AddAllBlocksThroughIndex()
229 AddBlock(RollingHash<kBlockSize>::Hash(block_ptr)); in AddAllBlocksThroughIndex()
230 block_ptr += kBlockSize; in AddAllBlocksThroughIndex()
234 COMPILE_ASSERT((BlockHash::kBlockSize % sizeof(uword_t)) == 0,
271 static const size_t kWordsPerBlock = BlockHash::kBlockSize / sizeof(uword_t); in BlockCompareWordsInline()
289 return memcmp(block1, block2, BlockHash::kBlockSize) == 0; in BlockContentsMatchInline()
[all …]
Dblockhash.h74 static const int kBlockSize = 16;
325 static const int kMaxMatchesToCheck = (kBlockSize >= 32) ? 32 :
326 (32 * (32 / kBlockSize));
339 return source_size_ / kBlockSize; in GetNumberOfBlocks()
351 return (last_block_added_ + 1) * kBlockSize; in NextIndexToAdd()
Dvcdiffengine.cc57 if (!RollingHash<BlockHash::kBlockSize>::Init()) { in Init()
165 if (target_size < static_cast<size_t>(BlockHash::kBlockSize)) { in EncodeInternal()
170 RollingHash<BlockHash::kBlockSize> hasher; in EncodeInternal()
184 const char* const start_of_last_block = target_end - BlockHash::kBlockSize; in EncodeInternal()
228 candidate_pos[BlockHash::kBlockSize]); in EncodeInternal()
Dvcencoder_test.cc709 if (BlockHash::kBlockSize < 16) { in TEST_F()
729 } else if (BlockHash::kBlockSize <= 56) { in TEST_F()
765 if (BlockHash::kBlockSize < 16) { in TEST_F()
769 } else if (BlockHash::kBlockSize <= 56) { in TEST_F()
924 if (BlockHash::kBlockSize <= 8) { in TEST_F()
967 if (BlockHash::kBlockSize <= 8) { in TEST_F()
1002 if (BlockHash::kBlockSize <= 8) { in TEST_F()
/external/libyuv/files/util/
Dcompare.cc31 const int kBlockSize = 32768; in main() local
32 uint8 buf1[kBlockSize]; in main()
33 uint8 buf2[kBlockSize]; in main()
41 amt1 = fread(buf1, 1, kBlockSize, fin1); in main()
44 amt2 = fread(buf2, 1, kBlockSize, fin2); in main()
/external/compiler-rt/lib/tsan/lit_tests/
Djava_race_move.cc17 const int kBlockSize = 64; in main() local
19 __tsan_java_alloc((jptr)jheap, kBlockSize); in main()
25 __tsan_java_move(varaddr, varaddr2, kBlockSize); in main()
27 __tsan_java_free(varaddr2, kBlockSize); in main()
Djava_lock_move.cc21 const int kBlockSize = 64; in main() local
23 __tsan_java_alloc((jptr)jheap, kBlockSize); in main()
33 __tsan_java_move(varaddr, varaddr2, kBlockSize); in main()
35 __tsan_java_free(varaddr2, kBlockSize); in main()
Djava_race.cc13 const int kBlockSize = 16; in main() local
14 __tsan_java_alloc((jptr)jheap, kBlockSize); in main()
19 __tsan_java_free((jptr)jheap, kBlockSize); in main()
Djava_rwlock.cc18 const int kBlockSize = 16; in main() local
19 __tsan_java_alloc((jptr)jheap, kBlockSize); in main()
28 __tsan_java_free((jptr)jheap, kBlockSize); in main()
Djava_lock.cc18 const int kBlockSize = 16; in main() local
19 __tsan_java_alloc((jptr)jheap, kBlockSize); in main()
28 __tsan_java_free((jptr)jheap, kBlockSize); in main()
/external/v8/test/cctest/
Dtest-utils.cc143 const int kBlockSize = 7; in TEST() local
149 for (int i = 0; i < kBlockSize - 1; i++) { in TEST()
154 CHECK_EQ(kLoops * (kBlockSize + kSequentialSize), result.length()); in TEST()
156 int offset = i * (kSequentialSize + kBlockSize); in TEST()
157 for (int j = 0; j < kBlockSize - 1; j++) { in TEST()
160 CHECK_EQ(0xbadcafe, result[offset + kBlockSize - 1]); in TEST()
162 CHECK_EQ(j, result[offset + kBlockSize + j]); in TEST()
/external/libvpx/libvpx/test/
Dintrapred_test.cc232 static const int kBlockSize = 16; member in __anond3c989ca0111::IntraPredYTest
234 static const int kStride = kBlockSize * 3;
240 static const int kDataBufferSize = kStride * (kBlockSize + 1);
244 SetupMacroblock(data_array_, kBlockSize, kStride, 1); in SetUp()
301 static const int kBlockSize = 8; member in __anond3c989ca0111::IntraPredUVTest
303 static const int kStride = kBlockSize * 3;
310 static const int kDataBufferSize = 2 * kStride * (kBlockSize + 1);
314 SetupMacroblock(data_array_, kBlockSize, kStride, 2); in SetUp()
/external/libyuv/files/source/
Dcompare.cc228 const int kBlockSize = 1 << 15; // 32768; in HashDjb2() local
229 while (count >= static_cast<uint64>(kBlockSize)) { in HashDjb2()
230 seed = HashDjb2_SSE(src, kBlockSize, seed); in HashDjb2()
231 src += kBlockSize; in HashDjb2()
232 count -= kBlockSize; in HashDjb2()
369 const int kBlockSize = 1 << 15; // 32768; in ComputeSumSquareError() local
374 for (int i = 0; i < (count - (kBlockSize - 1)); i += kBlockSize) { in ComputeSumSquareError()
375 sse += SumSquareError(src_a + i, src_b + i, kBlockSize); in ComputeSumSquareError()
377 src_a += count & ~(kBlockSize - 1); in ComputeSumSquareError()
378 src_b += count & ~(kBlockSize - 1); in ComputeSumSquareError()
[all …]
/external/chromium/net/ftp/
Dftp_directory_listing_parser_vms.cc59 const int kBlockSize = 512; in ParseVmsFilesize() local
62 *size *= kBlockSize; in ParseVmsFilesize()
79 *size = blocks_used * kBlockSize; in ParseVmsFilesize()
/external/chromium/net/disk_cache/
Dsparse_control.cc37 const int kBlockSize = 1024; variable
466 child_data_.header.last_block_len > kBlockSize) { in OpenChild()
574 if (partial_block_len <= (child_offset_ & (kBlockSize - 1))) in VerifyRange()
599 int block_offset = child_offset_ & (kBlockSize - 1); in UpdateRange()
607 block_offset = (child_offset_ + result) & (kBlockSize - 1); in UpdateRange()
634 return entry_len & (kBlockSize - 1); in PartialBlockLength()
756 int block_offset = child_offset_ & (kBlockSize - 1); in DoGetAvailableRange()

12