Lines Matching refs:seg
27 const SkPathMeasure::Segment* SkPathMeasure::NextSegment(const Segment* seg) { in NextSegment() argument
28 unsigned ptIndex = seg->fPtIndex; in NextSegment()
31 ++seg; in NextSegment()
32 } while (seg->fPtIndex == ptIndex); in NextSegment()
33 return seg; in NextSegment()
244 Segment* seg = fSegments.append(); in compute_quad_segs() local
245 seg->fDistance = distance; in compute_quad_segs()
246 seg->fPtIndex = ptIndex; in compute_quad_segs()
247 seg->fType = kQuad_SegType; in compute_quad_segs()
248 seg->fTValue = maxt; in compute_quad_segs()
267 Segment* seg = fSegments.append(); in compute_conic_segs() local
268 seg->fDistance = distance; in compute_conic_segs()
269 seg->fPtIndex = ptIndex; in compute_conic_segs()
270 seg->fType = kConic_SegType; in compute_conic_segs()
271 seg->fTValue = maxt; in compute_conic_segs()
291 Segment* seg = fSegments.append(); in compute_cubic_segs() local
292 seg->fDistance = distance; in compute_cubic_segs()
293 seg->fPtIndex = ptIndex; in compute_cubic_segs()
294 seg->fType = kCubic_SegType; in compute_cubic_segs()
295 seg->fTValue = maxt; in compute_cubic_segs()
307 Segment* seg; in buildSegments() local
336 seg = fSegments.append(); in buildSegments()
337 seg->fDistance = distance; in buildSegments()
338 seg->fPtIndex = ptIndex; in buildSegments()
339 seg->fType = kLine_SegType; in buildSegments()
340 seg->fTValue = kMaxTValue; in buildSegments()
352 Segment* seg = fSegments.append(); in buildSegments() local
353 seg->fDistance = distance; in buildSegments()
354 seg->fPtIndex = ptIndex; in buildSegments()
355 seg->fType = kQuad_SegType; in buildSegments()
356 seg->fTValue = kMaxTValue; in buildSegments()
407 const Segment* seg = fSegments.begin(); in buildSegments() local
413 while (seg < stop) { in buildSegments()
414 SkASSERT(seg->fDistance > distance); in buildSegments()
415 SkASSERT(seg->fPtIndex >= ptIndex); in buildSegments()
416 SkASSERT(seg->fTValue > 0); in buildSegments()
418 const Segment* s = seg; in buildSegments()
425 distance = seg->fDistance; in buildSegments()
426 ptIndex = seg->fPtIndex; in buildSegments()
427 seg += 1; in buildSegments()
557 const Segment* seg = fSegments.begin(); in distanceToSegment() local
560 int index = SkTKSearch<Segment, SkScalar>(seg, count, distance); in distanceToSegment()
563 seg = &seg[index]; in distanceToSegment()
569 startD = seg[-1].fDistance; in distanceToSegment()
570 if (seg[-1].fPtIndex == seg->fPtIndex) { in distanceToSegment()
571 SkASSERT(seg[-1].fType == seg->fType); in distanceToSegment()
572 startT = seg[-1].getScalarT(); in distanceToSegment()
576 SkASSERT(seg->getScalarT() > startT); in distanceToSegment()
578 SkASSERT(seg->fDistance > startD); in distanceToSegment()
580 *t = startT + (seg->getScalarT() - startT) * (distance - startD) / (seg->fDistance - startD); in distanceToSegment()
581 return seg; in distanceToSegment()
604 const Segment* seg = this->distanceToSegment(distance, &t); in getPosTan() local
606 compute_pos_tan(&fPts[seg->fPtIndex], seg->fType, t, pos, tangent); in getPosTan()
656 const Segment* seg = this->distanceToSegment(startD, &startT); in getSegment() local
658 SkASSERT(seg <= stopSeg); in getSegment()
661 compute_pos_tan(&fPts[seg->fPtIndex], seg->fType, startT, &p, nullptr); in getSegment()
665 if (seg->fPtIndex == stopSeg->fPtIndex) { in getSegment()
666 SkPathMeasure_segTo(&fPts[seg->fPtIndex], seg->fType, startT, stopT, dst); in getSegment()
669 SkPathMeasure_segTo(&fPts[seg->fPtIndex], seg->fType, startT, SK_Scalar1, dst); in getSegment()
670 seg = SkPathMeasure::NextSegment(seg); in getSegment()
672 } while (seg->fPtIndex < stopSeg->fPtIndex); in getSegment()
673 SkPathMeasure_segTo(&fPts[seg->fPtIndex], seg->fType, 0, stopT, dst); in getSegment()
700 const Segment* seg = &fSegments[i]; in dump() local
702 i, seg->fDistance, seg->fPtIndex, seg->getScalarT(), in dump()
703 seg->fType); in dump()