Home
last modified time | relevance | path

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

/external/skia/src/pathops/
DSkDCubicLineIntersection.cpp86 , fLine(l) in LineCubicIntersections()
98 double adj = fLine[1].fX - fLine[0].fX; in intersectRay()
99 double opp = fLine[1].fY - fLine[0].fY; in intersectRay()
102 r[n].fX = (fCubic[n].fY - fLine[0].fY) * adj - (fCubic[n].fX - fLine[0].fX) * opp; in intersectRay()
209 double lineT = fLine.exactPoint(fCubic[cIndex]); in addExactEndPoints()
226 double lineT = fLine.nearPoint(fCubic[cIndex]); in addNearEndPoints()
288 double dx = fLine[1].fX - fLine[0].fX; in findLineT()
289 double dy = fLine[1].fY - fLine[0].fY; in findLineT()
291 return (xy.fX - fLine[0].fX) / dx; in findLineT()
293 return (xy.fY - fLine[0].fY) / dy; in findLineT()
[all …]
DSkDQuadLineIntersection.cpp99 , fLine(l) in LineQuadraticIntersections()
125 double adj = fLine[1].fX - fLine[0].fX; in intersectRay()
126 double opp = fLine[1].fY - fLine[0].fY; in intersectRay()
129 r[n] = (fQuad[n].fY - fLine[0].fY) * adj - (fQuad[n].fX - fLine[0].fX) * opp; in intersectRay()
227 double lineT = fLine.exactPoint(fQuad[qIndex]); in addExactEndPoints()
242 double lineT = fLine.nearPoint(fQuad[qIndex]); in addNearEndPoints()
305 double dx = fLine[1].fX - fLine[0].fX; in findLineT()
306 double dy = fLine[1].fY - fLine[0].fY; in findLineT()
308 return (xy.fX - fLine[0].fX) / dx; in findLineT()
310 return (xy.fY - fLine[0].fY) / dy; in findLineT()
[all …]
DSkReduceOrder.cpp10 fLine[0] = line[0]; in reduce()
12 fLine[1] = line[different]; in reduce()
268 *reducePts++ = reducer.fLine[index].asSkPoint(); in Quad()
DSkReduceOrder.h29 SkDLine fLine; member
/external/chromium_org/third_party/skia/src/pathops/
DSkDCubicLineIntersection.cpp86 , fLine(l) in LineCubicIntersections()
98 double adj = fLine[1].fX - fLine[0].fX; in intersectRay()
99 double opp = fLine[1].fY - fLine[0].fY; in intersectRay()
102 r[n].fX = (fCubic[n].fY - fLine[0].fY) * adj - (fCubic[n].fX - fLine[0].fX) * opp; in intersectRay()
209 double lineT = fLine.exactPoint(fCubic[cIndex]); in addExactEndPoints()
226 double lineT = fLine.nearPoint(fCubic[cIndex]); in addNearEndPoints()
288 double dx = fLine[1].fX - fLine[0].fX; in findLineT()
289 double dy = fLine[1].fY - fLine[0].fY; in findLineT()
291 return (xy.fX - fLine[0].fX) / dx; in findLineT()
293 return (xy.fY - fLine[0].fY) / dy; in findLineT()
[all …]
DSkDQuadLineIntersection.cpp99 , fLine(l) in LineQuadraticIntersections()
125 double adj = fLine[1].fX - fLine[0].fX; in intersectRay()
126 double opp = fLine[1].fY - fLine[0].fY; in intersectRay()
129 r[n] = (fQuad[n].fY - fLine[0].fY) * adj - (fQuad[n].fX - fLine[0].fX) * opp; in intersectRay()
227 double lineT = fLine.exactPoint(fQuad[qIndex]); in addExactEndPoints()
242 double lineT = fLine.nearPoint(fQuad[qIndex]); in addNearEndPoints()
305 double dx = fLine[1].fX - fLine[0].fX; in findLineT()
306 double dy = fLine[1].fY - fLine[0].fY; in findLineT()
308 return (xy.fX - fLine[0].fX) / dx; in findLineT()
310 return (xy.fY - fLine[0].fY) / dy; in findLineT()
[all …]
DSkReduceOrder.cpp10 fLine[0] = line[0]; in reduce()
12 fLine[1] = line[different]; in reduce()
268 *reducePts++ = reducer.fLine[index].asSkPoint(); in Quad()
DSkReduceOrder.h29 SkDLine fLine; member
/external/skia/tests/
DPathOpsCubicReduceOrderTest.cpp211 if (order == 2 && reducer.fLine[0] == reducer.fLine[1]) { in PathOpsReduceOrderCubicTest()
216 if ( (reducer.fLine[0].fX != cubic[0].fX && reducer.fLine[0].fX != cubic[3].fX) in PathOpsReduceOrderCubicTest()
217 || (reducer.fLine[0].fY != cubic[0].fY && reducer.fLine[0].fY != cubic[3].fY) in PathOpsReduceOrderCubicTest()
218 || (reducer.fLine[1].fX != cubic[0].fX && reducer.fLine[1].fX != cubic[3].fX) in PathOpsReduceOrderCubicTest()
219 || (reducer.fLine[1].fY != cubic[0].fY && reducer.fLine[1].fY != cubic[3].fY)) { in PathOpsReduceOrderCubicTest()
228 if ( (!AlmostEqualUlps(reducer.fLine[0].fX, bounds.fLeft) in PathOpsReduceOrderCubicTest()
229 && !AlmostEqualUlps(reducer.fLine[0].fX, bounds.fRight)) in PathOpsReduceOrderCubicTest()
230 || (!AlmostEqualUlps(reducer.fLine[0].fY, bounds.fTop) in PathOpsReduceOrderCubicTest()
231 && !AlmostEqualUlps(reducer.fLine[0].fY, bounds.fBottom)) in PathOpsReduceOrderCubicTest()
232 || (!AlmostEqualUlps(reducer.fLine[1].fX, bounds.fLeft) in PathOpsReduceOrderCubicTest()
[all …]
/external/icu4c/test/perf/howExpensiveIs/
DhowExpensiveIs.cpp147 …veTest(const char *name, const char *file, int32_t line) : fName(name), fFile(file), fLine(line) {} in HowExpensiveTest()
184 int32_t fLine; member in HowExpensiveTest
193 fprintf(stderr, "%s:%d:\t%s\n", t.fFile, t.fLine, t.getName()); in runTestOn()
197 fprintf(stderr, "%s:%d: Running: %s\n", t.fFile, t.fLine, t.getName()); in runTestOn()
262 int fLine; member in NumTest
290 fLine(LINE), in NumTest()
303 fFile,fLine,getName(),trial,fExpect); in warmup()
390 int fLine; member in NumFmtTest
418 fLine(LINE), in NumFmtTest()
436 fFile,fLine,getName(),strBuf,fCStr, u_errorName(setupStatus)); in warmup()
[all …]
/external/valgrind/main/coregrind/m_debuginfo/
Dreaddwarf3.c1401 Int fLine; /* declaring file line number, or zero */ member
1983 tv->fLine = lineNo; in parse_var_DIE()
4153 varp->fLine ); in new_dwarf3_reader_wrk()
4201 if (varAI->fLine > 0 && varp->fLine == 0) in new_dwarf3_reader_wrk()
4202 varp->fLine = varAI->fLine; in new_dwarf3_reader_wrk()
4292 varp->fName, varp->fLine, td3 in new_dwarf3_reader_wrk()