| /external/pixman/pixman/ |
| pixman-mips-memcpy-asm.S | 56 xor t8, a1, a0
57 andi t8, t8, 0x3 /* t8 is a0/a1 word-displacement */
62 andi a3, a3, 0x3 /* we need to copy a3 bytes to make a0/a1 aligned */
66 LWHI t8, 0(a1)
67 addu a1, a1, a3
92 pref 0, 0(a1) /* bring the first line of src, addr 0 */
93 pref 0, 32(a1) /* bring the second line of src, addr 32 */
94 pref 0, 64(a1) /* bring the third line of src, addr 64 */
103 pref 0, 96(a1)
[all...] |
| /external/valgrind/main/drd/ |
| drd_suppression.c | 62 void DRD_(start_suppression)(const Addr a1, const Addr a2,
67 a1, a2 - a1, reason);
69 tl_assert(a1 <= a2);
70 DRD_(bm_access_range_store)(s_suppressed, a1, a2);
73 void DRD_(finish_suppression)(const Addr a1, const Addr a2)
77 a1, a2 - a1);
81 tl_assert(a1 <= a2);
82 DRD_(bm_clear_store)(s_suppressed, a1, a2)
[all...] |
| /cts/tools/vm-tests-tf/src/dot/junit/verify/a1/d/ |
| T_a1_2.java | 17 package dot.junit.verify.a1.d;
|
| /external/clang/test/CodeGen/ |
| mips-vector-arg.c | 11 // O32: define void @test_v4sf(i32 %a1.coerce0, i32 %a1.coerce1, i32 %a1.coerce2, i32 %a1.coerce3, i32 %a2, i32, i32 %a3.coerce0, i32 %a3.coerce1, i32 %a3.coerce2, i32 %a3.coerce3) [[NUW:#[0-9]+]]
13 // N64: define void @test_v4sf(i64 %a1.coerce0, i64 %a1.coerce1, i32 %a2, i64, i64 %a3.coerce0, i64 %a3.coerce1) [[NUW:#[0-9]+]]
16 void test_v4sf(v4sf a1, int a2, v4sf a3) {
17 test_v4sf_2(a3, a2, a1);
20 // O32: define void @test_v4i32(i32 %a1.coerce0, i32 %a1.coerce1, i32 %a1.coerce2, i32 %a1.coerce3, i32 %a2, i32, i32 %a3.coerce0, i32 %a3.coerce1, i32 %a3 (…)
[all...] |
| /external/libcxx/test/numerics/numarray/template.valarray/valarray.sub/ |
| slice_const.pass.cpp | 21 int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
22 std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0]));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.valarray/valarray.sub/ |
| slice_const.pass.cpp | 21 int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
22 std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0]));
|
| /external/libcxx/test/containers/sequences/list/list.modifiers/ |
| erase_iter_db2.pass.cpp | 28 int a1[] = {1, 2, 3}; local
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
37 int a1[] = {1, 2, 3}; local
38 std::list<int, min_allocator<int>> l1(a1, a1+3);
39 std::list<int, min_allocator<int>> l2(a1, a1+3)
[all...] |
| erase_iter_iter_db1.pass.cpp | 28 int a1[] = {1, 2, 3}; local
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
36 int a1[] = {1, 2, 3}; local
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
38 std::list<int, min_allocator<int>> l2(a1, a1+3)
[all...] |
| erase_iter_iter_db2.pass.cpp | 28 int a1[] = {1, 2, 3}; local
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
36 int a1[] = {1, 2, 3}; local
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
38 std::list<int, min_allocator<int>> l2(a1, a1+3)
[all...] |
| erase_iter_iter_db3.pass.cpp | 28 int a1[] = {1, 2, 3}; local
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
36 int a1[] = {1, 2, 3}; local
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
38 std::list<int, min_allocator<int>> l2(a1, a1+3)
[all...] |
| /external/libcxx/test/containers/sequences/list/list.ops/ |
| merge.pass.cpp | 22 int a1[] = {1, 3, 7, 9, 10}; local
25 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
32 int a1[] = {1, 3, 7, 9, 10}; local
35 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]))
[all...] |
| merge_comp.pass.cpp | 23 int a1[] = {10, 9, 7, 3, 1}; local
26 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
33 int a1[] = {10, 9, 7, 3, 1}; local
36 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]))
[all...] |
| /external/libcxx/test/containers/sequences/vector/vector.modifiers/ |
| erase_iter_db2.pass.cpp | 28 int a1[] = {1, 2, 3}; local
29 std::vector<int> l1(a1, a1+3);
30 std::vector<int> l2(a1, a1+3);
37 int a1[] = {1, 2, 3}; local
38 std::vector<int, min_allocator<int>> l1(a1, a1+3);
39 std::vector<int, min_allocator<int>> l2(a1, a1+3)
[all...] |
| erase_iter_iter_db1.pass.cpp | 28 int a1[] = {1, 2, 3}; local
29 std::vector<int> l1(a1, a1+3);
30 std::vector<int> l2(a1, a1+3);
36 int a1[] = {1, 2, 3}; local
37 std::vector<int, min_allocator<int>> l1(a1, a1+3);
38 std::vector<int, min_allocator<int>> l2(a1, a1+3)
[all...] |
| erase_iter_iter_db2.pass.cpp | 28 int a1[] = {1, 2, 3}; local
29 std::vector<int> l1(a1, a1+3);
30 std::vector<int> l2(a1, a1+3);
36 int a1[] = {1, 2, 3}; local
37 std::vector<int, min_allocator<int>> l1(a1, a1+3);
38 std::vector<int, min_allocator<int>> l2(a1, a1+3)
[all...] |
| erase_iter_iter_db3.pass.cpp | 28 int a1[] = {1, 2, 3}; local
29 std::vector<int> l1(a1, a1+3);
30 std::vector<int> l2(a1, a1+3);
36 int a1[] = {1, 2, 3}; local
37 std::vector<int, min_allocator<int>> l1(a1, a1+3);
38 std::vector<int, min_allocator<int>> l2(a1, a1+3)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
| erase_iter_db2.pass.cpp | 28 int a1[] = {1, 2, 3}; local
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
37 int a1[] = {1, 2, 3}; local
38 std::list<int, min_allocator<int>> l1(a1, a1+3);
39 std::list<int, min_allocator<int>> l2(a1, a1+3)
[all...] |
| erase_iter_iter_db1.pass.cpp | 28 int a1[] = {1, 2, 3}; local
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
36 int a1[] = {1, 2, 3}; local
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
38 std::list<int, min_allocator<int>> l2(a1, a1+3)
[all...] |
| erase_iter_iter_db2.pass.cpp | 28 int a1[] = {1, 2, 3}; local
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
36 int a1[] = {1, 2, 3}; local
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
38 std::list<int, min_allocator<int>> l2(a1, a1+3)
[all...] |
| erase_iter_iter_db3.pass.cpp | 28 int a1[] = {1, 2, 3}; local
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
36 int a1[] = {1, 2, 3}; local
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
38 std::list<int, min_allocator<int>> l2(a1, a1+3)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/ |
| merge.pass.cpp | 22 int a1[] = {1, 3, 7, 9, 10}; local
25 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
32 int a1[] = {1, 3, 7, 9, 10}; local
35 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]))
[all...] |
| merge_comp.pass.cpp | 23 int a1[] = {10, 9, 7, 3, 1}; local
26 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
33 int a1[] = {10, 9, 7, 3, 1}; local
36 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.modifiers/ |
| erase_iter_db2.pass.cpp | 28 int a1[] = {1, 2, 3}; local
29 std::vector<int> l1(a1, a1+3);
30 std::vector<int> l2(a1, a1+3);
37 int a1[] = {1, 2, 3}; local
38 std::vector<int, min_allocator<int>> l1(a1, a1+3);
39 std::vector<int, min_allocator<int>> l2(a1, a1+3)
[all...] |
| erase_iter_iter_db1.pass.cpp | 28 int a1[] = {1, 2, 3}; local
29 std::vector<int> l1(a1, a1+3);
30 std::vector<int> l2(a1, a1+3);
36 int a1[] = {1, 2, 3}; local
37 std::vector<int, min_allocator<int>> l1(a1, a1+3);
38 std::vector<int, min_allocator<int>> l2(a1, a1+3)
[all...] |
| erase_iter_iter_db2.pass.cpp | 28 int a1[] = {1, 2, 3}; local
29 std::vector<int> l1(a1, a1+3);
30 std::vector<int> l2(a1, a1+3);
36 int a1[] = {1, 2, 3}; local
37 std::vector<int, min_allocator<int>> l1(a1, a1+3);
38 std::vector<int, min_allocator<int>> l2(a1, a1+3)
[all...] |
