| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/ |
| not_equal_valarray_value.pass.cpp | 29 std::valarray<T> v1(a1, N);
30 std::valarray<bool> v3 = v1 != 2;
31 assert(v1.size() == v3.size());
32 for (std::size_t i = 0; i < v1.size(); ++i)
|
| /toolchain/binutils/binutils-2.27/ld/testsuite/ld-mips-elf/ |
| tlsdyn-o32-1.d | 32 .*: 3c030000 lui v1,0x0
33 .*: 24638000 addiu v1,v1,-32768
34 .*: 00621821 addu v1,v1,v0
36 .*: 8f838024 lw v1,-32732\(gp\)
38 .*: 00621821 addu v1,v1,v0
39 .*: 8f838030 lw v1,-32720\(gp\)
41 .*: 00621821 addu v1,v1,v
[all...] |
| tlsdyn-o32-2.d | 32 .*: 3c030000 lui v1,0x0
33 .*: 24638000 addiu v1,v1,-32768
34 .*: 00621821 addu v1,v1,v0
36 .*: 8f838024 lw v1,-32732\(gp\)
38 .*: 00621821 addu v1,v1,v0
39 .*: 8f838030 lw v1,-32720\(gp\)
41 .*: 00621821 addu v1,v1,v
[all...] |
| tlsdyn-o32-3.d | 32 .*: 3c030000 lui v1,0x0
33 .*: 24638000 addiu v1,v1,-32768
34 .*: 00621821 addu v1,v1,v0
36 .*: 8f838024 lw v1,-32732\(gp\)
38 .*: 00621821 addu v1,v1,v0
39 .*: 8f838030 lw v1,-32720\(gp\)
41 .*: 00621821 addu v1,v1,v
[all...] |
| /external/capstone/suite/MC/AArch64/ |
| neon-halving-add-sub.s.cs | 2 0x20,0x04,0x22,0x0e = shadd v0.8b, v1.8b, v2.8b
3 0x20,0x04,0x22,0x4e = shadd v0.16b, v1.16b, v2.16b
4 0x20,0x04,0x62,0x0e = shadd v0.4h, v1.4h, v2.4h
5 0x20,0x04,0x62,0x4e = shadd v0.8h, v1.8h, v2.8h
6 0x20,0x04,0xa2,0x0e = shadd v0.2s, v1.2s, v2.2s
7 0x20,0x04,0xa2,0x4e = shadd v0.4s, v1.4s, v2.4s
8 0x20,0x04,0x22,0x2e = uhadd v0.8b, v1.8b, v2.8b
9 0x20,0x04,0x22,0x6e = uhadd v0.16b, v1.16b, v2.16b
10 0x20,0x04,0x62,0x2e = uhadd v0.4h, v1.4h, v2.4h
11 0x20,0x04,0x62,0x6e = uhadd v0.8h, v1.8h, v2.8
[all...] |
| neon-perm.s.cs | 2 0x20,0x18,0x02,0x0e = uzp1 v0.8b, v1.8b, v2.8b
3 0x20,0x18,0x02,0x4e = uzp1 v0.16b, v1.16b, v2.16b
4 0x20,0x18,0x42,0x0e = uzp1 v0.4h, v1.4h, v2.4h
5 0x20,0x18,0x42,0x4e = uzp1 v0.8h, v1.8h, v2.8h
6 0x20,0x18,0x82,0x0e = uzp1 v0.2s, v1.2s, v2.2s
7 0x20,0x18,0x82,0x4e = uzp1 v0.4s, v1.4s, v2.4s
8 0x20,0x18,0xc2,0x4e = uzp1 v0.2d, v1.2d, v2.2d
9 0x20,0x28,0x02,0x0e = trn1 v0.8b, v1.8b, v2.8b
10 0x20,0x28,0x02,0x4e = trn1 v0.16b, v1.16b, v2.16b
11 0x20,0x28,0x42,0x0e = trn1 v0.4h, v1.4h, v2.4
[all...] |
| /external/llvm/test/MC/AArch64/ |
| neon-add-sub-instructions.s | 9 add v0.8b, v1.8b, v2.8b
10 add v0.16b, v1.16b, v2.16b
11 add v0.4h, v1.4h, v2.4h
12 add v0.8h, v1.8h, v2.8h
13 add v0.2s, v1.2s, v2.2s
14 add v0.4s, v1.4s, v2.4s
15 add v0.2d, v1.2d, v2.2d
17 // CHECK: add v0.8b, v1.8b, v2.8b // encoding: [0x20,0x84,0x22,0x0e]
18 // CHECK: add v0.16b, v1.16b, v2.16b // encoding: [0x20,0x84,0x22,0x4e]
19 // CHECK: add v0.4h, v1.4h, v2.4h // encoding: [0x20,0x84,0x62,0x0e
[all...] |
| 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.8h, v2.8h // encoding: [0x20,0x04,0x62,0x4e
[all...] |
| neon-max-min.s | 8 smax v0.8b, v1.8b, v2.8b
9 smax v0.16b, v1.16b, v2.16b
10 smax v0.4h, v1.4h, v2.4h
11 smax v0.8h, v1.8h, v2.8h
12 smax v0.2s, v1.2s, v2.2s
13 smax v0.4s, v1.4s, v2.4s
15 // CHECK: smax v0.8b, v1.8b, v2.8b // encoding: [0x20,0x64,0x22,0x0e]
16 // CHECK: smax v0.16b, v1.16b, v2.16b // encoding: [0x20,0x64,0x22,0x4e]
17 // CHECK: smax v0.4h, v1.4h, v2.4h // encoding: [0x20,0x64,0x62,0x0e]
18 // CHECK: smax v0.8h, v1.8h, v2.8h // encoding: [0x20,0x64,0x62,0x4e
[all...] |
| /frameworks/base/core/java/android/content/pm/ |
| XmlSerializerAndParser.java | 19 import org.xmlpull.v1.XmlSerializer;
20 import org.xmlpull.v1.XmlPullParser;
21 import org.xmlpull.v1.XmlPullParserException;
|
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/mips/ |
| 24k-branch-delay-1.d | 9 0: 24620005 addiu v0,v1,5
11 8: ac430000 sw v1,0\(v0\)
12 c: ac430008 sw v1,8\(v0\)
14 14: ac430010 sw v1,16\(v0\)
15 18: 10600002 beqz v1,24 <.*>
17 20: 8c430008 lw v1,8\(v0\)
|
| mipsr6@24k-branch-delay-1.d | 10 0: 24620005 addiu v0,v1,5
12 8: ac430000 sw v1,0\(v0\)
13 c: ac430008 sw v1,8\(v0\)
15 14: ac430010 sw v1,16\(v0\)
16 18: 1060ffff beqz v1,18 <.*>
19 20: 8c430008 lw v1,8\(v0\)
|
| /toolchain/binutils/binutils-2.27/ld/testsuite/ld-aarch64/ |
| tls-tiny-ie.s | 1 .global v1
3 v1: label
10 ldr x0, #:gottprel:v1
|
| /external/pdfium/third_party/agg23/ |
| agg_math_stroke.h | 93 const vertex_dist& v1,
103 float xi = v1.x;
104 float yi = v1.y;
107 v1.x + dx1, v1.y - dy1,
108 v1.x + dx2, v1.y - dy2,
111 float d1 = calc_distance(v1.x, v1.y, xi, yi);
118 float x2 = v1.x + dx1
[all...] |
| /cts/tools/dasm/test/ |
| all_opcodes.d | 17 move v1, v2
20 move-wide v1, v2
23 move-object v1, v2
34 const/4 v1, 1
48 instance-of v1, v2, java/lang/Object
49 array-length v1, v2
51 new-array v1, v2, java/lang/Object
52 filled-new-array {v1, v2, v3, v4, v5}, I
82 if-eq v1, v2, Label1
83 if-ne v1, v2, $+1
[all...] |
| /external/libcxx/test/std/numerics/numarray/template.valarray/valarray.cassign/ |
| and_value.pass.cpp | 27 std::valarray<T> v1(a1, N);
29 v1 &= 3;
30 assert(v1.size() == v2.size());
31 for (std::size_t i = 0; i < v1.size(); ++i)
32 assert(v1[i] == v2[i]);
|
| divide_valarray.pass.cpp | 28 std::valarray<T> v1(a1, N);
32 assert(v1.size() == v2.size());
33 assert(v1.size() == v3.size());
34 for (std::size_t i = 0; i < v1.size(); ++i)
35 assert(v1[i] == v3[i]);
|
| minus_valarray.pass.cpp | 28 std::valarray<T> v1(a1, N);
32 assert(v1.size() == v2.size());
33 assert(v1.size() == v3.size());
34 for (std::size_t i = 0; i < v1.size(); ++i)
35 assert(v1[i] == v3[i]);
|
| minus_value.pass.cpp | 27 std::valarray<T> v1(a1, N);
29 v1 -= 3;
30 assert(v1.size() == v2.size());
31 for (std::size_t i = 0; i < v1.size(); ++i)
32 assert(v1[i] == v2[i]);
|
| modulo_valarray.pass.cpp | 28 std::valarray<T> v1(a1, N);
31 v2 %= v1;
32 assert(v1.size() == v2.size());
33 assert(v1.size() == v3.size());
34 for (std::size_t i = 0; i < v1.size(); ++i)
|
| modulo_value.pass.cpp | 27 std::valarray<T> v1(a1, N);
29 v1 %= 3;
30 assert(v1.size() == v2.size());
31 for (std::size_t i = 0; i < v1.size(); ++i)
32 assert(v1[i] == v2[i]);
|
| or_value.pass.cpp | 27 std::valarray<T> v1(a1, N);
29 v1 |= 3;
30 assert(v1.size() == v2.size());
31 for (std::size_t i = 0; i < v1.size(); ++i)
32 assert(v1[i] == v2[i]);
|
| plus_value.pass.cpp | 27 std::valarray<T> v1(a1, N);
29 v1 += 3;
30 assert(v1.size() == v2.size());
31 for (std::size_t i = 0; i < v1.size(); ++i)
32 assert(v1[i] == v2[i]);
|
| shift_left_value.pass.cpp | 27 std::valarray<T> v1(a1, N);
29 v1 <<= 3;
30 assert(v1.size() == v2.size());
31 for (std::size_t i = 0; i < v1.size(); ++i)
32 assert(v1[i] == v2[i]);
|
| shift_right_valarray.pass.cpp | 28 std::valarray<T> v1(a1, N);
32 assert(v1.size() == v2.size());
33 assert(v1.size() == v3.size());
34 for (std::size_t i = 0; i < v1.size(); ++i)
35 assert(v1[i] == v3[i]);
|
