blob: 93280d746df5dadaba4e6cfed4b730061c30b802 [file] [log] [blame]
caryclark@google.com818b0cc2013-04-08 11:50:46 +00001/*
2 * Copyright 2012 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
8#include "PathOpsExtendedTest.h"
caryclark@google.com66089e42013-04-10 15:55:37 +00009#include "PathOpsThreadedCommon.h"
caryclark@google.com818b0cc2013-04-08 11:50:46 +000010#include "SkBitmap.h"
11#include "SkCanvas.h"
12#include "SkMatrix.h"
13#include "SkPaint.h"
14#include "SkStream.h"
caryclark@google.coma5e55922013-05-07 18:51:31 +000015#include "SkThreadPool.h"
caryclark@google.com818b0cc2013-04-08 11:50:46 +000016
17#ifdef SK_BUILD_FOR_MAC
18#include <sys/sysctl.h>
19#endif
20
caryclark@google.com818b0cc2013-04-08 11:50:46 +000021static const char marker[] =
22 "</div>\n"
23 "\n"
24 "<script type=\"text/javascript\">\n"
25 "\n"
26 "var testDivs = [\n";
27
28static const char* opStrs[] = {
29 "kDifference_PathOp",
30 "kIntersect_PathOp",
31 "kUnion_PathOp",
32 "kXor_PathOp",
caryclark@google.com6dc7df62013-04-25 11:51:54 +000033 "kReverseDifference_PathOp",
caryclark@google.com818b0cc2013-04-08 11:50:46 +000034};
35
36static const char* opSuffixes[] = {
37 "d",
38 "i",
39 "u",
caryclark@google.com66089e42013-04-10 15:55:37 +000040 "o",
caryclark@google.com818b0cc2013-04-08 11:50:46 +000041};
42
43static bool gShowPath = false;
44static bool gComparePaths = true;
caryclark@google.com818b0cc2013-04-08 11:50:46 +000045static bool gComparePathsAssert = true;
46static bool gPathStrAssert = true;
caryclark@google.com818b0cc2013-04-08 11:50:46 +000047
caryclark@google.com07e97fc2013-07-08 17:17:02 +000048static const char* gFillTypeStr[] = {
49 "kWinding_FillType",
50 "kEvenOdd_FillType",
51 "kInverseWinding_FillType",
52 "kInverseEvenOdd_FillType"
53};
54
caryclark@google.comfa2aeee2013-07-15 13:29:13 +000055static void output_scalar(SkScalar num) {
56 if (num == (int) num) {
57 SkDebugf("%d", (int) num);
58 } else {
59 SkString str;
60 str.printf("%1.9g", num);
61 int width = str.size();
62 const char* cStr = str.c_str();
63 while (cStr[width - 1] == '0') {
64 --width;
65 }
66 str.resize(width);
67 SkDebugf("%sf", str.c_str());
68 }
69}
70
71static void output_points(const SkPoint* pts, int count) {
72 for (int index = 0; index < count; ++index) {
73 output_scalar(pts[index].fX);
74 SkDebugf(", ");
75 output_scalar(pts[index].fY);
76 if (index + 1 < count) {
77 SkDebugf(", ");
78 }
79 }
80 SkDebugf(");\n");
81}
82
caryclark@google.com07e97fc2013-07-08 17:17:02 +000083static void showPathContours(SkPath::RawIter& iter, const char* pathName) {
caryclark@google.com818b0cc2013-04-08 11:50:46 +000084 uint8_t verb;
85 SkPoint pts[4];
86 while ((verb = iter.next(pts)) != SkPath::kDone_Verb) {
87 switch (verb) {
88 case SkPath::kMove_Verb:
caryclark@google.comfa2aeee2013-07-15 13:29:13 +000089 SkDebugf(" %s.moveTo(", pathName);
90 output_points(&pts[0], 1);
caryclark@google.com818b0cc2013-04-08 11:50:46 +000091 continue;
92 case SkPath::kLine_Verb:
caryclark@google.comfa2aeee2013-07-15 13:29:13 +000093 SkDebugf(" %s.lineTo(", pathName);
94 output_points(&pts[1], 1);
caryclark@google.com818b0cc2013-04-08 11:50:46 +000095 break;
96 case SkPath::kQuad_Verb:
caryclark@google.comfa2aeee2013-07-15 13:29:13 +000097 SkDebugf(" %s.quadTo(", pathName);
98 output_points(&pts[1], 2);
caryclark@google.com818b0cc2013-04-08 11:50:46 +000099 break;
100 case SkPath::kCubic_Verb:
caryclark@google.comfa2aeee2013-07-15 13:29:13 +0000101 SkDebugf(" %s.cubicTo(", pathName);
102 output_points(&pts[1], 3);
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000103 break;
104 case SkPath::kClose_Verb:
caryclark@google.com07e97fc2013-07-08 17:17:02 +0000105 SkDebugf(" %s.close();\n", pathName);
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000106 break;
107 default:
108 SkDEBUGFAIL("bad verb");
109 return;
110 }
111 }
112}
113
caryclark@google.com07e97fc2013-07-08 17:17:02 +0000114static void showPath(const SkPath& path, const char* pathName, bool includeDeclaration) {
115 SkPath::RawIter iter(path);
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000116#define SUPPORT_RECT_CONTOUR_DETECTION 0
117#if SUPPORT_RECT_CONTOUR_DETECTION
118 int rectCount = path.isRectContours() ? path.rectContours(NULL, NULL) : 0;
119 if (rectCount > 0) {
120 SkTDArray<SkRect> rects;
121 SkTDArray<SkPath::Direction> directions;
122 rects.setCount(rectCount);
123 directions.setCount(rectCount);
124 path.rectContours(rects.begin(), directions.begin());
125 for (int contour = 0; contour < rectCount; ++contour) {
126 const SkRect& rect = rects[contour];
127 SkDebugf("path.addRect(%1.9g, %1.9g, %1.9g, %1.9g, %s);\n", rect.fLeft, rect.fTop,
128 rect.fRight, rect.fBottom, directions[contour] == SkPath::kCCW_Direction
129 ? "SkPath::kCCW_Direction" : "SkPath::kCW_Direction");
130 }
131 return;
132 }
133#endif
caryclark@google.com6dc7df62013-04-25 11:51:54 +0000134 SkPath::FillType fillType = path.getFillType();
135 SkASSERT(fillType >= SkPath::kWinding_FillType && fillType <= SkPath::kInverseEvenOdd_FillType);
caryclark@google.com07e97fc2013-07-08 17:17:02 +0000136 if (includeDeclaration) {
137 SkDebugf(" SkPath %s;\n", pathName);
138 }
139 SkDebugf(" %s.setFillType(SkPath::%s);\n", pathName, gFillTypeStr[fillType]);
140 iter.setPath(path);
141 showPathContours(iter, pathName);
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000142}
143
caryclark@google.comcffbcc32013-06-04 17:59:42 +0000144#if DEBUG_SHOW_TEST_NAME
145static void showPathData(const SkPath& path) {
caryclark@google.com07e97fc2013-07-08 17:17:02 +0000146 SkPath::RawIter iter(path);
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000147 uint8_t verb;
148 SkPoint pts[4];
caryclark@google.comfa2aeee2013-07-15 13:29:13 +0000149 SkPoint firstPt, lastPt;
150 bool firstPtSet = false;
151 bool lastPtSet = true;
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000152 while ((verb = iter.next(pts)) != SkPath::kDone_Verb) {
153 switch (verb) {
154 case SkPath::kMove_Verb:
caryclark@google.comfa2aeee2013-07-15 13:29:13 +0000155 firstPt = pts[0];
156 firstPtSet = true;
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000157 continue;
158 case SkPath::kLine_Verb:
caryclark@google.com66089e42013-04-10 15:55:37 +0000159 SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", pts[0].fX, pts[0].fY,
160 pts[1].fX, pts[1].fY);
caryclark@google.comfa2aeee2013-07-15 13:29:13 +0000161 lastPt = pts[1];
162 lastPtSet = true;
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000163 break;
164 case SkPath::kQuad_Verb:
165 SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}, {%1.9g,%1.9g}},\n",
caryclark@google.com66089e42013-04-10 15:55:37 +0000166 pts[0].fX, pts[0].fY, pts[1].fX, pts[1].fY, pts[2].fX, pts[2].fY);
caryclark@google.comfa2aeee2013-07-15 13:29:13 +0000167 lastPt = pts[2];
168 lastPtSet = true;
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000169 break;
170 case SkPath::kCubic_Verb:
171 SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}, {%1.9g,%1.9g}, {%1.9g,%1.9g}},\n",
caryclark@google.com66089e42013-04-10 15:55:37 +0000172 pts[0].fX, pts[0].fY, pts[1].fX, pts[1].fY, pts[2].fX, pts[2].fY,
173 pts[3].fX, pts[3].fY);
caryclark@google.comfa2aeee2013-07-15 13:29:13 +0000174 lastPt = pts[3];
175 lastPtSet = true;
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000176 break;
177 case SkPath::kClose_Verb:
caryclark@google.comfa2aeee2013-07-15 13:29:13 +0000178 if (firstPtSet && lastPtSet && firstPt != lastPt) {
179 SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", lastPt.fX, lastPt.fY,
180 firstPt.fX, firstPt.fY);
181 }
182 firstPtSet = lastPtSet = false;
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000183 break;
184 default:
185 SkDEBUGFAIL("bad verb");
186 return;
187 }
188 }
189}
caryclark@google.comcffbcc32013-06-04 17:59:42 +0000190#endif
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000191
192void showOp(const SkPathOp op) {
193 switch (op) {
194 case kDifference_PathOp:
195 SkDebugf("op difference\n");
196 break;
197 case kIntersect_PathOp:
198 SkDebugf("op intersect\n");
199 break;
200 case kUnion_PathOp:
201 SkDebugf("op union\n");
202 break;
203 case kXOR_PathOp:
204 SkDebugf("op xor\n");
205 break;
caryclark@google.com6dc7df62013-04-25 11:51:54 +0000206 case kReverseDifference_PathOp:
207 SkDebugf("op reverse difference\n");
208 break;
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000209 default:
210 SkASSERT(0);
211 }
212}
213
caryclark@google.com07e97fc2013-07-08 17:17:02 +0000214#if DEBUG_SHOW_TEST_NAME
215
216void ShowFunctionHeader(const char* functionName) {
217 SkDebugf("\nstatic void %s(skiatest::Reporter* reporter) {\n", functionName);
218 if (strcmp("skphealth_com76", functionName) == 0) {
219 SkDebugf("found it\n");
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000220 }
caryclark@google.com07e97fc2013-07-08 17:17:02 +0000221}
222
223static const char* gOpStrs[] = {
224 "kDifference_PathOp",
225 "kIntersect_PathOp",
226 "kUnion_PathOp",
227 "kXor_PathOp",
228 "kReverseDifference_PathOp",
229};
230
231void ShowOp(SkPathOp op, const char* pathOne, const char* pathTwo) {
232 SkDebugf(" testPathOp(reporter, %s, %s, %s);\n", pathOne, pathTwo, gOpStrs[op]);
233 SkDebugf("}\n");
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000234}
caryclark@google.comcffbcc32013-06-04 17:59:42 +0000235#endif
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000236
caryclark@google.com03610322013-04-18 15:58:21 +0000237#if DEBUG_SHOW_TEST_NAME
238static char hexorator(int x) {
239 if (x < 10) {
240 return x + '0';
241 }
242 x -= 10;
243 SkASSERT(x < 26);
244 return x + 'A';
245}
246#endif
247
248void ShowTestName(PathOpsThreadState* state, int a, int b, int c, int d) {
249#if DEBUG_SHOW_TEST_NAME
250 state->fSerialNo[0] = hexorator(state->fA);
251 state->fSerialNo[1] = hexorator(state->fB);
252 state->fSerialNo[2] = hexorator(state->fC);
253 state->fSerialNo[3] = hexorator(state->fD);
254 state->fSerialNo[4] = hexorator(a);
255 state->fSerialNo[5] = hexorator(b);
256 state->fSerialNo[6] = hexorator(c);
257 state->fSerialNo[7] = hexorator(d);
258 state->fSerialNo[8] = '\0';
259 SkDebugf("%s\n", state->fSerialNo);
260 if (strcmp(state->fSerialNo, state->fKey) == 0) {
261 SkDebugf("%s\n", state->fPathStr);
262 }
263#endif
264}
265
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000266const int bitWidth = 64;
267const int bitHeight = 64;
268
269static void scaleMatrix(const SkPath& one, const SkPath& two, SkMatrix& scale) {
270 SkRect larger = one.getBounds();
271 larger.join(two.getBounds());
272 SkScalar largerWidth = larger.width();
273 if (largerWidth < 4) {
274 largerWidth = 4;
275 }
276 SkScalar largerHeight = larger.height();
277 if (largerHeight < 4) {
278 largerHeight = 4;
279 }
280 SkScalar hScale = (bitWidth - 2) / largerWidth;
281 SkScalar vScale = (bitHeight - 2) / largerHeight;
282 scale.reset();
283 scale.preScale(hScale, vScale);
284}
285
286static int pathsDrawTheSame(SkBitmap& bits, const SkPath& scaledOne, const SkPath& scaledTwo,
287 int& error2x2) {
288 if (bits.width() == 0) {
289 bits.setConfig(SkBitmap::kARGB_8888_Config, bitWidth * 2, bitHeight);
290 bits.allocPixels();
291 }
292 SkCanvas canvas(bits);
293 canvas.drawColor(SK_ColorWHITE);
294 SkPaint paint;
295 canvas.save();
296 const SkRect& bounds1 = scaledOne.getBounds();
297 canvas.translate(-bounds1.fLeft + 1, -bounds1.fTop + 1);
298 canvas.drawPath(scaledOne, paint);
299 canvas.restore();
300 canvas.save();
301 canvas.translate(-bounds1.fLeft + 1 + bitWidth, -bounds1.fTop + 1);
302 canvas.drawPath(scaledTwo, paint);
303 canvas.restore();
304 int errors2 = 0;
305 int errors = 0;
306 for (int y = 0; y < bitHeight - 1; ++y) {
307 uint32_t* addr1 = bits.getAddr32(0, y);
308 uint32_t* addr2 = bits.getAddr32(0, y + 1);
309 uint32_t* addr3 = bits.getAddr32(bitWidth, y);
310 uint32_t* addr4 = bits.getAddr32(bitWidth, y + 1);
311 for (int x = 0; x < bitWidth - 1; ++x) {
312 // count 2x2 blocks
313 bool err = addr1[x] != addr3[x];
314 if (err) {
315 errors2 += addr1[x + 1] != addr3[x + 1]
316 && addr2[x] != addr4[x] && addr2[x + 1] != addr4[x + 1];
317 errors++;
318 }
319 }
320 }
321 if (errors2 >= 6 || errors > 160) {
322 SkDebugf("%s errors2=%d errors=%d\n", __FUNCTION__, errors2, errors);
323 }
324 error2x2 = errors2;
325 return errors;
326}
327
328static int pathsDrawTheSame(const SkPath& one, const SkPath& two, SkBitmap& bits, SkPath& scaledOne,
329 SkPath& scaledTwo, int& error2x2) {
330 SkMatrix scale;
331 scaleMatrix(one, two, scale);
332 one.transform(scale, &scaledOne);
333 two.transform(scale, &scaledTwo);
334 return pathsDrawTheSame(bits, scaledOne, scaledTwo, error2x2);
335}
336
337bool drawAsciiPaths(const SkPath& one, const SkPath& two, bool drawPaths) {
338 if (!drawPaths) {
339 return true;
340 }
341 const SkRect& bounds1 = one.getBounds();
342 const SkRect& bounds2 = two.getBounds();
343 SkRect larger = bounds1;
344 larger.join(bounds2);
345 SkBitmap bits;
346 char out[256];
347 int bitWidth = SkScalarCeil(larger.width()) + 2;
348 if (bitWidth * 2 + 1 >= (int) sizeof(out)) {
349 return false;
350 }
351 int bitHeight = SkScalarCeil(larger.height()) + 2;
352 if (bitHeight >= (int) sizeof(out)) {
353 return false;
354 }
355 bits.setConfig(SkBitmap::kARGB_8888_Config, bitWidth * 2, bitHeight);
356 bits.allocPixels();
357 SkCanvas canvas(bits);
358 canvas.drawColor(SK_ColorWHITE);
359 SkPaint paint;
360 canvas.save();
361 canvas.translate(-bounds1.fLeft + 1, -bounds1.fTop + 1);
362 canvas.drawPath(one, paint);
363 canvas.restore();
364 canvas.save();
365 canvas.translate(-bounds1.fLeft + 1 + bitWidth, -bounds1.fTop + 1);
366 canvas.drawPath(two, paint);
367 canvas.restore();
368 for (int y = 0; y < bitHeight; ++y) {
369 uint32_t* addr1 = bits.getAddr32(0, y);
370 int x;
371 char* outPtr = out;
372 for (x = 0; x < bitWidth; ++x) {
373 *outPtr++ = addr1[x] == (uint32_t) -1 ? '_' : 'x';
374 }
375 *outPtr++ = '|';
376 for (x = bitWidth; x < bitWidth * 2; ++x) {
377 *outPtr++ = addr1[x] == (uint32_t) -1 ? '_' : 'x';
378 }
379 *outPtr++ = '\0';
380 SkDebugf("%s\n", out);
381 }
382 return true;
383}
384
385static void showSimplifiedPath(const SkPath& one, const SkPath& two,
386 const SkPath& scaledOne, const SkPath& scaledTwo) {
caryclark@google.com07e97fc2013-07-08 17:17:02 +0000387 showPath(one, "path", false);
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000388 drawAsciiPaths(scaledOne, scaledTwo, true);
389}
390
391static int comparePaths(skiatest::Reporter* reporter, const SkPath& one, const SkPath& two,
392 SkBitmap& bitmap) {
393 int errors2x2;
394 SkPath scaledOne, scaledTwo;
395 int errors = pathsDrawTheSame(one, two, bitmap, scaledOne, scaledTwo, errors2x2);
396 if (errors2x2 == 0) {
397 return 0;
398 }
399 const int MAX_ERRORS = 9;
400 if (errors2x2 == MAX_ERRORS || errors2x2 == MAX_ERRORS - 1) {
401 showSimplifiedPath(one, two, scaledOne, scaledTwo);
402 }
403 if (errors2x2 > MAX_ERRORS && gComparePathsAssert) {
404 SkDebugf("%s errors=%d\n", __FUNCTION__, errors);
405 showSimplifiedPath(one, two, scaledOne, scaledTwo);
406 REPORTER_ASSERT(reporter, 0);
407 }
408 return errors2x2 > MAX_ERRORS ? errors2x2 : 0;
409}
410
411static void showPathOpPath(const SkPath& one, const SkPath& two, const SkPath& a, const SkPath& b,
412 const SkPath& scaledOne, const SkPath& scaledTwo, const SkPathOp shapeOp,
413 const SkMatrix& scale) {
caryclark@google.comad65a3e2013-04-15 19:13:59 +0000414 SkASSERT((unsigned) shapeOp < SK_ARRAY_COUNT(opStrs));
caryclark@google.comcffbcc32013-06-04 17:59:42 +0000415 SkDebugf("static void xOp#%s(skiatest::Reporter* reporter) {\n", opSuffixes[shapeOp]);
416 SkDebugf(" SkPath path, pathB;\n");
caryclark@google.com07e97fc2013-07-08 17:17:02 +0000417 showPath(a, "path", false);
418 showPath(b, "pathB", false);
caryclark@google.comcffbcc32013-06-04 17:59:42 +0000419 SkDebugf(" testPathOp(reporter, path, pathB, %s);\n", opStrs[shapeOp]);
420 SkDebugf("}\n");
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000421 drawAsciiPaths(scaledOne, scaledTwo, true);
422}
423
424static int comparePaths(skiatest::Reporter* reporter, const SkPath& one, const SkPath& scaledOne,
425 const SkPath& two, const SkPath& scaledTwo, SkBitmap& bitmap,
skia.committer@gmail.com391ca662013-04-11 07:01:45 +0000426 const SkPath& a, const SkPath& b, const SkPathOp shapeOp,
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000427 const SkMatrix& scale) {
428 int errors2x2;
429 int errors = pathsDrawTheSame(bitmap, scaledOne, scaledTwo, errors2x2);
430 if (errors2x2 == 0) {
caryclark@google.com6dc7df62013-04-25 11:51:54 +0000431 if (gShowPath) {
432 showPathOpPath(one, two, a, b, scaledOne, scaledTwo, shapeOp, scale);
433 }
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000434 return 0;
435 }
436 const int MAX_ERRORS = 8;
caryclark@google.com6dc7df62013-04-25 11:51:54 +0000437 if (gShowPath || errors2x2 == MAX_ERRORS || errors2x2 == MAX_ERRORS - 1) {
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000438 showPathOpPath(one, two, a, b, scaledOne, scaledTwo, shapeOp, scale);
439 }
440 if (errors2x2 > MAX_ERRORS && gComparePathsAssert) {
441 SkDebugf("%s errors=%d\n", __FUNCTION__, errors);
442 showPathOpPath(one, two, a, b, scaledOne, scaledTwo, shapeOp, scale);
443 REPORTER_ASSERT(reporter, 0);
444 }
445 return errors2x2 > MAX_ERRORS ? errors2x2 : 0;
446}
447
caryclark@google.com66089e42013-04-10 15:55:37 +0000448static int testNumber;
449static const char* testName;
450
451static void writeTestName(const char* nameSuffix, SkMemoryWStream& outFile) {
452 outFile.writeText(testName);
453 outFile.writeDecAsText(testNumber);
454 if (nameSuffix) {
455 outFile.writeText(nameSuffix);
456 }
457}
458
459static void outputToStream(const char* pathStr, const char* pathPrefix, const char* nameSuffix,
460 const char* testFunction, bool twoPaths, SkMemoryWStream& outFile) {
461 outFile.writeText("<div id=\"");
462 writeTestName(nameSuffix, outFile);
463 outFile.writeText("\">\n");
464 if (pathPrefix) {
465 outFile.writeText(pathPrefix);
466 }
467 outFile.writeText(pathStr);
468 outFile.writeText("</div>\n\n");
469
470 outFile.writeText(marker);
471 outFile.writeText(" ");
472 writeTestName(nameSuffix, outFile);
473 outFile.writeText(",\n\n\n");
474
475 outFile.writeText("static void ");
476 writeTestName(nameSuffix, outFile);
477 outFile.writeText("() {\n SkPath path");
478 if (twoPaths) {
479 outFile.writeText(", pathB");
480 }
481 outFile.writeText(";\n");
482 if (pathPrefix) {
483 outFile.writeText(pathPrefix);
484 }
485 outFile.writeText(pathStr);
486 outFile.writeText(" ");
487 outFile.writeText(testFunction);
488 outFile.writeText("\n}\n\n");
489 outFile.writeText("static void (*firstTest)() = ");
490 writeTestName(nameSuffix, outFile);
491 outFile.writeText(";\n\n");
492
493 outFile.writeText("static struct {\n");
494 outFile.writeText(" void (*fun)();\n");
495 outFile.writeText(" const char* str;\n");
496 outFile.writeText("} tests[] = {\n");
497 outFile.writeText(" TEST(");
498 writeTestName(nameSuffix, outFile);
499 outFile.writeText("),\n");
500 outFile.flush();
501}
502
503bool testSimplify(SkPath& path, bool useXor, SkPath& out, PathOpsThreadState& state,
504 const char* pathStr) {
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000505 SkPath::FillType fillType = useXor ? SkPath::kEvenOdd_FillType : SkPath::kWinding_FillType;
506 path.setFillType(fillType);
507 if (gShowPath) {
caryclark@google.com07e97fc2013-07-08 17:17:02 +0000508 showPath(path, "path", false);
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000509 }
caryclark@google.com66560ca2013-04-26 19:51:16 +0000510 if (!Simplify(path, &out)) {
511 SkDebugf("%s did not expect failure\n", __FUNCTION__);
512 REPORTER_ASSERT(state.fReporter, 0);
513 return false;
514 }
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000515 if (!gComparePaths) {
516 return true;
517 }
caryclark@google.com66089e42013-04-10 15:55:37 +0000518 int result = comparePaths(state.fReporter, path, out, *state.fBitmap);
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000519 if (result && gPathStrAssert) {
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000520 char temp[8192];
521 sk_bzero(temp, sizeof(temp));
522 SkMemoryWStream stream(temp, sizeof(temp));
523 const char* pathPrefix = NULL;
524 const char* nameSuffix = NULL;
525 if (fillType == SkPath::kEvenOdd_FillType) {
526 pathPrefix = " path.setFillType(SkPath::kEvenOdd_FillType);\n";
527 nameSuffix = "x";
528 }
529 const char testFunction[] = "testSimplifyx(path);";
caryclark@google.com66089e42013-04-10 15:55:37 +0000530 outputToStream(pathStr, pathPrefix, nameSuffix, testFunction, false, stream);
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000531 SkDebugf(temp);
caryclark@google.com66089e42013-04-10 15:55:37 +0000532 REPORTER_ASSERT(state.fReporter, 0);
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000533 }
caryclark@google.com66089e42013-04-10 15:55:37 +0000534 state.fReporter->bumpTestCount();
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000535 return result == 0;
536}
537
538bool testSimplify(skiatest::Reporter* reporter, const SkPath& path) {
caryclark@google.coma5e55922013-05-07 18:51:31 +0000539#if DEBUG_SHOW_TEST_NAME
caryclark@google.com03610322013-04-18 15:58:21 +0000540 showPathData(path);
541#endif
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000542 SkPath out;
caryclark@google.com66560ca2013-04-26 19:51:16 +0000543 if (!Simplify(path, &out)) {
544 SkDebugf("%s did not expect failure\n", __FUNCTION__);
545 REPORTER_ASSERT(reporter, 0);
546 return false;
547 }
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000548 SkBitmap bitmap;
549 int result = comparePaths(reporter, path, out, bitmap);
550 if (result && gPathStrAssert) {
551 REPORTER_ASSERT(reporter, 0);
552 }
caryclark@google.com66089e42013-04-10 15:55:37 +0000553 reporter->bumpTestCount();
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000554 return result == 0;
555}
556
caryclark@google.coma5e55922013-05-07 18:51:31 +0000557#if DEBUG_SHOW_TEST_NAME
caryclark@google.com07e97fc2013-07-08 17:17:02 +0000558void DebugShowPath(const SkPath& a, const SkPath& b, SkPathOp shapeOp, const char* testName) {
559 ShowFunctionHeader(testName);
560 showPath(a, "path", true);
561 showPath(b, "pathB", true);
562 ShowOp(shapeOp, "path", "pathB");
563}
564#endif
565
566bool testPathOp(skiatest::Reporter* reporter, const SkPath& a, const SkPath& b,
567 const SkPathOp shapeOp, const char* testName) {
568#if DEBUG_SHOW_TEST_NAME
569 if (testName == NULL) {
caryclark@google.comfa2aeee2013-07-15 13:29:13 +0000570 SkDebugf("\n");
caryclark@google.com07e97fc2013-07-08 17:17:02 +0000571 showPathData(a);
572 showOp(shapeOp);
573 showPathData(b);
574 } else {
575 DebugShowPath(a, b, shapeOp, testName);
576 }
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000577#endif
578 SkPath out;
caryclark@google.com66560ca2013-04-26 19:51:16 +0000579 if (!Op(a, b, shapeOp, &out) ) {
580 SkDebugf("%s did not expect failure\n", __FUNCTION__);
581 REPORTER_ASSERT(reporter, 0);
582 return false;
583 }
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000584 SkPath pathOut, scaledPathOut;
585 SkRegion rgnA, rgnB, openClip, rgnOut;
586 openClip.setRect(-16000, -16000, 16000, 16000);
587 rgnA.setPath(a, openClip);
588 rgnB.setPath(b, openClip);
589 rgnOut.op(rgnA, rgnB, (SkRegion::Op) shapeOp);
590 rgnOut.getBoundaryPath(&pathOut);
591
592 SkMatrix scale;
593 scaleMatrix(a, b, scale);
594 SkRegion scaledRgnA, scaledRgnB, scaledRgnOut;
595 SkPath scaledA, scaledB;
596 scaledA.addPath(a, scale);
597 scaledA.setFillType(a.getFillType());
598 scaledB.addPath(b, scale);
599 scaledB.setFillType(b.getFillType());
600 scaledRgnA.setPath(scaledA, openClip);
601 scaledRgnB.setPath(scaledB, openClip);
602 scaledRgnOut.op(scaledRgnA, scaledRgnB, (SkRegion::Op) shapeOp);
603 scaledRgnOut.getBoundaryPath(&scaledPathOut);
604 SkBitmap bitmap;
605 SkPath scaledOut;
606 scaledOut.addPath(out, scale);
607 scaledOut.setFillType(out.getFillType());
608 int result = comparePaths(reporter, pathOut, scaledPathOut, out, scaledOut, bitmap, a, b,
609 shapeOp, scale);
610 if (result && gPathStrAssert) {
611 REPORTER_ASSERT(reporter, 0);
612 }
caryclark@google.com66089e42013-04-10 15:55:37 +0000613 reporter->bumpTestCount();
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000614 return result == 0;
615}
616
caryclark@google.com16cfe402013-04-18 18:47:37 +0000617int initializeTests(skiatest::Reporter* reporter, const char* test) {
caryclark@google.com66089e42013-04-10 15:55:37 +0000618#ifdef SK_DEBUG
619 gDebugMaxWindSum = 4;
620 gDebugMaxWindValue = 4;
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000621#endif
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000622 testName = test;
caryclark@google.com66089e42013-04-10 15:55:37 +0000623 size_t testNameSize = strlen(test);
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000624 SkFILEStream inFile("../../experimental/Intersection/op.htm");
625 if (inFile.isValid()) {
626 SkTDArray<char> inData;
627 inData.setCount(inFile.getLength());
628 size_t inLen = inData.count();
629 inFile.read(inData.begin(), inLen);
630 inFile.setPath(NULL);
631 char* insert = strstr(inData.begin(), marker);
632 if (insert) {
633 insert += sizeof(marker) - 1;
634 const char* numLoc = insert + 4 /* indent spaces */ + testNameSize - 1;
635 testNumber = atoi(numLoc) + 1;
636 }
637 }
caryclark@google.com07e97fc2013-07-08 17:17:02 +0000638 return reporter->allowThreaded() ? SkThreadPool::kThreadPerCore : 1;
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000639}
640
caryclark@google.com66089e42013-04-10 15:55:37 +0000641void outputProgress(char* ramStr, const char* pathStr, SkPath::FillType pathFillType) {
642 const char testFunction[] = "testSimplify(path);";
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000643 const char* pathPrefix = NULL;
644 const char* nameSuffix = NULL;
645 if (pathFillType == SkPath::kEvenOdd_FillType) {
646 pathPrefix = " path.setFillType(SkPath::kEvenOdd_FillType);\n";
647 nameSuffix = "x";
648 }
caryclark@google.com66089e42013-04-10 15:55:37 +0000649 SkMemoryWStream rRamStream(ramStr, PATH_STR_SIZE);
650 outputToStream(pathStr, pathPrefix, nameSuffix, testFunction, false, rRamStream);
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000651}
652
caryclark@google.com66089e42013-04-10 15:55:37 +0000653void outputProgress(char* ramStr, const char* pathStr, SkPathOp op) {
654 const char testFunction[] = "testOp(path);";
caryclark@google.comad65a3e2013-04-15 19:13:59 +0000655 SkASSERT((size_t) op < SK_ARRAY_COUNT(opSuffixes));
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000656 const char* nameSuffix = opSuffixes[op];
caryclark@google.com66089e42013-04-10 15:55:37 +0000657 SkMemoryWStream rRamStream(ramStr, PATH_STR_SIZE);
658 outputToStream(pathStr, NULL, nameSuffix, testFunction, true, rRamStream);
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000659}
660
661void RunTestSet(skiatest::Reporter* reporter, TestDesc tests[], size_t count,
662 void (*firstTest)(skiatest::Reporter* ),
663 void (*stopTest)(skiatest::Reporter* ), bool reverse) {
664 size_t index;
665 if (firstTest) {
666 index = count - 1;
667 while (index > 0 && tests[index].fun != firstTest) {
668 --index;
669 }
caryclark@google.coma5e55922013-05-07 18:51:31 +0000670#if DEBUG_SHOW_TEST_NAME
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000671 SkDebugf("<div id=\"%s\">\n", tests[index].str);
672 SkDebugf(" %s [%s]\n", __FUNCTION__, tests[index].str);
673#endif
674 (*tests[index].fun)(reporter);
675 }
676 index = reverse ? count - 1 : 0;
677 size_t last = reverse ? 0 : count - 1;
678 do {
679 if (tests[index].fun != firstTest) {
caryclark@google.coma5e55922013-05-07 18:51:31 +0000680 #if DEBUG_SHOW_TEST_NAME
caryclark@google.com818b0cc2013-04-08 11:50:46 +0000681 SkDebugf("<div id=\"%s\">\n", tests[index].str);
682 SkDebugf(" %s [%s]\n", __FUNCTION__, tests[index].str);
683 #endif
684 (*tests[index].fun)(reporter);
685 }
686 if (tests[index].fun == stopTest) {
687 SkDebugf("lastTest\n");
688 }
689 if (index == last) {
690 break;
691 }
692 index += reverse ? -1 : 1;
693 } while (true);
694}