Searched defs:n0 (Results 1 - 25 of 39) sorted by relevance

12

/external/chromium_org/third_party/openssl/openssl/crypto/
H A Dsparcv9cap.c17 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) argument
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/openssl/crypto/
H A Dsparcv9cap.c17 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) argument
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/chromium_org/third_party/openssl/openssl/crypto/bn/
H A Dbn_div.c137 * 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_BITS
[all...]
H A Dbn_asm.c849 BN_ULONG c0,c1,ml,*tp,n0; local
861 n0 = *n0p;
897 ml = (c1*n0)&BN_MASK2;
941 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) argument
988 BN_ULONG c0,c1,*tp,n0=*n0p; local
1003 c0 = bn_mul_add_words(tp,np,num,tp[0]*n0);
1025 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) argument
H A Dbn_exp.c687 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,to
[all...]
H A Dbn_mont.c140 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[
[all...]
/external/chromium_org/v8/src/
H A Dinterface.cc207 int n0 = n > 0 ? n : 0; local
227 } else if (n < 0 || n0 >= 2 * FLAG_print_interface_depth) {
235 PrintF("%*s%s : ", n0 + 2, "", name->ToAsciiArray());
236 interface->Print(n0 + 2);
238 PrintF("%*s}\n", n0, "");
/external/eigen/test/eigen2/
H A Deigen2_hyperplane.cpp32 VectorType n0 = VectorType::Random(dim).normalized(); local
35 HyperplaneType pl0(n0, p0);
H A Deigen2_sparse_basic.cpp255 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/
H A Dsparse_basic.cpp257 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)
[all...]
H A Dgeo_hyperplane.cpp33 VectorType n0 = VectorType::Random(dim).normalized(); local
36 HyperplaneType pl0(n0, p0);
/external/eigen/unsupported/Eigen/src/FFT/
H A Dei_fftw_impl.h82 void fwd2( complex_type * dst,complex_type * src,int n0,int n1) { argument
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) { argument
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) { argument
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) { argument
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) { argument
166 if (m_plan==NULL) m_plan = fftwl_plan_dft_2d(n0,n
170 inv2( complex_type * dst,complex_type * src,int n0,int n1) argument
204 fwd2(Complex * dst, const Complex * src, int n0,int n1) argument
206 get_plan(n0,n1,false,dst,src).fwd2(fftw_cast(dst), fftw_cast(src) ,n0,n1); local
225 inv2(Complex * dst, const Complex * src, int n0,int n1) argument
227 get_plan(n0,n1,true,dst,src).inv2(fftw_cast(dst), fftw_cast(src) ,n0,n1); local
248 get_plan(int n0,int n1,bool inverse,void * dst,const void * src) argument
[all...]
/external/libvpx/libvpx/vp9/common/
H A Dvp9_treecoder.h73 static INLINE vp9_prob get_binary_prob(int n0, int n1) { argument
74 return get_prob(n0, n0 + n1);
/external/openssl/crypto/bn/
H A Dbn_div.c137 * 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_BITS
[all...]
H A Dbn_asm.c849 BN_ULONG c0,c1,ml,*tp,n0; local
861 n0 = *n0p;
897 ml = (c1*n0)&BN_MASK2;
941 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) argument
988 BN_ULONG c0,c1,*tp,n0=*n0p; local
1003 c0 = bn_mul_add_words(tp,np,num,tp[0]*n0);
1025 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) argument
H A Dbn_exp.c687 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,to
[all...]
H A Dbn_mont.c140 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[
[all...]
/external/v8/src/
H A Dinterface.cc191 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/chromium_org/chrome/browser/devtools/adb/
H A Dandroid_rsa.cc231 uint64 n0 = n[0]; local
236 pkey.n0inv = 0 - ModInverse(n0, GG_LONGLONG(0x100000000));
/external/dexmaker/src/dx/java/com/android/dx/dex/code/
H A DInsnFormat.java540 * @param n0 {@code 0..15;} low nibble
546 protected static short codeUnit(int n0, int n1, int n2, int n3) { argument
547 if ((n0 & 0xf) != n0) {
548 throw new IllegalArgumentException("n0 out of range 0..15");
563 return (short) (n0 | (n1 << 4) | (n2 << 8) | (n3 << 12));
/external/iputils/ninfod/
H A Dninfod_name.c212 const char *s0 = s, *n0 = n; local
219 if (*(s0 + slen - 1) || *(n0 + nlen - 1))
221 while (s < s0 + slen && n < n0 + nlen) {
224 if (s + *s + 1 > s0 + slen || n + *n + 1 > n0 + nlen)
236 if (n == n0 + nlen - 1) {
238 } else if (n + 1 == n0 + nlen - 1) {
/external/libvorbis/lib/
H A Dblock.c745 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
939 int n0=ci->blocksizes[0]>>(hs+1); local
[all...]
/external/opencv/cxcore/src/
H A Dcxdxt.cpp221 icvDFTInit( int n0, int nf, int* factors, int* itab, int elem_size, void* _wave, int inv_itab ) argument
230 if( n0 <= 5 )
233 itab[n0-1] = n0-1;
235 if( n0 != 4 )
237 for( i = 1; i < n0-1; i++ )
245 if( n0 == 5 )
252 if( n0 != 4 )
311 for( i = n, j = radix[2]; i < n0; )
315 if( (i += n) >= n0 )
[all...]
/external/chromium_org/third_party/openssl/openssl/crypto/ec/
H A Decp_smpl.c649 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, n
813 BIGNUM *n0, *n1, *n2, *n3; local
[all...]
/external/openssl/crypto/ec/
H A Decp_smpl.c649 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, n
813 BIGNUM *n0, *n1, *n2, *n3; local
[all...]

Completed in 490 milliseconds

12