Home
last modified time | relevance | path

Searched refs:tt1 (Results 1 – 25 of 49) sorted by relevance

12

/external/skia/tests/
DPathOpsQuadIntersectionTest.cpp43 double tt1 = intersections[0][pt]; in standardTestCases() local
44 SkDPoint xy1 = quad1.ptAtT(tt1); in standardTestCases()
49 __FUNCTION__, static_cast<int>(index), pt, tt1, xy1.fX, xy1.fY, in standardTestCases()
347 double tt1 = intersections[0][pt]; in oneOffTest1() local
348 SkDPoint xy1 = quad1.ptAtT(tt1); in oneOffTest1()
354 tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in oneOffTest1()
359 outer, inner, tt1, xy1.fX, xy1.fY, tt2); in oneOffTest1()
401 double tt1 = intersections2[0][pt]; in coincidentTestOne() local
403 SkDPoint pt1 = quad1.ptAtT(tt1); in coincidentTestOne()
DPathOpsQuadLineIntersectionTest.cpp140 double tt1 = intersections[0][pt]; in DEF_TEST() local
141 REPORTER_ASSERT(reporter, tt1 >= 0 && tt1 <= 1); in DEF_TEST()
142 SkDPoint t1 = quad.ptAtT(tt1); in DEF_TEST()
148 __FUNCTION__, iIndex, pt, tt1, t1.fX, t1.fY, tt2, t2.fX, t2.fY); in DEF_TEST()
DPathOpsConicLineIntersectionTest.cpp135 double tt1 = intersections[0][pt]; in DEF_TEST() local
136 REPORTER_ASSERT(reporter, tt1 >= 0 && tt1 <= 1); in DEF_TEST()
137 SkDPoint t1 = conic.ptAtT(tt1); in DEF_TEST()
143 __FUNCTION__, iIndex, pt, tt1, t1.fX, t1.fY, tt2, t2.fX, t2.fY); in DEF_TEST()
DPathOpsCubicIntersectionTest.cpp58 double tt1 = tIntersections[0][pt]; in standardTestCases() local
59 SkDPoint xy1 = c1.ptAtT(tt1); in standardTestCases()
64 __FUNCTION__, (int)index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in standardTestCases()
418 double tt1, tt2; in oneOff() local
421 tt1 = intersections[0][pt3]; in oneOff()
422 xy1 = c1.ptAtT(tt1); in oneOff()
428 __FUNCTION__, tt1, xy1.fX, xy1.fY, iPt.fX, in oneOff()
517 double tt1 = intersections2[0][pt]; in CubicIntersection_RandTest() local
518 SkDPoint xy1 = c1.ptAtT(tt1); in CubicIntersection_RandTest()
DPathOpsCubicConicIntersectionTest.cpp69 double tt1 = i[0][pt]; in cubicConicIntersection() local
70 SkDPoint xy1 = cubic.ptAtT(tt1); in cubicConicIntersection()
75 __FUNCTION__, index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in cubicConicIntersection()
DPathOpsConicQuadIntersectionTest.cpp58 double tt1 = i[0][pt]; in conicQuadIntersection() local
59 SkDPoint xy1 = conic.ptAtT(tt1); in conicQuadIntersection()
64 __FUNCTION__, index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in conicQuadIntersection()
DPathOpsCubicQuadIntersectionTest.cpp79 double tt1 = i[0][pt]; in cubicQuadIntersection() local
80 SkDPoint xy1 = cubic.ptAtT(tt1); in cubicQuadIntersection()
85 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in cubicQuadIntersection()
/external/skqp/tests/
DPathOpsQuadIntersectionTest.cpp43 double tt1 = intersections[0][pt]; in standardTestCases() local
44 SkDPoint xy1 = quad1.ptAtT(tt1); in standardTestCases()
49 __FUNCTION__, static_cast<int>(index), pt, tt1, xy1.fX, xy1.fY, in standardTestCases()
347 double tt1 = intersections[0][pt]; in oneOffTest1() local
348 SkDPoint xy1 = quad1.ptAtT(tt1); in oneOffTest1()
354 tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in oneOffTest1()
359 outer, inner, tt1, xy1.fX, xy1.fY, tt2); in oneOffTest1()
401 double tt1 = intersections2[0][pt]; in coincidentTestOne() local
403 SkDPoint pt1 = quad1.ptAtT(tt1); in coincidentTestOne()
DPathOpsQuadLineIntersectionTest.cpp140 double tt1 = intersections[0][pt]; in DEF_TEST() local
141 REPORTER_ASSERT(reporter, tt1 >= 0 && tt1 <= 1); in DEF_TEST()
142 SkDPoint t1 = quad.ptAtT(tt1); in DEF_TEST()
148 __FUNCTION__, iIndex, pt, tt1, t1.fX, t1.fY, tt2, t2.fX, t2.fY); in DEF_TEST()
DPathOpsConicLineIntersectionTest.cpp135 double tt1 = intersections[0][pt]; in DEF_TEST() local
136 REPORTER_ASSERT(reporter, tt1 >= 0 && tt1 <= 1); in DEF_TEST()
137 SkDPoint t1 = conic.ptAtT(tt1); in DEF_TEST()
143 __FUNCTION__, iIndex, pt, tt1, t1.fX, t1.fY, tt2, t2.fX, t2.fY); in DEF_TEST()
DPathOpsCubicIntersectionTest.cpp58 double tt1 = tIntersections[0][pt]; in standardTestCases() local
59 SkDPoint xy1 = c1.ptAtT(tt1); in standardTestCases()
64 __FUNCTION__, (int)index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in standardTestCases()
418 double tt1, tt2; in oneOff() local
421 tt1 = intersections[0][pt3]; in oneOff()
422 xy1 = c1.ptAtT(tt1); in oneOff()
428 __FUNCTION__, tt1, xy1.fX, xy1.fY, iPt.fX, in oneOff()
517 double tt1 = intersections2[0][pt]; in CubicIntersection_RandTest() local
518 SkDPoint xy1 = c1.ptAtT(tt1); in CubicIntersection_RandTest()
DPathOpsCubicConicIntersectionTest.cpp69 double tt1 = i[0][pt]; in cubicConicIntersection() local
70 SkDPoint xy1 = cubic.ptAtT(tt1); in cubicConicIntersection()
75 __FUNCTION__, index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in cubicConicIntersection()
DPathOpsConicQuadIntersectionTest.cpp58 double tt1 = i[0][pt]; in conicQuadIntersection() local
59 SkDPoint xy1 = conic.ptAtT(tt1); in conicQuadIntersection()
64 __FUNCTION__, index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in conicQuadIntersection()
DPathOpsCubicQuadIntersectionTest.cpp79 double tt1 = i[0][pt]; in cubicQuadIntersection() local
80 SkDPoint xy1 = cubic.ptAtT(tt1); in cubicQuadIntersection()
85 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in cubicQuadIntersection()
/external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/math/ec/custom/sec/
DSecP384R1Point.java95 int[] tt1 = Nat.create(24); in add() local
131 U1 = tt1; in add()
167 Nat384.mul(S1, G, tt1); in add()
179 SecP384R1Field.addExt(tt1, tt2, tt1); in add()
180 SecP384R1Field.reduce(tt1, Y3.x); in add()
DSecP224R1Point.java95 int[] tt1 = Nat224.createExt(); in add() local
131 U1 = tt1; in add()
167 Nat224.mul(S1, G, tt1); in add()
178 SecP224R1Field.multiplyAddToExt(Y3.x, R, tt1); in add()
179 SecP224R1Field.reduce(tt1, Y3.x); in add()
DSecP192R1Point.java96 int[] tt1 = Nat192.createExt(); in add() local
132 U1 = tt1; in add()
168 Nat192.mul(S1, G, tt1); in add()
179 SecP192R1Field.multiplyAddToExt(Y3.x, R, tt1); in add()
180 SecP192R1Field.reduce(tt1, Y3.x); in add()
DSecP256R1Point.java95 int[] tt1 = Nat256.createExt(); in add() local
131 U1 = tt1; in add()
167 Nat256.mul(S1, G, tt1); in add()
178 SecP256R1Field.multiplyAddToExt(Y3.x, R, tt1); in add()
179 SecP256R1Field.reduce(tt1, Y3.x); in add()
DSecP224K1Point.java97 int[] tt1 = Nat224.createExt(); in add() local
133 U1 = tt1; in add()
169 Nat224.mul(S1, G, tt1); in add()
180 SecP224K1Field.multiplyAddToExt(Y3.x, R, tt1); in add()
181 SecP224K1Field.reduce(tt1, Y3.x); in add()
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/custom/sec/
DSecP384R1Point.java91 int[] tt1 = Nat.create(24); in add() local
127 U1 = tt1; in add()
163 Nat384.mul(S1, G, tt1); in add()
175 SecP384R1Field.addExt(tt1, tt2, tt1); in add()
176 SecP384R1Field.reduce(tt1, Y3.x); in add()
DSecP192K1Point.java93 int[] tt1 = Nat192.createExt(); in add() local
129 U1 = tt1; in add()
165 Nat192.mul(S1, G, tt1); in add()
176 SecP192K1Field.multiplyAddToExt(Y3.x, R, tt1); in add()
177 SecP192K1Field.reduce(tt1, Y3.x); in add()
DSecP192R1Point.java92 int[] tt1 = Nat192.createExt(); in add() local
128 U1 = tt1; in add()
164 Nat192.mul(S1, G, tt1); in add()
175 SecP192R1Field.multiplyAddToExt(Y3.x, R, tt1); in add()
176 SecP192R1Field.reduce(tt1, Y3.x); in add()
DSecP224K1Point.java93 int[] tt1 = Nat224.createExt(); in add() local
129 U1 = tt1; in add()
165 Nat224.mul(S1, G, tt1); in add()
176 SecP224K1Field.multiplyAddToExt(Y3.x, R, tt1); in add()
177 SecP224K1Field.reduce(tt1, Y3.x); in add()
DSecP224R1Point.java91 int[] tt1 = Nat224.createExt(); in add() local
127 U1 = tt1; in add()
163 Nat224.mul(S1, G, tt1); in add()
174 SecP224R1Field.multiplyAddToExt(Y3.x, R, tt1); in add()
175 SecP224R1Field.reduce(tt1, Y3.x); in add()
DSecP256K1Point.java93 int[] tt1 = Nat256.createExt(); in add() local
129 U1 = tt1; in add()
165 Nat256.mul(S1, G, tt1); in add()
176 SecP256K1Field.multiplyAddToExt(Y3.x, R, tt1); in add()
177 SecP256K1Field.reduce(tt1, Y3.x); in add()

12