| /external/chromium_org/third_party/skia/src/pathops/ |
| H A D | SkPathOpsLine.cpp | 9 SkDLine SkDLine::subDivide(double t1, double t2) const { function in class:SkDLine
|
| H A D | SkPathOpsQuad.cpp | 51 SkDQuad sub = subDivide(startT, endT);
218 SkDQuad SkDQuad::subDivide(double t1, double t2) const { function in class:SkDQuad
240 SkDPoint SkDQuad::subDivide(const SkDPoint& a, const SkDPoint& c, double t1, double t2) const { function in class:SkDQuad
250 SkDQuad sub = subDivide(t1, t2);
|
| H A D | SkDQuadIntersection.cpp | 120 SkIntersections* i, bool* subDivide) {
132 if (subDivide) {
133 *subDivide = true;
149 double t2s, double t2e, SkIntersections* i, bool* subDivide) {
150 SkDQuad hull = q1.subDivide(t1s, t1e);
213 if (add_intercept(q1, q2, tMin, tMax, i, subDivide)) {
217 return is_linear_inner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide);
221 if (add_intercept(q1, q2, tMin, tsFound[split - 1], i, subDivide)) {
225 result = is_linear_inner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide);
227 if (add_intercept(q1, q2, tsFound[split], tMax, i, subDivide)) {
119 add_intercept(const SkDQuad& q1, const SkDQuad& q2, double tMin, double tMax, SkIntersections* i, bool* subDivide) argument
148 is_linear_inner(const SkDQuad& q1, double t1s, double t1e, const SkDQuad& q2, double t2s, double t2e, SkIntersections* i, bool* subDivide) argument
279 bool subDivide = false; local
[all...] |
| H A D | SkPathOpsCubic.cpp | 372 SkDCubic sub = subDivide(startT, endT);
466 SkDCubic SkDCubic::subDivide(double t1, double t2) const { function in class:SkDCubic
505 void SkDCubic::subDivide(const SkDPoint& a, const SkDPoint& d, function in class:SkDCubic
523 SkDCubic sub = subDivide(t1, t2);
|
| /external/skia/src/pathops/ |
| H A D | SkPathOpsLine.cpp | 9 SkDLine SkDLine::subDivide(double t1, double t2) const { function in class:SkDLine
|
| H A D | SkPathOpsQuad.cpp | 51 SkDQuad sub = subDivide(startT, endT);
218 SkDQuad SkDQuad::subDivide(double t1, double t2) const { function in class:SkDQuad
240 SkDPoint SkDQuad::subDivide(const SkDPoint& a, const SkDPoint& c, double t1, double t2) const { function in class:SkDQuad
250 SkDQuad sub = subDivide(t1, t2);
|
| H A D | SkDQuadIntersection.cpp | 120 SkIntersections* i, bool* subDivide) {
132 if (subDivide) {
133 *subDivide = true;
149 double t2s, double t2e, SkIntersections* i, bool* subDivide) {
150 SkDQuad hull = q1.subDivide(t1s, t1e);
213 if (add_intercept(q1, q2, tMin, tMax, i, subDivide)) {
217 return is_linear_inner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide);
221 if (add_intercept(q1, q2, tMin, tsFound[split - 1], i, subDivide)) {
225 result = is_linear_inner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide);
227 if (add_intercept(q1, q2, tsFound[split], tMax, i, subDivide)) {
119 add_intercept(const SkDQuad& q1, const SkDQuad& q2, double tMin, double tMax, SkIntersections* i, bool* subDivide) argument
148 is_linear_inner(const SkDQuad& q1, double t1s, double t1e, const SkDQuad& q2, double t2s, double t2e, SkIntersections* i, bool* subDivide) argument
279 bool subDivide = false; local
[all...] |
| H A D | SkPathOpsCubic.cpp | 372 SkDCubic sub = subDivide(startT, endT);
466 SkDCubic SkDCubic::subDivide(double t1, double t2) const { function in class:SkDCubic
505 void SkDCubic::subDivide(const SkDPoint& a, const SkDPoint& d, function in class:SkDCubic
523 SkDCubic sub = subDivide(t1, t2);
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| H A D | QuadraticImplicit.cpp | 127 Intersections& i, bool* subDivide) {
139 if (subDivide) {
140 *subDivide = true;
157 double t2s, double t2e, Intersections& i, bool* subDivide) {
220 if (addIntercept(q1, q2, tMin, tMax, i, subDivide)) {
224 return isLinearInner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide);
228 if (addIntercept(q1, q2, tMin, tsFound[split - 1], i, subDivide)) {
232 result = isLinearInner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide);
234 if (addIntercept(q1, q2, tsFound[split], tMax, i, subDivide)) {
238 result |= isLinearInner(q2, tsFound[split], tMax, q1, t1s, t1e, i, subDivide);
126 addIntercept(const Quadratic& q1, const Quadratic& q2, double tMin, double tMax, Intersections& i, bool* subDivide) argument
156 isLinearInner(const Quadratic& q1, double t1s, double t1e, const Quadratic& q2, double t2s, double t2e, Intersections& i, bool* subDivide) argument
[all...] |
| /external/skia/experimental/Intersection/ |
| H A D | QuadraticImplicit.cpp | 127 Intersections& i, bool* subDivide) {
139 if (subDivide) {
140 *subDivide = true;
157 double t2s, double t2e, Intersections& i, bool* subDivide) {
220 if (addIntercept(q1, q2, tMin, tMax, i, subDivide)) {
224 return isLinearInner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide);
228 if (addIntercept(q1, q2, tMin, tsFound[split - 1], i, subDivide)) {
232 result = isLinearInner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide);
234 if (addIntercept(q1, q2, tsFound[split], tMax, i, subDivide)) {
238 result |= isLinearInner(q2, tsFound[split], tMax, q1, t1s, t1e, i, subDivide);
126 addIntercept(const Quadratic& q1, const Quadratic& q2, double tMin, double tMax, Intersections& i, bool* subDivide) argument
156 isLinearInner(const Quadratic& q1, double t1s, double t1e, const Quadratic& q2, double t2s, double t2e, Intersections& i, bool* subDivide) argument
[all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| H A D | SkStroke.cpp | 115 int subDivide);
119 int subDivide);
249 int subDivide) {
259 if (--subDivide >= 0 && normals_too_curvy(unitNormalAB, *unitNormalBC)) {
264 this->quad_to(&tmp[0], normalAB, unitNormalAB, &norm, &unit, subDivide);
265 this->quad_to(&tmp[2], norm, unit, normalBC, unitNormalBC, subDivide);
285 int subDivide) {
316 if (--subDivide < 0) {
324 if (--subDivide < 0) {
333 subDivide);
246 quad_to(const SkPoint pts[3], const SkVector& normalAB, const SkVector& unitNormalAB, SkVector* normalBC, SkVector* unitNormalBC, int subDivide) argument
282 cubic_to(const SkPoint pts[4], const SkVector& normalAB, const SkVector& unitNormalAB, SkVector* normalCD, SkVector* unitNormalCD, int subDivide) argument
[all...] |
| /external/skia/src/core/ |
| H A D | SkStroke.cpp | 115 int subDivide);
119 int subDivide);
249 int subDivide) {
259 if (--subDivide >= 0 && normals_too_curvy(unitNormalAB, *unitNormalBC)) {
264 this->quad_to(&tmp[0], normalAB, unitNormalAB, &norm, &unit, subDivide);
265 this->quad_to(&tmp[2], norm, unit, normalBC, unitNormalBC, subDivide);
285 int subDivide) {
316 if (--subDivide < 0) {
324 if (--subDivide < 0) {
333 subDivide);
246 quad_to(const SkPoint pts[3], const SkVector& normalAB, const SkVector& unitNormalAB, SkVector* normalBC, SkVector* unitNormalBC, int subDivide) argument
282 cubic_to(const SkPoint pts[4], const SkVector& normalAB, const SkVector& unitNormalAB, SkVector* normalCD, SkVector* unitNormalCD, int subDivide) argument
[all...] |