/external/perfetto/ui/src/tracks/thread_state/ |
D | frontend.ts | 67 const tStart = data.starts[i]; constant 70 if (tEnd <= visibleWindowTime.start || tStart >= visibleWindowTime.end) { 73 if (tStart && tEnd) { 76 const rectStart = timeScale.timeToPx(tStart); 102 const tStart = data.starts[startIndex]; constant 105 const rectStart = timeScale.timeToPx(tStart);
|
/external/skqp/src/pathops/ |
D | SkPathOpsCurve.cpp | 63 double tStart, double tEnd, SkPathOpsBounds* bounds) { in setConicBounds() argument 67 dRect.setBounds(dCurve, fConic, tStart, tEnd); in setConicBounds() 73 double tStart, double tEnd, SkPathOpsBounds* bounds) { in setCubicBounds() argument 77 dRect.setBounds(dCurve, fCubic, tStart, tEnd); in setCubicBounds() 83 double tStart, double tEnd, SkPathOpsBounds* bounds) { in setQuadBounds() argument 87 dRect.setBounds(dCurve, fQuad, tStart, tEnd); in setQuadBounds()
|
D | SkPathOpsRect.h | 56 void setBounds(const SkDConic& curve, const SkDConic& sub, double tStart, double tEnd); 62 void setBounds(const SkDCubic& curve, const SkDCubic& sub, double tStart, double tEnd); 68 void setBounds(const SkDQuad& curve, const SkDQuad& sub, double tStart, double tEnd);
|
D | SkOpAngle.cpp | 524 double tStart = index ? rh->fStart->t() : this->fStart->t(); in endsIntersect() local 526 bool testAscends = tStart < (index ? rh->fComputedEnd->t() : this->fComputedEnd->t()); in endsIntersect() 530 if (!approximately_between_orderable(tStart, testT, tEnd)) { in endsIntersect() 533 if (approximately_equal_orderable(tStart, testT)) { in endsIntersect() 625 double tStart = sIndex ? rh->fStart->t() : fStart->t(); in endsIntersect() local 626 SkDVector mid = segment.dPtAtT(tStart + (sCeptT - tStart) / 2) - curve[0]; in endsIntersect() 803 double tStart = angle->fStart->t(); in loopContains() local 815 if (lEnd == tStart) { in loopContains()
|
D | SkPathOpsTSect.cpp | 547 bool SkTSect::binarySearchCoin(SkTSect* sect2, double tStart, in binarySearchCoin() argument 550 double result = work.fStartT = work.fEndT = tStart; in binarySearchCoin() 552 SkDPoint last = fCurve.ptAtT(tStart); in binarySearchCoin() 1159 double tStart = oCoinS.perpT(); in linesIntersect() local 1161 bool swap = tStart > tEnd; in linesIntersect() 1164 swap(tStart, tEnd); in linesIntersect() 1166 tStart = SkTMax(tStart, span->fStartT); in linesIntersect() 1168 if (tStart > tEnd) { in linesIntersect() 1172 if (tStart == span->fStartT) { in linesIntersect() 1194 double workT = tStart; in linesIntersect() [all …]
|
D | SkOpCoincidence.h | 252 double tStart, double tEnd, SkOpSegment* coinSeg, SkOpSegment* oppSeg, 273 double tStart, double tEnd,
|
D | SkOpCoincidence.cpp | 620 double tStart, double tEnd, SkOpSegment* coinSeg, SkOpSegment* oppSeg, bool* added in addIfMissing() argument 622 SkASSERT(tStart < tEnd); in addIfMissing() 624 SkASSERT(between(over1s->fT, tStart, over1e->fT)); in addIfMissing() 627 SkASSERT(between(over2s->fT, tStart, over2e->fT)); in addIfMissing() 636 coinTs = TRange(over1s, tStart, coinSeg SkDEBUGPARAMS(over1e)); in addIfMissing() 642 oppTs = TRange(over2s, tStart, oppSeg SkDEBUGPARAMS(over2e)); in addIfMissing()
|
D | SkPathOpsTSect.h | 292 bool binarySearchCoin(SkTSect* , double tStart, double tStep, double* t,
|
/external/skia/src/pathops/ |
D | SkPathOpsCurve.cpp | 63 double tStart, double tEnd, SkPathOpsBounds* bounds) { in setConicBounds() argument 67 dRect.setBounds(dCurve, fConic, tStart, tEnd); in setConicBounds() 73 double tStart, double tEnd, SkPathOpsBounds* bounds) { in setCubicBounds() argument 77 dRect.setBounds(dCurve, fCubic, tStart, tEnd); in setCubicBounds() 83 double tStart, double tEnd, SkPathOpsBounds* bounds) { in setQuadBounds() argument 87 dRect.setBounds(dCurve, fQuad, tStart, tEnd); in setQuadBounds()
|
D | SkPathOpsRect.h | 56 void setBounds(const SkDConic& curve, const SkDConic& sub, double tStart, double tEnd); 62 void setBounds(const SkDCubic& curve, const SkDCubic& sub, double tStart, double tEnd); 68 void setBounds(const SkDQuad& curve, const SkDQuad& sub, double tStart, double tEnd);
|
D | SkOpAngle.cpp | 524 double tStart = index ? rh->fStart->t() : this->fStart->t(); in endsIntersect() local 526 bool testAscends = tStart < (index ? rh->fComputedEnd->t() : this->fComputedEnd->t()); in endsIntersect() 530 if (!approximately_between_orderable(tStart, testT, tEnd)) { in endsIntersect() 533 if (approximately_equal_orderable(tStart, testT)) { in endsIntersect() 625 double tStart = sIndex ? rh->fStart->t() : fStart->t(); in endsIntersect() local 626 SkDVector mid = segment.dPtAtT(tStart + (sCeptT - tStart) / 2) - curve[0]; in endsIntersect() 803 double tStart = angle->fStart->t(); in loopContains() local 815 if (lEnd == tStart) { in loopContains()
|
D | SkPathOpsTSect.cpp | 547 bool SkTSect::binarySearchCoin(SkTSect* sect2, double tStart, in binarySearchCoin() argument 550 double result = work.fStartT = work.fEndT = tStart; in binarySearchCoin() 552 SkDPoint last = fCurve.ptAtT(tStart); in binarySearchCoin() 1159 double tStart = oCoinS.perpT(); in linesIntersect() local 1161 bool swap = tStart > tEnd; in linesIntersect() 1164 swap(tStart, tEnd); in linesIntersect() 1166 tStart = SkTMax(tStart, span->fStartT); in linesIntersect() 1168 if (tStart > tEnd) { in linesIntersect() 1172 if (tStart == span->fStartT) { in linesIntersect() 1194 double workT = tStart; in linesIntersect() [all …]
|
D | SkOpCoincidence.h | 252 double tStart, double tEnd, SkOpSegment* coinSeg, SkOpSegment* oppSeg, 273 double tStart, double tEnd,
|
D | SkOpCoincidence.cpp | 620 double tStart, double tEnd, SkOpSegment* coinSeg, SkOpSegment* oppSeg, bool* added in addIfMissing() argument 622 SkASSERT(tStart < tEnd); in addIfMissing() 624 SkASSERT(between(over1s->fT, tStart, over1e->fT)); in addIfMissing() 627 SkASSERT(between(over2s->fT, tStart, over2e->fT)); in addIfMissing() 636 coinTs = TRange(over1s, tStart, coinSeg SkDEBUGPARAMS(over1e)); in addIfMissing() 642 oppTs = TRange(over2s, tStart, oppSeg SkDEBUGPARAMS(over2e)); in addIfMissing()
|
D | SkPathOpsTSect.h | 292 bool binarySearchCoin(SkTSect* , double tStart, double tStep, double* t,
|
/external/perfetto/ui/src/frontend/ |
D | overview_timeline_panel.ts | 121 let tStart = this.timeScale.pxToTime(this.dragStartPx); variable 123 if (tStart > tEnd) [tStart, tEnd] = [tEnd, tStart]; 124 const vizTime = new TimeSpan(tStart, tEnd);
|
D | viewer_page.ts | 218 let tStart = vizTime.start + tDelta; variable 220 if (tStart < traceTime.startSec) { 221 tStart = traceTime.startSec; 222 tEnd = tStart + origDelta; 225 tStart = tEnd - origDelta; 227 frontendLocalState.updateVisibleTime(new TimeSpan(tStart, tEnd));
|
/external/perfetto/ui/src/tracks/chrome_slices/ |
D | frontend.ts | 82 const tStart = data.starts[i]; constant 88 if (tEnd <= visibleWindowTime.start || tStart >= visibleWindowTime.end) { 91 const rectXStart = Math.max(timeScale.timeToPx(tStart), 0); 119 const tStart = data.starts[i]; constant 122 if (tStart <= t && t <= tEnd && depth === data.depths[i]) {
|
/external/perfetto/ui/src/tracks/cpu_slices/ |
D | frontend.ts | 122 const tStart = data.starts[i]; constant 125 if (tEnd <= visibleWindowTime.start || tStart >= visibleWindowTime.end) { 128 const rectStart = timeScale.timeToPx(tStart); 189 const tStart = data.starts[startIndex]; constant 193 const rectStart = timeScale.timeToPx(tStart); 213 const displayText = timeToString(tStart - details.wakeupTs); 285 const tStart = data.starts[i]; constant 288 if (tStart <= t && t <= tEnd) {
|
/external/mesa3d/src/mesa/swrast/ |
D | s_aalinetemp.h | 109 GLfloat tStart, tEnd; /* segment start, end along line length */ in NAME() local 191 tStart = tEnd = 0.0; in NAME() 204 tStart = t; in NAME() 213 if (inSegment && (tEnd > tStart)) { in NAME() 215 segment(ctx, &line, NAME(plot), tStart, tEnd); in NAME() 227 segment(ctx, &line, NAME(plot), tStart, 1.0F); in NAME()
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/ode/events/ |
D | EventState.java | 176 final double tStart = interpolator.getPreviousTime(); in reinitializeBegin() local 177 interpolator.setInterpolatedTime(tStart); in reinitializeBegin() 178 g0Positive = handler.g(tStart, interpolator.getInterpolatedState()) <= 0; in reinitializeBegin()
|
/external/perfetto/ui/src/tracks/process_scheduling/ |
D | frontend.ts | 115 const tStart = data.starts[i]; constant 119 if (tEnd <= visibleWindowTime.start || tStart >= visibleWindowTime.end) { 122 const rectStart = timeScale.timeToPx(tStart);
|
/external/skqp/tests/ |
D | PathOpsTestCommon.cpp | 144 double tStart = 0; in CubicToQuads() local 149 SkDCubic part = cubic.subDivide(tStart, tEnd); in CubicToQuads() 162 tStart = tEnd; in CubicToQuads()
|
/external/skia/tests/ |
D | PathOpsTestCommon.cpp | 144 double tStart = 0; in CubicToQuads() local 149 SkDCubic part = cubic.subDivide(tStart, tEnd); in CubicToQuads() 162 tStart = tEnd; in CubicToQuads()
|
/external/walt/android/WALT/app/src/main/java/org/chromium/latency/walt/ |
D | ScreenResponseFragment.java | 478 long tStart = waltDevice.clock.micros(); 491 logger.log("=== Screen brightness curve: ===\nt_start: " + tStart);
|