1 /*
2 * Copyright 2013 Google Inc.
3 *
4 * Use of this source code is governed by a BSD-style license that can be
5 * found in the LICENSE file.
6 */
7 #include "PathOpsTestCommon.h"
8 #include "SkIntersections.h"
9 #include "SkOpContour.h"
10 #include "SkOpSegment.h"
11 #include "SkRandom.h"
12 #include "SkTSort.h"
13 #include "Test.h"
14
15 static bool gDisableAngleTests = true;
16
next(float f)17 static float next(float f)
18 {
19 int fBits = SkFloatAs2sCompliment(f);
20 ++fBits;
21 float fNext = Sk2sComplimentAsFloat(fBits);
22 return fNext;
23 }
24
prev(float f)25 static float prev(float f)
26 {
27 int fBits = SkFloatAs2sCompliment(f);
28 --fBits;
29 float fNext = Sk2sComplimentAsFloat(fBits);
30 return fNext;
31 }
32
DEF_TEST(PathOpsAngleFindCrossEpsilon,reporter)33 DEF_TEST(PathOpsAngleFindCrossEpsilon, reporter) {
34 if (gDisableAngleTests) {
35 return;
36 }
37 SkRandom ran;
38 int maxEpsilon = 0;
39 for (int index = 0; index < 10000000; ++index) {
40 SkDLine line = {{{0, 0}, {ran.nextRangeF(0.0001f, 1000), ran.nextRangeF(0.0001f, 1000)}}};
41 for (int inner = 0; inner < 10; ++inner) {
42 float t = ran.nextRangeF(0.0001f, 1);
43 SkDPoint dPt = line.ptAtT(t);
44 SkPoint pt = dPt.asSkPoint();
45 float xs[3] = { prev(pt.fX), pt.fX, next(pt.fX) };
46 float ys[3] = { prev(pt.fY), pt.fY, next(pt.fY) };
47 for (int xIdx = 0; xIdx < 3; ++xIdx) {
48 for (int yIdx = 0; yIdx < 3; ++yIdx) {
49 SkPoint test = { xs[xIdx], ys[yIdx] };
50 float p1 = SkDoubleToScalar(line[1].fX * test.fY);
51 float p2 = SkDoubleToScalar(line[1].fY * test.fX);
52 int p1Bits = SkFloatAs2sCompliment(p1);
53 int p2Bits = SkFloatAs2sCompliment(p2);
54 int epsilon = SkTAbs(p1Bits - p2Bits);
55 if (maxEpsilon < epsilon) {
56 SkDebugf("line={{0, 0}, {%1.7g, %1.7g}} t=%1.7g pt={%1.7g, %1.7g}"
57 " epsilon=%d\n",
58 line[1].fX, line[1].fY, t, test.fX, test.fY, epsilon);
59 maxEpsilon = epsilon;
60 }
61 }
62 }
63 }
64 }
65 }
66
DEF_TEST(PathOpsAngleFindQuadEpsilon,reporter)67 DEF_TEST(PathOpsAngleFindQuadEpsilon, reporter) {
68 if (gDisableAngleTests) {
69 return;
70 }
71 SkRandom ran;
72 int maxEpsilon = 0;
73 double maxAngle = 0;
74 for (int index = 0; index < 100000; ++index) {
75 SkDLine line = {{{0, 0}, {ran.nextRangeF(0.0001f, 1000), ran.nextRangeF(0.0001f, 1000)}}};
76 float t = ran.nextRangeF(0.0001f, 1);
77 SkDPoint dPt = line.ptAtT(t);
78 float t2 = ran.nextRangeF(0.0001f, 1);
79 SkDPoint qPt = line.ptAtT(t2);
80 float t3 = ran.nextRangeF(0.0001f, 1);
81 SkDPoint qPt2 = line.ptAtT(t3);
82 qPt.fX += qPt2.fY;
83 qPt.fY -= qPt2.fX;
84 QuadPts q = {{line[0], dPt, qPt}};
85 SkDQuad quad;
86 quad.debugSet(q.fPts);
87 // binary search for maximum movement of quad[1] towards test that still has 1 intersection
88 double moveT = 0.5f;
89 double deltaT = moveT / 2;
90 SkDPoint last;
91 do {
92 last = quad[1];
93 quad[1].fX = dPt.fX - line[1].fY * moveT;
94 quad[1].fY = dPt.fY + line[1].fX * moveT;
95 SkIntersections i;
96 i.intersect(quad, line);
97 REPORTER_ASSERT(reporter, i.used() > 0);
98 if (i.used() == 1) {
99 moveT += deltaT;
100 } else {
101 moveT -= deltaT;
102 }
103 deltaT /= 2;
104 } while (last.asSkPoint() != quad[1].asSkPoint());
105 float p1 = SkDoubleToScalar(line[1].fX * last.fY);
106 float p2 = SkDoubleToScalar(line[1].fY * last.fX);
107 int p1Bits = SkFloatAs2sCompliment(p1);
108 int p2Bits = SkFloatAs2sCompliment(p2);
109 int epsilon = SkTAbs(p1Bits - p2Bits);
110 if (maxEpsilon < epsilon) {
111 SkDebugf("line={{0, 0}, {%1.7g, %1.7g}} t=%1.7g/%1.7g/%1.7g moveT=%1.7g"
112 " pt={%1.7g, %1.7g} epsilon=%d\n",
113 line[1].fX, line[1].fY, t, t2, t3, moveT, last.fX, last.fY, epsilon);
114 maxEpsilon = epsilon;
115 }
116 double a1 = atan2(line[1].fY, line[1].fX);
117 double a2 = atan2(last.fY, last.fX);
118 double angle = fabs(a1 - a2);
119 if (maxAngle < angle) {
120 SkDebugf("line={{0, 0}, {%1.7g, %1.7g}} t=%1.7g/%1.7g/%1.7g moveT=%1.7g"
121 " pt={%1.7g, %1.7g} angle=%1.7g\n",
122 line[1].fX, line[1].fY, t, t2, t3, moveT, last.fX, last.fY, angle);
123 maxAngle = angle;
124 }
125 }
126 }
127
find_slop(double x,double y,double rx,double ry)128 static int find_slop(double x, double y, double rx, double ry) {
129 int slopBits = 0;
130 bool less1, less2;
131 double absX = fabs(x);
132 double absY = fabs(y);
133 double length = absX < absY ? absX / 2 + absY : absX + absY / 2;
134 int exponent;
135 (void) frexp(length, &exponent);
136 double epsilon = ldexp(FLT_EPSILON, exponent);
137 do {
138 // get the length as the larger plus half the smaller (both same signs)
139 // find the ulps of the length
140 // compute the offsets from there
141 double xSlop = epsilon * slopBits;
142 double ySlop = x * y < 0 ? -xSlop : xSlop; // OPTIMIZATION: use copysign / _copysign ?
143 double x1 = x - xSlop;
144 double y1 = y + ySlop;
145 double x_ry1 = x1 * ry;
146 double rx_y1 = rx * y1;
147 less1 = x_ry1 < rx_y1;
148 double x2 = x + xSlop;
149 double y2 = y - ySlop;
150 double x_ry2 = x2 * ry;
151 double rx_y2 = rx * y2;
152 less2 = x_ry2 < rx_y2;
153 } while (less1 == less2 && ++slopBits);
154 return slopBits;
155 }
156
157 // from http://stackoverflow.com/questions/1427422/cheap-algorithm-to-find-measure-of-angle-between-vectors
diamond_angle(double y,double x)158 static double diamond_angle(double y, double x)
159 {
160 if (y >= 0)
161 return (x >= 0 ? y/(x+y) : 1-x/(-x+y));
162 else
163 return (x < 0 ? 2-y/(-x-y) : 3+x/(x-y));
164 }
165
166 static const double slopTests[][4] = {
167 // x y rx ry
168 {-0.058554756452593892, -0.18804585843827226, -0.018568569646021160, -0.059615294434479438},
169 {-0.0013717412948608398, 0.0041152238845825195, -0.00045837944195925573, 0.0013753175735478074},
170 {-2.1033774145221198, -1.4046019261273715e-008, -0.70062688352066704, -1.2706324683777995e-008},
171 };
172
DEF_TEST(PathOpsAngleFindSlop,reporter)173 DEF_TEST(PathOpsAngleFindSlop, reporter) {
174 if (gDisableAngleTests) {
175 return;
176 }
177 for (int index = 0; index < (int) SK_ARRAY_COUNT(slopTests); ++index) {
178 const double* slopTest = slopTests[index];
179 double x = slopTest[0];
180 double y = slopTest[1];
181 double rx = slopTest[2];
182 double ry = slopTest[3];
183 SkDebugf("%s xy %d=%d\n", __FUNCTION__, index, find_slop(x, y, rx, ry));
184 SkDebugf("%s rxy %d=%d\n", __FUNCTION__, index, find_slop(rx, ry, x, y));
185 double angle = diamond_angle(y, x);
186 double rAngle = diamond_angle(ry, rx);
187 double diff = fabs(angle - rAngle);
188 SkDebugf("%s diamond xy=%1.9g rxy=%1.9g diff=%1.9g factor=%d\n", __FUNCTION__,
189 angle, rAngle, diff, (int) (diff / FLT_EPSILON));
190 }
191 }
192
193 class PathOpsAngleTester {
194 public:
After(SkOpAngle & lh,SkOpAngle & rh)195 static int After(SkOpAngle& lh, SkOpAngle& rh) {
196 return lh.after(&rh);
197 }
198
AllOnOneSide(SkOpAngle & lh,SkOpAngle & rh)199 static int AllOnOneSide(SkOpAngle& lh, SkOpAngle& rh) {
200 return lh.allOnOneSide(&rh);
201 }
202
ConvexHullOverlaps(SkOpAngle & lh,SkOpAngle & rh)203 static int ConvexHullOverlaps(SkOpAngle& lh, SkOpAngle& rh) {
204 return lh.convexHullOverlaps(&rh);
205 }
206
Orderable(SkOpAngle & lh,SkOpAngle & rh)207 static int Orderable(SkOpAngle& lh, SkOpAngle& rh) {
208 return lh.orderable(&rh);
209 }
210
EndsIntersect(SkOpAngle & lh,SkOpAngle & rh)211 static int EndsIntersect(SkOpAngle& lh, SkOpAngle& rh) {
212 return lh.endsIntersect(&rh);
213 }
214
SetNext(SkOpAngle & lh,SkOpAngle & rh)215 static void SetNext(SkOpAngle& lh, SkOpAngle& rh) {
216 lh.fNext = &rh;
217 }
218 };
219
220 class PathOpsSegmentTester {
221 public:
DebugReset(SkOpSegment * segment)222 static void DebugReset(SkOpSegment* segment) {
223 segment->debugReset();
224 }
225 };
226
227 struct CircleData {
228 const CubicPts fPts;
229 const int fPtCount;
230 SkPoint fShortPts[4];
231 };
232
233 static CircleData circleDataSet[] = {
234 { {{{313.0155029296875, 207.90290832519531}, {320.05078125, 227.58743286132812}}}, 2, {} },
235 { {{{313.0155029296875, 207.90290832519531}, {313.98246891063195, 219.33615203830394},
236 {320.05078125, 227.58743286132812}}}, 3, {} },
237 };
238
239 static const int circleDataSetSize = (int) SK_ARRAY_COUNT(circleDataSet);
240
DEF_TEST(PathOpsAngleCircle,reporter)241 DEF_TEST(PathOpsAngleCircle, reporter) {
242 SkSTArenaAlloc<4096> allocator;
243 SkOpContourHead contour;
244 SkOpGlobalState state(&contour, &allocator SkDEBUGPARAMS(false) SkDEBUGPARAMS(nullptr));
245 contour.init(&state, false, false);
246 for (int index = 0; index < circleDataSetSize; ++index) {
247 CircleData& data = circleDataSet[index];
248 for (int idx2 = 0; idx2 < data.fPtCount; ++idx2) {
249 data.fShortPts[idx2] = data.fPts.fPts[idx2].asSkPoint();
250 }
251 switch (data.fPtCount) {
252 case 2:
253 contour.addLine(data.fShortPts);
254 break;
255 case 3:
256 contour.addQuad(data.fShortPts);
257 break;
258 case 4:
259 contour.addCubic(data.fShortPts);
260 break;
261 }
262 }
263 SkOpSegment* first = contour.first();
264 first->debugAddAngle(0, 1);
265 SkOpSegment* next = first->next();
266 next->debugAddAngle(0, 1);
267 PathOpsAngleTester::Orderable(*first->debugLastAngle(), *next->debugLastAngle());
268 }
269
270 struct IntersectData {
271 const CubicPts fPts;
272 const int fPtCount;
273 double fTStart;
274 double fTEnd;
275 SkPoint fShortPts[4];
276 };
277
278 static IntersectData intersectDataSet1[] = {
279 { {{{322.935669,231.030273}, {312.832214,220.393295}, {312.832214,203.454178}}}, 3,
280 0.865309956, 0.154740299, {} },
281 { {{{322.12738,233.397751}, {295.718353,159.505829}}}, 2,
282 0.345028807, 0.0786326511, {} },
283 { {{{322.935669,231.030273}, {312.832214,220.393295}, {312.832214,203.454178}}}, 3,
284 0.865309956, 1, {} },
285 { {{{322.12738,233.397751}, {295.718353,159.505829}}}, 2,
286 0.345028807, 1, {} },
287 };
288
289 static IntersectData intersectDataSet2[] = {
290 { {{{364.390686,157.898193}, {375.281769,136.674606}, {396.039917,136.674606}}}, 3,
291 0.578520747, 1, {} },
292 { {{{364.390686,157.898193}, {375.281769,136.674606}, {396.039917,136.674606}}}, 3,
293 0.578520747, 0.536512973, {} },
294 { {{{366.608826,151.196014}, {378.803101,136.674606}, {398.164948,136.674606}}}, 3,
295 0.490456543, 1, {} },
296 };
297
298 static IntersectData intersectDataSet3[] = {
299 { {{{2.000000,0.000000}, {1.33333333,0.66666667}}}, 2, 1, 0, {} },
300 { {{{1.33333333,0.66666667}, {0.000000,2.000000}}}, 2, 0, 0.25, {} },
301 { {{{2.000000,2.000000}, {1.33333333,0.66666667}}}, 2, 1, 0, {} },
302 };
303
304 static IntersectData intersectDataSet4[] = {
305 { {{{1.3333333,0.6666667}, {0.000,2.000}}}, 2, 0.250000006, 0, {} },
306 { {{{1.000,0.000}, {1.000,1.000}}}, 2, 1, 0, {} },
307 { {{{1.000,1.000}, {0.000,0.000}}}, 2, 0, 1, {} },
308 };
309
310 static IntersectData intersectDataSet5[] = {
311 { {{{0.000,0.000}, {1.000,0.000}, {1.000,1.000}}}, 3, 1, 0.666666667, {} },
312 { {{{0.000,0.000}, {2.000,1.000}, {0.000,2.000}}}, 3, 0.5, 1, {} },
313 { {{{0.000,0.000}, {2.000,1.000}, {0.000,2.000}}}, 3, 0.5, 0, {} },
314 };
315
316 static IntersectData intersectDataSet6[] = { // pathops_visualizer.htm:3658
317 { {{{0.000,1.000}, {3.000,4.000}, {1.000,0.000}, {3.000,0.000}}}, 4, 0.0925339054, 0, {} }, // pathops_visualizer.htm:3616
318 { {{{0.000,1.000}, {0.000,3.000}, {1.000,0.000}, {4.000,3.000}}}, 4, 0.453872386, 0, {} }, // pathops_visualizer.htm:3616
319 { {{{0.000,1.000}, {3.000,4.000}, {1.000,0.000}, {3.000,0.000}}}, 4, 0.0925339054, 0.417096368, {} }, // pathops_visualizer.htm:3616
320 };
321
322 static IntersectData intersectDataSet7[] = { // pathops_visualizer.htm:3748
323 { {{{2.000,1.000}, {0.000,1.000}}}, 2, 0.5, 0, {} }, // pathops_visualizer.htm:3706
324 { {{{2.000,0.000}, {0.000,2.000}}}, 2, 0.5, 1, {} }, // pathops_visualizer.htm:3706
325 { {{{0.000,1.000}, {0.000,2.000}, {2.000,0.000}, {2.000,1.000}}}, 4, 0.5, 1, {} }, // pathops_visualizer.htm:3706
326 }; //
327
328 static IntersectData intersectDataSet8[] = { // pathops_visualizer.htm:4194
329 { {{{0.000,1.000}, {2.000,3.000}, {5.000,1.000}, {4.000,3.000}}}, 4, 0.311007457, 0.285714286, {} }, // pathops_visualizer.htm:4152
330 { {{{1.000,5.000}, {3.000,4.000}, {1.000,0.000}, {3.000,2.000}}}, 4, 0.589885081, 0.999982974, {} }, // pathops_visualizer.htm:4152
331 { {{{1.000,5.000}, {3.000,4.000}, {1.000,0.000}, {3.000,2.000}}}, 4, 0.589885081, 0.576935809, {} }, // pathops_visualizer.htm:4152
332 }; //
333
334 static IntersectData intersectDataSet9[] = { // pathops_visualizer.htm:4142
335 { {{{0.000,1.000}, {2.000,3.000}, {5.000,1.000}, {4.000,3.000}}}, 4, 0.476627072, 0.311007457, {} }, // pathops_visualizer.htm:4100
336 { {{{1.000,5.000}, {3.000,4.000}, {1.000,0.000}, {3.000,2.000}}}, 4, 0.999982974, 1, {} }, // pathops_visualizer.htm:4100
337 { {{{0.000,1.000}, {2.000,3.000}, {5.000,1.000}, {4.000,3.000}}}, 4, 0.476627072, 1, {} }, // pathops_visualizer.htm:4100
338 }; //
339
340 static IntersectData intersectDataSet10[] = { // pathops_visualizer.htm:4186
341 { {{{0.000,1.000}, {1.000,6.000}, {1.000,0.000}, {1.000,0.000}}}, 4, 0.788195121, 0.726275769, {} }, // pathops_visualizer.htm:4144
342 { {{{0.000,1.000}, {0.000,1.000}, {1.000,0.000}, {6.000,1.000}}}, 4, 0.473378977, 1, {} }, // pathops_visualizer.htm:4144
343 { {{{0.000,1.000}, {1.000,6.000}, {1.000,0.000}, {1.000,0.000}}}, 4, 0.788195121, 1, {} }, // pathops_visualizer.htm:4144
344 }; //
345
346 static IntersectData intersectDataSet11[] = { // pathops_visualizer.htm:4704
347 { {{{979.305,561.000}, {1036.695,291.000}}}, 2, 0.888888874, 0.11111108, {} }, // pathops_visualizer.htm:4662
348 { {{{1006.695,291.000}, {1023.264,291.000}, {1033.840,304.431}, {1030.318,321.000}}}, 4, 1, 0, {} }, // pathops_visualizer.htm:4662
349 { {{{979.305,561.000}, {1036.695,291.000}}}, 2, 0.888888874, 1, {} }, // pathops_visualizer.htm:4662
350 }; //
351
352 static IntersectData intersectDataSet12[] = { // pathops_visualizer.htm:5481
353 { {{{67.000,912.000}, {67.000,913.000}}}, 2, 1, 0, {} }, // pathops_visualizer.htm:5439
354 { {{{67.000,913.000}, {67.000,917.389}, {67.224,921.726}, {67.662,926.000}}}, 4, 0, 1, {} }, // pathops_visualizer.htm:5439
355 { {{{194.000,1041.000}, {123.860,1041.000}, {67.000,983.692}, {67.000,913.000}}}, 4, 1, 0, {} }, // pathops_visualizer.htm:5439
356 }; //
357
358 static IntersectData intersectDataSet13[] = { // pathops_visualizer.htm:5735
359 { {{{6.000,0.000}, {0.000,4.000}}}, 2, 0.625, 0.25, {} }, // pathops_visualizer.htm:5693
360 { {{{0.000,1.000}, {0.000,6.000}, {4.000,0.000}, {6.000,1.000}}}, 4, 0.5, 0.833333333, {} }, // pathops_visualizer.htm:5693
361 { {{{0.000,1.000}, {0.000,6.000}, {4.000,0.000}, {6.000,1.000}}}, 4, 0.5, 0.379043969, {} }, // pathops_visualizer.htm:5693
362 }; //
363
364 static IntersectData intersectDataSet14[] = { // pathops_visualizer.htm:5875
365 { {{{0.000,1.000}, {4.000,6.000}, {2.000,1.000}, {2.000,0.000}}}, 4, 0.0756502183, 0.0594570973, {} }, // pathops_visualizer.htm:5833
366 { {{{1.000,2.000}, {0.000,2.000}, {1.000,0.000}, {6.000,4.000}}}, 4, 0.0756502184, 0, {} }, // pathops_visualizer.htm:5833
367 { {{{0.000,1.000}, {4.000,6.000}, {2.000,1.000}, {2.000,0.000}}}, 4, 0.0756502183, 0.531917258, {} }, // pathops_visualizer.htm:5833
368 }; //
369
370 static IntersectData intersectDataSet15[] = { // pathops_visualizer.htm:6580
371 { {{{490.435,879.407}, {405.593,909.436}}}, 2, 0.500554405, 1, {} }, // pathops_visualizer.htm:6538
372 { {{{447.967,894.438}, {448.007,894.424}, {448.014,894.422}}}, 3, 0, 1, {} }, // pathops_visualizer.htm:6538
373 { {{{490.435,879.407}, {405.593,909.436}}}, 2, 0.500554405, 0.500000273, {} }, // pathops_visualizer.htm:6538
374 }; //
375
376 static IntersectData intersectDataSet16[] = { // pathops_visualizer.htm:7419
377 { {{{1.000,4.000}, {4.000,5.000}, {3.000,2.000}, {6.000,3.000}}}, 4, 0.5, 0, {} }, // pathops_visualizer.htm:7377
378 { {{{2.000,3.000}, {3.000,6.000}, {4.000,1.000}, {5.000,4.000}}}, 4, 0.5, 0.112701665, {} }, // pathops_visualizer.htm:7377
379 { {{{5.000,4.000}, {2.000,3.000}}}, 2, 0.5, 0, {} }, // pathops_visualizer.htm:7377
380 }; //
381
382 // from skpi_gino_com_16
383 static IntersectData intersectDataSet17[] = {
384 { /*seg=7*/ {{{270.974121f, 770.025879f}, {234.948273f, 734}, {184, 734}}}
385 , 3, 0.74590454, 0.547660352, {} },
386 { /*seg=8*/ {{{185, 734}, {252.93103f, 734}, {308, 789.06897f}, {308, 857}}}
387 , 4, 0.12052623, 0, {} },
388 { /*seg=7*/ {{{270.974121f, 770.025879f}, {234.948273f, 734}, {184, 734}}}
389 , 3, 0.74590454, 1, {} },
390 };
391
392 static IntersectData intersectDataSet18[] = {
393 { /*seg=7*/ {{{270.974121f, 770.025879f}, {234.948273f, 734}, {184, 734}}}
394 , 3, 0.74590454, 1, {} },
395 { /*seg=8*/ {{{185, 734}, {252.93103f, 734}, {308, 789.06897f}, {308, 857}}}
396 , 4, 0.12052623, 0.217351928, {} },
397 { /*seg=7*/ {{{270.974121f, 770.025879f}, {234.948273f, 734}, {184, 734}}}
398 , 3, 0.74590454, 0.547660352, {} },
399 };
400
401 static IntersectData intersectDataSet19[] = {
402 { /*seg=1*/ {{{0, 1}, {3, 5}, {2, 1}, {3, 1}}}
403 , 4, 0.135148995, 0.134791946, {} },
404 { /*seg=3*/ {{{1, 2}, {1, 2.15061641f}, {1, 2.21049166f}, {1.01366711f, 2.21379328f}}}
405 , 4, 0.956740456, 0.894913214, {} },
406 { /*seg=1*/ {{{0, 1}, {3, 5}, {2, 1}, {3, 1}}}
407 , 4, 0.135148995, 0.551812363, {} },
408 };
409
410 #define I(x) intersectDataSet##x
411
412 static IntersectData* intersectDataSets[] = {
413 I(1), I(2), I(3), I(4), I(5), I(6), I(7), I(8), I(9), I(10),
414 I(11), I(12), I(13), I(14), I(15), I(16), I(17), I(18), I(19),
415 };
416
417 #undef I
418 #define I(x) (int) SK_ARRAY_COUNT(intersectDataSet##x)
419
420 static const int intersectDataSetSizes[] = {
421 I(1), I(2), I(3), I(4), I(5), I(6), I(7), I(8), I(9), I(10),
422 I(11), I(12), I(13), I(14), I(15), I(16), I(17), I(18), I(19),
423 };
424
425 #undef I
426
427 static const int intersectDataSetsSize = (int) SK_ARRAY_COUNT(intersectDataSetSizes);
428
429 struct FourPoints {
430 SkPoint pts[4];
431 };
432
DEF_TEST(PathOpsAngleAfter,reporter)433 DEF_TEST(PathOpsAngleAfter, reporter) {
434 SkSTArenaAlloc<4096> allocator;
435 SkOpContourHead contour;
436 SkOpGlobalState state(&contour, &allocator SkDEBUGPARAMS(false) SkDEBUGPARAMS(nullptr));
437 contour.init(&state, false, false);
438 for (int index = intersectDataSetsSize - 1; index >= 0; --index) {
439 IntersectData* dataArray = intersectDataSets[index];
440 const int dataSize = intersectDataSetSizes[index];
441 for (int index2 = 0; index2 < dataSize - 2; ++index2) {
442 allocator.reset();
443 contour.reset();
444 for (int index3 = 0; index3 < 3; ++index3) {
445 IntersectData& data = dataArray[index2 + index3];
446 SkPoint* temp = (SkPoint*) allocator.make<FourPoints>();
447 for (int idx2 = 0; idx2 < data.fPtCount; ++idx2) {
448 temp[idx2] = data.fPts.fPts[idx2].asSkPoint();
449 }
450 switch (data.fPtCount) {
451 case 2: {
452 contour.addLine(temp);
453 } break;
454 case 3: {
455 contour.addQuad(temp);
456 } break;
457 case 4: {
458 contour.addCubic(temp);
459 } break;
460 }
461 }
462 SkOpSegment* seg1 = contour.first();
463 seg1->debugAddAngle(dataArray[index2 + 0].fTStart, dataArray[index2 + 0].fTEnd);
464 SkOpSegment* seg2 = seg1->next();
465 seg2->debugAddAngle(dataArray[index2 + 1].fTStart, dataArray[index2 + 1].fTEnd);
466 SkOpSegment* seg3 = seg2->next();
467 seg3->debugAddAngle(dataArray[index2 + 2].fTStart, dataArray[index2 + 2].fTEnd);
468 SkOpAngle& angle1 = *seg1->debugLastAngle();
469 SkOpAngle& angle2 = *seg2->debugLastAngle();
470 SkOpAngle& angle3 = *seg3->debugLastAngle();
471 PathOpsAngleTester::SetNext(angle1, angle3);
472 // These data sets are seeded when the set itself fails, so likely the dataset does not
473 // match the expected result. The tests above return 1 when first added, but
474 // return 0 after the bug is fixed.
475 SkDEBUGCODE(int result =) PathOpsAngleTester::After(angle2, angle1);
476 SkASSERT(result == 0 || result == 1);
477 }
478 }
479 }
480
debugAddAngle(double startT,double endT)481 void SkOpSegment::debugAddAngle(double startT, double endT) {
482 SkOpPtT* startPtT = startT == 0 ? fHead.ptT() : startT == 1 ? fTail.ptT()
483 : this->addT(startT);
484 SkOpPtT* endPtT = endT == 0 ? fHead.ptT() : endT == 1 ? fTail.ptT()
485 : this->addT(endT);
486 SkOpAngle* angle = this->globalState()->allocator()->make<SkOpAngle>();
487 SkOpSpanBase* startSpan = &fHead;
488 while (startSpan->ptT() != startPtT) {
489 startSpan = startSpan->upCast()->next();
490 }
491 SkOpSpanBase* endSpan = &fHead;
492 while (endSpan->ptT() != endPtT) {
493 endSpan = endSpan->upCast()->next();
494 }
495 angle->set(startSpan, endSpan);
496 if (startT < endT) {
497 startSpan->upCast()->setToAngle(angle);
498 endSpan->setFromAngle(angle);
499 } else {
500 endSpan->upCast()->setToAngle(angle);
501 startSpan->setFromAngle(angle);
502 }
503 }
504
DEF_TEST(PathOpsAngleAllOnOneSide,reporter)505 DEF_TEST(PathOpsAngleAllOnOneSide, reporter) {
506 SkSTArenaAlloc<4096> allocator;
507 SkOpContourHead contour;
508 SkOpGlobalState state(&contour, &allocator SkDEBUGPARAMS(false) SkDEBUGPARAMS(nullptr));
509 contour.init(&state, false, false);
510 SkPoint conicPts[3] = {{494.37100219726562f, 224.66200256347656f},
511 {494.37360910682298f, 224.6729026561527f},
512 {494.37600708007813f, 224.68400573730469f}};
513 SkPoint linePts[2] = {{494.371002f, 224.662003f}, {494.375000f, 224.675995f}};
514 for (int i = 10; i >= 0; --i) {
515 SkPoint modLinePts[2] = { linePts[0], linePts[1] };
516 modLinePts[1].fX += i * .1f;
517 contour.addLine(modLinePts);
518 contour.addQuad(conicPts);
519 // contour.addConic(conicPts, 0.999935746f, &allocator);
520 SkOpSegment* first = contour.first();
521 first->debugAddAngle(0, 1);
522 SkOpSegment* next = first->next();
523 next->debugAddAngle(0, 1);
524 /* int result = */
525 PathOpsAngleTester::AllOnOneSide(*first->debugLastAngle(), *next->debugLastAngle());
526 // SkDebugf("i=%d result=%d\n", i , result);
527 // SkDebugf("");
528 }
529 }
530