Lines Matching defs:line
73 // that the output points stored in 'line' are outside the tile grid (thus effectively infinite).
74 static void clipping_line_segment(const SkPoint& p0, const SkPoint& p1, SkPoint line[2]) {
78 line[0] = p0 - v * 10.f;
79 line[1] = p1 + v * 10.f;
82 // Returns true if line segment (p0-p1) intersects with line segment (l0-l1); if true is returned,
106 // Up to now, the line segments do not form an invalid intersection
134 // Draw a line through the two points, outset by a fixed length in screen space
170 // Clip the "infinite" line segments to a rectangular region outside the tile grid
174 SkPoint line[2];
176 clipping_line_segment(kClipP1, kClipP2, line);
177 SkAssertResult(SkLineClipper::IntersectLine(line, border, clippedLine));
181 clipping_line_segment(kClipP2, kClipP3, line);
182 SkAssertResult(SkLineClipper::IntersectLine(line, border, clippedLine));
186 clipping_line_segment(kClipP3, kClipP1, line);
187 SkAssertResult(SkLineClipper::IntersectLine(line, border, clippedLine));
289 // Consider the first line against the 4 quad edges in tile, which should have 0,1, or 2
297 // If the intersected point is the same as the last found intersection, the line
315 // Either the first line never intersected the quad (count == 0), or it intersected at a
316 // single vertex without going through quad area (count == 1), so check next line
408 // Split the sub quad with the next line
431 // (kColCount*kTileWidth, kRowCount*kTileHeight), although it has additional line