Home
last modified time | relevance | path

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

123

/external/open-vcdiff/src/
Dvcdiffengine_test.cc40 static const int kBlockSize = VCDiffEngine::kMinimumMatchSize; member in open_vcdiff::__anonabb2a00d0111::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 …]
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_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 …]
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()
/external/chromium_org/sdch/open-vcdiff/src/
Dvcdiffengine_test.cc40 static const int kBlockSize = VCDiffEngine::kMinimumMatchSize; member in open_vcdiff::__anone28e7c780111::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 …]
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_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 …]
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()
/external/chromium/sdch/open-vcdiff/src/
Dvcdiffengine_test.cc41 static const int kBlockSize = VCDiffEngine::kMinimumMatchSize; member in open_vcdiff::__anon7e6464f10111::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 …]
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_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 …]
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()
/external/chromium_org/webkit/browser/appcache/
Dappcache_response_unittest.cc29 static const int kBlockSize = 1024; variable
321 read_buffer_ = new IOBuffer(kBlockSize); in ReadNonExistentData()
323 kBlockSize, in ReadNonExistentData()
385 GetHttpResponseInfoSize(head) + kNumBlocks * kBlockSize; in AmountWritten()
454 new IOBuffer(kBlockSize)); in WriteOneBlock()
455 FillData(block_number, io_buffer->data(), kBlockSize); in WriteOneBlock()
456 WriteResponseBody(io_buffer, kBlockSize); in WriteOneBlock()
473 ReadResponseBody(new IOBuffer(kBlockSize), kBlockSize); in ReadOneBlock()
477 EXPECT_TRUE(CheckData(block_number, read_buffer_->data(), kBlockSize)); in VerifyOneBlock()
486 int big_size = kNumBlocks * kBlockSize; in ReadAllAtOnce()
[all …]
/external/skia/gm/
Dbleed.cpp113 SkRect dst = SkRect::MakeXYWH(0, 0, SkIntToScalar(kBlockSize), SkIntToScalar(kBlockSize)); in drawCase1()
130 SkRect dst = SkRect::MakeXYWH(0, 0, SkIntToScalar(kBlockSize), SkIntToScalar(kBlockSize)); in drawCase2()
147 SkRect dst = SkRect::MakeXYWH(0, 0, SkIntToScalar(kBlockSize), SkIntToScalar(kBlockSize)); in drawCase3()
164 SkRect dst = SkRect::MakeXYWH(0, 0, SkIntToScalar(kBlockSize), SkIntToScalar(kBlockSize)); in drawCase4()
185 static const SkScalar kBottom = SkIntToScalar(kRow3Y + kBlockSize + kBlockSpacing); in onDraw()
255 static const int kBlockSize = 70; member in BleedGM
259 static const int kCol1X = 2*kBlockSpacing + kBlockSize;
260 static const int kCol2X = 3*kBlockSpacing + 2*kBlockSize;
261 static const int kCol3X = 4*kBlockSpacing + 3*kBlockSize;
262 static const int kCol4X = 5*kBlockSpacing + 4*kBlockSize;
[all …]
/external/chromium_org/third_party/leveldatabase/src/db/
Dlog_test.cc227 2 * log::kBlockSize - 1000, // Span three blocks
235 (2 * log::kBlockSize - 1000) + 3 * kHeaderSize};
277 const int n = kBlockSize - 2*kHeaderSize; in TEST()
279 ASSERT_EQ(kBlockSize - kHeaderSize, WrittenBytes()); in TEST()
290 const int n = kBlockSize - 2*kHeaderSize; in TEST()
292 ASSERT_EQ(kBlockSize - kHeaderSize, WrittenBytes()); in TEST()
302 const int n = kBlockSize - 2*kHeaderSize + 4; in TEST()
304 ASSERT_EQ(kBlockSize - kHeaderSize + 4, WrittenBytes()); in TEST()
314 const int n = kBlockSize - 2*kHeaderSize + 4; in TEST()
316 ASSERT_EQ(kBlockSize - kHeaderSize + 4, WrittenBytes()); in TEST()
[all …]
Dlog_reader.cc23 backing_store_(new char[kBlockSize]), in Reader()
36 size_t offset_in_block = initial_offset_ % kBlockSize; in SkipToInitialBlock()
40 if (offset_in_block > kBlockSize - 6) { in SkipToInitialBlock()
42 block_start_location += kBlockSize; in SkipToInitialBlock()
185 Status status = file_->Read(kBlockSize, &buffer_, backing_store_); in ReadPhysicalRecord()
189 ReportDrop(kBlockSize, status); in ReadPhysicalRecord()
192 } else if (buffer_.size() < kBlockSize) { in ReadPhysicalRecord()
/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()
/external/lzma/CPP/7zip/Common/
DStreamUtils.cpp7 static const UInt32 kBlockSize = ((UInt32)1 << 31); variable
15 UInt32 curSize = (size < kBlockSize) ? (UInt32)size : kBlockSize; in ReadStream()
46 UInt32 curSize = (size < kBlockSize) ? (UInt32)size : kBlockSize; in WriteStream()
/external/chromium_org/third_party/leveldatabase/src/util/
Darena.cc10 static const int kBlockSize = 4096; variable
25 if (bytes > kBlockSize / 4) { in AllocateFallback()
33 alloc_ptr_ = AllocateNewBlock(kBlockSize); in AllocateFallback()
34 alloc_bytes_remaining_ = kBlockSize; in AllocateFallback()
/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/thirdparty/mod_pywebsocket/
Dfast_masking.i74 const int kBlockSize = 16; in mask() local
76 for (int i = 0; i < kBlockSize; ++i) { in mask()
82 while (cursor + kBlockSize <= cursor_end) { in mask()
87 cursor += kBlockSize; in mask()

123