Searched refs:tCount (Results 1 - 20 of 20) sorted by relevance

/external/lldb/tools/lldb-perf/lib/
H A DXcode.cpp79 auto tCount = thread.GetNumFrames (); local
81 printf("%s %d %d {%d}\n",thread.GetQueueName(),tCount,thread.GetStopReason(),eStopReasonBreakpoint);
82 for (int t = 0; t < tCount; t++)
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DCubicIntersection.cpp126 int tCount = locals.used();
127 for (int tIdx = 0; tIdx < tCount; ++tIdx) {
158 double c1Top = tIdx == tCount - 1 ? 1 :
185 if (tCount > 1) {
190 double c2Top = tIdx == tCount - 1 ? to2 :
254 double c1Top = tIdx == tCount - 1 ? 1 :
259 double c2Top = tIdx == tCount - 1 ? to2 :
H A DLineQuadraticIntersection.cpp337 int tCount = 0; local
344 tRange[tCount++] = rootVals[index];
346 return tCount;
H A DLineCubicIntersection.cpp264 int tCount = 0; local
271 tRange[tCount++] = rootVals[index];
H A DQuadraticImplicit.cpp181 int tCount = tsFound.count(); local
182 if (!tCount) {
186 if (tCount == 1) {
188 } else if (tCount > 1) {
206 if (tMin != tMax || tCount > 2) {
208 for (int index = 1; index < tCount; ++index) {
H A DSimplify.cpp1469 int tCount = fTs.count();
1474 } while (!approximately_negative(tStart - fTs[tIndex].fT) && tIndex < tCount);
1677 size_t tCount = fTs.count();
1686 for (size_t index = 0; index < tCount; ++index) {
1702 insertedAt = tCount;
2023 int tCount = fTs.count();
2024 for (int tIndex = 0; tIndex < tCount; ++tIndex) {
3125 size_t tCount = fTs.count();
3126 for (size_t index = 0; index < tCount; ++index) {
3893 size_t tCount
[all...]
H A DEdgeWalker.cpp865 size_t tCount = intercepts.fTs.count();
867 for (size_t idx2 = 0; idx2 < tCount; ++idx2) {
878 if (tCount == 0 || (delta = t - intercepts.fTs[tCount - 1]) > 0) {
879 insertedAt = tCount;
1043 size_t tCount = intercepts.fTs.count();
1044 if (!tCount) {
1052 while (++tIndex < tCount) {
/external/skia/experimental/Intersection/
H A DCubicIntersection.cpp126 int tCount = locals.used();
127 for (int tIdx = 0; tIdx < tCount; ++tIdx) {
158 double c1Top = tIdx == tCount - 1 ? 1 :
185 if (tCount > 1) {
190 double c2Top = tIdx == tCount - 1 ? to2 :
254 double c1Top = tIdx == tCount - 1 ? 1 :
259 double c2Top = tIdx == tCount - 1 ? to2 :
H A DLineQuadraticIntersection.cpp337 int tCount = 0; local
344 tRange[tCount++] = rootVals[index];
346 return tCount;
H A DLineCubicIntersection.cpp264 int tCount = 0; local
271 tRange[tCount++] = rootVals[index];
H A DQuadraticImplicit.cpp181 int tCount = tsFound.count(); local
182 if (!tCount) {
186 if (tCount == 1) {
188 } else if (tCount > 1) {
206 if (tMin != tMax || tCount > 2) {
208 for (int index = 1; index < tCount; ++index) {
H A DSimplify.cpp1469 int tCount = fTs.count();
1474 } while (!approximately_negative(tStart - fTs[tIndex].fT) && tIndex < tCount);
1677 size_t tCount = fTs.count();
1686 for (size_t index = 0; index < tCount; ++index) {
1702 insertedAt = tCount;
2023 int tCount = fTs.count();
2024 for (int tIndex = 0; tIndex < tCount; ++tIndex) {
3125 size_t tCount = fTs.count();
3126 for (size_t index = 0; index < tCount; ++index) {
3893 size_t tCount
[all...]
H A DEdgeWalker.cpp865 size_t tCount = intercepts.fTs.count();
867 for (size_t idx2 = 0; idx2 < tCount; ++idx2) {
878 if (tCount == 0 || (delta = t - intercepts.fTs[tCount - 1]) > 0) {
879 insertedAt = tCount;
1043 size_t tCount = intercepts.fTs.count();
1044 if (!tCount) {
1052 while (++tIndex < tCount) {
/external/chromium_org/third_party/skia/src/pathops/
H A DSkDQuadIntersection.cpp175 int tCount = tsFound.count(); local
176 if (tCount <= 0) {
180 if (tCount == 1) {
183 SkASSERT(tCount > 1);
200 if (tMin != tMax || tCount > 2) {
202 for (int index = 1; index < tCount; ++index) {
H A DSkDCubicIntersection.cpp119 int tCount = locals.used();
120 for (int tIdx = 0; tIdx < tCount; ++tIdx) {
144 double c1Top = tIdx == tCount - 1 ? 1 :
173 if (tCount > 1) {
178 double c2Top = tIdx == tCount - 1 ? to2 :
H A DSkOpSegment.cpp215 int tCount = fTs.count(); local
220 } while (startPt != fTs[tIndex].fPt && tIndex < tCount);
564 int tCount = fTs.count(); local
565 for (int index = 0; index < tCount; ++index) {
592 insertedAt = tCount;
1423 int tCount = fTs.count();
1424 for (int tIndex = 0; tIndex < tCount; ++tIndex) {
3380 int tCount = fTs.count();
3381 for (int index = 0; index < tCount; ++index) {
4306 int tCount
[all...]
/external/skia/src/pathops/
H A DSkDQuadIntersection.cpp175 int tCount = tsFound.count(); local
176 if (tCount <= 0) {
180 if (tCount == 1) {
183 SkASSERT(tCount > 1);
200 if (tMin != tMax || tCount > 2) {
202 for (int index = 1; index < tCount; ++index) {
H A DSkDCubicIntersection.cpp119 int tCount = locals.used();
120 for (int tIdx = 0; tIdx < tCount; ++tIdx) {
144 double c1Top = tIdx == tCount - 1 ? 1 :
173 if (tCount > 1) {
178 double c2Top = tIdx == tCount - 1 ? to2 :
H A DSkOpSegment.cpp215 int tCount = fTs.count(); local
220 } while (startPt != fTs[tIndex].fPt && tIndex < tCount);
560 int tCount = fTs.count(); local
561 for (int index = 0; index < tCount; ++index) {
588 insertedAt = tCount;
1381 int tCount = fTs.count();
1382 for (int tIndex = 0; tIndex < tCount; ++tIndex) {
3296 int tCount = fTs.count();
3297 for (int index = 0; index < tCount; ++index) {
4197 int tCount
[all...]
/external/icu/icu4c/source/i18n/
H A Dcollationbuilder.cpp1397 int32_t tCount = countTailoredNodes(nodesArray, nextIndex, local
1416 if(!tertiaries.allocWeights(t, tLimit, tCount)) {

Completed in 3347 milliseconds