| /external/libcxx/test/numerics/numarray/template.valarray/valarray.cassign/ |
| H A D | shift_right_value.pass.cpp | 26 std::valarray<T> v1(a1, N);
29 assert(v1.size() == v2.size());
30 for (int i = 0; i < v1.size(); ++i)
31 assert(v1[i] == v2[i]);
|
| H A D | divide_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N);
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]);
|
| H A D | minus_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N);
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]);
|
| H A D | modulo_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N);
30 v2 %= v1;
31 assert(v1.size() == v2.size());
32 assert(v1.size() == v3.size());
33 for (int i = 0; i < v1.size(); ++i)
|
| H A D | shift_right_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N);
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/valarray.nonmembers/valarray.comparison/ |
| H A D | equal_valarray_value.pass.cpp | 28 std::valarray<T> v1(a1, N);
29 std::valarray<bool> v3 = v1 == 2;
30 assert(v1.size() == v3.size());
31 for (int i = 0; i < v1.size(); ++i)
|
| H A D | greater_equal_valarray_value.pass.cpp | 28 std::valarray<T> v1(a1, N);
29 std::valarray<bool> v3 = v1 >= 2;
30 assert(v1.size() == v3.size());
31 for (int i = 0; i < v1.size(); ++i)
|
| H A D | greater_valarray_value.pass.cpp | 28 std::valarray<T> v1(a1, N);
29 std::valarray<bool> v3 = v1 > 2;
30 assert(v1.size() == v3.size());
31 for (int i = 0; i < v1.size(); ++i)
|
| H A D | less_equal_valarray_value.pass.cpp | 28 std::valarray<T> v1(a1, N);
29 std::valarray<bool> v3 = v1 <= 2;
30 assert(v1.size() == v3.size());
31 for (int i = 0; i < v1.size(); ++i)
|
| H A D | less_valarray_value.pass.cpp | 28 std::valarray<T> v1(a1, N);
29 std::valarray<bool> v3 = v1 < 2;
30 assert(v1.size() == v3.size());
31 for (int i = 0; i < v1.size(); ++i)
|
| H A D | not_equal_valarray_value.pass.cpp | 28 std::valarray<T> v1(a1, N);
29 std::valarray<bool> v3 = v1 != 2;
30 assert(v1.size() == v3.size());
31 for (int i = 0; i < v1.size(); ++i)
|
| /external/llvm/test/MC/AArch64/ |
| H A D | arm64-v128_lo-diagnostics.s | 4 sqrdmulh v0.8h, v1.8h, v16.h[0]
10 sqdmull2 v0.4h, v1.8h, v16.h[0]
|
| H A D | neon-crypto.s | 10 aese v0.16b, v1.16b
11 aesd v0.16b, v1.16b
12 aesmc v0.16b, v1.16b
13 aesimc v0.16b, v1.16b
17 // CHECK: aese v0.16b, v1.16b // encoding: [0x20,0x48,0x28,0x4e]
18 // CHECK: aesd v0.16b, v1.16b // encoding: [0x20,0x58,0x28,0x4e]
19 // CHECK: aesmc v0.16b, v1.16b // encoding: [0x20,0x68,0x28,0x4e]
20 // CHECK: aesimc v0.16b, v1.16b // encoding: [0x20,0x78,0x28,0x4e]
23 sha1su1 v0.4s, v1.4s
24 sha256su0 v0.4s, v1
[all...] |
| H A D | neon-halving-add-sub.s | 9 shadd v0.8b, v1.8b, v2.8b
10 shadd v0.16b, v1.16b, v2.16b
11 shadd v0.4h, v1.4h, v2.4h
12 shadd v0.8h, v1.8h, v2.8h
13 shadd v0.2s, v1.2s, v2.2s
14 shadd v0.4s, v1.4s, v2.4s
16 // CHECK: shadd v0.8b, v1.8b, v2.8b // encoding: [0x20,0x04,0x22,0x0e]
17 // CHECK: shadd v0.16b, v1.16b, v2.16b // encoding: [0x20,0x04,0x22,0x4e]
18 // CHECK: shadd v0.4h, v1.4h, v2.4h // encoding: [0x20,0x04,0x62,0x0e]
19 // CHECK: shadd v0.8h, v1
[all...] |
| H A D | neon-scalar-by-elem-mla.s | 6 fmla s0, s1, v1.s[0]
7 fmla s30, s11, v1.s[1]
10 fmla d0, d1, v1.d[0]
11 fmla d30, d11, v1.d[1]
13 // CHECK: fmla s0, s1, v1.s[0] // encoding: [0x20,0x10,0x81,0x5f]
14 // CHECK: fmla s30, s11, v1.s[1] // encoding: [0x7e,0x11,0xa1,0x5f]
17 // CHECK: fmla d0, d1, v1.d[0] // encoding: [0x20,0x10,0xc1,0x5f]
18 // CHECK: fmla d30, d11, v1.d[1] // encoding: [0x7e,0x19,0xc1,0x5f]
28 fmls d0, d1, v1.d[0]
29 fmls d30, d11, v1
[all...] |
| /external/stlport/test/unit/ |
| H A D | includes_test.cpp | 48 vector<int> v1(10);
51 for (i = 0; (size_t)i < v1.size(); ++i) {
52 v1[i] = i;
55 bool r1=includes(v1.begin(), v1.end(), v2.begin(), v2.end());
61 bool r2=includes(v1.begin(), v1.end(), v2.begin(), v2.end());
69 vector <char const*> v1(nameSize);
70 for (int i = 0; (size_t)i < v1.size(); ++i) {
71 v1[
[all...] |
| H A D | rm_cp_test.cpp | 84 vector <int> v1(10);
85 for (int i = 0; (size_t)i < v1.size(); ++i)
86 v1[i] = i % 5;
88 replace_if(v1.begin(), v1.end(), odd, 42);
91 CPPUNIT_ASSERT(v1[0]==0);
92 CPPUNIT_ASSERT(v1[1]==42);
93 CPPUNIT_ASSERT(v1[2]==2);
94 CPPUNIT_ASSERT(v1[3]==42);
95 CPPUNIT_ASSERT(v1[
[all...] |
| /external/chromium_org/v8/test/mjsunit/compiler/ |
| H A D | regress-gap.js | 30 function small_select(n, v1, v2) {
32 var tmp = v1;
33 v1 = v2;
36 return v1;
39 function select(n, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10) {
41 var tmp = v1;
42 v1 = v2;
53 return v1;
56 function select_while(n, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10) {
59 var tmp = v1;
[all...] |
| /external/libcxx/test/numerics/numarray/valarray.nonmembers/valarray.binary/ |
| H A D | and_valarray_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N);
29 std::valarray<T> v3 = v1 & v2;
30 assert(v1.size() == v2.size());
31 assert(v1.size() == v3.size());
32 for (int i = 0; i < v1.size(); ++i)
|
| H A D | divide_valarray_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N);
29 std::valarray<T> v3 = v1 / v2;
30 assert(v1.size() == v2.size());
31 assert(v1.size() == v3.size());
32 for (int i = 0; i < v1.size(); ++i)
|
| H A D | minus_valarray_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N);
29 std::valarray<T> v3 = v1 - v2;
30 assert(v1.size() == v2.size());
31 assert(v1.size() == v3.size());
32 for (int i = 0; i < v1.size(); ++i)
|
| H A D | modulo_valarray_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N);
29 std::valarray<T> v3 = v1 % v2;
30 assert(v1.size() == v2.size());
31 assert(v1.size() == v3.size());
32 for (int i = 0; i < v1.size(); ++i)
|
| H A D | or_valarray_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N);
29 std::valarray<T> v3 = v1 | v2;
30 assert(v1.size() == v2.size());
31 assert(v1.size() == v3.size());
32 for (int i = 0; i < v1.size(); ++i)
|
| H A D | plus_valarray_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N);
29 std::valarray<T> v3 = v1 + v2;
30 assert(v1.size() == v2.size());
31 assert(v1.size() == v3.size());
32 for (int i = 0; i < v1.size(); ++i)
|
| H A D | shift_left_valarray_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N);
29 std::valarray<T> v3 = v1 << v2;
30 assert(v1.size() == v2.size());
31 assert(v1.size() == v3.size());
32 for (int i = 0; i < v1.size(); ++i)
|