/external/clang/test/PCH/ |
H A D | reinclude2.h | 1 int q1 = A::x; variable
|
/external/libcxx/test/std/containers/container.adaptors/priority.queue/priqueue.members/ |
H A D | swap.pass.cpp | 21 std::priority_queue<int> q1; local 23 q1.push(1); 24 q1.push(3); 25 q1.push(2); 26 q1.swap(q2); 27 assert(q1.empty());
|
/external/libcxx/test/std/containers/container.adaptors/priority.queue/priqueue.special/ |
H A D | swap.pass.cpp | 23 std::priority_queue<int> q1; local 25 q1.push(1); 26 q1.push(3); 27 q1.push(2); 28 swap(q1, q2); 29 assert(q1.empty());
|
/external/libcxx/test/std/containers/container.adaptors/queue/queue.ops/ |
H A D | lt.pass.cpp | 39 std::queue<int> q1 = make<std::queue<int> >(5); local 41 assert(q1 < q2); 42 assert(q2 > q1); 43 assert(q1 <= q2); 44 assert(q2 >= q1);
|
H A D | eq.pass.cpp | 33 std::queue<int> q1 = make<std::queue<int> >(5); local 35 std::queue<int> q1_save = q1; 37 assert(q1 == q1_save); 38 assert(q1 != q2);
|
/external/libcxx/test/std/containers/container.adaptors/stack/stack.ops/ |
H A D | lt.pass.cpp | 39 std::stack<int> q1 = make<std::stack<int> >(5); local 41 assert(q1 < q2); 42 assert(q2 > q1); 43 assert(q1 <= q2); 44 assert(q2 >= q1);
|
H A D | eq.pass.cpp | 33 std::stack<int> q1 = make<std::stack<int> >(5); local 35 std::stack<int> q1_save = q1; 37 assert(q1 == q1_save); 38 assert(q1 != q2);
|
/external/libcxx/test/std/containers/container.adaptors/queue/queue.defn/ |
H A D | swap.pass.cpp | 29 std::queue<int> q1 = make<std::queue<int> >(5); local 31 std::queue<int> q1_save = q1; 33 q1.swap(q2); 34 assert(q1 == q2_save);
|
/external/libcxx/test/std/containers/container.adaptors/queue/queue.special/ |
H A D | swap.pass.cpp | 30 std::queue<int> q1 = make<std::queue<int> >(5); local 32 std::queue<int> q1_save = q1; 34 swap(q1, q2); 35 assert(q1 == q2_save);
|
/external/libcxx/test/std/containers/container.adaptors/stack/stack.defn/ |
H A D | swap.pass.cpp | 29 std::stack<int> q1 = make<std::stack<int> >(5); local 31 std::stack<int> q1_save = q1; 33 q1.swap(q2); 34 assert(q1 == q2_save);
|
/external/libcxx/test/std/containers/container.adaptors/stack/stack.special/ |
H A D | swap.pass.cpp | 30 std::stack<int> q1 = make<std::stack<int> >(5); local 32 std::stack<int> q1_save = q1; 34 swap(q1, q2); 35 assert(q1 == q2_save);
|
/external/clang/test/SemaCXX/ |
H A D | builtin-assume-aligned.cpp | 20 constexpr void *q1 = __builtin_assume_aligned(&n, 4, 2); variable
|
/external/eigen/test/ |
H A D | geo_eulerangles.cpp | 68 Quaternionx q1; local 69 q1 = AngleAxisx(a, Vector3::Random().normalized()); 71 m = q1; 79 q1.coeffs() = Quaternionx::Coefficients::Random().normalized(); 80 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); 71 Quaternionx q1, q2; 74 q1.coeffs().setRandom(); 75 VERIFY_IS_APPROX(q1.coeffs(), (q1*q2).coeffs()); 78 q1 *= q2; 80 q1 = AngleAxisx(a, v0.normalized()); 84 Scalar refangle = abs(AngleAxisx(q1 200 Quaternionx q1 = mq1; local 240 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/v8/src/base/ |
H A D | division-by-constant.cc | 33 T q1 = min / anc; // Init. q1 = 2**p/|nc|. 34 T r1 = min - q1 * anc; // Init. r1 = rem(2**p, |nc|). 40 q1 = 2 * q1; // Update q1 = 2**p/|nc|. 43 q1 = q1 + 1; 53 } while (q1 < delta || (q1 71 T q1 = min / nc; // Init. q1 = 2**p/nc local [all...] |
/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 | 77 q1.pr(); q2.pr(); 80 Q q1, q2; member in struct:X
|
/external/freetype/src/base/ |
H A D | ftbbox.c | 250 cubic_peak( FT_Pos q1, argument 268 shift = 27 - FT_MSB( (FT_UInt32)( FT_ABS( q1 ) | 279 q1 <<= shift; 286 q1 >>= -shift; 297 if ( q1 + q2 > q3 + q4 ) /* first half */ 301 q2 = q2 + q1; 310 q1 = q1 + q2; 313 q1 = q1 [all...] |
/external/icu/icu4c/source/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/vp8/common/arm/neon/ |
H A D | dequant_idct_neon.c | 24 int16x8_t q1, q2, q3, q4, q5, q6; local 53 q1 = vreinterpretq_s16_u16(vmulq_u16(vreinterpretq_u16_s16(q3), 58 d12 = vqadd_s16(vget_low_s16(q1), vget_low_s16(q2)); 59 d13 = vqsub_s16(vget_low_s16(q1), vget_low_s16(q2)); 61 q2 = vcombine_s16(vget_high_s16(q1), vget_high_s16(q2)); 122 q1 = vcombine_s16(d2tmp2.val[0], d2tmp2.val[1]); 125 q1 = vreinterpretq_s16_u16(vaddw_u8(vreinterpretq_u16_s16(q1), 130 d14 = vreinterpret_s32_u8(vqmovun_s16(q1));
|
H A D | idct_dequant_full_2x_neon.c | 24 int16x8_t q0, q1, q2, q3, q4, q5, q6, q7, q8, q9, q10, q11; local 35 q1 = vld1q_s16(dq); 70 q3 = vmulq_s16(q3, q1); 72 q5 = vmulq_s16(q5, q1);
|
/external/libvpx/libvpx/vpx_dsp/mips/ |
H A D | loopfilter_masks_dspr2.h | 30 uint32_t q0, uint32_t q1, 65 /* mask |= (abs(q1 - q0) > limit) 66 * hev |= (abs(q1 - q0) > thresh) 68 "subu_s.qb %[c], %[q1], %[q0] \n\t" 69 "subu_s.qb %[r_k], %[q0], %[q1] \n\t" 76 /* mask |= (abs(q2 - q1) > limit) */ 77 "subu_s.qb %[c], %[q2], %[q1] \n\t" 78 "subu_s.qb %[r_k], %[q1], %[q2] \n\t" 94 [p1] "r" (p1), [p0] "r" (p0), [q1] "r" (q1), [q 27 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 132 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 282 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...] |
/external/llvm/include/llvm/Analysis/ |
H A D | Trace.h | 105 iterator erase(iterator q1, iterator q2) { return BasicBlocks.erase (q1, q2); } argument
|