Lines Matching refs:fPts
89 int index = fPts.count(); in addPt()
90 *fPts.push() = pt; in addPt()
102 fPts.pop(); in popLastPt()
113 fPts.removeShuffle(0); in popFirstPtShuffle()
128 fPts[index] = pt; in updatePt()
143 fPts.rewind(); in rewind()
168 fNorms.append(fPts.count()); in computeNormals()
169 fNorms[0] = fPts[1] - fPts[0]; in computeNormals()
170 fNorms.top() = fPts[0] - fPts.top(); in computeNormals()
175 fNorms[cur] = normalToVector(fPts[cur + 1] - fPts[cur]); in computeNormals()
340 SkPoint v = p - fPts[edgeIdx]; in computeDepthFromEdge()
357 SkScalar t = perp_intersect(fPts[startIdx], bisector, fPts[edgeIdx], norm); in computePtAlongBisector()
360 SkASSERT(startIdx < fPts.count()); in computePtAlongBisector()
361 newP = fPts[startIdx]; in computePtAlongBisector()
365 newP += fPts[startIdx]; in computePtAlongBisector()
409 if (!SkPathPriv::AllPointsEq(e.fPts, 2)) { in extractFromPath()
410 this->lineTo(m, e.fPts[1], kSharp_CurveState); in extractFromPath()
414 if (!SkPathPriv::AllPointsEq(e.fPts, 3)) { in extractFromPath()
415 this->quadTo(m, e.fPts); in extractFromPath()
419 if (!SkPathPriv::AllPointsEq(e.fPts, 4)) { in extractFromPath()
420 this->cubicTo(m, e.fPts); in extractFromPath()
424 if (!SkPathPriv::AllPointsEq(e.fPts, 3)) { in extractFromPath()
425 this->conicTo(m, e.fPts, iter.conicWeight()); in extractFromPath()
436 if (duplicate_pt(fPts[this->numPts()-1], fPts[0])) { in extractFromPath()
444 if (points_are_colinear_and_b_is_middle(fPts[fPts.count() - 2], fPts.top(), fPts[0], in extractFromPath()
447 } else if (points_are_colinear_and_b_is_middle(fPts.top(), fPts[0], fPts[1], in extractFromPath()
470 fNorms[0] = SkPointPriv::MakeOrthog(fPts[1] - fPts[0], fSide); in extractFromPath()
545 perp2 += fPts[originalIdx]; in createOuterRing()
573 miter += fPts[originalIdx]; in createOuterRing()
603 miter += fPts[originalIdx]; in createOuterRing()
841 SkASSERT(fPts.count() == fMovable.count()); in validate()
842 SkASSERT(fPts.count() == fCoverages.count()); in validate()
843 SkASSERT(fPts.count() == fCurveState.count()); in validate()
856 for (int i = 0; i < fPts.count(); ++i) { in init()
857 fPts[i].fNorm = norms[i]; in init()
858 fPts[i].fBisector = bisectors[i]; in init()
864 for (int cur = 0; cur < fPts.count(); ++cur) { in computeNormals()
865 int next = (cur + 1) % fPts.count(); in computeNormals()
867 fPts[cur].fNorm = tess.point(fPts[next].fIndex) - tess.point(fPts[cur].fIndex); in computeNormals()
868 SkPoint::Normalize(&fPts[cur].fNorm); in computeNormals()
869 fPts[cur].fNorm = SkPointPriv::MakeOrthog(fPts[cur].fNorm, tess.side()); in computeNormals()
874 int prev = fPts.count() - 1; in computeBisectors()
875 for (int cur = 0; cur < fPts.count(); prev = cur, ++cur) { in computeBisectors()
876 fPts[cur].fBisector = fPts[cur].fNorm + fPts[prev].fNorm; in computeBisectors()
877 if (!fPts[cur].fBisector.normalize()) { in computeBisectors()
878 fPts[cur].fBisector = in computeBisectors()
879 SkPointPriv::MakeOrthog(fPts[cur].fNorm, (SkPointPriv::Side)-tess.side()) + in computeBisectors()
880 SkPointPriv::MakeOrthog(fPts[prev].fNorm, tess.side()); in computeBisectors()
881 SkAssertResult(fPts[cur].fBisector.normalize()); in computeBisectors()
883 fPts[cur].fBisector.negate(); // make the bisector face in in computeBisectors()
892 if (fPts.count() < 3) { in isConvex()
896 SkPoint prev = tess.point(fPts[0].fIndex) - tess.point(fPts.top().fIndex); in isConvex()
897 SkPoint cur = tess.point(fPts[1].fIndex) - tess.point(fPts[0].fIndex); in isConvex()
902 for (int i = 1; i < fPts.count(); ++i) { in isConvex()
903 int next = (i + 1) % fPts.count(); in isConvex()
905 cur = tess.point(fPts[next].fIndex) - tess.point(fPts[i].fIndex); in isConvex()
931 points_are_colinear_and_b_is_middle(fPts[fPts.count() - 2], fPts.top(), p, in lineTo()
1056 for (int cur = 0; cur < fPts.count(); ++cur) { in draw()
1057 int next = (cur + 1) % fPts.count(); in draw()
1060 tess.point(fPts[cur].fIndex), in draw()
1061 tess.point(fPts[next].fIndex), in draw()
1064 SkPoint mid = tess.point(fPts[cur].fIndex) + tess.point(fPts[next].fIndex); in draw()
1067 if (fPts.count()) { in draw()
1068 draw_arrow(canvas, mid, fPts[cur].fNorm, kArrowLength, SK_ColorRED); in draw()
1069 mid.fX += (kArrowLength/2) * fPts[cur].fNorm.fX; in draw()
1070 mid.fY += (kArrowLength/2) * fPts[cur].fNorm.fY; in draw()
1077 if (fPts.count()) { in draw()
1078 draw_arrow(canvas, tess.point(fPts[cur].fIndex), fPts[cur].fBisector, in draw()