Lines Matching refs:pts
12 static void debugShowLineIntersection(int pts, const SkIntersectionHelper& wt,
14 SkASSERT(i.used() == pts);
15 if (!pts) {
17 __FUNCTION__, LINE_DEBUG_DATA(wt.pts()), LINE_DEBUG_DATA(wn.pts()));
21 i[0][0], LINE_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0));
22 if (pts == 2) {
25 SkDebugf(" wnTs[0]=%g " LINE_DEBUG_STR, i[1][0], LINE_DEBUG_DATA(wn.pts()));
26 if (pts == 2) {
32 static void debugShowQuadLineIntersection(int pts, const SkIntersectionHelper& wt,
35 SkASSERT(i.used() == pts);
36 if (!pts) {
38 __FUNCTION__, QUAD_DEBUG_DATA(wt.pts()), LINE_DEBUG_DATA(wn.pts()));
42 i[0][0], QUAD_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0));
43 for (int n = 1; n < pts; ++n) {
46 SkDebugf(" wnTs[0]=%g " LINE_DEBUG_STR, i[1][0], LINE_DEBUG_DATA(wn.pts()));
47 for (int n = 1; n < pts; ++n) {
53 static void debugShowQuadIntersection(int pts, const SkIntersectionHelper& wt,
55 SkASSERT(i.used() == pts);
56 if (!pts) {
58 __FUNCTION__, QUAD_DEBUG_DATA(wt.pts()), QUAD_DEBUG_DATA(wn.pts()));
62 i[0][0], QUAD_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0));
63 for (int n = 1; n < pts; ++n) {
66 SkDebugf(" wnTs[0]=%g " QUAD_DEBUG_STR, i[1][0], QUAD_DEBUG_DATA(wn.pts()));
67 for (int n = 1; n < pts; ++n) {
73 static void debugShowCubicLineIntersection(int pts, const SkIntersectionHelper& wt,
75 SkASSERT(i.used() == pts);
76 if (!pts) {
78 __FUNCTION__, CUBIC_DEBUG_DATA(wt.pts()), LINE_DEBUG_DATA(wn.pts()));
82 i[0][0], CUBIC_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0));
83 for (int n = 1; n < pts; ++n) {
86 SkDebugf(" wnTs[0]=%g " LINE_DEBUG_STR, i[1][0], LINE_DEBUG_DATA(wn.pts()));
87 for (int n = 1; n < pts; ++n) {
93 static void debugShowCubicQuadIntersection(int pts, const SkIntersectionHelper& wt,
95 SkASSERT(i.used() == pts);
96 if (!pts) {
98 __FUNCTION__, CUBIC_DEBUG_DATA(wt.pts()), QUAD_DEBUG_DATA(wn.pts()));
102 i[0][0], CUBIC_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0));
103 for (int n = 1; n < pts; ++n) {
106 SkDebugf(" wnTs[0]=%g " QUAD_DEBUG_STR, i[1][0], QUAD_DEBUG_DATA(wn.pts()));
107 for (int n = 1; n < pts; ++n) {
113 static void debugShowCubicIntersection(int pts, const SkIntersectionHelper& wt,
115 SkASSERT(i.used() == pts);
116 if (!pts) {
118 __FUNCTION__, CUBIC_DEBUG_DATA(wt.pts()), CUBIC_DEBUG_DATA(wn.pts()));
122 i[0][0], CUBIC_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0));
123 for (int n = 1; n < pts; ++n) {
126 SkDebugf(" wnTs[0]=%g " CUBIC_DEBUG_STR, i[1][0], CUBIC_DEBUG_DATA(wn.pts()));
127 for (int n = 1; n < pts; ++n) {
133 static void debugShowCubicIntersection(int pts, const SkIntersectionHelper& wt,
135 SkASSERT(i.used() == pts);
136 if (!pts) {
138 CUBIC_DEBUG_DATA(wt.pts()));
142 i[0][0], CUBIC_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0));
200 int pts = 0;
210 pts = ts.lineHorizontal(wn.pts(), wt.left(),
212 debugShowLineIntersection(pts, wn, wt, ts);
216 pts = ts.quadHorizontal(wn.pts(), wt.left(),
218 debugShowQuadLineIntersection(pts, wn, wt, ts);
222 pts = ts.cubicHorizontal(wn.pts(), wt.left(),
224 debugShowCubicLineIntersection(pts, wn, wt, ts);
237 pts = ts.lineVertical(wn.pts(), wt.top(),
239 debugShowLineIntersection(pts, wn, wt, ts);
243 pts = ts.quadVertical(wn.pts(), wt.top(),
245 debugShowQuadLineIntersection(pts, wn, wt, ts);
249 pts = ts.cubicVertical(wn.pts(), wt.top(),
251 debugShowCubicLineIntersection(pts, wn, wt, ts);
261 pts = ts.lineHorizontal(wt.pts(), wn.left(),
263 debugShowLineIntersection(pts, wt, wn, ts);
266 pts = ts.lineVertical(wt.pts(), wn.top(),
268 debugShowLineIntersection(pts, wt, wn, ts);
271 pts = ts.lineLine(wt.pts(), wn.pts());
272 debugShowLineIntersection(pts, wt, wn, ts);
277 pts = ts.quadLine(wn.pts(), wt.pts());
278 debugShowQuadLineIntersection(pts, wn, wt, ts);
283 pts = ts.cubicLine(wn.pts(), wt.pts());
284 debugShowCubicLineIntersection(pts, wn, wt, ts);
294 pts = ts.quadHorizontal(wt.pts(), wn.left(),
296 debugShowQuadLineIntersection(pts, wt, wn, ts);
299 pts = ts.quadVertical(wt.pts(), wn.top(),
301 debugShowQuadLineIntersection(pts, wt, wn, ts);
304 pts = ts.quadLine(wt.pts(), wn.pts());
305 debugShowQuadLineIntersection(pts, wt, wn, ts);
309 pts = ts.quadQuad(wt.pts(), wn.pts());
310 debugShowQuadIntersection(pts, wt, wn, ts);
315 pts = ts.cubicQuad(wn.pts(), wt.pts());
316 debugShowCubicQuadIntersection(pts, wn, wt, ts);
326 pts = ts.cubicHorizontal(wt.pts(), wn.left(),
328 debugShowCubicLineIntersection(pts, wt, wn, ts);
331 pts = ts.cubicVertical(wt.pts(), wn.top(),
333 debugShowCubicLineIntersection(pts, wt, wn, ts);
336 pts = ts.cubicLine(wt.pts(), wn.pts());
337 debugShowCubicLineIntersection(pts, wt, wn, ts);
341 pts = ts.cubicQuad(wt.pts(), wn.pts());
342 debugShowCubicQuadIntersection(pts, wt, wn, ts);
346 pts = ts.cubicCubic(wt.pts(), wn.pts());
347 debugShowCubicIntersection(pts, wt, wn, ts);
357 if (!foundCommonContour && pts > 0) {
363 if (pts == 2) {
370 pts = 1;
379 pts = 1;
382 if (pts >= 2) {
383 for (int pt = 0; pt < pts - 1; ++pt) {
391 pts = 1;
396 for (int pt = 0; pt < pts; ++pt) {
419 int pts = ts.cubic(wt.pts());
420 debugShowCubicIntersection(pts, wt, ts);
421 if (!pts) {
424 SkASSERT(pts == 1);