/external/webrtc/src/system_wrappers/source/ |
H A D | event_posix.cc | 138 timespec tEnd; local 141 clock_gettime(CLOCK_REALTIME, &tEnd); 143 clock_gettime(CLOCK_MONOTONIC, &tEnd); 151 TIMEVAL_TO_TIMESPEC(&tVal,&tEnd); 153 tEnd.tv_sec += timeout / 1000; 154 tEnd.tv_nsec += (timeout - (timeout / 1000) * 1000) * E6; 156 if (tEnd.tv_nsec >= E9) 158 tEnd.tv_sec++; 159 tEnd.tv_nsec -= E9; 161 retVal = pthread_cond_timedwait(&cond, &mutex, &tEnd); 266 timespec tEnd; local [all...] |
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkOpSegment.h | 196 const SkOpAngle* spanToAngle(int tStart, int tEnd) const { 197 SkASSERT(tStart != tEnd); 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, int tEnd) const; 509 void debugCheckPointsEqualish(int tStart, int tEnd) cons [all...] |
H A D | SkPathOpsDebug.cpp | 294 bool SkOpSegment::controlsContainedByEnds(int tStart, int tEnd) const { 298 SkDCubic dst = SkDCubic::SubDivide(fPts, fTs[tStart].fT, fTs[tEnd].fT); 316 void SkOpSegment::debugCheckPointsEqualish(int tStart, int tEnd) const { 318 while (++tStart < tEnd) { 326 int SkOpSegment::debugInflections(int tStart, int tEnd) const { 330 SkDCubic dst = SkDCubic::SubDivide(fPts, fTs[tStart].fT, fTs[tEnd].fT); 425 SkDebugf(" tEnd=%1.9g", fTs[iEnd].fT); 449 SkDebugf(") t=%1.9g [%d] (%1.9g,%1.9g) tEnd=%1.9g newWindSum=%d windSum=", 470 SkDebugf(") t=%1.9g [%d] (%1.9g,%1.9g) tEnd=%1.9g newWindSum=%d newOppSum=%d oppSum=",
|
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__, 418 double tEnd = segment.t(index ? rh.fComputedEnd : fComputedEnd); local 423 if (!approximately_between_orderable(tStart, testT, tEnd)) { 430 limited[index] = approximately_equal_orderable(t, tEnd); 717 double tEnd local [all...] |
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.cpp | 191 SkDebugf("%s id=%d t=%1.9g tEnd=%1.9g op=%s miFrom=%d miTo=%d suFrom=%d suTo=%d result=%d\n", 3709 bool SkOpSegment::clockwise(int tStart, int tEnd, bool* swap) const { 3712 subDivide(tStart, tEnd, edge); 3729 double tHi = this->span(tEnd).fT; 3753 SkPoint topPt = cubic_top(fPts, fTs[tStart].fT, fTs[tEnd].fT); 3777 bool SkOpSegment::monotonicInY(int tStart, int tEnd) const { 3780 SkDQuad dst = SkDQuad::SubDivide(fPts, fTs[tStart].fT, fTs[tEnd].fT); 3784 SkDCubic dst = SkDCubic::SubDivide(fPts, fTs[tStart].fT, fTs[tEnd].fT); 3788 bool SkOpSegment::serpentine(int tStart, int tEnd) const { 3792 SkDCubic dst = SkDCubic::SubDivide(fPts, fTs[tStart].fT, fTs[tEnd] [all...] |
/external/skia/src/pathops/ |
H A D | SkOpSegment.h | 194 const SkOpAngle* spanToAngle(int tStart, int tEnd) const { 195 SkASSERT(tStart != tEnd); 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, int tEnd) const; 507 void debugCheckPointsEqualish(int tStart, int tEnd) cons [all...] |
H A D | SkPathOpsDebug.cpp | 293 bool SkOpSegment::controlsContainedByEnds(int tStart, int tEnd) const { 297 SkDCubic dst = SkDCubic::SubDivide(fPts, fTs[tStart].fT, fTs[tEnd].fT); 315 void SkOpSegment::debugCheckPointsEqualish(int tStart, int tEnd) const { 317 while (++tStart < tEnd) { 325 int SkOpSegment::debugInflections(int tStart, int tEnd) const { 329 SkDCubic dst = SkDCubic::SubDivide(fPts, fTs[tStart].fT, fTs[tEnd].fT); 424 SkDebugf(" tEnd=%1.9g", fTs[iEnd].fT); 448 SkDebugf(") t=%1.9g [%d] (%1.9g,%1.9g) tEnd=%1.9g newWindSum=%d windSum=", 469 SkDebugf(") t=%1.9g [%d] (%1.9g,%1.9g) tEnd=%1.9g newWindSum=%d newOppSum=%d oppSum=",
|
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__, 421 double tEnd = segment.t(index ? rh.fComputedEnd : fComputedEnd); local 426 if (!approximately_between_orderable(tStart, testT, tEnd)) { 433 limited[index] = approximately_equal_orderable(t, tEnd); 720 double tEnd local [all...] |
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.cpp | 191 SkDebugf("%s id=%d t=%1.9g tEnd=%1.9g op=%s miFrom=%d miTo=%d suFrom=%d suTo=%d result=%d\n", 3624 bool SkOpSegment::clockwise(int tStart, int tEnd, bool* swap) const { 3627 subDivide(tStart, tEnd, edge); 3644 double tHi = this->span(tEnd).fT; 3668 SkPoint topPt = cubic_top(fPts, fTs[tStart].fT, fTs[tEnd].fT); 3692 bool SkOpSegment::monotonicInY(int tStart, int tEnd) const { 3695 SkDQuad dst = SkDQuad::SubDivide(fPts, fTs[tStart].fT, fTs[tEnd].fT); 3699 SkDCubic dst = SkDCubic::SubDivide(fPts, fTs[tStart].fT, fTs[tEnd].fT); 3703 bool SkOpSegment::serpentine(int tStart, int tEnd) const { 3707 SkDCubic dst = SkDCubic::SubDivide(fPts, fTs[tStart].fT, fTs[tEnd] [all...] |
/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; 207 tEnd = t; 212 if (inSegment && (tEnd > tStart)) { 214 segment(ctx, &line, NAME(plot), 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; 207 tEnd = t; 212 if (inSegment && (tEnd > tStart)) { 214 segment(ctx, &line, NAME(plot), tStart, tEnd);
|
/external/chromium_org/third_party/skia/tests/ |
H A D | PathOpsCubicQuadIntersectionTest.cpp | 155 const double tEnd = i1 < tsCount ? ts[i1] : 1; 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 | 24 const double tEnd = i1 < ts.count() ? ts[i1] : 1; local 25 SkDCubic part = cubic.subDivide(tStart, tEnd); 28 tStart = tEnd;
|
/external/skia/tests/ |
H A D | PathOpsCubicQuadIntersectionTest.cpp | 155 const double tEnd = i1 < tsCount ? ts[i1] : 1; 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 | 24 const double tEnd = i1 < ts.count() ? ts[i1] : 1; local 25 SkDCubic part = cubic.subDivide(tStart, tEnd); 28 tStart = tEnd;
|
/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);
|
H A D | Simplify.cpp | 3452 bool controls_contained_by_ends(int tStart, int tEnd) const { 3458 sub_divide(aCubic, fTs[tStart].fT, fTs[tEnd].fT, dst); 3463 bool clockwise(int tStart, int tEnd) const { 3466 subDivide(tStart, tEnd, edge); 3474 SkPoint topPt = CubicTop(fPts, fTs[tStart].fT, fTs[tEnd].fT); 3487 bool monotonic_in_y(int tStart, int tEnd) const { 3493 sub_divide(aCubic, fTs[tStart].fT, fTs[tEnd].fT, dst); 3497 bool serpentine(int tStart, int tEnd) const { 3503 sub_divide(aCubic, fTs[tStart].fT, fTs[tEnd].fT, dst); 4226 SkDebugf(" tEnd [all...] |
/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);
|
H A D | Simplify.cpp | 3452 bool controls_contained_by_ends(int tStart, int tEnd) const { 3458 sub_divide(aCubic, fTs[tStart].fT, fTs[tEnd].fT, dst); 3463 bool clockwise(int tStart, int tEnd) const { 3466 subDivide(tStart, tEnd, edge); 3474 SkPoint topPt = CubicTop(fPts, fTs[tStart].fT, fTs[tEnd].fT); 3487 bool monotonic_in_y(int tStart, int tEnd) const { 3493 sub_divide(aCubic, fTs[tStart].fT, fTs[tEnd].fT, dst); 3497 bool serpentine(int tStart, int tEnd) const { 3503 sub_divide(aCubic, fTs[tStart].fT, fTs[tEnd].fT, dst); 4226 SkDebugf(" tEnd [all...] |