HomeSort by relevance Sort by last modified time
    Searched refs:a1 (Results 1 - 25 of 226) sorted by null

1 2 3 4 5 6 7 8 910

  /libcore/luni/src/test/java/tests/java/security/
AllPermissionTest.java 62 AllPermission a1 = new AllPermission(); local
63 assertEquals("<all permissions>", a1.getName());
64 assertEquals("<all actions>", a1.getActions());
66 a1 = new AllPermission("sdfsdfwe&^$", "*&IUGJKHVB764");
67 assertEquals("<all permissions>", a1.getName());
68 assertEquals("<all actions>", a1.getActions());
70 a1 = new AllPermission(null, "");
71 assertEquals("<all permissions>", a1.getName());
72 assertEquals("<all actions>", a1.getActions());
84 AllPermission a1 = new AllPermission() local
101 AllPermission a1 = new AllPermission(); local
116 AllPermission a1 = new AllPermission(); local
    [all...]
  /cts/tools/vm-tests/src/dot/junit/verify/a1/d/
T_a1_2.java 17 package dot.junit.verify.a1.d;
  /external/v8/test/mjsunit/
cyclic-array-to-string.js 30 var a1 = [1,2]; variable
31 assertEquals("1,2", a1.toString());
32 assertEquals("1,2", a1.toLocaleString());
33 assertEquals("1,2", a1.join());
34 a1.push(a1);
35 assertEquals("1,2,", a1.toString());
36 assertEquals("1,2,", a1.toLocaleString());
37 assertEquals("1,2,", a1.join());
38 a1.push(1)
    [all...]
  /external/libvpx/vp8/common/
idctllm.c 31 int a1, b1, c1, d1; local
40 a1 = ip[0] + ip[8];
51 op[shortpitch*0] = a1 + d1;
52 op[shortpitch*3] = a1 - d1;
66 a1 = ip[0] + ip[2];
78 op[0] = (a1 + d1 + 4) >> 3;
79 op[3] = (a1 - d1 + 4) >> 3;
92 int a1; local
95 a1 = ((input[0] + 4) >> 3);
99 op[0] = a1;
109 int a1 = ((input_dc + 4) >> 3); local
136 int a1, b1, c1, d1; local
184 int a1; local
    [all...]
  /external/dropbear/libtommath/
bn_mp_jacobi.c 23 mp_int a1, p1; local
47 /* step 3. write a = a1 * 2**k */
48 if ((res = mp_init_copy (&a1, a)) != MP_OKAY) {
57 k = mp_cnt_lsb(&a1);
58 if ((res = mp_div_2d(&a1, k, &a1, NULL)) != MP_OKAY) {
76 /* step 5. if p == 3 (mod 4) *and* a1 == 3 (mod 4) then s = -s */
77 if ( ((p->dp[0] & 3) == 3) && ((a1.dp[0] & 3) == 3)) {
81 /* if a1 == 1 we're done */
82 if (mp_cmp_d (&a1, 1) == MP_EQ)
    [all...]
  /packages/apps/QuickSearchBox/tests/src/com/android/quicksearchbox/util/
PerNameExecutorTest.java 44 MockTask a1 = addTask("a", 1); local
49 assertRanNever("step 0", a1, a2, a3, b1);
50 step(); // run a1, b1
51 assertRanOnce("step 1", a1, b1);
54 assertRanOnce("step 2", a1, b1, a2);
57 assertRanOnce("step 3", a1, b1, a2, a3);
59 assertRanOnce("step 4", a1, b1, a2, a3);
63 MockTask a1 = addTask("a", 1); local
67 step(); // run a1, b1
68 assertRanOnce("step 1", a1, b1)
90 MockTask a1 = new MockTask("a", 1); local
    [all...]
  /external/webkit/JavaScriptCore/tests/mozilla/js1_5/Array/
regress-157652.js 125 var a1=Array(0xFFFFFFFF);
126 a1.sort();
127 a1 = null;
  /external/libvpx/vp8/encoder/
dct.c 17 int a1, b1, c1, d1; local
23 a1 = ((ip[0] + ip[3])<<3);
28 op[0] = a1 + b1;
29 op[2] = a1 - b1;
42 a1 = ip[0] + ip[12];
47 op[0] = ( a1 + b1 + 7)>>4;
48 op[8] = ( a1 - b1 + 7)>>4;
67 int a1, b1, c1, d1; local
75 a1 = ((ip[0] + ip[2])<<2);
80 op[0] = a1 + d1 + (a1!=0)
    [all...]
  /external/libffi/testsuite/libffi.call/
cls_19byte.c 19 cls_struct_19byte cls_struct_19byte_fn(struct cls_struct_19byte a1,
24 result.a = a1.a + a2.a;
25 result.b = a1.b + a2.b;
26 result.c = a1.c + a2.c;
27 result.d = a1.d + a2.d;
28 result.e = a1.e + a2.e;
32 a1.a, a1.b, a1.c, a1.d, a1.e
42 struct cls_struct_19byte a1, a2; local
    [all...]
cls_5_1_byte.c 19 cls_struct_5byte cls_struct_5byte_fn(struct cls_struct_5byte a1,
24 result.a = a1.a + a2.a;
25 result.b = a1.b + a2.b;
26 result.c = a1.c + a2.c;
27 result.d = a1.d + a2.d;
28 result.e = a1.e + a2.e;
31 a1.a, a1.b, a1.c, a1.d, a1.e
43 struct cls_struct_5byte a1, a2; local
    [all...]
cls_7_1_byte.c 21 cls_struct_7byte cls_struct_7byte_fn(struct cls_struct_7byte a1,
26 result.a = a1.a + a2.a;
27 result.b = a1.b + a2.b;
28 result.c = a1.c + a2.c;
29 result.d = a1.d + a2.d;
30 result.e = a1.e + a2.e;
31 result.f = a1.f + a2.f;
32 result.g = a1.g + a2.g;
35 a1.a, a1.b, a1.c, a1.d, a1.e, a1.f, a1.g
47 struct cls_struct_7byte a1, a2; local
    [all...]
cls_18byte.c 18 cls_struct_18byte cls_struct_18byte_fn(struct cls_struct_18byte a1,
23 result.a = a1.a + a2.a;
24 result.b = a1.b + a2.b;
25 result.c = a1.c + a2.c;
26 result.d = a1.d + a2.d;
29 printf("%g %d %d %g %g %d %d %g: %g %d %d %g\n", a1.a, a1.b, a1.c, a1.d,
39 struct cls_struct_18byte a1, a2 local
    [all...]
cls_4_1byte.c 19 cls_struct_4_1byte cls_struct_4_1byte_fn(struct cls_struct_4_1byte a1,
24 result.a = a1.a + a2.a;
25 result.b = a1.b + a2.b;
26 result.c = a1.c + a2.c;
27 result.d = a1.d + a2.d;
29 printf("%d %d %d %d %d %d %d %d: %d %d %d %d\n", a1.a, a1.b, a1.c, a1.d,
41 struct cls_struct_4_1byte a1, a2 local
    [all...]
cls_6byte.c 19 cls_struct_6byte cls_struct_6byte_fn(struct cls_struct_6byte a1,
24 result.a = a1.a + a2.a;
25 result.b = a1.b + a2.b;
26 result.c = a1.c + a2.c;
27 result.d = a1.d + a2.d;
29 printf("%d %d %d %d %d %d %d %d: %d %d %d %d\n", a1.a, a1.b, a1.c, a1.d,
41 struct cls_struct_6byte a1, a2 local
    [all...]
cls_7byte.c 18 cls_struct_7byte cls_struct_7byte_fn(struct cls_struct_7byte a1,
23 result.a = a1.a + a2.a;
24 result.b = a1.b + a2.b;
25 result.c = a1.c + a2.c;
26 result.d = a1.d + a2.d;
28 printf("%d %d %d %d %d %d %d %d: %d %d %d %d\n", a1.a, a1.b, a1.c, a1.d,
40 struct cls_struct_7byte a1, a2 local
    [all...]
cls_6_1_byte.c 20 cls_struct_6byte cls_struct_6byte_fn(struct cls_struct_6byte a1,
25 result.a = a1.a + a2.a;
26 result.b = a1.b + a2.b;
27 result.c = a1.c + a2.c;
28 result.d = a1.d + a2.d;
29 result.e = a1.e + a2.e;
30 result.f = a1.f + a2.f;
33 a1.a, a1.b, a1.c, a1.d, a1.e, a1.f
45 struct cls_struct_6byte a1, a2; local
    [all...]
cls_2byte.c 17 cls_struct_2byte cls_struct_2byte_fn(struct cls_struct_2byte a1,
22 result.a = a1.a + a2.a;
23 result.b = a1.b + a2.b;
25 printf("%d %d %d %d: %d %d\n", a1.a, a1.b, a2.a, a2.b, result.a, result.b);
35 struct cls_struct_2byte a1, a2; local
37 a1 = *(struct cls_struct_2byte*)(args[0]);
40 *(cls_struct_2byte*)resp = cls_struct_2byte_fn(a1, a2);
cls_3byte1.c 17 cls_struct_3byte cls_struct_3byte_fn(struct cls_struct_3byte a1,
22 result.a = a1.a + a2.a;
23 result.b = a1.b + a2.b;
25 printf("%d %d %d %d: %d %d\n", a1.a, a1.b, a2.a, a2.b, result.a, result.b);
35 struct cls_struct_3byte a1, a2; local
37 a1 = *(struct cls_struct_3byte*)(args[0]);
40 *(cls_struct_3byte*)resp = cls_struct_3byte_fn(a1, a2);
  /external/apache-http/src/org/apache/http/util/
LangUtils.java 67 public static boolean equals(final Object[] a1, final Object[] a2) {
68 if (a1 == null) {
75 if (a2 != null && a1.length == a2.length) {
76 for (int i = 0; i < a1.length; i++) {
77 if (!equals(a1[i], a2[i])) {
  /bionic/libc/kernel/arch-x86/asm/xen/
hypercall.h 24 #define _hypercall1(type, name, a1) ({ long __res, __ign1; asm volatile ( "call %[call]" : "=a" (__res), "=b" (__ign1) : "1" ((long)(a1)), [call] "m" (hypercall_page[__HYPERVISOR_##name]) : "memory" ); (type)__res; })
26 #define _hypercall2(type, name, a1, a2) ({ long __res, __ign1, __ign2; asm volatile ( "call %[call]" : "=a" (__res), "=b" (__ign1), "=c" (__ign2) : "1" ((long)(a1)), "2" ((long)(a2)), [call] "m" (hypercall_page[__HYPERVISOR_##name]) : "memory" ); (type)__res; })
28 #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; })
30 #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; })
32 #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" (hyper (…)
    [all...]
  /development/ndk/platforms/android-5/arch-x86/include/asm/xen/
hypercall.h 24 #define _hypercall1(type, name, a1) ({ long __res, __ign1; asm volatile ( "call %[call]" : "=a" (__res), "=b" (__ign1) : "1" ((long)(a1)), [call] "m" (hypercall_page[__HYPERVISOR_##name]) : "memory" ); (type)__res; })
26 #define _hypercall2(type, name, a1, a2) ({ long __res, __ign1, __ign2; asm volatile ( "call %[call]" : "=a" (__res), "=b" (__ign1), "=c" (__ign2) : "1" ((long)(a1)), "2" ((long)(a2)), [call] "m" (hypercall_page[__HYPERVISOR_##name]) : "memory" ); (type)__res; })
28 #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; })
30 #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; })
32 #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" (hyper (…)
    [all...]
  /prebuilt/ndk/android-ndk-r4/platforms/android-5/arch-x86/usr/include/asm/xen/
hypercall.h 24 #define _hypercall1(type, name, a1) ({ long __res, __ign1; asm volatile ( "call %[call]" : "=a" (__res), "=b" (__ign1) : "1" ((long)(a1)), [call] "m" (hypercall_page[__HYPERVISOR_##name]) : "memory" ); (type)__res; })
26 #define _hypercall2(type, name, a1, a2) ({ long __res, __ign1, __ign2; asm volatile ( "call %[call]" : "=a" (__res), "=b" (__ign1), "=c" (__ign2) : "1" ((long)(a1)), "2" ((long)(a2)), [call] "m" (hypercall_page[__HYPERVISOR_##name]) : "memory" ); (type)__res; })
28 #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; })
30 #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; })
32 #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" (hyper (…)
    [all...]
  /prebuilt/ndk/android-ndk-r4/platforms/android-8/arch-x86/usr/include/asm/xen/
hypercall.h 24 #define _hypercall1(type, name, a1) ({ long __res, __ign1; asm volatile ( "call %[call]" : "=a" (__res), "=b" (__ign1) : "1" ((long)(a1)), [call] "m" (hypercall_page[__HYPERVISOR_##name]) : "memory" ); (type)__res; })
26 #define _hypercall2(type, name, a1, a2) ({ long __res, __ign1, __ign2; asm volatile ( "call %[call]" : "=a" (__res), "=b" (__ign1), "=c" (__ign2) : "1" ((long)(a1)), "2" ((long)(a2)), [call] "m" (hypercall_page[__HYPERVISOR_##name]) : "memory" ); (type)__res; })
28 #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; })
30 #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; })
32 #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" (hyper (…)
    [all...]
  /external/qemu/fpu/
softfloat-macros.h 86 | Shifts the 128-bit value formed by concatenating `a0' and `a1' right by 64
94 | (This routine makes more sense if `a0' and `a1' are considered to form
95 | a fixed-point value with binary point between `a0' and `a1'. This fixed-
104 bits64 a0, bits64 a1, int16 count, bits64 *z0Ptr, bits64 *z1Ptr )
110 z1 = a1;
114 z1 = ( a0<<negCount ) | ( a1 != 0 );
119 z1 = a0 | ( a1 != 0 );
122 z1 = ( ( a0 | a1 ) != 0 );
132 | Shifts the 128-bit value formed by concatenating `a0' and `a1' right by the
141 bits64 a0, bits64 a1, int16 count, bits64 *z0Ptr, bits64 *z1Ptr
    [all...]
  /frameworks/base/core/tests/coretests/src/android/os/
IAidlTest.aidl 34 boolean[] booleanArray(in boolean[] a0, out boolean[] a1, inout boolean[] a2);
35 char[] charArray(in char[] a0, out char[] a1, inout char[] a2);
36 int[] intArray(in int[] a0, out int[] a1, inout int[] a2);
37 long[] longArray(in long[] a0, out long[] a1, inout long[] a2);
38 float[] floatArray(in float[] a0, out float[] a1, inout float[] a2);
39 double[] doubleArray(in double[] a0, out double[] a1, inout double[] a2);
40 String[] stringArray(in String[] a0, out String[] a1, inout String[] a2);
42 out AidlTest.TestParcelable[] a1,

Completed in 267 milliseconds

1 2 3 4 5 6 7 8 910