Lines Matching refs:fPts
80 int index = fPts.count(); in addPt()
81 *fPts.push() = pt; in addPt()
93 fPts.pop(); in popLastPt()
104 fPts.removeShuffle(0); in popFirstPtShuffle()
119 fPts[index] = pt; in updatePt()
134 fPts.rewind(); in rewind()
159 fNorms.append(fPts.count()); in computeNormals()
160 fNorms[0] = fPts[1] - fPts[0]; in computeNormals()
161 fNorms.top() = fPts[0] - fPts.top(); in computeNormals()
166 fNorms[cur] = normalToVector(fPts[cur + 1] - fPts[cur]); in computeNormals()
331 SkPoint v = p - fPts[edgeIdx]; in computeDepthFromEdge()
348 SkScalar t = perp_intersect(fPts[startIdx], bisector, fPts[edgeIdx], norm); in computePtAlongBisector()
351 SkASSERT(startIdx < fPts.count()); in computePtAlongBisector()
352 newP = fPts[startIdx]; in computePtAlongBisector()
356 newP += fPts[startIdx]; in computePtAlongBisector()
423 if (duplicate_pt(fPts[this->numPts()-1], fPts[0])) { in extractFromPath()
430 if (points_are_colinear_and_b_is_middle(fPts[fPts.count() - 2], fPts.top(), fPts[0])) { in extractFromPath()
432 } else if (points_are_colinear_and_b_is_middle(fPts.top(), fPts[0], fPts[1])) { in extractFromPath()
454 fNorms[0] = SkPointPriv::MakeOrthog(fPts[1] - fPts[0], fSide); in extractFromPath()
529 perp2 += fPts[originalIdx]; in createOuterRing()
557 miter += fPts[originalIdx]; in createOuterRing()
587 miter += fPts[originalIdx]; in createOuterRing()
825 SkASSERT(fPts.count() == fMovable.count()); in validate()
826 SkASSERT(fPts.count() == fCoverages.count()); in validate()
827 SkASSERT(fPts.count() == fCurveState.count()); in validate()
840 for (int i = 0; i < fPts.count(); ++i) { in init()
841 fPts[i].fNorm = norms[i]; in init()
842 fPts[i].fBisector = bisectors[i]; in init()
848 for (int cur = 0; cur < fPts.count(); ++cur) { in computeNormals()
849 int next = (cur + 1) % fPts.count(); in computeNormals()
851 fPts[cur].fNorm = tess.point(fPts[next].fIndex) - tess.point(fPts[cur].fIndex); in computeNormals()
852 SkPoint::Normalize(&fPts[cur].fNorm); in computeNormals()
853 fPts[cur].fNorm = SkPointPriv::MakeOrthog(fPts[cur].fNorm, tess.side()); in computeNormals()
858 int prev = fPts.count() - 1; in computeBisectors()
859 for (int cur = 0; cur < fPts.count(); prev = cur, ++cur) { in computeBisectors()
860 fPts[cur].fBisector = fPts[cur].fNorm + fPts[prev].fNorm; in computeBisectors()
861 if (!fPts[cur].fBisector.normalize()) { in computeBisectors()
862 fPts[cur].fBisector = in computeBisectors()
863 SkPointPriv::MakeOrthog(fPts[cur].fNorm, (SkPointPriv::Side)-tess.side()) + in computeBisectors()
864 SkPointPriv::MakeOrthog(fPts[prev].fNorm, tess.side()); in computeBisectors()
865 SkAssertResult(fPts[cur].fBisector.normalize()); in computeBisectors()
867 fPts[cur].fBisector.negate(); // make the bisector face in in computeBisectors()
876 if (fPts.count() < 3) { in isConvex()
880 SkPoint prev = tess.point(fPts[0].fIndex) - tess.point(fPts.top().fIndex); in isConvex()
881 SkPoint cur = tess.point(fPts[1].fIndex) - tess.point(fPts[0].fIndex); in isConvex()
886 for (int i = 1; i < fPts.count(); ++i) { in isConvex()
887 int next = (i + 1) % fPts.count(); in isConvex()
889 cur = tess.point(fPts[next].fIndex) - tess.point(fPts[i].fIndex); in isConvex()
915 points_are_colinear_and_b_is_middle(fPts[fPts.count() - 2], fPts.top(), p)) { in lineTo()
1035 for (int cur = 0; cur < fPts.count(); ++cur) { in draw()
1036 int next = (cur + 1) % fPts.count(); in draw()
1039 tess.point(fPts[cur].fIndex), in draw()
1040 tess.point(fPts[next].fIndex), in draw()
1043 SkPoint mid = tess.point(fPts[cur].fIndex) + tess.point(fPts[next].fIndex); in draw()
1046 if (fPts.count()) { in draw()
1047 draw_arrow(canvas, mid, fPts[cur].fNorm, kArrowLength, SK_ColorRED); in draw()
1048 mid.fX += (kArrowLength/2) * fPts[cur].fNorm.fX; in draw()
1049 mid.fY += (kArrowLength/2) * fPts[cur].fNorm.fY; in draw()
1056 if (fPts.count()) { in draw()
1057 draw_arrow(canvas, tess.point(fPts[cur].fIndex), fPts[cur].fBisector, in draw()