| /external/clang/test/Modules/Inputs/normal-module-map/ |
| a2.h | 1 int a2; variable
|
| /external/clang/test/Sema/ |
| array-declared-as-incorrect-type.c | 6 extern int a2[]; // expected-note {{previous definition is here}}
7 float a2[1]; // expected-error {{redefinition of 'a2'}} variable
|
| /dalvik/vm/mterp/mips/ |
| OP_IGET_QUICK.S | 5 GET_OPB(a2) # a2 <- B
6 GET_VREG(a3, a2) # a3 <- object we're operating on
8 GET_OPA4(a2) # a2 <- A(+)
15 SET_VREG(a0, a2) # fp[A] <- a0
|
| OP_RETURN_WIDE.S | 7 GET_OPA(a2) # a2 <- AA
8 EAS2(a2, rFP, a2) # a2 <- &fp[AA]
10 LOAD64(a0, a1, a2) # a0/a1 <- vAA/vAA+1
|
| OP_IGET_WIDE_QUICK.S | 4 GET_OPB(a2) # a2 <- B
5 GET_VREG(a3, a2) # a3 <- object we're operating on
7 GET_OPA4(a2) # a2 <- A(+)
13 EAS2(a3, rFP, a2)
|
| OP_RETURN.S | 9 GET_OPA(a2) # a2 <- AA
10 GET_VREG(a0, a2) # a0 <- vAA
|
| /external/valgrind/main/none/tests/ppc32/ |
| lsw.c | 20 char* a2 = malloc(100); local
29 : : "b"(a1), "b"(a2) : "r3", "r4", "r5",
31 printf("%s\n", a2);
33 printf("%d = 0x%2x\n", i, a2[i]);
42 : : "b"(a1), "b"(a2) : "r3", "r4", "r5",
44 printf("%s\n", a2);
46 printf("%d = 0x%2x\n", i, a2[i]);
51 free(a2);
52 a2 = malloc(100);
59 : : "b"(a1), "b"(a2), "b"(16) : "r3", "r4", "r5", "r8",
[all...] |
| /external/valgrind/main/none/tests/ppc64/ |
| lsw.c | 20 char* a2 = malloc(100); local
29 : : "b"(a1), "b"(a2) : "r3", "r4", "r5",
31 printf("%s\n", a2);
33 printf("%d = 0x%2x\n", i, a2[i]);
42 : : "b"(a1), "b"(a2) : "r3", "r4", "r5",
44 printf("%s\n", a2);
46 printf("%d = 0x%2x\n", i, a2[i]);
51 free(a2);
52 a2 = malloc(100);
59 : : "b"(a1), "b"(a2), "b"(16) : "r3", "r4", "r5", "r8",
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/ |
| reverse.pass.cpp | 23 int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}; local
26 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
31 int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}; local
34 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))))
[all...] |
| sort.pass.cpp | 23 int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}; local
26 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
31 int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}; local
34 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))))
[all...] |
| sort_comp.pass.cpp | 24 int a2[] = {11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; local
27 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
32 int a2[] = {11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; local
35 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))))
[all...] |
| remove.pass.cpp | 23 int a2[] = {1, 2, 4}; local
26 assert(c == std::list<int>(a2, a2+3));
31 int a2[] = {1, 2, 4}; local
34 assert((c == std::list<int, min_allocator<int>>(a2, a2+3)));
|
| unique.pass.cpp | 23 int a2[] = {2, 1, 4, 3}; local
26 assert(c == std::list<int>(a2, a2+4));
31 int a2[] = {2, 1, 4, 3}; local
34 assert((c == std::list<int, min_allocator<int>>(a2, a2+4)));
|
| merge.pass.cpp | 23 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
26 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
33 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
36 std::list<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[0]))
[all...] |
| /external/clang/test/CodeGen/ |
| le32-libcall-pow.c | 13 void test_pow(float a0, double a1, long double a2) {
21 long double l2 = powl(a2, a2);
|
| 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.coerce2, i32 %a3.coerce3) [[NUW]]
22 // N64: define void @test_v4i32(i64 %a1.coerce0, i64 %a1.coerce1, i32 %a2, i64, i64 %a3.coerce0, i64 %a3.coerce1) [[NUW]]
25 void test_v4i32(v4i32 a1, int a2, v4i32 a3) {
26 test_v4i32_2(a3, a2, a1);
|
| /external/clang/test/Index/ |
| complete-recovery.m | 11 A *a2;
12 z = [a2 method:1];
13 blah ? blech : [a2 method:1];
14 (a * a2)([a2 method:1]);
15 B *a = [a2 method:1];
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.special/ |
| swap.pass.cpp | 24 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
26 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
28 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
33 int a2[] = {0, 2, 4, 5, 6, 8, 11} local
43 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
53 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
66 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
79 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
92 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
101 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
111 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
121 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
134 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.special/ |
| swap.pass.cpp | 24 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
26 std::vector<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
28 assert(c1 == std::vector<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
33 int a2[] = {0, 2, 4, 5, 6, 8, 11} local
43 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
53 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
66 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
79 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
92 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
101 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
111 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
121 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
134 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/allocator.adaptor/scoped.adaptor.operators/ |
| eq.pass.cpp | 37 A a2 = a1; local
38 assert(a2 == a1);
39 assert(!(a2 != a1));
42 typedef std::scoped_allocator_adaptor<A1<int>, A2<int>> A;
43 A a1(A1<int>(4), A2<int>(5));
44 A a2 = a1; local
45 assert(a2 == a1);
46 assert(!(a2 != a1));
49 typedef std::scoped_allocator_adaptor<A1<int>, A2<int>, A3<int>> A;
50 A a1(A1<int>(4), A2<int>(5), A3<int>(6))
51 A a2 = a1; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/memory/default.allocator/allocator.globals/ |
| eq.pass.cpp | 28 std::allocator<int> a2; local
29 assert(a1 == a2);
30 assert(!(a1 != a2));
|
| /external/clang/test/Sema/Inputs/ |
| format-unused-system-args.h | 4 #define PRINT2(fmt, a1, a2) \
5 printf((fmt), (a1), (a2))
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/utility/operators/ |
| rel_ops.pass.cpp | 40 A a2(2);
42 assert(a1 != a2);
43 assert(a1 < a2);
44 assert(a2 > a1);
46 assert(a1 <= a2);
47 assert(a2 >= a2);
48 assert(a2 >= a1);
|
| /dalvik/vm/compiler/template/mips/ |
| TEMPLATE_MONITOR_ENTER.S | 12 la a2, .LdvmLockObject
13 lw t9, (a2)
18 la a2, .LdvmJitToInterpNoChain
19 lw a2, (a2)
25 jr a2
|
| TEMPLATE_MONITOR_ENTER_DEBUG.S | 12 la a2, .LdvmLockObject
13 lw t9, (a2)
28 la a2, .LdvmJitToInterpNoChain
29 lw a2, (a2)
30 jr a2
|
