/external/v8/test/cctest/compiler/ |
H A D | test-node.cc | 39 Node* n0 = graph.NewNode(&dummy_operator); local 40 Node* n2 = graph.NewNode(&dummy_operator, n0); 42 CHECK(n0 == n2->InputAt(0)); 48 Node* n0 = graph.NewNode(&dummy_operator); local 50 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); 52 CHECK(n0 == n2->InputAt(0)); 59 Node* n0 = graph.NewNode(&dummy_operator); local 61 Node* n2 = graph.NewNode(&dummy_operator, n0, n1, n1); 63 CHECK(n0 == n2->InputAt(0)); 83 Node* n0 local 109 Node* n0 = graph.NewNode(&dummy_operator); local 120 Node* n0 = graph.NewNode(&dummy_operator); local 134 Node* n0 = graph.NewNode(&dummy_operator); local 160 Node* n0 = graph.NewNode(&dummy_operator); local 182 Node* n0 = graph.NewNode(&dummy_operator); local 235 Node* n0 = graph.NewNode(&dummy_operator); local 253 Node* n0 = graph.NewNode(&dummy_operator); local 283 Node* n0 = graph.NewNode(&dummy_operator); local 301 Node* n0 = graph.NewNode(&dummy_operator); local 344 Node* n0 = graph.NewNode(&dummy_operator); local 365 Node* n0 = graph.NewNode(&dummy_operator); local 402 Node* n0 = graph.NewNode(&dummy_operator); local 420 Node* n0 = graph.NewNode(&dummy_operator); local 443 Node* n0 = graph.NewNode(&dummy_operator); local 479 Node* n0 = graph.NewNode(&dummy_operator); local 521 Node* n0 = graph.NewNode(&dummy_operator); local 543 Node* n0 = graph.NewNode(&dummy_operator); local 561 Node* n0 = graph.NewNode(&dummy_operator); local 570 Node* n0 = graph.NewNode(&dummy_operator); local 578 Node* n0 = graph.NewNode(&dummy_operator); local 589 Node* n0 = graph.NewNode(&dummy_operator); local 600 Node* n0 = graph.NewNode(&dummy_operator); local 611 Node* n0 = graph.NewNode(&dummy_operator); local 620 Node* n0 = graph.NewNode(&dummy_operator); local 634 Node* n0 = graph.NewNode(&dummy_operator); local 644 Node* n0 = graph.NewNode(&dummy_operator); local 654 Node* n0 = graph.NewNode(&dummy_operator); local 670 Node* n0 = graph.NewNode(&dummy_operator); local 685 Node* n0 = graph.NewNode(&dummy_operator); local 699 Node* n0 = graph.NewNode(&dummy_operator); local 712 Node* n0 = graph.NewNode(&dummy_operator); local 730 Node* n0 = graph.NewNode(&dummy_operator); local 745 Node* n0 = graph.NewNode(&dummy_operator); local 759 Node* n0 = graph.NewNode(&dummy_operator); local 772 Node* n0 = graph.NewNode(&dummy_operator); local 784 Node* n0 = graph.NewNode(&dummy_operator); local 801 Node* n0 = graph.NewNode(&dummy_operator); local 830 Node* n0 = graph.NewNode(&dummy_operator); local [all...] |
H A D | test-node-algorithm.cc | 159 Node* n0 = graph.start_node(); local 160 Node* n1 = graph.NewNode(&dummy_operator, n0); 162 n0->AppendInput(graph.main_zone(), n2); 163 graph.SetStart(n0); 170 CHECK(n0->id() == node_visitor.nodes_[0]->id()); 218 Node* n0 = graph.start_node(); local 219 Node* n1 = graph.NewNode(&dummy_operator, n0); 220 Node* n2 = graph.NewNode(&dummy_operator, n0); 222 Node* n4 = graph.NewNode(&dummy_operator, n0); 224 n0 [all...] |
H A D | test-schedule.cc | 34 Node* n0 = graph.NewNode(&dummy_operator); local 40 schedule.AddNode(entry, n0); 43 CHECK_EQ(entry, schedule.block(n0)); 45 CHECK(schedule.SameBasicBlock(n0, n1)); 81 Node* n0 = graph.NewNode(&dummy_operator); local 82 Node* b = graph.NewNode(common.Branch(), n0); 105 Node* n0 = graph.NewNode(&dummy_operator); local 107 schedule.AddReturn(entry, n0); 119 Node* n0 = graph.NewNode(&dummy_operator); local 121 schedule.AddThrow(entry, n0); [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/moment/ |
H A D | FourthMoment.java | 97 double n0 = n; 100 ((n0 * n0) - 3 * (n0 -1)) * (nDevSq * nDevSq * (n0 - 1) * n0);
|
H A D | Kurtosis.java | 185 double n0 = length; 188 (n0 * (n0 + 1)) / ((n0 - 1) * (n0 - 2) * (n0 - 3)); 190 (3 * FastMath.pow(n0 - 1, 2.0)) / ((n0 - 2) * (n0 - 3));
|
H A D | Skewness.java | 111 double n0 = moment.getN(); 112 return (n0 * moment.m3) / 113 ((n0 - 1) * (n0 -2) * FastMath.sqrt(variance) * variance); 182 double n0 = length; 185 skew = (n0 / ((n0 - 1) * (n0 - 2))) * accum3;
|
H A D | ThirdMoment.java | 93 double n0 = n; 94 m3 = m3 - 3.0 * nDev * prevM2 + (n0 - 1) * (n0 - 2) * nDevSq * dev;
|
H A D | FirstMoment.java | 103 double n0 = n; 105 nDev = dev / n0;
|
/external/eigen/unsupported/Eigen/src/FFT/ |
H A D | ei_fftw_impl.h | 82 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/vpx_dsp/ |
H A D | prob.h | 54 static INLINE vpx_prob get_binary_prob(int n0, int n1) { argument 55 return get_prob(n0, n0 + n1);
|
/external/libunwind/tests/ |
H A D | Gia64-test-stack.c | 58 unw_word_t ip, sp, bsp, v0, v1, v2, v3, n0, n1, n2, n3, cfm, sof, sol, r32; local 83 n0 = n1 = n2 = n3 = 0; 86 || (ret = unw_get_reg (&c, UNW_IA64_NAT + reg, &n0)) < 0 98 n0 ? '*' : ' ', v0, n1 ? '*' : ' ', v1, 134 || (ret = unw_get_reg (&c, UNW_IA64_NAT + 33 + l, &n0)) < 0) 139 if (!n0) 144 if (n0)
|
/external/boringssl/src/crypto/ec/ |
H A D | simple.c | 616 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6; local 641 n0 = BN_CTX_get(ctx); 665 if (!field_sqr(group, n0, &b->Z, ctx) || 666 !field_mul(group, n1, &a->X, n0, ctx)) { 671 if (!field_mul(group, n0, n0, &b->Z, ctx) || 672 !field_mul(group, n2, &a->Y, n0, ctx)) { 686 if (!field_sqr(group, n0, &a->Z, ctx) || 687 !field_mul(group, n3, &b->X, n0, ctx)) { 692 if (!field_mul(group, n0, n 807 BIGNUM *n0, *n1, *n2, *n3; local [all...] |
/external/boringssl/src/crypto/bn/ |
H A D | montgomery.c | 168 to->n0[0] = from->n0[0]; 169 to->n0[1] = from->n0[1]; 199 * n0[1], and we could use the #else case (with a shorter R 243 mont->n0[0] = (Ri->top > 0) ? Ri->d[0] : 0; 244 mont->n0[1] = (Ri->top > 1) ? Ri->d[1] : 0; 276 mont->n0[0] = (Ri->top > 0) ? Ri->d[0] : 0; 277 mont->n0[1] = 0; 337 BN_ULONG *ap, *np, *rp, n0, 425 BN_ULONG *ap,*np,*rp,n0,v,carry; local [all...] |
H A D | div.c | 73 * in reply to ((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0 (I fail to 81 # define div_asm(n0,n1,d0) \ 85 : "a"(n1), "d"(n0), "g"(d0) \ 96 # define div_asm(n0,n1,d0) \ 100 : "a"(n1), "d"(n0), "g"(d0) \ 255 BN_ULONG n0, n1, rem = 0; local 257 n0 = wnump[0]; 259 if (n0 == d0) { 262 /* n0 < d0 */ 267 q = (BN_ULONG)(((((BN_ULLONG)n0) << BN_BITS [all...] |
/external/tremolo/Tremolo/ |
H A D | mdct.h | 59 extern void mdct_unroll_lap(int n0,int n1,
|
/external/eigen/test/ |
H A D | sparse_basic.cpp | 216 Index n0 = internal::random<Index>(1,rows-(std::max)(j0,j1)); local 218 VERIFY_IS_APPROX(m2.innerVectors(j0,n0), refMat2.block(j0,0,n0,cols)); 220 VERIFY_IS_APPROX(m2.innerVectors(j0,n0), refMat2.block(0,j0,rows,n0)); 222 VERIFY_IS_APPROX(m2.innerVectors(j0,n0)+m2.innerVectors(j1,n0), 223 refMat2.middleRows(j0,n0)+refMat2.middleRows(j1,n0)); 225 VERIFY_IS_APPROX(m2.innerVectors(j0,n0) 306 Index n0 = internal::random<Index>(1,rows-(std::max)(j0,j1)); local [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/ |
H A D | TestDotTreeGenerator.cs | 67 + @" n0 [label=""""];" + newline 74 + @" n0 -> n1 // """" -> ""*""" + newline 77 + @" n0 -> n4 // """" -> """"" + newline
|
/external/boringssl/src/crypto/bn/asm/ |
H A D | armv4-mont.pl | 64 $n0="r8"; 134 ldr $n0,[$_n0] @ &n0 138 ldr $n0,[$n0] @ *n0 142 str $n0,[$_n0] @ save n0 value 143 mul $n0,$alo,$n0 [all...] |
/external/iputils/ninfod/ |
H A D | 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/mesa3d/src/mesa/program/ |
H A D | 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 484 float n0, n1, n2, n3, n4; /* Noise contributions from the five corners */ local [all...] |
/external/boringssl/linux-arm/crypto/bn/ |
H A D | armv4-mont.S | 53 ldr r8,[r0,#14*4] @ &n0 57 ldr r8,[r8] @ *n0 61 str r8,[r0,#14*4] @ save n0 value 62 mul r8,r10,r8 @ "tp[0]"*n0 64 umlal r10,r12,r6,r8 @ np[0]*n0+"t[0]" 74 umlal r12,r14,r6,r8 @ np[j]*n0 84 ldr r8,[r0,#14*4] @ restore n0 104 umlal r10,r12,r6,r8 @ np[0]*n0+"tp[0]" 114 umlal r12,r14,r6,r8 @ np[j]*n0 127 ldr r8,[r0,#14*4] @ restore n0 [all...] |
/external/eigen/test/eigen2/ |
H A D | 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/v8/src/ |
H A D | interface.cc | 179 int n0 = n > 0 ? n : 0; local 199 } else if (n < 0 || n0 >= 2 * FLAG_print_interface_depth) { 207 PrintF("%*s%s : ", n0 + 2, "", name->ToAsciiArray()); 208 interface->Print(n0 + 2); 210 PrintF("%*s}\n", n0, "");
|
/external/libvpx/libvpx/vpx_dsp/mips/ |
H A D | idct32x32_msa.c | 15 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7; local 18 LD_SH8(input, 32, m0, n0, m1, n1, m2, n2, m3, n3); 20 TRANSPOSE8x8_SH_SH(m0, n0, m1, n1, m2, n2, m3, n3, 21 m0, n0, m1, n1, m2, n2, m3, n3); 24 ST_SH8(m0, n0, m1, n1, m2, n2, m3, n3, (tmp_buf), 8); 29 LD_SH8((input + 16), 32, m0, n0, m1, n1, m2, n2, m3, n3); 31 TRANSPOSE8x8_SH_SH(m0, n0, m1, n1, m2, n2, m3, n3, 32 m0, n0, m1, n1, m2, n2, m3, n3); 35 ST_SH4(m0, n0, m1, n1, (tmp_buf + 16 * 8), 8); 248 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n local 548 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7; local [all...] |
/external/libvorbis/lib/ |
H A D | 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 939 int n0=ci->blocksizes[0]>>(hs+1); local [all...] |