HomeSort by relevance Sort by last modified time
    Searched refs:n0 (Results 26 - 50 of 126) sorted by null

12 3 4 5 6

  /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...]
  /external/chromium_org/third_party/openssl/openssl/crypto/bn/asm/
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
alpha-mont.pl 23 $n0="a4"; # const BN_ULONG *n0,
84 ldq $n0,0($n0)
92 mulq $lo0,$n0,$m1
180 mulq $lo0,$n0,$m1
mips3-mont.pl 26 $n0="a4"; # const BN_ULONG *n0,
75 ld $n0,0($n0)
99 dmultu $lo0,$n0
183 dmultu $lo0,$n0
mips-mont.pl 94 $n0=$a4; # const BN_ULONG *n0,
128 lw $n0,16($sp)
168 $LD $n0,0($n0)
184 $MULTU $lo0,$n0
268 $MULTU $lo0,$n0
  /external/openssl/crypto/bn/asm/
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
alpha-mont.pl 23 $n0="a4"; # const BN_ULONG *n0,
84 ldq $n0,0($n0)
92 mulq $lo0,$n0,$m1
180 mulq $lo0,$n0,$m1
mips3-mont.pl 26 $n0="a4"; # const BN_ULONG *n0,
75 ld $n0,0($n0)
99 dmultu $lo0,$n0
183 dmultu $lo0,$n0
  /external/chromium_org/third_party/openssl/openssl/crypto/bn/
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/openssl/crypto/bn/
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...]
  /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/Camera2/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/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 538 * @param n0 {@code 0..15;} low nibble
544 protected static short codeUnit(int n0, int n1, int n2, int n3) {
545 if ((n0 & 0xf) != n0) {
546 throw new IllegalArgumentException("n0 out of range 0..15");
561 return (short) (n0 | (n1 << 4) | (n2 << 8) | (n3 << 12));
  /external/dexmaker/src/dx/java/com/android/dx/dex/code/
InsnFormat.java 540 * @param n0 {@code 0..15;} low nibble
546 protected static short codeUnit(int n0, int n1, int n2, int n3) {
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/valgrind/main/VEX/priv/
main_util.c 267 /* Convert N0 into ascii in BUF, which is assumed to be big enough (at
270 void convert_int ( /*OUT*/HChar* buf, Long n0,
280 if (n0 < 0) {
282 u0 = (ULong)(-n0);
284 u0 = (ULong)(n0);
287 u0 = (ULong)n0;
  /external/opencv/cxcore/src/
cxdxt.cpp 221 icvDFTInit( int n0, int nf, int* factors, int* itab, int elem_size, void* _wave, int inv_itab )
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/tremolo/Tremolo/
mdct.c 468 void mdct_unroll_lap(int n0,int n1,
479 DATA_TYPE *l=in+(W&&lW ? n1>>1 : n0>>1);
480 DATA_TYPE *r=right+(lW ? n1>>2 : n0>>2);
482 LOOKUP_T *wR=(W && lW ? w1+(n1>>1) : w0+(n0>>1));
485 int preLap=(lW && !W ? (n1>>2)-(n0>>2) : 0 );
486 int halfLap=(lW && W ? (n1>>2) : (n0>>2) );
487 int postLap=(!lW && W ? (n1>>2)-(n0>>2) : 0 );

Completed in 910 milliseconds

12 3 4 5 6