• Home
  • Raw
  • Download

Lines Matching refs:distance

233                           SkScalar distance, int mint, int maxt, unsigned ptIndex) {  in compute_quad_segs()  argument
242 distance = this->compute_quad_segs(tmp, distance, mint, halft, ptIndex); in compute_quad_segs()
243 distance = this->compute_quad_segs(&tmp[2], distance, halft, maxt, ptIndex); in compute_quad_segs()
246 SkScalar prevD = distance; in compute_quad_segs()
247 distance += d; in compute_quad_segs()
248 if (distance > prevD) { in compute_quad_segs()
250 seg->fDistance = distance; in compute_quad_segs()
256 return distance; in compute_quad_segs()
259 SkScalar SkPathMeasure::compute_conic_segs(const SkConic& conic, SkScalar distance, in compute_conic_segs() argument
268 return distance; in compute_conic_segs()
271 distance = this->compute_conic_segs(conic, distance, mint, minPt, halft, halfPt, ptIndex); in compute_conic_segs()
272 distance = this->compute_conic_segs(conic, distance, halft, halfPt, maxt, maxPt, ptIndex); in compute_conic_segs()
275 SkScalar prevD = distance; in compute_conic_segs()
276 distance += d; in compute_conic_segs()
277 if (distance > prevD) { in compute_conic_segs()
279 seg->fDistance = distance; in compute_conic_segs()
285 return distance; in compute_conic_segs()
289 SkScalar distance, int mint, int maxt, unsigned ptIndex) { in compute_cubic_segs() argument
298 distance = this->compute_cubic_segs(tmp, distance, mint, halft, ptIndex); in compute_cubic_segs()
299 distance = this->compute_cubic_segs(&tmp[3], distance, halft, maxt, ptIndex); in compute_cubic_segs()
302 SkScalar prevD = distance; in compute_cubic_segs()
303 distance += d; in compute_cubic_segs()
304 if (distance > prevD) { in compute_cubic_segs()
306 seg->fDistance = distance; in compute_cubic_segs()
312 return distance; in compute_cubic_segs()
318 SkScalar distance = 0; in buildSegments() local
350 SkScalar prevD = distance; in buildSegments()
351 distance += d; in buildSegments()
352 if (distance > prevD) { in buildSegments()
354 seg->fDistance = distance; in buildSegments()
364 SkScalar prevD = distance; in buildSegments()
368 distance += length; in buildSegments()
370 seg->fDistance = distance; in buildSegments()
376 distance = this->compute_quad_segs(pts, distance, 0, kMaxTValue, ptIndex); in buildSegments()
378 if (distance > prevD) { in buildSegments()
386 SkScalar prevD = distance; in buildSegments()
387 distance = this->compute_conic_segs(conic, distance, 0, conic.fPts[0], in buildSegments()
389 if (distance > prevD) { in buildSegments()
400 SkScalar prevD = distance; in buildSegments()
401 distance = this->compute_cubic_segs(pts, distance, 0, kMaxTValue, ptIndex); in buildSegments()
402 if (distance > prevD) { in buildSegments()
425 fLength = distance; in buildSegments()
434 SkScalar distance = 0; in buildSegments() local
438 SkASSERT(seg->fDistance > distance); in buildSegments()
449 distance = seg->fDistance; in buildSegments()
576 SkScalar distance, SkScalar* t) { in distanceToSegment() argument
578 SkASSERT(distance >= 0 && distance <= length); in distanceToSegment()
583 int index = SkTKSearch<Segment, SkScalar>(seg, count, distance); in distanceToSegment()
600 SkASSERT(distance >= startD); in distanceToSegment()
603 *t = startT + (seg->getScalarT() - startT) * (distance - startD) / (seg->fDistance - startD); in distanceToSegment()
607 bool SkPathMeasure::getPosTan(SkScalar distance, SkPoint* pos, SkVector* tangent) { in getPosTan() argument
611 if (count == 0 || length == 0 || SkScalarIsNaN(distance)) { in getPosTan()
616 if (distance < 0) { in getPosTan()
617 distance = 0; in getPosTan()
618 } else if (distance > length) { in getPosTan()
619 distance = length; in getPosTan()
623 const Segment* seg = this->distanceToSegment(distance, &t); in getPosTan()
632 bool SkPathMeasure::getMatrix(SkScalar distance, SkMatrix* matrix, in getMatrix() argument
637 if (this->getPosTan(distance, &position, &tangent)) { in getMatrix()