/external/webkit/Source/JavaScriptCore/tests/mozilla/ecma_3/NumberFormatting/ |
tostring-001.js | 29 var n0 = 1e23; 36 reportCompare ("1e+23", n0.toString(), "1e23 toString()");
|
/external/openssl/crypto/bn/asm/ |
armv4-mont.pl | 37 $n0="r8"; 78 ldr $n0,[$_n0] @ &n0 82 ldr $n0,[$n0] @ *n0 86 str $n0,[$_n0] @ save n0 value 87 mul $n0,$alo,$n0 @ "tp[0]"*n [all...] |
sparcv9a-mont.pl | 79 $n0="%i4"; # const BN_ULONG *n0, 91 $n0="%g4"; # reassigned(!) to "64-bit" register 140 ld [%i4+0],$n0 ! $n0 reassigned, remember? 144 or %o0,$n0,$n0 ! $n0=n0[1].n0[0 [all...] |
ppc64-mont.pl | 106 $n0="r7"; 152 $N0="f20"; $N1="f21"; $N2="f22"; $N3="f23"; 245 ld $n0,0($n0) ; pull n0[0] value 249 mr $t1,$n0 252 lwz $n0,0($t1) ; pull n0[0,1] value 257 insrdi $n0,$t1,32,0 271 mulld $t7,$t7,$n0 ; tp[0]*n [all...] |
armv4-mont.S | 24 ldr r8,[r0,#14*4] @ &n0 28 ldr r8,[r8] @ *n0 32 str r8,[r0,#14*4] @ save n0 value 33 mul r8,r10,r8 @ "tp[0]"*n0 35 umlal r10,r12,r6,r8 @ np[0]*n0+"t[0]" 45 umlal r12,r14,r6,r8 @ np[j]*n0 55 ldr r8,[r0,#14*4] @ restore n0 76 umlal r10,r12,r6,r8 @ np[0]*n0+"tp[0]" 86 umlal r12,r14,r6,r8 @ np[j]*n0 99 ldr r8,[r0,#14*4] @ restore n0 [all...] |
s390x-mont.pl | 70 $n0="%r6"; # const BN_ULONG *n0, 121 lg $n0,0($n0) # pull n0 122 _dswap $n0 131 lgr $mn0,$alo # "tp[0]"*n0 132 msgr $mn0,$n0 184 msgr $mn0,$n0 # tp[0]*n0 [all...] |
sparcv9-mont.pl | 50 $n0="%i4"; # const BN_ULONG *n0, 94 ld [$n0],$n0 117 mulx $n0,$acc0,$mul1 ! "t[0]"*n0 120 mulx $car1,$mul1,$car1 ! np[0]*"t[0]"*n0 121 mulx $npj,$mul1,$acc1 !prologue! np[1]*"t[0]"*n0 189 mulx $n0,$acc0,$mul1 307 mulx $n0,$acc0,$mul1 ! "t[0]"*n [all...] |
ppc-mont.pl | 86 $n0="r7"; 148 $LD $n0,0($n0) ; pull n0[0] value 161 $UMULL $m1,$lo0,$n0 ; "tp[0]"*n0 226 $UMULL $m1,$lo0,$n0 ; tp[0]*n0
|
/external/eigen/unsupported/Eigen/src/FFT/ |
ei_fftw_impl.h | 82 void fwd2( complex_type * dst,complex_type * src,int n0,int n1) { 83 if (m_plan==NULL) m_plan = fftwf_plan_dft_2d(n0,n1,src,dst,FFTW_FORWARD,FFTW_ESTIMATE|FFTW_PRESERVE_INPUT); 87 void inv2( complex_type * dst,complex_type * src,int n0,int n1) { 88 if (m_plan==NULL) m_plan = fftwf_plan_dft_2d(n0,n1,src,dst,FFTW_BACKWARD,FFTW_ESTIMATE|FFTW_PRESERVE_INPUT); 124 void fwd2( complex_type * dst,complex_type * src,int n0,int n1) { 125 if (m_plan==NULL) m_plan = fftw_plan_dft_2d(n0,n1,src,dst,FFTW_FORWARD,FFTW_ESTIMATE|FFTW_PRESERVE_INPUT); 129 void inv2( complex_type * dst,complex_type * src,int n0,int n1) { 130 if (m_plan==NULL) m_plan = fftw_plan_dft_2d(n0,n1,src,dst,FFTW_BACKWARD,FFTW_ESTIMATE|FFTW_PRESERVE_INPUT); 165 void fwd2( complex_type * dst,complex_type * src,int n0,int n1) { 166 if (m_plan==NULL) m_plan = fftwl_plan_dft_2d(n0,n1,src,dst,FFTW_FORWARD,FFTW_ESTIMATE|FFTW_PRESERVE_INPUT) 206 get_plan(n0,n1,false,dst,src).fwd2(fftw_cast(dst), fftw_cast(src) ,n0,n1); local 227 get_plan(n0,n1,true,dst,src).inv2(fftw_cast(dst), fftw_cast(src) ,n0,n1); local [all...] |
/external/openssl/crypto/ec/ |
ecp_smpl.c | 649 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6; local 671 n0 = BN_CTX_get(ctx); 695 if (!field_sqr(group, n0, &b->Z, ctx)) goto end; 696 if (!field_mul(group, n1, &a->X, n0, ctx)) goto end; 699 if (!field_mul(group, n0, n0, &b->Z, ctx)) goto end; 700 if (!field_mul(group, n2, &a->Y, n0, ctx)) goto end; 714 if (!field_sqr(group, n0, &a->Z, ctx)) goto end; 715 if (!field_mul(group, n3, &b->X, n0, ctx)) goto end; 718 if (!field_mul(group, n0, n0, &a->Z, ctx)) goto end 813 BIGNUM *n0, *n1, *n2, *n3; local [all...] |
/external/openssl/crypto/bn/ |
bn_mont.c | 140 if (bn_mul_mont(r->d,a->d,b->d,mont->N.d,mont->n0,num)) 180 BN_ULONG *ap,*np,*rp,n0,v,carry; local 203 n0=mont->n0[0]; 215 t1 = rp[0] * (n0 & 0177777); 217 t2 = n0 & t2; 224 v=bn_mul_add_words(rp,np,nl,(rp[0]*n0)&BN_MASK2); 339 ctx->n0[0] = ctx->n0[1] = 0; 380 * n0[1], and we could use the #else case (with a shorter [all...] |
bn_div.c | 137 * in reply to ((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0 (I fail to 145 # define bn_div_words(n0,n1,d0) \ 149 : "a"(n1), "d"(n0), "g"(d0) \ 160 # define bn_div_words(n0,n1,d0) \ 164 : "a"(n1), "d"(n0), "g"(d0) \ 325 BN_ULONG n0,n1,rem=0; local 327 n0=wnump[0]; 329 if (n0 == d0) 331 else /* n0 < d0 */ 337 q=(BN_ULONG)(((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0) [all...] |
bn_exp.c | 687 const BN_ULONG *n0,int num,int power); 693 BN_ULONG *np=mont->N.d, *n0=mont->n0; local 702 bn_mul_mont(tmp.d,am.d,am.d,np,n0,top); 709 bn_mul_mont_gather5(tmp.d,am.d,powerbuf,np,n0,top,i-1); 716 bn_mul_mont(tmp.d,tmp.d,tmp.d,np,n0,top); 722 bn_mul_mont_gather5(tmp.d,am.d,powerbuf,np,n0,top,i-1); 726 bn_mul_mont(tmp.d,tmp.d,tmp.d,np,n0,top); 732 bn_mul_mont_gather5(tmp.d,am.d,powerbuf,np,n0,top,i-1); 734 bn_mul_mont(tmp.d,tmp.d,tmp.d,np,n0,top) [all...] |
/external/tremolo/Tremolo/ |
mdct.h | 59 extern void mdct_unroll_lap(int n0,int n1,
|
/external/eigen/test/eigen2/ |
eigen2_sparse_basic.cpp | 255 int n0 = ei_random<int>(1,rows-std::max(j0,j1)); local 256 VERIFY_IS_APPROX(m2.innerVectors(j0,n0), refMat2.block(0,j0,rows,n0)); 257 VERIFY_IS_APPROX(m2.innerVectors(j0,n0)+m2.innerVectors(j1,n0), 258 refMat2.block(0,j0,rows,n0)+refMat2.block(0,j1,rows,n0)); 259 //m2.innerVectors(j0,n0) = m2.innerVectors(j0,n0) + m2.innerVectors(j1,n0); [all...] |
/external/eigen/test/ |
sparse_basic.cpp | 257 int n0 = internal::random<int>(1,rows-(std::max)(j0,j1)); local 259 VERIFY_IS_APPROX(m2.innerVectors(j0,n0), refMat2.block(j0,0,n0,cols)); 261 VERIFY_IS_APPROX(m2.innerVectors(j0,n0), refMat2.block(0,j0,rows,n0)); 263 VERIFY_IS_APPROX(m2.innerVectors(j0,n0)+m2.innerVectors(j1,n0), 264 refMat2.block(j0,0,n0,cols)+refMat2.block(j1,0,n0,cols)); 266 VERIFY_IS_APPROX(m2.innerVectors(j0,n0)+m2.innerVectors(j1,n0) [all...] |
/external/openssl/crypto/ |
sparcv9cap.c | 17 int bn_mul_mont(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp, const BN_ULONG *np,const BN_ULONG *n0, int num) 19 int bn_mul_mont_fpu(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp, const BN_ULONG *np,const BN_ULONG *n0, int num); 20 int bn_mul_mont_int(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp, const BN_ULONG *np,const BN_ULONG *n0, int num); 25 return bn_mul_mont_fpu(rp,ap,bp,np,n0,num); 27 return bn_mul_mont_int(rp,ap,bp,np,n0,num);
|
/external/v8/src/ |
interface.cc | 191 int n0 = n > 0 ? n : 0; local 209 } else if (n < 0 || n0 >= 2 * FLAG_print_interface_depth) { 217 PrintF("%*s%s : ", n0 + 2, "", name->ToAsciiArray()); 218 interface->Print(n0 + 2); 220 PrintF("%*s}\n", n0, "");
|
/external/libvorbis/lib/ |
block.c | 745 int n0=ci->blocksizes[0]>>(hs+1); local 781 float *pcm=v->pcm[j]+prevCenter+n1/2-n0/2; 783 for(i=0;i<n0;i++) 784 pcm[i]=pcm[i]*w[n0-i-1] +p[i]*w[i]; 791 float *p=vb->pcm[j]+n1/2-n0/2; 792 for(i=0;i<n0;i++) 793 pcm[i]=pcm[i]*w[n0-i-1] +p[i]*w[i]; 794 for(;i<n1/2+n0/2;i++) 801 for(i=0;i<n0;i++) 802 pcm[i]=pcm[i]*w[n0-i-1] +p[i]*w[i] 939 int n0=ci->blocksizes[0]>>(hs+1); local [all...] |
/packages/apps/Camera/jni/feature_stab/db_vlvm/ |
db_utilities_poly.h | 302 double C[16],n0,n1,n2,n3,m; local 351 n0=db_sqr(C[0]) +db_sqr(C[1]) +db_sqr(C[2]) +db_sqr(C[3]); 358 if(n0>=n1 && n0>=n2 && n0>=n3) 360 m=db_SafeReciprocal(sqrt(n0));
|
/packages/apps/Gallery2/jni_mosaic/feature_stab/db_vlvm/ |
db_utilities_poly.h | 302 double C[16],n0,n1,n2,n3,m; local 351 n0=db_sqr(C[0]) +db_sqr(C[1]) +db_sqr(C[2]) +db_sqr(C[3]); 358 if(n0>=n1 && n0>=n2 && n0>=n3) 360 m=db_SafeReciprocal(sqrt(n0));
|
/packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
db_utilities_poly.h | 302 double C[16],n0,n1,n2,n3,m; local 351 n0=db_sqr(C[0]) +db_sqr(C[1]) +db_sqr(C[2]) +db_sqr(C[3]); 358 if(n0>=n1 && n0>=n2 && n0>=n3) 360 m=db_SafeReciprocal(sqrt(n0));
|
/bionic/libc/netbsd/resolv/ |
res_mkquery.c | 232 int n0, /* current offset in buffer */ 247 cp = buf + n0;
|
/dalvik/dexgen/src/com/android/dexgen/dex/code/ |
InsnFormat.java | 440 * @param n0 {@code 0..15;} low nibble 446 protected static short codeUnit(int n0, int n1, int n2, int n3) { 447 if ((n0 & 0xf) != n0) { 448 throw new IllegalArgumentException("n0 out of range 0..15"); 463 return (short) (n0 | (n1 << 4) | (n2 << 8) | (n3 << 12));
|
/dalvik/dx/src/com/android/dx/dex/code/ |
InsnFormat.java | 539 * @param n0 {@code 0..15;} low nibble 545 protected static short codeUnit(int n0, int n1, int n2, int n3) { 546 if ((n0 & 0xf) != n0) { 547 throw new IllegalArgumentException("n0 out of range 0..15"); 562 return (short) (n0 | (n1 << 4) | (n2 << 8) | (n3 << 12));
|