1
2 /*
3 * Copyright 2011 Google Inc.
4 *
5 * Use of this source code is governed by a BSD-style license that can be
6 * found in the LICENSE file.
7 */
8 #include "Test.h"
9 #include "SkPath.h"
10 #include "SkLineClipper.h"
11 #include "SkEdgeClipper.h"
12
test_edgeclipper(skiatest::Reporter * reporter)13 static void test_edgeclipper(skiatest::Reporter* reporter) {
14 SkEdgeClipper clipper;
15
16 const SkPoint pts[] = {
17 { SkFloatToScalar(3.0995476e+010), SkFloatToScalar(42.929779) },
18 { SkFloatToScalar(-3.0995163e+010), SkFloatToScalar(51.050385) },
19 { SkFloatToScalar(-3.0995157e+010), SkFloatToScalar(51.050392) },
20 { SkFloatToScalar(-3.0995134e+010), SkFloatToScalar(51.050400) },
21 };
22
23 const SkRect clip = { 0, 0, SkIntToScalar(300), SkIntToScalar(200) };
24
25 // this should not assert, even though our choppers do a poor numerical
26 // job when computing their t values.
27 // http://code.google.com/p/skia/issues/detail?id=444
28 clipper.clipCubic(pts, clip);
29 }
30
test_intersectline(skiatest::Reporter * reporter)31 static void test_intersectline(skiatest::Reporter* reporter) {
32 static const SkScalar L = 0;
33 static const SkScalar T = 0;
34 static const SkScalar R = SkIntToScalar(100);
35 static const SkScalar B = SkIntToScalar(100);
36 static const SkScalar CX = SkScalarHalf(L + R);
37 static const SkScalar CY = SkScalarHalf(T + B);
38 static const SkRect gR = { L, T, R, B };
39
40 size_t i;
41 SkPoint dst[2];
42
43 static const SkPoint gEmpty[] = {
44 // sides
45 { L, CY }, { L - 10, CY },
46 { R, CY }, { R + 10, CY },
47 { CX, T }, { CX, T - 10 },
48 { CX, B }, { CX, B + 10 },
49 // corners
50 { L, T }, { L - 10, T - 10 },
51 { L, B }, { L - 10, B + 10 },
52 { R, T }, { R + 10, T - 10 },
53 { R, B }, { R + 10, B + 10 },
54 };
55 for (i = 0; i < SK_ARRAY_COUNT(gEmpty); i += 2) {
56 bool valid = SkLineClipper::IntersectLine(&gEmpty[i], gR, dst);
57 if (valid) {
58 SkDebugf("----- [%d] %g %g -> %g %g\n", i/2, dst[0].fX, dst[0].fY, dst[1].fX, dst[1].fY);
59 }
60 REPORTER_ASSERT(reporter, !valid);
61 }
62
63 static const SkPoint gFull[] = {
64 // diagonals, chords
65 { L, T }, { R, B },
66 { L, B }, { R, T },
67 { CX, T }, { CX, B },
68 { L, CY }, { R, CY },
69 { CX, T }, { R, CY },
70 { CX, T }, { L, CY },
71 { L, CY }, { CX, B },
72 { R, CY }, { CX, B },
73 // edges
74 { L, T }, { L, B },
75 { R, T }, { R, B },
76 { L, T }, { R, T },
77 { L, B }, { R, B },
78 };
79 for (i = 0; i < SK_ARRAY_COUNT(gFull); i += 2) {
80 bool valid = SkLineClipper::IntersectLine(&gFull[i], gR, dst);
81 if (!valid || memcmp(&gFull[i], dst, sizeof(dst))) {
82 SkDebugf("++++ [%d] %g %g -> %g %g\n", i/2, dst[0].fX, dst[0].fY, dst[1].fX, dst[1].fY);
83 }
84 REPORTER_ASSERT(reporter, valid && !memcmp(&gFull[i], dst, sizeof(dst)));
85 }
86
87 static const SkPoint gPartial[] = {
88 { L - 10, CY }, { CX, CY }, { L, CY }, { CX, CY },
89 { CX, T - 10 }, { CX, CY }, { CX, T }, { CX, CY },
90 { R + 10, CY }, { CX, CY }, { R, CY }, { CX, CY },
91 { CX, B + 10 }, { CX, CY }, { CX, B }, { CX, CY },
92 // extended edges
93 { L, T - 10 }, { L, B + 10 }, { L, T }, { L, B },
94 { R, T - 10 }, { R, B + 10 }, { R, T }, { R, B },
95 { L - 10, T }, { R + 10, T }, { L, T }, { R, T },
96 { L - 10, B }, { R + 10, B }, { L, B }, { R, B },
97 };
98 for (i = 0; i < SK_ARRAY_COUNT(gPartial); i += 4) {
99 bool valid = SkLineClipper::IntersectLine(&gPartial[i], gR, dst);
100 if (!valid || memcmp(&gPartial[i+2], dst, sizeof(dst))) {
101 SkDebugf("++++ [%d] %g %g -> %g %g\n", i/2, dst[0].fX, dst[0].fY, dst[1].fX, dst[1].fY);
102 }
103 REPORTER_ASSERT(reporter, valid &&
104 !memcmp(&gPartial[i+2], dst, sizeof(dst)));
105 }
106
107 }
108
TestClipper(skiatest::Reporter * reporter)109 void TestClipper(skiatest::Reporter* reporter) {
110 test_intersectline(reporter);
111 test_edgeclipper(reporter);
112 }
113
114 #include "TestClassDef.h"
115 DEFINE_TESTCLASS("Clipper", TestClipperClass, TestClipper)
116