| /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_lock.cc | 20 const int kBlockSize = 16;
21 __tsan_java_alloc((jptr)jheap, kBlockSize);
30 __tsan_java_free((jptr)jheap, 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);
|
| 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_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);
|
| /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/sdch/open-vcdiff/src/ |
| 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.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/ |
| 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.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/third_party/leveldatabase/src/db/ |
| log_format.h | 27 static const int kBlockSize = 32768;
|
| /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;
|
| /external/chromium_org/third_party/libjingle/source/talk/base/ |
| messagedigest.cc | 52 static const size_t kBlockSize = 64; // valid for SHA-256 and down
117 size_t block_len = kBlockSize;
|
| /external/open-vcdiff/src/ |
| 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.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/net/ftp/ |
| ftp_directory_listing_parser_vms.cc | 59 const int kBlockSize = 512;
62 *size *= kBlockSize;
79 *size = blocks_used * kBlockSize;
|
| /external/chromium_org/net/ftp/ |
| ftp_directory_listing_parser_vms.cc | 66 const int kBlockSize = 512;
71 *size *= kBlockSize;
90 *size = blocks_used * kBlockSize;
|
| /external/chromium_org/ui/app_list/views/ |
| pulsing_block_view.cc | 21 const int kBlockSize = 64;
102 rect.ClampToCenteredSize(gfx::Size(kBlockSize, kBlockSize));
|
| /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/chromium_org/v8/test/cctest/ |
| test-utils.cc | 154 const int kBlockSize = 7;
160 for (int i = 0; i < kBlockSize - 1; i++) {
165 CHECK_EQ(kLoops * (kBlockSize + kSequentialSize), result.length());
167 int offset = i * (kSequentialSize + kBlockSize);
168 for (int j = 0; j < kBlockSize - 1; j++) {
171 CHECK_EQ(0xbadcafe, result[offset + kBlockSize - 1]);
173 CHECK_EQ(j, result[offset + kBlockSize + j]);
|
| /external/v8/test/cctest/ |
| test-utils.cc | 143 const int kBlockSize = 7;
149 for (int i = 0; i < kBlockSize - 1; i++) {
154 CHECK_EQ(kLoops * (kBlockSize + kSequentialSize), result.length());
156 int offset = i * (kSequentialSize + kBlockSize);
157 for (int j = 0; j < kBlockSize - 1; j++) {
160 CHECK_EQ(0xbadcafe, result[offset + kBlockSize - 1]);
162 CHECK_EQ(j, result[offset + kBlockSize + j]);
|
| /external/chromium_org/third_party/libjingle/source/talk/session/tunnel/ |
| tunnelsessionclient_unittest.cc | 41 static const int kBlockSize = 4096;
180 char block[kBlockSize];
193 char block[kBlockSize];
|
| /external/lzma/CPP/7zip/ |
| ICoder.h | 37 kBlockSize,
|
