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));
199 int pts = 0;
209 pts = ts.lineHorizontal(wn.pts(), wt.left(),
211 debugShowLineIntersection(pts, wn, wt, ts);
215 pts = ts.quadHorizontal(wn.pts(), wt.left(),
217 debugShowQuadLineIntersection(pts, wn, wt, ts);
221 pts = ts.cubicHorizontal(wn.pts(), wt.left(),
223 debugShowCubicLineIntersection(pts, wn, wt, ts);
236 pts = ts.lineVertical(wn.pts(), wt.top(),
238 debugShowLineIntersection(pts, wn, wt, ts);
242 pts = ts.quadVertical(wn.pts(), wt.top(),
244 debugShowQuadLineIntersection(pts, wn, wt, ts);
248 pts = ts.cubicVertical(wn.pts(), wt.top(),
250 debugShowCubicLineIntersection(pts, wn, wt, ts);
260 pts = ts.lineHorizontal(wt.pts(), wn.left(),
262 debugShowLineIntersection(pts, wt, wn, ts);
265 pts = ts.lineVertical(wt.pts(), wn.top(),
267 debugShowLineIntersection(pts, wt, wn, ts);
270 pts = ts.lineLine(wt.pts(), wn.pts());
271 debugShowLineIntersection(pts, wt, wn, ts);
276 pts = ts.quadLine(wn.pts(), wt.pts());
277 debugShowQuadLineIntersection(pts, wn, wt, ts);
282 pts = ts.cubicLine(wn.pts(), wt.pts());
283 debugShowCubicLineIntersection(pts, wn, wt, ts);
293 pts = ts.quadHorizontal(wt.pts(), wn.left(),
295 debugShowQuadLineIntersection(pts, wt, wn, ts);
298 pts = ts.quadVertical(wt.pts(), wn.top(),
300 debugShowQuadLineIntersection(pts, wt, wn, ts);
303 pts = ts.quadLine(wt.pts(), wn.pts());
304 debugShowQuadLineIntersection(pts, wt, wn, ts);
308 pts = ts.quadQuad(wt.pts(), wn.pts());
309 debugShowQuadIntersection(pts, wt, wn, ts);
314 pts = ts.cubicQuad(wn.pts(), wt.pts());
315 debugShowCubicQuadIntersection(pts, wn, wt, ts);
325 pts = ts.cubicHorizontal(wt.pts(), wn.left(),
327 debugShowCubicLineIntersection(pts, wt, wn, ts);
330 pts = ts.cubicVertical(wt.pts(), wn.top(),
332 debugShowCubicLineIntersection(pts, wt, wn, ts);
335 pts = ts.cubicLine(wt.pts(), wn.pts());
336 debugShowCubicLineIntersection(pts, wt, wn, ts);
340 pts = ts.cubicQuad(wt.pts(), wn.pts());
341 debugShowCubicQuadIntersection(pts, wt, wn, ts);
345 pts = ts.cubicCubic(wt.pts(), wn.pts());
346 debugShowCubicIntersection(pts, wt, wn, ts);
356 if (!foundCommonContour && pts > 0) {
362 if (pts == 2) {
376 for (int pt = 0; pt < pts; ++pt) {
398 int pts = ts.cubic(wt.pts());
399 debugShowCubicIntersection(pts, wt, ts);
400 if (!pts) {
403 SkASSERT(pts == 1);
