| /external/chromium_org/third_party/angle/src/libGLESv2/renderer/d3d/d3d11/shaders/compiled/ |
| clearuint11ps.h | 30 dcl_input_ps constant v1.xyzw
39 mov o0.xyzw, v1.xyzw
40 mov o1.xyzw, v1.xyzw
41 mov o2.xyzw, v1.xyzw
42 mov o3.xyzw, v1.xyzw
43 mov o4.xyzw, v1.xyzw
44 mov o5.xyzw, v1.xyzw
45 mov o6.xyzw, v1.xyzw
46 mov o7.xyzw, v1.xyzw
|
| /external/eigen/test/ |
| sparse_vector.cpp | 23 SparseVectorType v1(rows), v2(rows), v3(rows);
30 initSparse<Scalar>(densityVec, refV1, v1, &zerocoords, &nonzerocoords);
41 VERIFY_IS_MUCH_SMALLER_THAN( v1.coeff(zerocoords[i]), eps );
42 //VERIFY_RAISES_ASSERT( v1.coeffRef(zerocoords[i]) = 5 );
45 VERIFY(int(nonzerocoords.size()) == v1.nonZeros());
47 for (typename SparseVectorType::InnerIterator it(v1); it; ++it,++j)
50 VERIFY(it.value()==v1.coeff(it.index()));
54 VERIFY_IS_APPROX(v1, refV1);
56 v1.coeffRef(nonzerocoords[0]) = Scalar(5);
58 VERIFY_IS_APPROX(v1, refV1)
[all...] |
| /external/llvm/test/MC/AArch64/ |
| neon-mla-mls-instructions.s | 8 mla v0.8b, v1.8b, v2.8b
9 mla v0.16b, v1.16b, v2.16b
10 mla v0.4h, v1.4h, v2.4h
11 mla v0.8h, v1.8h, v2.8h
12 mla v0.2s, v1.2s, v2.2s
13 mla v0.4s, v1.4s, v2.4s
15 // CHECK: mla v0.8b, v1.8b, v2.8b // encoding: [0x20,0x94,0x22,0x0e]
16 // CHECK: mla v0.16b, v1.16b, v2.16b // encoding: [0x20,0x94,0x22,0x4e]
17 // CHECK: mla v0.4h, v1.4h, v2.4h // encoding: [0x20,0x94,0x62,0x0e]
18 // CHECK: mla v0.8h, v1.8h, v2.8h // encoding: [0x20,0x94,0x62,0x4e
[all...] |
| neon-saturating-add-sub.s | 9 sqadd v0.8b, v1.8b, v2.8b
10 sqadd v0.16b, v1.16b, v2.16b
11 sqadd v0.4h, v1.4h, v2.4h
12 sqadd v0.8h, v1.8h, v2.8h
13 sqadd v0.2s, v1.2s, v2.2s
14 sqadd v0.4s, v1.4s, v2.4s
15 sqadd v0.2d, v1.2d, v2.2d
17 // CHECK: sqadd v0.8b, v1.8b, v2.8b // encoding: [0x20,0x0c,0x22,0x0e]
18 // CHECK: sqadd v0.16b, v1.16b, v2.16b // encoding: [0x20,0x0c,0x22,0x4e]
19 // CHECK: sqadd v0.4h, v1.4h, v2.4h // encoding: [0x20,0x0c,0x62,0x0e
[all...] |
| neon-rounding-halving-add.s | 9 srhadd v0.8b, v1.8b, v2.8b
10 srhadd v0.16b, v1.16b, v2.16b
11 srhadd v0.4h, v1.4h, v2.4h
12 srhadd v0.8h, v1.8h, v2.8h
13 srhadd v0.2s, v1.2s, v2.2s
14 srhadd v0.4s, v1.4s, v2.4s
16 // CHECK: srhadd v0.8b, v1.8b, v2.8b // encoding: [0x20,0x14,0x22,0x0e]
17 // CHECK: srhadd v0.16b, v1.16b, v2.16b // encoding: [0x20,0x14,0x22,0x4e]
18 // CHECK: srhadd v0.4h, v1.4h, v2.4h // encoding: [0x20,0x14,0x62,0x0e]
19 // CHECK: srhadd v0.8h, v1.8h, v2.8h // encoding: [0x20,0x14,0x62,0x4e
[all...] |
| /external/stlport/test/unit/ |
| innerprod_test.cpp | 52 vector<size_t> v1(3);
53 vector<size_t> v2(v1.size());
54 for (size_t i = 0; i < v1.size(); ++i) {
55 v1[i] = i + 1;
56 v2[i] = v1.size() - i;
58 size_t result = inner_product(v1.begin(), v1.end(), v2.begin(), (size_t)0);
63 vector<size_t> v1(3);
64 vector<size_t> v2(v1.size());
65 for(size_t i = 0; i < v1.size(); ++i)
[all...] |
| partial_test.cpp | 82 vector <int> v1(numbers, numbers+10);
83 partial_sort(v1.begin(), v1.begin() + v1.size() / 2, v1.end());
85 CPPUNIT_ASSERT(v1[0]==2);
86 CPPUNIT_ASSERT(v1[1]==3);
87 CPPUNIT_ASSERT(v1[2]==3);
88 CPPUNIT_ASSERT(v1[3]==4);
89 CPPUNIT_ASSERT(v1[4]==5)
[all...] |
| /ndk/tests/device/test-gnustl-full/unit/ |
| innerprod_test.cpp | 52 vector<size_t> v1(3);
53 vector<size_t> v2(v1.size());
54 for (size_t i = 0; i < v1.size(); ++i) {
55 v1[i] = i + 1;
56 v2[i] = v1.size() - i;
58 size_t result = inner_product(v1.begin(), v1.end(), v2.begin(), (size_t)0);
63 vector<size_t> v1(3);
64 vector<size_t> v2(v1.size());
65 for(size_t i = 0; i < v1.size(); ++i)
[all...] |
| partial_test.cpp | 82 vector <int> v1(numbers, numbers+10);
83 partial_sort(v1.begin(), v1.begin() + v1.size() / 2, v1.end());
85 CPPUNIT_ASSERT(v1[0]==2);
86 CPPUNIT_ASSERT(v1[1]==3);
87 CPPUNIT_ASSERT(v1[2]==3);
88 CPPUNIT_ASSERT(v1[3]==4);
89 CPPUNIT_ASSERT(v1[4]==5)
[all...] |
| /ndk/tests/device/test-stlport/unit/ |
| innerprod_test.cpp | 52 vector<size_t> v1(3);
53 vector<size_t> v2(v1.size());
54 for (size_t i = 0; i < v1.size(); ++i) {
55 v1[i] = i + 1;
56 v2[i] = v1.size() - i;
58 size_t result = inner_product(v1.begin(), v1.end(), v2.begin(), (size_t)0);
63 vector<size_t> v1(3);
64 vector<size_t> v2(v1.size());
65 for(size_t i = 0; i < v1.size(); ++i)
[all...] |
| partial_test.cpp | 82 vector <int> v1(numbers, numbers+10);
83 partial_sort(v1.begin(), v1.begin() + v1.size() / 2, v1.end());
85 CPPUNIT_ASSERT(v1[0]==2);
86 CPPUNIT_ASSERT(v1[1]==3);
87 CPPUNIT_ASSERT(v1[2]==3);
88 CPPUNIT_ASSERT(v1[3]==4);
89 CPPUNIT_ASSERT(v1[4]==5)
[all...] |
| /external/libcxx/test/numerics/numarray/template.valarray/valarray.cassign/ |
| and_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N);
30 v1 &= v2;
31 assert(v1.size() == v2.size());
32 assert(v1.size() == v3.size());
33 for (int i = 0; i < v1.size(); ++i)
34 assert(v1[i] == v3[i]);
|
| or_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N);
30 v1 |= v2;
31 assert(v1.size() == v2.size());
32 assert(v1.size() == v3.size());
33 for (int i = 0; i < v1.size(); ++i)
34 assert(v1[i] == v3[i]);
|
| plus_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N);
30 v1 += v2;
31 assert(v1.size() == v2.size());
32 assert(v1.size() == v3.size());
33 for (int i = 0; i < v1.size(); ++i)
34 assert(v1[i] == v3[i]);
|
| shift_left_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N);
30 v1 <<= v2;
31 assert(v1.size() == v2.size());
32 assert(v1.size() == v3.size());
33 for (int i = 0; i < v1.size(); ++i)
34 assert(v1[i] == v3[i]);
|
| times_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N);
30 v1 *= v2;
31 assert(v1.size() == v2.size());
32 assert(v1.size() == v3.size());
33 for (int i = 0; i < v1.size(); ++i)
34 assert(v1[i] == v3[i]);
|
| xor_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N);
30 v1 ^= v2;
31 assert(v1.size() == v2.size());
32 assert(v1.size() == v3.size());
33 for (int i = 0; i < v1.size(); ++i)
34 assert(v1[i] == v3[i]);
|
| /external/libcxx/test/numerics/numarray/template.valarray/valarray.members/ |
| size.pass.cpp | 25 std::valarray<T> v1(a1, N1);
26 assert(v1.size() == N1);
32 std::valarray<T> v1(a1, N1);
33 assert(v1.size() == N1);
38 std::valarray<T> v1; local
39 assert(v1.size() == N1);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.valarray/valarray.cassign/ |
| and_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N);
30 v1 &= v2;
31 assert(v1.size() == v2.size());
32 assert(v1.size() == v3.size());
33 for (int i = 0; i < v1.size(); ++i)
34 assert(v1[i] == v3[i]);
|
| or_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N);
30 v1 |= v2;
31 assert(v1.size() == v2.size());
32 assert(v1.size() == v3.size());
33 for (int i = 0; i < v1.size(); ++i)
34 assert(v1[i] == v3[i]);
|
| plus_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N);
30 v1 += v2;
31 assert(v1.size() == v2.size());
32 assert(v1.size() == v3.size());
33 for (int i = 0; i < v1.size(); ++i)
34 assert(v1[i] == v3[i]);
|
| shift_left_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N);
30 v1 <<= v2;
31 assert(v1.size() == v2.size());
32 assert(v1.size() == v3.size());
33 for (int i = 0; i < v1.size(); ++i)
34 assert(v1[i] == v3[i]);
|
| times_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N);
30 v1 *= v2;
31 assert(v1.size() == v2.size());
32 assert(v1.size() == v3.size());
33 for (int i = 0; i < v1.size(); ++i)
34 assert(v1[i] == v3[i]);
|
| xor_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N);
30 v1 ^= v2;
31 assert(v1.size() == v2.size());
32 assert(v1.size() == v3.size());
33 for (int i = 0; i < v1.size(); ++i)
34 assert(v1[i] == v3[i]);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.valarray/valarray.members/ |
| size.pass.cpp | 25 std::valarray<T> v1(a1, N1);
26 assert(v1.size() == N1);
32 std::valarray<T> v1(a1, N1);
33 assert(v1.size() == N1);
38 std::valarray<T> v1; local
39 assert(v1.size() == N1);
|
