Searched refs:fLine (Results 1 - 25 of 38) sorted by relevance

12

/external/skia/src/sksl/
H A DSkSLPosition.h21 : fLine(-1)
25 : fLine(line)
29 return to_string(fLine);
32 int fLine; member in struct:SkSL::Position
/external/skqp/src/sksl/
H A DSkSLPosition.h21 : fLine(-1)
25 : fLine(line)
29 return to_string(fLine);
32 int fLine; member in struct:SkSL::Position
/external/skia/src/pathops/
H A DSkDConicLineIntersection.cpp21 , fLine(&l)
29 SkDEBUGPARAMS(fLine(nullptr))
43 double t = fLine->nearPoint(conicMidPt, nullptr);
111 SkDEBUGCODE(SkDPoint linePt = fLine->ptAtT(lineT));
126 double adj = (*fLine)[1].fX - (*fLine)[0].fX;
127 double opp = (*fLine)[1].fY - (*fLine)[0].fY;
130 r[n] = (fConic[n].fY - (*fLine)[0].fY) * adj - (fConic[n].fX - (*fLine)[
342 const SkDLine* fLine; member in class:LineConicIntersections
[all...]
H A DSkDQuadLineIntersection.cpp99 , fLine(&l)
107 SkDEBUGPARAMS(fLine(nullptr))
121 double t = fLine->nearPoint(quadMidPt, nullptr);
155 double adj = (*fLine)[1].fX - (*fLine)[0].fX;
156 double opp = (*fLine)[1].fY - (*fLine)[0].fY;
159 r[n] = (fQuad[n].fY - (*fLine)[0].fY) * adj - (fQuad[n].fX - (*fLine)[0].fX) * opp;
280 double lineT = fLine
418 const SkDLine* fLine; member in class:LineQuadraticIntersections
[all...]
H A DSkDCubicLineIntersection.cpp87 , fLine(l)
102 double t = fLine.nearPoint(cubicMidPt, nullptr);
122 double adj = fLine[1].fX - fLine[0].fX;
123 double opp = fLine[1].fY - fLine[0].fY;
127 c[n].fX = (fCubic[n].fY - fLine[0].fY) * adj - (fCubic[n].fX - fLine[0].fX) * opp;
136 c[n].fY = (fCubic[n].fY - fLine[0].fY) * opp
137 + (fCubic[n].fX - fLine[
413 const SkDLine& fLine; member in class:LineCubicIntersections
[all...]
H A DSkReduceOrder.h30 SkDLine fLine; member in union:SkReduceOrder
H A DSkReduceOrder.cpp11 fLine[0] = line[0];
13 fLine[1] = line[different];
253 *reducePts++ = reducer.fLine[index].asSkPoint();
H A DSkPathOpsCurve.h50 SkDLine fLine; member in union:SkDCurve::__anon20849
135 return c.fLine.ptAtT(t);
215 return c.fLine.fPts[1] - c.fLine.fPts[0];
337 i->intersectRay(c.fLine, ray);
/external/skqp/src/pathops/
H A DSkDConicLineIntersection.cpp21 , fLine(&l)
29 SkDEBUGPARAMS(fLine(nullptr))
43 double t = fLine->nearPoint(conicMidPt, nullptr);
111 SkDEBUGCODE(SkDPoint linePt = fLine->ptAtT(lineT));
126 double adj = (*fLine)[1].fX - (*fLine)[0].fX;
127 double opp = (*fLine)[1].fY - (*fLine)[0].fY;
130 r[n] = (fConic[n].fY - (*fLine)[0].fY) * adj - (fConic[n].fX - (*fLine)[
342 const SkDLine* fLine; member in class:LineConicIntersections
[all...]
H A DSkDQuadLineIntersection.cpp99 , fLine(&l)
107 SkDEBUGPARAMS(fLine(nullptr))
121 double t = fLine->nearPoint(quadMidPt, nullptr);
155 double adj = (*fLine)[1].fX - (*fLine)[0].fX;
156 double opp = (*fLine)[1].fY - (*fLine)[0].fY;
159 r[n] = (fQuad[n].fY - (*fLine)[0].fY) * adj - (fQuad[n].fX - (*fLine)[0].fX) * opp;
280 double lineT = fLine
418 const SkDLine* fLine; member in class:LineQuadraticIntersections
[all...]
H A DSkDCubicLineIntersection.cpp87 , fLine(l)
102 double t = fLine.nearPoint(cubicMidPt, nullptr);
122 double adj = fLine[1].fX - fLine[0].fX;
123 double opp = fLine[1].fY - fLine[0].fY;
127 c[n].fX = (fCubic[n].fY - fLine[0].fY) * adj - (fCubic[n].fX - fLine[0].fX) * opp;
136 c[n].fY = (fCubic[n].fY - fLine[0].fY) * opp
137 + (fCubic[n].fX - fLine[
413 const SkDLine& fLine; member in class:LineCubicIntersections
[all...]
H A DSkReduceOrder.h30 SkDLine fLine; member in union:SkReduceOrder
H A DSkReduceOrder.cpp11 fLine[0] = line[0];
13 fLine[1] = line[different];
253 *reducePts++ = reducer.fLine[index].asSkPoint();
H A DSkPathOpsCurve.h50 SkDLine fLine; member in union:SkDCurve::__anon21517
135 return c.fLine.ptAtT(t);
215 return c.fLine.fPts[1] - c.fLine.fPts[0];
337 i->intersectRay(c.fLine, ray);
/external/skia/tests/
H A DPathOpsCubicReduceOrderTest.cpp231 if (order == 2 && reducer.fLine[0] == reducer.fLine[1]) {
236 if ( (reducer.fLine[0].fX != cubic[0].fX && reducer.fLine[0].fX != cubic[3].fX)
237 || (reducer.fLine[0].fY != cubic[0].fY && reducer.fLine[0].fY != cubic[3].fY)
238 || (reducer.fLine[1].fX != cubic[0].fX && reducer.fLine[1].fX != cubic[3].fX)
239 || (reducer.fLine[1].fY != cubic[0].fY && reducer.fLine[
[all...]
/external/skqp/tests/
H A DPathOpsCubicReduceOrderTest.cpp231 if (order == 2 && reducer.fLine[0] == reducer.fLine[1]) {
236 if ( (reducer.fLine[0].fX != cubic[0].fX && reducer.fLine[0].fX != cubic[3].fX)
237 || (reducer.fLine[0].fY != cubic[0].fY && reducer.fLine[0].fY != cubic[3].fY)
238 || (reducer.fLine[1].fX != cubic[0].fX && reducer.fLine[1].fX != cubic[3].fX)
239 || (reducer.fLine[1].fY != cubic[0].fY && reducer.fLine[
[all...]
/external/icu/icu4c/source/test/perf/howExpensiveIs/
H A DhowExpensiveIs.cpp156 HowExpensiveTest(const char *name, const char *file, int32_t line) : fName(name), fFile(file), fLine(line) {}
193 int32_t fLine; member in class:HowExpensiveTest
202 fprintf(stderr, "%s:%d:\t%s\n", t.fFile, t.fLine, t.getName());
206 fprintf(stderr, "%s:%d: Running: %s\n", t.fFile, t.fLine, t.getName());
271 int fLine; member in class:NumTest
299 fLine(LINE),
312 fFile,fLine,getName(),trial,fExpect);
399 int fLine; member in class:NumFmtTest
427 fLine(LINE),
445 fFile,fLine,getNam
484 int fLine; member in class:NumFmtInt64Test
611 int fLine; member in class:NumFmtStringPieceTest
[all...]
/external/skia/src/gpu/
H A DGrTessellator.cpp378 , fLine(top, bottom) {
400 Line fLine; member in struct:__anon20750::Edge
402 return fLine.dist(p);
405 return fLine.dist(v->fPoint) < 0.0;
408 return fLine.dist(v->fPoint) > 0.0;
411 fLine = Line(fTop, fBottom);
420 double denom = fLine.fA * other.fLine.fB - fLine.fB * other.fLine
[all...]
/external/skqp/src/gpu/
H A DGrTessellator.cpp378 , fLine(top, bottom) {
400 Line fLine; member in struct:__anon21415::Edge
402 return fLine.dist(p);
405 return fLine.dist(v->fPoint) < 0.0;
408 return fLine.dist(v->fPoint) > 0.0;
411 fLine = Line(fTop, fBottom);
420 double denom = fLine.fA * other.fLine.fB - fLine.fB * other.fLine
[all...]
/external/skia/tools/bookmaker/
H A Dbookmaker.cpp519 TextParser tp(fFileName, fLine, fChar, fLineCount);
750 const char* end = fLine + this->lineLength();
752 while (fLine < end && fMC == *--end) {
877 fChar = fLine + this->lineLength() - 1;
1174 const char* last = fLine + this->lineLength();
1175 while (last > fLine && ' ' >= *--last)
1177 if (--last < fLine) {
1332 definition->fContentEnd = fLine - 1;
1366 TextParser err(fFileName, fLine, fEnd, fLineCount);
1368 ptrdiff_t spaces = fChar - fLine;
[all...]
H A Dbookmaker.h249 fLine = parser->fLine;
255 fParser->fLine = fLine;
262 const char* fLine; member in class:TextParser::Save
270 , fLine(start)
341 if (matchLen > fChar - fLine) {
364 return this->lineEnd() - fLine;
374 fLine = fChar;
383 fLine
[all...]
H A DspellCheck.cpp26 int fLine; member in struct:CheckEntry
489 SkDebugf("%s(%d): %s\n", fullName.c_str(), iter.second.fLine,
560 SkDebugf("%s(%d): %s\n", fullName.c_str(), iter.second.fLine,
651 entry->fLine = fLineCount + fLocalLine;
/external/skqp/tools/bookmaker/
H A Dbookmaker.cpp652 const char* end = fLine + this->lineLength();
654 while (fLine < end && fMC == *--end) {
777 fChar = fLine + this->lineLength() - 1;
1081 const char* last = fLine + this->lineLength();
1082 while (last > fLine && ' ' >= *--last)
1084 if (--last < fLine) {
1239 definition->fContentEnd = fLine - 1;
1259 TextParser err(fFileName, fLine, fEnd, fLineCount);
1261 ptrdiff_t spaces = fChar - fLine;
1264 err.fLine
[all...]
H A Dbookmaker.h248 fLine = parser->fLine;
254 fParser->fLine = fLine;
261 const char* fLine; member in class:TextParser::Save
269 , fLine(start)
340 if (matchLen > fChar - fLine) {
363 return this->lineEnd() - fLine;
373 fLine = fChar;
382 fLine
[all...]
H A DspellCheck.cpp26 int fLine; member in struct:CheckEntry
495 SkDebugf("%s(%d): %s\n", iter.second.fFile.c_str(), iter.second.fLine,
565 SkDebugf("%s(%d): %s\n", iter.second.fFile.c_str(), iter.second.fLine,
656 entry->fLine = fLineCount;

Completed in 380 milliseconds

12