blob: 2d70bf8406db2c6754ac9f04022056ded393b648 [file] [log] [blame]
commit-bot@chromium.org8cb1daa2014-04-25 12:59:11 +00001/*
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 */
Mike Kleinc0bd9f92019-04-23 12:05:21 -05007#include "include/core/SkString.h"
8#include "tests/PathOpsDebug.h"
9#include "tests/PathOpsExtendedTest.h"
10#include "tests/PathOpsThreadedCommon.h"
Hal Canary8a001442018-09-19 11:31:27 -040011
Cary Clark8af4c402018-08-08 23:22:37 -040012#include <atomic>
commit-bot@chromium.org8cb1daa2014-04-25 12:59:11 +000013
caryclark8f186432016-10-06 11:46:25 -070014static int loopNo = 17;
15
16static void add_point(SkString* str, SkScalar x, SkScalar y) {
caryclark54359292015-03-26 07:52:43 -070017 int asInt = SkScalarRoundToInt(x);
18 if (SkIntToScalar(asInt) == x) {
caryclark8f186432016-10-06 11:46:25 -070019 str->appendf("%d", asInt);
caryclark54359292015-03-26 07:52:43 -070020 } else {
caryclark8f186432016-10-06 11:46:25 -070021 str->appendf("%1.9gf", x);
caryclark54359292015-03-26 07:52:43 -070022 }
caryclark8f186432016-10-06 11:46:25 -070023 str->appendf(",");
caryclark54359292015-03-26 07:52:43 -070024 asInt = SkScalarRoundToInt(y);
25 if (SkIntToScalar(asInt) == y) {
caryclark8f186432016-10-06 11:46:25 -070026 str->appendf("%d", asInt);
caryclark54359292015-03-26 07:52:43 -070027 } else {
caryclark8f186432016-10-06 11:46:25 -070028 str->appendf("%1.9gf", y);
caryclark54359292015-03-26 07:52:43 -070029 }
caryclark54359292015-03-26 07:52:43 -070030}
31
Cary Clark8af4c402018-08-08 23:22:37 -040032static std::atomic<int> gLoopsTestNo{0};
Cary Clark4533f3d2018-08-08 09:48:09 -040033
commit-bot@chromium.org8cb1daa2014-04-25 12:59:11 +000034static void testOpLoopsMain(PathOpsThreadState* data) {
commit-bot@chromium.org8cb1daa2014-04-25 12:59:11 +000035 SkASSERT(data);
36 PathOpsThreadState& state = *data;
caryclark8f186432016-10-06 11:46:25 -070037 SkString pathStr;
commit-bot@chromium.org8cb1daa2014-04-25 12:59:11 +000038 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;
commit-bot@chromium.org8cb1daa2014-04-25 12:59:11 +000053 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);
caryclark8f186432016-10-06 11:46:25 -070060 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");
Mike Reedff80c2a2017-01-07 11:16:28 -050081 state.outputProgress(pathStr.c_str(), kIntersect_SkPathOp);
commit-bot@chromium.org8cb1daa2014-04-25 12:59:11 +000082 }
Cary Clark4533f3d2018-08-08 09:48:09 -040083 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;
commit-bot@chromium.org8cb1daa2014-04-25 12:59:11 +000087 }
88 }
89 }
90 }
91}
92
93DEF_TEST(PathOpsOpLoopsThreaded, reporter) {
caryclark1049f122015-04-20 08:31:59 -070094 initializeTests(reporter, "loopOp");
mtklein406654b2014-09-03 15:34:37 -070095 PathOpsThreadedTestRunner testRunner(reporter);
commit-bot@chromium.org8cb1daa2014-04-25 12:59:11 +000096 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) {
halcanary385fe4d2015-08-26 13:07:48 -0700100 *testRunner.fRunnables.append() =
101 new PathOpsThreadedRunnable(&testOpLoopsMain, a, b, c, d, &testRunner);
commit-bot@chromium.org8cb1daa2014-04-25 12:59:11 +0000102 }
103 }
104 if (!reporter->allowExtendedTest()) goto finish;
105 }
106 }
107finish:
108 testRunner.render();
commit-bot@chromium.org8cb1daa2014-04-25 12:59:11 +0000109}