caryclark@google.com | 66560ca | 2013-04-26 19:51:16 +0000 | [diff] [blame] | 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 | */ |
caryclark | 55888e4 | 2016-07-18 10:01:36 -0700 | [diff] [blame^] | 7 | #include "PathOpsExtendedTest.h" |
caryclark@google.com | 66560ca | 2013-04-26 19:51:16 +0000 | [diff] [blame] | 8 | #include "SkPath.h" |
tfarina@chromium.org | 8f6884a | 2014-01-24 20:56:26 +0000 | [diff] [blame] | 9 | #include "SkPathOps.h" |
caryclark@google.com | 66560ca | 2013-04-26 19:51:16 +0000 | [diff] [blame] | 10 | #include "SkPoint.h" |
| 11 | #include "Test.h" |
| 12 | |
| 13 | static const SkPoint nonFinitePts[] = { |
| 14 | { SK_ScalarInfinity, 0 }, |
| 15 | { 0, SK_ScalarInfinity }, |
| 16 | { SK_ScalarInfinity, SK_ScalarInfinity }, |
| 17 | { SK_ScalarNegativeInfinity, 0}, |
| 18 | { 0, SK_ScalarNegativeInfinity }, |
| 19 | { SK_ScalarNegativeInfinity, SK_ScalarNegativeInfinity }, |
| 20 | { SK_ScalarNegativeInfinity, SK_ScalarInfinity }, |
| 21 | { SK_ScalarInfinity, SK_ScalarNegativeInfinity }, |
| 22 | { SK_ScalarNaN, 0 }, |
| 23 | { 0, SK_ScalarNaN }, |
| 24 | { SK_ScalarNaN, SK_ScalarNaN }, |
| 25 | }; |
| 26 | |
| 27 | const size_t nonFinitePtsCount = sizeof(nonFinitePts) / sizeof(nonFinitePts[0]); |
| 28 | |
| 29 | static const SkPoint finitePts[] = { |
| 30 | { 0, 0 }, |
| 31 | { SK_ScalarMax, 0 }, |
| 32 | { 0, SK_ScalarMax }, |
| 33 | { SK_ScalarMax, SK_ScalarMax }, |
| 34 | { SK_ScalarMin, 0 }, |
| 35 | { 0, SK_ScalarMin }, |
| 36 | { SK_ScalarMin, SK_ScalarMin }, |
| 37 | }; |
| 38 | |
| 39 | const size_t finitePtsCount = sizeof(finitePts) / sizeof(finitePts[0]); |
| 40 | |
caryclark@google.com | 570863f | 2013-09-16 15:55:01 +0000 | [diff] [blame] | 41 | static void failOne(skiatest::Reporter* reporter, int index) { |
| 42 | SkPath path; |
| 43 | int i = (int) (index % nonFinitePtsCount); |
| 44 | int f = (int) (index % finitePtsCount); |
| 45 | int g = (int) ((f + 1) % finitePtsCount); |
| 46 | switch (index % 13) { |
| 47 | case 0: path.lineTo(nonFinitePts[i]); break; |
| 48 | case 1: path.quadTo(nonFinitePts[i], nonFinitePts[i]); break; |
| 49 | case 2: path.quadTo(nonFinitePts[i], finitePts[f]); break; |
| 50 | case 3: path.quadTo(finitePts[f], nonFinitePts[i]); break; |
| 51 | case 4: path.cubicTo(nonFinitePts[i], finitePts[f], finitePts[f]); break; |
| 52 | case 5: path.cubicTo(finitePts[f], nonFinitePts[i], finitePts[f]); break; |
| 53 | case 6: path.cubicTo(finitePts[f], finitePts[f], nonFinitePts[i]); break; |
| 54 | case 7: path.cubicTo(nonFinitePts[i], nonFinitePts[i], finitePts[f]); break; |
| 55 | case 8: path.cubicTo(nonFinitePts[i], finitePts[f], nonFinitePts[i]); break; |
| 56 | case 9: path.cubicTo(finitePts[f], nonFinitePts[i], nonFinitePts[i]); break; |
| 57 | case 10: path.cubicTo(nonFinitePts[i], nonFinitePts[i], nonFinitePts[i]); break; |
| 58 | case 11: path.cubicTo(nonFinitePts[i], finitePts[f], finitePts[g]); break; |
| 59 | case 12: path.moveTo(nonFinitePts[i]); break; |
| 60 | } |
| 61 | SkPath result; |
| 62 | result.setFillType(SkPath::kWinding_FillType); |
| 63 | bool success = Simplify(path, &result); |
| 64 | REPORTER_ASSERT(reporter, !success); |
| 65 | REPORTER_ASSERT(reporter, result.isEmpty()); |
| 66 | REPORTER_ASSERT(reporter, result.getFillType() == SkPath::kWinding_FillType); |
| 67 | reporter->bumpTestCount(); |
| 68 | } |
| 69 | |
| 70 | static void dontFailOne(skiatest::Reporter* reporter, int index) { |
| 71 | SkPath path; |
| 72 | int f = (int) (index % finitePtsCount); |
| 73 | int g = (int) ((f + 1) % finitePtsCount); |
| 74 | switch (index % 11) { |
| 75 | case 0: path.lineTo(finitePts[f]); break; |
| 76 | case 1: path.quadTo(finitePts[f], finitePts[f]); break; |
| 77 | case 2: path.quadTo(finitePts[f], finitePts[g]); break; |
| 78 | case 3: path.quadTo(finitePts[g], finitePts[f]); break; |
| 79 | case 4: path.cubicTo(finitePts[f], finitePts[f], finitePts[f]); break; |
| 80 | case 5: path.cubicTo(finitePts[f], finitePts[f], finitePts[g]); break; |
| 81 | case 6: path.cubicTo(finitePts[f], finitePts[g], finitePts[f]); break; |
| 82 | case 7: path.cubicTo(finitePts[f], finitePts[g], finitePts[g]); break; |
| 83 | case 8: path.cubicTo(finitePts[g], finitePts[f], finitePts[f]); break; |
| 84 | case 9: path.cubicTo(finitePts[g], finitePts[f], finitePts[g]); break; |
| 85 | case 10: path.moveTo(finitePts[f]); break; |
| 86 | } |
| 87 | SkPath result; |
| 88 | result.setFillType(SkPath::kWinding_FillType); |
| 89 | bool success = Simplify(path, &result); |
caryclark | 1049f12 | 2015-04-20 08:31:59 -0700 | [diff] [blame] | 90 | if (index != 17 && index != 31 && index != 38) { // cubic fails to chop in two without creating NaNs |
| 91 | REPORTER_ASSERT(reporter, success); |
| 92 | REPORTER_ASSERT(reporter, result.getFillType() != SkPath::kWinding_FillType); |
| 93 | } |
caryclark@google.com | 570863f | 2013-09-16 15:55:01 +0000 | [diff] [blame] | 94 | reporter->bumpTestCount(); |
| 95 | } |
| 96 | |
caryclark | 55888e4 | 2016-07-18 10:01:36 -0700 | [diff] [blame^] | 97 | static void fuzz_59(skiatest::Reporter* reporter, const char* filename) { |
| 98 | SkPath path; |
| 99 | path.moveTo(SkBits2Float(0x430c0000), SkBits2Float(0xce58f41c)); // 140, -9.09969e+08f |
| 100 | path.lineTo(SkBits2Float(0x43480000), SkBits2Float(0xce58f419)); // 200, -9.09969e+08f |
| 101 | path.lineTo(SkBits2Float(0x42200000), SkBits2Float(0xce58f41b)); // 40, -9.09969e+08f |
| 102 | path.lineTo(SkBits2Float(0x43700000), SkBits2Float(0xce58f41b)); // 240, -9.09969e+08f |
| 103 | path.lineTo(SkBits2Float(0x428c0000), SkBits2Float(0xce58f419)); // 70, -9.09969e+08f |
| 104 | path.lineTo(SkBits2Float(0x430c0000), SkBits2Float(0xce58f41c)); // 140, -9.09969e+08f |
| 105 | path.close(); |
| 106 | testSimplifyCheck(reporter, path, filename, true); |
| 107 | } |
| 108 | |
| 109 | static void fuzz_x1(skiatest::Reporter* reporter, const char* filename) { |
| 110 | SkPath path; |
| 111 | path.moveTo(SkBits2Float(0x00000000), SkBits2Float(0x00000000)); // 0, 0 |
| 112 | path.cubicTo(SkBits2Float(0x1931204a), SkBits2Float(0x2ba1a14a), SkBits2Float(0x4a4a08ff), SkBits2Float(0x4a4a08ff), SkBits2Float(0x4a4a4a34), SkBits2Float(0x4a4a4a4a)); // 9.15721e-24f, 1.14845e-12f, 3.31014e+06f, 3.31014e+06f, 3.31432e+06f, 3.31432e+06f |
| 113 | path.moveTo(SkBits2Float(0x000010a1), SkBits2Float(0x19312000)); // 5.96533e-42f, 9.15715e-24f |
| 114 | path.cubicTo(SkBits2Float(0x4a6a4a4a), SkBits2Float(0x4a4a4a4a), SkBits2Float(0xa14a4a4a), SkBits2Float(0x08ff2ba1), SkBits2Float(0x08ff4a4a), SkBits2Float(0x4a344a4a)); // 3.83861e+06f, 3.31432e+06f, -6.85386e-19f, 1.53575e-33f, 1.53647e-33f, 2.95387e+06f |
| 115 | path.cubicTo(SkBits2Float(0x4a4a4a4a), SkBits2Float(0x4a4a4a4a), SkBits2Float(0x2ba1a14a), SkBits2Float(0x4e4a08ff), SkBits2Float(0x4a4a4a4a), SkBits2Float(0xa1a181ff)); // 3.31432e+06f, 3.31432e+06f, 1.14845e-12f, 8.47397e+08f, 3.31432e+06f, -1.09442e-18f |
| 116 | testSimplify(reporter, path, filename); |
| 117 | } |
| 118 | |
| 119 | static void fuzz_x2(skiatest::Reporter* reporter, const char* filename) { |
| 120 | SkPath path; |
| 121 | path.moveTo(SkBits2Float(0x00000000), SkBits2Float(0x00000000)); // 0, 0 |
| 122 | path.cubicTo(SkBits2Float(0x1931204a), SkBits2Float(0x2ba1a14a), SkBits2Float(0x4a4a08ff), SkBits2Float(0x4a4a08ff), SkBits2Float(0x4a4a4a34), SkBits2Float(0x4a4a4a4a)); // 9.15721e-24f, 1.14845e-12f, 3.31014e+06f, 3.31014e+06f, 3.31432e+06f, 3.31432e+06f |
| 123 | path.moveTo(SkBits2Float(0x000010a1), SkBits2Float(0x19312000)); // 5.96533e-42f, 9.15715e-24f |
| 124 | path.cubicTo(SkBits2Float(0x4a6a4a4a), SkBits2Float(0x4a4a4a4a), SkBits2Float(0xa14a4a4a), SkBits2Float(0x08ff2ba1), SkBits2Float(0x08ff4a4a), SkBits2Float(0x4a344a4a)); // 3.83861e+06f, 3.31432e+06f, -6.85386e-19f, 1.53575e-33f, 1.53647e-33f, 2.95387e+06f |
| 125 | path.cubicTo(SkBits2Float(0x4a4a4a4a), SkBits2Float(0x4a4a4a4a), SkBits2Float(0x2ba1a14a), SkBits2Float(0x4e4a08ff), SkBits2Float(0x4a4a4a4a), SkBits2Float(0xa1a181ff)); // 3.31432e+06f, 3.31432e+06f, 1.14845e-12f, 8.47397e+08f, 3.31432e+06f, -1.09442e-18f |
| 126 | testSimplify(reporter, path, filename); |
| 127 | } |
| 128 | |
| 129 | #define TEST(test) test(reporter, #test) |
| 130 | |
tfarina@chromium.org | 78e7b4e | 2014-01-02 21:45:03 +0000 | [diff] [blame] | 131 | DEF_TEST(PathOpsSimplifyFail, reporter) { |
caryclark | 55888e4 | 2016-07-18 10:01:36 -0700 | [diff] [blame^] | 132 | TEST(fuzz_x2); |
| 133 | TEST(fuzz_x1); |
| 134 | TEST(fuzz_59); |
caryclark@google.com | 66560ca | 2013-04-26 19:51:16 +0000 | [diff] [blame] | 135 | for (int index = 0; index < (int) (13 * nonFinitePtsCount * finitePtsCount); ++index) { |
caryclark@google.com | 570863f | 2013-09-16 15:55:01 +0000 | [diff] [blame] | 136 | failOne(reporter, index); |
caryclark@google.com | e23b4a4 | 2013-04-26 20:41:24 +0000 | [diff] [blame] | 137 | } |
caryclark@google.com | 66560ca | 2013-04-26 19:51:16 +0000 | [diff] [blame] | 138 | for (int index = 0; index < (int) (11 * finitePtsCount); ++index) { |
caryclark@google.com | 570863f | 2013-09-16 15:55:01 +0000 | [diff] [blame] | 139 | dontFailOne(reporter, index); |
caryclark@google.com | 66560ca | 2013-04-26 19:51:16 +0000 | [diff] [blame] | 140 | } |
| 141 | } |
| 142 | |
caryclark | 55888e4 | 2016-07-18 10:01:36 -0700 | [diff] [blame^] | 143 | #undef TEST |
| 144 | |
tfarina@chromium.org | 78e7b4e | 2014-01-02 21:45:03 +0000 | [diff] [blame] | 145 | DEF_TEST(PathOpsSimplifyFailOne, reporter) { |
caryclark@google.com | 570863f | 2013-09-16 15:55:01 +0000 | [diff] [blame] | 146 | int index = 0; |
| 147 | failOne(reporter, index); |
| 148 | } |
| 149 | |
tfarina@chromium.org | 78e7b4e | 2014-01-02 21:45:03 +0000 | [diff] [blame] | 150 | DEF_TEST(PathOpsSimplifyDontFailOne, reporter) { |
caryclark | 1049f12 | 2015-04-20 08:31:59 -0700 | [diff] [blame] | 151 | int index = 17; |
caryclark@google.com | 570863f | 2013-09-16 15:55:01 +0000 | [diff] [blame] | 152 | dontFailOne(reporter, index); |
| 153 | } |