TessellatingPathRendererTests.cpp revision d309e7aa0efa2d5dd7e7b1af97026fcd3a047e98
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 "SkPath.h" 9 10#if SK_SUPPORT_GPU 11#include "GrContextFactory.h" 12#include "GrTessellatingPathRenderer.h" 13#include "GrTest.h" 14#include "Test.h" 15 16/* 17 * These tests pass by not crashing, hanging or asserting in Debug. 18 */ 19 20// Tests active edges made inactive by splitting. 21// Also tests active edge list forced into an invalid ordering by 22// splitting (mopped up in cleanup_active_edges()). 23static SkPath create_path_0() { 24 SkPath path; 25 path.moveTo(229.127044677734375f, 67.34100341796875f); 26 path.lineTo(187.8097381591796875f, -6.7729740142822265625f); 27 path.lineTo(171.411407470703125f, 50.94266510009765625f); 28 path.lineTo(245.5253753662109375f, 9.6253643035888671875f); 29 path.moveTo(208.4683990478515625f, 30.284009933471679688f); 30 path.lineTo(171.411407470703125f, 50.94266510009765625f); 31 path.lineTo(187.8097381591796875f, -6.7729740142822265625f); 32 return path; 33} 34 35// Intersections which fall exactly on the current vertex, and require 36// a restart of the intersection checking. 37static SkPath create_path_1() { 38 SkPath path; 39 path.moveTo(314.483551025390625f, 486.246002197265625f); 40 path.lineTo(385.41949462890625f, 532.8087158203125f); 41 path.lineTo(373.232879638671875f, 474.05938720703125f); 42 path.lineTo(326.670166015625f, 544.995361328125f); 43 path.moveTo(349.951507568359375f, 509.52734375f); 44 path.lineTo(373.232879638671875f, 474.05938720703125f); 45 path.lineTo(385.41949462890625f, 532.8087158203125f); 46 return path; 47} 48 49// Tests active edges which are removed by splitting. 50static SkPath create_path_2() { 51 SkPath path; 52 path.moveTo(343.107391357421875f, 613.62176513671875f); 53 path.lineTo(426.632415771484375f, 628.5740966796875f); 54 path.lineTo(392.3460693359375f, 579.33544921875f); 55 path.lineTo(377.39373779296875f, 662.86041259765625f); 56 path.moveTo(384.869873046875f, 621.097900390625f); 57 path.lineTo(392.3460693359375f, 579.33544921875f); 58 path.lineTo(426.632415771484375f, 628.5740966796875f); 59 return path; 60} 61 62// Collinear edges merged in set_top(). 63// Also, an intersection between left and right enclosing edges which 64// falls above the current vertex. 65static SkPath create_path_3() { 66 SkPath path; 67 path.moveTo(545.95751953125f, 791.69854736328125f); 68 path.lineTo(612.05816650390625f, 738.494140625f); 69 path.lineTo(552.4056396484375f, 732.0460205078125f); 70 path.lineTo(605.61004638671875f, 798.14666748046875f); 71 path.moveTo(579.00787353515625f, 765.0963134765625f); 72 path.lineTo(552.4056396484375f, 732.0460205078125f); 73 path.lineTo(612.05816650390625f, 738.494140625f); 74 return path; 75} 76 77// Tests active edges which are made inactive by set_top(). 78static SkPath create_path_4() { 79 SkPath path; 80 path.moveTo(819.2725830078125f, 751.77447509765625f); 81 path.lineTo(820.70904541015625f, 666.933837890625f); 82 path.lineTo(777.57049560546875f, 708.63592529296875f); 83 path.lineTo(862.4111328125f, 710.0723876953125f); 84 path.moveTo(819.99078369140625f, 709.3541259765625f); 85 path.lineTo(777.57049560546875f, 708.63592529296875f); 86 path.lineTo(820.70904541015625f, 666.933837890625f); 87 return path; 88} 89 90static SkPath create_path_5() { 91 SkPath path; 92 path.moveTo(823.33209228515625f, 749.052734375f); 93 path.lineTo(823.494873046875f, 664.20013427734375f); 94 path.lineTo(780.9871826171875f, 706.5450439453125f); 95 path.lineTo(865.8397216796875f, 706.70782470703125f); 96 path.moveTo(823.4134521484375f, 706.6263427734375f); 97 path.lineTo(780.9871826171875f, 706.5450439453125f); 98 path.lineTo(823.494873046875f, 664.20013427734375f); 99 return path; 100} 101 102static SkPath create_path_6() { 103 SkPath path; 104 path.moveTo(954.862548828125f, 562.8349609375f); 105 path.lineTo(899.32818603515625f, 498.679443359375f); 106 path.lineTo(895.017578125f, 558.52435302734375f); 107 path.lineTo(959.17315673828125f, 502.990081787109375f); 108 path.moveTo(927.0953369140625f, 530.7572021484375f); 109 path.lineTo(895.017578125f, 558.52435302734375f); 110 path.lineTo(899.32818603515625f, 498.679443359375f); 111 return path; 112} 113 114static SkPath create_path_7() { 115 SkPath path; 116 path.moveTo(958.5330810546875f, 547.35516357421875f); 117 path.lineTo(899.93109130859375f, 485.989013671875f); 118 path.lineTo(898.54901123046875f, 545.97308349609375f); 119 path.lineTo(959.9151611328125f, 487.37109375f); 120 path.moveTo(929.2320556640625f, 516.67205810546875f); 121 path.lineTo(898.54901123046875f, 545.97308349609375f); 122 path.lineTo(899.93109130859375f, 485.989013671875f); 123 return path; 124} 125 126static SkPath create_path_8() { 127 SkPath path; 128 path.moveTo(389.8609619140625f, 369.326873779296875f); 129 path.lineTo(470.6290283203125f, 395.33697509765625f); 130 path.lineTo(443.250030517578125f, 341.9478759765625f); 131 path.lineTo(417.239959716796875f, 422.7159423828125f); 132 path.moveTo(430.244964599609375f, 382.3319091796875f); 133 path.lineTo(443.250030517578125f, 341.9478759765625f); 134 path.lineTo(470.6290283203125f, 395.33697509765625f); 135 return path; 136} 137 138static SkPath create_path_9() { 139 SkPath path; 140 path.moveTo(20, 20); 141 path.lineTo(50, 80); 142 path.lineTo(20, 80); 143 path.moveTo(80, 50); 144 path.lineTo(50, 50); 145 path.lineTo(20, 50); 146 return path; 147} 148 149static SkPath create_path_10() { 150 SkPath path; 151 path.moveTo(257.19439697265625f, 320.876617431640625f); 152 path.lineTo(190.113037109375f, 320.58978271484375f); 153 path.lineTo(203.64404296875f, 293.8145751953125f); 154 path.moveTo(203.357177734375f, 360.896026611328125f); 155 path.lineTo(216.88824462890625f, 334.120819091796875f); 156 path.lineTo(230.41925048828125f, 307.345611572265625f); 157 return path; 158} 159 160// A degenerate segments case, where both upper and lower segments of 161// a split edge must remain active. 162static SkPath create_path_11() { 163 SkPath path; 164 path.moveTo(231.9331207275390625f, 306.2012939453125f); 165 path.lineTo(191.4859161376953125f, 306.04547119140625f); 166 path.lineTo(231.0659332275390625f, 300.2642822265625f); 167 path.moveTo(189.946807861328125f, 302.072265625f); 168 path.lineTo(179.79705810546875f, 294.859771728515625f); 169 path.lineTo(191.0016021728515625f, 296.165679931640625f); 170 path.moveTo(150.8942108154296875f, 304.900146484375f); 171 path.lineTo(179.708892822265625f, 297.849029541015625f); 172 path.lineTo(190.4742279052734375f, 299.11895751953125f); 173 return path; 174} 175 176// Handle the case where edge.dist(edge.fTop) != 0.0. 177static SkPath create_path_12() { 178 SkPath path; 179 path.moveTo( 0.0f, 400.0f); 180 path.lineTo( 138.0f, 202.0f); 181 path.lineTo( 0.0f, 202.0f); 182 path.moveTo( 12.62693023681640625f, 250.57464599609375f); 183 path.lineTo( 8.13896942138671875f, 254.556884765625f); 184 path.lineTo(-18.15641021728515625f, 220.40203857421875f); 185 path.lineTo(-15.986493110656738281f, 219.6513519287109375f); 186 path.moveTo( 36.931194305419921875f, 282.485504150390625f); 187 path.lineTo( 15.617521286010742188f, 261.2901611328125f); 188 path.lineTo( 10.3829498291015625f, 252.565765380859375f); 189 path.lineTo(-16.165292739868164062f, 222.646026611328125f); 190 return path; 191} 192 193// A degenerate segments case which exercises inactive edges being 194// made active by splitting. 195static SkPath create_path_13() { 196 SkPath path; 197 path.moveTo(690.62127685546875f, 509.25555419921875f); 198 path.lineTo(99.336181640625f, 511.71405029296875f); 199 path.lineTo(708.362548828125f, 512.4349365234375f); 200 path.lineTo(729.9940185546875f, 516.3114013671875f); 201 path.lineTo(738.708984375f, 518.76995849609375f); 202 path.lineTo(678.3463134765625f, 510.0819091796875f); 203 path.lineTo(681.21795654296875f, 504.81378173828125f); 204 path.moveTo(758.52764892578125f, 521.55963134765625f); 205 path.lineTo(719.1549072265625f, 514.50372314453125f); 206 path.lineTo(689.59063720703125f, 512.0628662109375f); 207 path.lineTo(679.78216552734375f, 507.447845458984375f); 208 return path; 209} 210 211// Tests vertices which become "orphaned" (ie., no connected edges) 212// after simplification. 213static SkPath create_path_14() { 214 SkPath path; 215 path.moveTo(217.326019287109375f, 166.4752960205078125f); 216 path.lineTo(226.279266357421875f, 170.929473876953125f); 217 path.lineTo(234.3973388671875f, 177.0623626708984375f); 218 path.lineTo(262.0921630859375f, 188.746124267578125f); 219 path.moveTo(196.23638916015625f, 174.0722198486328125f); 220 path.lineTo(416.15277099609375f, 180.138214111328125f); 221 path.lineTo(192.651947021484375f, 304.0228271484375f); 222 return path; 223} 224 225static SkPath create_path_15() { 226 SkPath path; 227 path.moveTo( 0.0f, 0.0f); 228 path.lineTo(10000.0f, 0.0f); 229 path.lineTo( 0.0f, -1.0f); 230 path.lineTo(10000.0f, 0.000001f); 231 path.lineTo( 0.0f, -30.0f); 232 return path; 233} 234 235static void test_path(GrDrawTarget* dt, GrRenderTarget* rt, const SkPath& path) { 236 GrTessellatingPathRenderer tess; 237 GrPipelineBuilder pipelineBuilder; 238 pipelineBuilder.setRenderTarget(rt); 239 GrStrokeInfo stroke(SkStrokeRec::kFill_InitStyle); 240 tess.drawPath(dt, &pipelineBuilder, SK_ColorWHITE, SkMatrix::I(), path, stroke, false); 241} 242 243DEF_GPUTEST(TessellatingPathRendererTests, reporter, factory) { 244 GrContext* context = factory->get(static_cast<GrContextFactory::GLContextType>(0)); 245 if (NULL == context) { 246 return; 247 } 248 GrSurfaceDesc desc; 249 desc.fFlags = kRenderTarget_GrSurfaceFlag; 250 desc.fWidth = 800; 251 desc.fHeight = 800; 252 desc.fConfig = kSkia8888_GrPixelConfig; 253 desc.fOrigin = kTopLeft_GrSurfaceOrigin; 254 SkAutoTUnref<GrTexture> texture(context->textureProvider()->refScratchTexture(desc, 255 GrTextureProvider::kExact_ScratchTexMatch)); 256 GrTestTarget tt; 257 context->getTestTarget(&tt); 258 GrRenderTarget* rt = texture->asRenderTarget(); 259 GrDrawTarget* dt = tt.target(); 260 261 test_path(dt, rt, create_path_0()); 262 test_path(dt, rt, create_path_1()); 263 test_path(dt, rt, create_path_2()); 264 test_path(dt, rt, create_path_3()); 265 test_path(dt, rt, create_path_4()); 266 test_path(dt, rt, create_path_5()); 267 test_path(dt, rt, create_path_6()); 268 test_path(dt, rt, create_path_7()); 269 test_path(dt, rt, create_path_8()); 270 test_path(dt, rt, create_path_9()); 271 test_path(dt, rt, create_path_10()); 272 test_path(dt, rt, create_path_11()); 273 test_path(dt, rt, create_path_12()); 274 test_path(dt, rt, create_path_13()); 275 test_path(dt, rt, create_path_14()); 276 test_path(dt, rt, create_path_15()); 277} 278#endif 279