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 "SkShaderBase.h" 17 #include "effects/GrPorterDuffXferProcessor.h" 18 #include "ops/GrTessellatingPathRenderer.h" 19 20 /* 21 * These tests pass by not crashing, hanging or asserting in Debug. 22 */ 23 24 // Tests active edges made inactive by splitting. 25 // Also tests active edge list forced into an invalid ordering by 26 // splitting (mopped up in cleanup_active_edges()). 27 static SkPath create_path_0() { 28 SkPath path; 29 path.moveTo(229.127044677734375f, 67.34100341796875f); 30 path.lineTo(187.8097381591796875f, -6.7729740142822265625f); 31 path.lineTo(171.411407470703125f, 50.94266510009765625f); 32 path.lineTo(245.5253753662109375f, 9.6253643035888671875f); 33 path.moveTo(208.4683990478515625f, 30.284009933471679688f); 34 path.lineTo(171.411407470703125f, 50.94266510009765625f); 35 path.lineTo(187.8097381591796875f, -6.7729740142822265625f); 36 return path; 37 } 38 39 // Intersections which fall exactly on the current vertex, and require 40 // a restart of the intersection checking. 41 static SkPath create_path_1() { 42 SkPath path; 43 path.moveTo(314.483551025390625f, 486.246002197265625f); 44 path.lineTo(385.41949462890625f, 532.8087158203125f); 45 path.lineTo(373.232879638671875f, 474.05938720703125f); 46 path.lineTo(326.670166015625f, 544.995361328125f); 47 path.moveTo(349.951507568359375f, 509.52734375f); 48 path.lineTo(373.232879638671875f, 474.05938720703125f); 49 path.lineTo(385.41949462890625f, 532.8087158203125f); 50 return path; 51 } 52 53 // Tests active edges which are removed by splitting. 54 static SkPath create_path_2() { 55 SkPath path; 56 path.moveTo(343.107391357421875f, 613.62176513671875f); 57 path.lineTo(426.632415771484375f, 628.5740966796875f); 58 path.lineTo(392.3460693359375f, 579.33544921875f); 59 path.lineTo(377.39373779296875f, 662.86041259765625f); 60 path.moveTo(384.869873046875f, 621.097900390625f); 61 path.lineTo(392.3460693359375f, 579.33544921875f); 62 path.lineTo(426.632415771484375f, 628.5740966796875f); 63 return path; 64 } 65 66 // Collinear edges merged in set_top(). 67 // Also, an intersection between left and right enclosing edges which 68 // falls above the current vertex. 69 static SkPath create_path_3() { 70 SkPath path; 71 path.moveTo(545.95751953125f, 791.69854736328125f); 72 path.lineTo(612.05816650390625f, 738.494140625f); 73 path.lineTo(552.4056396484375f, 732.0460205078125f); 74 path.lineTo(605.61004638671875f, 798.14666748046875f); 75 path.moveTo(579.00787353515625f, 765.0963134765625f); 76 path.lineTo(552.4056396484375f, 732.0460205078125f); 77 path.lineTo(612.05816650390625f, 738.494140625f); 78 return path; 79 } 80 81 // Tests active edges which are made inactive by set_top(). 82 static SkPath create_path_4() { 83 SkPath path; 84 path.moveTo(819.2725830078125f, 751.77447509765625f); 85 path.lineTo(820.70904541015625f, 666.933837890625f); 86 path.lineTo(777.57049560546875f, 708.63592529296875f); 87 path.lineTo(862.4111328125f, 710.0723876953125f); 88 path.moveTo(819.99078369140625f, 709.3541259765625f); 89 path.lineTo(777.57049560546875f, 708.63592529296875f); 90 path.lineTo(820.70904541015625f, 666.933837890625f); 91 return path; 92 } 93 94 static SkPath create_path_5() { 95 SkPath path; 96 path.moveTo(823.33209228515625f, 749.052734375f); 97 path.lineTo(823.494873046875f, 664.20013427734375f); 98 path.lineTo(780.9871826171875f, 706.5450439453125f); 99 path.lineTo(865.8397216796875f, 706.70782470703125f); 100 path.moveTo(823.4134521484375f, 706.6263427734375f); 101 path.lineTo(780.9871826171875f, 706.5450439453125f); 102 path.lineTo(823.494873046875f, 664.20013427734375f); 103 return path; 104 } 105 106 static SkPath create_path_6() { 107 SkPath path; 108 path.moveTo(954.862548828125f, 562.8349609375f); 109 path.lineTo(899.32818603515625f, 498.679443359375f); 110 path.lineTo(895.017578125f, 558.52435302734375f); 111 path.lineTo(959.17315673828125f, 502.990081787109375f); 112 path.moveTo(927.0953369140625f, 530.7572021484375f); 113 path.lineTo(895.017578125f, 558.52435302734375f); 114 path.lineTo(899.32818603515625f, 498.679443359375f); 115 return path; 116 } 117 118 static SkPath create_path_7() { 119 SkPath path; 120 path.moveTo(958.5330810546875f, 547.35516357421875f); 121 path.lineTo(899.93109130859375f, 485.989013671875f); 122 path.lineTo(898.54901123046875f, 545.97308349609375f); 123 path.lineTo(959.9151611328125f, 487.37109375f); 124 path.moveTo(929.2320556640625f, 516.67205810546875f); 125 path.lineTo(898.54901123046875f, 545.97308349609375f); 126 path.lineTo(899.93109130859375f, 485.989013671875f); 127 return path; 128 } 129 130 static SkPath create_path_8() { 131 SkPath path; 132 path.moveTo(389.8609619140625f, 369.326873779296875f); 133 path.lineTo(470.6290283203125f, 395.33697509765625f); 134 path.lineTo(443.250030517578125f, 341.9478759765625f); 135 path.lineTo(417.239959716796875f, 422.7159423828125f); 136 path.moveTo(430.244964599609375f, 382.3319091796875f); 137 path.lineTo(443.250030517578125f, 341.9478759765625f); 138 path.lineTo(470.6290283203125f, 395.33697509765625f); 139 return path; 140 } 141 142 static SkPath create_path_9() { 143 SkPath path; 144 path.moveTo(20, 20); 145 path.lineTo(50, 80); 146 path.lineTo(20, 80); 147 path.moveTo(80, 50); 148 path.lineTo(50, 50); 149 path.lineTo(20, 50); 150 return path; 151 } 152 153 static SkPath create_path_10() { 154 SkPath path; 155 path.moveTo(257.19439697265625f, 320.876617431640625f); 156 path.lineTo(190.113037109375f, 320.58978271484375f); 157 path.lineTo(203.64404296875f, 293.8145751953125f); 158 path.moveTo(203.357177734375f, 360.896026611328125f); 159 path.lineTo(216.88824462890625f, 334.120819091796875f); 160 path.lineTo(230.41925048828125f, 307.345611572265625f); 161 return path; 162 } 163 164 // A degenerate segments case, where both upper and lower segments of 165 // a split edge must remain active. 166 static SkPath create_path_11() { 167 SkPath path; 168 path.moveTo(231.9331207275390625f, 306.2012939453125f); 169 path.lineTo(191.4859161376953125f, 306.04547119140625f); 170 path.lineTo(231.0659332275390625f, 300.2642822265625f); 171 path.moveTo(189.946807861328125f, 302.072265625f); 172 path.lineTo(179.79705810546875f, 294.859771728515625f); 173 path.lineTo(191.0016021728515625f, 296.165679931640625f); 174 path.moveTo(150.8942108154296875f, 304.900146484375f); 175 path.lineTo(179.708892822265625f, 297.849029541015625f); 176 path.lineTo(190.4742279052734375f, 299.11895751953125f); 177 return path; 178 } 179 180 // Handle the case where edge.dist(edge.fTop) != 0.0. 181 static SkPath create_path_12() { 182 SkPath path; 183 path.moveTo( 0.0f, 400.0f); 184 path.lineTo( 138.0f, 202.0f); 185 path.lineTo( 0.0f, 202.0f); 186 path.moveTo( 12.62693023681640625f, 250.57464599609375f); 187 path.lineTo( 8.13896942138671875f, 254.556884765625f); 188 path.lineTo(-18.15641021728515625f, 220.40203857421875f); 189 path.lineTo(-15.986493110656738281f, 219.6513519287109375f); 190 path.moveTo( 36.931194305419921875f, 282.485504150390625f); 191 path.lineTo( 15.617521286010742188f, 261.2901611328125f); 192 path.lineTo( 10.3829498291015625f, 252.565765380859375f); 193 path.lineTo(-16.165292739868164062f, 222.646026611328125f); 194 return path; 195 } 196 197 // A degenerate segments case which exercises inactive edges being 198 // made active by splitting. 199 static SkPath create_path_13() { 200 SkPath path; 201 path.moveTo(690.62127685546875f, 509.25555419921875f); 202 path.lineTo(99.336181640625f, 511.71405029296875f); 203 path.lineTo(708.362548828125f, 512.4349365234375f); 204 path.lineTo(729.9940185546875f, 516.3114013671875f); 205 path.lineTo(738.708984375f, 518.76995849609375f); 206 path.lineTo(678.3463134765625f, 510.0819091796875f); 207 path.lineTo(681.21795654296875f, 504.81378173828125f); 208 path.moveTo(758.52764892578125f, 521.55963134765625f); 209 path.lineTo(719.1549072265625f, 514.50372314453125f); 210 path.lineTo(689.59063720703125f, 512.0628662109375f); 211 path.lineTo(679.78216552734375f, 507.447845458984375f); 212 return path; 213 } 214 215 // Tests vertices which become "orphaned" (ie., no connected edges) 216 // after simplification. 217 static SkPath create_path_14() { 218 SkPath path; 219 path.moveTo(217.326019287109375f, 166.4752960205078125f); 220 path.lineTo(226.279266357421875f, 170.929473876953125f); 221 path.lineTo(234.3973388671875f, 177.0623626708984375f); 222 path.lineTo(262.0921630859375f, 188.746124267578125f); 223 path.moveTo(196.23638916015625f, 174.0722198486328125f); 224 path.lineTo(416.15277099609375f, 180.138214111328125f); 225 path.lineTo(192.651947021484375f, 304.0228271484375f); 226 return path; 227 } 228 229 static SkPath create_path_15() { 230 SkPath path; 231 path.moveTo( 0.0f, 0.0f); 232 path.lineTo(10000.0f, 0.0f); 233 path.lineTo( 0.0f, -1.0f); 234 path.lineTo(10000.0f, 0.000001f); 235 path.lineTo( 0.0f, -30.0f); 236 return path; 237 } 238 239 // Reduction of Nebraska-StateSeal.svg. Floating point error causes the 240 // same edge to be added to more than one poly on the same side. 241 static SkPath create_path_16() { 242 SkPath path; 243 path.moveTo(170.8199920654296875, 491.86700439453125); 244 path.lineTo(173.7649993896484375, 489.7340087890625); 245 path.lineTo(174.1450958251953125, 498.545989990234375); 246 path.lineTo( 171.998992919921875, 500.88201904296875); 247 path.moveTo(168.2922515869140625, 498.66265869140625); 248 path.lineTo(169.8589935302734375, 497.94500732421875); 249 path.lineTo( 172, 500.88299560546875); 250 path.moveTo( 169.555267333984375, 490.70111083984375); 251 path.lineTo(173.7649993896484375, 489.7340087890625); 252 path.lineTo( 170.82000732421875, 491.86700439453125); 253 return path; 254 } 255 256 // A simple concave path. Test this with a non-invertible matrix. 257 static SkPath create_path_17() { 258 SkPath path; 259 path.moveTo(20, 20); 260 path.lineTo(80, 20); 261 path.lineTo(30, 30); 262 path.lineTo(20, 80); 263 return path; 264 } 265 266 // A shape with a vertex collinear to the right hand edge. 267 // This messes up find_enclosing_edges. 268 static SkPath create_path_18() { 269 SkPath path; 270 path.moveTo(80, 20); 271 path.lineTo(80, 60); 272 path.lineTo(20, 60); 273 path.moveTo(80, 50); 274 path.lineTo(80, 80); 275 path.lineTo(20, 80); 276 return path; 277 } 278 279 // Exercises the case where an edge becomes collinear with *two* of its 280 // adjacent neighbour edges after splitting. 281 // This is a reduction from 282 // http://mooooo.ooo/chebyshev-sine-approximation/horner_ulp.svg 283 static SkPath create_path_19() { 284 SkPath path; 285 path.moveTo( 351.99298095703125, 348.23046875); 286 path.lineTo( 351.91876220703125, 347.33984375); 287 path.lineTo( 351.91876220703125, 346.1953125); 288 path.lineTo( 351.90313720703125, 347.734375); 289 path.lineTo( 351.90313720703125, 346.1328125); 290 path.lineTo( 351.87579345703125, 347.93359375); 291 path.lineTo( 351.87579345703125, 345.484375); 292 path.lineTo( 351.86407470703125, 347.7890625); 293 path.lineTo( 351.86407470703125, 346.2109375); 294 path.lineTo( 351.84844970703125, 347.63763427734375); 295 path.lineTo( 351.84454345703125, 344.19232177734375); 296 path.lineTo( 351.78204345703125, 346.9483642578125); 297 path.lineTo( 351.758636474609375, 347.18310546875); 298 path.lineTo( 351.75469970703125, 346.75); 299 path.lineTo( 351.75469970703125, 345.46875); 300 path.lineTo( 352.5546875, 345.46875); 301 path.lineTo( 352.55078125, 347.01953125); 302 path.lineTo( 351.75079345703125, 347.02313232421875); 303 path.lineTo( 351.74688720703125, 346.15203857421875); 304 path.lineTo( 351.74688720703125, 347.646148681640625); 305 path.lineTo( 352.5390625, 346.94140625); 306 path.lineTo( 351.73907470703125, 346.94268798828125); 307 path.lineTo( 351.73516845703125, 344.48565673828125); 308 path.lineTo( 352.484375, 346.73828125); 309 path.lineTo( 351.68438720703125, 346.7401123046875); 310 path.lineTo( 352.4765625, 346.546875); 311 path.lineTo( 351.67657470703125, 346.54937744140625); 312 path.lineTo( 352.47265625, 346.75390625); 313 path.lineTo( 351.67266845703125, 346.756622314453125); 314 path.lineTo( 351.66876220703125, 345.612091064453125); 315 return path; 316 } 317 318 // An intersection above the first vertex in the mesh. 319 // Reduction from http://crbug.com/730687 320 static SkPath create_path_20() { 321 SkPath path; 322 path.moveTo( 2822128.5, 235.026336669921875); 323 path.lineTo( 2819349.25, 235.3623504638671875); 324 path.lineTo( -340558688, 23.83478546142578125); 325 path.lineTo( -340558752, 25.510419845581054688); 326 path.lineTo( -340558720, 27.18605804443359375); 327 return path; 328 } 329 330 // An intersection whose result is NaN (due to rounded-to-inf endpoint). 331 static SkPath create_path_21() { 332 SkPath path; 333 path.moveTo(1.7889142061167663539e+38, 39338463358011572224.0); 334 path.lineTo( 1647.4193115234375, -522.603515625); 335 path.lineTo( 1677.74560546875, -529.0028076171875); 336 path.lineTo( 1678.29541015625, -528.7847900390625); 337 path.lineTo( 1637.5167236328125, -519.79266357421875); 338 path.lineTo( 1647.4193115234375, -522.603515625); 339 return path; 340 } 341 342 // A quad which becomes NaN when interpolated. 343 static SkPath create_path_22() { 344 SkPath path; 345 path.moveTo(-5.71889e+13f, 1.36759e+09f); 346 path.quadTo(2.45472e+19f, -3.12406e+15f, -2.19589e+18f, 2.79462e+14f); 347 return path; 348 } 349 350 static sk_sp<GrFragmentProcessor> create_linear_gradient_processor(GrContext* ctx) { 351 SkPoint pts[2] = { {0, 0}, {1, 1} }; 352 SkColor colors[2] = { SK_ColorGREEN, SK_ColorBLUE }; 353 sk_sp<SkShader> shader = SkGradientShader::MakeLinear( 354 pts, colors, nullptr, SK_ARRAY_COUNT(colors), SkShader::kClamp_TileMode); 355 SkShaderBase::AsFPArgs args( 356 ctx, &SkMatrix::I(), &SkMatrix::I(), SkFilterQuality::kLow_SkFilterQuality, nullptr); 357 return as_SB(shader)->asFragmentProcessor(args); 358 } 359 360 static void test_path(GrContext* ctx, 361 GrRenderTargetContext* renderTargetContext, 362 const SkPath& path, 363 const SkMatrix& matrix = SkMatrix::I(), 364 GrAAType aaType = GrAAType::kNone, 365 sk_sp<GrFragmentProcessor> fp = nullptr) { 366 GrTessellatingPathRenderer tess; 367 368 GrPaint paint; 369 paint.setXPFactory(GrPorterDuffXPFactory::Get(SkBlendMode::kSrc)); 370 if (fp) { 371 paint.addColorFragmentProcessor(fp); 372 } 373 374 GrNoClip noClip; 375 GrStyle style(SkStrokeRec::kFill_InitStyle); 376 GrShape shape(path, style); 377 GrPathRenderer::DrawPathArgs args{ctx, 378 std::move(paint), 379 &GrUserStencilSettings::kUnused, 380 renderTargetContext, 381 &noClip, 382 &matrix, 383 &shape, 384 aaType, 385 false}; 386 tess.drawPath(args); 387 } 388 389 DEF_GPUTEST_FOR_ALL_CONTEXTS(TessellatingPathRendererTests, reporter, ctxInfo) { 390 GrContext* ctx = ctxInfo.grContext(); 391 392 sk_sp<GrRenderTargetContext> rtc(ctx->makeDeferredRenderTargetContext( 393 SkBackingFit::kApprox, 394 800, 800, 395 kRGBA_8888_GrPixelConfig, 396 nullptr, 397 0, 398 kTopLeft_GrSurfaceOrigin)); 399 if (!rtc) { 400 return; 401 } 402 403 ctx->flush(); 404 test_path(ctx, rtc.get(), create_path_0()); 405 test_path(ctx, rtc.get(), create_path_1()); 406 test_path(ctx, rtc.get(), create_path_2()); 407 test_path(ctx, rtc.get(), create_path_3()); 408 test_path(ctx, rtc.get(), create_path_4()); 409 test_path(ctx, rtc.get(), create_path_5()); 410 test_path(ctx, rtc.get(), create_path_6()); 411 test_path(ctx, rtc.get(), create_path_7()); 412 test_path(ctx, rtc.get(), create_path_8()); 413 test_path(ctx, rtc.get(), create_path_9()); 414 test_path(ctx, rtc.get(), create_path_10()); 415 test_path(ctx, rtc.get(), create_path_11()); 416 test_path(ctx, rtc.get(), create_path_12()); 417 test_path(ctx, rtc.get(), create_path_13()); 418 test_path(ctx, rtc.get(), create_path_14()); 419 test_path(ctx, rtc.get(), create_path_15()); 420 test_path(ctx, rtc.get(), create_path_16()); 421 SkMatrix nonInvertibleMatrix = SkMatrix::MakeScale(0, 0); 422 sk_sp<GrFragmentProcessor> fp(create_linear_gradient_processor(ctx)); 423 test_path(ctx, rtc.get(), create_path_17(), nonInvertibleMatrix, GrAAType::kCoverage, fp); 424 test_path(ctx, rtc.get(), create_path_18()); 425 test_path(ctx, rtc.get(), create_path_19()); 426 test_path(ctx, rtc.get(), create_path_20(), SkMatrix(), GrAAType::kCoverage); 427 test_path(ctx, rtc.get(), create_path_21(), SkMatrix(), GrAAType::kCoverage); 428 test_path(ctx, rtc.get(), create_path_22()); 429 } 430 #endif 431
