| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| H A D | CubicIntersection.cpp | 78 static bool intersect3(const Cubic& cubic1, double t1s, double t1e, const Cubic& cubic2, argument
83 sub_divide(cubic1, t1s, t1e, c1);
94 const double t1 = t1s + (t1e - t1s) * tEnd1;
|
| H A D | QuadraticImplicit.cpp | 156 static bool isLinearInner(const Quadratic& q1, double t1s, double t1e, const Quadratic& q2, argument
159 sub_divide(q1, t1s, t1e, hull);
224 return isLinearInner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide);
232 result = isLinearInner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide);
238 result |= isLinearInner(q2, tsFound[split], tMax, q1, t1s, t1e, i, subDivide);
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| H A D | SkDCubicIntersection.cpp | 76 static void intersect(const SkDCubic& cubic1, double t1s, double t1e, const SkDCubic& cubic2, argument
79 SkDCubic c1 = cubic1.subDivide(t1s, t1e);
90 const double t1 = t1s + (t1e - t1s) * tEnd1;
|
| H A D | SkDQuadIntersection.cpp | 148 static bool is_linear_inner(const SkDQuad& q1, double t1s, double t1e, const SkDQuad& q2, argument
150 SkDQuad hull = q1.subDivide(t1s, t1e);
217 return is_linear_inner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide);
225 result = is_linear_inner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide);
231 result |= is_linear_inner(q2, tsFound[split], tMax, q1, t1s, t1e, i, subDivide);
|
| /external/skia/experimental/Intersection/ |
| H A D | CubicIntersection.cpp | 78 static bool intersect3(const Cubic& cubic1, double t1s, double t1e, const Cubic& cubic2, argument
83 sub_divide(cubic1, t1s, t1e, c1);
94 const double t1 = t1s + (t1e - t1s) * tEnd1;
|
| H A D | QuadraticImplicit.cpp | 156 static bool isLinearInner(const Quadratic& q1, double t1s, double t1e, const Quadratic& q2, argument
159 sub_divide(q1, t1s, t1e, hull);
224 return isLinearInner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide);
232 result = isLinearInner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide);
238 result |= isLinearInner(q2, tsFound[split], tMax, q1, t1s, t1e, i, subDivide);
|
| /external/skia/src/pathops/ |
| H A D | SkDCubicIntersection.cpp | 76 static void intersect(const SkDCubic& cubic1, double t1s, double t1e, const SkDCubic& cubic2, argument
79 SkDCubic c1 = cubic1.subDivide(t1s, t1e);
90 const double t1 = t1s + (t1e - t1s) * tEnd1;
|
| H A D | SkDQuadIntersection.cpp | 148 static bool is_linear_inner(const SkDQuad& q1, double t1s, double t1e, const SkDQuad& q2, argument
150 SkDQuad hull = q1.subDivide(t1s, t1e);
217 return is_linear_inner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide);
225 result = is_linear_inner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide);
231 result |= is_linear_inner(q2, tsFound[split], tMax, q1, t1s, t1e, i, subDivide);
|