/external/chromium_org/third_party/skia/src/pathops/ |
SkDQuadIntersection.cpp | 149 static bool is_linear_inner(const SkDQuad& q1, double t1s, double t1e, const SkDQuad& q2, function 215 return is_linear_inner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide); 223 result = is_linear_inner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide); 229 result |= is_linear_inner(q2, tsFound[split], tMax, q1, t1s, t1e, i, subDivide); 248 return is_linear_inner(q1, 0, 1, q2, 0, 1, i, NULL); 278 is_linear_inner(*flatter, sf, ef, *rounder, sr, er, i, &subDivide);
|
/external/skia/src/pathops/ |
SkDQuadIntersection.cpp | 149 static bool is_linear_inner(const SkDQuad& q1, double t1s, double t1e, const SkDQuad& q2, function 215 return is_linear_inner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide); 223 result = is_linear_inner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide); 229 result |= is_linear_inner(q2, tsFound[split], tMax, q1, t1s, t1e, i, subDivide); 248 return is_linear_inner(q1, 0, 1, q2, 0, 1, i, NULL); 278 is_linear_inner(*flatter, sf, ef, *rounder, sr, er, i, &subDivide);
|