/external/chromium_org/third_party/mesa/src/src/mesa/swrast/ |
H A D | s_aalinetemp.h | 109 GLfloat tStart, tEnd; /* segment start, end along line length */ local 190 tStart = tEnd = 0.0; 203 tStart = t; 212 if (inSegment && (tEnd > tStart)) { 214 segment(ctx, &line, NAME(plot), tStart, tEnd); 226 segment(ctx, &line, NAME(plot), tStart, 1.0F);
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | CubicIntersection.cpp | 30 static int quadPart(const Cubic& cubic, double tStart, double tEnd, Quadratic& simple) { argument 32 sub_divide(cubic, tStart, tEnd, part); 41 cubic[3].x, cubic[3].y, tStart, tEnd);
|
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkDCubicIntersection.cpp | 28 static int quadPart(const SkDCubic& cubic, double tStart, double tEnd, SkReduceOrder* reducer) { argument 29 SkDCubic part = cubic.subDivide(tStart, tEnd); 38 cubic[3].fX, cubic[3].fY, tStart, tEnd);
|
H A D | SkOpSegment.h | 196 const SkOpAngle* spanToAngle(int tStart, int tEnd) const { argument 197 SkASSERT(tStart != tEnd); 198 const SkOpSpan& span = fTs[tStart]; 199 return tStart < tEnd ? span.fToAngle : span.fFromAngle; 203 SkOpAngle* spanToAngle(int tStart, int tEnd) { argument 204 const SkOpAngle* cAngle = (const_cast<const SkOpSegment*>(this))->spanToAngle(tStart, tEnd); 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, in [all...] |
H A D | SkPathOpsDebug.cpp | 294 bool SkOpSegment::controlsContainedByEnds(int tStart, int tEnd) const { argument 298 SkDCubic dst = SkDCubic::SubDivide(fPts, fTs[tStart].fT, fTs[tEnd].fT); 316 void SkOpSegment::debugCheckPointsEqualish(int tStart, int tEnd) const { argument 317 const SkPoint& basePt = fTs[tStart].fPt; 318 while (++tStart < tEnd) { 319 const SkPoint& cmpPt = fTs[tStart].fPt; 326 int SkOpSegment::debugInflections(int tStart, int tEnd) const { argument 330 SkDCubic dst = SkDCubic::SubDivide(fPts, fTs[tStart].fT, fTs[tEnd].fT);
|
H A D | SkOpAngle.cpp | 67 bugOut.printf("%s [%d/%d] %d/%d tStart=%1.9g tEnd=%1.9g" 68 " < [%d/%d] %d/%d tStart=%1.9g tEnd=%1.9g" 69 " < [%d/%d] %d/%d tStart=%1.9g tEnd=%1.9g ", __FUNCTION__, 87 bugOut.printf("%s [%d/%d] %d/%d tStart=%1.9g tEnd=%1.9g" 88 " < [%d/%d] %d/%d tStart=%1.9g tEnd=%1.9g" 89 " < [%d/%d] %d/%d tStart=%1.9g tEnd=%1.9g ", __FUNCTION__, 417 double tStart = segment.t(index ? rh.fStart : fStart); local 423 if (!approximately_between_orderable(tStart, testT, tEnd)) { 426 if (approximately_equal_orderable(tStart, testT)) { 516 double tStart 716 double tStart = tSegment->span(test.fStart).fT; local [all...] |
H A D | SkOpSegment.cpp | 343 double tStart = fTs[tIndex].fT; local 345 if (tStart == 1 && oStart == 1 && fOperand == other->fOperand) { 349 addTPair(tStart, other, oStart, false, nextPt); 2136 int tStart = -1; 2144 tStart = inner - 1; 2169 for (int tIndex = tStart + 1; tIndex < tLast; ++tIndex) { 3709 bool SkOpSegment::clockwise(int tStart, int tEnd, bool* swap) const { 3712 subDivide(tStart, tEnd, edge); 3728 double tLo = this->span(tStart).fT; 3753 SkPoint topPt = cubic_top(fPts, fTs[tStart] [all...] |
/external/chromium_org/third_party/skia/tests/ |
H A D | PathOpsCubicQuadIntersectionTest.cpp | 152 double tStart = 0; local 156 SkDCubic part = cubic.subDivide(tStart, tEnd); 218 double quadT = tStart + (tEnd - tStart) * locals[0][0]; 260 tStart = tEnd;
|
H A D | PathOpsTestCommon.cpp | 22 double tStart = 0; local 25 SkDCubic part = cubic.subDivide(tStart, tEnd); 28 tStart = tEnd;
|
/external/mesa3d/src/mesa/swrast/ |
H A D | s_aalinetemp.h | 109 GLfloat tStart, tEnd; /* segment start, end along line length */ local 190 tStart = tEnd = 0.0; 203 tStart = t; 212 if (inSegment && (tEnd > tStart)) { 214 segment(ctx, &line, NAME(plot), tStart, tEnd); 226 segment(ctx, &line, NAME(plot), tStart, 1.0F);
|
/external/skia/experimental/Intersection/ |
H A D | CubicIntersection.cpp | 30 static int quadPart(const Cubic& cubic, double tStart, double tEnd, Quadratic& simple) { argument 32 sub_divide(cubic, tStart, tEnd, part); 41 cubic[3].x, cubic[3].y, tStart, tEnd);
|
/external/skia/src/pathops/ |
H A D | SkDCubicIntersection.cpp | 28 static int quadPart(const SkDCubic& cubic, double tStart, double tEnd, SkReduceOrder* reducer) { argument 29 SkDCubic part = cubic.subDivide(tStart, tEnd); 38 cubic[3].fX, cubic[3].fY, tStart, tEnd);
|
H A D | SkOpSegment.h | 194 const SkOpAngle* spanToAngle(int tStart, int tEnd) const { argument 195 SkASSERT(tStart != tEnd); 196 const SkOpSpan& span = fTs[tStart]; 197 return tStart < tEnd ? span.fToAngle : span.fFromAngle; 201 SkOpAngle* spanToAngle(int tStart, int tEnd) { argument 202 const SkOpAngle* cAngle = (const_cast<const SkOpSegment*>(this))->spanToAngle(tStart, tEnd); 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, in [all...] |
H A D | SkPathOpsDebug.cpp | 293 bool SkOpSegment::controlsContainedByEnds(int tStart, int tEnd) const { argument 297 SkDCubic dst = SkDCubic::SubDivide(fPts, fTs[tStart].fT, fTs[tEnd].fT); 315 void SkOpSegment::debugCheckPointsEqualish(int tStart, int tEnd) const { argument 316 const SkPoint& basePt = fTs[tStart].fPt; 317 while (++tStart < tEnd) { 318 const SkPoint& cmpPt = fTs[tStart].fPt; 325 int SkOpSegment::debugInflections(int tStart, int tEnd) const { argument 329 SkDCubic dst = SkDCubic::SubDivide(fPts, fTs[tStart].fT, fTs[tEnd].fT);
|
H A D | SkOpAngle.cpp | 67 bugOut.printf("%s [%d/%d] %d/%d tStart=%1.9g tEnd=%1.9g" 68 " < [%d/%d] %d/%d tStart=%1.9g tEnd=%1.9g" 69 " < [%d/%d] %d/%d tStart=%1.9g tEnd=%1.9g ", __FUNCTION__, 87 bugOut.printf("%s [%d/%d] %d/%d tStart=%1.9g tEnd=%1.9g" 88 " < [%d/%d] %d/%d tStart=%1.9g tEnd=%1.9g" 89 " < [%d/%d] %d/%d tStart=%1.9g tEnd=%1.9g ", __FUNCTION__, 420 double tStart = segment.t(index ? rh.fStart : fStart); local 426 if (!approximately_between_orderable(tStart, testT, tEnd)) { 429 if (approximately_equal_orderable(tStart, testT)) { 519 double tStart 719 double tStart = tSegment->span(test.fStart).fT; local [all...] |
H A D | SkOpSegment.cpp | 342 double tStart = fTs[tIndex].fT; local 344 if (tStart == 1 && oStart == 1 && fOperand == other->fOperand) { 348 addTPair(tStart, other, oStart, false, nextPt); 2066 int tStart = -1; 2074 tStart = inner - 1; 2099 for (int tIndex = tStart + 1; tIndex < tLast; ++tIndex) { 3624 bool SkOpSegment::clockwise(int tStart, int tEnd, bool* swap) const { 3627 subDivide(tStart, tEnd, edge); 3643 double tLo = this->span(tStart).fT; 3668 SkPoint topPt = cubic_top(fPts, fTs[tStart] [all...] |
/external/skia/tests/ |
H A D | PathOpsCubicQuadIntersectionTest.cpp | 152 double tStart = 0; local 156 SkDCubic part = cubic.subDivide(tStart, tEnd); 218 double quadT = tStart + (tEnd - tStart) * locals[0][0]; 260 tStart = tEnd;
|
H A D | PathOpsTestCommon.cpp | 22 double tStart = 0; local 25 SkDCubic part = cubic.subDivide(tStart, tEnd); 28 tStart = tEnd;
|
/external/chromium_org/third_party/icu/source/i18n/ |
H A D | smpdtfmt.cpp | 2184 int32_t tStart = t; local 2199 if (!lenient && t == tStart) {
|
/external/icu/icu4c/source/i18n/ |
H A D | smpdtfmt.cpp | 2210 int32_t tStart = t; local 2225 if (!whitespaceLenient && t == tStart) {
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | org.eclipse.team.core_3.5.100.R36x_v20100825-0800.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.core.resources_3.6.1.R36x_v20101007-1215.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.ui.ide_3.6.2.M20101117-0800.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.jdt.core_3.6.2.v_A76_R36x.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.ui.workbench_3.6.1.M20101117-0800.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |