Searched refs:newPt (Results 1 - 6 of 6) sorted by relevance
/external/skia/src/gpu/batches/ |
H A D | GrAAConvexTessellator.cpp | 616 SkPoint newPt = lastRing.bisector(minEdgeIdx); 617 newPt.scale(minT); 618 newPt += this->point(lastRing.index(minEdgeIdx)); 620 SkScalar depth = this->computeDepthFromEdge(lastRing.origEdgeID(minEdgeIdx), newPt); 637 depth, &newPt)) { 641 dst[0] = fCandidateVerts.addNewPt(newPt, 650 depth, &newPt)) { 654 if (!duplicate_pt(newPt, fCandidateVerts.lastPoint())) { 655 dst[cur] = fCandidateVerts.addNewPt(newPt, 668 depth, &newPt)) { [all...] |
H A D | GrAAConvexTessellator.h | 81 int addNewPt(const SkPoint& newPt, int originatingIdx, int origEdge, bool needsToBeNew) { argument 83 pt->fPt = newPt;
|
/external/skia/src/pathops/ |
H A D | SkOpCoincidence.cpp | 109 SkOpPtT* newPt; local 112 newPt = oStart->segment()->addT(newT, SkOpSegment::kAllowAlias, allocator); 113 if (!newPt) { 116 newPt->fPt = test->pt(); 117 test->ptT()->addOpp(newPt); 120 newPt = start->segment()->addT(newT, SkOpSegment::kAllowAlias, allocator); 121 if (!newPt) { 124 newPt->fPt = oTest->pt(); 125 oTest->ptT()->addOpp(newPt);
|
H A D | SkOpSegment.cpp | 164 const SkPoint& newPt = endPtT.fPt; local 165 if (newPt == oldPt) { 168 SkPoint line[2] = { newPt, oldPt }; 183 if (newPt == segment->fPts[0]) { 186 if (newPt == segment->fPts[SkPathOpsVerbToPoints(segment->fVerb)]) { 234 ptT->fPt = newPt;
|
H A D | SkPathOpsDebug.cpp | 417 const SkPoint& newPt = endPtT.fPt; local 418 if (newPt == oldPt) { 421 SkPoint line[2] = { newPt, oldPt }; 436 if (newPt == segment->fPts[0]) { 439 if (newPt == segment->fPts[SkPathOpsVerbToPoints(segment->fVerb)]) { 486 log->record(kMissingIntersection_Glitch, id, checkSpan, segment, i[0][0], newPt);
|
/external/skia/tests/ |
H A D | PathTest.cpp | 2322 SkPoint newPt = SkPoint::Make(pts[i].fX * 2, pts[i].fY * 3); local 2323 REPORTER_ASSERT(reporter, newPt == pts1[i]);
|
Completed in 122 milliseconds