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