Lines Matching refs:tIndex
217 int tIndex = -1;
222 ++tIndex;
223 } while (startPt != fTs[tIndex].fPt && tIndex < tCount);
224 int tIndexStart = tIndex;
231 nextPt = &fTs[++tIndex].fPt;
232 SkASSERT(fTs[tIndex].fT < 1 || startPt != *nextPt);
234 double nextT = fTs[tIndex].fT;
242 // fTs[tIndexStart - 1], fTs[tIndexStart], fTs[tIndex]
260 if (nextT < 1 && fTs[tIndex].fWindValue) {
263 __FUNCTION__, fID, other->fID, tIndex,
264 fTs[tIndex].fT, xyAtT(tIndex).fX,
265 xyAtT(tIndex).fY);
267 addTPair(fTs[tIndex].fT, other, other->fTs[oIndexStart].fT, false, fTs[tIndex].fPt);
277 other->debugAddTPair(other->fTs[oIndexStart].fT, *this, fTs[tIndex].fT);
297 int tIndex = -1;
300 ++tIndex;
301 } while (startPt != fTs[tIndex].fPt);
305 if (tIndex > 0 || oIndex > 0 || fOperand != other->fOperand) {
306 addTPair(fTs[tIndex].fT, other, other->fTs[oIndex].fT, false, startPt);
312 workPt = &fTs[++tIndex].fPt;
318 double tStart = fTs[tIndex].fT;
809 for (int tIndex = 0; tIndex < tCount; ++tIndex) {
810 const SkOpSpan& span = fTs[tIndex];
843 int tIndex = nextExactSpan(end, step);
844 min = SkMin32(end, tIndex);
845 if (tIndex >= 0 && (fTs[min].fWindValue > 0 || fTs[min].fOppValue != 0)) {
846 addAngle(angles, end, tIndex);
1268 for (int tIndex = tStart + 1; tIndex < tLast; ++tIndex) {
1269 const SkOpSpan& tSpan = fTs[tIndex];
1952 const int tIndex = *tIndexPtr;
1954 if (!leftSegment->clockwise(tIndex, endIndex)) {
1955 bool swap = !leftSegment->monotonicInY(tIndex, endIndex)
1956 && !leftSegment->serpentine(tIndex, endIndex);
1960 leftSegment->serpentine(tIndex, endIndex),
1961 leftSegment->controlsContainedByEnds(tIndex, endIndex),
1962 leftSegment->monotonicInY(tIndex, endIndex));
2118 int tIndex = 0;
2120 SkOpSpan* test = &fTs[tIndex];
2136 } while (fTs[++tIndex].fT == 0);
2292 void SkOpSegment::markOneDone(const char* funName, int tIndex, int winding) {
2293 SkOpSpan* span = markOneWinding(funName, tIndex, winding);
2301 void SkOpSegment::markOneDoneBinary(const char* funName, int tIndex) {
2302 SkOpSpan* span = verifyOneWinding(funName, tIndex);
2310 void SkOpSegment::markOneDoneUnary(const char* funName, int tIndex) {
2311 SkOpSpan* span = verifyOneWindingU(funName, tIndex);
2319 SkOpSpan* SkOpSegment::markOneWinding(const char* funName, int tIndex, int winding) {
2320 SkOpSpan& span = fTs[tIndex];
2333 SkOpSpan* SkOpSegment::markOneWinding(const char* funName, int tIndex, int winding,
2335 SkOpSpan& span = fTs[tIndex];
2398 SkOpSpan* SkOpSegment::verifyOneWinding(const char* funName, int tIndex) {
2399 SkOpSpan& span = fTs[tIndex];
2415 SkOpSpan* SkOpSegment::verifyOneWindingU(const char* funName, int tIndex) {
2416 SkOpSpan& span = fTs[tIndex];
2482 void SkOpSegment::matchWindingValue(int tIndex, double t, bool borrowWind) {
2485 if (tIndex > 0) {
2486 const SkOpSpan& below = fTs[tIndex - 1];
2492 if (nextDoorWind == SK_MaxS32 && tIndex + 1 < fTs.count()) {
2493 const SkOpSpan& above = fTs[tIndex + 1];
2499 if (nextDoorWind == SK_MaxS32 && borrowWind && tIndex > 0 && t < 1) {
2500 const SkOpSpan& below = fTs[tIndex - 1];
2505 SkOpSpan& newSpan = fTs[tIndex];
2899 int SkOpSegment::windingAtT(double tHit, int tIndex, bool crossOpp, SkScalar* dx) const {
2900 if (approximately_zero(tHit - t(tIndex))) { // if we hit the end of a span, disregard
2903 int winding = crossOpp ? oppSum(tIndex) : windSum(tIndex);
2905 int windVal = crossOpp ? oppValue(tIndex) : windValue(tIndex);
