Searched defs:kBlockSize (Results 1 - 25 of 52) sorted by relevance

123

/external/compiler-rt/lib/tsan/lit_tests/
H A Djava_race.cc13 const int kBlockSize = 16; local
14 __tsan_java_alloc((jptr)jheap, kBlockSize);
19 __tsan_java_free((jptr)jheap, kBlockSize);
H A Djava_lock.cc20 const int kBlockSize = 16; local
21 __tsan_java_alloc((jptr)jheap, kBlockSize);
30 __tsan_java_free((jptr)jheap, kBlockSize);
H A Djava_lock_rec.cc32 const int kBlockSize = 16; local
33 __tsan_java_alloc((jptr)jheap, kBlockSize);
48 __tsan_java_free((jptr)jheap, kBlockSize);
H A Djava_lock_rec_race.cc30 const int kBlockSize = 16; local
31 __tsan_java_alloc((jptr)jheap, kBlockSize);
42 __tsan_java_free((jptr)jheap, kBlockSize);
H A Djava_race_move.cc17 const int kBlockSize = 64; local
19 __tsan_java_alloc((jptr)jheap, kBlockSize);
25 __tsan_java_move(varaddr, varaddr2, kBlockSize);
27 __tsan_java_free(varaddr2, kBlockSize);
H A Djava_rwlock.cc20 const int kBlockSize = 16; local
21 __tsan_java_alloc((jptr)jheap, kBlockSize);
30 __tsan_java_free((jptr)jheap, kBlockSize);
H A Djava_lock_move.cc21 const int kBlockSize = 64; local
23 __tsan_java_alloc((jptr)jheap, kBlockSize);
33 __tsan_java_move(varaddr, varaddr2, kBlockSize);
35 __tsan_java_free(varaddr2, kBlockSize);
/external/chromium_org/third_party/leveldatabase/src/db/
H A Dlog_format.h27 static const int kBlockSize = 32768; member in namespace:leveldb::log
/external/chromium_org/third_party/leveldatabase/src/util/
H A Darena.cc10 static const int kBlockSize = 4096; member in namespace:leveldb
25 if (bytes > kBlockSize / 4) {
33 alloc_ptr_ = AllocateNewBlock(kBlockSize);
34 alloc_bytes_remaining_ = kBlockSize;
/external/lzma/CPP/7zip/Common/
H A DStreamUtils.cpp7 static const UInt32 kBlockSize = ((UInt32)1 << 31); variable
15 UInt32 curSize = (size < kBlockSize) ? (UInt32)size : kBlockSize;
46 UInt32 curSize = (size < kBlockSize) ? (UInt32)size : kBlockSize;
/external/chromium_org/third_party/libjingle/source/talk/base/
H A Dmessagedigest.cc52 static const size_t kBlockSize = 64; // valid for SHA-256 and down member in namespace:talk_base
117 size_t block_len = kBlockSize;
/external/libyuv/files/util/
H A Dcompare.cc31 const int kBlockSize = 32768; local
32 uint8 buf1[kBlockSize];
33 uint8 buf2[kBlockSize];
41 amt1 = fread(buf1, 1, kBlockSize, fin1);
44 amt2 = fread(buf2, 1, kBlockSize, fin2);
/external/chromium/net/ftp/
H A Dftp_directory_listing_parser_vms.cc59 const int kBlockSize = 512; local
62 *size *= kBlockSize;
79 *size = blocks_used * kBlockSize;
/external/chromium/sdch/open-vcdiff/src/
H A Dblockhash_test.cc28 const int kBlockSize = BlockHash::kBlockSize; member in namespace:open_vcdiff
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
[all...]
H A Dblockhash.h31 // 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; member in class:open_vcdiff::BlockHash
115 // will contain one entry for each kBlockSize
[all...]
/external/chromium_org/sdch/open-vcdiff/src/
H A Dblockhash_test.cc28 const int kBlockSize = BlockHash::kBlockSize; member in namespace:open_vcdiff
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
[all...]
H A Dblockhash.h31 // 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; member in class:open_vcdiff::BlockHash
115 // will contain one entry for each kBlockSize
[all...]
/external/chromium_org/ui/app_list/views/
H A Dpulsing_block_view.cc21 const int kBlockSize = 64; member in namespace:__anon15012
102 rect.ClampToCenteredSize(gfx::Size(kBlockSize, kBlockSize));
/external/chromium_org/v8/test/cctest/
H A Dtest-utils.cc154 const int kBlockSize = 7; local
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/open-vcdiff/src/
H A Dblockhash_test.cc28 const int kBlockSize = BlockHash::kBlockSize; member in namespace:open_vcdiff
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
[all...]
H A Dblockhash.h31 // 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; member in class:open_vcdiff::BlockHash
115 // will contain one entry for each kBlockSize
[all...]
/external/v8/test/cctest/
H A Dtest-utils.cc143 const int kBlockSize = 7; local
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/net/ftp/
H A Dftp_directory_listing_parser_vms.cc66 const int kBlockSize = 512; local
71 *size *= kBlockSize;
90 *size = blocks_used * kBlockSize;
/external/lzma/CPP/7zip/
H A DICoder.h37 kBlockSize, enumerator in enum:NCoderPropID::EEnum
/external/chromium_org/gpu/command_buffer/tests/
H A Dcompressed_texture_test.cc33 static const unsigned kBlockSize = 4; member in namespace:gpu
35 static const unsigned kTextureWidth = kBlockSize * kPaletteSize;
36 static const unsigned kTextureHeight = kBlockSize;
236 origin[0] = kBlockSize * i;
239 kBlockSize, kBlockSize,

Completed in 609 milliseconds

123