Home
last modified time | relevance | path

Searched refs:xy2 (Results 1 – 25 of 33) sorted by relevance

12

/external/fonttools/Lib/fontTools/misc/
Dtransform.py192 xx2, xy2, yx2, yy2, dx2, dy2 = self.__affine
195 xx1*xy2 + xy1*yy2,
197 yx1*xy2 + yy1*yy2,
199 xy2*dx1 + yy2*dy1 + dy2)
215 xx2, xy2, yx2, yy2, dx2, dy2 = other
218 xx1*xy2 + xy1*yy2,
220 yx1*xy2 + yy1*yy2,
222 xy2*dx1 + yy2*dy1 + dy2)
293 xx2, xy2, yx2, yy2, dx2, dy2 = other
295 (xx2, xy2, yx2, yy2, dx2, dy2)
/external/libopus/celt/arm/
Dpitch_arm.h36 const opus_val16 *y02, int N, opus_val32 *xy1, opus_val32 *xy2);
42 …ual_inner_prod(x, y01, y02, N, xy1, xy2, arch) ((void)(arch), PRESUME_NEON(dual_inner_prod)(x, y01… argument
60 const opus_val16 *y01, const opus_val16 *y02, int N, opus_val32 *xy1, opus_val32 *xy2);
62 …al_inner_prod(x, y01, y02, N, xy1, xy2, arch) ((*DUAL_INNER_PROD_IMPL[(arch)&OPUS_ARCHMASK])(x, y0… argument
65 …ine dual_inner_prod(x, y01, y02, N, xy1, xy2, arch) ((void)(arch), dual_inner_prod_neon(x, y01, y0… argument
Dpitch_neon_intr.c76 int N, opus_val32 *xy1, opus_val32 *xy2) in dual_inner_prod_neon() argument
117 *xy2 = xy02; in dual_inner_prod_neon()
124 celt_assert(xy2_c == *xy2); in dual_inner_prod_neon()
143 opus_val32 xy, xy0 = 0, xy1 = 0, xy2 = 0, xy3 = 0; in celt_inner_prod_neon_float_c_simulation() local
147 xy2 = MAC16_16(xy2, x[i + 2], y[i + 2]); in celt_inner_prod_neon_float_c_simulation()
150 xy0 += xy2; in celt_inner_prod_neon_float_c_simulation()
163 int N, opus_val32 *xy1, opus_val32 *xy2) in dual_inner_prod_neon_float_c_simulation() argument
188 *xy2 = xy02; in dual_inner_prod_neon_float_c_simulation()
235 int N, opus_val32 *xy1, opus_val32 *xy2) in dual_inner_prod_neon() argument
278 *xy2 = xy02; in dual_inner_prod_neon()
[all …]
/external/skqp/tests/
DPathOpsCubicConicIntersectionTest.cpp72 SkDPoint xy2 = conic.ptAtT(tt2); in cubicConicIntersection() local
73 if (!xy1.approximatelyEqual(xy2)) { in cubicConicIntersection()
75 __FUNCTION__, index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in cubicConicIntersection()
77 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in cubicConicIntersection()
DPathOpsConicQuadIntersectionTest.cpp61 SkDPoint xy2 = quad.ptAtT(tt2); in conicQuadIntersection() local
62 if (!xy1.approximatelyEqual(xy2)) { in conicQuadIntersection()
64 __FUNCTION__, index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in conicQuadIntersection()
66 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in conicQuadIntersection()
DPathOpsCubicQuadIntersectionTest.cpp82 SkDPoint xy2 = quad.ptAtT(tt2); in cubicQuadIntersection() local
83 if (!xy1.approximatelyEqual(xy2)) { in cubicQuadIntersection()
85 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in cubicQuadIntersection()
87 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in cubicQuadIntersection()
DPathOpsCubicIntersectionTest.cpp61 SkDPoint xy2 = c2.ptAtT(tt2); in standardTestCases() local
62 if (!xy1.approximatelyEqual(xy2)) { in standardTestCases()
64 __FUNCTION__, (int)index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in standardTestCases()
66 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in standardTestCases()
419 SkDPoint xy1, xy2; in oneOff() local
424 xy2 = c2.ptAtT(tt2); in oneOff()
429 iPt.fY, xy2.fX, xy2.fY, tt2); in oneOff()
432 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt)); in oneOff()
433 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in oneOff()
520 SkDPoint xy2 = c2.ptAtT(tt2); in CubicIntersection_RandTest() local
[all …]
DPathOpsQuadIntersectionTest.cpp46 SkDPoint xy2 = quad2.ptAtT(tt2); in standardTestCases() local
47 if (!xy1.approximatelyEqual(xy2)) { in standardTestCases()
50 tt2, xy2.fX, xy2.fY); in standardTestCases()
350 SkDPoint xy2 = quad2.ptAtT(tt2); in oneOffTest1() local
351 if (!xy1.approximatelyEqual(xy2)) { in oneOffTest1()
354 tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in oneOffTest1()
DPathOpsCubicLineIntersectionTest.cpp157 SkDPoint xy2 = line.ptAtT(tt2); in testOne() local
158 if (!xy1.approximatelyEqual(xy2)) { in testOne()
160 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in testOne()
162 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in testOne()
DPathOpsConicIntersectionTest.cpp321 SkDPoint xy1, xy2; in oneOff() local
326 xy2 = c2.ptAtT(tt2); in oneOff()
329 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt)); in oneOff()
330 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in oneOff()
/external/skia/tests/
DPathOpsCubicConicIntersectionTest.cpp72 SkDPoint xy2 = conic.ptAtT(tt2); in cubicConicIntersection() local
73 if (!xy1.approximatelyEqual(xy2)) { in cubicConicIntersection()
75 __FUNCTION__, index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in cubicConicIntersection()
77 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in cubicConicIntersection()
DPathOpsConicQuadIntersectionTest.cpp61 SkDPoint xy2 = quad.ptAtT(tt2); in conicQuadIntersection() local
62 if (!xy1.approximatelyEqual(xy2)) { in conicQuadIntersection()
64 __FUNCTION__, index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in conicQuadIntersection()
66 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in conicQuadIntersection()
DPathOpsCubicQuadIntersectionTest.cpp82 SkDPoint xy2 = quad.ptAtT(tt2); in cubicQuadIntersection() local
83 if (!xy1.approximatelyEqual(xy2)) { in cubicQuadIntersection()
85 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in cubicQuadIntersection()
87 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in cubicQuadIntersection()
DPathOpsCubicIntersectionTest.cpp61 SkDPoint xy2 = c2.ptAtT(tt2); in standardTestCases() local
62 if (!xy1.approximatelyEqual(xy2)) { in standardTestCases()
64 __FUNCTION__, (int)index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in standardTestCases()
66 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in standardTestCases()
419 SkDPoint xy1, xy2; in oneOff() local
424 xy2 = c2.ptAtT(tt2); in oneOff()
429 iPt.fY, xy2.fX, xy2.fY, tt2); in oneOff()
432 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt)); in oneOff()
433 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in oneOff()
520 SkDPoint xy2 = c2.ptAtT(tt2); in CubicIntersection_RandTest() local
[all …]
DPathOpsQuadIntersectionTest.cpp46 SkDPoint xy2 = quad2.ptAtT(tt2); in standardTestCases() local
47 if (!xy1.approximatelyEqual(xy2)) { in standardTestCases()
50 tt2, xy2.fX, xy2.fY); in standardTestCases()
350 SkDPoint xy2 = quad2.ptAtT(tt2); in oneOffTest1() local
351 if (!xy1.approximatelyEqual(xy2)) { in oneOffTest1()
354 tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in oneOffTest1()
DPathOpsCubicLineIntersectionTest.cpp157 SkDPoint xy2 = line.ptAtT(tt2); in testOne() local
158 if (!xy1.approximatelyEqual(xy2)) { in testOne()
160 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in testOne()
162 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in testOne()
DPathOpsConicIntersectionTest.cpp321 SkDPoint xy1, xy2; in oneOff() local
326 xy2 = c2.ptAtT(tt2); in oneOff()
329 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt)); in oneOff()
330 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in oneOff()
/external/libopus/celt/x86/
Dpitch_sse.h145 opus_val32 *xy2);
157 # define dual_inner_prod(x, y01, y02, N, xy1, xy2, arch) \ argument
158 ((void)(arch),dual_inner_prod_sse(x, y01, y02, N, xy1, xy2))
170 opus_val32 *xy2);
172 #define dual_inner_prod(x, y01, y02, N, xy1, xy2, arch) \ argument
173 ((*DUAL_INNER_PROD_IMPL[(arch) & OPUS_ARCHMASK])(x, y01, y02, N, xy1, xy2))
Dpitch_sse.c80 int N, opus_val32 *xy1, opus_val32 *xy2) in dual_inner_prod_sse() argument
100 _mm_store_ss(xy2, xsum2); in dual_inner_prod_sse()
104 *xy2 = MAC16_16(*xy2, x[i], y02[i]); in dual_inner_prod_sse()
/external/libopus/celt/
Dpitch.h138 int N, opus_val32 *xy1, opus_val32 *xy2) in dual_inner_prod_c() argument
149 *xy2 = xy02; in dual_inner_prod_c()
153 # define dual_inner_prod(x, y01, y02, N, xy1, xy2, arch) \ argument
154 ((void)(arch),dual_inner_prod_c(x, y01, y02, N, xy1, xy2))
Dpitch.c437 opus_val32 xy,xx,yy,xy2; in remove_doubling() local
490 dual_inner_prod(x, &x[-T1], &x[-T1b], N, &xy, &xy2, arch); in remove_doubling()
491 xy = HALF32(xy + xy2); in remove_doubling()
/external/libopus/celt/mips/
Dpitch_mipsr1.h39 int N, opus_val32 *xy1, opus_val32 *xy2, int arch) in dual_inner_prod() argument
61 *xy2 = xy02; in dual_inner_prod()
/external/toybox/tests/files/bc/
Dmisc2_results.txt2 xy2
/external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/
Dp3-0x.cpp23 X<Y&> xy2 = f0(lvalue<Y>()); in test_f0() local
/external/skia/src/pathops/
DSkOpAngle.cpp224 double xy2 = line.fY * (testCurve[index].fX - origin.fX); in lineOnOneSide() local
225 crosses[index - 1] = AlmostBequalUlps(xy1, xy2) ? 0 : xy1 - xy2; in lineOnOneSide()
274 double xy2 = line.fY * testLine.fX; in linesOnOriginalSide() local
276 crosses[index] = AlmostBequalUlps(xy1, xy2) ? 0 : xy1 - xy2; in linesOnOriginalSide()

12