| /external/chromium_org/third_party/skia/src/pathops/ |
| D | SkOpSegment.h | 196 const SkOpAngle* spanToAngle(int tStart, int tEnd) const { in spanToAngle() argument
197 SkASSERT(tStart != tEnd); in spanToAngle()
198 const SkOpSpan& span = fTs[tStart]; in spanToAngle()
199 return tStart < tEnd ? span.fToAngle : span.fFromAngle; in spanToAngle()
203 SkOpAngle* spanToAngle(int tStart, int tEnd) { in spanToAngle() argument
204 const SkOpAngle* cAngle = (const_cast<const SkOpSegment*>(this))->spanToAngle(tStart, tEnd); in spanToAngle()
428 bool clockwise(int tStart, int tEnd, bool* swap) const;
466 bool monotonicInY(int tStart, int tEnd) const;
473 bool serpentine(int tStart, int tEnd) const;
502 bool controlsContainedByEnds(int tStart, int tEnd) const;
[all …]
|
| D | SkPathOpsDebug.cpp | 294 bool SkOpSegment::controlsContainedByEnds(int tStart, int tEnd) const { in controlsContainedByEnds() argument
298 SkDCubic dst = SkDCubic::SubDivide(fPts, fTs[tStart].fT, fTs[tEnd].fT); in controlsContainedByEnds()
316 void SkOpSegment::debugCheckPointsEqualish(int tStart, int tEnd) const { in debugCheckPointsEqualish() argument
317 const SkPoint& basePt = fTs[tStart].fPt; in debugCheckPointsEqualish()
318 while (++tStart < tEnd) { in debugCheckPointsEqualish()
319 const SkPoint& cmpPt = fTs[tStart].fPt; in debugCheckPointsEqualish()
326 int SkOpSegment::debugInflections(int tStart, int tEnd) const { in debugInflections() argument
330 SkDCubic dst = SkDCubic::SubDivide(fPts, fTs[tStart].fT, fTs[tEnd].fT); in debugInflections()
|
| D | SkOpAngle.cpp | 417 double tStart = segment.t(index ? rh.fStart : fStart); in endsIntersect() local
423 if (!approximately_between_orderable(tStart, testT, tEnd)) { in endsIntersect()
426 if (approximately_equal_orderable(tStart, testT)) { in endsIntersect()
516 double tStart = segment.t(sIndex ? rh.fStart : fStart); in endsIntersect() local
517 SkDVector mid = segment.dPtAtT(tStart + (sCeptT - tStart) / 2) - curve[0]; in endsIntersect()
716 double tStart = tSegment->span(test.fStart).fT; in loopContains() local
729 if (lEnd == tStart) { in loopContains()
|
| D | SkDCubicIntersection.cpp | 28 static int quadPart(const SkDCubic& cubic, double tStart, double tEnd, SkReduceOrder* reducer) { in quadPart() argument
29 SkDCubic part = cubic.subDivide(tStart, tEnd); in quadPart()
38 cubic[3].fX, cubic[3].fY, tStart, tEnd); in quadPart()
|
| D | SkOpSegment.cpp | 343 double tStart = fTs[tIndex].fT; in addCoinOutsides() local
345 if (tStart == 1 && oStart == 1 && fOperand == other->fOperand) { in addCoinOutsides()
349 addTPair(tStart, other, oStart, false, nextPt); in addCoinOutsides()
2136 int tStart = -1; in checkEnds() local
2144 tStart = inner - 1; in checkEnds()
2169 for (int tIndex = tStart + 1; tIndex < tLast; ++tIndex) { in checkEnds()
3709 bool SkOpSegment::clockwise(int tStart, int tEnd, bool* swap) const { in clockwise() argument
3712 subDivide(tStart, tEnd, edge); in clockwise()
3728 double tLo = this->span(tStart).fT; in clockwise()
3753 SkPoint topPt = cubic_top(fPts, fTs[tStart].fT, fTs[tEnd].fT); in clockwise()
[all …]
|
| /external/skia/src/pathops/ |
| D | SkOpSegment.h | 194 const SkOpAngle* spanToAngle(int tStart, int tEnd) const { in spanToAngle() argument
195 SkASSERT(tStart != tEnd); in spanToAngle()
196 const SkOpSpan& span = fTs[tStart]; in spanToAngle()
197 return tStart < tEnd ? span.fToAngle : span.fFromAngle; in spanToAngle()
201 SkOpAngle* spanToAngle(int tStart, int tEnd) { in spanToAngle() argument
202 const SkOpAngle* cAngle = (const_cast<const SkOpSegment*>(this))->spanToAngle(tStart, tEnd); in spanToAngle()
426 bool clockwise(int tStart, int tEnd, bool* swap) const;
464 bool monotonicInY(int tStart, int tEnd) const;
471 bool serpentine(int tStart, int tEnd) const;
500 bool controlsContainedByEnds(int tStart, int tEnd) const;
[all …]
|
| D | SkPathOpsDebug.cpp | 293 bool SkOpSegment::controlsContainedByEnds(int tStart, int tEnd) const { in controlsContainedByEnds() argument
297 SkDCubic dst = SkDCubic::SubDivide(fPts, fTs[tStart].fT, fTs[tEnd].fT); in controlsContainedByEnds()
315 void SkOpSegment::debugCheckPointsEqualish(int tStart, int tEnd) const { in debugCheckPointsEqualish() argument
316 const SkPoint& basePt = fTs[tStart].fPt; in debugCheckPointsEqualish()
317 while (++tStart < tEnd) { in debugCheckPointsEqualish()
318 const SkPoint& cmpPt = fTs[tStart].fPt; in debugCheckPointsEqualish()
325 int SkOpSegment::debugInflections(int tStart, int tEnd) const { in debugInflections() argument
329 SkDCubic dst = SkDCubic::SubDivide(fPts, fTs[tStart].fT, fTs[tEnd].fT); in debugInflections()
|
| D | SkOpAngle.cpp | 420 double tStart = segment.t(index ? rh.fStart : fStart); in endsIntersect() local
426 if (!approximately_between_orderable(tStart, testT, tEnd)) { in endsIntersect()
429 if (approximately_equal_orderable(tStart, testT)) { in endsIntersect()
519 double tStart = segment.t(sIndex ? rh.fStart : fStart); in endsIntersect() local
520 SkDVector mid = segment.dPtAtT(tStart + (sCeptT - tStart) / 2) - curve[0]; in endsIntersect()
719 double tStart = tSegment->span(test.fStart).fT; in loopContains() local
732 if (lEnd == tStart) { in loopContains()
|
| D | SkDCubicIntersection.cpp | 28 static int quadPart(const SkDCubic& cubic, double tStart, double tEnd, SkReduceOrder* reducer) { in quadPart() argument
29 SkDCubic part = cubic.subDivide(tStart, tEnd); in quadPart()
38 cubic[3].fX, cubic[3].fY, tStart, tEnd); in quadPart()
|
| D | SkOpSegment.cpp | 342 double tStart = fTs[tIndex].fT; in addCoinOutsides() local
344 if (tStart == 1 && oStart == 1 && fOperand == other->fOperand) { in addCoinOutsides()
348 addTPair(tStart, other, oStart, false, nextPt); in addCoinOutsides()
2066 int tStart = -1; in checkEnds() local
2074 tStart = inner - 1; in checkEnds()
2099 for (int tIndex = tStart + 1; tIndex < tLast; ++tIndex) { in checkEnds()
3624 bool SkOpSegment::clockwise(int tStart, int tEnd, bool* swap) const { in clockwise() argument
3627 subDivide(tStart, tEnd, edge); in clockwise()
3643 double tLo = this->span(tStart).fT; in clockwise()
3668 SkPoint topPt = cubic_top(fPts, fTs[tStart].fT, fTs[tEnd].fT); in clockwise()
[all …]
|
| /external/mesa3d/src/mesa/swrast/ |
| D | s_aalinetemp.h | 109 GLfloat tStart, tEnd; /* segment start, end along line length */ in NAME() local
190 tStart = tEnd = 0.0; in NAME()
203 tStart = t; in NAME()
212 if (inSegment && (tEnd > tStart)) { in NAME()
214 segment(ctx, &line, NAME(plot), tStart, tEnd); in NAME()
226 segment(ctx, &line, NAME(plot), tStart, 1.0F); in NAME()
|
| /external/chromium_org/third_party/mesa/src/src/mesa/swrast/ |
| D | s_aalinetemp.h | 109 GLfloat tStart, tEnd; /* segment start, end along line length */ in NAME() local
190 tStart = tEnd = 0.0; in NAME()
203 tStart = t; in NAME()
212 if (inSegment && (tEnd > tStart)) { in NAME()
214 segment(ctx, &line, NAME(plot), tStart, tEnd); in NAME()
226 segment(ctx, &line, NAME(plot), tStart, 1.0F); in NAME()
|
| /external/skia/tests/ |
| D | PathOpsCubicQuadIntersectionTest.cpp | 152 double tStart = 0; in DEF_TEST() local
156 SkDCubic part = cubic.subDivide(tStart, tEnd); in DEF_TEST()
218 double quadT = tStart + (tEnd - tStart) * locals[0][0]; in DEF_TEST()
260 tStart = tEnd; in DEF_TEST()
|
| D | PathOpsTestCommon.cpp | 22 double tStart = 0; in CubicToQuads() local
25 SkDCubic part = cubic.subDivide(tStart, tEnd); in CubicToQuads()
28 tStart = tEnd; in CubicToQuads()
|
| /external/chromium_org/third_party/skia/tests/ |
| D | PathOpsCubicQuadIntersectionTest.cpp | 152 double tStart = 0; in DEF_TEST() local
156 SkDCubic part = cubic.subDivide(tStart, tEnd); in DEF_TEST()
218 double quadT = tStart + (tEnd - tStart) * locals[0][0]; in DEF_TEST()
260 tStart = tEnd; in DEF_TEST()
|
| D | PathOpsTestCommon.cpp | 22 double tStart = 0; in CubicToQuads() local
25 SkDCubic part = cubic.subDivide(tStart, tEnd); in CubicToQuads()
28 tStart = tEnd; in CubicToQuads()
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| D | CubicIntersection.cpp | 30 static int quadPart(const Cubic& cubic, double tStart, double tEnd, Quadratic& simple) { in quadPart() argument
32 sub_divide(cubic, tStart, tEnd, part); in quadPart()
41 cubic[3].x, cubic[3].y, tStart, tEnd); in quadPart()
|
| D | Simplify.cpp | 1466 void addCancelOutsides(double tStart, double oStart, Segment& other, in addCancelOutsides() argument
1474 } while (!approximately_negative(tStart - fTs[tIndex].fT) && tIndex < tCount); in addCancelOutsides()
1483 } while (nextT < 1 && approximately_negative(nextT - tStart)); in addCancelOutsides()
1546 double tStart = outsideTs[0]; in addCoinOutsides() local
1550 } while (!approximately_negative(tStart - fTs[tIndex].fT)); in addCoinOutsides()
1556 addTPair(tStart, other, oStart, false, ptStart); in addCoinOutsides()
1558 tStart = fTs[tIndex].fT; in addCoinOutsides()
1564 } while (approximately_negative(nextT - tStart)); in addCoinOutsides()
1565 tStart = nextT; in addCoinOutsides()
1571 if (tStart == 1 && oStart == 1 && fOperand == other.fOperand) { in addCoinOutsides()
[all …]
|
| /external/skia/experimental/Intersection/ |
| D | CubicIntersection.cpp | 30 static int quadPart(const Cubic& cubic, double tStart, double tEnd, Quadratic& simple) { in quadPart() argument
32 sub_divide(cubic, tStart, tEnd, part); in quadPart()
41 cubic[3].x, cubic[3].y, tStart, tEnd); in quadPart()
|
| D | Simplify.cpp | 1466 void addCancelOutsides(double tStart, double oStart, Segment& other, in addCancelOutsides() argument
1474 } while (!approximately_negative(tStart - fTs[tIndex].fT) && tIndex < tCount); in addCancelOutsides()
1483 } while (nextT < 1 && approximately_negative(nextT - tStart)); in addCancelOutsides()
1546 double tStart = outsideTs[0]; in addCoinOutsides() local
1550 } while (!approximately_negative(tStart - fTs[tIndex].fT)); in addCoinOutsides()
1556 addTPair(tStart, other, oStart, false, ptStart); in addCoinOutsides()
1558 tStart = fTs[tIndex].fT; in addCoinOutsides()
1564 } while (approximately_negative(nextT - tStart)); in addCoinOutsides()
1565 tStart = nextT; in addCoinOutsides()
1571 if (tStart == 1 && oStart == 1 && fOperand == other.fOperand) { in addCoinOutsides()
[all …]
|
| /external/icu/icu4c/source/i18n/ |
| D | smpdtfmt.cpp | 2210 int32_t tStart = t; in matchLiterals() local
2225 if (!whitespaceLenient && t == tStart) { in matchLiterals()
|
| /external/chromium_org/third_party/icu/source/i18n/ |
| D | smpdtfmt.cpp | 2184 int32_t tStart = t; in matchLiterals() local
2199 if (!lenient && t == tStart) { in matchLiterals()
|