aboutsummaryrefslogtreecommitdiffhomepage
path: root/tests/TessellatingPathRendererTests.cpp
diff options
context:
space:
mode:
authorGravatar Stephen White <senorblanco@chromium.org>2017-08-15 17:01:15 -0400
committerGravatar Skia Commit-Bot <skia-commit-bot@chromium.org>2017-08-16 13:52:48 +0000
commit3f5301b284f195305371657801b1fc167a7f2671 (patch)
treec7aad233961b54f27a948e84cbd6431ee3f248be /tests/TessellatingPathRendererTests.cpp
parent4c72b266da265d5d31096997ca2d11b4171ec240 (diff)
GrTessellator: fix for collinear out-of-range intersections.
Change 3b5a3fa8b1c11d4bd4499b040311f4c3553ebf8c introduced support for out-of-range intersections, which is necessary when the top and bottom vertices of an edge differ by only one ULP in the primary sort order and can't be split in-order. However, some out-of-range intersections produce edges which cancel each other out on splitting, in particular when the intersection is collinear with the newly-computed edge. This undoes the effect of the split. The tessellator then rewinds, re-detects the intersection, resplits, an infinite loop. The fix is to check for out-of-range intersections which are also collinear, and ignore them. This is ok, because these are not the cases we care about it change 3b5a3f above, which are never collinear. Bug: 753867 Change-Id: I590231e0e6f19c98f1ccf46cb7acc8a63ba35a9d Reviewed-on: https://skia-review.googlesource.com/34925 Reviewed-by: Brian Salomon <bsalomon@google.com> Commit-Queue: Stephen White <senorblanco@chromium.org>
Diffstat (limited to 'tests/TessellatingPathRendererTests.cpp')
-rw-r--r--tests/TessellatingPathRendererTests.cpp16
1 files changed, 16 insertions, 0 deletions
diff --git a/tests/TessellatingPathRendererTests.cpp b/tests/TessellatingPathRendererTests.cpp
index f8b69839aa..dbb328e3e3 100644
--- a/tests/TessellatingPathRendererTests.cpp
+++ b/tests/TessellatingPathRendererTests.cpp
@@ -347,6 +347,21 @@ static SkPath create_path_22() {
return path;
}
+// A path which contains out-of-range colinear intersections.
+static SkPath create_path_23() {
+ SkPath path;
+ path.moveTo( 0, 63.39080047607421875);
+ path.lineTo(-0.70804601907730102539, 63.14350128173828125);
+ path.lineTo(-7.8608899287380243391e-17, 64.14080047607421875);
+ path.moveTo( 0, 64.14080047607421875);
+ path.lineTo(44.285900115966796875, 64.14080047607421875);
+ path.lineTo( 0, 62.64080047607421875);
+ path.moveTo(21.434900283813476562, -0.24732701480388641357);
+ path.lineTo(-0.70804601907730102539, 63.14350128173828125);
+ path.lineTo(0.70804601907730102539, 63.6381988525390625);
+ return path;
+}
+
static std::unique_ptr<GrFragmentProcessor> create_linear_gradient_processor(GrContext* ctx) {
SkPoint pts[2] = { {0, 0}, {1, 1} };
SkColor colors[2] = { SK_ColorGREEN, SK_ColorBLUE };
@@ -427,5 +442,6 @@ DEF_GPUTEST_FOR_ALL_CONTEXTS(TessellatingPathRendererTests, reporter, ctxInfo) {
test_path(ctx, rtc.get(), create_path_20(), SkMatrix(), GrAAType::kCoverage);
test_path(ctx, rtc.get(), create_path_21(), SkMatrix(), GrAAType::kCoverage);
test_path(ctx, rtc.get(), create_path_22());
+ test_path(ctx, rtc.get(), create_path_23());
}
#endif