Lines Matching refs:fNorms

138     fNorms.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()
162 SkScalar cross = SkPoint::CrossProduct(fNorms[0], fNorms.top()); in computeNormals()
164 fNorms[0] = normalToVector(fNorms[0]); in computeNormals()
165 for (int cur = 1; cur < fNorms.count() - 1; ++cur) { in computeNormals()
166 fNorms[cur] = normalToVector(fPts[cur + 1] - fPts[cur]); in computeNormals()
168 fNorms.top() = normalToVector(fNorms.top()); in computeNormals()
172 fBisectors.setCount(fNorms.count()); in computeBisectors()
176 fBisectors[cur] = fNorms[cur] + fNorms[prev]; in computeBisectors()
178 fBisectors[cur] = SkPointPriv::MakeOrthog(fNorms[cur], (SkPointPriv::Side)-fSide) + in computeBisectors()
179 SkPointPriv::MakeOrthog(fNorms[prev], fSide); in computeBisectors()
188 if (SkScalarAbs(fNorms[cur].dot(fNorms[prev])) > kCurveConnectionThreshold) { in computeBisectors()
272 fNorms.setCount(fNorms.count() + outerStrokeAndAARing.numPts()); in tessellate()
274 SkASSERT(outerStrokeAndAARing.index(i) < fNorms.count()); in tessellate()
275 fNorms[outerStrokeAndAARing.index(i)] = outerStrokeAndAARing.norm(i); in tessellate()
329 SkASSERT(edgeIdx < fNorms.count()); in computeDepthFromEdge()
332 SkScalar depth = -fNorms[edgeIdx].dot(v); in computeDepthFromEdge()
343 const SkPoint& norm = fNorms[edgeIdx]; in computePtAlongBisector()
440 SkASSERT(fNorms.empty()); in extractFromPath()
453 fNorms.append(2); in extractFromPath()
454 fNorms[0] = SkPointPriv::MakeOrthog(fPts[1] - fPts[0], fSide); in extractFromPath()
455 fNorms[0].normalize(); in extractFromPath()
456 fNorms[1] = -fNorms[0]; in extractFromPath()
457 SkASSERT(SkScalarNearlyEqual(1.0f, fNorms[0].length())); in extractFromPath()
470 fInitialRing.init(fNorms, fBisectors); in extractFromPath()
829 SkASSERT(!fBisectors.count() || fBisectors.count() == fNorms.count()); in validate()