Home
last modified time | relevance | path

Searched refs:fLine (Results 1 – 25 of 43) sorted by relevance

12

/external/skia/src/pathops/
DSkDQuadLineIntersection.cpp99 , 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 …]
DSkDConicLineIntersection.cpp21 , 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 …]
DSkDCubicLineIntersection.cpp87 , 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 …]
DSkPathOpsCurve.h50 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()
DSkReduceOrder.cpp11 fLine[0] = line[0]; in reduce()
13 fLine[1] = line[different]; in reduce()
253 *reducePts++ = reducer.fLine[index].asSkPoint(); in Quad()
DSkReduceOrder.h30 SkDLine fLine; member
/external/skqp/src/pathops/
DSkDQuadLineIntersection.cpp99 , 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 …]
DSkDConicLineIntersection.cpp21 , 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 …]
DSkDCubicLineIntersection.cpp87 , 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 …]
DSkPathOpsCurve.h50 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()
DSkReduceOrder.cpp11 fLine[0] = line[0]; in reduce()
13 fLine[1] = line[different]; in reduce()
253 *reducePts++ = reducer.fLine[index].asSkPoint(); in Quad()
DSkReduceOrder.h30 SkDLine fLine; member
/external/skia/tests/
DPathOpsCubicReduceOrderTest.cpp231 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/skqp/tests/
DPathOpsCubicReduceOrderTest.cpp231 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/skqp/tools/bookmaker/
DtextParser.cpp40 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()
DtextParser.h28 , 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()
DspellCheck.cpp32 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/tools/bookmaker/
DtextParser.cpp40 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()
DtextParser.h28 , 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()
DspellCheck.cpp32 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/skqp/src/sksl/
DSkSLPosition.h21 : fLine(-1) in Position()
25 : fLine(line) in Position()
29 return to_string(fLine); in description()
32 int fLine; member
/external/skia/src/sksl/
DSkSLPosition.h21 : fLine(-1) in Position()
25 : fLine(line) in Position()
29 return to_string(fLine); in description()
32 int fLine; member
/external/icu/icu4c/source/test/perf/howExpensiveIs/
DhowExpensiveIs.cpp156 …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/src/gpu/
DGrTessellator.cpp363 , 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 …]
/external/skqp/src/gpu/
DGrTessellator.cpp363 , 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 …]

12