1 /*
2 * Copyright 2015 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
8 #include "Test.h"
9
10 #include "SkPath.h"
11
12 #if SK_SUPPORT_GPU
13 #include "GrClip.h"
14 #include "GrContext.h"
15 #include "SkGradientShader.h"
16 #include "ops/GrTessellatingPathRenderer.h"
17
18 /*
19 * These tests pass by not crashing, hanging or asserting in Debug.
20 */
21
22 // Tests active edges made inactive by splitting.
23 // Also tests active edge list forced into an invalid ordering by
24 // splitting (mopped up in cleanup_active_edges()).
create_path_0()25 static SkPath create_path_0() {
26 SkPath path;
27 path.moveTo(229.127044677734375f, 67.34100341796875f);
28 path.lineTo(187.8097381591796875f, -6.7729740142822265625f);
29 path.lineTo(171.411407470703125f, 50.94266510009765625f);
30 path.lineTo(245.5253753662109375f, 9.6253643035888671875f);
31 path.moveTo(208.4683990478515625f, 30.284009933471679688f);
32 path.lineTo(171.411407470703125f, 50.94266510009765625f);
33 path.lineTo(187.8097381591796875f, -6.7729740142822265625f);
34 return path;
35 }
36
37 // Intersections which fall exactly on the current vertex, and require
38 // a restart of the intersection checking.
create_path_1()39 static SkPath create_path_1() {
40 SkPath path;
41 path.moveTo(314.483551025390625f, 486.246002197265625f);
42 path.lineTo(385.41949462890625f, 532.8087158203125f);
43 path.lineTo(373.232879638671875f, 474.05938720703125f);
44 path.lineTo(326.670166015625f, 544.995361328125f);
45 path.moveTo(349.951507568359375f, 509.52734375f);
46 path.lineTo(373.232879638671875f, 474.05938720703125f);
47 path.lineTo(385.41949462890625f, 532.8087158203125f);
48 return path;
49 }
50
51 // Tests active edges which are removed by splitting.
create_path_2()52 static SkPath create_path_2() {
53 SkPath path;
54 path.moveTo(343.107391357421875f, 613.62176513671875f);
55 path.lineTo(426.632415771484375f, 628.5740966796875f);
56 path.lineTo(392.3460693359375f, 579.33544921875f);
57 path.lineTo(377.39373779296875f, 662.86041259765625f);
58 path.moveTo(384.869873046875f, 621.097900390625f);
59 path.lineTo(392.3460693359375f, 579.33544921875f);
60 path.lineTo(426.632415771484375f, 628.5740966796875f);
61 return path;
62 }
63
64 // Collinear edges merged in set_top().
65 // Also, an intersection between left and right enclosing edges which
66 // falls above the current vertex.
create_path_3()67 static SkPath create_path_3() {
68 SkPath path;
69 path.moveTo(545.95751953125f, 791.69854736328125f);
70 path.lineTo(612.05816650390625f, 738.494140625f);
71 path.lineTo(552.4056396484375f, 732.0460205078125f);
72 path.lineTo(605.61004638671875f, 798.14666748046875f);
73 path.moveTo(579.00787353515625f, 765.0963134765625f);
74 path.lineTo(552.4056396484375f, 732.0460205078125f);
75 path.lineTo(612.05816650390625f, 738.494140625f);
76 return path;
77 }
78
79 // Tests active edges which are made inactive by set_top().
create_path_4()80 static SkPath create_path_4() {
81 SkPath path;
82 path.moveTo(819.2725830078125f, 751.77447509765625f);
83 path.lineTo(820.70904541015625f, 666.933837890625f);
84 path.lineTo(777.57049560546875f, 708.63592529296875f);
85 path.lineTo(862.4111328125f, 710.0723876953125f);
86 path.moveTo(819.99078369140625f, 709.3541259765625f);
87 path.lineTo(777.57049560546875f, 708.63592529296875f);
88 path.lineTo(820.70904541015625f, 666.933837890625f);
89 return path;
90 }
91
create_path_5()92 static SkPath create_path_5() {
93 SkPath path;
94 path.moveTo(823.33209228515625f, 749.052734375f);
95 path.lineTo(823.494873046875f, 664.20013427734375f);
96 path.lineTo(780.9871826171875f, 706.5450439453125f);
97 path.lineTo(865.8397216796875f, 706.70782470703125f);
98 path.moveTo(823.4134521484375f, 706.6263427734375f);
99 path.lineTo(780.9871826171875f, 706.5450439453125f);
100 path.lineTo(823.494873046875f, 664.20013427734375f);
101 return path;
102 }
103
create_path_6()104 static SkPath create_path_6() {
105 SkPath path;
106 path.moveTo(954.862548828125f, 562.8349609375f);
107 path.lineTo(899.32818603515625f, 498.679443359375f);
108 path.lineTo(895.017578125f, 558.52435302734375f);
109 path.lineTo(959.17315673828125f, 502.990081787109375f);
110 path.moveTo(927.0953369140625f, 530.7572021484375f);
111 path.lineTo(895.017578125f, 558.52435302734375f);
112 path.lineTo(899.32818603515625f, 498.679443359375f);
113 return path;
114 }
115
create_path_7()116 static SkPath create_path_7() {
117 SkPath path;
118 path.moveTo(958.5330810546875f, 547.35516357421875f);
119 path.lineTo(899.93109130859375f, 485.989013671875f);
120 path.lineTo(898.54901123046875f, 545.97308349609375f);
121 path.lineTo(959.9151611328125f, 487.37109375f);
122 path.moveTo(929.2320556640625f, 516.67205810546875f);
123 path.lineTo(898.54901123046875f, 545.97308349609375f);
124 path.lineTo(899.93109130859375f, 485.989013671875f);
125 return path;
126 }
127
create_path_8()128 static SkPath create_path_8() {
129 SkPath path;
130 path.moveTo(389.8609619140625f, 369.326873779296875f);
131 path.lineTo(470.6290283203125f, 395.33697509765625f);
132 path.lineTo(443.250030517578125f, 341.9478759765625f);
133 path.lineTo(417.239959716796875f, 422.7159423828125f);
134 path.moveTo(430.244964599609375f, 382.3319091796875f);
135 path.lineTo(443.250030517578125f, 341.9478759765625f);
136 path.lineTo(470.6290283203125f, 395.33697509765625f);
137 return path;
138 }
139
create_path_9()140 static SkPath create_path_9() {
141 SkPath path;
142 path.moveTo(20, 20);
143 path.lineTo(50, 80);
144 path.lineTo(20, 80);
145 path.moveTo(80, 50);
146 path.lineTo(50, 50);
147 path.lineTo(20, 50);
148 return path;
149 }
150
create_path_10()151 static SkPath create_path_10() {
152 SkPath path;
153 path.moveTo(257.19439697265625f, 320.876617431640625f);
154 path.lineTo(190.113037109375f, 320.58978271484375f);
155 path.lineTo(203.64404296875f, 293.8145751953125f);
156 path.moveTo(203.357177734375f, 360.896026611328125f);
157 path.lineTo(216.88824462890625f, 334.120819091796875f);
158 path.lineTo(230.41925048828125f, 307.345611572265625f);
159 return path;
160 }
161
162 // A degenerate segments case, where both upper and lower segments of
163 // a split edge must remain active.
create_path_11()164 static SkPath create_path_11() {
165 SkPath path;
166 path.moveTo(231.9331207275390625f, 306.2012939453125f);
167 path.lineTo(191.4859161376953125f, 306.04547119140625f);
168 path.lineTo(231.0659332275390625f, 300.2642822265625f);
169 path.moveTo(189.946807861328125f, 302.072265625f);
170 path.lineTo(179.79705810546875f, 294.859771728515625f);
171 path.lineTo(191.0016021728515625f, 296.165679931640625f);
172 path.moveTo(150.8942108154296875f, 304.900146484375f);
173 path.lineTo(179.708892822265625f, 297.849029541015625f);
174 path.lineTo(190.4742279052734375f, 299.11895751953125f);
175 return path;
176 }
177
178 // Handle the case where edge.dist(edge.fTop) != 0.0.
create_path_12()179 static SkPath create_path_12() {
180 SkPath path;
181 path.moveTo( 0.0f, 400.0f);
182 path.lineTo( 138.0f, 202.0f);
183 path.lineTo( 0.0f, 202.0f);
184 path.moveTo( 12.62693023681640625f, 250.57464599609375f);
185 path.lineTo( 8.13896942138671875f, 254.556884765625f);
186 path.lineTo(-18.15641021728515625f, 220.40203857421875f);
187 path.lineTo(-15.986493110656738281f, 219.6513519287109375f);
188 path.moveTo( 36.931194305419921875f, 282.485504150390625f);
189 path.lineTo( 15.617521286010742188f, 261.2901611328125f);
190 path.lineTo( 10.3829498291015625f, 252.565765380859375f);
191 path.lineTo(-16.165292739868164062f, 222.646026611328125f);
192 return path;
193 }
194
195 // A degenerate segments case which exercises inactive edges being
196 // made active by splitting.
create_path_13()197 static SkPath create_path_13() {
198 SkPath path;
199 path.moveTo(690.62127685546875f, 509.25555419921875f);
200 path.lineTo(99.336181640625f, 511.71405029296875f);
201 path.lineTo(708.362548828125f, 512.4349365234375f);
202 path.lineTo(729.9940185546875f, 516.3114013671875f);
203 path.lineTo(738.708984375f, 518.76995849609375f);
204 path.lineTo(678.3463134765625f, 510.0819091796875f);
205 path.lineTo(681.21795654296875f, 504.81378173828125f);
206 path.moveTo(758.52764892578125f, 521.55963134765625f);
207 path.lineTo(719.1549072265625f, 514.50372314453125f);
208 path.lineTo(689.59063720703125f, 512.0628662109375f);
209 path.lineTo(679.78216552734375f, 507.447845458984375f);
210 return path;
211 }
212
213 // Tests vertices which become "orphaned" (ie., no connected edges)
214 // after simplification.
create_path_14()215 static SkPath create_path_14() {
216 SkPath path;
217 path.moveTo(217.326019287109375f, 166.4752960205078125f);
218 path.lineTo(226.279266357421875f, 170.929473876953125f);
219 path.lineTo(234.3973388671875f, 177.0623626708984375f);
220 path.lineTo(262.0921630859375f, 188.746124267578125f);
221 path.moveTo(196.23638916015625f, 174.0722198486328125f);
222 path.lineTo(416.15277099609375f, 180.138214111328125f);
223 path.lineTo(192.651947021484375f, 304.0228271484375f);
224 return path;
225 }
226
create_path_15()227 static SkPath create_path_15() {
228 SkPath path;
229 path.moveTo( 0.0f, 0.0f);
230 path.lineTo(10000.0f, 0.0f);
231 path.lineTo( 0.0f, -1.0f);
232 path.lineTo(10000.0f, 0.000001f);
233 path.lineTo( 0.0f, -30.0f);
234 return path;
235 }
236
237 // Reduction of Nebraska-StateSeal.svg. Floating point error causes the
238 // same edge to be added to more than one poly on the same side.
create_path_16()239 static SkPath create_path_16() {
240 SkPath path;
241 path.moveTo(170.8199920654296875, 491.86700439453125);
242 path.lineTo(173.7649993896484375, 489.7340087890625);
243 path.lineTo(174.1450958251953125, 498.545989990234375);
244 path.lineTo( 171.998992919921875, 500.88201904296875);
245 path.moveTo(168.2922515869140625, 498.66265869140625);
246 path.lineTo(169.8589935302734375, 497.94500732421875);
247 path.lineTo( 172, 500.88299560546875);
248 path.moveTo( 169.555267333984375, 490.70111083984375);
249 path.lineTo(173.7649993896484375, 489.7340087890625);
250 path.lineTo( 170.82000732421875, 491.86700439453125);
251 return path;
252 }
253
254 // A simple concave path. Test this with a non-invertible matrix.
create_path_17()255 static SkPath create_path_17() {
256 SkPath path;
257 path.moveTo(20, 20);
258 path.lineTo(80, 20);
259 path.lineTo(30, 30);
260 path.lineTo(20, 80);
261 return path;
262 }
263
create_linear_gradient_processor(GrContext * ctx)264 static sk_sp<GrFragmentProcessor> create_linear_gradient_processor(GrContext* ctx) {
265 SkPoint pts[2] = { {0, 0}, {1, 1} };
266 SkColor colors[2] = { SK_ColorGREEN, SK_ColorBLUE };
267 sk_sp<SkShader> shader = SkGradientShader::MakeLinear(
268 pts, colors, nullptr, SK_ARRAY_COUNT(colors), SkShader::kClamp_TileMode);
269 SkShader::AsFPArgs args(
270 ctx, &SkMatrix::I(), &SkMatrix::I(), SkFilterQuality::kLow_SkFilterQuality, nullptr);
271 return shader->asFragmentProcessor(args);
272 }
273
test_path(GrContext * ctx,GrRenderTargetContext * renderTargetContext,const SkPath & path,const SkMatrix & matrix=SkMatrix::I (),GrAAType aaType=GrAAType::kNone,sk_sp<GrFragmentProcessor> fp=nullptr)274 static void test_path(GrContext* ctx,
275 GrRenderTargetContext* renderTargetContext,
276 const SkPath& path,
277 const SkMatrix& matrix = SkMatrix::I(),
278 GrAAType aaType = GrAAType::kNone,
279 sk_sp<GrFragmentProcessor> fp = nullptr) {
280 GrTessellatingPathRenderer tess;
281
282 GrPaint paint;
283 paint.setXPFactory(GrPorterDuffXPFactory::Get(SkBlendMode::kSrc));
284 if (fp) {
285 paint.addColorFragmentProcessor(fp);
286 }
287
288 GrNoClip noClip;
289 GrStyle style(SkStrokeRec::kFill_InitStyle);
290 GrShape shape(path, style);
291 GrPathRenderer::DrawPathArgs args{ctx,
292 std::move(paint),
293 &GrUserStencilSettings::kUnused,
294 renderTargetContext,
295 &noClip,
296 &matrix,
297 &shape,
298 aaType,
299 false};
300 tess.drawPath(args);
301 }
302
DEF_GPUTEST_FOR_ALL_CONTEXTS(TessellatingPathRendererTests,reporter,ctxInfo)303 DEF_GPUTEST_FOR_ALL_CONTEXTS(TessellatingPathRendererTests, reporter, ctxInfo) {
304 GrContext* ctx = ctxInfo.grContext();
305
306 sk_sp<GrRenderTargetContext> rtc(ctx->makeRenderTargetContext(SkBackingFit::kApprox,
307 800, 800,
308 kRGBA_8888_GrPixelConfig,
309 nullptr,
310 0,
311 kTopLeft_GrSurfaceOrigin));
312 if (!rtc) {
313 return;
314 }
315
316 ctx->flush();
317 test_path(ctx, rtc.get(), create_path_0());
318 test_path(ctx, rtc.get(), create_path_1());
319 test_path(ctx, rtc.get(), create_path_2());
320 test_path(ctx, rtc.get(), create_path_3());
321 test_path(ctx, rtc.get(), create_path_4());
322 test_path(ctx, rtc.get(), create_path_5());
323 test_path(ctx, rtc.get(), create_path_6());
324 test_path(ctx, rtc.get(), create_path_7());
325 test_path(ctx, rtc.get(), create_path_8());
326 test_path(ctx, rtc.get(), create_path_9());
327 test_path(ctx, rtc.get(), create_path_10());
328 test_path(ctx, rtc.get(), create_path_11());
329 test_path(ctx, rtc.get(), create_path_12());
330 test_path(ctx, rtc.get(), create_path_13());
331 test_path(ctx, rtc.get(), create_path_14());
332 test_path(ctx, rtc.get(), create_path_15());
333 test_path(ctx, rtc.get(), create_path_16());
334 SkMatrix nonInvertibleMatrix = SkMatrix::MakeScale(0, 0);
335 sk_sp<GrFragmentProcessor> fp(create_linear_gradient_processor(ctx));
336 test_path(ctx, rtc.get(), create_path_17(), nonInvertibleMatrix, GrAAType::kCoverage, fp);
337 }
338 #endif
339