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

1 2 3 4 5 6 7 8 91011>>

  /packages/apps/ContactsCommon/tests/src/com/android/contacts/common/model/
AccountWithDataSetTest.java 39 AccountWithDataSet a2 = new AccountWithDataSet("name2", "typeB", null); local
44 AccountWithDataSet a2r = AccountWithDataSet.unstringify(a2.stringify());
48 assertEquals(a2, a2r);
54 MoreAsserts.assertNotEqual(a2, a1r);
55 MoreAsserts.assertNotEqual(a2, a3r);
63 AccountWithDataSet a2 = new AccountWithDataSet("name2", "typeB", null); local
75 final List<AccountWithDataSet> listB = stringifyListAndUnstringify(a2, a1);
77 assertEquals(a2, listB.get(0));
81 final List<AccountWithDataSet> listC = stringifyListAndUnstringify(a3, a2, a1);
84 assertEquals(a2, listC.get(1))
97 AccountWithDataSet a2 = new AccountWithDataSet("name2", "typeB", null); local
    [all...]
  /dalvik/vm/compiler/template/mips/
fbinopWide.S 4 * specifies an instruction that performs "result = a0-a1 op a2-a3".
16 * a2 = op2 address
23 move t1, a2 # save a2
25 LOAD64(rARG2, rARG3, t1) # a2/a3<- vCC/vCC+1
27 or t0, rARG2, rARG3 # second arg (a2-a3) is zero?
35 LOAD64_F(fa1, fa1f, a2)
  /external/libffi/testsuite/libffi.call/
cls_20byte.c 18 struct cls_struct_20byte a2)
22 result.a = a1.a + a2.a;
23 result.b = a1.b + a2.b;
24 result.c = a1.c + a2.c;
26 printf("%g %g %d %g %g %d: %g %g %d\n", a1.a, a1.b, a1.c, a2.a, a2.b, a2.c,
35 struct cls_struct_20byte a1, a2; local
38 a2 = *(struct cls_struct_20byte*)(args[1]);
40 *(cls_struct_20byte*)resp = cls_struct_20byte_fn(a1, a2);
    [all...]
cls_20byte1.c 20 struct cls_struct_20byte a2)
24 result.a = a1.a + a2.a;
25 result.b = a1.b + a2.b;
26 result.c = a1.c + a2.c;
28 printf("%d %g %g %d %g %g: %d %g %g\n", a1.a, a1.b, a1.c, a2.a, a2.b, a2.c,
37 struct cls_struct_20byte a1, a2; local
40 a2 = *(struct cls_struct_20byte*)(args[1]);
42 *(cls_struct_20byte*)resp = cls_struct_20byte_fn(a1, a2);
    [all...]
cls_3_1byte.c 19 struct cls_struct_3_1byte a2)
23 result.a = a1.a + a2.a;
24 result.b = a1.b + a2.b;
25 result.c = a1.c + a2.c;
28 a2.a, a2.b, a2.c,
39 struct cls_struct_3_1byte a1, a2; local
42 a2 = *(struct cls_struct_3_1byte*)(args[1]);
44 *(cls_struct_3_1byte*)resp = cls_struct_3_1byte_fn(a1, a2);
    [all...]
cls_5byte.c 18 struct cls_struct_5byte a2)
22 result.a = a1.a + a2.a;
23 result.b = a1.b + a2.b;
24 result.c = a1.c + a2.c;
27 a2.a, a2.b, a2.c,
38 struct cls_struct_5byte a1, a2; local
41 a2 = *(struct cls_struct_5byte*)(args[1]);
43 *(cls_struct_5byte*)resp = cls_struct_5byte_fn(a1, a2);
    [all...]
cls_align_double.c 19 struct cls_struct_align a2)
23 result.a = a1.a + a2.a;
24 result.b = a1.b + a2.b;
25 result.c = a1.c + a2.c;
27 printf("%d %g %d %d %g %d: %d %g %d\n", a1.a, a1.b, a1.c, a2.a, a2.b, a2.c, result.a, result.b, result.c);
37 struct cls_struct_align a1, a2; local
40 a2 = *(struct cls_struct_align*)(args[1]);
42 *(cls_struct_align*)resp = cls_struct_align_fn(a1, a2);
    [all...]
cls_align_float.c 17 struct cls_struct_align a2)
21 result.a = a1.a + a2.a;
22 result.b = a1.b + a2.b;
23 result.c = a1.c + a2.c;
25 printf("%d %g %d %d %g %d: %d %g %d\n", a1.a, (double)a1.b, a1.c, a2.a, (double)a2.b, a2.c, result.a, (double)result.b, result.c);
35 struct cls_struct_align a1, a2; local
38 a2 = *(struct cls_struct_align*)(args[1]);
40 *(cls_struct_align*)resp = cls_struct_align_fn(a1, a2);
    [all...]
cls_align_longdouble.c 18 struct cls_struct_align a2)
22 result.a = a1.a + a2.a;
23 result.b = a1.b + a2.b;
24 result.c = a1.c + a2.c;
26 printf("%d %g %d %d %g %d: %d %g %d\n", a1.a, (double)a1.b, a1.c, a2.a, (double)a2.b, a2.c, result.a, (double)result.b, result.c);
36 struct cls_struct_align a1, a2; local
39 a2 = *(struct cls_struct_align*)(args[1]);
41 *(cls_struct_align*)resp = cls_struct_align_fn(a1, a2);
    [all...]
cls_align_pointer.c 17 struct cls_struct_align a2)
21 result.a = a1.a + a2.a;
22 result.b = (void *)((unsigned long)a1.b + (unsigned long)a2.b);
23 result.c = a1.c + a2.c;
26 a2.a, (unsigned long)a2.b, a2.c, result.a, (unsigned long)result.b,
37 struct cls_struct_align a1, a2; local
40 a2 = *(struct cls_struct_align*)(args[1]);
42 *(cls_struct_align*)resp = cls_struct_align_fn(a1, a2);
    [all...]
cls_align_sint16.c 17 struct cls_struct_align a2)
21 result.a = a1.a + a2.a;
22 result.b = a1.b + a2.b;
23 result.c = a1.c + a2.c;
25 printf("%d %d %d %d %d %d: %d %d %d\n", a1.a, a1.b, a1.c, a2.a, a2.b, a2.c, result.a, result.b, result.c);
35 struct cls_struct_align a1, a2; local
38 a2 = *(struct cls_struct_align*)(args[1]);
40 *(cls_struct_align*)resp = cls_struct_align_fn(a1, a2);
    [all...]
cls_align_sint32.c 17 struct cls_struct_align a2)
21 result.a = a1.a + a2.a;
22 result.b = a1.b + a2.b;
23 result.c = a1.c + a2.c;
25 printf("%d %d %d %d %d %d: %d %d %d\n", a1.a, a1.b, a1.c, a2.a, a2.b, a2.c, result.a, result.b, result.c);
35 struct cls_struct_align a1, a2; local
38 a2 = *(struct cls_struct_align*)(args[1]);
40 *(cls_struct_align*)resp = cls_struct_align_fn(a1, a2);
    [all...]
cls_align_sint64.c 17 struct cls_struct_align a2)
21 result.a = a1.a + a2.a;
22 result.b = a1.b + a2.b;
23 result.c = a1.c + a2.c;
25 printf("%d %lld %d %d %lld %d: %d %lld %d\n", a1.a, a1.b, a1.c, a2.a, a2.b, a2.c, result.a, result.b, result.c);
35 struct cls_struct_align a1, a2; local
38 a2 = *(struct cls_struct_align*)(args[1]);
40 *(cls_struct_align*)resp = cls_struct_align_fn(a1, a2);
    [all...]
cls_align_uint16.c 17 struct cls_struct_align a2)
21 result.a = a1.a + a2.a;
22 result.b = a1.b + a2.b;
23 result.c = a1.c + a2.c;
25 printf("%d %d %d %d %d %d: %d %d %d\n", a1.a, a1.b, a1.c, a2.a, a2.b, a2.c, result.a, result.b, result.c);
35 struct cls_struct_align a1, a2; local
38 a2 = *(struct cls_struct_align*)(args[1]);
40 *(cls_struct_align*)resp = cls_struct_align_fn(a1, a2);
    [all...]
cls_align_uint32.c 17 struct cls_struct_align a2)
21 result.a = a1.a + a2.a;
22 result.b = a1.b + a2.b;
23 result.c = a1.c + a2.c;
25 printf("%d %d %d %d %d %d: %d %d %d\n", a1.a, a1.b, a1.c, a2.a, a2.b, a2.c, result.a, result.b, result.c);
35 struct cls_struct_align a1, a2; local
38 a2 = *(struct cls_struct_align*)(args[1]);
40 *(cls_struct_align*)resp = cls_struct_align_fn(a1, a2);
    [all...]
cls_align_uint64.c 18 struct cls_struct_align a2)
22 result.a = a1.a + a2.a;
23 result.b = a1.b + a2.b;
24 result.c = a1.c + a2.c;
26 printf("%d %lld %d %d %lld %d: %d %lld %d\n", a1.a, a1.b, a1.c, a2.a, a2.b, a2.c, result.a, result.b, result.c);
36 struct cls_struct_align a1, a2; local
39 a2 = *(struct cls_struct_align*)(args[1]);
41 *(cls_struct_align*)resp = cls_struct_align_fn(a1, a2);
    [all...]
problem1.c 16 my_ffi_struct callee(struct my_ffi_struct a1, struct my_ffi_struct a2)
19 result.a = a1.a + a2.a;
20 result.b = a1.b + a2.b;
21 result.c = a1.c + a2.c;
25 a2.a, a2.b, a2.c, result.a, result.b, result.c);
34 struct my_ffi_struct a2; local
37 a2 = *(struct my_ffi_struct*)(args[1]);
39 *(my_ffi_struct *)resp = callee(a1, a2);
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/
insert_iter_size_value.pass.cpp 46 int a2[] = {1, 4, 4, 4, 4, 4, 2, 3}; local
50 assert(l1 == std::list<int>(a2, a2+8));
63 assert(l1 == std::list<int>(a2, a2+8));
76 int a2[] = {1, 4, 4, 4, 4, 4, 2, 3}; local
80 assert((l1 == std::list<int, min_allocator<int>>(a2, a2+8)));
93 assert((l1 == std::list<int, min_allocator<int>>(a2, a2+8)))
    [all...]
insert_iter_value.pass.cpp 46 int a2[] = {1, 4, 2, 3}; local
52 assert(l1 == std::list<int>(a2, a2+4));
65 assert(l1 == std::list<int>(a2, a2+4));
79 int a2[] = {1, 4, 2, 3}; local
85 assert((l1 == std::list<int, min_allocator<int>>(a2, a2+4)));
98 assert((l1 == std::list<int, min_allocator<int>>(a2, a2+4)))
    [all...]
  /dalvik/vm/mterp/mips/
OP_FILLED_NEW_ARRAY.S 20 li a2, 0 # a2 <- false
36 li a2, ALLOC_DONT_TRACK # a2 <- alloc flags
66 EAS2(a2, rFP, a1) # a2 <- &fp[CCCC]
68 lw a3, 0(a2) # a3 <- *a2++
69 addu a2, 4
78 and a2, rOBJ, 15 # a2 <-
    [all...]
OP_IPUT_OBJECT.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
41 lw a2, offThread_cardTable(rSELF) # a2 <- card table base
52 addu t2, a2, t1
53 sb a2, (t2) # mark card if no
    [all...]
  /external/valgrind/main/drd/
drd_bitmap.c 130 const Addr a1, const Addr a2,
136 return DRD_(bm_access_range_load)(bm, a1, a2);
138 return DRD_(bm_access_range_store)(bm, a1, a2);
141 void DRD_(bm_access_range_load)(struct bitmap* const bm, Addr a1, Addr a2)
146 tl_assert(a1 <= a2);
147 tl_assert(a2 < first_address_with_higher_msb(a2));
149 tl_assert(a2 == first_address_with_same_lsb(a2));
151 for (b = a1; b < a2; b = b_next
    [all...]
  /system/core/libcutils/tests/memset_mips/
android_memset_test.S 45 DBG andi $t2,$a2,1 /* $a2 must be even */
49 ins $a2,$0,0,1
52 and $a2,$t0
56 blez $a2,9f /* Anything to do? */
68 subu $a2,2
72 and $t1,$a2,63 /* is there enough left to do a full 64 byte loop? */
73 beq $a2,$t1,1f
74 subu $t2,$a2,$t1 /* $t2 is the number of bytes to do in loop64 */
76 subu $a2,$t
    [all...]
  /dalvik/vm/arch/mips/
CallO32.S 52 * a2 argInfo
92 * |__8_______| reserved (a2: arg)
108 * |__________| reserved for a2
136 bltz $a2,.Lno_arginfo
160 srl $s2,$a2,28 /* s2 <- returnType */
161 srl $t1,$a2,21
164 addiu $t1,16 /* include space for a0/a1/a2/a3 */
171 * a2 :argInfo
183 srl $a2,1
186 andi $t3,$a2,0x1 /* the second position is a pad? *
    [all...]
  /external/chromium/testing/gmock/include/gmock/
gmock-generated-nice-strict.h 84 template <typename A1, typename A2>
85 NiceMock(const A1& a1, const A2& a2) : MockClass(a1, a2) {
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
    [all...]

Completed in 131 milliseconds

1 2 3 4 5 6 7 8 91011>>