| /external/skia/tests/ |
| D | PathOpsQuadIntersectionTest.cpp | 40 SkDPoint xy1 = quad1.ptAtT(tt1); in standardTestCases()
42 SkDPoint xy2 = quad2.ptAtT(tt2); in standardTestCases()
270 SkDPoint xy1 = quad1.ptAtT(tt1); in oneOffTest1()
272 SkDPoint xy2 = quad2.ptAtT(tt2); in oneOffTest1()
323 SkDPoint pt1 = quad1.ptAtT(tt1); in coincidentTestOne()
324 SkDPoint pt2 = quad2.ptAtT(tt2); in coincidentTestOne()
365 SkDPoint onQuad = q1.ptAtT(t); in pointFinder()
415 t1[0] = quad1.ptAtT(t1Seed - t1Step); in intersectionFinder()
416 t1[1] = quad1.ptAtT(t1Seed); in intersectionFinder()
417 t1[2] = quad1.ptAtT(t1Seed + t1Step); in intersectionFinder()
[all …]
|
| D | PathOpsCubicIntersectionTest.cpp | 53 SkDPoint xy1 = cubic1.ptAtT(tt1); in standardTestCases()
55 SkDPoint xy2 = cubic2.ptAtT(tt2); in standardTestCases()
347 xy1 = cubic1.ptAtT(tt1); in oneOff()
349 xy2 = cubic2.ptAtT(tt2); in oneOff()
434 SkDPoint xy1 = cubic1.ptAtT(tt1); in CubicIntersection_RandTest()
436 SkDPoint xy2 = cubic2.ptAtT(tt2); in CubicIntersection_RandTest()
450 t1[0] = cubic1.ptAtT(t1Seed - t1Step); in intersectionFinder()
451 t1[1] = cubic1.ptAtT(t1Seed); in intersectionFinder()
452 t1[2] = cubic1.ptAtT(t1Seed + t1Step); in intersectionFinder()
453 t2[0] = cubic2.ptAtT(t2Seed - t2Step); in intersectionFinder()
[all …]
|
| D | PathOpsCubicLineIntersectionTest.cpp | 67 SkDPoint xy1 = cubic.ptAtT(tt1); in testOne()
69 SkDPoint xy2 = line.ptAtT(tt2); in testOne()
97 SkDPoint prev = cubic.ptAtT(cubicT * 2 - 1); in PathOpsCubicLineIntersectionOneOffTest()
98 SkDPoint sect = cubic.ptAtT(cubicT); in PathOpsCubicLineIntersectionOneOffTest()
103 SkDPoint prevL = line.ptAtT(i[1][0] - 0.0000007); in PathOpsCubicLineIntersectionOneOffTest()
105 SkDPoint nextL = line.ptAtT(i[1][0] + 0.0000007); in PathOpsCubicLineIntersectionOneOffTest()
|
| D | PathOpsQuadLineIntersectionTest.cpp | 88 SkDPoint quadXY = quad.ptAtT(quadT); in testOneOffs()
90 SkDPoint lineXY = line.ptAtT(lineT); in testOneOffs()
132 SkDPoint t1 = quad.ptAtT(tt1); in PathOpsQuadLineIntersectionTest()
135 SkDPoint t2 = line.ptAtT(tt2); in PathOpsQuadLineIntersectionTest()
|
| D | PathOpsAngleTest.cpp | 260 start = dLine.ptAtT(set[idx].tStart).asSkPoint(); in setup()
261 end = dLine.ptAtT(set[idx].tEnd).asSkPoint(); in setup()
272 start = dQuad.ptAtT(set[idx].tStart).asSkPoint(); in setup()
273 end = dQuad.ptAtT(set[idx].tEnd).asSkPoint(); in setup()
284 start = dCubic.ptAtT(set[idx].tStart).asSkPoint(); in setup()
285 end = dCubic.ptAtT(set[idx].tEnd).asSkPoint(); in setup()
|
| D | PathOpsQuadLineIntersectionThreadedTest.cpp | 58 SkDPoint quadXY = quad.ptAtT(quadT); in testLineIntersect()
60 SkDPoint lineXY = line.ptAtT(lineT); in testLineIntersect()
92 SkDPoint xy = quad.ptAtT(tIndex / 4.0); in testQuadLineIntersectMain()
|
| D | PathOpsCubicQuadIntersectionTest.cpp | 77 SkDPoint xy1 = cubic.ptAtT(tt1); in PathOpsCubicQuadIntersectionTest()
79 SkDPoint xy2 = quad.ptAtT(tt2); in PathOpsCubicQuadIntersectionTest()
|
| D | PathOpsLineIntersectionTest.cpp | 77 SkDPoint result1 = line1.ptAtT(ts[0][i]); in check_results()
78 SkDPoint result2 = line2.ptAtT(ts[1][i]); in check_results()
81 result2 = line2.ptAtT(ts[1][i ^ 1]); in check_results()
|
| D | PathOpsDLineTest.cpp | 50 SkDPoint mid = line.ptAtT(.5); in PathOpsLineUtilitiesTest()
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| D | SkDQuadIntersection.cpp | 123 SkDPoint mid = q2.ptAtT(tMid); in add_intercept()
141 SkDPoint pt2 = q1.ptAtT(rootTs[0][0]); in add_intercept()
163 SkDPoint qPt = q2.ptAtT(t); in is_linear_inner()
164 SkDPoint lPt = testLines[index]->ptAtT(rootTs[1][idx2]); in is_linear_inner()
186 SkDPoint end = q2.ptAtT(t2s); in is_linear_inner()
191 end = q2.ptAtT(t2e); in is_linear_inner()
298 if (calcMask & (1 << 1)) t1[1] = quad1.ptAtT(*t1Seed); in binary_search()
299 if (calcMask & (1 << 4)) t2[1] = quad2.ptAtT(*t2Seed); in binary_search()
308 if (calcMask & (1 << 0)) t1[0] = quad1.ptAtT(*t1Seed - tStep); in binary_search()
309 if (calcMask & (1 << 2)) t1[2] = quad1.ptAtT(*t1Seed + tStep); in binary_search()
[all …]
|
| D | SkPathOpsCurve.h | 17 return line.ptAtT(t); in dline_xy_at_t()
23 return quad.ptAtT(t); in dquad_xy_at_t()
29 return cubic.ptAtT(t); in dcubic_xy_at_t()
126 SkDPoint dst[2] = { line.ptAtT(startT), line.ptAtT(endT) }; in line_is_vertical()
|
| D | SkDCubicLineIntersection.cpp | 122 SkDPoint cPt = fCubic.ptAtT(cubicT); in intersect()
136 SkDPoint cubicMidPt = fCubic.ptAtT(cubicMidT); in intersect()
165 SkDPoint pt = fCubic.ptAtT(cubicT); in horizontalIntersect()
193 SkDPoint pt = fCubic.ptAtT(cubicT); in verticalIntersect()
287 SkDPoint xy = fCubic.ptAtT(t); in findLineT()
306 *pt = fLine.ptAtT(lT); in pinTs()
308 *pt = fCubic.ptAtT(cT); in pinTs()
355 fPt[index] = cubic.ptAtT(fT[0][index]); in intersectRay()
|
| D | SkDQuadLineIntersection.cpp | 180 SkDPoint pt = fQuad.ptAtT(quadT); in horizontalIntersect()
211 SkDPoint pt = fQuad.ptAtT(quadT); in verticalIntersect()
304 SkDPoint xy = fQuad.ptAtT(t); in findLineT()
323 *pt = fLine.ptAtT(lT); in pinTs()
325 *pt = fQuad.ptAtT(qT); in pinTs()
356 SkDPoint qPt = quad.ptAtT(t); in horizontalIntersect()
371 SkDPoint qPt = quad.ptAtT(t); in verticalIntersect()
410 fPt[index] = quad.ptAtT(fT[0][index]); in intersectRay()
|
| D | SkDCubicIntersection.cpp | 124 SkDPoint p1 = cubic1.ptAtT(to1); in intersect()
125 SkDPoint p2 = cubic2.ptAtT(to2); in intersect()
264 SkDPoint testPt1 = c1.ptAtT(testT1); in cubicCheckCoincidence()
265 SkDPoint testPt2 = c2.ptAtT(testT2); in cubicCheckCoincidence()
388 pt = cubic.ptAtT((i[cubicIndex][0] + i[cubicIndex][1]) / 2); in closeStart()
397 pt = cubic.ptAtT((i[cubicIndex][last] + i[cubicIndex][last - 1]) / 2); in closeEnd()
531 SkDPoint pt = c1.ptAtT(tAvg); in intersect()
537 pt = c2.ptAtT(tAvg); in intersect()
549 SkDPoint pt = c1.ptAtT(tAvg); in intersect()
555 pt = c2.ptAtT(tAvg); in intersect()
[all …]
|
| D | SkPathOpsRect.cpp | 29 add(quad.ptAtT(tValues[x])); in setBounds()
56 add(c.ptAtT(tValues[x])); in setBounds()
|
| D | SkPathOpsLine.cpp | 44 SkDPoint SkDLine::ptAtT(double t) const { in ptAtT() function in SkDLine
80 SkDPoint realPt = ptAtT(t); in nearPoint()
101 SkDPoint realPt = ptAtT(t); in nearRay()
|
| D | SkPathOpsLine.h | 38 SkDPoint ptAtT(double t) const;
|
| /external/skia/src/pathops/ |
| D | SkDQuadIntersection.cpp | 123 SkDPoint mid = q2.ptAtT(tMid); in add_intercept()
141 SkDPoint pt2 = q1.ptAtT(rootTs[0][0]); in add_intercept()
163 SkDPoint qPt = q2.ptAtT(t); in is_linear_inner()
164 SkDPoint lPt = testLines[index]->ptAtT(rootTs[1][idx2]); in is_linear_inner()
186 SkDPoint end = q2.ptAtT(t2s); in is_linear_inner()
191 end = q2.ptAtT(t2e); in is_linear_inner()
298 if (calcMask & (1 << 1)) t1[1] = quad1.ptAtT(*t1Seed); in binary_search()
299 if (calcMask & (1 << 4)) t2[1] = quad2.ptAtT(*t2Seed); in binary_search()
308 if (calcMask & (1 << 0)) t1[0] = quad1.ptAtT(*t1Seed - tStep); in binary_search()
309 if (calcMask & (1 << 2)) t1[2] = quad1.ptAtT(*t1Seed + tStep); in binary_search()
[all …]
|
| D | SkPathOpsCurve.h | 17 return line.ptAtT(t); in dline_xy_at_t()
23 return quad.ptAtT(t); in dquad_xy_at_t()
29 return cubic.ptAtT(t); in dcubic_xy_at_t()
126 SkDPoint dst[2] = { line.ptAtT(startT), line.ptAtT(endT) }; in line_is_vertical()
|
| D | SkDCubicLineIntersection.cpp | 122 SkDPoint cPt = fCubic.ptAtT(cubicT); in intersect()
136 SkDPoint cubicMidPt = fCubic.ptAtT(cubicMidT); in intersect()
165 SkDPoint pt = fCubic.ptAtT(cubicT); in horizontalIntersect()
193 SkDPoint pt = fCubic.ptAtT(cubicT); in verticalIntersect()
287 SkDPoint xy = fCubic.ptAtT(t); in findLineT()
306 *pt = fLine.ptAtT(lT); in pinTs()
308 *pt = fCubic.ptAtT(cT); in pinTs()
355 fPt[index] = cubic.ptAtT(fT[0][index]); in intersectRay()
|
| D | SkDQuadLineIntersection.cpp | 180 SkDPoint pt = fQuad.ptAtT(quadT); in horizontalIntersect()
211 SkDPoint pt = fQuad.ptAtT(quadT); in verticalIntersect()
304 SkDPoint xy = fQuad.ptAtT(t); in findLineT()
323 *pt = fLine.ptAtT(lT); in pinTs()
325 *pt = fQuad.ptAtT(qT); in pinTs()
356 SkDPoint qPt = quad.ptAtT(t); in horizontalIntersect()
371 SkDPoint qPt = quad.ptAtT(t); in verticalIntersect()
410 fPt[index] = quad.ptAtT(fT[0][index]); in intersectRay()
|
| D | SkDCubicIntersection.cpp | 124 SkDPoint p1 = cubic1.ptAtT(to1); in intersect()
125 SkDPoint p2 = cubic2.ptAtT(to2); in intersect()
264 SkDPoint testPt1 = c1.ptAtT(testT1); in cubicCheckCoincidence()
265 SkDPoint testPt2 = c2.ptAtT(testT2); in cubicCheckCoincidence()
388 pt = cubic.ptAtT((i[cubicIndex][0] + i[cubicIndex][1]) / 2); in closeStart()
397 pt = cubic.ptAtT((i[cubicIndex][last] + i[cubicIndex][last - 1]) / 2); in closeEnd()
531 SkDPoint pt = c1.ptAtT(tAvg); in intersect()
537 pt = c2.ptAtT(tAvg); in intersect()
549 SkDPoint pt = c1.ptAtT(tAvg); in intersect()
555 pt = c2.ptAtT(tAvg); in intersect()
[all …]
|
| D | SkPathOpsRect.cpp | 29 add(quad.ptAtT(tValues[x])); in setBounds()
56 add(c.ptAtT(tValues[x])); in setBounds()
|
| D | SkPathOpsLine.cpp | 44 SkDPoint SkDLine::ptAtT(double t) const { in ptAtT() function in SkDLine
80 SkDPoint realPt = ptAtT(t); in nearPoint()
101 SkDPoint realPt = ptAtT(t); in nearRay()
|
| D | SkPathOpsLine.h | 38 SkDPoint ptAtT(double t) const;
|