Lines Matching defs:u0
167 static bool recursive_edge_intersect(const Line& u, SkPoint u0, SkPoint u1,
170 // First check if the bounding boxes of [u0,u1] intersects [v0,v1]. If they do not, then the
174 if (std::min(u0.fX, u1.fX) > std::max(v0.fX, v1.fX) ||
175 std::max(u0.fX, u1.fX) < std::min(v0.fX, v1.fX) ||
176 std::min(u0.fY, u1.fY) > std::max(v0.fY, v1.fY) ||
177 std::max(u0.fY, u1.fY) < std::min(v0.fY, v1.fY)) {
189 double dx = static_cast<double>(v0.fX) - u0.fX;
190 double dy = static_cast<double>(v0.fY) - u0.fY;
204 const bool uNeedsSplit = edge_line_needs_recursion(u0, u1);
207 p->fX = double_to_clamped_scalar(u0.fX - (*s) * u.fB);
208 p->fY = double_to_clamped_scalar(u0.fY + (*s) * u.fA);
215 SkPoint uM = {(float) (0.5 * u0.fX + 0.5 * u1.fX),
216 (float) (0.5 * u0.fY + 0.5 * u1.fY)};
222 u0 = uM;
238 if (recursive_edge_intersect(Line(u0, u1), u0, u1, Line(v0, v1), v0, v1, p, s, t)) {