HomeSort by relevance Sort by last modified time
    Searched refs:a2 (Results 276 - 300 of 1169) sorted by null

<<11121314151617181920>>

  /dalvik/vm/mterp/mips/
OP_IGET_WIDE.S 14 LOAD_base_offDvmDex_pResFields(a2, a3) # a2 <- pResFields
16 LOAD_eas2(a0, a2, a1) # a0 <- resolved InstField ptr
19 LOAD_rSELF_method(a2) # a2 <- current method
21 LOAD_base_offMethod_clazz(a0, a2) # a0 <- method->clazz
37 GET_OPA4(a2) # a2 <- A+
45 EAS2(a3, rFP, a2) # a3 <- &fp[A]
binflop.S 12 and a2, a0, 255 # a2 <- BB
15 GET_VREG(a0, a2) # a0 <- vBB
22 GET_VREG_F(fa0, a2) # a0 <- vBB
  /external/chromium/base/memory/
linked_ptr_unittest.cc 36 linked_ptr<A> a0, a1, a2; local
38 a1 = a2;
41 ASSERT_EQ(a2.get(), static_cast<A*>(NULL));
44 ASSERT_TRUE(a2 == NULL);
58 a2 = a5;
77 a2->Use();
79 a1 = a2;
80 a2.reset(new A);
89 "A2 ctor\n"
99 "A2 dtor\n
    [all...]
  /external/chromium/testing/gtest/test/
gtest-linked_ptr_test.cc 79 linked_ptr<A> a0, a1, a2; local
82 a1 = a2;
85 ASSERT_EQ(a2.get(), static_cast<A*>(NULL));
88 ASSERT_TRUE(a2 == NULL);
102 a2 = a5;
121 a2->Use();
123 a1 = a2;
124 a2.reset(new A);
133 "A2 ctor\n"
143 "A2 dtor\n
    [all...]
  /external/chromium_org/base/memory/
linked_ptr_unittest.cc 38 linked_ptr<A> a0, a1, a2; local
40 a1 = a2;
43 ASSERT_EQ(a2.get(), static_cast<A*>(NULL));
46 ASSERT_TRUE(a2 == NULL);
60 a2 = a5;
79 a2->Use();
81 a1 = a2;
82 a2.reset(new A);
91 "A2 ctor\n"
101 "A2 dtor\n
    [all...]
  /external/chromium_org/testing/gtest/test/
gtest-linked_ptr_test.cc 79 linked_ptr<A> a0, a1, a2; local
82 a1 = a2;
85 ASSERT_EQ(a2.get(), static_cast<A*>(NULL));
88 ASSERT_TRUE(a2 == NULL);
102 a2 = a5;
121 a2->Use();
123 a1 = a2;
124 a2.reset(new A);
133 "A2 ctor\n"
143 "A2 dtor\n
    [all...]
  /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 16 #define A2 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 79 linked_ptr<A> a0, a1, a2; local
82 a1 = a2;
85 ASSERT_EQ(a2.get(), static_cast<A*>(NULL));
88 ASSERT_TRUE(a2 == NULL);
102 a2 = a5;
121 a2->Use();
123 a1 = a2;
124 a2.reset(new A);
133 "A2 ctor\n"
143 "A2 dtor\n
    [all...]
  /external/protobuf/gtest/test/
gtest-linked_ptr_test.cc 79 linked_ptr<A> a0, a1, a2; local
81 a1 = a2;
84 ASSERT_EQ(a2.get(), static_cast<A*>(NULL));
87 ASSERT_TRUE(a2 == NULL);
101 a2 = a5;
120 a2->Use();
122 a1 = a2;
123 a2.reset(new A);
132 "A2 ctor\n"
142 "A2 dtor\n
    [all...]
  /external/valgrind/main/massif/tests/
deep.c 26 void a2 (int n) { a3 (n); } function
27 void a1 (int n) { a2 (n); }
  /external/valgrind/main/none/tests/
bug129866.c 28 char *a1, *b1, *a2 __attribute__((unused)), *b2 __attribute__((unused)); local
32 a2 = touch_realloc(a1, 1601600) ;
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.valarray/valarray.cassign/
and_valarray.pass.cpp 24 T a2[] = {6, 7, 8, 9, 10}; local
28 std::valarray<T> v2(a2, N);
divide_valarray.pass.cpp 24 T a2[] = {6, 7, 8, 9, 10}; local
28 std::valarray<T> v2(a2, N);
minus_valarray.pass.cpp 24 T a2[] = {6, 7, 8, 9, 10}; local
28 std::valarray<T> v2(a2, N);
modulo_valarray.pass.cpp 24 T a2[] = {6, 7, 8, 9, 10}; local
28 std::valarray<T> v2(a2, N);
or_valarray.pass.cpp 24 T a2[] = {6, 7, 8, 9, 10}; local
28 std::valarray<T> v2(a2, N);
plus_valarray.pass.cpp 24 T a2[] = {6, 7, 8, 9, 10}; local
28 std::valarray<T> v2(a2, N);
shift_left_valarray.pass.cpp 24 T a2[] = { 6, 7, 8, 9, 10}; local
28 std::valarray<T> v2(a2, N);
shift_right_valarray.pass.cpp 24 T a2[] = { 6, 7, 8, 9, 10}; local
28 std::valarray<T> v2(a2, N);
times_valarray.pass.cpp 24 T a2[] = {6, 7, 8, 9, 10}; local
28 std::valarray<T> v2(a2, N);
xor_valarray.pass.cpp 24 T a2[] = {6, 7, 8, 9, 10}; local
28 std::valarray<T> v2(a2, N);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/valarray.nonmembers/valarray.binary/
and_valarray_valarray.pass.cpp 24 T a2[] = {6, 7, 8, 9, 10}; local
28 std::valarray<T> v2(a2, N);
divide_valarray_valarray.pass.cpp 24 T a2[] = {6, 7, 8, 9, 10}; local
28 std::valarray<T> v2(a2, N);
minus_valarray_valarray.pass.cpp 24 T a2[] = {6, 7, 8, 9, 10}; local
28 std::valarray<T> v2(a2, N);

Completed in 319 milliseconds

<<11121314151617181920>>