/external/compiler-rt/test/asan/TestCases/ |
H A D | malloc_fill.cc | 10 static const int kSize = 1 << 25; local 11 unsigned char *x = new unsigned char[kSize];
|
H A D | stack-use-after-return.cc | 21 #ifndef kSize 22 # define kSize 1 macro 41 char local[kSize];
|
/external/compiler-rt/test/tsan/ |
H A D | barrier.cc | 10 const int kSize = 4; variable 12 int data[2][kSize]; 21 int right = idx + 1 < kSize ? prev[idx + 1] : 0; 29 pthread_barrier_init(&barrier, 0, kSize); 30 pthread_t th[kSize]; 31 for (int i = 0; i < kSize; i++) 33 for (int i = 0; i < kSize; i++)
|
H A D | restore_stack.cc | 6 const int kSize = 64 << 10; variable 7 volatile long data[kSize]; 10 for (int i = 0; i < kSize; i++) 33 for (int i = 0; i < kSize; i++)
|
/external/skia/gm/ |
H A D | xfermodes3.cpp | 62 SkAutoTUnref<SkCanvas> tempCanvas(this->possiblyCreateTempCanvas(canvas, kSize, kSize)); 68 {SkPaint::kStroke_Style, SkIntToScalar(kSize) / 2}, 76 SkIntToScalar(y + kSize + 3) + labelP.getTextSize(), 85 this->drawMode(canvas, x, y, kSize, kSize, modePaint, tempCanvas.get()); 88 x += kSize + 10; 91 y += kSize + 30; 102 this->drawMode(canvas, x, y, kSize, kSize, modePain 228 kSize = 30, enumerator in enum:skiagm::Xfermodes3GM::__anon13779 [all...] |
H A D | xfermodes2.cpp | 32 const SkScalar w = SkIntToScalar(kSize); 33 const SkScalar h = SkIntToScalar(kSize); 108 srcBmp.allocN32Pixels(kSize, kSize); 111 for (int y = 0; y < kSize; ++y) { 114 for (int x = 0; x < kSize; ++x) { 115 pixels[kSize * y + x] = rowColor; 122 dstBmp.allocN32Pixels(kSize, kSize); 125 for (int x = 0; x < kSize; 139 kSize = 256 >> kShift, enumerator in enum:skiagm::Xfermodes2GM::__anon13777 [all...] |
H A D | ninepatchstretch.cpp | 13 const int kSize = 2*kFixed + kStretchy; local 15 bitmap->allocN32Pixels(kSize, kSize); 19 SkRect r = SkRect::MakeWH(SkIntToScalar(kSize), SkIntToScalar(kSize)); 30 r.setXYWH(SkIntToScalar(kFixed), 0, SkIntToScalar(kStretchy), SkIntToScalar(kSize)); 33 r.setXYWH(0, SkIntToScalar(kFixed), SkIntToScalar(kSize), SkIntToScalar(kStretchy));
|
H A D | lumafilter.cpp | 13 static SkScalar kSize = 80; variable 34 SkRect r, c, bounds = SkRect::MakeWH(kSize, kSize); 84 SkPoint g2Points[] = { { 0, 0 }, { kSize, 0 } }; 128 SkScalar gridStep = kSize + 2 * kInset;
|
/external/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_addrhashmap.h | 25 // T must be a POD type, kSize is preferably a prime but can be any number. 43 template<typename T, uptr kSize> 70 Handle(AddrHashMap<T, kSize> *map, uptr addr); 71 Handle(AddrHashMap<T, kSize> *map, uptr addr, bool remove); 72 Handle(AddrHashMap<T, kSize> *map, uptr addr, bool remove, bool create); 80 friend AddrHashMap<T, kSize>; 81 AddrHashMap<T, kSize> *map_; 100 template<typename T, uptr kSize> 101 AddrHashMap<T, kSize>::Handle::Handle(AddrHashMap<T, kSize> *ma [all...] |
H A D | sanitizer_bitvector.h | 25 enum SizeEnum { kSize = sizeof(basic_int_t) * 8 }; enumerator in enum:__sanitizer::BasicBitVector::SizeEnum 27 uptr size() const { return kSize; } 107 // Fixed size bit vector of (kLevel1Size*BV::kSize**2) bits. 118 enum SizeEnum { kSize = BV::kSize * BV::kSize * kLevel1Size }; enumerator in enum:__sanitizer::TwoLevelBitVector::SizeEnum 121 uptr size() const { return kSize; } 131 for (uptr i1 = 0; i1 < BV::kSize; i1++) 189 uptr res = i0 * BV::kSize * BV::kSize [all...] |
H A D | sanitizer_bvgraph.h | 28 enum SizeEnum { kSize = BV::kSize }; enumerator in enum:__sanitizer::BVGraph::SizeEnum 29 uptr size() const { return kSize; } 158 BV v[kSize];
|
/external/llvm/unittests/Support/ |
H A D | CompressionTest.cpp | 49 const size_t kSize = 1024; local 50 char BinaryData[kSize]; 51 for (size_t i = 0; i < kSize; ++i) { 54 StringRef BinaryDataStr(BinaryData, kSize);
|
/external/compiler-rt/lib/sanitizer_common/tests/ |
H A D | sanitizer_mutex_test.cc | 29 for (int i = 0; i < kSize; i++) 36 for (int i = 0; i < kSize; i++) { 46 for (int i = 0; i < kSize; i++) { 54 volatile T data[kSize] = {}; 55 for (int i = 0; i < kSize; i++) { 63 static const int kSize = 64; member in class:__sanitizer::TestData 67 T data_[kSize];
|
H A D | sanitizer_common_test.cc | 174 static const uptr kSize = 5; local 175 uptr arr[kSize]; 176 for (uptr i = 0; i < kSize; i++) arr[i] = i * i; 178 for (uptr i = 0; i < kSize; i++) 179 ASSERT_EQ(InternalBinarySearch(arr, 0, kSize, i * i, UptrLess), i); 181 ASSERT_EQ(InternalBinarySearch(arr, 0, kSize, 7, UptrLess), kSize + 1); local
|
/external/compiler-rt/lib/tsan/tests/unit/ |
H A D | tsan_mutex_test.cc | 27 for (int i = 0; i < kSize; i++) 34 for (int i = 0; i < kSize; i++) { 43 for (int i = 0; i < kSize; i++) { 49 volatile T data[kSize] = {}; 50 for (int i = 0; i < kSize; i++) { 58 static const int kSize = 64; member in class:__tsan::TestData 62 T data_[kSize];
|
/external/compiler-rt/lib/tsan/tests/rtl/ |
H A D | tsan_bench.cc | 19 const int kSize = 128; variable 26 volatile T data[kSize]; 28 for (int j = 0; j < kSize; j++) { 85 for (int j = 0; j < kSize; j++) 87 for (int j = 0; j < kSize; j++)
|
/external/v8/test/cctest/compiler/ |
H A D | test-node-cache.cc | 54 const int32_t kSize = 1500; local 55 Node** nodes = graph.zone()->NewArray<Node*>(kSize); 58 for (int i = 0; i < kSize; i++) { 65 for (int i = 0; i < kSize; i++) { 95 const int32_t kSize = 1500; local 96 Node** nodes = graph.zone()->NewArray<Node*>(kSize); 99 for (int i = 0; i < kSize; i++) { 106 for (int i = 0; i < kSize; i++) { 138 const int32_t kSize = 50; local 139 int32_t buffer[kSize]; [all...] |
/external/compiler-rt/lib/asan/tests/ |
H A D | asan_interface_test.cc | 246 const size_t kSize = 24; local 247 bool expected[kSize]; 248 char *arr = Ident((char*)malloc(kSize)); 249 for (size_t l1 = 0; l1 < kSize; l1++) { 250 for (size_t s1 = 1; l1 + s1 <= kSize; s1++) { 251 for (size_t l2 = 0; l2 < kSize; l2++) { 252 for (size_t s2 = 1; l2 + s2 <= kSize; s2++) { 254 __asan_unpoison_memory_region(arr, kSize); 257 memset(expected, false, kSize); 259 MakeShadowValid(expected, kSize, /*granularit [all...] |
/external/compiler-rt/lib/tsan/rtl/ |
H A D | tsan_clock.h | 27 static const uptr kSize = 512; member in struct:__tsan::ClockBlock 28 static const uptr kTableSize = kSize / sizeof(u32); 29 static const uptr kClockCount = kSize / sizeof(ClockElem);
|
H A D | tsan_dense_alloc.h | 29 static const uptr kSize = 128; member in class:__tsan::DenseSlabAllocCache 32 IndexT cache[kSize]; 69 if (c->pos == Cache::kSize) 118 for (uptr i = 0; i < Cache::kSize / 2 && freelist_ != 0; i++) { 127 for (uptr i = 0; i < Cache::kSize / 2; i++) {
|
/external/skia/tests/ |
H A D | BlurTest.cpp | 330 static const int kSize = 100; local 347 int rectSpecialCaseResult[kSize]; 348 int generalCaseResult[kSize]; 349 int groundTruthResult[kSize]; 350 int bruteForce1DResult[kSize]; 356 cpu_blur_path(rectPath, sigma, rectSpecialCaseResult, kSize); 357 cpu_blur_path(polyPath, sigma, generalCaseResult, kSize); 359 ground_truth_2d(100, 100, sigma, groundTruthResult, kSize); 360 brute_force_1d(-50.0f, 50.0f, sigma, bruteForce1DResult, kSize); 362 REPORTER_ASSERT(reporter, match(rectSpecialCaseResult, bruteForce1DResult, kSize, [all...] |
/external/lzma/CPP/7zip/Archive/7z/ |
H A D | 7zHeader.h | 69 kSize,
enumerator in enum:NArchive::N7z::NID::EEnum
|
/external/v8/src/ |
H A D | unicode.h | 42 static const int kSize = size; member in class:unibrow::Predicate 43 static const int kMask = kSize - 1; 44 CacheEntry entries_[kSize]; 68 static const int kSize = size; member in class:unibrow::Mapping 69 static const int kMask = kSize - 1; 70 CacheEntry entries_[kSize];
|
H A D | dateparser.h | 319 return index_ < kSize ? (comp_[index_++] = n, true) : false; 323 while (index_ < kSize) comp_[index_++] = 0; 337 static const int kSize = 4; 338 int comp_[kSize]; 348 if (index_ < kSize) { 362 static const int kSize = 3; 363 int comp_[kSize];
|
/external/skia/include/core/ |
H A D | SkTypes.h | 596 * Manage an allocated block of memory. If the requested size is <= kSize, then 601 template <size_t kSize> class SkAutoSMalloc : SkNoncopyable { 610 fSize = kSize; 614 * Allocate a block of the specified size. If size <= kSize, then the 620 fSize = kSize; 626 * have been allocated on the stack (size <= kSize) then this does nothing. 644 * previously allocated block. As with the constructor, if size <= kSize 651 size = (size < kSize) ? kSize : size; 661 if (size == kSize) { [all...] |