/external/clang/test/PCH/ |
H A D | reinclude2.h | 1 int q1 = A::x; variable
|
/external/eigen/test/ |
H A D | geo_eulerangles.cpp | 23 Quaternionx q1; local 24 q1 = AngleAxisx(a, Vector3::Random().normalized()); 26 m = q1;
|
H A D | geo_quaternion.cpp | 24 template<typename QuatType> void check_slerp(const QuatType& q0, const QuatType& q1) argument 32 Scalar theta_tot = AA(q1*q0.inverse()).angle(); 37 QuatType q = q0.slerp(t,q1); 72 Quaternionx q1, q2; 75 q1.coeffs().setRandom(); 76 VERIFY_IS_APPROX(q1.coeffs(), (q1*q2).coeffs()); 79 q1 *= q2; 81 q1 = AngleAxisx(a, v0.normalized()); 85 Scalar refangle = internal::abs(AngleAxisx(q1 188 Quaternionx q1 = MQuaternionA(array1); local 211 QuaternionA *q1 = ::new(reinterpret_cast<void*>(array1)) QuaternionA; local [all...] |
/external/fdlibm/ |
H A D | e_sqrt.c | 100 unsigned r,t1,s1,ix1,q1; local 140 q = q1 = s0 = s1 = 0; /* [q,q1] = ieee_sqrt(x) */ 165 q1 += r; 177 if (q1==(unsigned)0xffffffff) { q1=0; q += 1;} 179 if (q1==(unsigned)0xfffffffe) q+=1; 180 q1+=2; 182 q1 += (q1 [all...] |
H A D | e_jn.c | 161 double q0,q1,h,tmp; int k,m; local 163 q0 = w; z = w+h; q1 = w*z - 1.0; k=1; 164 while(q1<1.0e9) { 166 tmp = z*q1 - q0; 167 q0 = q1; 168 q1 = tmp;
|
/external/chromium_org/ui/gfx/ |
H A D | quad_unittest.cc | 20 QuadF q1; local 24 EXPECT_EQ(q1.ToString(), q2.ToString()); 44 EXPECT_NE(q1.ToString(), q4.ToString()); 45 q1 = BoundingRect(a, c); 46 EXPECT_EQ(q1.ToString(), q4.ToString()); 49 EXPECT_NE(q1.ToString(), q3.ToString()); 50 q1 = q3; 51 EXPECT_EQ(q1.ToString(), q3.ToString()); 61 QuadF q1(a, b, c, d); 62 QuadF added = q1 [all...] |
H A D | transform_util.cc | 65 const SkMScalar q1[4], 68 double product = Dot<4>(q1, q2); 89 out[i] = q1[i]; 99 Combine<4>(out, q1, q2, scale1, scale2); 64 Slerp(SkMScalar out[4], const SkMScalar q1[4], const SkMScalar q2[4], double progress) argument
|
/external/clang/test/CodeGenCXX/ |
H A D | copy-assign-synthesis.cpp | 62 q1.pr(); q2.pr(); 65 Q q1, q2; member in struct:X
|
H A D | copy-assign-synthesis-1.cpp | 78 q1.pr(); q2.pr(); 81 Q q1, q2; member in struct:X
|
/external/qemu/distrib/sdl-1.2.15/src/video/ |
H A D | e_sqrt.h | 146 u_int32_t r,t1,s1,ix1,q1; local 184 q = q1 = s0 = s1 = 0; /* [q,q1] = sqrt(x) */ 209 q1 += r; 221 if (q1==(u_int32_t)0xffffffff) { q1=0; q += 1;} 223 if (q1==(u_int32_t)0xfffffffe) q+=1; 224 q1+=2; 226 q1 += (q1 [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/tests/graw/ |
H A D | occlusion-query.c | 160 struct pipe_query *q1, *q2; local 172 q1 = info.ctx->create_query(info.ctx, PIPE_QUERY_OCCLUSION_COUNTER); 177 info.ctx->begin_query(info.ctx, q1); 179 info.ctx->end_query(info.ctx, q1); 187 info.ctx->get_query_result(info.ctx, q1, TRUE, &res1); 200 info.ctx->destroy_query(info.ctx, q1);
|
/external/chromium_org/third_party/mesa/src/src/mesa/tnl_dd/ |
H A D | t_dd_vertex.h | 66 GLfloat u1, v1, q1; member in struct:__anon13736::__anon13738
|
/external/icu4c/test/perf/howExpensiveIs/ |
H A D | sieve.cpp | 104 double qs(double *times, int n, double *q1, double *q2, double *q3) { argument 105 *q1 = medianof(times,n,1); 108 return *q3-*q1; 112 double q1,q2,q3; local 117 double iqr = qs(times,n,&q1,&q2,&q3); 118 double rangeMin= (q1-(1.5*iqr)); 124 printf("iqr: %.9f, q1=%.9f, q2=%.9f, q3=%.9f, max=%.9f, n=%d\n", iqr,q1,q2,q3,(double)-1, n); 148 double iqr = qs(times,n,&q1,&q2,&q3); 149 rangeMin= (q1 [all...] |
/external/libvpx/libvpx/vp9/common/mips/dspr2/ |
H A D | vp9_loopfilter_masks_dspr2.h | 26 uint32_t q0, uint32_t q1, 61 /* mask |= (abs(q1 - q0) > limit) 62 * hev |= (abs(q1 - q0) > thresh) 64 "subu_s.qb %[c], %[q1], %[q0] \n\t" 65 "subu_s.qb %[r_k], %[q0], %[q1] \n\t" 72 /* mask |= (abs(q2 - q1) > limit) */ 73 "subu_s.qb %[c], %[q2], %[q1] \n\t" 74 "subu_s.qb %[r_k], %[q1], %[q2] \n\t" 90 [p1] "r" (p1), [p0] "r" (p0), [q1] "r" (q1), [q 23 vp9_filter_hev_mask_dspr2(uint32_t limit, uint32_t flimit, uint32_t p1, uint32_t p0, uint32_t p3, uint32_t p2, uint32_t q0, uint32_t q1, uint32_t q2, uint32_t q3, uint32_t thresh, uint32_t *hev, uint32_t *mask) argument 128 vp9_filter_hev_mask_flatmask4_dspr2(uint32_t limit, uint32_t flimit, uint32_t thresh, uint32_t p1, uint32_t p0, uint32_t p3, uint32_t p2, uint32_t q0, uint32_t q1, uint32_t q2, uint32_t q3, uint32_t *hev, uint32_t *mask, uint32_t *flat) argument 278 vp9_flatmask5(uint32_t p4, uint32_t p3, uint32_t p2, uint32_t p1, uint32_t p0, uint32_t q0, uint32_t q1, uint32_t q2, uint32_t q3, uint32_t q4, uint32_t *flat2) argument [all...] |
H A D | vp9_mbloop_loopfilter_dspr2.c | 36 uint32_t p3, p2, p1, p0, q0, q1, q2, q3; local 74 "lw %[q1], (%[sq1]) \n\t" 79 [q3] "=&r" (q3), [q2] "=&r" (q2), [q1] "=&r" (q1), [q0] "=&r" (q0) 85 p1, p0, p3, p2, q0, q1, q2, q3, 89 vp9_filter1_dspr2(mask, hev, p1, p0, q0, q1, 122 "sw %[q1], (%[sq1]) \n\t" 127 [q0] "r" (q0), [q1] "r" (q1), [q2] "r" (q2), 133 vp9_filter1_dspr2(mask, hev, p1, p0, q0, q1, 334 uint32_t p3, p2, p1, p0, q3, q2, q1, q0; local [all...] |
/external/llvm/include/llvm/Analysis/ |
H A D | Trace.h | 105 iterator erase(iterator q1, iterator q2) { return BasicBlocks.erase (q1, q2); } argument
|
/external/mesa3d/src/gallium/tests/graw/ |
H A D | occlusion-query.c | 160 struct pipe_query *q1, *q2; local 172 q1 = info.ctx->create_query(info.ctx, PIPE_QUERY_OCCLUSION_COUNTER); 177 info.ctx->begin_query(info.ctx, q1); 179 info.ctx->end_query(info.ctx, q1); 187 info.ctx->get_query_result(info.ctx, q1, TRUE, &res1); 200 info.ctx->destroy_query(info.ctx, q1);
|
/external/mesa3d/src/mesa/tnl_dd/ |
H A D | t_dd_vertex.h | 66 GLfloat u1, v1, q1; member in struct:__anon24221::__anon24223
|
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkDQuadLineIntersection.cpp | 379 double SkIntersections::Axial(const SkDQuad& q1, const SkDPoint& p, bool vertical) { argument 381 return verticalIntersect(q1, p); 383 return horizontalIntersect(q1, p);
|
/external/eigen/test/eigen2/ |
H A D | eigen2_geometry.cpp | 57 Quaternionx q1, q2; local 60 q1.coeffs().setRandom(); 61 VERIFY_IS_APPROX(q1.coeffs(), (q1*q2).coeffs()); 77 q1 = AngleAxisx(a, v0.normalized()); 81 Scalar refangle = ei_abs(AngleAxisx(q1.inverse()*q2).angle()); 85 if((q1.coeffs()-q2.coeffs()).norm() > 10*largeEps) 87 VERIFY(ei_isApprox(q1.angularDistance(q2), refangle, largeEps)); 91 VERIFY_IS_APPROX(q1 * v2, q1 [all...] |
H A D | eigen2_geometry_with_eigen2_prefix.cpp | 59 Quaternionx q1, q2; local 62 q1.coeffs().setRandom(); 63 VERIFY_IS_APPROX(q1.coeffs(), (q1*q2).coeffs()); 79 q1 = AngleAxisx(a, v0.normalized()); 83 Scalar refangle = ei_abs(AngleAxisx(q1.inverse()*q2).angle()); 87 if((q1.coeffs()-q2.coeffs()).norm() > 10*largeEps) 89 VERIFY(ei_isApprox(q1.angularDistance(q2), refangle, largeEps)); 93 VERIFY_IS_APPROX(q1 * v2, q1 [all...] |
/external/libvpx/libvpx/vp8/common/ |
H A D | loopfilter_filters.c | 29 uc q0, uc q1, uc q2, uc q3) 35 mask |= (abs(q1 - q0) > limit); 36 mask |= (abs(q2 - q1) > limit); 38 mask |= (abs(p0 - q0) * 2 + abs(p1 - q1) / 2 > blimit); 43 static signed char vp8_hevmask(uc thresh, uc p1, uc p0, uc q0, uc q1) argument 47 hev |= (abs(q1 - q0) > thresh) * -1; 282 static signed char vp8_simple_filter_mask(uc blimit, uc p1, uc p0, uc q0, uc q1) argument 288 signed char mask = (abs(p0 - q0) * 2 + abs(p1 - q1) / 2 <= blimit) * -1; 298 signed char q1 = (signed char) * oq1 ^ 0x80; local 301 filter_value = vp8_signed_char_clamp(p1 - q1); 27 vp8_filter_mask(uc limit, uc blimit, uc p3, uc p2, uc p1, uc p0, uc q0, uc q1, uc q2, uc q3) argument [all...] |
/external/opencv/cv/src/ |
H A D | cvthresh.cpp | 211 double mu1 = 0, q1 = 0; local 254 q1 = 0; 261 mu1 *= q1; 262 q1 += p_i; 263 q2 = 1. - q1; 265 if( MIN(q1,q2) < FLT_EPSILON || MAX(q1,q2) > 1. - FLT_EPSILON ) 273 mu1 = (mu1 + val_i*p_i)/q1; 274 mu2 = (mu - q1*mu1)/q2; 275 sigma = q1*q [all...] |
/external/skia/src/pathops/ |
H A D | SkDQuadLineIntersection.cpp | 379 double SkIntersections::Axial(const SkDQuad& q1, const SkDPoint& p, bool vertical) { argument 381 return verticalIntersect(q1, p); 383 return horizontalIntersect(q1, p);
|
/external/speex/libspeex/ |
H A D | kiss_fft.c | 286 int u,k,q1,q; local 298 for ( q1=0 ; q1<p ; ++q1 ) { 299 scratchbuf[q1] = Fout[ k ]; 301 C_FIXDIV(scratchbuf[q1],p); 307 for ( q1=0 ; q1<p ; ++q1 ) {
|