Home
last modified time | relevance | path

Searched refs:arr2 (Results 1 – 25 of 50) sorted by relevance

12

/external/deqp/framework/delibs/decpp/
DdePoolArray.cpp90 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/jacoco/org.jacoco.core.test/src/org/jacoco/core/internal/analysis/
DStringPoolTest.java56 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/
Dcpdf_array_unittest.cpp91 std::unique_ptr<CPDF_Array> arr2 = ToArray(arr->Clone()); in TEST() local
92 EXPECT_EQ(arr->GetCount(), arr2->GetCount()); in TEST()
95 EXPECT_NE(arr->GetObjectAt(i), arr2->GetObjectAt(i)); in TEST()
96 EXPECT_EQ(arr->GetIntegerAt(i), arr2->GetIntegerAt(i)); in TEST()
127 std::unique_ptr<CPDF_Array> arr2 = ToArray(arr->CloneDirectObject()); in TEST() local
128 EXPECT_EQ(arr->GetCount(), arr2->GetCount()); in TEST()
132 CPDF_Array* arr2_elem = arr2->GetObjectAt(i)->AsArray(); in TEST()
162 arr2->GetObjectAt(i)->AsArray()->GetIntegerAt(j)); in TEST()
/external/llvm/test/Instrumentation/AddressSanitizer/
Dstack_layout.ll31 %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/
Dtemplate-instantiation.cpp166 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]);
Dglobal-array-destruction.cpp20 S arr2[2]; variable
/external/clang/test/CXX/dcl.decl/dcl.meaning/dcl.array/
Dp3.cpp95 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/clang/test/Sema/
Ddesignated-initializers.c181 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…
Dvector-init.c43 …short4 arr2[2] = { test3_helper(), test3_helper() }; // expected-error 2 {{initializing 'short4' (… in test3() local
/external/llvm/test/CodeGen/Thumb/
Dstack-access.ll23 %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/
Devaluators.cpp250 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/valgrind/memcheck/tests/
Dorigin6-fp.c85 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/ARM/
Dmemfunc.ll139 %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/llvm/test/CodeGen/X86/
Dlea-opt.ll8 @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/
Dir3_ra.c1073 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/
DHashingTest.cpp150 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/zlib/src/contrib/dotzlib/DotZLib/
DUnitTests.cs72 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/
Dsizeofpack.cpp23 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
/external/valgrind/VEX/priv/
Dhost_generic_regs.c300 HInstr** arr2 = LibVEX_Alloc_inline(ha->arr_size * 2 * sizeof(HInstr*)); in addHInstr_SLOW() local
302 arr2[i] = ha->arr[i]; in addHInstr_SLOW()
305 ha->arr = arr2; in addHInstr_SLOW()
/external/Microsoft-GSL/tests/
Dstrided_span_tests.cpp211 int arr2[6] = { 1, 2, 3, 4, 5, 6 }; in SUITE() local
212 const strided_span<const int, 2> src2{ arr2, {{ 3, 2 }, { 2, 1 }} }; in SUITE()
222 int arr2[6] = { 3, 4, 5, 6, 7, 8 }; in SUITE() local
225 strided_span<const int, 1> sav{ arr2, {{3}, {2}} }; in SUITE()
245 const int arr2[6] = { 1, 2, 3, 4, 5, 6 }; in SUITE() local
247 const strided_span<const int, 2> src2{ arr2, {{ 3, 2 },{ 2, 1 }} }; in SUITE()
Dspan_tests.cpp1147 int arr2[] = {1, 2}; in SUITE() local
1149 span<int> s2 = arr2; in SUITE()
1187 int arr2[] = {2, 1}; // bigger in SUITE() local
1190 span<int> s2 = arr2; in SUITE()
1326 int arr2[2] = {1, 2}; in SUITE() local
1330 span<int, 4> s3 = arr2; in SUITE()
1333 span<int, 2> s2 = arr2; in SUITE()
1339 span<int, 4> s4 = {arr2, 2}; in SUITE()
1346 span<int> av = arr2; in SUITE()
Dmulti_span_tests.cpp1000 int arr2[] = {1, 2}; in SUITE() local
1002 multi_span<int> s2 = arr2; in SUITE()
1040 int arr2[] = {2, 1}; // bigger in SUITE() local
1043 multi_span<int> s2 = arr2; in SUITE()
1602 int arr2[2] = {1, 2}; in SUITE() local
1606 multi_span<int, 4> av4 = arr2; in SUITE()
1609 multi_span<int, 2> av2 = arr2; in SUITE()
1615 multi_span<int, 4> av9 = {arr2, 2}; in SUITE()
1622 multi_span<int, dynamic_range> av = arr2; in SUITE()
/external/clang/test/SemaCXX/
Di-c-e-cxx.cpp68 int arr2[castfloat]; // ok variable
/external/vboot_reference/tests/
Dvboot_common_tests.c51 uint32_t arr2[7]; in ArraySizeTest() local
55 TEST_EQ(ARRAY_SIZE(arr2), 7, "ARRAYSIZE(uint32_t)"); in ArraySizeTest()
/external/protobuf/js/
Dmessage.js1081 var arr2 = m2.toArray();
1084 var length = arr1.length > arr2.length ? arr1.length : arr2.length;
1090 if (!jspb.Message.compareFields(arr1[i], arr2[i])) {
1091 res[i] = arr2[i];

12