/external/pigweed/pw_allocator/ |
D | unique_ptr_test.cc | 115 constexpr static size_t kArraySize = 5; in TEST_F() local 119 auto ptr1 = allocator_.MakeUniqueArray<Counter>(kArraySize); in TEST_F() 121 EXPECT_EQ(Counter::GetNumCtorCalls(), kArraySize); in TEST_F() 122 for (size_t i = 0; i < kArraySize; ++i) { in TEST_F() 127 auto ptr2 = allocator_.MakeUnique<Counter[]>(kArraySize); in TEST_F() 128 EXPECT_EQ(Counter::GetNumCtorCalls(), kArraySize); in TEST_F() 130 for (size_t i = 0; i < kArraySize; ++i) { in TEST_F() 136 constexpr static size_t kArraySize = 5; in TEST_F() local 141 auto ptr1 = allocator_.MakeUniqueArray<Counter>(kArraySize, kArrayAlignment); in TEST_F() 143 EXPECT_EQ(Counter::GetNumCtorCalls(), kArraySize); in TEST_F() [all …]
|
/external/libchrome/base/debug/ |
D | asan_invalid_access.cc | 31 static const int kArraySize = 5; in CorruptMemoryBlock() local 32 LONG* array = new LONG[kArraySize]; in CorruptMemoryBlock() 57 static const size_t kArraySize = 5; variable 62 const_cast<volatile int*>(new int[kArraySize])); in AsanHeapOverflow() 63 int dummy = array[kArraySize]; in AsanHeapOverflow() 70 const_cast<volatile int*>(new int[kArraySize])); in AsanHeapUnderflow() 82 const_cast<volatile int*>(new int[kArraySize])); in AsanHeapUseAfterFree() 85 int dummy = dangling[kArraySize / 2]; in AsanHeapUseAfterFree()
|
/external/cronet/tot/base/debug/ |
D | asan_invalid_access.cc | 37 static const int kArraySize = 5; in CorruptMemoryBlock() local 38 LONG* array = new LONG[kArraySize]; in CorruptMemoryBlock() 67 static const size_t kArraySize = 4; variable 72 const_cast<volatile int*>(new int[kArraySize])); in AsanHeapOverflow() 73 int dummy = array[kArraySize]; in AsanHeapOverflow() 80 const_cast<volatile int*>(new int[kArraySize])); in AsanHeapUnderflow() 92 const_cast<volatile int*>(new int[kArraySize])); in AsanHeapUseAfterFree() 95 int dummy = dangling[kArraySize / 2]; in AsanHeapUseAfterFree()
|
/external/cronet/stable/base/debug/ |
D | asan_invalid_access.cc | 37 static const int kArraySize = 5; in CorruptMemoryBlock() local 38 LONG* array = new LONG[kArraySize]; in CorruptMemoryBlock() 67 static const size_t kArraySize = 4; variable 72 const_cast<volatile int*>(new int[kArraySize])); in AsanHeapOverflow() 73 int dummy = array[kArraySize]; in AsanHeapOverflow() 80 const_cast<volatile int*>(new int[kArraySize])); in AsanHeapUnderflow() 92 const_cast<volatile int*>(new int[kArraySize])); in AsanHeapUseAfterFree() 95 int dummy = dangling[kArraySize / 2]; in AsanHeapUseAfterFree()
|
/external/cronet/tot/base/ |
D | security_unittest.cc | 85 const size_t kArraySize = 4096; in TEST() local 89 HideValueFromCompiler(kArraySize); in TEST() 91 const size_t kArraySize2 = kMaxSizeT / kArraySize + 10; in TEST() 94 std::unique_ptr<char[][kArraySize]> array_pointer( in TEST() 95 new (nothrow) char[kDynamicArraySize2][kArraySize]); in TEST()
|
/external/cronet/stable/base/ |
D | security_unittest.cc | 85 const size_t kArraySize = 4096; in TEST() local 89 HideValueFromCompiler(kArraySize); in TEST() 91 const size_t kArraySize2 = kMaxSizeT / kArraySize + 10; in TEST() 94 std::unique_ptr<char[][kArraySize]> array_pointer( in TEST() 95 new (nothrow) char[kDynamicArraySize2][kArraySize]); in TEST()
|
/external/libchrome/base/ |
D | security_unittest.cc | 88 const size_t kArraySize = 4096; in TEST() local 91 const size_t kDynamicArraySize = HideValueFromCompiler(kArraySize); in TEST() 93 const size_t kArraySize2 = kMaxSizeT / kArraySize + 10; in TEST() 96 std::unique_ptr<char[][kArraySize]> array_pointer( in TEST() 97 new (nothrow) char[kDynamicArraySize2][kArraySize]); in TEST()
|
/external/libchrome/base/containers/ |
D | small_map.h | 163 int kArraySize = 4, 173 static_assert(kArraySize > 0, "default initial size should be positive"); 405 if (size_ == kArraySize) { 427 if (size_ == kArraySize) { 462 if (size_ == kArraySize) { 586 value_type array_[kArraySize]; 597 value_type array[kArraySize]; 601 for (int i = 0; i < kArraySize; i++) { 611 for (int i = 0; i < kArraySize; i++) { 642 int kArraySize, [all …]
|
/external/compiler-rt/test/msan/ |
D | allocator_returns_null.cc | 40 size_t kArraySize = 4096; in main() local 41 volatile size_t kArraySize2 = kMaxSizeT / kArraySize + 10; in main() 42 x = (char*)calloc(kArraySize, kArraySize2); in main()
|
/external/compiler-rt/test/tsan/ |
D | allocator_returns_null.cc | 35 size_t kArraySize = 4096; in main() local 36 volatile size_t kArraySize2 = kMaxSizeT / kArraySize + 10; in main() 37 x = (char*)calloc(kArraySize, kArraySize2); in main()
|
/external/pigweed/pw_containers/public/pw_containers/ |
D | flat_map.h | 58 template <typename Key, typename Value, size_t kArraySize> 68 using container_type = typename std::array<value_type, kArraySize>; 134 constexpr FlatMap(const std::array<value_type, kArraySize>& items) in FlatMap() 136 ConstexprSort(items_.begin(), kArraySize); in FlatMap() 150 constexpr size_type size() const { return kArraySize; } in size() 152 constexpr size_type max_size() const { return kArraySize; } in max_size() 286 std::array<value_type, kArraySize> items_;
|
/external/compiler-rt/test/asan/TestCases/ |
D | allocator_returns_null.cc | 43 size_t kArraySize = 4096; in main() local 44 volatile size_t kArraySize2 = kMaxSizeT / kArraySize + 10; in main() 45 x = calloc(kArraySize, kArraySize2); in main()
|
/external/cronet/tot/third_party/jni_zero/benchmarks/ |
D | benchmark.cc | 114 const int kArraySize = 10000; in JNI_Benchmark_RunNativeToJavaParamSizesBenchmark() local 117 array.resize(kArraySize); in JNI_Benchmark_RunNativeToJavaParamSizesBenchmark() 118 for (int i = 0; i < kArraySize; i++) { in JNI_Benchmark_RunNativeToJavaParamSizesBenchmark() 127 benchmark_log << "Sending " << kArraySize in JNI_Benchmark_RunNativeToJavaParamSizesBenchmark() 131 benchmark_log << "Average per " << kArraySize in JNI_Benchmark_RunNativeToJavaParamSizesBenchmark() 137 for (int i = 0; i < kArraySize; i++) { in JNI_Benchmark_RunNativeToJavaParamSizesBenchmark() 142 benchmark_log << "Sending " << kArraySize in JNI_Benchmark_RunNativeToJavaParamSizesBenchmark() 146 benchmark_log << "Average per " << kArraySize in JNI_Benchmark_RunNativeToJavaParamSizesBenchmark() 152 for (int i = 0; i < kArraySize; i++) { in JNI_Benchmark_RunNativeToJavaParamSizesBenchmark() 157 benchmark_log << "Sending " << kArraySize in JNI_Benchmark_RunNativeToJavaParamSizesBenchmark() [all …]
|
/external/cronet/stable/third_party/jni_zero/benchmarks/ |
D | benchmark.cc | 114 const int kArraySize = 10000; in JNI_Benchmark_RunNativeToJavaParamSizesBenchmark() local 117 array.resize(kArraySize); in JNI_Benchmark_RunNativeToJavaParamSizesBenchmark() 118 for (int i = 0; i < kArraySize; i++) { in JNI_Benchmark_RunNativeToJavaParamSizesBenchmark() 127 benchmark_log << "Sending " << kArraySize in JNI_Benchmark_RunNativeToJavaParamSizesBenchmark() 131 benchmark_log << "Average per " << kArraySize in JNI_Benchmark_RunNativeToJavaParamSizesBenchmark() 137 for (int i = 0; i < kArraySize; i++) { in JNI_Benchmark_RunNativeToJavaParamSizesBenchmark() 142 benchmark_log << "Sending " << kArraySize in JNI_Benchmark_RunNativeToJavaParamSizesBenchmark() 146 benchmark_log << "Average per " << kArraySize in JNI_Benchmark_RunNativeToJavaParamSizesBenchmark() 152 for (int i = 0; i < kArraySize; i++) { in JNI_Benchmark_RunNativeToJavaParamSizesBenchmark() 157 benchmark_log << "Sending " << kArraySize in JNI_Benchmark_RunNativeToJavaParamSizesBenchmark() [all …]
|
/external/cronet/tot/base/containers/ |
D | small_map.h | 151 size_t kArraySize = 4, 157 static_assert(kArraySize > 0, "Initial size must be greater than 0"); 158 static_assert(kArraySize != kUsingFullMapSentinel, 385 if (size_ == kArraySize) { 411 if (size_ == kArraySize) { 449 if (size_ == kArraySize) { 561 using ArrayMap = std::array<ArrayElement, kArraySize>; 577 CHECK_EQ(size_, kArraySize); 579 std::array<ArrayElement, kArraySize> temp_array; 582 for (size_t i = 0u; i < kArraySize; ++i) {
|
/external/cronet/stable/base/containers/ |
D | small_map.h | 151 size_t kArraySize = 4, 157 static_assert(kArraySize > 0, "Initial size must be greater than 0"); 158 static_assert(kArraySize != kUsingFullMapSentinel, 385 if (size_ == kArraySize) { 411 if (size_ == kArraySize) { 449 if (size_ == kArraySize) { 561 using ArrayMap = std::array<ArrayElement, kArraySize>; 577 CHECK_EQ(size_, kArraySize); 579 std::array<ArrayElement, kArraySize> temp_array; 582 for (size_t i = 0u; i < kArraySize; ++i) {
|
/external/angle/src/common/ |
D | bitset_utils.h | 652 Iterator end() const { return Iterator(*this, kArraySize); } 656 for (std::size_t index = 1; index < kArraySize; index++) 710 static constexpr std::size_t kArraySize = 718 std::array<BaseBitSet, kArraySize> mBaseBitSetArray; 737 for (; i < kArraySize - 1; ++i) 774 while (mIndex < mCurrentParent->kArraySize) 783 if (mIndex < mCurrentParent->kArraySize) 789 mCurrentIterator = mCurrentParent->mBaseBitSetArray[mCurrentParent->kArraySize - 1].end(); 800 if (mIndex >= mCurrentParent->kArraySize) 830 for (std::size_t index = 0; index < kArraySize; index++) [all …]
|
/external/pigweed/pw_fuzzer/public/pw_fuzzer/ |
D | fuzztest.h | 516 template <size_t kArraySize, 531 std::array<containers::Pair<K, V>, kArraySize> pairs; 562 template <size_t kArraySize, 567 return ArrayOf<kArraySize>(FlatMapPairOf(std::move(keys), std::move(values))); 572 template <typename K, typename V, size_t kArraySize> 573 struct ArbitraryImpl<containers::FlatMap<K, V, kArraySize>> { 575 return FlatMapOf<kArraySize>(Arbitrary<K>(), Arbitrary<V>()); 590 template <typename K, typename V, size_t kArraySize> 591 struct ContainerOfImpl<containers::FlatMap<K, V, kArraySize>> { 599 return ArrayOf<kArraySize>(std::move(inner));
|
/external/pigweed/pw_containers/examples/ |
D | wrapped_iterator.cc | 33 template <size_t kArraySize> 34 int DoubleSum(const std::array<int, kArraySize>& c) { in DoubleSum()
|
/external/skia/tests/ |
D | SerializationTest.cpp | 72 static const uint32_t kArraySize = 64; variable 287 SerializationUtils<T>::Write(writer, data, kArraySize); in TestArraySerialization() 290 REPORTER_ASSERT(reporter, (4 + kArraySize * sizeof(T)) == bytesWritten); in TestArraySerialization() 297 T dataRead[kArraySize]; in TestArraySerialization() 298 bool success = SerializationUtils<T>::Read(buffer, dataRead, kArraySize / 2); in TestArraySerialization() 304 success = SerializationUtils<T>::Read(buffer2, dataRead, kArraySize); in TestArraySerialization() 727 unsigned char data[kArraySize] = { 1, 2, 3 }; in DEF_TEST() 733 SkColor data[kArraySize] = { SK_ColorBLACK, SK_ColorWHITE, SK_ColorRED }; in DEF_TEST() 739 SkColor4f data[kArraySize] = { in DEF_TEST() 750 int32_t data[kArraySize] = { 1, 2, 4, 8 }; in DEF_TEST() [all …]
|
/external/compiler-rt/lib/tsan/tests/unit/ |
D | tsan_mman_test.cc | 146 size_t kArraySize = 4096; in TEST() local 148 volatile size_t kArraySize2 = kMaxSizeT / kArraySize + 10; in TEST() 150 EXPECT_DEATH(p = user_calloc(thr, pc, kArraySize, kArraySize2), in TEST()
|
/external/pigweed/pw_containers/ |
D | inline_var_len_entry_queue_test.cc | 306 constexpr size_t kArraySize = in TEST() local 308 uint32_t queue[kArraySize]; in TEST() 309 pw_InlineVarLenEntryQueue_Init(queue, kArraySize); in TEST() 389 constexpr size_t kArraySize = in TEST() local 391 uint32_t queue_array[kArraySize]{50, 50, 99}; in TEST() 393 pw::InlineVarLenEntryQueue<>::Init(queue_array, kArraySize); in TEST()
|
/external/compiler-rt/lib/asan/tests/ |
D | asan_interface_test.cc | 29 const size_t kArraySize = 100; in TEST() local 30 char *array = Ident((char*)malloc(kArraySize)); in TEST() 36 EXPECT_EQ(kArraySize, __sanitizer_get_allocated_size(array)); in TEST() 46 EXPECT_FALSE(__sanitizer_get_ownership(array + kArraySize / 2)); in TEST() 47 EXPECT_DEATH(__sanitizer_get_allocated_size(array + kArraySize / 2), in TEST()
|
/external/pdfium/fxbarcode/oned/ |
D | BC_OnedCode39Writer.cpp | 154 std::array<uint8_t, kArraySize> widths = {}; in Encode() 156 constexpr int32_t kNarrowStrideNum = kArraySize - kWideStrideNum; in Encode() 170 for (size_t k = 0; k < kArraySize; k++) in Encode()
|
/external/pigweed/pw_bluetooth_sapphire/host/common/public/pw_bluetooth_sapphire/internal/host/common/ |
D | byte_buffer.h | 235 constexpr size_t kArraySize = std::tuple_size_v<MemberAsStdArrayT>; in ReadMember() local 238 if constexpr (kArraySize > 0) { in ReadMember() 245 PW_CHECK(index < kArraySize, in ReadMember() 248 kArraySize); in ReadMember()
|