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

/external/chromium_org/third_party/skia/src/pathops/
H A DSkDQuadIntersection.cpp173 int tCount = tsFound.count(); local
174 if (tCount <= 0) {
178 if (tCount == 1) {
181 SkASSERT(tCount > 1);
198 if (tMin != tMax || tCount > 2) {
200 for (int index = 1; index < tCount; ++index) {
H A DSkDCubicIntersection.cpp117 int tCount = locals.used();
118 for (int tIdx = 0; tIdx < tCount; ++tIdx) {
138 double c1Top = tIdx == tCount - 1 ? 1 :
167 if (tCount > 1) {
172 double c2Top = tIdx == tCount - 1 ? to2 :
H A DSkOpSegment.cpp234 int tCount = fTs.count(); local
239 } while (!approximately_negative(tStart - fTs[tIndex].fT) && tIndex < tCount);
435 size_t tCount = fTs.count(); local
436 for (size_t index = 0; index < tCount; ++index) {
452 insertedAt = tCount;
753 int tCount = fTs.count(); local
754 for (int tIndex = 0; tIndex < tCount; ++tIndex) {
1889 size_t tCount = fTs.count();
1890 for (size_t index = 0; index < tCount; ++index) {
2575 size_t tCount
[all...]
/external/skia/src/pathops/
H A DSkDQuadIntersection.cpp173 int tCount = tsFound.count(); local
174 if (tCount <= 0) {
178 if (tCount == 1) {
181 SkASSERT(tCount > 1);
198 if (tMin != tMax || tCount > 2) {
200 for (int index = 1; index < tCount; ++index) {
H A DSkDCubicIntersection.cpp117 int tCount = locals.used();
118 for (int tIdx = 0; tIdx < tCount; ++tIdx) {
138 double c1Top = tIdx == tCount - 1 ? 1 :
167 if (tCount > 1) {
172 double c2Top = tIdx == tCount - 1 ? to2 :
H A DSkOpSegment.cpp234 int tCount = fTs.count(); local
239 } while (!approximately_negative(tStart - fTs[tIndex].fT) && tIndex < tCount);
435 size_t tCount = fTs.count(); local
436 for (size_t index = 0; index < tCount; ++index) {
452 insertedAt = tCount;
753 int tCount = fTs.count(); local
754 for (int tIndex = 0; tIndex < tCount; ++tIndex) {
1889 size_t tCount = fTs.count();
1890 for (size_t index = 0; index < tCount; ++index) {
2575 size_t tCount
[all...]

Completed in 143 milliseconds