Searched refs:cubic1 (Results 1 - 5 of 5) sorted by relevance
/external/skia/tests/ |
H A D | PathOpsCubicIntersectionTest.cpp | 19 const SkDCubic& cubic1 = tests[index][0]; local 22 int order1 = reduce1.reduce(cubic1, SkReduceOrder::kNo_Quadratics); 27 SkDebugf("%s [%d] cubic1 order=%d\n", __FUNCTION__, iIndex, order1); 38 tIntersections.intersect(cubic1, cubic2); 53 SkDPoint xy1 = cubic1.ptAtT(tt1); 307 static void oneOff(skiatest::Reporter* reporter, const SkDCubic& cubic1, const SkDCubic& cubic2, argument 309 SkASSERT(ValidCubic(cubic1)); 314 cubic1[0].fX, cubic1[0].fY, cubic1[ 364 const SkDCubic& cubic1 = testSet[outer]; local 370 const SkDCubic& cubic1 = newTestSet[outer]; local 397 SkDCubic cubic1, cubic2; local 445 const SkDCubic& cubic1 = newTestSet[index0]; local 609 const SkDCubic& cubic1 = coinSet[index]; local [all...] |
/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); 92 int o1 = quadPart(cubic1, t1Start, t1, &s1); 98 if (&cubic1 == &cubic2 && t1Start >= t2Start) { 124 SkDPoint p1 = cubic1.ptAtT(to1); 129 if (&cubic1 != &cubic2 || !approximately_equal(to1, to2)) { 165 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i); 207 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i); 233 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i); 239 // intersect(cubic1, c1Mi [all...] |
H A D | SkIntersections.h | 265 bool cubicExactEnd(const SkDCubic& cubic1, bool start, const SkDCubic& cubic2); 266 void cubicNearEnd(const SkDCubic& cubic1, bool start, const SkDCubic& cubic2, const SkDRect& );
|
/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); 92 int o1 = quadPart(cubic1, t1Start, t1, &s1); 98 if (&cubic1 == &cubic2 && t1Start >= t2Start) { 124 SkDPoint p1 = cubic1.ptAtT(to1); 129 if (&cubic1 != &cubic2 || !approximately_equal(to1, to2)) { 165 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i); 207 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i); 233 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i); 239 // intersect(cubic1, c1Mi [all...] |
H A D | SkIntersections.h | 265 bool cubicExactEnd(const SkDCubic& cubic1, bool start, const SkDCubic& cubic2); 266 void cubicNearEnd(const SkDCubic& cubic1, bool start, const SkDCubic& cubic2, const SkDRect& );
|
Completed in 671 milliseconds