Home
last modified time | relevance | path

Searched refs:tIndex (Results 1 – 25 of 33) sorted by relevance

12

/external/chromium_org/third_party/skia/src/animator/
DSkHitTest.cpp40 for (int tIndex = 0; tIndex < targetCount; tIndex++) { in draw() local
41 SkDisplayable* target = targets[tIndex]; in draw()
45 hits[bIndex] = tIndex; in draw()
59 for (int tIndex = 0; tIndex < targets.count(); tIndex++) { in enable() local
60 SkDisplayable* target = targets[tIndex]; in enable()
DSkHitClear.cpp23 for (int tIndex = 0; tIndex < targets.count(); tIndex++) { in enable() local
24 SkDisplayable* target = targets[tIndex]; in enable()
/external/skia/src/animator/
DSkHitTest.cpp40 for (int tIndex = 0; tIndex < targetCount; tIndex++) { in draw() local
41 SkDisplayable* target = targets[tIndex]; in draw()
45 hits[bIndex] = tIndex; in draw()
59 for (int tIndex = 0; tIndex < targets.count(); tIndex++) { in enable() local
60 SkDisplayable* target = targets[tIndex]; in enable()
DSkHitClear.cpp23 for (int tIndex = 0; tIndex < targets.count(); tIndex++) { in enable() local
24 SkDisplayable* target = targets[tIndex]; in enable()
/external/skia/src/pathops/
DSkOpSegment.h105 bool isCanceled(int tIndex) const { in isCanceled() argument
106 return fTs[tIndex].fWindValue == 0 && fTs[tIndex].fOppValue == 0; in isCanceled()
142 int oppSum(int tIndex) const { in oppSum() argument
143 return fTs[tIndex].fOppSum; in oppSum()
151 int oppValue(int tIndex) const { in oppValue() argument
152 return fTs[tIndex].fOppValue; in oppValue()
190 const SkOpSpan& span(int tIndex) const { in span() argument
191 return fTs[tIndex]; in span()
219 double t(int tIndex) const { in t() argument
220 return fTs[tIndex].fT; in t()
[all …]
DSkPathOpsOp.cpp12 static SkOpSegment* findChaseOp(SkTDArray<SkOpSpan*>& chase, int* tIndex, int* endIndex) { in findChaseOp() argument
18 *tIndex = backPtr.fOtherIndex; in findChaseOp()
22 if (const SkOpAngle* last = segment->activeAngle(*tIndex, tIndex, endIndex, &done, in findChaseOp()
27 *tIndex = last->start(); in findChaseOp()
43 const SkOpAngle* angle = segment->spanToAngle(*tIndex, *endIndex); in findChaseOp()
73 *tIndex = start; in findChaseOp()
DSkOpSegment.cpp214 int tIndex = -1; in addCancelOutsides() local
219 ++tIndex; in addCancelOutsides()
220 } while (startPt != fTs[tIndex].fPt && tIndex < tCount); in addCancelOutsides()
221 int tIndexStart = tIndex; in addCancelOutsides()
228 nextPt = &fTs[++tIndex].fPt; in addCancelOutsides()
229 SkASSERT(fTs[tIndex].fT < 1 || startPt != *nextPt); in addCancelOutsides()
231 double nextT = fTs[tIndex].fT; in addCancelOutsides()
257 if (nextT < 1 && fTs[tIndex].fWindValue) { in addCancelOutsides()
260 __FUNCTION__, fID, other->fID, tIndex, in addCancelOutsides()
261 fTs[tIndex].fT, xyAtT(tIndex).fX, in addCancelOutsides()
[all …]
DSkOpContour.h67 void addOtherT(int segIndex, int tIndex, double otherT, int otherIndex) { in addOtherT() argument
68 fSegments[segIndex].addOtherT(tIndex, otherT, otherIndex); in addOtherT()
110 bool swap, int tIndex, SkIntersections* ts, SkPoint* point) const;
327 int alignT(bool swap, int tIndex, SkIntersections* ts) const;
DSkPathOpsCommon.cpp137 SkOpSegment* FindChase(SkTDArray<SkOpSpan*>* chase, int* tIndex, int* endIndex) { in FindChase() argument
143 *tIndex = backPtr.fOtherIndex; in FindChase()
147 if (const SkOpAngle* last = segment->activeAngle(*tIndex, tIndex, endIndex, &done, in FindChase()
149 *tIndex = last->start(); in FindChase()
165 const SkOpAngle* angle = segment->spanToAngle(*tIndex, *endIndex); in FindChase()
200 *tIndex = angle->start(); in FindChase()
202 int lesser = SkMin32(*tIndex, *endIndex); in FindChase()
DSkOpContour.cpp220 bool swap, int tIndex, SkIntersections* ts, SkPoint* point) const { in alignTPt() argument
222 if ((zeroPt = alignT(swap, tIndex, ts)) >= 0) { in alignTPt()
225 if ((zeroPt = other->alignT(!swap, tIndex, ts)) >= 0) { in alignTPt()
239 int SkOpContour::alignT(bool swap, int tIndex, SkIntersections* ts) const { in alignT() argument
240 double tVal = (*ts)[swap][tIndex]; in alignT()
242 ts->set(swap, tIndex, 0); in alignT()
246 ts->set(swap, tIndex, 1); in alignT()
/external/chromium_org/third_party/skia/src/pathops/
DSkOpSegment.h105 bool isCanceled(int tIndex) const { in isCanceled() argument
106 return fTs[tIndex].fWindValue == 0 && fTs[tIndex].fOppValue == 0; in isCanceled()
142 int oppSum(int tIndex) const { in oppSum() argument
143 return fTs[tIndex].fOppSum; in oppSum()
151 int oppValue(int tIndex) const { in oppValue() argument
152 return fTs[tIndex].fOppValue; in oppValue()
190 const SkOpSpan& span(int tIndex) const { in span() argument
191 return fTs[tIndex]; in span()
219 double t(int tIndex) const { in t() argument
220 return fTs[tIndex].fT; in t()
[all …]
DSkPathOpsOp.cpp12 static SkOpSegment* findChaseOp(SkTDArray<SkOpSpan*>& chase, int* tIndex, int* endIndex) { in findChaseOp() argument
18 *tIndex = backPtr.fOtherIndex; in findChaseOp()
22 if (const SkOpAngle* last = segment->activeAngle(*tIndex, tIndex, endIndex, &done, in findChaseOp()
27 *tIndex = last->start(); in findChaseOp()
43 const SkOpAngle* angle = segment->spanToAngle(*tIndex, *endIndex); in findChaseOp()
73 *tIndex = start; in findChaseOp()
DSkOpSegment.cpp214 int tIndex = -1; in addCancelOutsides() local
219 ++tIndex; in addCancelOutsides()
220 } while (startPt != fTs[tIndex].fPt && tIndex < tCount); in addCancelOutsides()
221 int tIndexStart = tIndex; in addCancelOutsides()
228 nextPt = &fTs[++tIndex].fPt; in addCancelOutsides()
229 SkASSERT(fTs[tIndex].fT < 1 || startPt != *nextPt); in addCancelOutsides()
231 double nextT = fTs[tIndex].fT; in addCancelOutsides()
257 if (nextT < 1 && fTs[tIndex].fWindValue) { in addCancelOutsides()
260 __FUNCTION__, fID, other->fID, tIndex, in addCancelOutsides()
261 fTs[tIndex].fT, xyAtT(tIndex).fX, in addCancelOutsides()
[all …]
DSkOpContour.h67 void addOtherT(int segIndex, int tIndex, double otherT, int otherIndex) { in addOtherT() argument
68 fSegments[segIndex].addOtherT(tIndex, otherT, otherIndex); in addOtherT()
110 bool swap, int tIndex, SkIntersections* ts, SkPoint* point) const;
327 int alignT(bool swap, int tIndex, SkIntersections* ts) const;
DSkPathOpsCommon.cpp137 SkOpSegment* FindChase(SkTDArray<SkOpSpan*>* chase, int* tIndex, int* endIndex) { in FindChase() argument
143 *tIndex = backPtr.fOtherIndex; in FindChase()
147 if (const SkOpAngle* last = segment->activeAngle(*tIndex, tIndex, endIndex, &done, in FindChase()
149 *tIndex = last->start(); in FindChase()
165 const SkOpAngle* angle = segment->spanToAngle(*tIndex, *endIndex); in FindChase()
200 *tIndex = angle->start(); in FindChase()
202 int lesser = SkMin32(*tIndex, *endIndex); in FindChase()
DSkOpContour.cpp220 bool swap, int tIndex, SkIntersections* ts, SkPoint* point) const { in alignTPt() argument
222 if ((zeroPt = alignT(swap, tIndex, ts)) >= 0) { in alignTPt()
225 if ((zeroPt = other->alignT(!swap, tIndex, ts)) >= 0) { in alignTPt()
239 int SkOpContour::alignT(bool swap, int tIndex, SkIntersections* ts) const { in alignT() argument
240 double tVal = (*ts)[swap][tIndex]; in alignT()
242 ts->set(swap, tIndex, 0); in alignT()
246 ts->set(swap, tIndex, 1); in alignT()
/external/chromium_org/third_party/skia/tools/
Dbench_pictures_main.cpp99 size_t tIndex; in filtersName() local
100 for (tIndex = 1; tIndex < SkDrawFilter::kTypeCount; ++tIndex) { in filtersName()
101 all &= drawFilters[tIndex]; in filtersName()
109 for (tIndex = 0; tIndex < SkDrawFilter::kTypeCount; ++tIndex) { in filtersName()
110 if (drawFilters[tIndex] & (1 << fIndex)) { in filtersName()
111 types += gFilterTypes[tIndex]; in filtersName()
241 for (size_t tIndex = 0; tIndex < kFilterTypesCount; ++tIndex) { in setup_benchmark() local
242 if (typeLen == strlen(gFilterTypes[tIndex]) in setup_benchmark()
243 && !strncmp(filters, gFilterTypes[tIndex], typeLen)) { in setup_benchmark()
244 type = SkToS32(tIndex); in setup_benchmark()
/external/skia/tools/
Dbench_pictures_main.cpp99 size_t tIndex; in filtersName() local
100 for (tIndex = 1; tIndex < SkDrawFilter::kTypeCount; ++tIndex) { in filtersName()
101 all &= drawFilters[tIndex]; in filtersName()
109 for (tIndex = 0; tIndex < SkDrawFilter::kTypeCount; ++tIndex) { in filtersName()
110 if (drawFilters[tIndex] & (1 << fIndex)) { in filtersName()
111 types += gFilterTypes[tIndex]; in filtersName()
241 for (size_t tIndex = 0; tIndex < kFilterTypesCount; ++tIndex) { in setup_benchmark() local
242 if (typeLen == strlen(gFilterTypes[tIndex]) in setup_benchmark()
243 && !strncmp(filters, gFilterTypes[tIndex], typeLen)) { in setup_benchmark()
244 type = SkToS32(tIndex); in setup_benchmark()
/external/chromium_org/third_party/skia/tests/
DPathOpsQuadLineIntersectionThreadedTest.cpp90 for (int tIndex = 0; tIndex <= 4; ++tIndex) { in testQuadLineIntersectMain() local
91 SkDPoint xy = quad.ptAtT(tIndex / 4.0); in testQuadLineIntersectMain()
/external/skia/tests/
DPathOpsQuadLineIntersectionThreadedTest.cpp90 for (int tIndex = 0; tIndex <= 4; ++tIndex) { in testQuadLineIntersectMain() local
91 SkDPoint xy = quad.ptAtT(tIndex / 4.0); in testQuadLineIntersectMain()
/external/skia/experimental/Intersection/
DSimplify.cpp1468 int tIndex = -1; in addCancelOutsides() local
1473 ++tIndex; in addCancelOutsides()
1474 } while (!approximately_negative(tStart - fTs[tIndex].fT) && tIndex < tCount); in addCancelOutsides()
1475 int tIndexStart = tIndex; in addCancelOutsides()
1482 nextT = fTs[++tIndex].fT; in addCancelOutsides()
1507 if (nextT < 1 && fTs[tIndex].fWindValue) { in addCancelOutsides()
1510 __FUNCTION__, fID, other.fID, tIndex, in addCancelOutsides()
1511 fTs[tIndex].fT, xyAtT(tIndex).fX, in addCancelOutsides()
1512 xyAtT(tIndex).fY); in addCancelOutsides()
1514 addTPair(fTs[tIndex].fT, other, other.fTs[oIndexStart].fT, false, fTs[tIndex].fPt); in addCancelOutsides()
[all …]
DLineQuadraticIntersection_Test.cpp196 for (int tIndex = 0; tIndex <= 4; ++tIndex) { in testQuadLineIntersectMain() local
198 xy_at_t(quad, tIndex / 4.0, x, y); in testQuadLineIntersectMain()
/external/chromium_org/third_party/skia/experimental/Intersection/
DSimplify.cpp1468 int tIndex = -1; in addCancelOutsides() local
1473 ++tIndex; in addCancelOutsides()
1474 } while (!approximately_negative(tStart - fTs[tIndex].fT) && tIndex < tCount); in addCancelOutsides()
1475 int tIndexStart = tIndex; in addCancelOutsides()
1482 nextT = fTs[++tIndex].fT; in addCancelOutsides()
1507 if (nextT < 1 && fTs[tIndex].fWindValue) { in addCancelOutsides()
1510 __FUNCTION__, fID, other.fID, tIndex, in addCancelOutsides()
1511 fTs[tIndex].fT, xyAtT(tIndex).fX, in addCancelOutsides()
1512 xyAtT(tIndex).fY); in addCancelOutsides()
1514 addTPair(fTs[tIndex].fT, other, other.fTs[oIndexStart].fT, false, fTs[tIndex].fPt); in addCancelOutsides()
[all …]
DLineQuadraticIntersection_Test.cpp196 for (int tIndex = 0; tIndex <= 4; ++tIndex) { in testQuadLineIntersectMain() local
198 xy_at_t(quad, tIndex / 4.0, x, y); in testQuadLineIntersectMain()
/external/icu/icu4c/source/layout/
DHangulLayoutEngine.cpp115 le_int32 tIndex = trail - TJMO_FIRST; in compose() local
122 if (tIndex <= 0 || tIndex >= TJMO_COUNT) { in compose()
123 tIndex = 0; in compose()
127 syllable = (LEUnicode) ((lIndex * VJMO_COUNT + vIndex) * TJMO_COUNT + tIndex + HSYL_FIRST); in compose()

12