| /external/clang/test/CodeGenCXX/ |
| stmtexpr.cpp | 32 A b = ({ A a(1); A a1(2); A a2(3); a1; a2; a; });
35 A c = ({ A a(1); A a1(2); A a2(3); a1; a2; a; A a3(4); a2; a3; });
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.cons/ |
| move_alloc.pass.cpp | 47 V a2[] = local
59 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
86 V a2[] = local
98 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7))
125 V a2[] = local
165 V a2[] = local
[all...] |
| move_assign.pass.cpp | 47 V a2[] = local
59 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
87 V a2[] = local
99 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7))
127 V a2[] = local
168 V a2[] = local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.cons/ |
| move_alloc.pass.cpp | 47 V a2[] = local
59 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
86 V a2[] = local
98 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7))
125 V a2[] = local
165 V a2[] = local
[all...] |
| move_assign.pass.cpp | 47 V a2[] = local
59 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
87 V a2[] = local
99 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7))
127 V a2[] = local
168 V a2[] = local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/multiset.cons/ |
| move_assign.pass.cpp | 46 V a2[] = local
58 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
85 V a2[] = local
97 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7))
124 V a2[] = local
165 V a2[] = local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/set.cons/ |
| move_assign.pass.cpp | 46 V a2[] = local
58 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
85 V a2[] = local
97 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7))
124 V a2[] = local
164 V a2[] = local
[all...] |
| /dalvik/vm/mterp/mips/ |
| OP_IPUT.S | 16 LOAD_base_offDvmDex_pResFields(a2, a3) # a2 <- pDvmDex->pResFields
18 LOAD_eas2(a0, a2, a1) # a0 <- resolved InstField ptr
21 LOAD_rSELF_method(a2) # a2 <- current method
23 LOAD_base_offMethod_clazz(a0, a2) # a0 <- method->clazz
|
| OP_CONST_WIDE.S | 5 FETCH(a2, 3) # a2 <- hhhh (high middle)
11 or a1, a3, a2 # a1 <- HHHHhhhh (high word)
|
| OP_MONITOR_EXIT.S | 12 GET_OPA(a2) # a2 <- AA
14 GET_VREG(a1, a2) # a1 <- vAA (object)
|
| binopLit8.S | 18 and a2, a3, 255 # a2 <- BB
19 GET_VREG(a0, a2) # a0 <- vBB
|
| /external/chromium_org/third_party/sqlite/src/tool/ |
| diffdb.c | 19 unsigned char a1[PAGESIZE], a2[PAGESIZE]; local
35 while( read(db1, a1, PAGESIZE)==PAGESIZE && read(db2,a2,PAGESIZE)==PAGESIZE ){
36 if( memcmp(a1,a2,PAGESIZE) ){
|
| /external/clang/test/CodeGen/ |
| atomics-inlining.c | 11 unsigned char a1[100], a2[100]; variable
31 (void)__atomic_load(&a1, &a2, memory_order_seq_cst);
32 (void)__atomic_store(&a1, &a2, memory_order_seq_cst);
43 // ARM: call arm_aapcscc void @__atomic_load(i32 100, i8* getelementptr inbounds ([100 x i8]* @a1, i32 0, i32 0), i8* getelementptr inbounds ([100 x i8]* @a2, i32 0, i32 0)
44 // ARM: call arm_aapcscc void @__atomic_store(i32 100, i8* getelementptr inbounds ([100 x i8]* @a1, i32 0, i32 0), i8* getelementptr inbounds ([100 x i8]* @a2, i32 0, i32 0)
55 // PPC32: call void @__atomic_load(i32 100, i8* getelementptr inbounds ([100 x i8]* @a1, i32 0, i32 0), i8* getelementptr inbounds ([100 x i8]* @a2, i32 0, i32 0)
56 // PPC32: call void @__atomic_store(i32 100, i8* getelementptr inbounds ([100 x i8]* @a1, i32 0, i32 0), i8* getelementptr inbounds ([100 x i8]* @a2, i32 0, i32 0)
67 // PPC64: call void @__atomic_load(i64 100, i8* getelementptr inbounds ([100 x i8]* @a1, i32 0, i32 0), i8* getelementptr inbounds ([100 x i8]* @a2, i32 0, i32 0)
68 // PPC64: call void @__atomic_store(i64 100, i8* getelementptr inbounds ([100 x i8]* @a1, i32 0, i32 0), i8* getelementptr inbounds ([100 x i8]* @a2, i32 0, i32 0)
79 // MIPS32: call void @__atomic_load(i32 100, i8* getelementptr inbounds ([100 x i8]* @a1, i32 0, i32 0), i8* getelementptr inbounds ([100 x i8]* @a2, i32 0, i32 0
[all...] |
| /external/llvm/unittests/Support/ |
| ManagedStatic.cpp | 46 pthread_attr_t a1, a2; local
48 void *p2 = test1::allocate_stack(a2);
53 pthread_create(&t2, &a2, test1::helper, NULL);
|
| /external/valgrind/main/none/tests/x86/ |
| incdec_alt.c | 7 int r1,r2,r3,r4,r5,r6,r7,r8,a1,a2; variable
15 "\tmovl " VG_SYM(a2) ",%edx\n"
57 a2 = 0x88888888;
|
| /frameworks/rs/java/tests/RSTest_CompatLib/src/com/android/rs/test/ |
| UT_copy_test.java | 35 Allocation a2 = Allocation.createSized(rs, Element.F32_2(rs), 1024); local
44 s.forEach_copyFloat2(a1, a2);
46 a2.copyTo(f2);
54 a2.destroy();
59 Allocation a2 = Allocation.createSized(rs, Element.F32_3(rs), 1024); local
68 s.forEach_copyFloat3(a1, a2);
70 a2.copyTo(f2);
78 a2.destroy();
83 Allocation a2 = Allocation.createSized(rs, Element.F32_4(rs), 1024); local
92 s.forEach_copyFloat4(a1, a2);
[all...] |
| /frameworks/rs/java/tests/RsTest/src/com/android/rs/test/ |
| UT_copy_test.java | 35 Allocation a2 = Allocation.createSized(rs, Element.F32_2(rs), 1024); local
44 s.forEach_copyFloat2(a1, a2);
46 a2.copyTo(f2);
54 a2.destroy();
59 Allocation a2 = Allocation.createSized(rs, Element.F32_3(rs), 1024); local
68 s.forEach_copyFloat3(a1, a2);
70 a2.copyTo(f2);
78 a2.destroy();
83 Allocation a2 = Allocation.createSized(rs, Element.F32_4(rs), 1024); local
92 s.forEach_copyFloat4(a1, a2);
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/memory/default.allocator/ |
| allocator_types.pass.cpp | 46 std::allocator<char> a2 = a; local
47 a2 = a;
48 std::allocator<int> a3 = a2;
|
| /system/core/libcutils/tests/memset_mips/ |
| memset_cmips.S | 67 addu t0,a0,a2 # t0 is the "past the end" address
68 slti AT,a2,4 # is a2 less than 4?
89 subu a2,a2,v1
95 andi t8,a2,0x3f # any 64-byte chunks?
97 beq a2,t8,.Lchk8w # when a2==t8, no 64-byte chunks
99 subu a3,a2,t8 # subtract from a2 the reminde
[all...] |
| memset_omips.S | 38 slti t1, a2, 8 # Less than 8?
53 subu a2, t0
55 addu a0, t0 # Now both a0 and a2 are updated
58 andi t0, a2, 0x7 # Enough left for one loop iteration?
59 beq t0, a2, .Lchkl
60 subu a3, a2, t0
62 move a2, t0 # a2 is now # of bytes left after loop
70 andi t0, a2, 0x4 # Check if there is at least a full
72 subu a2, t
[all...] |
| /dalvik/vm/mterp/out/ |
| InterpAsm-mips.S | 52 #define rARG2 a2
60 #define rARG3 a2
451 lw a2, offThread_shadowSpace(rSELF) # to find out the jit exit state
453 lw a3, offShadowSpace_jitExitState(a2) # jit exit state
456 li a2, kJitTSelectRequestHot # ask for trace selection
529 GET_VREG(a2, a1) # a2 <- fp[B]
531 SET_VREG_GOTO(a2, a0, t0) # fp[A] <- a2
543 GET_VREG(a2, a1) # a2 <- fp[BBBB
[all...] |
| /external/v8/src/mips/ |
| builtins-mips.cc | 334 a2,
341 __ mov(v0, a2);
351 __ lw(a2, MemOperand(sp)); // Get the argument from the stack.
352 __ Branch(¬_empty_array, ne, a2, Operand(zero_reg));
358 __ And(a3, a2, Operand(kIntptrSignBit | kSmiTagMask));
364 __ Branch(call_generic_code, Ugreater_equal, a2,
369 // a2: array_size (smi)
373 a2,
381 __ IncrementCounter(counters->array_function_native(), 1, a2, t0);
390 __ sll(a2, a0, kSmiTagSize); // Convert argc to a smi
[all...] |
| /external/libffi/testsuite/libffi.call/ |
| cls_1_1byte.c | 19 struct cls_struct_1_1byte a2)
23 result.a = a1.a + a2.a;
25 printf("%d %d: %d\n", a1.a, a2.a, result.a);
35 struct cls_struct_1_1byte a1, a2; local
38 a2 = *(struct cls_struct_1_1byte*)(args[1]);
40 *(cls_struct_1_1byte*)resp = cls_struct_1_1byte_fn(a1, a2);
|
| cls_multi_uchar.c | 10 unsigned char test_func_fn(unsigned char a1, unsigned char a2,
15 result = a1 + a2 + a3 + a4;
17 printf("%d %d %d %d: %d\n", a1, a2, a3, a4, result);
26 unsigned char a1, a2, a3, a4; local
29 a2 = *(unsigned char *)avals[1];
33 *(ffi_arg *)rval = test_func_fn(a1, a2, a3, a4);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/allocator.adaptor/allocator.adaptor.cnstr/ |
| converting_move.pass.cpp | 34 A a2 = std::move(a1); local
37 assert(a2 == a1);
40 typedef std::scoped_allocator_adaptor<A1<double>, A2<int>> B;
41 typedef std::scoped_allocator_adaptor<A1<int>, A2<int>> A;
42 B a1(A1<int>(4), A2<int>(5));
45 A2<int>::copy_called = false;
46 A2<int>::move_called = false;
47 A a2 = std::move(a1); local
50 assert(A2<int>::copy_called == false);
51 assert(A2<int>::move_called == true)
64 A a2 = std::move(a1); local
[all...] |
