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

<<11121314151617181920>>

  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.valarray/valarray.members/
apply_cref.pass.cpp 27 T a2[] = {6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
33 assert(v2[i] == a2[i]);
43 T a2[] = {7, 9, 11, 13, 15, 17, 19, 21, 23, 25}; local
49 assert(v2[i] == a2[i]);
apply_value.pass.cpp 27 T a2[] = {6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
33 assert(v2[i] == a2[i]);
43 T a2[] = {7, 9, 11, 13, 15, 17, 19, 21, 23, 25}; local
49 assert(v2[i] == a2[i]);
  /ndk/tests/device/test-stlport_shared-exception/jni/
eh24.cpp 25 throw 1; // make sure both a1 and a2 are not destroyed when we throw!
27 A a2;
  /ndk/tests/device/test-stlport_static-exception/jni/
eh24.cpp 25 throw 1; // make sure both a1 and a2 are not destroyed when we throw!
27 A a2;
  /sdk/eclipse/plugins/com.android.ide.eclipse.tests/src/com/android/ide/eclipse/adt/internal/launch/
JUnitLaunchConfigDelegateTest.java 107 private void assertEqualsArrays(String[][] a1, String[][] a2) {
108 assertTrue(Arrays.deepEquals(a1, a2));
111 private void assertEqualsArrays(String[] a1, String[] a2) {
112 assertTrue(Arrays.deepEquals(a1, a2));
  /bionic/libc/arch-mips/bionic/
futex_mips.S 46 move $a3,$a2 /* timespec */
47 move $a2,$a1 /* val */
75 move $a2,$a1 /* val */
102 # move $a2,$a2 /* val */
129 # move $a2,$a2 /* val */
  /dalvik/vm/mterp/mips/
OP_MUL_LONG.S 5 * x a3 a2
15 and t0, a0, 255 # a2 <- BB
21 LOAD64(a2, a3, t1) # a2/a3 <- vCC/vCC+1
24 multu a2, a0
27 mul t0, a2, a1 # t0= a2a1
OP_MUL_LONG_2ADDR.S 13 LOAD64(a2, a3, t1) # vBB.low / high
16 multu a2, a0
19 mul t2, a2, a1 # t2= a2a1
zcmp.S 12 GET_VREG(a2, a0) # a2 <- vAA
14 b${revcmp} a2, zero, 1f # branch to 1 if comparison failed
  /frameworks/native/opengl/libagl/
matrix.h 141 GLfixed a2, GLfixed b2,
157 "%r"(a2), "r"(b2),
170 "madd %[a2],%[b2] \r\n"
178 : [a0] "r" (a0),[b0] "r" (b0),[a1] "r" (a1),[b1] "r" (b1),[a2] "r" (a2),[b2] "r" (b2),[c] "r" (c)
187 int64_t(a2)*b2)>>16) + c;
197 GLfixed a2, int32_t b2,
212 "r"(a2), "r"(b2),
226 accum += int64_t(a2)*int16_t(b2) >> 16;
236 GLfixed a2,
    [all...]
  /external/chromium_org/third_party/re2/re2/
variadic_function.h 29 const Arg& a2) const {
30 const Arg* const args[] = { &a0, &a1, &a2 };
35 const Arg& a2, const Arg& a3) const {
36 const Arg* const args[] = { &a0, &a1, &a2, &a3 };
41 const Arg& a2, const Arg& a3, const Arg& a4) const {
42 const Arg* const args[] = { &a0, &a1, &a2, &a3, &a4 };
47 const Arg& a2, const Arg& a3, const Arg& a4, const Arg& a5) const {
48 const Arg* const args[] = { &a0, &a1, &a2, &a3, &a4, &a5 };
53 const Arg& a2, const Arg& a3, const Arg& a4, const Arg& a5,
55 const Arg* const args[] = { &a0, &a1, &a2, &a3, &a4, &a5, &a6 }
    [all...]
  /external/regex-re2/re2/
variadic_function.h 31 const Arg& a2) const {
32 const Arg* const args[] = { &a0, &a1, &a2 };
37 const Arg& a2, const Arg& a3) const {
38 const Arg* const args[] = { &a0, &a1, &a2, &a3 };
43 const Arg& a2, const Arg& a3, const Arg& a4) const {
44 const Arg* const args[] = { &a0, &a1, &a2, &a3, &a4 };
49 const Arg& a2, const Arg& a3, const Arg& a4, const Arg& a5) const {
50 const Arg* const args[] = { &a0, &a1, &a2, &a3, &a4, &a5 };
55 const Arg& a2, const Arg& a3, const Arg& a4, const Arg& a5,
57 const Arg* const args[] = { &a0, &a1, &a2, &a3, &a4, &a5, &a6 }
    [all...]
  /external/chromium_org/third_party/openssl/openssl/crypto/bn/asm/
x86-gf2m.pl 48 ($a1,$a2,$a4)=("ecx","edx","ebp");
59 &lea ($a2,&DWP(0,$a,$a));
61 &lea ($a4,&DWP(0,$a2,$a2));
63 &and ($a2,0x7fffffff);
67 &xor ($a1,$a2); # a1^a2
70 &mov (&DWP(2*4,"esp"),$a2); # a2
71 &xor ($a2,$a4); # a2^a
    [all...]
s390x-gf2m.pl 55 ($a1,$a2,$a4,$a8,$a12,$a48)=map("%r$_",(6..11));
65 sllg $a2,$a,1
71 srag @i[0],$a2,63 # broadcast 62nd bit
72 nihh $a2,0x3fff
82 xgr $a12,$a2
85 stg $a2,`$stdframe+2*8`($sp) # tab[2]=a2
87 stg $a12,`$stdframe+3*8`($sp) # tab[3]=a1^a2
91 xgr $a2,$a4
94 stg $a2,`$stdframe+6*8`($sp) # tab[6]=a2^a
    [all...]
  /external/openssl/crypto/bn/asm/
x86-gf2m.pl 48 ($a1,$a2,$a4)=("ecx","edx","ebp");
59 &lea ($a2,&DWP(0,$a,$a));
61 &lea ($a4,&DWP(0,$a2,$a2));
63 &and ($a2,0x7fffffff);
67 &xor ($a1,$a2); # a1^a2
70 &mov (&DWP(2*4,"esp"),$a2); # a2
71 &xor ($a2,$a4); # a2^a
    [all...]
s390x-gf2m.pl 55 ($a1,$a2,$a4,$a8,$a12,$a48)=map("%r$_",(6..11));
65 sllg $a2,$a,1
71 srag @i[0],$a2,63 # broadcast 62nd bit
72 nihh $a2,0x3fff
82 xgr $a12,$a2
85 stg $a2,`$stdframe+2*8`($sp) # tab[2]=a2
87 stg $a12,`$stdframe+3*8`($sp) # tab[3]=a1^a2
91 xgr $a2,$a4
94 stg $a2,`$stdframe+6*8`($sp) # tab[6]=a2^a
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/
splice_pos_list.pass.cpp 26 int a2[] = {4, 5, 6}; local
38 std::list<int> l2(a2, a2+1);
49 std::list<int> l2(a2, a2+2);
62 std::list<int> l2(a2, a2+3);
99 std::list<int> l2(a2, a2+1);
112 std::list<int> l2(a2, a2+1)
    [all...]
  /dalvik/vm/compiler/template/mips/
TEMPLATE_INVOKE_METHOD_NATIVE.S 39 move a2, a0 # a2<- methodToCall
44 # a2: methodToCall
48 SCRATCH_STORE(a2, 8)
52 move a0, a2
62 SCRATCH_LOAD(a2, 8)
66 move rOBJ, a2 # save a2
83 lw a2, offStackSaveArea_returnAddr(rBIX) # a2 = chaining cell ret add
    [all...]
TEMPLATE_INVOKE_METHOD_PREDICTED_CHAIN.S 25 # a0 = this, a1 = returnCell, a2 = predictedChainCell, rPC = dalvikCallsite
27 lw rIBASE, 8(a2) # t0 <- predictedChainCell->clazz
28 lw a0, 12(a2) # a0 <- predictedChainCell->method
54 * a2 <- &predictedChainCell
TEMPLATE_STRING_INDEXOF.S 15 * a2: Starting offset in string data
26 * a2: starting offset
42 slt t7, a2, zero
43 movn a2, zero, t7
44 sgt t7, a2, t1
45 movn a2, t1, t7
48 sll t7, a2, 1 # multiply offset by 2
52 subu a3, t1, a2
  /external/valgrind/main/memcheck/tests/
wrap6.c 232 UInt fn_2 ( UInt a1, UInt a2 )
237 words[2-1] = a2;
243 UInt I_WRAP_SONAME_FNNAME_ZU(NONE,fn_2) ( UInt a1, UInt a2 )
249 printf("fn_2 wrapper pre ( %d, %d )\n", (int)a1, (int)a2);
250 CALL_FN_W_WW(r, fn, a1, a2);
252 CALL_FN_v_WW(fn, a1, a2);
260 UInt fn_3 ( UInt a1, UInt a2, UInt a3 )
265 words[2-1] = a2;
272 UInt I_WRAP_SONAME_FNNAME_ZU(NONE,fn_3) ( UInt a1, UInt a2, UInt a3 )
278 printf("fn_3 wrapper pre ( %d, %d, %d )\n", (int)a1, (int)a2, (int)a3)
    [all...]
  /external/chromium_org/third_party/WebKit/Source/platform/audio/
Biquad.cpp 99 double a2 = m_a2;
104 float y = b0*x + b1*x1 + b2*x2 - a1*y1 - a2*y2;
126 m_a2 = a2;
234 double a2 = 2 * beta;
236 setNormalizedCoefficients(b0, b1, b2, 1, a1, a2);
270 double a2 = 2 * beta;
272 setNormalizedCoefficients(b0, b1, b2, 1, a1, a2);
283 void Biquad::setNormalizedCoefficients(double b0, double b1, double b2, double a0, double a1, double a2)
291 m_a2 = a2 * a0Inverse;
332 double a2 = aPlusOne + aMinusOne * k - k2
    [all...]
  /external/valgrind/main/drd/
pub_drd_bitmap.h 85 const Addr a1, const Addr a2,
88 const Addr a1, const Addr a2);
94 const Addr a1, const Addr a2);
100 const Addr a1, const Addr a2,
104 const Addr a1, const Addr a2);
106 const Addr a1, const Addr a2);
108 const Addr a1, const Addr a2);
112 const Addr a1, const Addr a2);
114 const Addr a1, const Addr a2);
116 const Addr a1, const Addr a2);
    [all...]
  /external/chromium_org/sync/internal_api/public/util/
weak_handle.h 163 template <typename U, typename A1, typename A2>
165 void (U::*fn)(A1, A2),
167 typename ParamTraits<A2>::ForwardType a2) const {
170 Bind(&WeakHandleCore::template DoCall2<U, A1, A2>,
171 this, fn, a1, a2));
174 template <typename U, typename A1, typename A2, typename A3>
176 void (U::*fn)(A1, A2, A3),
178 typename ParamTraits<A2>::ForwardType a2,
    [all...]
  /external/chromium_org/v8/test/cctest/
test-disasm-mips.cc 99 COMPARE(addu(a0, a1, a2),
100 "00a62021 addu a0, a1, a2");
106 COMPARE(subu(a0, a1, a2),
107 "00a62023 subu a0, a1, a2");
142 COMPARE(mul(a0, a1, a2),
143 "70a62002 mul a0, a1, a2");
159 COMPARE(and_(a0, a1, a2),
160 "00a62024 and a0, a1, a2");
165 COMPARE(and_(v0, v1, a2),
166 "00661024 and v0, v1, a2");
    [all...]

Completed in 531 milliseconds

<<11121314151617181920>>