| /external/skia/src/pathops/ |
| D | SkDQuadLineIntersection.cpp | 99 , fLine(&l) in LineQuadraticIntersections()
107 SkDEBUGPARAMS(fLine(nullptr)) in LineQuadraticIntersections()
121 double t = fLine->nearPoint(quadMidPt, nullptr); in checkCoincident()
155 double adj = (*fLine)[1].fX - (*fLine)[0].fX; in intersectRay()
156 double opp = (*fLine)[1].fY - (*fLine)[0].fY; in intersectRay()
159 r[n] = (fQuad[n].fY - (*fLine)[0].fY) * adj - (fQuad[n].fX - (*fLine)[0].fX) * opp; in intersectRay()
280 double lineT = fLine->exactPoint(fQuad[qIndex]); in addExactEndPoints()
295 double lineT = fLine->nearPoint(fQuad[qIndex], nullptr); in addNearEndPoints()
311 (*fLine)[lIndex], (*fLine)[!lIndex]); in addLineNearEndPoints()
315 fIntersections->insert(quadT, lineT, (*fLine)[lIndex]); in addLineNearEndPoints()
[all …]
|
| D | SkDConicLineIntersection.cpp | 21 , fLine(&l) in LineConicIntersections()
29 SkDEBUGPARAMS(fLine(nullptr)) in LineConicIntersections()
43 double t = fLine->nearPoint(conicMidPt, nullptr); in checkCoincident()
111 SkDEBUGCODE(SkDPoint linePt = fLine->ptAtT(lineT)); in intersect()
126 double adj = (*fLine)[1].fX - (*fLine)[0].fX; in intersectRay()
127 double opp = (*fLine)[1].fY - (*fLine)[0].fY; in intersectRay()
130 r[n] = (fConic[n].fY - (*fLine)[0].fY) * adj - (fConic[n].fX - (*fLine)[0].fX) * opp; in intersectRay()
180 double lineT = fLine->exactPoint(fConic[cIndex]); in addExactEndPoints()
195 double lineT = fLine->nearPoint(fConic[cIndex], nullptr); in addNearEndPoints()
211 (*fLine)[lIndex], (*fLine)[!lIndex]); in addLineNearEndPoints()
[all …]
|
| D | SkDCubicLineIntersection.cpp | 87 , fLine(l) in LineCubicIntersections()
102 double t = fLine.nearPoint(cubicMidPt, nullptr); in checkCoincident()
122 double adj = fLine[1].fX - fLine[0].fX; in intersectRay()
123 double opp = fLine[1].fY - fLine[0].fY; in intersectRay()
127 c[n].fX = (fCubic[n].fY - fLine[0].fY) * adj - (fCubic[n].fX - fLine[0].fX) * opp; in intersectRay()
136 c[n].fY = (fCubic[n].fY - fLine[0].fY) * opp in intersectRay()
137 + (fCubic[n].fX - fLine[0].fX) * adj; in intersectRay()
273 double lineT = fLine.exactPoint(fCubic[cIndex]); in addExactEndPoints()
290 double lineT = fLine.nearPoint(fCubic[cIndex], nullptr); in addNearEndPoints()
306 fLine[lIndex], fLine[!lIndex]); in addLineNearEndPoints()
[all …]
|
| D | SkPathOpsCurve.h | 50 SkDLine fLine; member
135 return c.fLine.ptAtT(t); in ddline_xy_at_t()
215 return c.fLine.fPts[1] - c.fLine.fPts[0]; in ddline_dxdy_at_t()
337 i->intersectRay(c.fLine, ray); in dline_intersect_ray()
|
| /external/skqp/src/pathops/ |
| D | SkDQuadLineIntersection.cpp | 99 , fLine(&l) in LineQuadraticIntersections()
107 SkDEBUGPARAMS(fLine(nullptr)) in LineQuadraticIntersections()
121 double t = fLine->nearPoint(quadMidPt, nullptr); in checkCoincident()
155 double adj = (*fLine)[1].fX - (*fLine)[0].fX; in intersectRay()
156 double opp = (*fLine)[1].fY - (*fLine)[0].fY; in intersectRay()
159 r[n] = (fQuad[n].fY - (*fLine)[0].fY) * adj - (fQuad[n].fX - (*fLine)[0].fX) * opp; in intersectRay()
280 double lineT = fLine->exactPoint(fQuad[qIndex]); in addExactEndPoints()
295 double lineT = fLine->nearPoint(fQuad[qIndex], nullptr); in addNearEndPoints()
311 (*fLine)[lIndex], (*fLine)[!lIndex]); in addLineNearEndPoints()
315 fIntersections->insert(quadT, lineT, (*fLine)[lIndex]); in addLineNearEndPoints()
[all …]
|
| D | SkDConicLineIntersection.cpp | 21 , fLine(&l) in LineConicIntersections()
29 SkDEBUGPARAMS(fLine(nullptr)) in LineConicIntersections()
43 double t = fLine->nearPoint(conicMidPt, nullptr); in checkCoincident()
111 SkDEBUGCODE(SkDPoint linePt = fLine->ptAtT(lineT)); in intersect()
126 double adj = (*fLine)[1].fX - (*fLine)[0].fX; in intersectRay()
127 double opp = (*fLine)[1].fY - (*fLine)[0].fY; in intersectRay()
130 r[n] = (fConic[n].fY - (*fLine)[0].fY) * adj - (fConic[n].fX - (*fLine)[0].fX) * opp; in intersectRay()
180 double lineT = fLine->exactPoint(fConic[cIndex]); in addExactEndPoints()
195 double lineT = fLine->nearPoint(fConic[cIndex], nullptr); in addNearEndPoints()
211 (*fLine)[lIndex], (*fLine)[!lIndex]); in addLineNearEndPoints()
[all …]
|
| D | SkDCubicLineIntersection.cpp | 87 , fLine(l) in LineCubicIntersections()
102 double t = fLine.nearPoint(cubicMidPt, nullptr); in checkCoincident()
122 double adj = fLine[1].fX - fLine[0].fX; in intersectRay()
123 double opp = fLine[1].fY - fLine[0].fY; in intersectRay()
127 c[n].fX = (fCubic[n].fY - fLine[0].fY) * adj - (fCubic[n].fX - fLine[0].fX) * opp; in intersectRay()
136 c[n].fY = (fCubic[n].fY - fLine[0].fY) * opp in intersectRay()
137 + (fCubic[n].fX - fLine[0].fX) * adj; in intersectRay()
273 double lineT = fLine.exactPoint(fCubic[cIndex]); in addExactEndPoints()
290 double lineT = fLine.nearPoint(fCubic[cIndex], nullptr); in addNearEndPoints()
306 fLine[lIndex], fLine[!lIndex]); in addLineNearEndPoints()
[all …]
|
| D | SkPathOpsCurve.h | 50 SkDLine fLine; member
135 return c.fLine.ptAtT(t); in ddline_xy_at_t()
215 return c.fLine.fPts[1] - c.fLine.fPts[0]; in ddline_dxdy_at_t()
337 i->intersectRay(c.fLine, ray); in dline_intersect_ray()
|
| D | SkReduceOrder.cpp | 11 fLine[0] = line[0]; in reduce()
13 fLine[1] = line[different]; in reduce()
253 *reducePts++ = reducer.fLine[index].asSkPoint(); in Quad()
|
| /external/skia/src/gpu/geometry/ |
| D | GrShape.cpp | 34 this->setLine(shape.fLine); in operator =()
210 fLine.fP1 = p1; in simplifyLine()
211 fLine.fP2 = p2; in simplifyLine()
214 SkASSERT(fLine.fP1 == p1 && fLine.fP2 == p2); in simplifyLine()
218 if (fLine.fP2.fY < fLine.fP1.fY || in simplifyLine()
219 (fLine.fP2.fY == fLine.fP1.fY && fLine.fP2.fX < fLine.fP1.fX)) { in simplifyLine()
221 swap(fLine.fP1, fLine.fP2); in simplifyLine()
255 this->simplifyLine(fLine.fP1, fLine.fP2, flags); in simplify()
380 SkRect b = SkRect::MakeLTRB(fLine.fP1.fX, fLine.fP1.fY, in bounds()
381 fLine.fP2.fX, fLine.fP2.fY); in bounds()
[all …]
|
| D | GrShape.h | 145 GrLineSegment& line() { SkASSERT(this->isLine()); return fLine; } in line()
146 const GrLineSegment& line() const { SkASSERT(this->isLine()); return fLine; } in line()
172 fLine = line; in setLine()
272 GrLineSegment fLine; member
|
| /external/skqp/tests/ |
| D | PathOpsCubicReduceOrderTest.cpp | 231 if (order == 2 && reducer.fLine[0] == reducer.fLine[1]) { in DEF_TEST()
236 if ( (reducer.fLine[0].fX != cubic[0].fX && reducer.fLine[0].fX != cubic[3].fX) in DEF_TEST()
237 || (reducer.fLine[0].fY != cubic[0].fY && reducer.fLine[0].fY != cubic[3].fY) in DEF_TEST()
238 || (reducer.fLine[1].fX != cubic[0].fX && reducer.fLine[1].fX != cubic[3].fX) in DEF_TEST()
239 || (reducer.fLine[1].fY != cubic[0].fY && reducer.fLine[1].fY != cubic[3].fY)) { in DEF_TEST()
248 if ( (!AlmostEqualUlps(reducer.fLine[0].fX, bounds.fLeft) in DEF_TEST()
249 && !AlmostEqualUlps(reducer.fLine[0].fX, bounds.fRight)) in DEF_TEST()
250 || (!AlmostEqualUlps(reducer.fLine[0].fY, bounds.fTop) in DEF_TEST()
251 && !AlmostEqualUlps(reducer.fLine[0].fY, bounds.fBottom)) in DEF_TEST()
252 || (!AlmostEqualUlps(reducer.fLine[1].fX, bounds.fLeft) in DEF_TEST()
[all …]
|
| /external/skia/tests/ |
| D | PathOpsCubicReduceOrderTest.cpp | 231 if (order == 2 && reducer.fLine[0] == reducer.fLine[1]) { in DEF_TEST()
236 if ( (reducer.fLine[0].fX != cubic[0].fX && reducer.fLine[0].fX != cubic[3].fX) in DEF_TEST()
237 || (reducer.fLine[0].fY != cubic[0].fY && reducer.fLine[0].fY != cubic[3].fY) in DEF_TEST()
238 || (reducer.fLine[1].fX != cubic[0].fX && reducer.fLine[1].fX != cubic[3].fX) in DEF_TEST()
239 || (reducer.fLine[1].fY != cubic[0].fY && reducer.fLine[1].fY != cubic[3].fY)) { in DEF_TEST()
248 if ( (!AlmostEqualUlps(reducer.fLine[0].fX, bounds.fLeft) in DEF_TEST()
249 && !AlmostEqualUlps(reducer.fLine[0].fX, bounds.fRight)) in DEF_TEST()
250 || (!AlmostEqualUlps(reducer.fLine[0].fY, bounds.fTop) in DEF_TEST()
251 && !AlmostEqualUlps(reducer.fLine[0].fY, bounds.fBottom)) in DEF_TEST()
252 || (!AlmostEqualUlps(reducer.fLine[1].fX, bounds.fLeft) in DEF_TEST()
[all …]
|
| D | SkSLDSLErrorLineNumbers.cpp | 27 , fLine(line) in ExpectErrorLineNumber()
41 REPORTER_ASSERT(fReporter, pos->line() == fLine, in handleError()
42 "Line number mismatch: expected %d, but received %d\n", fLine, pos->line()); in handleError()
48 int fLine; member in ExpectErrorLineNumber
|
| /external/skqp/tools/bookmaker/ |
| D | textParser.cpp | 40 const char* lineStart = fLine; in reportWarning()
50 err.fLine += lineLen; in reportWarning()
59 while (lineLen > 0 && '\n' == err.fLine[lineLen - 1]) { in reportWarning()
62 SkDebugf("%.*s\n", (int) lineLen, err.fLine); in reportWarning()
70 fLine = str; in setForErrorReporting()
71 while (fLine > fStart && fLine[-1] != '\n') { in setForErrorReporting()
72 --fLine; in setForErrorReporting()
|
| D | textParser.h | 28 , fLine(start) in TextParser()
181 if (matchLen > fChar - fLine) { in endsWith()
204 return this->lineEnd() - fLine; in lineLength()
214 fLine = fChar; in next()
223 fLine = save.fLine; in restorePlace()
229 save->fLine = fLine; in savePlace()
604 const char* fLine; variable
616 fSave.fLine = parser->fLine; in TextParserSave()
625 fParser->fLine = fSave.fLine; in restore()
720 fStart = fLine = fChar = fStorage; in EscapeParser()
|
| D | spellCheck.cpp | 32 int fLine; member
519 SkDebugf("%s(%d): %s\n", fullName.c_str(), iter.second.fLine, in report()
578 SkDebugf("%s(%d): %s\n", fullName.c_str(), iter.second.fLine, in report()
667 iter->second.fLine = fLineCount + fLocalLine; in wordCheck()
674 entry->fLine = fLineCount + fLocalLine; in wordCheck()
|
| /external/skia/src/sksl/ |
| D | SkSLPosition.h | 22 : fLine(-1) in Position()
26 : fLine(line) in Position()
30 return to_string(fLine); in description()
33 int fLine; member
|
| /external/skqp/src/sksl/ |
| D | SkSLPosition.h | 21 : fLine(-1) in Position()
25 : fLine(line) in Position()
29 return to_string(fLine); in description()
32 int fLine; member
|
| /external/skia/include/sksl/ |
| D | DSLErrorHandling.h | 27 , fLine(line) {} in fFile()
34 return fLine; in line()
39 int fLine; variable
|
| /external/icu/icu4c/source/test/perf/howExpensiveIs/ |
| D | howExpensiveIs.cpp | 156 …veTest(const char *name, const char *file, int32_t line) : fName(name), fFile(file), fLine(line) {} in HowExpensiveTest()
193 int32_t fLine; member in HowExpensiveTest
202 fprintf(stderr, "%s:%d:\t%s\n", t.fFile, t.fLine, t.getName()); in runTestOn()
206 fprintf(stderr, "%s:%d: Running: %s\n", t.fFile, t.fLine, t.getName()); in runTestOn()
271 int fLine; member in NumTest
299 fLine(LINE), in NumTest()
312 fFile,fLine,getName(),trial,fExpect); in warmup()
399 int fLine; member in NumFmtTest
427 fLine(LINE), in NumFmtTest()
445 fFile,fLine,getName(),strBuf,fCStr, u_errorName(setupStatus)); in warmup()
[all …]
|
| /external/skia/include/private/ |
| D | GrSingleOwner.h | 27 : fFile(file), fLine(line), fSO(so) { in AutoEnforce()
30 ~AutoEnforce() { fSO->exit(fFile, fLine); } in ~AutoEnforce()
33 int fLine; member
|
| /external/skia/src/gpu/ |
| D | GrAATriangulator.cpp | 94 Line line = edge->fEdge->fLine; in makeEvent()
99 if (line.intersect(bisector.fLine, &p) && !c.sweep_lt(p, top->fPoint) && in makeEvent()
176 normal->set(SkDoubleToScalar(e->fLine.fA), in get_edge_normal()
177 SkDoubleToScalar(e->fLine.fB)); in get_edge_normal()
208 join->fLine.normalize(); in simplifyBoundary()
209 join->fLine = join->fLine * join->fWinding; in simplifyBoundary()
422 Line prevInner(prevEdge->fLine); in strokeBoundary()
424 Line prevOuter(prevEdge->fLine); in strokeBoundary()
434 Line inner(e->fLine); in strokeBoundary()
436 Line outer(e->fLine); in strokeBoundary()
[all …]
|
| D | GrTriangulator.h | 395 , fLine(top, bottom) { in Edge()
415 Line fLine; member
416 double dist(const SkPoint& p) const { return fLine.dist(p); } in dist()
417 bool isRightOf(Vertex* v) const { return fLine.dist(v->fPoint) < 0.0; } in isRightOf()
418 bool isLeftOf(Vertex* v) const { return fLine.dist(v->fPoint) > 0.0; } in isLeftOf()
419 void recompute() { fLine = Line(fTop, fBottom); } in recompute()
|
| /external/skqp/src/gpu/ |
| D | GrTessellator.cpp | 363 , fLine(top, bottom) { in Edge()
385 Line fLine; member
387 return fLine.dist(p); in dist()
390 return fLine.dist(v->fPoint) < 0.0; in isRightOf()
393 return fLine.dist(v->fPoint) > 0.0; in isLeftOf()
396 fLine = Line(fTop, fBottom); in recompute()
405 double denom = fLine.fA * other.fLine.fB - fLine.fB * other.fLine.fA; in intersect()
411 double sNumer = dy * other.fLine.fB + dx * other.fLine.fA; in intersect()
412 double tNumer = dy * fLine.fB + dx * fLine.fA; in intersect()
421 p->fX = SkDoubleToScalar(fTop->fPoint.fX - s * fLine.fB); in intersect()
[all …]
|