Home
last modified time | relevance | path

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

123

/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()
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()
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()
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()
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()
/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()
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()
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()
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()
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()
/external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/math/ec/custom/sec/
DSecP384R1Point.java54 int[] tt1 = Nat.create(24); in add() local
90 U1 = tt1; in add()
126 Nat384.mul(S1, G, tt1); in add()
138 SecP384R1Field.addExt(tt1, tt2, tt1); in add()
139 SecP384R1Field.reduce(tt1, Y3.x); in add()
DSecP256K1Point.java55 int[] tt1 = Nat256.createExt(); in add() local
91 U1 = tt1; in add()
127 Nat256.mul(S1, G, tt1); in add()
138 SecP256K1Field.multiplyAddToExt(Y3.x, R, tt1); in add()
139 SecP256K1Field.reduce(tt1, Y3.x); in add()
DSecP224K1Point.java55 int[] tt1 = Nat224.createExt(); in add() local
91 U1 = tt1; in add()
127 Nat224.mul(S1, G, tt1); in add()
138 SecP224K1Field.multiplyAddToExt(Y3.x, R, tt1); in add()
139 SecP224K1Field.reduce(tt1, Y3.x); in add()
DSecP192K1Point.java55 int[] tt1 = Nat192.createExt(); in add() local
91 U1 = tt1; in add()
127 Nat192.mul(S1, G, tt1); in add()
138 SecP192K1Field.multiplyAddToExt(Y3.x, R, tt1); in add()
139 SecP192K1Field.reduce(tt1, Y3.x); in add()
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/custom/sec/
DSecP384R1Point.java50 int[] tt1 = Nat.create(24); in add() local
86 U1 = tt1; in add()
122 Nat384.mul(S1, G, tt1); in add()
134 SecP384R1Field.addExt(tt1, tt2, tt1); in add()
135 SecP384R1Field.reduce(tt1, Y3.x); in add()
DSecP256K1Point.java51 int[] tt1 = Nat256.createExt(); in add() local
87 U1 = tt1; in add()
123 Nat256.mul(S1, G, tt1); in add()
134 SecP256K1Field.multiplyAddToExt(Y3.x, R, tt1); in add()
135 SecP256K1Field.reduce(tt1, Y3.x); in add()
DSecP192K1Point.java51 int[] tt1 = Nat192.createExt(); in add() local
87 U1 = tt1; in add()
123 Nat192.mul(S1, G, tt1); in add()
134 SecP192K1Field.multiplyAddToExt(Y3.x, R, tt1); in add()
135 SecP192K1Field.reduce(tt1, Y3.x); in add()
DSecP224K1Point.java51 int[] tt1 = Nat224.createExt(); in add() local
87 U1 = tt1; in add()
123 Nat224.mul(S1, G, tt1); in add()
134 SecP224K1Field.multiplyAddToExt(Y3.x, R, tt1); in add()
135 SecP224K1Field.reduce(tt1, Y3.x); in add()
DSecP256R1Point.java50 int[] tt1 = Nat256.createExt(); in add() local
86 U1 = tt1; in add()
122 Nat256.mul(S1, G, tt1); in add()
133 SecP256R1Field.multiplyAddToExt(Y3.x, R, tt1); in add()
134 SecP256R1Field.reduce(tt1, Y3.x); in add()
/external/bouncycastle/repackaged_platform/bcprov/src/main/java/com/android/internal/org/bouncycastle/math/ec/custom/sec/
DSecP384R1Point.java54 int[] tt1 = Nat.create(24); in add() local
90 U1 = tt1; in add()
126 Nat384.mul(S1, G, tt1); in add()
138 SecP384R1Field.addExt(tt1, tt2, tt1); in add()
139 SecP384R1Field.reduce(tt1, Y3.x); in add()
DSecP192K1Point.java55 int[] tt1 = Nat192.createExt(); in add() local
91 U1 = tt1; in add()
127 Nat192.mul(S1, G, tt1); in add()
138 SecP192K1Field.multiplyAddToExt(Y3.x, R, tt1); in add()
139 SecP192K1Field.reduce(tt1, Y3.x); in add()

123