/external/libcxx/test/std/containers/sequences/list/list.cons/ |
D | input_iterator.pass.cpp | 89 int arr2[] = {1, 101, 42}; in test_emplacable_concept() local 99 std::list<T> v(It(arr2), It(std::end(arr2))); in test_emplacable_concept() 117 std::list<T> v(It(arr2), It(std::end(arr2))); in test_emplacable_concept() 136 int arr2[] = {1, 101, 42}; in test_emplacable_concept_with_alloc() local 147 std::list<T> v(It(arr2), It(std::end(arr2)), a); in test_emplacable_concept_with_alloc() 166 std::list<T> v(It(arr2), It(std::end(arr2)), a); in test_emplacable_concept_with_alloc() 183 int arr2[] = {1, 101, 42}; in test_ctor_under_alloc() local 194 C v(It(arr2), It(std::end(arr2))); in test_ctor_under_alloc() 207 C v(It(arr2), It(std::end(arr2))); in test_ctor_under_alloc() 216 int arr2[] = {1, 101, 42}; in test_ctor_under_alloc_with_alloc() local [all …]
|
/external/deqp/framework/delibs/decpp/ |
D | dePoolArray.cpp | 90 PoolArray<int> arr2(&pool); in intArrayTest() local 91 arr2.resize(1500); in intArrayTest() 92 arr2.reserve(2000); in intArrayTest() 94 arr2[i] = i; in intArrayTest() 96 arr2.pushBack(i); in intArrayTest() 98 DE_TEST_ASSERT(arr2.size() == 5000); in intArrayTest() 101 int val = arr2[i]; in intArrayTest() 170 PoolArray<int, 32> arr2(&pool); in alignedIntArrayTest() local 171 arr2.resize(1500); in alignedIntArrayTest() 172 arr2.reserve(2000); in alignedIntArrayTest() [all …]
|
/external/libcxx/test/std/containers/sequences/vector/vector.cons/ |
D | construct_iter_iter.pass.cpp | 82 int arr2[] = {1, 101, 42}; in emplaceable_concept_tests() local 91 std::vector<T> v(It(arr2), It(std::end(arr2))); in emplaceable_concept_tests() 106 std::vector<T> v(It(arr2), It(std::end(arr2))); in emplaceable_concept_tests() 121 int arr2[] = {1, 101, 42}; in test_ctor_under_alloc() local 132 C v(It(arr2), It(std::end(arr2))); in test_ctor_under_alloc()
|
D | construct_iter_iter_alloc.pass.cpp | 93 int arr2[] = {1, 101, 42}; in emplaceable_concept_tests() local 104 std::vector<T> v(It(arr2), It(std::end(arr2)), a); in emplaceable_concept_tests() 121 std::vector<T> v(It(arr2), It(std::end(arr2)), a); in emplaceable_concept_tests() 134 int arr2[] = {1, 101, 42}; in test_ctor_under_alloc() local 147 C v(It(arr2), It(std::end(arr2)), a); in test_ctor_under_alloc()
|
D | assign_iter_iter.pass.cpp | 31 int arr2[] = {1, 101, 42}; in test_emplaceable_concept() local 42 v.assign(It(arr2), It(std::end(arr2))); in test_emplaceable_concept() 59 v.assign(It(arr2), It(std::end(arr2))); in test_emplaceable_concept()
|
/external/jacoco/org.jacoco.core.test/src/org/jacoco/core/internal/analysis/ |
D | StringPoolTest.java | 56 final String[] arr2 = pool.get(new String[0]); in testGetEmptyArray() local 59 assertSame(arr1, arr2); in testGetEmptyArray() 65 final String[] arr2 = pool.get(new String[] { new String("JaCoCo") }); in testGetArray() local 69 assertSame(arr1[0], arr2[0]); in testGetArray()
|
/external/pdfium/core/fpdfapi/parser/ |
D | cpdf_array_unittest.cpp | 98 std::unique_ptr<CPDF_Array> arr2 = ToArray(arr->Clone()); in TEST() local 99 ASSERT_EQ(arr->GetCount(), arr2->GetCount()); in TEST() 102 EXPECT_NE(arr->GetObjectAt(i), arr2->GetObjectAt(i)); in TEST() 103 EXPECT_EQ(arr->GetIntegerAt(i), arr2->GetIntegerAt(i)); in TEST() 133 std::unique_ptr<CPDF_Array> arr2 = ToArray(arr->CloneDirectObject()); in TEST() local 134 ASSERT_EQ(arr->GetCount(), arr2->GetCount()); in TEST() 138 CPDF_Array* arr2_elem = arr2->GetObjectAt(i)->AsArray(); in TEST() 168 arr2->GetObjectAt(i)->AsArray()->GetIntegerAt(j)); in TEST()
|
/external/libcxx/test/std/containers/sequences/deque/deque.cons/ |
D | iter_iter_alloc.pass.cpp | 62 int arr2[] = {1, 101, 42}; in test_emplacable_concept() local 72 std::deque<T> v(It(arr2), It(std::end(arr2)), a); in test_emplacable_concept() 88 std::deque<T> v(It(arr2), It(std::end(arr2)), a); in test_emplacable_concept()
|
D | iter_iter.pass.cpp | 73 int arr2[] = {1, 101, 42}; in test_emplacable_concept() local 82 std::deque<T> v(It(arr2), It(std::end(arr2))); in test_emplacable_concept() 97 std::deque<T> v(It(arr2), It(std::end(arr2))); in test_emplacable_concept()
|
D | assign_iter_iter.pass.cpp | 113 int arr2[] = {1, 101, 42}; in test_emplacable_concept() local 124 v.assign(It(arr2), It(std::end(arr2))); in test_emplacable_concept() 141 v.assign(It(arr2), It(std::end(arr2))); in test_emplacable_concept()
|
/external/llvm/test/Instrumentation/AddressSanitizer/ |
D | stack_layout.ll | 31 %arr2.ptr = bitcast [20 x i8]* %YYY to i8* 32 store volatile i8 0, i8* %arr2.ptr 52 %arr2.ptr = bitcast [55 x i8]* %BBB to i8* 53 store volatile i8 0, i8* %arr2.ptr 74 %arr2.ptr = bitcast [128 x i8]* %BBB to i8* 75 store volatile i8 0, i8* %arr2.ptr
|
/external/clang/test/CodeGenCXX/ |
D | template-instantiation.cpp | 166 static const int arr2[]; member 175 template <typename T> const int S<T>::arr2[] = { 1, 2, kBar }; // no side effects member in PR10001::S<T> 177 template <typename T> const int S<T>::y = sizeof(arr2) / sizeof(arr2[0]);
|
/external/clang/test/Sema/ |
D | designated-initializers.c | 181 u_short arr2[3]; member 184 const union wibble wobble = { .arr2[0] = 0xffff, 185 .arr2[1] = 0xffff, 186 .arr2[2] = 0xffff }; 188 const union wibble wobble2 = { .arr2 = {4, 5, 6}, 7 }; // expected-warning{{excess elements in unio…
|
/external/tensorflow/tensorflow/compiler/xla/ |
D | array2d_test.cc | 164 Array2D<int> arr2 = {{1, 2}, {3, 4}, {5, 6}, {7, 8}}; in TEST() local 165 EXPECT_TRUE(arr0 != arr2); in TEST() 166 EXPECT_FALSE(arr0 == arr2); in TEST() 167 EXPECT_TRUE(arr2 != arr0); in TEST() 168 EXPECT_FALSE(arr2 == arr0); in TEST()
|
/external/clang/test/CXX/dcl.decl/dcl.meaning/dcl.array/ |
D | p3.cpp | 95 extern T arr2; in f() 96 extern int arr2[]; in f() 98 static_assert(sizeof(arr2) == 12, ""); in f() 101 static_assert(sizeof(arr2) == 13, ""); // expected-error {{failed}} in f()
|
/external/llvm/test/CodeGen/Thumb/ |
D | stack-access.ll | 23 %arr2 = alloca [1024 x i8], align 1 30 store [1024 x i8]* %arr2, [1024 x i8]** %p, align 4 95 %arr2 = alloca [224 x i32], align 4 109 %arr2idx1 = getelementptr inbounds [224 x i32], [224 x i32]* %arr2, i32 0, i32 0 112 ; %arr2 is in range, but this element of it is not 114 %arr2idx2 = getelementptr inbounds [224 x i32], [224 x i32]* %arr2, i32 0, i32 32
|
/external/eigen/test/ |
D | evaluators.cpp | 250 ArrayXXd arr1(6,6), arr2(6,6); in test_evaluators() local 252 VERIFY_IS_APPROX_EVALUATOR(arr2, arr1); in test_evaluators() 257 arr2.resize(9,9); in test_evaluators() 258 VERIFY_IS_APPROX_EVALUATOR(arr2, arr1); in test_evaluators() 356 VERIFY_IS_APPROX_EVALUATOR(arr2, mat1.array()); in test_evaluators() 358 VERIFY_IS_APPROX_EVALUATOR(arr2, mat1.array() + 2); in test_evaluators() 361 arr2.matrix() = MatrixXd::Identity(6,6); in test_evaluators() 362 VERIFY_IS_APPROX(arr2, MatrixXd::Identity(6,6).array()); in test_evaluators() 365 VERIFY_IS_APPROX_EVALUATOR(arr2, arr1.reverse()); in test_evaluators() 366 VERIFY_IS_APPROX_EVALUATOR(arr2, arr1.colwise().reverse()); in test_evaluators() [all …]
|
/external/llvm/test/CodeGen/ARM/ |
D | memfunc.ll | 139 %arr2 = alloca [9 x i8], align 1 140 %2 = bitcast [9 x i8]* %arr2 to i8* 178 %arr2 = alloca [7 x i8], align 1 179 %2 = bitcast [7 x i8]* %arr2 to i8* 217 %arr2 = alloca [9 x i8], align 1 218 %2 = getelementptr inbounds [9 x i8], [9 x i8]* %arr2, i32 0, i32 4 256 %arr2 = alloca [13 x i8], align 1 257 %2 = getelementptr inbounds [13 x i8], [13 x i8]* %arr2, i32 0, i32 1 295 %arr2 = alloca [13 x i8], align 1 296 %2 = getelementptr inbounds [13 x i8], [13 x i8]* %arr2, i32 0, i32 %i [all …]
|
/external/valgrind/memcheck/tests/ |
D | origin6-fp.c | 85 double r, **arr, **arr2, **arr3; in main() local 88 arr2 = do3x3smooth( arr, nArr ); in main() 89 arr3 = do3x3smooth( arr2, nArr-2 ); in main()
|
/external/llvm/test/CodeGen/X86/ |
D | lea-opt.ll | 8 @arr2 = external global [65 x %struct.anon2], align 16 103 …%a = getelementptr inbounds [65 x %struct.anon2], [65 x %struct.anon2]* @arr2, i64 0, i64 %x, i32 2 105 …%b = getelementptr inbounds [65 x %struct.anon2], [65 x %struct.anon2]* @arr2, i64 0, i64 %x, i32 0 129 ; CHECK: leaq arr2+132([[REG1]]), [[REG2:%[a-z]+]] 130 ; CHECK: leaq arr2([[REG1]]), [[REG3:%[a-z]+]] 137 ; DISABLED: movl arr2+132([[REG1]]), {{.*}} 138 ; DISABLED: addl arr2([[REG1]]), {{.*}}
|
/external/mesa3d/src/gallium/drivers/freedreno/ir3/ |
D | ir3_ra.c | 1073 list_for_each_entry (struct ir3_array, arr2, &ctx->ir->array_list, node) { in ra_alloc() 1074 if (arr2 == arr) in ra_alloc() 1076 if (arr2->end_ip == 0) in ra_alloc() 1080 arr2->start_ip, arr2->end_ip) && in ra_alloc() 1082 arr2->reg, arr2->reg + arr2->length)) { in ra_alloc() 1083 base = MAX2(base, arr2->reg + arr2->length); in ra_alloc()
|
/external/llvm/unittests/ADT/ |
D | HashingTest.cpp | 150 const int arr2[] = { 3, 2, 1 }; in TEST() local 151 hash_code arr2_hash = hash_combine_range(begin(arr2), end(arr2)); in TEST() 352 const size_t arr2[] = { s1, s2, s3 }; in TEST() local 353 EXPECT_EQ(hash_combine_range(begin(arr2), end(arr2)), in TEST()
|
/external/perf_data_converter/src/quipper/ |
D | test_utils.h | 48 ArrayInputStream arr2(file2_contents.data(), file2_contents.size()); in CompareTextProtoFiles() 52 ASSERT_TRUE(TextFormat::Parse(&arr2, &proto2)); in CompareTextProtoFiles()
|
/external/zlib/src/contrib/dotzlib/DotZLib/ |
D | UnitTests.cs | 72 byte[] arr2 = (byte[])arr.Clone(); in BlockPutGet() 73 Assert.AreEqual( 9, buf.Get(arr2,1,9) ); in BlockPutGet() 74 Assert.IsTrue( Utils.byteArrEqual(arr,arr2) ); in BlockPutGet()
|
/external/clang/test/CXX/temp/temp.decls/temp.variadic/ |
D | sizeofpack.cpp | 23 array<3> arr2 = make_array1<int>(1,array<5>(),0.1); in qq2() local 45 array<2> arr2 = AAA<int, int>::make_array<int>(1,2); in qq4() local
|