Home
last modified time | relevance | path

Searched refs:fPt (Results 1 – 25 of 42) sorted by relevance

12

/external/chromium_org/third_party/skia/experimental/Intersection/
DIntersections.cpp37 bool s1in = between(cs1, s1, ce1) || startPt.approximatelyEqual(fPt[i1]) in insertCoincidentPair()
38 || startPt.approximatelyEqual(fPt[iEnd1]); in insertCoincidentPair()
39 bool e1in = between(cs1, e1, ce1) || endPt.approximatelyEqual(fPt[i1]) in insertCoincidentPair()
40 || endPt.approximatelyEqual(fPt[iEnd1]); in insertCoincidentPair()
51 bool s2in = between(cs2, s2, ce2) || startPt.approximatelyEqual(fPt[i2]) in insertCoincidentPair()
52 || startPt.approximatelyEqual(fPt[iEnd2]); in insertCoincidentPair()
53 bool e2in = between(cs2, e2, ce2) || endPt.approximatelyEqual(fPt[i2]) in insertCoincidentPair()
54 || endPt.approximatelyEqual(fPt[iEnd2]); in insertCoincidentPair()
58 fPt[i1] = startPt; in insertCoincidentPair()
61 fPt[i1] = endPt; in insertCoincidentPair()
[all …]
DIntersections.h20 bzero(fPt, sizeof(fPt)); in Intersections()
128 _Point fPt[9]; variable
DCubicIntersection_Test.cpp244 __FUNCTION__, tt1, xy1.x, xy1.y, intersections2.fPt[pt1].x,
245 intersections2.fPt[pt1].y, xy2.x, xy2.y, tt2);
279 __FUNCTION__, tt1, xy1.x, xy1.y, intersections3.fPt[pt1].x,
280 intersections3.fPt[pt1].y, xy2.x, xy2.y, tt2);
335 __FUNCTION__, tt1, xy1.x, xy1.y, intersections3.fPt[pt3].x, in oneOff3()
336 intersections3.fPt[pt3].y, xy2.x, xy2.y, tt2); in oneOff3()
DLineIntersection.cpp30 i.fPt[0] = xy_at_t(a, i.fT[0][0]); in computePoints()
32 i.fPt[1] = xy_at_t(a, i.fT[0][1]); in computePoints()
71 i.fPt[0] = xy_at_t(a, numerA); in intersect()
/external/skia/experimental/Intersection/
DIntersections.cpp37 bool s1in = between(cs1, s1, ce1) || startPt.approximatelyEqual(fPt[i1]) in insertCoincidentPair()
38 || startPt.approximatelyEqual(fPt[iEnd1]); in insertCoincidentPair()
39 bool e1in = between(cs1, e1, ce1) || endPt.approximatelyEqual(fPt[i1]) in insertCoincidentPair()
40 || endPt.approximatelyEqual(fPt[iEnd1]); in insertCoincidentPair()
51 bool s2in = between(cs2, s2, ce2) || startPt.approximatelyEqual(fPt[i2]) in insertCoincidentPair()
52 || startPt.approximatelyEqual(fPt[iEnd2]); in insertCoincidentPair()
53 bool e2in = between(cs2, e2, ce2) || endPt.approximatelyEqual(fPt[i2]) in insertCoincidentPair()
54 || endPt.approximatelyEqual(fPt[iEnd2]); in insertCoincidentPair()
58 fPt[i1] = startPt; in insertCoincidentPair()
61 fPt[i1] = endPt; in insertCoincidentPair()
[all …]
DIntersections.h20 bzero(fPt, sizeof(fPt)); in Intersections()
128 _Point fPt[9]; variable
DCubicIntersection_Test.cpp244 __FUNCTION__, tt1, xy1.x, xy1.y, intersections2.fPt[pt1].x,
245 intersections2.fPt[pt1].y, xy2.x, xy2.y, tt2);
279 __FUNCTION__, tt1, xy1.x, xy1.y, intersections3.fPt[pt1].x,
280 intersections3.fPt[pt1].y, xy2.x, xy2.y, tt2);
335 __FUNCTION__, tt1, xy1.x, xy1.y, intersections3.fPt[pt3].x, in oneOff3()
336 intersections3.fPt[pt3].y, xy2.x, xy2.y, tt2); in oneOff3()
DLineIntersection.cpp30 i.fPt[0] = xy_at_t(a, i.fT[0][0]); in computePoints()
32 i.fPt[1] = xy_at_t(a, i.fT[0][1]); in computePoints()
71 i.fPt[0] = xy_at_t(a, numerA); in intersect()
/external/chromium_org/third_party/skia/src/pathops/
DSkOpSegment.cpp220 } while (startPt != fTs[tIndex].fPt && tIndex < tCount); in addCancelOutsides()
224 } while (endPt != other->fTs[oIndex].fPt && oIndex < oCount); in addCancelOutsides()
228 nextPt = &fTs[++tIndex].fPt; in addCancelOutsides()
234 oNextPt = &other->fTs[++oIndex].fPt; in addCancelOutsides()
254 SkPoint copy = fTs[tIndexStart].fPt; // add t pair may move the point array in addCancelOutsides()
264 SkPoint copy = fTs[tIndex].fPt; // add t pair may move the point array in addCancelOutsides()
299 } while (startPt != fTs[tIndex].fPt); in addCoinOutsides()
304 if (startPt != span.fPt) { in addCoinOutsides()
307 if (span.fOther == other && span.fPt == startPt) { in addCoinOutsides()
314 } while (startPt != other->fTs[oIndex].fPt); in addCoinOutsides()
[all …]
DSkIntersections.cpp84 fPt[index] = pt; in insert()
89 if (pt.roughlyEqual(fPt[index])) { in insert()
105 memmove(&fPt[index + 1], &fPt[index], sizeof(fPt[0]) * remaining); in insert()
113 fPt[index] = pt; in insert()
170 memmove(&fPt[index], &fPt[index + 1], sizeof(fPt[0]) * remaining); in removeOne()
DSkDCubicIntersection.cpp274 fPt[1] = fPt[last]; in cubicCheckCoincidence()
325 if (mid.approximatelyEqual(fPt[index])) { in cubicInsert()
331 if (mid.approximatelyEqual(fPt[index])) { in cubicInsert()
577 if (!pt.approximatelyEqual(fPt[exIdx])) { in intersect()
583 if (!pt.approximatelyEqual(fPt[exIdx])) { in intersect()
595 if (!pt.approximatelyEqual(fPt[cpIdx])) { in intersect()
601 if (!pt.approximatelyEqual(fPt[cpIdx])) { in intersect()
649 fPt[1] = fPt[last]; in intersect()
DSkPathOpsDebug.cpp317 const SkPoint& basePt = fTs[tStart].fPt; in debugCheckPointsEqualish()
319 const SkPoint& cmpPt = fTs[tStart].fPt; in debugCheckPointsEqualish()
530 SK_ALWAYSBREAK(otherSpan.fPt == span.fPt); in debugValidate()
539 bool pointsEqual = last->fPt == span.fPt; in debugValidate()
540 bool pointsNearlyEqual = AlmostEqualUlps(last->fPt, span.fPt); in debugValidate()
DSkDLineIntersection.cpp59 fPt[0] = line.ptAtT(fT[0][0]); in computePoints()
61 fPt[1] = line.ptAtT(fT[0][1]); in computePoints()
277 fPt[0].fX = xIntercept; in horizontal()
278 fPt[0].fY = y; in horizontal()
365 fPt[0].fX = x; in vertical()
366 fPt[0].fY = yIntercept; in vertical()
DSkIntersections.h23 sk_bzero(fPt, sizeof(fPt)); in SkIntersections()
141 return fPt[index]; in pt()
276 SkDPoint fPt[9]; // FIXME: since scans store points as SkPoint, this should also variable
DSkOpSpan.h16 SkPoint fPt; // computed when the curves are intersected member
DSkOpContour.cpp201 SkASSERT(SkDPoint::RoughlyEqual(coincidence->fPts[0][idx2], aligned.fPt)); in align()
202 coincidence->fPts[0][idx2] = aligned.fPt; in align()
412 missingPt1 = refSegment->span(minTIndex).fPt; in checkCoincidentPair()
444 missingPt2 = refSegment->span(maxTIndex).fPt; in checkCoincidentPair()
452 missingPt1 = refSegment->span(minTIndex).fPt; in checkCoincidentPair()
459 missingPt2 = refSegment->span(maxTIndex).fPt; in checkCoincidentPair()
DSkOpAngle.cpp857 if (fSegment->span(fStart).fPt != oSeg->span(other.fStart).fPt) { in overlap()
861 return span.fSmall ? oSeg->containsPt(fSegment->span(fEnd).fPt, other.fEnd, other.fStart) in overlap()
862 : fSegment->containsPt(oSeg->span(other.fEnd).fPt, fEnd, fStart); in overlap()
1002 lineHalf[0].set(fSegment->span(fStart).fPt); in setSpans()
/external/skia/src/pathops/
DSkOpSegment.cpp220 } while (startPt != fTs[tIndex].fPt && tIndex < tCount); in addCancelOutsides()
224 } while (endPt != other->fTs[oIndex].fPt && oIndex < oCount); in addCancelOutsides()
228 nextPt = &fTs[++tIndex].fPt; in addCancelOutsides()
234 oNextPt = &other->fTs[++oIndex].fPt; in addCancelOutsides()
255 fTs[tIndexStart].fPt); in addCancelOutsides()
264 addTPair(fTs[tIndex].fT, other, other->fTs[oIndexStart].fT, false, fTs[tIndex].fPt); in addCancelOutsides()
298 } while (startPt != fTs[tIndex].fPt); in addCoinOutsides()
303 if (startPt != span.fPt) { in addCoinOutsides()
306 if (span.fOther == other && span.fPt == startPt) { in addCoinOutsides()
313 } while (startPt != other->fTs[oIndex].fPt); in addCoinOutsides()
[all …]
DSkIntersections.cpp84 fPt[index] = pt; in insert()
89 if (pt.roughlyEqual(fPt[index])) { in insert()
105 memmove(&fPt[index + 1], &fPt[index], sizeof(fPt[0]) * remaining); in insert()
113 fPt[index] = pt; in insert()
170 memmove(&fPt[index], &fPt[index + 1], sizeof(fPt[0]) * remaining); in removeOne()
DSkDCubicIntersection.cpp274 fPt[1] = fPt[last]; in cubicCheckCoincidence()
325 if (mid.approximatelyEqual(fPt[index])) { in cubicInsert()
331 if (mid.approximatelyEqual(fPt[index])) { in cubicInsert()
577 if (!pt.approximatelyEqual(fPt[exIdx])) { in intersect()
583 if (!pt.approximatelyEqual(fPt[exIdx])) { in intersect()
595 if (!pt.approximatelyEqual(fPt[cpIdx])) { in intersect()
601 if (!pt.approximatelyEqual(fPt[cpIdx])) { in intersect()
649 fPt[1] = fPt[last]; in intersect()
DSkPathOpsDebug.cpp316 const SkPoint& basePt = fTs[tStart].fPt; in debugCheckPointsEqualish()
318 const SkPoint& cmpPt = fTs[tStart].fPt; in debugCheckPointsEqualish()
529 SK_ALWAYSBREAK(otherSpan.fPt == span.fPt); in debugValidate()
538 bool pointsEqual = last->fPt == span.fPt; in debugValidate()
539 bool pointsNearlyEqual = AlmostEqualUlps(last->fPt, span.fPt); in debugValidate()
DSkDLineIntersection.cpp59 fPt[0] = line.ptAtT(fT[0][0]); in computePoints()
61 fPt[1] = line.ptAtT(fT[0][1]); in computePoints()
274 fPt[0].fX = xIntercept; in horizontal()
275 fPt[0].fY = y; in horizontal()
362 fPt[0].fX = x; in vertical()
363 fPt[0].fY = yIntercept; in vertical()
DSkIntersections.h23 sk_bzero(fPt, sizeof(fPt)); in SkIntersections()
141 return fPt[index]; in pt()
276 SkDPoint fPt[9]; // FIXME: since scans store points as SkPoint, this should also variable
DSkOpSpan.h16 SkPoint fPt; // computed when the curves are intersected member
DSkOpContour.cpp193 SkASSERT(SkDPoint::RoughlyEqual(coincidence->fPts[0][idx2], aligned.fPt)); in align()
194 coincidence->fPts[0][idx2] = aligned.fPt; in align()
401 missingPt1 = refSegment->span(minTIndex).fPt; in checkCoincidentPair()
433 missingPt2 = refSegment->span(maxTIndex).fPt; in checkCoincidentPair()
441 missingPt1 = refSegment->span(minTIndex).fPt; in checkCoincidentPair()
448 missingPt2 = refSegment->span(maxTIndex).fPt; in checkCoincidentPair()

12