Home
last modified time | relevance | path

Searched refs:fP1 (Results 1 – 4 of 4) sorted by relevance

/external/skia/src/utils/
DSkInsetConvexPolygon.cpp14 SkPoint fP1; member
99 SkVector v0 = s0.fP1 - s0.fP0; in compute_intersection()
100 SkVector v1 = s1.fP1 - s1.fP0; in compute_intersection()
106 if (s0.fP1.equalsWithinTolerance(s1.fP0)) { in compute_intersection()
107 *p = s0.fP1; in compute_intersection()
112 if (s1.fP1.equalsWithinTolerance(s0.fP0)) { in compute_intersection()
113 *p = s1.fP1; in compute_intersection()
205 &edgeData[i].fInset.fP0, &edgeData[i].fInset.fP1); in SkInsetConvexPolygon()
248 edgeData[currIndex].fInset.fP1, in SkInsetConvexPolygon()
249 edgeData[prevIndex].fInset.fP1); in SkInsetConvexPolygon()
[all …]
/external/skia/src/effects/gradients/
DSk4fLinearGradient.cpp141 SkASSERT(in_range(fx, fIntervals->front().fP0, fIntervals->back().fP1)); in findInterval()
148 while (!in_range(fx, fCachedInterval->fP0, fCachedInterval->fP1)) { in findInterval()
164 SkASSERT(in_range(fx, i0->fP0, i1->fP1)); in findInterval()
168 if (in_range(fx, i0->fP0, i->fP1)) { in findInterval()
171 SkASSERT(in_range(fx, i->fP1, i1->fP1)); in findInterval()
176 SkASSERT(in_range(fx, i0->fP0, i0->fP1)); in findInterval()
299 : fAdvX(is_vertical ? SK_ScalarInfinity : (i->fP1 - fx) / dx) in LinearIntervalProcessor()
308 SkASSERT(in_range(fx, i->fP0, i->fP1)); in LinearIntervalProcessor()
311 const auto spanX = (lastInterval->fP1 - firstInterval->fP0) / dx; in LinearIntervalProcessor()
330 SkASSERT(fAdvX <= (fInterval->fP1 - fInterval->fP0) / fDx || !std::isfinite(fAdvX)); in currentAdvance()
[all …]
DSk4fGradientBase.h27 SkASSERT(fP0 < fP1); in contains()
28 return t >= fP0 && t <= fP1; in contains()
32 SkScalar fP0, fP1; member
DSk4fGradientBase.cpp105 SkASSERT(buffer->empty() || buffer->back().fP1 == 2 - p0); in addMirrorIntervals()
123 , fP1(p1) in Sk4fGradientInterval()
210 SkASSERT(fIntervals.empty() || fIntervals.back().fP1 == p0); in init()
235 SkASSERT(t >= i0->fP0 && t <= i1->fP1); in find()
239 if (t > i->fP1) { in find()
255 SkASSERT(t >= fIntervals.front().fP0 && t <= fIntervals.back().fP1); in findNext()