| /external/compiler-rt/lib/tsan/lit_tests/ |
| java_race.cc | 13 const int kBlockSize = 16;
14 __tsan_java_alloc((jptr)jheap, kBlockSize);
19 __tsan_java_free((jptr)jheap, kBlockSize);
|
| java_race_move.cc | 17 const int kBlockSize = 64;
19 __tsan_java_alloc((jptr)jheap, kBlockSize);
25 __tsan_java_move(varaddr, varaddr2, kBlockSize);
27 __tsan_java_free(varaddr2, kBlockSize);
|
| java_lock.cc | 20 const int kBlockSize = 16;
21 __tsan_java_alloc((jptr)jheap, kBlockSize);
30 __tsan_java_free((jptr)jheap, kBlockSize);
|
| java_rwlock.cc | 20 const int kBlockSize = 16;
21 __tsan_java_alloc((jptr)jheap, kBlockSize);
30 __tsan_java_free((jptr)jheap, kBlockSize);
|
| java_lock_move.cc | 21 const int kBlockSize = 64;
23 __tsan_java_alloc((jptr)jheap, kBlockSize);
33 __tsan_java_move(varaddr, varaddr2, kBlockSize);
35 __tsan_java_free(varaddr2, kBlockSize);
|
| java_lock_rec.cc | 32 const int kBlockSize = 16;
33 __tsan_java_alloc((jptr)jheap, kBlockSize);
48 __tsan_java_free((jptr)jheap, kBlockSize);
|
| java_lock_rec_race.cc | 30 const int kBlockSize = 16;
31 __tsan_java_alloc((jptr)jheap, kBlockSize);
42 __tsan_java_free((jptr)jheap, kBlockSize);
|
| /external/chromium_org/third_party/leveldatabase/src/db/ |
| log_format.h | 27 static const int kBlockSize = 32768;
|
| /external/chromium/sdch/open-vcdiff/src/ |
| vcdiffengine_test.cc | 41 static const int kBlockSize = VCDiffEngine::kMinimumMatchSize;
153 for (int i = 0; i < (kBlockSize - 1); ++i) {
160 for (int i = 0; i < (kBlockSize - 1); ++i) {
330 kBlockSize, false);
331 MakeEachLetterABlock(target_without_spaces_, &target_, kBlockSize, false);
446 if (!ExpectAddCopyInstruction(kBlockSize, (3 * kBlockSize) - 1,
448 ExpectCopyInstruction((3 * kBlockSize) - 1, VCD_SELF_MODE);
451 ExpectCopyInstruction((6 * kBlockSize) - 1, VCD_SELF_MODE);
452 ExpectCopyInstruction(11 * kBlockSize,
[all...] |
| rolling_hash_test.cc | 104 template<int kBlockSize> static void BM_DefaultHash(int iterations,
106 RollingHash<kBlockSize> hasher;
115 template<int kBlockSize> static void BM_UpdateHash(int iterations,
117 RollingHash<kBlockSize> hasher;
124 buffer[i + kBlockSize]);
137 template<int kBlockSize> void UpdateHashMatchesHashForBlockSize() {
138 RollingHash<kBlockSize>::Init();
139 RollingHash<kBlockSize> hasher;
142 PortableRandomInRange(kUpdateHashBlocks - 1) + kBlockSize;
145 for (int i = kBlockSize; i < random_buffer_size; ++i)
[all...] |
| blockhash_test.cc | 28 const int kBlockSize = BlockHash::kBlockSize;
82 CHECK(n < kBlockSize);
85 for (int index = n; index < kTimingTestSize; index += kBlockSize) {
102 // in sample_text_without_spaces matches (kBlockSize - 1)
106 // if kBlockSize is 4, then 3 space characters will be inserted
109 // This makes testing simpler, because finding a kBlockSize-byte match
115 char* padded_text = new char[(kBlockSize * length_without_spaces) + 1];
116 memset(padded_text, ' ', kBlockSize * length_without_spaces);
117 char* padded_text_ptr = padded_text + (kBlockSize - 1)
[all...] |
| blockhash.cc | 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),
[all...] |
| blockhash.h | 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 th
[all...] |
| /external/chromium_org/sdch/open-vcdiff/src/ |
| vcdiffengine_test.cc | 40 static const int kBlockSize = VCDiffEngine::kMinimumMatchSize;
151 for (int i = 0; i < (kBlockSize - 1); ++i) {
158 for (int i = 0; i < (kBlockSize - 1); ++i) {
309 kBlockSize, false);
310 MakeEachLetterABlock(target_without_spaces_, &target_, kBlockSize, false);
423 if (!ExpectAddCopyInstruction(kBlockSize, (3 * kBlockSize) - 1,
425 ExpectCopyInstruction((3 * kBlockSize) - 1, VCD_SELF_MODE);
428 ExpectCopyInstruction((6 * kBlockSize) - 1, VCD_SELF_MODE);
429 ExpectCopyInstruction(11 * kBlockSize,
[all...] |
| rolling_hash_test.cc | 104 template<int kBlockSize> static void BM_DefaultHash(int iterations,
106 RollingHash<kBlockSize> hasher;
115 template<int kBlockSize> static void BM_UpdateHash(int iterations,
117 RollingHash<kBlockSize> hasher;
124 buffer[i + kBlockSize]);
137 template<int kBlockSize> void UpdateHashMatchesHashForBlockSize() {
138 RollingHash<kBlockSize>::Init();
139 RollingHash<kBlockSize> hasher;
142 PortableRandomInRange(kUpdateHashBlocks - 1) + kBlockSize;
145 for (int i = kBlockSize; i < random_buffer_size; ++i)
[all...] |
| blockhash_test.cc | 28 const int kBlockSize = BlockHash::kBlockSize;
82 CHECK(n < kBlockSize);
85 for (int index = n; index < kTimingTestSize; index += kBlockSize) {
102 // in sample_text_without_spaces matches (kBlockSize - 1)
106 // if kBlockSize is 4, then 3 space characters will be inserted
109 // This makes testing simpler, because finding a kBlockSize-byte match
115 char* padded_text = new char[(kBlockSize * length_without_spaces) + 1];
116 memset(padded_text, ' ', kBlockSize * length_without_spaces);
117 char* padded_text_ptr = padded_text + (kBlockSize - 1)
[all...] |
| blockhash.cc | 41 // kBlockSize must be at least 2 to be meaningful. Since it's a compile-time
44 VCD_COMPILE_ASSERT(BlockHash::kBlockSize >= 2, kBlockSize_must_be_at_least_2);
46 // kBlockSize is required to be a power of 2 because multiplication
47 // (n * kBlockSize), division (n / kBlockSize) and MOD (n % kBlockSize)
48 // are commonly-used operations. If kBlockSize is a compile-time
53 VCD_COMPILE_ASSERT((BlockHash::kBlockSize & (BlockHash::kBlockSize - 1)) == 0,
113 // probability of a hash collision to (sizeof(int) / kblockSize),
[all...] |
| /external/open-vcdiff/src/ |
| vcdiffengine_test.cc | 40 static const int kBlockSize = VCDiffEngine::kMinimumMatchSize;
151 for (int i = 0; i < (kBlockSize - 1); ++i) {
158 for (int i = 0; i < (kBlockSize - 1); ++i) {
309 kBlockSize, false);
310 MakeEachLetterABlock(target_without_spaces_, &target_, kBlockSize, false);
423 if (!ExpectAddCopyInstruction(kBlockSize, (3 * kBlockSize) - 1,
425 ExpectCopyInstruction((3 * kBlockSize) - 1, VCD_SELF_MODE);
428 ExpectCopyInstruction((6 * kBlockSize) - 1, VCD_SELF_MODE);
429 ExpectCopyInstruction(11 * kBlockSize,
[all...] |
| rolling_hash_test.cc | 104 template<int kBlockSize> static void BM_DefaultHash(int iterations,
106 RollingHash<kBlockSize> hasher;
115 template<int kBlockSize> static void BM_UpdateHash(int iterations,
117 RollingHash<kBlockSize> hasher;
124 buffer[i + kBlockSize]);
137 template<int kBlockSize> void UpdateHashMatchesHashForBlockSize() {
138 RollingHash<kBlockSize>::Init();
139 RollingHash<kBlockSize> hasher;
142 PortableRandomInRange(kUpdateHashBlocks - 1) + kBlockSize;
145 for (int i = kBlockSize; i < random_buffer_size; ++i)
[all...] |
| blockhash_test.cc | 28 const int kBlockSize = BlockHash::kBlockSize;
82 CHECK(n < kBlockSize);
85 for (int index = n; index < kTimingTestSize; index += kBlockSize) {
102 // in sample_text_without_spaces matches (kBlockSize - 1)
106 // if kBlockSize is 4, then 3 space characters will be inserted
109 // This makes testing simpler, because finding a kBlockSize-byte match
115 char* padded_text = new char[(kBlockSize * length_without_spaces) + 1];
116 memset(padded_text, ' ', kBlockSize * length_without_spaces);
117 char* padded_text_ptr = padded_text + (kBlockSize - 1)
[all...] |
| blockhash.cc | 41 // kBlockSize must be at least 2 to be meaningful. Since it's a compile-time
44 VCD_COMPILE_ASSERT(BlockHash::kBlockSize >= 2, kBlockSize_must_be_at_least_2);
46 // kBlockSize is required to be a power of 2 because multiplication
47 // (n * kBlockSize), division (n / kBlockSize) and MOD (n % kBlockSize)
48 // are commonly-used operations. If kBlockSize is a compile-time
53 VCD_COMPILE_ASSERT((BlockHash::kBlockSize & (BlockHash::kBlockSize - 1)) == 0,
113 // probability of a hash collision to (sizeof(int) / kblockSize),
[all...] |
| /external/libyuv/files/util/ |
| compare.cc | 31 const int kBlockSize = 32768;
32 uint8 buf1[kBlockSize];
33 uint8 buf2[kBlockSize];
41 amt1 = fread(buf1, 1, kBlockSize, fin1);
44 amt2 = fread(buf2, 1, kBlockSize, fin2);
|
| /external/lzma/CPP/7zip/Common/ |
| StreamUtils.cpp | 7 static const UInt32 kBlockSize = ((UInt32)1 << 31);
15 UInt32 curSize = (size < kBlockSize) ? (UInt32)size : kBlockSize;
46 UInt32 curSize = (size < kBlockSize) ? (UInt32)size : kBlockSize;
|
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/thirdparty/mod_pywebsocket/ |
| fast_masking.i | 74 const int kBlockSize = 16;
76 for (int i = 0; i < kBlockSize; ++i) {
82 while (cursor + kBlockSize <= cursor_end) {
87 cursor += kBlockSize;
|
| /external/chromium_org/third_party/leveldatabase/src/util/ |
| arena.cc | 10 static const int kBlockSize = 4096;
25 if (bytes > kBlockSize / 4) {
33 alloc_ptr_ = AllocateNewBlock(kBlockSize);
34 alloc_bytes_remaining_ = kBlockSize;
|
