| /external/clang/test/Modules/ |
| macros2.c | 10 int n0 = TOP_OTHER_DEF_RIGHT_UNDEF; // ok variable
|
| /bionic/libc/upstream-openbsd/lib/libc/gdtoa/ |
| gethex.c | 48 int big, esign, havedig, irv, j, k, n, n0, nbits, up, zret; local
190 n0 = n = nbits >> kshift;
198 for(j = 0; j < n0; ++j)
200 if (n > n0)
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/moment/ |
| FirstMoment.java | 103 double n0 = n; local
105 nDev = dev / n0;
|
| FourthMoment.java | 97 double n0 = n; local
100 ((n0 * n0) - 3 * (n0 -1)) * (nDevSq * nDevSq * (n0 - 1) * n0);
|
| ThirdMoment.java | 93 double n0 = n; local
94 m3 = m3 - 3.0 * nDev * prevM2 + (n0 - 1) * (n0 - 2) * nDevSq * dev;
|
| Kurtosis.java | 185 double n0 = length; local
188 (n0 * (n0 + 1)) / ((n0 - 1) * (n0 - 2) * (n0 - 3));
190 (3 * FastMath.pow(n0 - 1, 2.0)) / ((n0 - 2) * (n0 - 3));
|
| Skewness.java | 111 double n0 = moment.getN(); local
112 return (n0 * moment.m3) /
113 ((n0 - 1) * (n0 -2) * FastMath.sqrt(variance) * variance);
182 double n0 = length; local
185 skew = (n0 / ((n0 - 1) * (n0 - 2))) * accum3;
|
| /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/libunwind/tests/ |
| 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/v8/test/cctest/compiler/ |
| test-node.cc | 146 Node* n0 = graph.NewNode(&dummy_operator0); local
147 Node* n1 = graph.NewNode(&dummy_operator1, n0);
148 Node* n2 = graph.NewNode(&dummy_operator1, n0);
151 CHECK_USES(n0, n1, n2);
153 CHECK_INPUTS(n1, n0);
154 CHECK_INPUTS(n2, n0);
156 n0->ReplaceUses(n3);
158 CHECK_USES(n0, NONE);
171 Node* n0 = graph.NewNode(&dummy_operator0); local
172 Node* n1 = graph.NewNode(&dummy_operator1, n0);
195 Node* n0 = graph.NewNode(&dummy_operator0); local
223 Node* n0 = graph.NewNode(&dummy_operator0); local
241 Node* n0 = graph.NewNode(&dummy_operator0); local
272 Node* n0 = graph.NewNode(&dummy_operator0); local
294 Node* n0 = graph.NewNode(&dummy_operator0); local
322 Node* n0 = graph.NewNode(&dummy_operator0); local
352 Node* n0 = graph.NewNode(&dummy_operator0); local
374 Node* n0 = graph.NewNode(&dummy_operator0); local
401 Node* n0 = graph.NewNode(&dummy_operator0); local
424 Node* n0 = graph.NewNode(&dummy_operator0); local
452 Node* n0 = graph.NewNode(&dummy_operator0); local
471 Node* n0 = graph.NewNode(&dummy_operator0); local
479 Node* n0 = graph.NewNode(&dummy_operator0); local
487 Node* n0 = graph.NewNode(&dummy_operator0); local
497 Node* n0 = graph.NewNode(&dummy_operator0); local
507 Node* n0 = graph.NewNode(&dummy_operator0); local
517 Node* n0 = graph.NewNode(&dummy_operator0); local
525 Node* n0 = graph.NewNode(&dummy_operator0); local
539 Node* n0 = graph.NewNode(&dummy_operator0); local
551 Node* n0 = graph.NewNode(&dummy_operator0); local
561 Node* n0 = graph.NewNode(&dummy_operator0); local
575 Node* n0 = graph.NewNode(&dummy_operator0); local
589 Node* n0 = graph.NewNode(&dummy_operator0); local
603 Node* n0 = graph.NewNode(&dummy_operator0); local
615 Node* n0 = graph.NewNode(&dummy_operator0); local
633 Node* n0 = graph.NewNode(&dummy_operator0); local
646 Node* n0 = graph.NewNode(&dummy_operator0); local
659 Node* n0 = graph.NewNode(&dummy_operator0); local
672 Node* n0 = graph.NewNode(&dummy_operator0); local
684 Node* n0 = graph.NewNode(&dummy_operator0); local
702 Node* n0 = graph.NewNode(&dummy_operator0); local
731 Node* n0 = graph.NewNode(&dummy_operator0); local
[all...] |
| /external/v8/test/unittests/compiler/ |
| node-unittest.cc | 46 Node* n0 = Node::New(zone(), 0, &kOp0, 0, nullptr, false); local
47 EXPECT_EQ(0, n0->UseCount());
48 EXPECT_EQ(0, n0->InputCount());
49 Node* n1 = Node::New(zone(), 1, &kOp1, 1, &n0, false);
50 EXPECT_EQ(1, n0->UseCount());
51 EXPECT_THAT(n0->uses(), UnorderedElementsAre(n1));
54 EXPECT_EQ(n0, n1->InputAt(0));
55 Node* n0_n1[] = {n0, n1};
57 EXPECT_EQ(2, n0->UseCount());
58 EXPECT_THAT(n0->uses(), UnorderedElementsAre(n1, n2))
73 Node* n0 = Node::New(zone(), 0, &kOp0, 0, nullptr, false); local
80 Node* n0 = Node::New(zone(), 0, &kOp0, 0, nullptr, false); local
95 Node* n0 = Node::New(zone(), 0, &kOp0, 0, nullptr, false); local
102 Node* n0 = Node::New(zone(), 0, &kOp0, 0, nullptr, false); local
111 Node* n0 = Node::New(zone(), 0, &kOp0, 0, nullptr, false); local
136 Node* n0 = Node::New(zone(), 0, &kOp0, 0, nullptr, false); local
152 Node* n0 = Node::New(zone(), 0, &kOp0, 0, nullptr, false); local
156 node->AppendInput(zone(), n0); local
161 node->AppendInput(zone(), n0); local
163 node->AppendInput(zone(), n0); local
171 Node* n0 = Node::New(zone(), 0, &kOp0, 0, nullptr, false); local
185 node->AppendInput(zone(), n0); local
241 Node* n0 = Node::New(zone(), 0, &kOp0, 0, nullptr, false); local
[all...] |
| value-numbering-reducer-unittest.cc | 55 Node* n0 = graph()->NewNode(&kOp0); local
56 Node* n1 = graph()->NewNode(&kOp1, n0);
59 EXPECT_FALSE(Reduce(graph()->NewNode(&kOp1, n0)).Changed());
65 Node* n0 = graph()->NewNode(&op); local
67 EXPECT_FALSE(Reduce(n0).Changed());
|
| graph-unittest.cc | 126 Node* n0 = graph()->NewNode(&kDummyOperator); local
128 EXPECT_NE(n0, n1);
129 EXPECT_LT(0u, n0->id());
131 EXPECT_NE(n0->id(), n1->id());
132 EXPECT_EQ(&kDummyOperator, n0->op());
|
| /external/boringssl/src/crypto/bn/ |
| montgomery.c | 160 to->n0[0] = from->n0[0];
161 to->n0[1] = from->n0[1];
194 * n0[1], and we could use the #else case (with a shorter R
238 mont->n0[0] = (Ri->top > 0) ? Ri->d[0] : 0;
239 mont->n0[1] = (Ri->top > 1) ? Ri->d[1] : 0;
271 mont->n0[0] = (Ri->top > 0) ? Ri->d[0] : 0;
272 mont->n0[1] = 0;
333 BN_ULONG *ap, *np, *rp, n0, v, carry
421 BN_ULONG *ap,*np,*rp,n0,v,carry; local
[all...] |
| 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_BITS2) | n1) / d0)
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_hyperplane.cpp | 32 VectorType n0 = VectorType::Random(dim).normalized(); local
35 HyperplaneType pl0(n0, p0);
|
| 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/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) {
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/common/ |
| vp9_entropy.c | 751 const int n0 = counts[i][j][k][l][ZERO_TOKEN]; local
757 { n0, n1 + n2 },
[all...] |
| /external/boringssl/src/crypto/ec/ |
| simple.c | 568 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6; local
593 n0 = BN_CTX_get(ctx);
617 if (!field_sqr(group, n0, &b->Z, ctx) ||
618 !field_mul(group, n1, &a->X, n0, ctx)) {
623 if (!field_mul(group, n0, n0, &b->Z, ctx) ||
624 !field_mul(group, n2, &a->Y, n0, ctx)) {
638 if (!field_sqr(group, n0, &a->Z, ctx) ||
639 !field_mul(group, n3, &b->X, n0, ctx)) {
644 if (!field_mul(group, n0, n0, &a->Z, ctx) |
759 BIGNUM *n0, *n1, *n2, *n3; local
[all...] |
| /external/boringssl/src/include/openssl/ |
| bn.h | 842 BN_ULONG n0[2]; \/* least significant words of (R*Ri-1)\/N *\/ member in struct:bn_mont_ctx_st
[all...] |
| /external/eigen/test/ |
| geo_hyperplane.cpp | 32 VectorType n0 = VectorType::Random(dim).normalized(); local
35 HyperplaneType pl0(n0, p0);
|
| sparse_basic.cpp | 248 Index n0 = internal::random<Index>(1,rows-(std::max)(j0,j1)); local
250 VERIFY_IS_APPROX(m2.innerVectors(j0,n0), refMat2.block(j0,0,n0,cols));
252 VERIFY_IS_APPROX(m2.innerVectors(j0,n0), refMat2.block(0,j0,rows,n0));
254 VERIFY_IS_APPROX(m2.innerVectors(j0,n0)+m2.innerVectors(j1,n0),
255 refMat2.middleRows(j0,n0)+refMat2.middleRows(j1,n0));
257 VERIFY_IS_APPROX(m2.innerVectors(j0,n0)+m2.innerVectors(j1,n0)
338 Index n0 = internal::random<Index>(1,rows-(std::max)(j0,j1)); local
[all...] |
| /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/libvpx/libvpx/vp9/common/ |
| vp9_entropy.c | 785 const int n0 = counts[i][j][k][l][ZERO_TOKEN]; local
[all...] |
