| /external/skia/src/pathops/ |
| SkIntersections.cpp | 15 if (!between(rangeStart, fT[0][index], rangeEnd)) {
30 fT[1][index] = 1 - fT[1][index];
35 if (fIsCoincident[0] == 3 && between(fT[0][0], one, fT[0][1])) {
39 SkASSERT(fUsed <= 1 || fT[0][0] <= fT[0][1]);
42 double oldOne = fT[0][index];
43 double oldTwo = fT[1][index];
54 fT[0][index] = one
[all...] |
| SkOpCoincidence.cpp | 98 if (fCoinPtTStart->fT > coinPtTStart->fT || (this->flipped()
99 ? fOppPtTStart->fT < oppPtTStart->fT : fOppPtTStart->fT > oppPtTStart->fT)) {
103 if (fCoinPtTEnd->fT < coinPtTEnd->fT || (this->flipped()
104 ? fOppPtTEnd->fT > oppPtTEnd->fT : fOppPtTEnd->fT < oppPtTEnd->fT))
[all...] |
| SkDLineIntersection.cpp | 15 bool startMatch = fT[0][0] == 0 || zero_or_one(fT[1][0]);
16 bool endMatch = fT[0][1] == 1 || zero_or_one(fT[1][1]);
17 if ((!startMatch && !endMatch) || approximately_equal(fT[0][0], fT[0][1])) {
19 if (startMatch && endMatch && (fT[0][0] != 0 || !zero_or_one(fT[1][0]))
20 && fT[0][1] == 1 && zero_or_one(fT[1][1]))
[all...] |
| SkOpSpan.h | 121 const SkOpPtT* start1 = s1->fT < e1->fT ? s1 : e1;
122 const SkOpPtT* start2 = s2->fT < e2->fT ? s2 : e2;
123 *sOut = between(s1->fT, start2->fT, e1->fT) ? start2
124 : between(s2->fT, start1->fT, e2->fT) ? start1 : nullptr
[all...] |
| SkOpCoincidence.h | 59 bool flipped() const { return fOppPtTStart->fT > fOppPtTEnd->fT; }
83 SkOPASSERT(!fCoinPtTStart || ptT->fT != fCoinPtTStart->fT);
91 SkOPASSERT(!fCoinPtTEnd || ptT->fT != fCoinPtTEnd->fT);
104 SkOPASSERT(!fOppPtTStart || ptT->fT != fOppPtTStart->fT);
112 SkOPASSERT(!fOppPtTEnd || ptT->fT != fOppPtTEnd->fT);
[all...] |
| SkOpSpan.cpp | 59 if (ptT->fT == t && ptT->segment() == segment) {
100 fT = t;
166 double min = walk->fT;
173 min = SkTMin(min, walk->fT);
174 max = SkTMax(max, walk->fT);
246 SkASSERT(this->t() != spanPtT->fT);
247 SkASSERT(!zero_or_one(spanPtT->fT));
260 if (nextC->span() == remainder->span() && nextC->fT == remainder->fT) {
332 if (!zero_or_one(inner->fT)) {
[all...] |
| SkIntersections.h | 27 sk_bzero(fT, sizeof(fT));
44 TArray operator[](int n) const { return TArray(fT[n]); }
112 return fUsed > 0 && (t == 0 ? fT[0][0] == 0 : fT[0][fUsed - 1] == 1);
117 return fUsed > 0 && (fT[1][0] == t || fT[1][fUsed - 1] == t);
199 fT[(int) swap][tIndex] = t;
225 fT[0][index] = fT[0][index] * (1 + BUMP_EPSILON * 2) - BUMP_EPSILON
[all...] |
| SkOpEdgeBuilder.cpp | 278 double fT[2];
288 split->fT[0] = index ? splitT[index - 1] : 0;
289 split->fT[1] = index < breaks ? splitT[index] : 1;
290 SkDCubic part = SkDCubic::SubDivide(pointsPtr, split->fT[0], split->fT[1]);
309 split->fT[0] = splits[prior].fT[0];
318 split->fT[1] = splits[next].fT[1];
|
| SkPathOpsWinding.cpp | 87 fT = span->t() * (1 - t) + span->next()->t() * t;
89 fSlope = segment->dSlopeAtT(fT);
90 fPt = segment->ptAtT(fT);
98 double fT;
134 if (base.fSpan->segment() == this && approximately_equal(base.fT, t)) {
159 && roughly_equal(base.fT, t)
182 newHit->fT = t;
272 hitBase.fT, hitBase.fPt.fX, hitBase.fPt.fY);
284 SkDebugf(" t=%1.9g pt=(%1.9g,%1.9g) slope=(%1.9g,%1.9g)\n", hit->fT,
297 // SkASSERT(!approximately_zero(hit->fT) || !hit->fValid)
[all...] |
| SkPathOpsDebug.cpp | 753 if (t == result->fT || this->match(result, this, t, pt)) {
757 if (t < result->fT) {
926 bool swapped = priorPtT->fT > ptT->fT;
[all...] |
| /external/skqp/src/pathops/ |
| SkIntersections.cpp | 15 if (!between(rangeStart, fT[0][index], rangeEnd)) {
30 fT[1][index] = 1 - fT[1][index];
35 if (fIsCoincident[0] == 3 && between(fT[0][0], one, fT[0][1])) {
39 SkASSERT(fUsed <= 1 || fT[0][0] <= fT[0][1]);
42 double oldOne = fT[0][index];
43 double oldTwo = fT[1][index];
54 fT[0][index] = one
[all...] |
| SkOpCoincidence.cpp | 98 if (fCoinPtTStart->fT > coinPtTStart->fT || (this->flipped()
99 ? fOppPtTStart->fT < oppPtTStart->fT : fOppPtTStart->fT > oppPtTStart->fT)) {
103 if (fCoinPtTEnd->fT < coinPtTEnd->fT || (this->flipped()
104 ? fOppPtTEnd->fT > oppPtTEnd->fT : fOppPtTEnd->fT < oppPtTEnd->fT))
[all...] |
| SkDLineIntersection.cpp | 15 bool startMatch = fT[0][0] == 0 || zero_or_one(fT[1][0]);
16 bool endMatch = fT[0][1] == 1 || zero_or_one(fT[1][1]);
17 if ((!startMatch && !endMatch) || approximately_equal(fT[0][0], fT[0][1])) {
19 if (startMatch && endMatch && (fT[0][0] != 0 || !zero_or_one(fT[1][0]))
20 && fT[0][1] == 1 && zero_or_one(fT[1][1]))
[all...] |
| SkOpSpan.h | 121 const SkOpPtT* start1 = s1->fT < e1->fT ? s1 : e1;
122 const SkOpPtT* start2 = s2->fT < e2->fT ? s2 : e2;
123 *sOut = between(s1->fT, start2->fT, e1->fT) ? start2
124 : between(s2->fT, start1->fT, e2->fT) ? start1 : nullptr
[all...] |
| SkOpCoincidence.h | 59 bool flipped() const { return fOppPtTStart->fT > fOppPtTEnd->fT; }
83 SkOPASSERT(!fCoinPtTStart || ptT->fT != fCoinPtTStart->fT);
91 SkOPASSERT(!fCoinPtTEnd || ptT->fT != fCoinPtTEnd->fT);
104 SkOPASSERT(!fOppPtTStart || ptT->fT != fOppPtTStart->fT);
112 SkOPASSERT(!fOppPtTEnd || ptT->fT != fOppPtTEnd->fT);
[all...] |
| SkOpEdgeBuilder.cpp | 278 double fT[2];
288 split->fT[0] = index ? splitT[index - 1] : 0;
289 split->fT[1] = index < breaks ? splitT[index] : 1;
290 SkDCubic part = SkDCubic::SubDivide(pointsPtr, split->fT[0], split->fT[1]);
309 split->fT[0] = splits[prior].fT[0];
317 split->fT[1] = splits[next].fT[1];
320 if (0 == split->fT[0] && 1 == split->fT[1])
[all...] |
| SkOpSpan.cpp | 59 if (ptT->fT == t && ptT->segment() == segment) {
100 fT = t;
166 double min = walk->fT;
173 min = SkTMin(min, walk->fT);
174 max = SkTMax(max, walk->fT);
246 SkASSERT(this->t() != spanPtT->fT);
247 SkASSERT(!zero_or_one(spanPtT->fT));
260 if (nextC->span() == remainder->span() && nextC->fT == remainder->fT) {
332 if (!zero_or_one(inner->fT)) {
[all...] |
| SkIntersections.h | 27 sk_bzero(fT, sizeof(fT));
44 TArray operator[](int n) const { return TArray(fT[n]); }
112 return fUsed > 0 && (t == 0 ? fT[0][0] == 0 : fT[0][fUsed - 1] == 1);
117 return fUsed > 0 && (fT[1][0] == t || fT[1][fUsed - 1] == t);
199 fT[(int) swap][tIndex] = t;
225 fT[0][index] = fT[0][index] * (1 + BUMP_EPSILON * 2) - BUMP_EPSILON
[all...] |
| SkPathOpsWinding.cpp | 87 fT = span->t() * (1 - t) + span->next()->t() * t;
89 fSlope = segment->dSlopeAtT(fT);
90 fPt = segment->ptAtT(fT);
98 double fT;
134 if (base.fSpan->segment() == this && approximately_equal(base.fT, t)) {
159 && roughly_equal(base.fT, t)
182 newHit->fT = t;
272 hitBase.fT, hitBase.fPt.fX, hitBase.fPt.fY);
284 SkDebugf(" t=%1.9g pt=(%1.9g,%1.9g) slope=(%1.9g,%1.9g)\n", hit->fT,
297 // SkASSERT(!approximately_zero(hit->fT) || !hit->fValid)
[all...] |
| SkPathOpsDebug.cpp | 753 if (t == result->fT || this->match(result, this, t, pt)) {
757 if (t < result->fT) {
926 bool swapped = priorPtT->fT > ptT->fT;
[all...] |
| /external/skia/src/core/ |
| SkArenaAllocList.h | 34 T& operator*() const { return fCurr->fT; }
35 T* operator->() const { return &fCurr->fT; }
52 Node(Args... args) : fT(std::forward<Args>(args)...) {}
53 T fT;
70 return fTail->fT;
|
| /external/skqp/src/core/ |
| SkArenaAllocList.h | 34 T& operator*() const { return fCurr->fT; }
35 T* operator->() const { return &fCurr->fT; }
52 Node(Args... args) : fT(std::forward<Args>(args)...) {}
53 T fT;
70 return fTail->fT;
|
| /hardware/intel/img/psb_video/src/ |
| tng_ved_scaling.c | 65 float ft,
67 float fT,
74 fx = ((ft * fI + fi) - (fT * fI / 2)) / (fT * fI / 2);
80 if ((fT / 2 - ft - fi / fI) == 0)
86 fx = 0.9f * fScale * cfPI * (fT / 2 - (ft + fi / fI));
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixFunction.h | 244 * each diagonal block is computed by \p atomic. The off-diagonal parts of \p fT are set to zero.
247 void matrix_function_compute_block_atomic(const MatrixType& T, AtomicType& atomic, const VectorType& blockStart, const VectorType& clusterSize, MatrixType& fT)
249 fT.setZero(T.rows(), T.cols());
251 fT.block(blockStart(i), blockStart(i), clusterSize(i), clusterSize(i))
324 * This routine completes the computation of \p fT, denoting a matrix function applied to the triangular
325 * matrix \p T. It assumes that the block diagonal part of \p fT has already been computed. The part below
329 void matrix_function_compute_above_diagonal(const MatrixType& T, const VectorType& blockStart, const VectorType& clusterSize, MatrixType& fT)
344 DynMatrixType C = fT.block(blockStart(i), blockStart(i), clusterSize(i), clusterSize(i))
347 * fT.block(blockStart(i+k), blockStart(i+k), clusterSize(i+k), clusterSize(i+k));
349 C += fT.block(blockStart(i), blockStart(m), clusterSize(i), clusterSize(m)
[all...] |
| /external/swiftshader/third_party/PowerVR_SDK/Tools/ |
| PVRTMisc.cpp | 46 VERTTYPE fN, fD, fT;
66 fT = VERTTYPEDIV(-fN, fD);
69 pvIntersection->x = pv0->x + VERTTYPEMUL(fT, vD.x);
70 pvIntersection->y = pv0->y + VERTTYPEMUL(fT, vD.y);
71 pvIntersection->z = pv0->z + VERTTYPEMUL(fT, vD.z);
|
