| /external/skqp/tests/ |
| D | PathOpsQuadLineIntersectionThreadedTest.cpp | 96 for (int tIndex = 0; tIndex <= 4; ++tIndex) { in testQuadLineIntersectMain() local
97 SkDPoint xy = quad.ptAtT(tIndex / 4.0); in testQuadLineIntersectMain()
|
| D | PathOpsConicIntersectionTest.cpp | 145 for (int tIndex = 0; tIndex < chops; ++tIndex) { in writeDPng() local
146 SkDConic chopped = dConic.subDivide(tIndex / (double) chops, in writeDPng()
147 (tIndex + 1) / (double) chops); in writeDPng()
|
| /external/skia/tests/ |
| D | PathOpsQuadLineIntersectionThreadedTest.cpp | 96 for (int tIndex = 0; tIndex <= 4; ++tIndex) { in testQuadLineIntersectMain() local
97 SkDPoint xy = quad.ptAtT(tIndex / 4.0); in testQuadLineIntersectMain()
|
| D | PathOpsConicIntersectionTest.cpp | 144 for (int tIndex = 0; tIndex < chops; ++tIndex) { in writeDPng() local
145 SkDConic chopped = dConic.subDivide(tIndex / (double) chops, in writeDPng()
146 (tIndex + 1) / (double) chops); in writeDPng()
|
| /external/skqp/tools/bookmaker/ |
| D | textParser.h | 484 size_t tIndex = 0; in startsWith() local
487 while (oIndex < oLen && tIndex < tLen) { in startsWith()
488 bool tSpace = ' ' >= fChar[tIndex]; in startsWith()
495 ++tIndex; in startsWith()
496 } while (tIndex < tLen && ' ' >= fChar[tIndex]); in startsWith()
502 if (fChar[tIndex] != str[oIndex]) { in startsWith()
505 ++tIndex; in startsWith()
|
| /external/OpenCL-CTS/test_conformance/spir/ |
| D | run_services.cpp | 547 int tIndex = 0; in parseLine() local
559 (*dr)[tIndex++] = token; in parseLine()
568 (*dr)[tIndex] = token; in parseLine()
570 assert(tIndex && "empty data row??"); in parseLine()
|
| /external/skia/src/pathops/ |
| D | SkIntersections.h | 198 void set(bool swap, int tIndex, double t) { in set() argument
199 fT[(int) swap][tIndex] = t; in set()
|
| D | SkPathOpsWinding.cpp | 231 int tIndex = (tBase - 1) & ((1 << tBits) - 1); in get_t_guess() local
232 t += t * 2 * tIndex; in get_t_guess()
|
| D | SkPathOpsTSect.cpp | 1085 for (int tIndex = 0; tIndex < thisRayI.used(); ++tIndex) { in linesIntersect() local
1087 ptMatches += thisRayI.pt(tIndex).approximatelyEqual(thisLine.fPts[lIndex]); in linesIntersect()
|
| /external/skqp/src/pathops/ |
| D | SkIntersections.h | 198 void set(bool swap, int tIndex, double t) { in set() argument
199 fT[(int) swap][tIndex] = t; in set()
|
| D | SkPathOpsWinding.cpp | 231 int tIndex = (tBase - 1) & ((1 << tBits) - 1); in get_t_guess() local
232 t += t * 2 * tIndex; in get_t_guess()
|
| D | SkPathOpsTSect.cpp | 1085 for (int tIndex = 0; tIndex < thisRayI.used(); ++tIndex) { in linesIntersect() local
1087 ptMatches += thisRayI.pt(tIndex).approximatelyEqual(thisLine.fPts[lIndex]); in linesIntersect()
|
| /external/skqp/samplecode/ |
| D | SampleAAGeometry.cpp | 1152 for (int tIndex = 0; tIndex < tMaxCount; ++tIndex) { in draw_bisects() local
1153 if (0 >= tMax[tIndex] || tMax[tIndex] >= 1) { in draw_bisects()
1158 SkEvalCubicAt(pts, tMax[tIndex], &maxPt, &tangent, nullptr); in draw_bisects()
|
| /external/skia/samplecode/ |
| D | SampleAAGeometry.cpp | 1076 for (int tIndex = 0; tIndex < tMaxCount; ++tIndex) { in draw_bisects() local
1077 if (0 >= tMax[tIndex] || tMax[tIndex] >= 1) { in draw_bisects()
1082 SkEvalCubicAt(pts, tMax[tIndex], &maxPt, &tangent, nullptr); in draw_bisects()
|