/external/libcxx/test/std/thread/thread.mutex/thread.lock/thread.lock.scoped/ |
H A D | mutex.fail.cpp | 29 M n0, n1, n2; local 39 test_conversion<LG>({n0}); // expected-error{{no matching function for call}} 45 test_conversion<LG>({n0, n1}); // expected-error{{no matching function for call}} 51 test_conversion<LG>({n0, n1, n2}); // expected-error{{no matching function for call}}
|
/external/clang/test/Modules/ |
H A D | macros2.c | 10 int n0 = TOP_OTHER_DEF_RIGHT_UNDEF; // ok variable
|
/external/eigen/test/ |
H A D | nullary.cpp | 158 Index n0 = VectorType::SizeAtCompileTime==Dynamic ? 0 : VectorType::SizeAtCompileTime; local 160 m = VectorType::LinSpaced(n0,low,low-1); 161 VERIFY(m.size()==n0); 165 VERIFY_IS_EQUAL(VectorType::LinSpaced(n0,0,Scalar(n0-1)).sum(),Scalar(0)); 166 VERIFY_IS_EQUAL(VectorType::LinSpaced(n0,low,low-1).sum(),Scalar(0)); 169 m.setLinSpaced(n0,0,Scalar(n0-1)); 170 VERIFY(m.size()==n0); 171 m.setLinSpaced(n0,lo [all...] |
H A D | sparse_block.cpp | 192 Index n0 = internal::random<Index>(1,outer-(std::max)(j0,j1)); local 194 VERIFY_IS_APPROX(m2.innerVectors(j0,n0), refMat2.block(j0,0,n0,cols)); 196 VERIFY_IS_APPROX(m2.innerVectors(j0,n0), refMat2.block(0,j0,rows,n0)); 198 VERIFY_IS_APPROX(m2.innerVectors(j0,n0)+m2.innerVectors(j1,n0), 199 refMat2.middleRows(j0,n0)+refMat2.middleRows(j1,n0)); 201 VERIFY_IS_APPROX(m2.innerVectors(j0,n0) 224 Index n0 = internal::random<Index>(1,outer-(std::max)(j0,j1)); local [all...] |
H A D | geo_hyperplane.cpp | 34 VectorType n0 = VectorType::Random(dim).normalized(); local 37 HyperplaneType pl0(n0, p0);
|
/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/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/libvpx/libvpx/vpx_dsp/ |
H A D | prob.h | 58 static INLINE vpx_prob get_binary_prob(unsigned int n0, unsigned int n1) { argument 59 const unsigned int den = n0 + n1; 61 return get_prob(n0, den);
|
/external/syslinux/core/lwip/src/netif/ppp/ |
H A D | vj.c | 470 struct pbuf *n0 = *nb; local 475 cp = (u_char *)n0->payload; 560 vjlen = (u_short)(cp - (u_char*)n0->payload); 561 if (n0->len < vjlen) { 567 n0->len, vjlen)); 572 tmp = n0->tot_len - vjlen + cs->cs_hlen; 575 IPH_LEN_SET(&cs->cs_ip, htons(n0->tot_len - vjlen + cs->cs_hlen)); 589 if(pbuf_header(n0, -((s16_t)(vjlen)))) { 595 if(LWIP_MEM_ALIGN(n0->payload) != n0 [all...] |
/external/tensorflow/tensorflow/core/kernels/ |
H A D | concat_op_test.cc | 140 const size_t n0 = data1.size(); local 142 float* result = new float[n0 + n1]; 143 memcpy(&result[0], &data1[0], n0 * sizeof(float)); 144 memcpy(&result[n0], &data2[0], n1 * sizeof(float));
|
/external/boringssl/include/openssl/ |
H A D | bn.h | 924 BN_ULONG n0[2]; // least significant words of (R*Ri-1)/N member in struct:bn_mont_ctx_st
|
/external/boringssl/src/crypto/fipsmodule/bn/ |
H A D | montgomery.c | 163 to->n0[0] = from->n0[0]; 164 to->n0[1] = from->n0[1]; 197 // Find n0 such that n0 * N == -1 (mod r). 199 // Only certain BN_BITS2<=32 platforms actually make use of n0[1]. For the 203 uint64_t n0 = bn_mont_n0(&mont->N); local 204 mont->n0[0] = (BN_ULONG)n0; 272 BN_ULONG n0 = mont->n0[0]; local [all...] |
H A D | div.c | 141 BN_ULONG n0, BN_ULONG n1, BN_ULONG d0) { 162 : "a"(n1), "d"(n0), "rm"(d0) 168 : "a"(n1), "d"(n0), "rm"(d0) 172 BN_ULLONG n = (((BN_ULLONG)n0) << BN_BITS2) | n1; 175 *quotient_out = bn_div_words(n0, n1, d0); 308 BN_ULONG n0, n1, rm = 0; local 310 n0 = wnump[0]; 312 if (n0 == d0) { 315 // n0 < d0 316 bn_div_rem_words(&q, &rm, n0, n 140 bn_div_rem_words(BN_ULONG *quotient_out, BN_ULONG *rem_out, BN_ULONG n0, BN_ULONG n1, BN_ULONG d0) argument [all...] |
H A D | exponentiation.c | 128 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); 1042 RSAZ_1024_mod_exp_avx2(rr->d, a->d, p->d, m->d, mont->RR.d, mont->n0[0]); 1115 const BN_ULONG *n0 = mont->n0; local 1134 bn_mul_mont(tmp.d, am.d, am.d, np, n0, top); 1139 bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top); 1144 bn_mul_mont_gather5(tmp.d, am.d, powerbuf, np, n0, top, i - 1); 1147 bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, to [all...] |
/external/boringssl/src/crypto/fipsmodule/ec/ |
H A D | simple.c | 310 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6; local 335 n0 = BN_CTX_get(ctx); 360 if (!field_sqr(group, n0, &b->Z, ctx) || 361 !field_mul(group, n1, &a->X, n0, ctx)) { 366 if (!field_mul(group, n0, n0, &b->Z, ctx) || 367 !field_mul(group, n2, &a->Y, n0, ctx)) { 382 if (!field_sqr(group, n0, &a->Z, ctx) || 383 !field_mul(group, n3, &b->X, n0, ctx)) { 388 if (!field_mul(group, n0, n 502 BIGNUM *n0, *n1, *n2, *n3; local [all...] |
/external/boringssl/src/include/openssl/ |
H A D | bn.h | 924 BN_ULONG n0[2]; // least significant words of (R*Ri-1)/N member in struct:bn_mont_ctx_st
|
/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/libvpx/libvpx/vp9/common/ |
H A D | vp9_entropy.c | 1068 const int n0 = counts[i][j][k][l][ZERO_TOKEN]; local 1073 { neob, eob_counts[i][j][k][l] - neob }, { n0, n1 + n2 }, { n1, n2 }
|
/external/opencv/cxcore/src/ |
H A D | cxdxt.cpp | 221 icvDFTInit( int n0, int nf, int* factors, int* itab, int elem_size, void* _wave, int inv_itab ) argument 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/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, m0, n0, m1, n1, m2, n2, m3, 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, m0, n0, m1, n1, m2, n2, m3, 35 ST_SH4(m0, n0, m1, n1, (tmp_buf + 16 * 8), 8); 243 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n local 542 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7; local [all...] |
/external/skia/src/gpu/ops/ |
H A D | GrAAConvexTessellator.cpp | 35 static bool intersect(const SkPoint& p0, const SkPoint& n0, argument 39 SkScalar perpDot = n0.fX * n1.fY - n0.fY * n1.fX; 50 static SkScalar perp_intersect(const SkPoint& p0, const SkPoint& n0, argument 53 SkScalar perpDot = n0.dot(perp);
|
/external/skqp/src/gpu/ops/ |
H A D | GrAAConvexTessellator.cpp | 35 static bool intersect(const SkPoint& p0, const SkPoint& n0, argument 39 SkScalar perpDot = n0.fX * n1.fY - n0.fY * n1.fX; 50 static SkScalar perp_intersect(const SkPoint& p0, const SkPoint& n0, argument 53 SkScalar perpDot = n0.dot(perp);
|
/external/tensorflow/tensorflow/compiler/xla/service/ |
H A D | hlo_graph_dumper.cc | 258 auto n0 = operand0->parameter_number(); local 260 if (!(n0 == 0 && n1 == 1) && !(n1 == 0 && n0 == 1)) { 266 if (n0 == 1) {
|
/external/tremolo/Tremolo/ |
H A D | mdct.c | 468 void mdct_unroll_lap(int n0,int n1, argument 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 );
|
/external/eigen/Eigen/src/Eigenvalues/ |
H A D | SelfAdjointEigenSolver.h | 615 Scalar n0, n1; local 617 n0 = (c0 = representative.cross(mat.col((i0+1)%3))).squaredNorm(); 619 if(n0>n1) res = c0/std::sqrt(n0);
|