Home
last modified time | relevance | path

Searched refs:n0 (Results 1 – 25 of 87) sorted by relevance

1234

/external/v8/test/cctest/compiler/
Dtest-node.cc146 Node* n0 = graph.NewNode(&dummy_operator0); in TEST() local
147 Node* n1 = graph.NewNode(&dummy_operator1, n0); in TEST()
148 Node* n2 = graph.NewNode(&dummy_operator1, n0); in TEST()
151 CHECK_USES(n0, n1, n2); in TEST()
153 CHECK_INPUTS(n1, n0); in TEST()
154 CHECK_INPUTS(n2, n0); in TEST()
156 n0->ReplaceUses(n3); in TEST()
158 CHECK_USES(n0, NONE); in TEST()
171 Node* n0 = graph.NewNode(&dummy_operator0); in TEST() local
172 Node* n1 = graph.NewNode(&dummy_operator1, n0); in TEST()
[all …]
/external/v8/test/unittests/compiler/
Dnode-unittest.cc46 Node* n0 = Node::New(zone(), 0, &kOp0, 0, nullptr, false); in TEST_F() local
47 EXPECT_EQ(0, n0->UseCount()); in TEST_F()
48 EXPECT_EQ(0, n0->InputCount()); in TEST_F()
49 Node* n1 = Node::New(zone(), 1, &kOp1, 1, &n0, false); in TEST_F()
50 EXPECT_EQ(1, n0->UseCount()); in TEST_F()
51 EXPECT_THAT(n0->uses(), UnorderedElementsAre(n1)); in TEST_F()
54 EXPECT_EQ(n0, n1->InputAt(0)); in TEST_F()
55 Node* n0_n1[] = {n0, n1}; in TEST_F()
57 EXPECT_EQ(2, n0->UseCount()); in TEST_F()
58 EXPECT_THAT(n0->uses(), UnorderedElementsAre(n1, n2)); in TEST_F()
[all …]
Dgraph-unittest.cc126 Node* n0 = graph()->NewNode(&kDummyOperator); in TEST_F() local
128 EXPECT_NE(n0, n1); in TEST_F()
129 EXPECT_LT(0u, n0->id()); in TEST_F()
131 EXPECT_NE(n0->id(), n1->id()); in TEST_F()
132 EXPECT_EQ(&kDummyOperator, n0->op()); in TEST_F()
Dvalue-numbering-reducer-unittest.cc55 Node* n0 = graph()->NewNode(&kOp0); in TEST_F() local
56 Node* n1 = graph()->NewNode(&kOp1, n0); in TEST_F()
59 EXPECT_FALSE(Reduce(graph()->NewNode(&kOp1, n0)).Changed()); in TEST_F()
65 Node* n0 = graph()->NewNode(&op); in TEST_F() local
67 EXPECT_FALSE(Reduce(n0).Changed()); in TEST_F()
/external/boringssl/src/crypto/bn/asm/
Darmv8-mont.pl56 $n0="x4"; # const BN_ULONG *n0,
81 ldr $n0,[$n0] // *n0
91 mul $m1,$lo0,$n0 // "tp[0]"*n0
162 mul $m1,$lo0,$n0
299 ldr $n0,[$n0] // *n0
329 str $n0,[x29,#112] // offload n0
497 mov $n0,$a0
542 mul $t0,$a0,$n0
544 mul $t1,$a1,$n0
546 mul $t2,$a2,$n0
[all …]
Darmv4-mont.pl64 $n0="r8";
134 ldr $n0,[$_n0] @ &n0
138 ldr $n0,[$n0] @ *n0
142 str $n0,[$_n0] @ save n0 value
143 mul $n0,$alo,$n0 @ "tp[0]"*n0
145 umlal $alo,$nlo,$nj,$n0 @ np[0]*n0+"t[0]"
155 umlal $nlo,$nhi,$nj,$n0 @ np[j]*n0
165 ldr $n0,[$_n0] @ restore n0
183 mul $n0,$alo,$n0
185 umlal $alo,$nlo,$nj,$n0 @ np[0]*n0+"tp[0]"
[all …]
Dx86_64-mont.pl68 $n0="%r8"; # const BN_ULONG *n0,
124 mov ($n0),$n0 # pull n0[0] value
131 mov $n0,$m1
136 imulq $lo0,$m1 # "tp[0]"*n0
192 mov $n0,$m1
199 imulq $lo0,$m1 # tp[0]*n0
336 mov ($n0),$n0 # pull n0[0] value
343 mov $n0,$m1
348 imulq $A[0],$m1 # "tp[0]"*n0
480 mov $n0,$m1
[all …]
/external/boringssl/src/crypto/ec/
Dsimple.c568 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6; in ec_GFp_simple_add() local
593 n0 = BN_CTX_get(ctx); in ec_GFp_simple_add()
617 if (!field_sqr(group, n0, &b->Z, ctx) || in ec_GFp_simple_add()
618 !field_mul(group, n1, &a->X, n0, ctx)) { in ec_GFp_simple_add()
623 if (!field_mul(group, n0, n0, &b->Z, ctx) || in ec_GFp_simple_add()
624 !field_mul(group, n2, &a->Y, n0, ctx)) { in ec_GFp_simple_add()
638 if (!field_sqr(group, n0, &a->Z, ctx) || in ec_GFp_simple_add()
639 !field_mul(group, n3, &b->X, n0, ctx)) { in ec_GFp_simple_add()
644 if (!field_mul(group, n0, n0, &a->Z, ctx) || in ec_GFp_simple_add()
645 !field_mul(group, n4, &b->Y, n0, ctx)) { in ec_GFp_simple_add()
[all …]
/external/eigen/unsupported/Eigen/src/FFT/
Dei_fftw_impl.h82 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_PRESERV…
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_PRESER…
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…
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_PRESERV…
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_PRESERV…
[all …]
/external/eigen/test/
Dsparse_basic.cpp248 Index n0 = internal::random<Index>(1,rows-(std::max)(j0,j1)); in sparse_basic() local
250 VERIFY_IS_APPROX(m2.innerVectors(j0,n0), refMat2.block(j0,0,n0,cols)); in sparse_basic()
252 VERIFY_IS_APPROX(m2.innerVectors(j0,n0), refMat2.block(0,j0,rows,n0)); in sparse_basic()
254 VERIFY_IS_APPROX(m2.innerVectors(j0,n0)+m2.innerVectors(j1,n0), in sparse_basic()
255 refMat2.middleRows(j0,n0)+refMat2.middleRows(j1,n0)); in sparse_basic()
257 VERIFY_IS_APPROX(m2.innerVectors(j0,n0)+m2.innerVectors(j1,n0), in sparse_basic()
258 refMat2.block(0,j0,rows,n0)+refMat2.block(0,j1,rows,n0)); in sparse_basic()
262 m2.innerVectors(j0,n0) = m2.innerVectors(j0,n0) + m2.innerVectors(j1,n0); in sparse_basic()
264 refMat2.middleRows(j0,n0) = (refMat2.middleRows(j0,n0) + refMat2.middleRows(j1,n0)).eval(); in sparse_basic()
266 refMat2.middleCols(j0,n0) = (refMat2.middleCols(j0,n0) + refMat2.middleCols(j1,n0)).eval(); in sparse_basic()
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/moment/
DKurtosis.java185 double n0 = length; in evaluate() local
188 (n0 * (n0 + 1)) / ((n0 - 1) * (n0 - 2) * (n0 - 3)); in evaluate()
190 (3 * FastMath.pow(n0 - 1, 2.0)) / ((n0 - 2) * (n0 - 3)); in evaluate()
DSkewness.java111 double n0 = moment.getN(); in getResult() local
112 return (n0 * moment.m3) / in getResult()
113 ((n0 - 1) * (n0 -2) * FastMath.sqrt(variance) * variance); in getResult()
182 double n0 = length; in evaluate() local
185 skew = (n0 / ((n0 - 1) * (n0 - 2))) * accum3; in evaluate()
DFourthMoment.java97 double n0 = n; in increment() local
100 ((n0 * n0) - 3 * (n0 -1)) * (nDevSq * nDevSq * (n0 - 1) * n0); in increment()
DThirdMoment.java93 double n0 = n; in increment() local
94 m3 = m3 - 3.0 * nDev * prevM2 + (n0 - 1) * (n0 - 2) * nDevSq * dev; in increment()
/external/boringssl/src/crypto/bn/
Dmontgomery.c160 to->n0[0] = from->n0[0]; in BN_MONT_CTX_copy()
161 to->n0[1] = from->n0[1]; in BN_MONT_CTX_copy()
238 mont->n0[0] = (Ri->top > 0) ? Ri->d[0] : 0; in BN_MONT_CTX_set()
239 mont->n0[1] = (Ri->top > 1) ? Ri->d[1] : 0; in BN_MONT_CTX_set()
271 mont->n0[0] = (Ri->top > 0) ? Ri->d[0] : 0; in BN_MONT_CTX_set()
272 mont->n0[1] = 0; in BN_MONT_CTX_set()
333 BN_ULONG *ap, *np, *rp, n0, v, carry;
358 n0 = mont->n0[0];
361 v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2);
421 BN_ULONG *ap,*np,*rp,n0,v,carry; in BN_from_montgomery_word() local
[all …]
Ddiv.c81 # define div_asm(n0,n1,d0) \ argument
85 : "a"(n1), "d"(n0), "g"(d0) \
96 # define div_asm(n0,n1,d0) \ argument
100 : "a"(n1), "d"(n0), "g"(d0) \
255 BN_ULONG n0, n1, rem = 0; in BN_div() local
257 n0 = wnump[0]; in BN_div()
259 if (n0 == d0) { in BN_div()
267 q = (BN_ULONG)(((((BN_ULLONG)n0) << BN_BITS2) | n1) / d0); in BN_div()
269 q = div_asm(n0, n1, d0); in BN_div()
295 q = div_asm(n0, n1, d0); in BN_div()
[all …]
Dexponentiation.c128 const BN_ULONG *np, const BN_ULONG *n0, int num,
133 const BN_ULONG *np, const BN_ULONG *n0, int num, int power);
136 const BN_ULONG *n0, int num);
914 RSAZ_1024_mod_exp_avx2(rr->d, a->d, p->d, m->d, mont->RR.d, mont->n0[0]); in BN_mod_exp_mont_consttime()
924 RSAZ_512_mod_exp(rr->d, a->d, p->d, m->d, mont->n0[0], mont->RR.d); in BN_mod_exp_mont_consttime()
1011 const BN_ULONG *np = mont->N.d, *n0 = mont->n0, *np2; in BN_mod_exp_mont_consttime() local
1034 bn_mul_mont(tmp.d, am.d, am.d, np, n0, top); in BN_mod_exp_mont_consttime()
1039 bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top); in BN_mod_exp_mont_consttime()
1044 bn_mul_mont_gather5(tmp.d, am.d, powerbuf, np2, n0, top, i - 1); in BN_mod_exp_mont_consttime()
1047 bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top); in BN_mod_exp_mont_consttime()
[all …]
/external/opencv3/modules/cudev/include/opencv2/cudev/functional/
Dtuple_adapter.hpp78 template <class Op, int n0, int n1> struct BinaryTupleAdapter
87 return op(get<n0>(t), get<n1>(t)); in operator ()()
91 template <int n0, int n1, class Op>
92 __host__ __device__ BinaryTupleAdapter<Op, n0, n1> binaryTupleAdapter(const Op& op) in binaryTupleAdapter()
94 BinaryTupleAdapter<Op, n0, n1> a; in binaryTupleAdapter()
/external/libunwind/tests/
DGia64-test-stack.c58 unw_word_t ip, sp, bsp, v0, v1, v2, v3, n0, n1, n2, n3, cfm, sof, sol, r32; in do_unwind_tests() local
83 n0 = n1 = n2 = n3 = 0; in do_unwind_tests()
86 || (ret = unw_get_reg (&c, UNW_IA64_NAT + reg, &n0)) < 0 in do_unwind_tests()
98 n0 ? '*' : ' ', v0, n1 ? '*' : ' ', v1, in do_unwind_tests()
134 || (ret = unw_get_reg (&c, UNW_IA64_NAT + 33 + l, &n0)) < 0) in do_unwind_tests()
139 if (!n0) in do_unwind_tests()
144 if (n0) in do_unwind_tests()
/external/mesa3d/src/mesa/program/
Dprog_noise.c220 float n0, n1; in _mesa_noise1() local
225 n0 = t0 * t0 * grad1(perm[i0 & 0xff], x0); in _mesa_noise1()
233 return 0.25f * (n0 + n1); in _mesa_noise1()
244 float n0, n1, n2; /* Noise contributions from the three corners */ in _mesa_noise2() local
291 n0 = 0.0f; in _mesa_noise2()
294 n0 = t0 * t0 * grad2(perm[ii + perm[jj]], x0, y0); in _mesa_noise2()
315 return 40.0f * (n0 + n1 + n2); /* TODO: The scale factor is preliminary! */ in _mesa_noise2()
327 float n0, n1, n2, n3; /* Noise contributions from the four corners */ in _mesa_noise3() local
433 n0 = 0.0f; in _mesa_noise3()
436 n0 = t0 * t0 * grad3(perm[ii + perm[jj + perm[kk]]], x0, y0, z0); in _mesa_noise3()
[all …]
/external/boringssl/linux-arm/crypto/bn/
Darmv4-mont.S54 ldr r8,[r0,#14*4] @ &n0
58 ldr r8,[r8] @ *n0
62 str r8,[r0,#14*4] @ save n0 value
63 mul r8,r10,r8 @ "tp[0]"*n0
65 umlal r10,r12,r6,r8 @ np[0]*n0+"t[0]"
75 umlal r12,r14,r6,r8 @ np[j]*n0
85 ldr r8,[r0,#14*4] @ restore n0
105 umlal r10,r12,r6,r8 @ np[0]*n0+"tp[0]"
115 umlal r12,r14,r6,r8 @ np[j]*n0
128 ldr r8,[r0,#14*4] @ restore n0
/external/libvorbis/lib/
Dblock.c745 int n0=ci->blocksizes[0]>>(hs+1); in vorbis_synthesis_blockin() local
781 float *pcm=v->pcm[j]+prevCenter+n1/2-n0/2; in vorbis_synthesis_blockin()
783 for(i=0;i<n0;i++) in vorbis_synthesis_blockin()
784 pcm[i]=pcm[i]*w[n0-i-1] +p[i]*w[i]; in vorbis_synthesis_blockin()
791 float *p=vb->pcm[j]+n1/2-n0/2; in vorbis_synthesis_blockin()
792 for(i=0;i<n0;i++) in vorbis_synthesis_blockin()
793 pcm[i]=pcm[i]*w[n0-i-1] +p[i]*w[i]; in vorbis_synthesis_blockin()
794 for(;i<n1/2+n0/2;i++) in vorbis_synthesis_blockin()
801 for(i=0;i<n0;i++) in vorbis_synthesis_blockin()
802 pcm[i]=pcm[i]*w[n0-i-1] +p[i]*w[i]; in vorbis_synthesis_blockin()
[all …]
/external/iputils/ninfod/
Dninfod_name.c212 const char *s0 = s, *n0 = n; in compare_dnsname() local
219 if (*(s0 + slen - 1) || *(n0 + nlen - 1)) in compare_dnsname()
221 while (s < s0 + slen && n < n0 + nlen) { in compare_dnsname()
224 if (s + *s + 1 > s0 + slen || n + *n + 1 > n0 + nlen) in compare_dnsname()
236 if (n == n0 + nlen - 1) { in compare_dnsname()
238 } else if (n + 1 == n0 + nlen - 1) { in compare_dnsname()
/external/libvpx/libvpx/vpx_dsp/mips/
Didct32x32_msa.c15 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7; in idct32x8_row_transpose_store() local
18 LD_SH8(input, 32, m0, n0, m1, n1, m2, n2, m3, n3); in idct32x8_row_transpose_store()
20 TRANSPOSE8x8_SH_SH(m0, n0, m1, n1, m2, n2, m3, n3, in idct32x8_row_transpose_store()
21 m0, n0, m1, n1, m2, n2, m3, n3); in idct32x8_row_transpose_store()
24 ST_SH8(m0, n0, m1, n1, m2, n2, m3, n3, (tmp_buf), 8); in idct32x8_row_transpose_store()
29 LD_SH8((input + 16), 32, m0, n0, m1, n1, m2, n2, m3, n3); in idct32x8_row_transpose_store()
31 TRANSPOSE8x8_SH_SH(m0, n0, m1, n1, m2, n2, m3, n3, in idct32x8_row_transpose_store()
32 m0, n0, m1, n1, m2, n2, m3, n3); in idct32x8_row_transpose_store()
35 ST_SH4(m0, n0, m1, n1, (tmp_buf + 16 * 8), 8); in idct32x8_row_transpose_store()
248 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7; in idct_butterfly_transpose_store() local
[all …]
/external/eigen/test/eigen2/
Deigen2_sparse_basic.cpp255 int n0 = ei_random<int>(1,rows-std::max(j0,j1)); in sparse_basic() local
256 VERIFY_IS_APPROX(m2.innerVectors(j0,n0), refMat2.block(0,j0,rows,n0)); in sparse_basic()
257 VERIFY_IS_APPROX(m2.innerVectors(j0,n0)+m2.innerVectors(j1,n0), in sparse_basic()
258 refMat2.block(0,j0,rows,n0)+refMat2.block(0,j1,rows,n0)); in sparse_basic()

1234