/external/libcxx/test/containers/container.adaptors/stack/stack.cons/ |
H A D | ctor_move.pass.cpp | 37 std::stack<MoveOnly> q2 = std::move(q); local 38 assert(q2.size() == 5);
|
/external/llvm/test/MC/ARM/ |
H A D | neon-vswp.s | 4 vswp q1, q2 7 @ CHECK: vswp q1, q2 @ encoding: [0x44,0x20,0xb2,0xf3]
|
H A D | neon-crypto.s | 27 sha1c.32 q0, q1, q2 28 sha1m.32 q0, q1, q2 29 sha1p.32 q0, q1, q2 30 sha1su0.32 q0, q1, q2 31 sha256h.32 q0, q1, q2 32 sha256h2.32 q0, q1, q2 33 sha256su1.32 q0, q1, q2 34 @ CHECK: sha1c.32 q0, q1, q2 @ encoding: [0x44,0x0c,0x02,0xf2] 35 @ CHECK: sha1m.32 q0, q1, q2 @ encoding: [0x44,0x0c,0x22,0xf2] 36 @ CHECK: sha1p.32 q0, q1, q2 [all...] |
H A D | invalid-neon-v8.s | 14 vcvtp.f32.u32 d1, q2 48 sha1c.32 s0, d1, q2 50 sha1m.32 q0, s1, q2 52 sha1p.32 s0, q1, q2 54 sha1su0.32 d0, q1, q2 56 sha256h.32 q0, s1, q2 60 sha256su1.32 s0, d1, q2 62 sha256su1lt.32 q0, d1, q2
|
/external/valgrind/main/none/tests/arm/ |
H A D | neon128.c | 357 TESTINSN_imm("vmov.i8 q2", q2, 0x7); 371 TESTINSN_imm("vmvn.i8 q2", q2, 0x7); 382 TESTINSN_imm("vorr.i16 q2", q2, 0x7); 412 TESTINSN_bin("vadd.i32 q0, q1, q2", q0, q1, i32, 24, q2, i32, 120); 413 TESTINSN_bin("vadd.i64 q0, q1, q2", q0, q1, i32, 140, q2, i3 [all...] |
/external/chromium_org/third_party/freetype/src/base/ |
H A D | ftbbox.c | 227 FT_Pos q1, q2, q3, q4; 231 q2 = p2; 237 while ( q2 > *max || q3 > *max ) 240 if ( q1 + q2 > q3 + q4 ) /* first half */ 243 q3 = q3 + q2; 244 q2 = q2 + q1; 246 q3 = q3 + q2; 249 q2 = q2 / [all...] |
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/base/ |
H A D | ftbbox.c | 227 FT_Pos q1, q2, q3, q4; 231 q2 = p2; 237 while ( q2 > *max || q3 > *max ) 240 if ( q1 + q2 > q3 + q4 ) /* first half */ 243 q3 = q3 + q2; 244 q2 = q2 + q1; 246 q3 = q3 + q2; 249 q2 = q2 / [all...] |
/external/eigen/test/ |
H A D | geo_quaternion.cpp | 71 Quaternionx q1, q2; 72 q2.setIdentity(); 73 VERIFY_IS_APPROX(Quaternionx(Quaternionx::Identity()).coeffs(), q2.coeffs()); 75 VERIFY_IS_APPROX(q1.coeffs(), (q1*q2).coeffs()); 78 q1 *= q2; 81 q2 = AngleAxisx(a, v1.normalized()); 84 Scalar refangle = abs(AngleAxisx(q1.inverse()*q2).angle()); 88 if((q1.coeffs()-q2.coeffs()).norm() > 10*largeEps) 90 VERIFY_IS_MUCH_SMALLER_THAN(abs(q1.angularDistance(q2) - refangle), Scalar(1)); 95 VERIFY_IS_APPROX(q1 * q2 * v 201 Quaternionx q2 = mq2; local 241 QuaternionUA *q2 = ::new(reinterpret_cast<void*>(array2)) QuaternionUA; local [all...] |
/external/chromium_org/net/dns/ |
H A D | dns_query_unittest.cc | 60 scoped_ptr<DnsQuery> q2(q1.CloneWithNewId(42)); 61 EXPECT_EQ(42, q2->id()); 62 EXPECT_EQ(q1.io_buffer()->size(), q2->io_buffer()->size()); 63 EXPECT_EQ(q1.qtype(), q2->qtype()); 64 EXPECT_EQ(q1.question(), q2->question());
|
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkDQuadIntersection.cpp | 81 static bool only_end_pts_in_common(const SkDQuad& q1, const SkDQuad& q2) { argument 104 double test = (q2[n].fY - origY) * adj - (q2[n].fX - origX) * opp; 119 static bool add_intercept(const SkDQuad& q1, const SkDQuad& q2, double tMin, double tMax, argument 122 SkDPoint mid = q2.ptAtT(tMid); 125 SkDVector dxdy = q2.dxdyAtT(tMid); 148 static bool is_linear_inner(const SkDQuad& q1, double t1s, double t1e, const SkDQuad& q2, argument 158 int roots = rootTs.intersect(q2, *testLines[index]); 165 SkDPoint qPt = q2.ptAtT(t); 188 SkDPoint end = q2 244 is_linear(const SkDQuad& q1, const SkDQuad& q2, SkIntersections* i) argument 255 relaxed_is_linear(const SkDQuad* q1, double s1, double e1, const SkDQuad* q2, double s2, double e2, SkIntersections* i) argument 371 lookNearEnd(const SkDQuad& q1, const SkDQuad& q2, int testT, const SkIntersections& orig, bool swap, SkIntersections* i) argument 399 intersect(const SkDQuad& q1, const SkDQuad& q2) argument [all...] |
/external/skia/src/pathops/ |
H A D | SkDQuadIntersection.cpp | 81 static bool only_end_pts_in_common(const SkDQuad& q1, const SkDQuad& q2) { argument 104 double test = (q2[n].fY - origY) * adj - (q2[n].fX - origX) * opp; 119 static bool add_intercept(const SkDQuad& q1, const SkDQuad& q2, double tMin, double tMax, argument 122 SkDPoint mid = q2.ptAtT(tMid); 125 SkDVector dxdy = q2.dxdyAtT(tMid); 148 static bool is_linear_inner(const SkDQuad& q1, double t1s, double t1e, const SkDQuad& q2, argument 158 int roots = rootTs.intersect(q2, *testLines[index]); 165 SkDPoint qPt = q2.ptAtT(t); 188 SkDPoint end = q2 244 is_linear(const SkDQuad& q1, const SkDQuad& q2, SkIntersections* i) argument 255 relaxed_is_linear(const SkDQuad* q1, double s1, double e1, const SkDQuad* q2, double s2, double e2, SkIntersections* i) argument 371 lookNearEnd(const SkDQuad& q1, const SkDQuad& q2, int testT, const SkIntersections& orig, bool swap, SkIntersections* i) argument 399 intersect(const SkDQuad& q1, const SkDQuad& q2) argument [all...] |
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/arm/neon/ |
H A D | dequant_idct_neon.c | 24 int16x8_t q1, q2, q3, q4, q5, q6; local 55 q2 = vreinterpretq_s16_u16(vmulq_u16(vreinterpretq_u16_s16(q4), 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)); 63 q3 = vqdmulhq_n_s16(q2, sinpi8sqrt2); 64 q4 = vqdmulhq_n_s16(q2, cospi8sqrt2minus1); 69 q3 = vqaddq_s16(q3, q2); 70 q4 = vqaddq_s16(q4, q2); [all...] |
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 38 q2 = vld1q_s16(q); 69 q2 = vmulq_s16(q2, q0); 75 dLow0 = vget_low_s16(q2); 76 dHigh0 = vget_high_s16(q2); 79 q2 = vcombine_s16(dLow0, dLow1); 94 q10 = vqaddq_s16(q2, q3); 95 q11 = vqsubq_s16(q2, q3); 103 q2 [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 55 q2 = vreinterpretq_s16_u16(vmulq_u16(vreinterpretq_u16_s16(q4), 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)); 63 q3 = vqdmulhq_n_s16(q2, sinpi8sqrt2); 64 q4 = vqdmulhq_n_s16(q2, cospi8sqrt2minus1); 69 q3 = vqaddq_s16(q3, q2); 70 q4 = vqaddq_s16(q4, q2); [all...] |
/external/libcxx/test/containers/container.adaptors/queue/queue.cons.alloc/ |
H A D | ctor_queue_alloc.pass.cpp | 49 test<int> q2(q, test_allocator<int>(5)); 50 assert(q2.get_allocator() == test_allocator<int>(5)); 51 assert(q2.size() == 5);
|
H A D | ctor_rqueue_alloc.pass.cpp | 56 test<MoveOnly> q2(std::move(q), test_allocator<MoveOnly>(5)); 57 assert(q2.get_allocator() == test_allocator<MoveOnly>(5)); 58 assert(q2.size() == 5);
|
/external/libcxx/test/containers/container.adaptors/stack/stack.cons.alloc/ |
H A D | ctor_copy_alloc.pass.cpp | 49 test<int> q2(q, test_allocator<int>(5)); 50 assert(q2.get_allocator() == test_allocator<int>(5)); 51 assert(q2.size() == 5);
|
H A D | ctor_rqueue_alloc.pass.cpp | 56 test<MoveOnly> q2(std::move(q), test_allocator<MoveOnly>(5)); 57 assert(q2.get_allocator() == test_allocator<MoveOnly>(5)); 58 assert(q2.size() == 5);
|
/external/libhevc/common/arm/ |
H A D | ihevc_deblk_chroma_horz.s | 85 vmovl.u8 q2,d4 106 vadd.i16 q2,q3,q2 108 vsub.i16 q3,q2,q8 123 vdup.16 q2,r1 128 vzip.16 q2,q8 133 vmin.s16 q8,q3,q2 134 vmax.s16 q2,q9,q8 135 vadd.i16 q1,q1,q2 136 vsub.i16 q0,q0,q2 [all...] |
/external/freetype/src/base/ |
H A D | ftbbox.c | 207 FT_Pos q2, 214 while ( q2 > max || q3 > max ) 217 if ( q1 + q2 > q3 + q4 ) /* first half */ 220 q3 = q3 + q2; 221 q2 = q2 + q1; 223 q3 = q3 + q2; 226 q2 = q2 / 2; 230 q1 = q1 + q2; 206 update_cubic_max( FT_Pos q1, FT_Pos q2, FT_Pos q3, FT_Pos q4, FT_Pos max ) argument [all...] |
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/mips/dspr2/ |
H A D | vp9_loopfilter_masks_dspr2.h | 31 uint32_t q2, uint32_t q3, 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" 84 /* mask |= (abs(q3 - q2) > limit) */ 85 "subu_s.qb %[c], %[q3], %[q2] \n\t" 86 "subu_s.qb %[r_k], %[q2], %[q3] \n\t" 95 [q2] "r" (q2), [q3] "r" (q3), [thresh] "r" (thresh) 138 uint32_t q2, uint32_ 27 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 132 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 282 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...] |
/external/libvpx/libvpx/vp9/common/mips/dspr2/ |
H A D | vp9_loopfilter_masks_dspr2.h | 31 uint32_t q2, uint32_t q3, 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" 84 /* mask |= (abs(q3 - q2) > limit) */ 85 "subu_s.qb %[c], %[q3], %[q2] \n\t" 86 "subu_s.qb %[r_k], %[q2], %[q3] \n\t" 95 [q2] "r" (q2), [q3] "r" (q3), [thresh] "r" (thresh) 138 uint32_t q2, uint32_ 27 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 132 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 282 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...] |
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | QuadraticImplicit.cpp | 27 static int findRoots(const QuadImplicitForm& i, const Quadratic& q2, double roots[4], argument 30 set_abc(&q2[0].x, a, b, c); 32 set_abc(&q2[0].y, d, e, f); 80 static bool onlyEndPtsInCommon(const Quadratic& q1, const Quadratic& q2, Intersections& i) { argument 103 double test = (q2[n].y - origY) * adj - (q2[n].x - origX) * opp; 110 if (q1[i1] == q2[i2]) { 126 static bool addIntercept(const Quadratic& q1, const Quadratic& q2, double tMin, double tMax, argument 130 xy_at_t(q2, tMid, mid.x, mid.y); 133 _Vector dxdy = dxdy_at_t(q2, tMi 156 isLinearInner(const Quadratic& q1, double t1s, double t1e, const Quadratic& q2, double t2s, double t2e, Intersections& i, bool* subDivide) argument 251 isLinear(const Quadratic& q1, const Quadratic& q2, Intersections& i) argument 261 relaxedIsLinear(const Quadratic& q1, const Quadratic& q2, Intersections& i) argument [all...] |
/external/skia/experimental/Intersection/ |
H A D | QuadraticImplicit.cpp | 27 static int findRoots(const QuadImplicitForm& i, const Quadratic& q2, double roots[4], argument 30 set_abc(&q2[0].x, a, b, c); 32 set_abc(&q2[0].y, d, e, f); 80 static bool onlyEndPtsInCommon(const Quadratic& q1, const Quadratic& q2, Intersections& i) { argument 103 double test = (q2[n].y - origY) * adj - (q2[n].x - origX) * opp; 110 if (q1[i1] == q2[i2]) { 126 static bool addIntercept(const Quadratic& q1, const Quadratic& q2, double tMin, double tMax, argument 130 xy_at_t(q2, tMid, mid.x, mid.y); 133 _Vector dxdy = dxdy_at_t(q2, tMi 156 isLinearInner(const Quadratic& q1, double t1s, double t1e, const Quadratic& q2, double t2s, double t2e, Intersections& i, bool* subDivide) argument 251 isLinear(const Quadratic& q1, const Quadratic& q2, Intersections& i) argument 261 relaxedIsLinear(const Quadratic& q1, const Quadratic& q2, Intersections& i) argument [all...] |
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/arm/neon/ |
H A D | vp9_avg_neon.asm | 37 vld1.8 {q2-q3}, [r0], lr 43 vrhadd.u8 q2, q2, q10 46 vst1.8 {q2-q3}, [r2@128], r4 53 vld1.8 {q2-q3}, [r0], r1 61 vrhadd.u8 q2, q2, q10 65 vst1.8 {q2-q3}, [r2@128], r3 73 vld1.8 {q2}, [r6@128], r3 77 vrhadd.u8 q0, q0, q2 [all...] |