Lines Matching refs:cubic2
76 static void intersect(const SkDCubic& cubic1, double t1s, double t1e, const SkDCubic& cubic2,
80 SkDCubic c2 = cubic2.subDivide(t2s, t2e);
98 if (&cubic1 == &cubic2 && t1Start >= t2Start) {
103 int o2 = quadPart(cubic2, t2Start, t2, &s2);
125 SkDPoint p2 = cubic2.ptAtT(to2);
129 if (&cubic1 != &cubic2 || !approximately_equal(to1, to2)) {
168 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i);
210 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i);
236 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i);
242 // intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i);
287 bool SkIntersections::cubicExactEnd(const SkDCubic& cubic1, bool start, const SkDCubic& cubic2) {
294 tmpLine[0] = tmpLine[1] = cubic2[t1Index];
295 tmpLine[1].fX += cubic2[2 - start].fY - cubic2[t1Index].fY;
296 tmpLine[1].fY -= cubic2[2 - start].fX - cubic2[t1Index].fX;
306 cubicInsert(testT, impTs[0][index], tmpLine[0], cubic2, cubic1);
308 cubicInsert(impTs[0][index], testT, tmpLine[0], cubic1, cubic2);
317 const SkDCubic& cubic1, const SkDCubic& cubic2) {
324 SkDPoint mid = cubic2.ptAtT((oldTwo + two) / 2);
339 void SkIntersections::cubicNearEnd(const SkDCubic& cubic1, bool start, const SkDCubic& cubic2,
363 if (!local.intersect(cubic2, line)) {
399 ::intersect(cubic1, tMin1, tMax1, cubic2, tMin2, tMax2, 1, *this);
405 ::intersect(cubic1, tMin1, tMax1, cubic2, tMin2, tMax2, 1, *this);