Home
last modified time | relevance | path

Searched refs:fT (Results 1 - 24 of 24) sorted by relevance

/third_party/skia/src/pathops/
H A DSkIntersections.cpp15 if (!between(rangeStart, fT[0][index], rangeEnd)) { in closestTo()
30 fT[1][index] = 1 - fT[1][index]; in flip()
35 if (fIsCoincident[0] == 3 && between(fT[0][0], one, fT[0][1])) { in insert()
39 SkASSERT(fUsed <= 1 || fT[0][0] <= fT[0][1]); in insert()
42 double oldOne = fT[0][index]; in insert()
43 double oldTwo = fT[1][index]; in insert()
59 memmove(&fT[ in insert()
[all...]
H A DSkOpCoincidence.cpp100 if (fCoinPtTStart->fT > coinPtTStart->fT || (this->flipped() in extend()
101 ? fOppPtTStart->fT < oppPtTStart->fT : fOppPtTStart->fT > oppPtTStart->fT)) { in extend()
105 if (fCoinPtTEnd->fT < coinPtTEnd->fT || (this->flipped() in extend()
106 ? fOppPtTEnd->fT > oppPtTEnd->fT in extend()
[all...]
H A DSkDLineIntersection.cpp17 bool startMatch = fT[0][0] == 0 || zero_or_one(fT[1][0]); in cleanUpParallelLines()
18 bool endMatch = fT[0][1] == 1 || zero_or_one(fT[1][1]); in cleanUpParallelLines()
19 if ((!startMatch && !endMatch) || approximately_equal(fT[0][0], fT[0][1])) { in cleanUpParallelLines()
21 if (startMatch && endMatch && (fT[0][0] != 0 || !zero_or_one(fT[1][0])) in cleanUpParallelLines()
22 && fT[0][1] == 1 && zero_or_one(fT[ in cleanUpParallelLines()
[all...]
H A DSkOpSpan.h121 const SkOpPtT* start1 = s1->fT < e1->fT ? s1 : e1; in Overlaps()
122 const SkOpPtT* start2 = s2->fT < e2->fT ? s2 : e2; in Overlaps()
123 *sOut = between(s1->fT, start2->fT, e1->fT) ? start2 in Overlaps()
124 : between(s2->fT, start1->fT, e2->fT) in Overlaps()
166 double fT; global() member in SkOpPtT
[all...]
H A DSkPathOpsDebug.cpp730 if (t == result->fT || this->match(result, this, t, pt)) { in debugAddT()
734 if (t < result->fT) { in debugAddT()
903 bool swapped = priorPtT->fT > ptT->fT; in debugMissingCoincidence()
1478 if (this->contains(baseSeg, testSeg, testPtT->fT)) { in debugAddEndMovedSpans()
1512 oppTs = oppStart->fT; in debugAddEndMovedSpans()
1513 oppTe = testPtT->fT; in debugAddEndMovedSpans()
1517 coinTs = oppStart->fT; in debugAddEndMovedSpans()
1518 coinTe = testPtT->fT; in debugAddEndMovedSpans()
1573 FAIL_IF(1 == span->coinPtTStart()->fT, spa in debugAddEndMovedSpans()
[all...]
H A DSkOpSpan.cpp58 if (ptT->fT == t && ptT->segment() == segment) { in contains()
99 fT = t; in init()
167 double min = walk->fT; in collapsed()
181 min = std::min(min, walk->fT); in collapsed()
182 max = std::max(max, walk->fT); in collapsed()
255 SkASSERT(this->t() != spanPtT->fT); in merge()
256 SkASSERT(!zero_or_one(spanPtT->fT)); in merge()
269 if (nextC->span() == remainder->span() && nextC->fT == remainder->fT) { in merge()
339 if (!zero_or_one(inner->fT)) { in mergeMatches()
[all...]
H A DSkIntersections.h27 sk_bzero(fT, sizeof(fT));
44 TArray operator[](int n) const { return TArray(fT[n]); } in operator []()
112 return fUsed > 0 && (t == 0 ? fT[0][0] == 0 : fT[0][fUsed - 1] == 1); in hasT()
117 return fUsed > 0 && (fT[1][0] == t || fT[1][fUsed - 1] == t); in hasOppT()
199 fT[(int) swap][tIndex] = t; in set()
225 fT[0][index] = fT[ in unBumpT()
317 double fT[2][13]; global() member in SkIntersections
[all...]
H A DSkOpCoincidence.h59 bool flipped() const { return fOppPtTStart->fT > fOppPtTEnd->fT; } in flipped()
83 SkOPASSERT(!fCoinPtTStart || ptT->fT != fCoinPtTStart->fT); in setCoinPtTEnd()
91 SkOPASSERT(!fCoinPtTEnd || ptT->fT != fCoinPtTEnd->fT); in setCoinPtTStart()
104 SkOPASSERT(!fOppPtTStart || ptT->fT != fOppPtTStart->fT); in setOppPtTEnd()
112 SkOPASSERT(!fOppPtTEnd || ptT->fT != fOppPtTEnd->fT); in setOppPtTStart()
[all...]
H A DSkOpEdgeBuilder.cpp274 double fT[2]; in walk() member
284 split->fT[0] = index ? splitT[index - 1] : 0; in walk()
285 split->fT[1] = index < breaks ? splitT[index] : 1; in walk()
286 SkDCubic part = SkDCubic::SubDivide(pointsPtr, split->fT[0], split->fT[1]); in walk()
305 split->fT[0] = splits[prior].fT[0]; in walk()
314 split->fT[1] = splits[next].fT[1]; in walk()
H A DSkPathOpsWinding.cpp90 fT = span->t() * (1 - t) + span->next()->t() * t; in makeTestBase()
92 fSlope = segment->dSlopeAtT(fT); in makeTestBase()
93 fPt = segment->ptAtT(fT); in makeTestBase()
101 double fT; member
137 if (base.fSpan->segment() == this && approximately_equal(base.fT, t)) { in rayCheck()
162 && roughly_equal(base.fT, t) in rayCheck()
185 newHit->fT = t; in rayCheck()
275 hitBase.fT, hitBase.fPt.fX, hitBase.fPt.fY); in sortableTop()
287 SkDebugf(" t=%1.9g pt=(%1.9g,%1.9g) slope=(%1.9g,%1.9g)\n", hit->fT, in sortableTop()
300 // SkASSERT(!approximately_zero(hit->fT) || !hi in sortableTop()
[all...]
H A DSkOpSegment.h240 SkDEBUGCODE(result->ptT()->fT = 0); in insert()
323 return ptsDisjoint(span.fT, span.fPt, test.fT, test.fPt); in ptsDisjoint()
328 return ptsDisjoint(span.fT, span.fPt, t, pt); in ptsDisjoint()
H A DSkOpSegment.cpp203 if (testPtT->fT == t) { in existing()
207 if (t < testPtT->fT) { in existing()
217 if (loop->segment() == this && loop->fT == t && loop->fPt == pt) { in existing()
258 if (t == result->fT || (!zero_or_one(t) && this->match(result, this, t, pt))) { in addT()
262 if (t < result->fT) { in addT()
1054 if (precisely_equal(base->fT, testT)) { in match()
1061 return this != testParent || !this->ptsDisjoint(base->fT, base->fPt, testT, testPt); in match()
1223 bool swapped = priorPtT->fT > ptT->fT; in missingCoincidence()
1428 *found = checkBest && refBest->segment()->match(refBest, checkBest->segment(), checkBest->fT, in spansNearby()
[all...]
H A DSkPathWriter.cpp228 if (!zero_or_one(opPtT->fT)) { in assemble()
232 SkOpSpanBase* start = opPtT->fT ? opSpanBase->prev() : opSpanBase->upCast()->next(); in assemble()
233 int step = opPtT->fT ? 1 : -1; in assemble()
H A DSkDCubicLineIntersection.cpp440 fUsed = c.intersectRay(fT[0]); in intersectRay()
442 fPt[index] = cubic.ptAtT(fT[0][index]); in intersectRay()
H A DSkDQuadLineIntersection.cpp445 fUsed = q.intersectRay(fT[0]); in intersectRay()
447 fPt[index] = quad.ptAtT(fT[0][index]); in intersectRay()
H A DSkDConicLineIntersection.cpp369 fUsed = c.intersectRay(fT[0]); in intersectRay()
371 fPt[index] = conic.ptAtT(fT[0][index]); in intersectRay()
/third_party/skia/src/core/
H A DSkArenaAllocList.h35 T& operator*() const { return fCurr->fT; } in operator *()
36 T* operator->() const { return &fCurr->fT; } in operator ->()
53 Node(Args... args) : fT(std::forward<Args>(args)...) {} in Node()
54 T fT; member
71 return fTail->fT; in append()
H A DSkBlurMF.cpp1147 float fT = (top - y - 0.5f) * (integralSize / sixSigma); in eval_V() local
1148 if (fT < 0) { in eval_V()
1150 } else if (fT >= integralSize - 1) { in eval_V()
1154 int lower = (int)fT; in eval_V()
1155 float frac = fT - lower; in eval_V()
/third_party/skia/modules/sksg/src/
H A DSkSGTransform.cpp89 : fT(std::move(t)) { in Inverse()
90 SkASSERT(fT); in Inverse()
92 this->observeInval(fT); in Inverse()
96 this->unobserveInval(fT);
101 fT->revalidate(ic, ctm);
103 if (!TransformPriv::As<T>(fT).invert(&fInverted)) {
123 const sk_sp<Transform> fT; member in sksg::__anon18612::final
/third_party/skia/samplecode/
H A DSamplePath.cpp562 SkScalar fT = 0.5f; member in CubicCurve2
586 case '-': fT -= 1.0f / 32; break;
587 case '=': fT += 1.0f / 32; break;
591 fT = std::min(1.0f, std::max(0.0f, fT));
610 tmp[i] = lerp(prev[i], prev[i+1], fT); in showFrame()
674 SkPoint p0 = SkEvalQuadAt(&fPts[0], fT), in showInnerQuads()
675 p1 = SkEvalQuadAt(&fPts[1], fT), in showInnerQuads()
676 p2 = lerp(p0, p1, fT); in showInnerQuads()
714 canvas->drawString(SkStringPrintf("t = %g", fT), 2
[all...]
/third_party/skia/modules/skottie/src/effects/
H A DMotionBlurEffect.h26 SG_ATTRIBUTE(T, float, fT)
50 float fT = 0; member in skottie::internal::final
H A DMotionBlurEffect.cpp72 fAnimator->seek(fT + fPhase + fDT * sample_idx); in seekToSample()
/third_party/skia/modules/skottie/src/layers/
H A DPrecompLayer.cpp30 this->bind(*abuilder, jtm, fT); in TimeRemapper()
33 float t() const { return fT * fScale; } in t()
42 ScalarValue fT = 0; member in skottie::internal::__anon18573::final
/third_party/skia/tests/
H A DPathOpsDebug.cpp209 fIsCoincident[0] & (1 << index) ? "*" : "", fT[0][index], in dump()
210 fIsCoincident[1] & (1 << index) ? "*" : "", fT[1][index], in dump()
692 SkDebugf(" t=%1.9g pt=(%1.9g,%1.9g)%s%s%s", this->fT, this->fPt.fX, this->fPt.fY, in dumpBase()

Completed in 31 milliseconds