| /external/llvm/test/MC/AArch64/ |
| H A D | neon-mul-div-instructions.s | 8 mul v0.8b, v1.8b, v2.8b
9 mul v0.16b, v1.16b, v2.16b
10 mul v0.4h, v1.4h, v2.4h
11 mul v0.8h, v1.8h, v2.8h
12 mul v0.2s, v1.2s, v2.2s
13 mul v0.4s, v1.4s, v2.4s
15 // CHECK: mul v0.8b, v1.8b, v2.8b // encoding: [0x20,0x9c,0x22,0x0e]
16 // CHECK: mul v0.16b, v1.16b, v2.16b // encoding: [0x20,0x9c,0x22,0x4e]
17 // CHECK: mul v0.4h, v1.4h, v2.4h // encoding: [0x20,0x9c,0x62,0x0e]
18 // CHECK: mul v0.8h, v1.8h, v2
[all...] |
| /external/v8/test/mjsunit/regress/ |
| H A D | regress-370384.js | 8 var v2 = f(x);
13 assertEquals(v1, v2);
|
| /external/clang/test/CodeGen/ |
| H A D | cxx-value-init.cpp | 5 float v2 = float(); variable
|
| /external/clang/test/Modules/Inputs/ |
| H A D | linkage-merge-sub.h | 8 static int v2; variable
|
| /external/compiler-rt/test/tsan/libcxx/ |
| H A D | std_shared_ptr.cc | 8 int v2 = 0; local
15 t2 = std::thread([thingy, &v2] { v2 = *thingy; });
20 printf("%d %d\n", v1, v2);
|
| /external/libcxx/test/std/numerics/numarray/template.valarray/valarray.cassign/ |
| H A D | divide_value.pass.cpp | 27 std::valarray<T> v2(a2, N);
28 v2 /= 6;
29 assert(v1.size() == v2.size());
31 assert(v1[i] == v2[i]);
|
| H A D | shift_right_value.pass.cpp | 27 std::valarray<T> v2(a2, N);
28 v2 >>= 3;
29 assert(v1.size() == v2.size());
31 assert(v1[i] == v2[i]);
|
| /external/libcxx/test/std/numerics/numarray/template.valarray/valarray.unary/ |
| H A D | negate.pass.cpp | 26 std::valarray<T> v2 = -v; local
27 assert(v2.size() == v.size());
28 for (int i = 0; i < v2.size(); ++i)
29 assert(v2[i] == -v[i]);
36 std::valarray<T> v2 = -v; local
37 assert(v2.size() == v.size());
38 for (int i = 0; i < v2.size(); ++i)
39 assert(v2[i] == -v[i]);
46 std::valarray<T> v2 = -v; local
47 assert(v2
60 std::valarray<T> v2 = -(v + v); local
[all...] |
| H A D | plus.pass.cpp | 26 std::valarray<T> v2 = +v; local
27 assert(v2.size() == v.size());
28 for (int i = 0; i < v2.size(); ++i)
29 assert(v2[i] == +v[i]);
36 std::valarray<T> v2 = +v; local
37 assert(v2.size() == v.size());
38 for (int i = 0; i < v2.size(); ++i)
39 assert(v2[i] == +v[i]);
46 std::valarray<T> v2 = +v; local
47 assert(v2
60 std::valarray<T> v2 = +(v + v); local
[all...] |
| /external/libcxx/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/ |
| H A D | and_valarray_value.pass.cpp | 27 std::valarray<T> v2 = v1 & 3; local
28 assert(v1.size() == v2.size());
29 for (int i = 0; i < v2.size(); ++i)
30 assert(v2[i] == a2[i]);
|
| H A D | and_value_valarray.pass.cpp | 27 std::valarray<T> v2 = 3 & v1; local
28 assert(v1.size() == v2.size());
29 for (int i = 0; i < v2.size(); ++i)
30 assert(v2[i] == a2[i]);
|
| H A D | divide_valarray_value.pass.cpp | 27 std::valarray<T> v2 = v1 / 6; local
28 assert(v1.size() == v2.size());
29 for (int i = 0; i < v2.size(); ++i)
30 assert(v2[i] == a2[i]);
|
| H A D | divide_value_valarray.pass.cpp | 27 std::valarray<T> v2 = 3 / v1; local
28 assert(v1.size() == v2.size());
29 for (int i = 0; i < v2.size(); ++i)
30 assert(v2[i] == a2[i]);
|
| H A D | minus_valarray_value.pass.cpp | 27 std::valarray<T> v2 = v1 - 3; local
28 assert(v1.size() == v2.size());
29 for (int i = 0; i < v2.size(); ++i)
30 assert(v2[i] == a2[i]);
|
| H A D | minus_value_valarray.pass.cpp | 27 std::valarray<T> v2 = 3 - v1; local
28 assert(v1.size() == v2.size());
29 for (int i = 0; i < v2.size(); ++i)
30 assert(v2[i] == a2[i]);
|
| H A D | modulo_valarray_value.pass.cpp | 27 std::valarray<T> v2 = v1 % 3; local
28 assert(v1.size() == v2.size());
29 for (int i = 0; i < v2.size(); ++i)
30 assert(v2[i] == a2[i]);
|
| H A D | modulo_value_valarray.pass.cpp | 27 std::valarray<T> v2 = 3 % v1; local
28 assert(v1.size() == v2.size());
29 for (int i = 0; i < v2.size(); ++i)
30 assert(v2[i] == a2[i]);
|
| H A D | or_valarray_value.pass.cpp | 27 std::valarray<T> v2 = v1 | 3; local
28 assert(v1.size() == v2.size());
29 for (int i = 0; i < v2.size(); ++i)
30 assert(v2[i] == a2[i]);
|
| H A D | or_value_valarray.pass.cpp | 27 std::valarray<T> v2 = 3 | v1; local
28 assert(v1.size() == v2.size());
29 for (int i = 0; i < v2.size(); ++i)
30 assert(v2[i] == a2[i]);
|
| H A D | plus_valarray_value.pass.cpp | 27 std::valarray<T> v2 = v1 + 3; local
28 assert(v1.size() == v2.size());
29 for (int i = 0; i < v2.size(); ++i)
30 assert(v2[i] == a2[i]);
|
| H A D | plus_value_valarray.pass.cpp | 27 std::valarray<T> v2 = 3 + v1; local
28 assert(v1.size() == v2.size());
29 for (int i = 0; i < v2.size(); ++i)
30 assert(v2[i] == a2[i]);
|
| H A D | shift_left_valarray_value.pass.cpp | 27 std::valarray<T> v2 = v1 << 3; local
28 assert(v1.size() == v2.size());
29 for (int i = 0; i < v2.size(); ++i)
30 assert(v2[i] == a2[i]);
|
| H A D | shift_left_value_valarray.pass.cpp | 27 std::valarray<T> v2 = 3 << v1; local
28 assert(v1.size() == v2.size());
29 for (int i = 0; i < v2.size(); ++i)
30 assert(v2[i] == a2[i]);
|
| H A D | shift_right_valarray_value.pass.cpp | 27 std::valarray<T> v2 = v1 >> 3; local
28 assert(v1.size() == v2.size());
29 for (int i = 0; i < v2.size(); ++i)
30 assert(v2[i] == a2[i]);
|
| H A D | shift_right_value_valarray.pass.cpp | 27 std::valarray<T> v2 = 40 >> v1; local
28 assert(v1.size() == v2.size());
29 for (int i = 0; i < v2.size(); ++i)
30 assert(v2[i] == a2[i]);
|