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

1 2 3 4 5 6 7

  /external/chromium_org/third_party/openssl/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...]
  /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...]
  /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/chromium_org/third_party/openssl/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/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/chromium_org/third_party/openssl/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...]
  /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...]
  /external/tremolo/Tremolo/
mdct.h 59 extern void mdct_unroll_lap(int n0,int n1,
  /external/libvpx/libvpx/vp9/common/
vp9_treecoder.h 73 static INLINE vp9_prob get_binary_prob(int n0, int n1) {
74 return get_prob(n0, n0 + n1);
  /external/iputils/ninfod/
ninfod_name.c 212 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/chromium_org/third_party/mesa/src/src/mesa/program/
prog_noise.c 220 float n0, n1; local
225 n0 = t0 * t0 * grad1(perm[i0 & 0xff], x0);
233 return 0.25f * (n0 + n1);
244 float n0, n1, n2; /* Noise contributions from the three corners */ local
291 n0 = 0.0f;
294 n0 = t0 * t0 * grad2(perm[ii + perm[jj]], x0, y0);
315 return 40.0f * (n0 + n1 + n2); /* TODO: The scale factor is preliminary! */
327 float n0, n1, n2, n3; /* Noise contributions from the four corners */ local
433 n0 = 0.0f;
436 n0 = t0 * t0 * grad3(perm[ii + perm[jj + perm[kk]]], x0, y0, z0)
484 float n0, n1, n2, n3, n4; \/* Noise contributions from the five corners *\/ local
    [all...]
  /external/mesa3d/src/mesa/program/
prog_noise.c 220 float n0, n1; local
225 n0 = t0 * t0 * grad1(perm[i0 & 0xff], x0);
233 return 0.25f * (n0 + n1);
244 float n0, n1, n2; /* Noise contributions from the three corners */ local
291 n0 = 0.0f;
294 n0 = t0 * t0 * grad2(perm[ii + perm[jj]], x0, y0);
315 return 40.0f * (n0 + n1 + n2); /* TODO: The scale factor is preliminary! */
327 float n0, n1, n2, n3; /* Noise contributions from the four corners */ local
433 n0 = 0.0f;
436 n0 = t0 * t0 * grad3(perm[ii + perm[jj + perm[kk]]], x0, y0, z0)
484 float n0, n1, n2, n3, n4; \/* Noise contributions from the five corners *\/ local
    [all...]
  /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/chromium_org/third_party/openssl/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/chromium_org/v8/src/
interface.cc 207 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/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);

Completed in 409 milliseconds

1 2 3 4 5 6 7