/external/chromium_org/third_party/skia/src/pathops/ |
SkPathOpsLine.cpp | 9 SkDLine SkDLine::subDivide(double t1, double t2) const {
|
SkPathOpsQuad.cpp | 51 SkDQuad sub = subDivide(startT, endT); 218 SkDQuad SkDQuad::subDivide(double t1, double t2) const { 240 SkDPoint SkDQuad::subDivide(const SkDPoint& a, const SkDPoint& c, double t1, double t2) const { 250 SkDQuad sub = subDivide(t1, t2);
|
SkDQuadIntersection.cpp | 121 SkIntersections* i, bool* subDivide) { 133 if (subDivide) { 134 *subDivide = true; 150 double t2s, double t2e, SkIntersections* i, bool* subDivide) { 151 SkDQuad hull = q1.subDivide(t1s, t1e); 211 if (add_intercept(q1, q2, tMin, tMax, i, subDivide)) { 215 return is_linear_inner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide); 219 if (add_intercept(q1, q2, tMin, tsFound[split - 1], i, subDivide)) { 223 result = is_linear_inner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide); 225 if (add_intercept(q1, q2, tsFound[split], tMax, i, subDivide)) { [all...] |
SkPathOpsCubic.cpp | 297 SkDCubic sub = subDivide(startT, endT); 391 SkDCubic SkDCubic::subDivide(double t1, double t2) const { 430 void SkDCubic::subDivide(const SkDPoint& a, const SkDPoint& d, 448 SkDCubic sub = subDivide(t1, t2);
|
SkOpSegment.cpp | 340 subDivide(start, end, edge); [all...] |
/external/skia/src/pathops/ |
SkPathOpsLine.cpp | 9 SkDLine SkDLine::subDivide(double t1, double t2) const {
|
SkPathOpsQuad.cpp | 51 SkDQuad sub = subDivide(startT, endT); 218 SkDQuad SkDQuad::subDivide(double t1, double t2) const { 240 SkDPoint SkDQuad::subDivide(const SkDPoint& a, const SkDPoint& c, double t1, double t2) const { 250 SkDQuad sub = subDivide(t1, t2);
|
SkDQuadIntersection.cpp | 121 SkIntersections* i, bool* subDivide) { 133 if (subDivide) { 134 *subDivide = true; 150 double t2s, double t2e, SkIntersections* i, bool* subDivide) { 151 SkDQuad hull = q1.subDivide(t1s, t1e); 211 if (add_intercept(q1, q2, tMin, tMax, i, subDivide)) { 215 return is_linear_inner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide); 219 if (add_intercept(q1, q2, tMin, tsFound[split - 1], i, subDivide)) { 223 result = is_linear_inner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide); 225 if (add_intercept(q1, q2, tsFound[split], tMax, i, subDivide)) { [all...] |
SkPathOpsCubic.cpp | 297 SkDCubic sub = subDivide(startT, endT); 391 SkDCubic SkDCubic::subDivide(double t1, double t2) const { 430 void SkDCubic::subDivide(const SkDPoint& a, const SkDPoint& d, 448 SkDCubic sub = subDivide(t1, t2);
|
SkOpSegment.cpp | 340 subDivide(start, end, edge); [all...] |