Lines Matching refs:pts
15 static void debugShowLineIntersection(int pts, const SkIntersectionHelper& wt, in debugShowLineIntersection() argument
17 SkASSERT(i.used() == pts); in debugShowLineIntersection()
18 if (!pts) { in debugShowLineIntersection()
20 __FUNCTION__, LINE_DEBUG_DATA(wt.pts()), LINE_DEBUG_DATA(wn.pts())); in debugShowLineIntersection()
24 i[0][0], LINE_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0)); in debugShowLineIntersection()
25 if (pts == 2) { in debugShowLineIntersection()
28 SkDebugf(" wnTs[0]=%g " LINE_DEBUG_STR, i[1][0], LINE_DEBUG_DATA(wn.pts())); in debugShowLineIntersection()
29 if (pts == 2) { in debugShowLineIntersection()
35 static void debugShowQuadLineIntersection(int pts, const SkIntersectionHelper& wt, in debugShowQuadLineIntersection() argument
38 SkASSERT(i.used() == pts); in debugShowQuadLineIntersection()
39 if (!pts) { in debugShowQuadLineIntersection()
41 __FUNCTION__, QUAD_DEBUG_DATA(wt.pts()), LINE_DEBUG_DATA(wn.pts())); in debugShowQuadLineIntersection()
45 i[0][0], QUAD_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0)); in debugShowQuadLineIntersection()
46 for (int n = 1; n < pts; ++n) { in debugShowQuadLineIntersection()
49 SkDebugf(" wnTs[0]=%g " LINE_DEBUG_STR, i[1][0], LINE_DEBUG_DATA(wn.pts())); in debugShowQuadLineIntersection()
50 for (int n = 1; n < pts; ++n) { in debugShowQuadLineIntersection()
56 static void debugShowQuadIntersection(int pts, const SkIntersectionHelper& wt, in debugShowQuadIntersection() argument
58 SkASSERT(i.used() == pts); in debugShowQuadIntersection()
59 if (!pts) { in debugShowQuadIntersection()
61 __FUNCTION__, QUAD_DEBUG_DATA(wt.pts()), QUAD_DEBUG_DATA(wn.pts())); in debugShowQuadIntersection()
65 i[0][0], QUAD_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0)); in debugShowQuadIntersection()
66 for (int n = 1; n < pts; ++n) { in debugShowQuadIntersection()
69 SkDebugf(" wnTs[0]=%g " QUAD_DEBUG_STR, i[1][0], QUAD_DEBUG_DATA(wn.pts())); in debugShowQuadIntersection()
70 for (int n = 1; n < pts; ++n) { in debugShowQuadIntersection()
76 static void debugShowConicLineIntersection(int pts, const SkIntersectionHelper& wt, in debugShowConicLineIntersection() argument
78 SkASSERT(i.used() == pts); in debugShowConicLineIntersection()
79 if (!pts) { in debugShowConicLineIntersection()
81 __FUNCTION__, CONIC_DEBUG_DATA(wt.pts(), wt.weight()), LINE_DEBUG_DATA(wn.pts())); in debugShowConicLineIntersection()
85 i[0][0], CONIC_DEBUG_DATA(wt.pts(), wt.weight()), PT_DEBUG_DATA(i, 0)); in debugShowConicLineIntersection()
86 for (int n = 1; n < pts; ++n) { in debugShowConicLineIntersection()
89 SkDebugf(" wnTs[0]=%g " LINE_DEBUG_STR, i[1][0], LINE_DEBUG_DATA(wn.pts())); in debugShowConicLineIntersection()
90 for (int n = 1; n < pts; ++n) { in debugShowConicLineIntersection()
96 static void debugShowConicQuadIntersection(int pts, const SkIntersectionHelper& wt, in debugShowConicQuadIntersection() argument
98 SkASSERT(i.used() == pts); in debugShowConicQuadIntersection()
99 if (!pts) { in debugShowConicQuadIntersection()
101 __FUNCTION__, CONIC_DEBUG_DATA(wt.pts(), wt.weight()), QUAD_DEBUG_DATA(wn.pts())); in debugShowConicQuadIntersection()
105 i[0][0], CONIC_DEBUG_DATA(wt.pts(), wt.weight()), PT_DEBUG_DATA(i, 0)); in debugShowConicQuadIntersection()
106 for (int n = 1; n < pts; ++n) { in debugShowConicQuadIntersection()
109 SkDebugf(" wnTs[0]=%g " QUAD_DEBUG_STR, i[1][0], QUAD_DEBUG_DATA(wn.pts())); in debugShowConicQuadIntersection()
110 for (int n = 1; n < pts; ++n) { in debugShowConicQuadIntersection()
116 static void debugShowConicIntersection(int pts, const SkIntersectionHelper& wt, in debugShowConicIntersection() argument
118 SkASSERT(i.used() == pts); in debugShowConicIntersection()
119 if (!pts) { in debugShowConicIntersection()
121 __FUNCTION__, CONIC_DEBUG_DATA(wt.pts(), wt.weight()), in debugShowConicIntersection()
122 CONIC_DEBUG_DATA(wn.pts(), wn.weight())); in debugShowConicIntersection()
126 i[0][0], CONIC_DEBUG_DATA(wt.pts(), wt.weight()), PT_DEBUG_DATA(i, 0)); in debugShowConicIntersection()
127 for (int n = 1; n < pts; ++n) { in debugShowConicIntersection()
130 SkDebugf(" wnTs[0]=%g " CONIC_DEBUG_STR, i[1][0], CONIC_DEBUG_DATA(wn.pts(), wn.weight())); in debugShowConicIntersection()
131 for (int n = 1; n < pts; ++n) { in debugShowConicIntersection()
137 static void debugShowCubicLineIntersection(int pts, const SkIntersectionHelper& wt, in debugShowCubicLineIntersection() argument
139 SkASSERT(i.used() == pts); in debugShowCubicLineIntersection()
140 if (!pts) { in debugShowCubicLineIntersection()
142 __FUNCTION__, CUBIC_DEBUG_DATA(wt.pts()), LINE_DEBUG_DATA(wn.pts())); in debugShowCubicLineIntersection()
146 i[0][0], CUBIC_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0)); in debugShowCubicLineIntersection()
147 for (int n = 1; n < pts; ++n) { in debugShowCubicLineIntersection()
150 SkDebugf(" wnTs[0]=%g " LINE_DEBUG_STR, i[1][0], LINE_DEBUG_DATA(wn.pts())); in debugShowCubicLineIntersection()
151 for (int n = 1; n < pts; ++n) { in debugShowCubicLineIntersection()
157 static void debugShowCubicQuadIntersection(int pts, const SkIntersectionHelper& wt, in debugShowCubicQuadIntersection() argument
159 SkASSERT(i.used() == pts); in debugShowCubicQuadIntersection()
160 if (!pts) { in debugShowCubicQuadIntersection()
162 __FUNCTION__, CUBIC_DEBUG_DATA(wt.pts()), QUAD_DEBUG_DATA(wn.pts())); in debugShowCubicQuadIntersection()
166 i[0][0], CUBIC_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0)); in debugShowCubicQuadIntersection()
167 for (int n = 1; n < pts; ++n) { in debugShowCubicQuadIntersection()
170 SkDebugf(" wnTs[0]=%g " QUAD_DEBUG_STR, i[1][0], QUAD_DEBUG_DATA(wn.pts())); in debugShowCubicQuadIntersection()
171 for (int n = 1; n < pts; ++n) { in debugShowCubicQuadIntersection()
177 static void debugShowCubicConicIntersection(int pts, const SkIntersectionHelper& wt, in debugShowCubicConicIntersection() argument
179 SkASSERT(i.used() == pts); in debugShowCubicConicIntersection()
180 if (!pts) { in debugShowCubicConicIntersection()
182 __FUNCTION__, CUBIC_DEBUG_DATA(wt.pts()), CONIC_DEBUG_DATA(wn.pts(), wn.weight())); in debugShowCubicConicIntersection()
186 i[0][0], CUBIC_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0)); in debugShowCubicConicIntersection()
187 for (int n = 1; n < pts; ++n) { in debugShowCubicConicIntersection()
190 SkDebugf(" wnTs[0]=%g " CONIC_DEBUG_STR, i[1][0], CONIC_DEBUG_DATA(wn.pts(), wn.weight())); in debugShowCubicConicIntersection()
191 for (int n = 1; n < pts; ++n) { in debugShowCubicConicIntersection()
197 static void debugShowCubicIntersection(int pts, const SkIntersectionHelper& wt, in debugShowCubicIntersection() argument
199 SkASSERT(i.used() == pts); in debugShowCubicIntersection()
200 if (!pts) { in debugShowCubicIntersection()
202 __FUNCTION__, CUBIC_DEBUG_DATA(wt.pts()), CUBIC_DEBUG_DATA(wn.pts())); in debugShowCubicIntersection()
206 i[0][0], CUBIC_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0)); in debugShowCubicIntersection()
207 for (int n = 1; n < pts; ++n) { in debugShowCubicIntersection()
210 SkDebugf(" wnTs[0]=%g " CUBIC_DEBUG_STR, i[1][0], CUBIC_DEBUG_DATA(wn.pts())); in debugShowCubicIntersection()
211 for (int n = 1; n < pts; ++n) { in debugShowCubicIntersection()
283 int pts = 0; in AddIntersectTs() local
296 pts = ts.lineHorizontal(wn.pts(), wt.left(), in AddIntersectTs()
298 debugShowLineIntersection(pts, wn, wt, ts); in AddIntersectTs()
301 pts = ts.quadHorizontal(wn.pts(), wt.left(), in AddIntersectTs()
303 debugShowQuadLineIntersection(pts, wn, wt, ts); in AddIntersectTs()
306 pts = ts.conicHorizontal(wn.pts(), wn.weight(), wt.left(), in AddIntersectTs()
308 debugShowConicLineIntersection(pts, wn, wt, ts); in AddIntersectTs()
311 pts = ts.cubicHorizontal(wn.pts(), wt.left(), in AddIntersectTs()
313 debugShowCubicLineIntersection(pts, wn, wt, ts); in AddIntersectTs()
325 pts = ts.lineVertical(wn.pts(), wt.top(), in AddIntersectTs()
327 debugShowLineIntersection(pts, wn, wt, ts); in AddIntersectTs()
331 pts = ts.quadVertical(wn.pts(), wt.top(), in AddIntersectTs()
333 debugShowQuadLineIntersection(pts, wn, wt, ts); in AddIntersectTs()
337 pts = ts.conicVertical(wn.pts(), wn.weight(), wt.top(), in AddIntersectTs()
339 debugShowConicLineIntersection(pts, wn, wt, ts); in AddIntersectTs()
343 pts = ts.cubicVertical(wn.pts(), wt.top(), in AddIntersectTs()
345 debugShowCubicLineIntersection(pts, wn, wt, ts); in AddIntersectTs()
355 pts = ts.lineHorizontal(wt.pts(), wn.left(), in AddIntersectTs()
357 debugShowLineIntersection(pts, wt, wn, ts); in AddIntersectTs()
360 pts = ts.lineVertical(wt.pts(), wn.top(), in AddIntersectTs()
362 debugShowLineIntersection(pts, wt, wn, ts); in AddIntersectTs()
365 pts = ts.lineLine(wt.pts(), wn.pts()); in AddIntersectTs()
366 debugShowLineIntersection(pts, wt, wn, ts); in AddIntersectTs()
370 pts = ts.quadLine(wn.pts(), wt.pts()); in AddIntersectTs()
371 debugShowQuadLineIntersection(pts, wn, wt, ts); in AddIntersectTs()
375 pts = ts.conicLine(wn.pts(), wn.weight(), wt.pts()); in AddIntersectTs()
376 debugShowConicLineIntersection(pts, wn, wt, ts); in AddIntersectTs()
380 pts = ts.cubicLine(wn.pts(), wt.pts()); in AddIntersectTs()
381 debugShowCubicLineIntersection(pts, wn, wt, ts); in AddIntersectTs()
390 pts = ts.quadHorizontal(wt.pts(), wn.left(), in AddIntersectTs()
392 debugShowQuadLineIntersection(pts, wt, wn, ts); in AddIntersectTs()
395 pts = ts.quadVertical(wt.pts(), wn.top(), in AddIntersectTs()
397 debugShowQuadLineIntersection(pts, wt, wn, ts); in AddIntersectTs()
400 pts = ts.quadLine(wt.pts(), wn.pts()); in AddIntersectTs()
401 debugShowQuadLineIntersection(pts, wt, wn, ts); in AddIntersectTs()
404 pts = ts.intersect(quad1.set(wt.pts()), quad2.set(wn.pts())); in AddIntersectTs()
405 debugShowQuadIntersection(pts, wt, wn, ts); in AddIntersectTs()
410 pts = ts.intersect(conic2.set(wn.pts(), wn.weight()), in AddIntersectTs()
411 quad1.set(wt.pts())); in AddIntersectTs()
412 debugShowConicQuadIntersection(pts, wn, wt, ts); in AddIntersectTs()
417 pts = ts.intersect(cubic2.set(wn.pts()), quad1.set(wt.pts())); in AddIntersectTs()
418 debugShowCubicQuadIntersection(pts, wn, wt, ts); in AddIntersectTs()
428 pts = ts.conicHorizontal(wt.pts(), wt.weight(), wn.left(), in AddIntersectTs()
430 debugShowConicLineIntersection(pts, wt, wn, ts); in AddIntersectTs()
433 pts = ts.conicVertical(wt.pts(), wt.weight(), wn.top(), in AddIntersectTs()
435 debugShowConicLineIntersection(pts, wt, wn, ts); in AddIntersectTs()
438 pts = ts.conicLine(wt.pts(), wt.weight(), wn.pts()); in AddIntersectTs()
439 debugShowConicLineIntersection(pts, wt, wn, ts); in AddIntersectTs()
442 pts = ts.intersect(conic1.set(wt.pts(), wt.weight()), in AddIntersectTs()
443 quad2.set(wn.pts())); in AddIntersectTs()
444 debugShowConicQuadIntersection(pts, wt, wn, ts); in AddIntersectTs()
448 pts = ts.intersect(conic1.set(wt.pts(), wt.weight()), in AddIntersectTs()
449 conic2.set(wn.pts(), wn.weight())); in AddIntersectTs()
450 debugShowConicIntersection(pts, wt, wn, ts); in AddIntersectTs()
455 pts = ts.intersect(cubic2.set(wn.pts() in AddIntersectTs()
457 conic1.set(wt.pts(), wt.weight() in AddIntersectTs()
459 debugShowCubicConicIntersection(pts, wn, wt, ts); in AddIntersectTs()
467 pts = ts.cubicHorizontal(wt.pts(), wn.left(), in AddIntersectTs()
469 debugShowCubicLineIntersection(pts, wt, wn, ts); in AddIntersectTs()
472 pts = ts.cubicVertical(wt.pts(), wn.top(), in AddIntersectTs()
474 debugShowCubicLineIntersection(pts, wt, wn, ts); in AddIntersectTs()
477 pts = ts.cubicLine(wt.pts(), wn.pts()); in AddIntersectTs()
478 debugShowCubicLineIntersection(pts, wt, wn, ts); in AddIntersectTs()
481 pts = ts.intersect(cubic1.set(wt.pts()), quad2.set(wn.pts())); in AddIntersectTs()
482 debugShowCubicQuadIntersection(pts, wt, wn, ts); in AddIntersectTs()
486 pts = ts.intersect(cubic1.set(wt.pts() in AddIntersectTs()
488 conic2.set(wn.pts(), wn.weight() in AddIntersectTs()
490 debugShowCubicConicIntersection(pts, wt, wn, ts); in AddIntersectTs()
494 pts = ts.intersect(cubic1.set(wt.pts()), cubic2.set(wn.pts())); in AddIntersectTs()
495 debugShowCubicIntersection(pts, wt, wn, ts); in AddIntersectTs()
510 for (int pt = 0; pt < pts; ++pt) { in AddIntersectTs()