1 /*
2 * Copyright 2014 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 "include/core/SkString.h"
8 #include "tests/PathOpsDebug.h"
9 #include "tests/PathOpsExtendedTest.h"
10 #include "tests/PathOpsThreadedCommon.h"
11
12 #include <atomic>
13
14 static int loopNo = 17;
15
add_point(SkString * str,SkScalar x,SkScalar y)16 static void add_point(SkString* str, SkScalar x, SkScalar y) {
17 int asInt = SkScalarRoundToInt(x);
18 if (SkIntToScalar(asInt) == x) {
19 str->appendf("%d", asInt);
20 } else {
21 str->appendf("%1.9gf", x);
22 }
23 str->appendf(",");
24 asInt = SkScalarRoundToInt(y);
25 if (SkIntToScalar(asInt) == y) {
26 str->appendf("%d", asInt);
27 } else {
28 str->appendf("%1.9gf", y);
29 }
30 }
31
32 static std::atomic<int> gLoopsTestNo{0};
33
testOpLoopsMain(PathOpsThreadState * data)34 static void testOpLoopsMain(PathOpsThreadState* data) {
35 SkASSERT(data);
36 PathOpsThreadState& state = *data;
37 SkString pathStr;
38 for (int a = 0 ; a < 6; ++a) {
39 for (int b = a + 1 ; b < 7; ++b) {
40 for (int c = 0 ; c < 6; ++c) {
41 for (int d = c + 1 ; d < 7; ++d) {
42 // define 4 points that form two lines that often cross; one line is (a, b) (c, d)
43 SkVector v = {SkIntToScalar(a - c), SkIntToScalar(b - d)};
44 SkPoint midA = { SkIntToScalar(a * state.fA + c * (6 - state.fA)) / 6,
45 SkIntToScalar(b * state.fA + d * (6 - state.fA)) / 6 };
46 SkPoint midB = { SkIntToScalar(a * state.fB + c * (6 - state.fB)) / 6,
47 SkIntToScalar(b * state.fB + d * (6 - state.fB)) / 6 };
48 SkPoint endC = { midA.fX + v.fY * state.fC / 3,
49 midA.fY + v.fX * state.fC / 3 };
50 SkPoint endD = { midB.fX - v.fY * state.fD / 3,
51 midB.fY + v.fX * state.fD / 3 };
52 SkPath pathA, pathB;
53 pathA.moveTo(SkIntToScalar(a), SkIntToScalar(b));
54 pathA.cubicTo(SkIntToScalar(c), SkIntToScalar(d), endC.fX, endC.fY, endD.fX, endD.fY);
55 pathA.close();
56 pathB.moveTo(SkIntToScalar(c), SkIntToScalar(d));
57 pathB.cubicTo(endC.fX, endC.fY, endD.fX, endD.fY, SkIntToScalar(a), SkIntToScalar(b));
58 pathB.close();
59 // SkDebugf("%s\n", pathStr);
60 if (state.fReporter->verbose()) {
61 pathStr.printf("static void loop%d(skiatest::Reporter* reporter,"
62 " const char* filename) {\n", loopNo);
63 pathStr.appendf(" SkPath path, pathB;\n");
64 pathStr.appendf(" path.moveTo(%d,%d);\n", a, b);
65 pathStr.appendf(" path.cubicTo(%d,%d, ", c, d);
66 add_point(&pathStr, endC.fX, endC.fY);
67 pathStr.appendf(", ");
68 add_point(&pathStr, endD.fX, endD.fY);
69 pathStr.appendf(");\n");
70 pathStr.appendf(" path.close();\n");
71 pathStr.appendf(" pathB.moveTo(%d,%d);\n", c, d);
72 pathStr.appendf(" pathB.cubicTo(");
73 add_point(&pathStr, endC.fX, endC.fY);
74 pathStr.appendf(", ");
75 add_point(&pathStr, endD.fX, endD.fY);
76 pathStr.appendf(", %d,%d);\n", a, b);
77 pathStr.appendf(" pathB.close();\n");
78 pathStr.appendf(" testPathOp(reporter, path, pathB, kIntersect_SkPathOp,"
79 " filename);\n");
80 pathStr.appendf("}\n");
81 state.outputProgress(pathStr.c_str(), kIntersect_SkPathOp);
82 }
83 SkString testName;
84 testName.printf("thread_loops%d", ++gLoopsTestNo);
85 testPathOp(state.fReporter, pathA, pathB, kIntersect_SkPathOp, testName.c_str());
86 if (PathOpsDebug::gCheckForDuplicateNames) return;
87 }
88 }
89 }
90 }
91 }
92
DEF_TEST(PathOpsOpLoopsThreaded,reporter)93 DEF_TEST(PathOpsOpLoopsThreaded, reporter) {
94 initializeTests(reporter, "loopOp");
95 PathOpsThreadedTestRunner testRunner(reporter);
96 for (int a = 0; a < 6; ++a) { // outermost
97 for (int b = a + 1; b < 7; ++b) {
98 for (int c = 0 ; c < 6; ++c) {
99 for (int d = c + 1; d < 7; ++d) {
100 *testRunner.fRunnables.append() =
101 new PathOpsThreadedRunnable(&testOpLoopsMain, a, b, c, d, &testRunner);
102 }
103 }
104 if (!reporter->allowExtendedTest()) goto finish;
105 }
106 }
107 finish:
108 testRunner.render();
109 }
110