| /prebuilts/ndk/9/platforms/android-9/arch-x86/usr/include/asm/xen/ |
| hypercall.h | 31 #define _hypercall3(type, name, a1, a2, a3) ({ long __res, __ign1, __ign2, __ign3; asm volatile ( "call %[call]" : "=a" (__res), "=b" (__ign1), "=c" (__ign2), "=d" (__ign3) : "1" ((long)(a1)), "2" ((long)(a2)), "3" ((long)(a3)), [call] "m" (hypercall_page[__HYPERVISOR_##name]) : "memory" ); (type)__res; })
32 #define _hypercall4(type, name, a1, a2, a3, a4) ({ long __res, __ign1, __ign2, __ign3, __ign4; asm volatile ( "call %[call]" : "=a" (__res), "=b" (__ign1), "=c" (__ign2), "=d" (__ign3), "=S" (__ign4) : "1" ((long)(a1)), "2" ((long)(a2)), "3" ((long)(a3)), "4" ((long)(a4)), [call] "m" (hypercall_page[__HYPERVISOR_##name]) : "memory" ); (type)__res; })
34 #define _hypercall5(type, name, a1, a2, a3, a4, a5) ({ long __res, __ign1, __ign2, __ign3, __ign4, __ign5; asm volatile ( "call %[call]" : "=a" (__res), "=b" (__ign1), "=c" (__ign2), "=d" (__ign3), "=S" (__ign4), "=D" (__ign5) : "1" ((long)(a1)), "2" ((long)(a2)), "3" ((long)(a3)), "4" ((long)(a4)), "5" ((long)(a5)), [call] "m" (hypercall_page[__HYPERVISOR_##name]) : "memory" ); (type)__res; })
|
| /dalvik/vm/mterp/mips/ |
| OP_IGET_WIDE.S | 12 LOAD_rSELF_methodClassDex(a3) # a3 <- DvmDex
14 LOAD_base_offDvmDex_pResFields(a2, a3) # a2 <- pResFields
35 LOAD_base_offInstField_byteOffset(a3, a0) # a3 <- byte offset of field
38 addu rOBJ, rOBJ, a3 # form address
45 EAS2(a3, rFP, a2) # a3 <- &fp[A]
47 STORE64(a0, a1, a3) # fp[A] <- a0/a1
|
| OP_INVOKE_SUPER.S | 12 LOAD_rSELF_methodClassDex(a3) # a3 <- pDvmDex
17 LOAD_base_offDvmDex_pResMethods(a3, a3) # a3 <- pDvmDex->pResMethods
19 LOAD_eas2(a0, a3, a1) # a0 <- resolved baseMethod
45 LOAD_base_offClassObject_vtableCount(a3, a1) # a3 <- super->vtableCount
48 bgeu a2, a3, .L${opcode}_nsm # method not present in superclass
|
| binflop.S | 11 srl a3, a0, 8 # a3 <- CC
14 GET_VREG(a1, a3) # a1 <- vCC
21 GET_VREG_F(fa1, a3) # a1 <- vCC
|
| /external/chromium/base/memory/ |
| linked_ptr_unittest.cc | 47 linked_ptr<A> a3(new A);
48 a0 = a3;
49 ASSERT_TRUE(a0 == a3);
51 ASSERT_TRUE(a0.get() == a3);
52 ASSERT_TRUE(a0 == a3.get());
56 ASSERT_TRUE(a5.get() != a3);
57 ASSERT_TRUE(a5 != a3.get());
66 a3->Use();
103 "A3 ctor\n"
105 "A3 dtor\n
[all...] |
| /external/chromium/testing/gmock/include/gmock/ |
| gmock-generated-nice-strict.h | 90 template <typename A1, typename A2, typename A3>
91 NiceMock(const A1& a1, const A2& a2, const A3& a3) : MockClass(a1, a2, a3) {
96 template <typename A1, typename A2, typename A3, typename A4>
97 NiceMock(const A1& a1, const A2& a2, const A3& a3,
98 const A4& a4) : MockClass(a1, a2, a3, a4) {
103 template <typename A1, typename A2, typename A3, typename A4, typename A5>
104 NiceMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4
[all...] |
| /external/chromium/testing/gtest/test/ |
| gtest-linked_ptr_test.cc | 91 linked_ptr<A> a3(new A);
92 a0 = a3;
93 ASSERT_TRUE(a0 == a3);
95 ASSERT_TRUE(a0.get() == a3);
96 ASSERT_TRUE(a0 == a3.get());
100 ASSERT_TRUE(a5.get() != a3);
101 ASSERT_TRUE(a5 != a3.get());
110 a3->Use();
147 "A3 ctor\n"
149 "A3 dtor\n
[all...] |
| /external/chromium_org/base/memory/ |
| linked_ptr_unittest.cc | 49 linked_ptr<A> a3(new A);
50 a0 = a3;
51 ASSERT_TRUE(a0 == a3);
53 ASSERT_TRUE(a0.get() == a3);
54 ASSERT_TRUE(a0 == a3.get());
58 ASSERT_TRUE(a5.get() != a3);
59 ASSERT_TRUE(a5 != a3.get());
68 a3->Use();
105 "A3 ctor\n"
107 "A3 dtor\n
[all...] |
| /external/chromium_org/testing/gtest/test/ |
| gtest-linked_ptr_test.cc | 91 linked_ptr<A> a3(new A);
92 a0 = a3;
93 ASSERT_TRUE(a0 == a3);
95 ASSERT_TRUE(a0.get() == a3);
96 ASSERT_TRUE(a0 == a3.get());
100 ASSERT_TRUE(a5.get() != a3);
101 ASSERT_TRUE(a5 != a3.get());
110 a3->Use();
147 "A3 ctor\n"
149 "A3 dtor\n
[all...] |
| /external/clang/test/CXX/class/class.mem/ |
| p1b.cpp | 17 void a3(int a = 42);
26 a.a3();
|
| /external/clang/test/CodeGen/ |
| mips64-padding-arg.c | 11 // N64: define void @foo1(i32 %a0, i64, double %a1.coerce0, i64 %a1.coerce1, i64 %a1.coerce2, i64 %a1.coerce3, double %a2.coerce0, i64 %a2.coerce1, i64 %a2.coerce2, i64 %a2.coerce3, i32 %b, i64, double %a3.coerce0, i64 %a3.coerce1, i64 %a3.coerce2, i64 %a3.coerce3)
12 // N64: tail call void @foo2(i32 1, i32 2, i32 %a0, i64 undef, double %a1.coerce0, i64 %a1.coerce1, i64 %a1.coerce2, i64 %a1.coerce3, double %a2.coerce0, i64 %a2.coerce1, i64 %a2.coerce2, i64 %a2.coerce3, i32 3, i64 undef, double %a3.coerce0, i64 %a3.coerce1, i64 %a3.coerce2, i64 %a3.coerce3)
17 void foo1(int a0, S0 a1, S0 a2, int b, S0 a3) {
18 foo2(1, 2, a0, a1, a2, 3, a3);
[all...] |
| /external/clang/test/Index/ |
| annotate-comments-preprocessor.c | 17 #define A3 1 /**< Aaa. */
22 int A[] = { A0, A1, A2, A3, A4, A5, A6 };
25 int f(int a1[A1], int a2[A2], int a3[A3], int a4[A4], int a5[A5], int a6[A6]);
29 int g(int a1[A1], int a2[A2], int a3[A3], int a4[A4], int a5[A5], int a6[A6]);
|
| /external/gtest/test/ |
| gtest-linked_ptr_test.cc | 91 linked_ptr<A> a3(new A);
92 a0 = a3;
93 ASSERT_TRUE(a0 == a3);
95 ASSERT_TRUE(a0.get() == a3);
96 ASSERT_TRUE(a0 == a3.get());
100 ASSERT_TRUE(a5.get() != a3);
101 ASSERT_TRUE(a5 != a3.get());
110 a3->Use();
147 "A3 ctor\n"
149 "A3 dtor\n
[all...] |
| /external/protobuf/gtest/test/ |
| gtest-linked_ptr_test.cc | 90 linked_ptr<A> a3(new A);
91 a0 = a3;
92 ASSERT_TRUE(a0 == a3);
94 ASSERT_TRUE(a0.get() == a3);
95 ASSERT_TRUE(a0 == a3.get());
99 ASSERT_TRUE(a5.get() != a3);
100 ASSERT_TRUE(a5 != a3.get());
109 a3->Use();
146 "A3 ctor\n"
148 "A3 dtor\n
[all...] |
| /external/valgrind/main/massif/tests/ |
| deep.c | 8 // - In deep-C.vgtest, we have --alloc-fn=a3..a12, which means that get_XCon
25 void a3 (int n) { a4 (n); } function
26 void a2 (int n) { a3 (n); }
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.valarray/valarray.cassign/ |
| and_valarray.pass.cpp | 25 T a3[] = {0, 2, 0, 0, 0}; local
29 std::valarray<T> v3(a3, N);
|
| divide_valarray.pass.cpp | 25 T a3[] = {6, 14, 24, 36, 50}; local
29 std::valarray<T> v3(a3, N);
|
| minus_valarray.pass.cpp | 25 T a3[] = {7, 9, 11, 13, 15}; local
29 std::valarray<T> v3(a3, N);
|
| modulo_valarray.pass.cpp | 25 T a3[] = {0, 1, 2, 1, 0}; local
29 std::valarray<T> v3(a3, N);
|
| or_valarray.pass.cpp | 25 T a3[] = {7, 7, 11, 13, 15}; local
29 std::valarray<T> v3(a3, N);
|
| plus_valarray.pass.cpp | 25 T a3[] = {7, 9, 11, 13, 15}; local
29 std::valarray<T> v3(a3, N);
|
| shift_left_valarray.pass.cpp | 25 T a3[] = {64, 256, 768, 2048, 5120}; local
29 std::valarray<T> v3(a3, N);
|
| shift_right_valarray.pass.cpp | 25 T a3[] = {64, 256, 768, 2048, 5120}; local
29 std::valarray<T> v3(a3, N);
|
| times_valarray.pass.cpp | 25 T a3[] = {6, 14, 24, 36, 50}; local
29 std::valarray<T> v3(a3, N);
|
| xor_valarray.pass.cpp | 25 T a3[] = {7, 5, 11, 13, 15}; local
29 std::valarray<T> v3(a3, N);
|
