Lines Matching full:line
16 SkDLine line;
30 const SkDLine& line = failLineCubicTests[iIndex].line;
31 SkASSERT(ValidLine(line));
35 int order2 = reduce2.reduce(line);
41 SkDebugf("[%d] line order=%d\n", iIndex, order2);
46 int roots = i.intersect(cubic, line);
93 static int doIntersect(SkIntersections& intersections, const SkDCubic& cubic, const SkDLine& line) {
96 if (line[0].fX == line[1].fX) {
97 double top = line[0].fY;
98 double bottom = line[1].fY;
103 result = intersections.vertical(cubic, top, bottom, line[0].fX, flipped);
104 } else if (line[0].fY == line[1].fY) {
105 double left = line[0].fX;
106 double right = line[1].fX;
111 result = intersections.horizontal(cubic, left, right, line[0].fY, flipped);
113 intersections.intersect(cubic, line);
122 const SkDLine& line = lineCubicTests[iIndex].line;
123 SkASSERT(ValidLine(line));
127 int order2 = reduce2.reduce(line);
133 SkDebugf("[%d] line order=%d\n", iIndex, order2);
138 int roots = doIntersect(i, cubic, line);
143 SkDPoint xy2 = line.ptAtT(tt2);
154 double left[3] = { line.isLeft(prev), line.isLeft(sect), line.isLeft(cubic[3]) };
158 SkDPoint prevL = line.ptAtT(i[1][0] - 0.0000007);
160 SkDPoint nextL = line.ptAtT(i[1][0] + 0.0000007);
188 const SkDLine& line = lineCubicTests[iIndex].line;
190 i.intersect(cubic, line);
