1 /*
2 * Copyright 2011 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 "SkAutoMalloc.h"
9 #include "SkCanvas.h"
10 #include "SkGeometry.h"
11 #include "SkNullCanvas.h"
12 #include "SkPaint.h"
13 #include "SkParse.h"
14 #include "SkParsePath.h"
15 #include "SkPathEffect.h"
16 #include "SkPathPriv.h"
17 #include "SkRRect.h"
18 #include "SkRandom.h"
19 #include "SkReader32.h"
20 #include "SkSize.h"
21 #include "SkStream.h"
22 #include "SkStrokeRec.h"
23 #include "SkSurface.h"
24 #include "SkWriter32.h"
25 #include "Test.h"
26 #include <cmath>
27
28
set_radii(SkVector radii[4],int index,float rad)29 static void set_radii(SkVector radii[4], int index, float rad) {
30 sk_bzero(radii, sizeof(SkVector) * 4);
31 radii[index].set(rad, rad);
32 }
33
test_add_rrect(skiatest::Reporter * reporter,const SkRect & bounds,const SkVector radii[4])34 static void test_add_rrect(skiatest::Reporter* reporter, const SkRect& bounds,
35 const SkVector radii[4]) {
36 SkRRect rrect;
37 rrect.setRectRadii(bounds, radii);
38 REPORTER_ASSERT(reporter, bounds == rrect.rect());
39
40 SkPath path;
41 // this line should not assert in the debug build (from validate)
42 path.addRRect(rrect);
43 REPORTER_ASSERT(reporter, bounds == path.getBounds());
44 }
45
test_skbug_3469(skiatest::Reporter * reporter)46 static void test_skbug_3469(skiatest::Reporter* reporter) {
47 SkPath path;
48 path.moveTo(20, 20);
49 path.quadTo(20, 50, 80, 50);
50 path.quadTo(20, 50, 20, 80);
51 REPORTER_ASSERT(reporter, !path.isConvex());
52 }
53
test_skbug_3239(skiatest::Reporter * reporter)54 static void test_skbug_3239(skiatest::Reporter* reporter) {
55 const float min = SkBits2Float(0xcb7f16c8); /* -16717512.000000 */
56 const float max = SkBits2Float(0x4b7f1c1d); /* 16718877.000000 */
57 const float big = SkBits2Float(0x4b7f1bd7); /* 16718807.000000 */
58
59 const float rad = 33436320;
60
61 const SkRect rectx = SkRect::MakeLTRB(min, min, max, big);
62 const SkRect recty = SkRect::MakeLTRB(min, min, big, max);
63
64 SkVector radii[4];
65 for (int i = 0; i < 4; ++i) {
66 set_radii(radii, i, rad);
67 test_add_rrect(reporter, rectx, radii);
68 test_add_rrect(reporter, recty, radii);
69 }
70 }
71
make_path_crbug364224(SkPath * path)72 static void make_path_crbug364224(SkPath* path) {
73 path->reset();
74 path->moveTo(3.747501373f, 2.724499941f);
75 path->lineTo(3.747501373f, 3.75f);
76 path->cubicTo(3.747501373f, 3.88774991f, 3.635501385f, 4.0f, 3.497501373f, 4.0f);
77 path->lineTo(0.7475013733f, 4.0f);
78 path->cubicTo(0.6095013618f, 4.0f, 0.4975013733f, 3.88774991f, 0.4975013733f, 3.75f);
79 path->lineTo(0.4975013733f, 1.0f);
80 path->cubicTo(0.4975013733f, 0.8622499704f, 0.6095013618f, 0.75f, 0.7475013733f,0.75f);
81 path->lineTo(3.497501373f, 0.75f);
82 path->cubicTo(3.50275135f, 0.75f, 3.5070014f, 0.7527500391f, 3.513001442f, 0.753000021f);
83 path->lineTo(3.715001345f, 0.5512499809f);
84 path->cubicTo(3.648251295f, 0.5194999576f, 3.575501442f, 0.4999999702f, 3.497501373f, 0.4999999702f);
85 path->lineTo(0.7475013733f, 0.4999999702f);
86 path->cubicTo(0.4715013802f, 0.4999999702f, 0.2475013733f, 0.7239999771f, 0.2475013733f, 1.0f);
87 path->lineTo(0.2475013733f, 3.75f);
88 path->cubicTo(0.2475013733f, 4.026000023f, 0.4715013504f, 4.25f, 0.7475013733f, 4.25f);
89 path->lineTo(3.497501373f, 4.25f);
90 path->cubicTo(3.773501396f, 4.25f, 3.997501373f, 4.026000023f, 3.997501373f, 3.75f);
91 path->lineTo(3.997501373f, 2.474750042f);
92 path->lineTo(3.747501373f, 2.724499941f);
93 path->close();
94 }
95
make_path_crbug364224_simplified(SkPath * path)96 static void make_path_crbug364224_simplified(SkPath* path) {
97 path->moveTo(3.747501373f, 2.724499941f);
98 path->cubicTo(3.648251295f, 0.5194999576f, 3.575501442f, 0.4999999702f, 3.497501373f, 0.4999999702f);
99 path->close();
100 }
101
test_sect_with_horizontal_needs_pinning()102 static void test_sect_with_horizontal_needs_pinning() {
103 // Test that sect_with_horizontal in SkLineClipper.cpp needs to pin after computing the
104 // intersection.
105 SkPath path;
106 path.reset();
107 path.moveTo(-540000, -720000);
108 path.lineTo(-9.10000017e-05f, 9.99999996e-13f);
109 path.lineTo(1, 1);
110
111 // Without the pinning code in sect_with_horizontal(), this would assert in the lineclipper
112 SkPaint paint;
113 SkSurface::MakeRasterN32Premul(10, 10)->getCanvas()->drawPath(path, paint);
114 }
115
test_path_crbug364224()116 static void test_path_crbug364224() {
117 SkPath path;
118 SkPaint paint;
119 auto surface(SkSurface::MakeRasterN32Premul(84, 88));
120 SkCanvas* canvas = surface->getCanvas();
121
122 make_path_crbug364224_simplified(&path);
123 canvas->drawPath(path, paint);
124
125 make_path_crbug364224(&path);
126 canvas->drawPath(path, paint);
127 }
128
test_draw_AA_path(int width,int height,const SkPath & path)129 static void test_draw_AA_path(int width, int height, const SkPath& path) {
130 auto surface(SkSurface::MakeRasterN32Premul(width, height));
131 SkCanvas* canvas = surface->getCanvas();
132 SkPaint paint;
133 paint.setAntiAlias(true);
134 canvas->drawPath(path, paint);
135 }
136
137 // this is a unit test instead of a GM because it doesn't draw anything
test_fuzz_crbug_638223()138 static void test_fuzz_crbug_638223() {
139 SkPath path;
140 path.moveTo(SkBits2Float(0x47452a00), SkBits2Float(0x43211d01)); // 50474, 161.113f
141 path.conicTo(SkBits2Float(0x401c0000), SkBits2Float(0x40680000),
142 SkBits2Float(0x02c25a81), SkBits2Float(0x981a1fa0),
143 SkBits2Float(0x6bf9abea)); // 2.4375f, 3.625f, 2.85577e-37f, -1.992e-24f, 6.03669e+26f
144 test_draw_AA_path(250, 250, path);
145 }
146
test_fuzz_crbug_643933()147 static void test_fuzz_crbug_643933() {
148 SkPath path;
149 path.moveTo(0, 0);
150 path.conicTo(SkBits2Float(0x002001f2), SkBits2Float(0x4161ffff), // 2.93943e-39f, 14.125f
151 SkBits2Float(0x49f7224d), SkBits2Float(0x45eec8df), // 2.02452e+06f, 7641.11f
152 SkBits2Float(0x721aee0c)); // 3.0687e+30f
153 test_draw_AA_path(250, 250, path);
154 path.reset();
155 path.moveTo(0, 0);
156 path.conicTo(SkBits2Float(0x00007ff2), SkBits2Float(0x4169ffff), // 4.58981e-41f, 14.625f
157 SkBits2Float(0x43ff2261), SkBits2Float(0x41eeea04), // 510.269f, 29.8643f
158 SkBits2Float(0x5d06eff8)); // 6.07704e+17f
159 test_draw_AA_path(250, 250, path);
160 }
161
test_fuzz_crbug_647922()162 static void test_fuzz_crbug_647922() {
163 SkPath path;
164 path.moveTo(0, 0);
165 path.conicTo(SkBits2Float(0x00003939), SkBits2Float(0x42487fff), // 2.05276e-41f, 50.125f
166 SkBits2Float(0x48082361), SkBits2Float(0x4408e8e9), // 139406, 547.639f
167 SkBits2Float(0x4d1ade0f)); // 1.6239e+08f
168 test_draw_AA_path(250, 250, path);
169 }
170
test_fuzz_crbug_662780()171 static void test_fuzz_crbug_662780() {
172 auto surface(SkSurface::MakeRasterN32Premul(250, 250));
173 SkCanvas* canvas = surface->getCanvas();
174 SkPaint paint;
175 paint.setAntiAlias(true);
176 SkPath path;
177 path.moveTo(SkBits2Float(0x41000000), SkBits2Float(0x431e0000)); // 8, 158
178 path.lineTo(SkBits2Float(0x41000000), SkBits2Float(0x42f00000)); // 8, 120
179 // 8, 8, 8.00002f, 8, 0.707107f
180 path.conicTo(SkBits2Float(0x41000000), SkBits2Float(0x41000000),
181 SkBits2Float(0x41000010), SkBits2Float(0x41000000), SkBits2Float(0x3f3504f3));
182 path.lineTo(SkBits2Float(0x439a0000), SkBits2Float(0x41000000)); // 308, 8
183 // 308, 8, 308, 8, 0.707107f
184 path.conicTo(SkBits2Float(0x439a0000), SkBits2Float(0x41000000),
185 SkBits2Float(0x439a0000), SkBits2Float(0x41000000), SkBits2Float(0x3f3504f3));
186 path.lineTo(SkBits2Float(0x439a0000), SkBits2Float(0x431e0000)); // 308, 158
187 // 308, 158, 308, 158, 0.707107f
188 path.conicTo(SkBits2Float(0x439a0000), SkBits2Float(0x431e0000),
189 SkBits2Float(0x439a0000), SkBits2Float(0x431e0000), SkBits2Float(0x3f3504f3));
190 path.lineTo(SkBits2Float(0x41000000), SkBits2Float(0x431e0000)); // 8, 158
191 // 8, 158, 8, 158, 0.707107f
192 path.conicTo(SkBits2Float(0x41000000), SkBits2Float(0x431e0000),
193 SkBits2Float(0x41000000), SkBits2Float(0x431e0000), SkBits2Float(0x3f3504f3));
194 path.close();
195 canvas->clipPath(path, true);
196 canvas->drawRect(SkRect::MakeWH(250, 250), paint);
197 }
198
test_mask_overflow()199 static void test_mask_overflow() {
200 SkPath path;
201 path.moveTo(SkBits2Float(0x43e28000), SkBits2Float(0x43aa8000)); // 453, 341
202 path.lineTo(SkBits2Float(0x43de6000), SkBits2Float(0x43aa8000)); // 444.75f, 341
203 // 440.47f, 341, 437, 344.47f, 437, 348.75f
204 path.cubicTo(SkBits2Float(0x43dc3c29), SkBits2Float(0x43aa8000),
205 SkBits2Float(0x43da8000), SkBits2Float(0x43ac3c29),
206 SkBits2Float(0x43da8000), SkBits2Float(0x43ae6000));
207 path.lineTo(SkBits2Float(0x43da8000), SkBits2Float(0x43b18000)); // 437, 355
208 path.lineTo(SkBits2Float(0x43e28000), SkBits2Float(0x43b18000)); // 453, 355
209 path.lineTo(SkBits2Float(0x43e28000), SkBits2Float(0x43aa8000)); // 453, 341
210 test_draw_AA_path(500, 500, path);
211 }
212
test_fuzz_crbug_668907()213 static void test_fuzz_crbug_668907() {
214 SkPath path;
215 path.moveTo(SkBits2Float(0x46313741), SkBits2Float(0x3b00e540)); // 11341.8f, 0.00196679f
216 path.quadTo(SkBits2Float(0x41410041), SkBits2Float(0xc1414141), SkBits2Float(0x41414141),
217 SkBits2Float(0x414100ff)); // 12.0626f, -12.0784f, 12.0784f, 12.0627f
218 path.lineTo(SkBits2Float(0x46313741), SkBits2Float(0x3b00e540)); // 11341.8f, 0.00196679f
219 path.close();
220 test_draw_AA_path(400, 500, path);
221 }
222
223 /**
224 * In debug mode, this path was causing an assertion to fail in
225 * SkPathStroker::preJoinTo() and, in Release, the use of an unitialized value.
226 */
make_path_crbugskia2820(SkPath * path,skiatest::Reporter * reporter)227 static void make_path_crbugskia2820(SkPath* path, skiatest::Reporter* reporter) {
228 SkPoint orig, p1, p2, p3;
229 orig = SkPoint::Make(1.f, 1.f);
230 p1 = SkPoint::Make(1.f - SK_ScalarNearlyZero, 1.f);
231 p2 = SkPoint::Make(1.f, 1.f + SK_ScalarNearlyZero);
232 p3 = SkPoint::Make(2.f, 2.f);
233
234 path->reset();
235 path->moveTo(orig);
236 path->cubicTo(p1, p2, p3);
237 path->close();
238 }
239
test_path_crbugskia2820(skiatest::Reporter * reporter)240 static void test_path_crbugskia2820(skiatest::Reporter* reporter) {//GrContext* context) {
241 SkPath path;
242 make_path_crbugskia2820(&path, reporter);
243
244 SkStrokeRec stroke(SkStrokeRec::kFill_InitStyle);
245 stroke.setStrokeStyle(2 * SK_Scalar1);
246 stroke.applyToPath(&path, path);
247 }
248
test_path_crbugskia5995()249 static void test_path_crbugskia5995() {
250 SkPath path;
251 path.moveTo(SkBits2Float(0x40303030), SkBits2Float(0x3e303030)); // 2.75294f, 0.172059f
252 path.quadTo(SkBits2Float(0x41d63030), SkBits2Float(0x30303030), SkBits2Float(0x41013030),
253 SkBits2Float(0x00000000)); // 26.7735f, 6.40969e-10f, 8.07426f, 0
254 path.moveTo(SkBits2Float(0x00000000), SkBits2Float(0x00000000)); // 0, 0
255 test_draw_AA_path(500, 500, path);
256 }
257
make_path0(SkPath * path)258 static void make_path0(SkPath* path) {
259 // from * https://code.google.com/p/skia/issues/detail?id=1706
260
261 path->moveTo(146.939f, 1012.84f);
262 path->lineTo(181.747f, 1009.18f);
263 path->lineTo(182.165f, 1013.16f);
264 path->lineTo(147.357f, 1016.82f);
265 path->lineTo(146.939f, 1012.84f);
266 path->close();
267 }
268
make_path1(SkPath * path)269 static void make_path1(SkPath* path) {
270 path->addRect(SkRect::MakeXYWH(10, 10, 10, 1));
271 }
272
273 typedef void (*PathProc)(SkPath*);
274
275 /*
276 * Regression test: we used to crash (overwrite internal storage) during
277 * construction of the region when the path was INVERSE. That is now fixed,
278 * so test these regions (which used to assert/crash).
279 *
280 * https://code.google.com/p/skia/issues/detail?id=1706
281 */
test_path_to_region(skiatest::Reporter * reporter)282 static void test_path_to_region(skiatest::Reporter* reporter) {
283 PathProc procs[] = {
284 make_path0,
285 make_path1,
286 };
287
288 SkRegion clip;
289 clip.setRect(0, 0, 1255, 1925);
290
291 for (size_t i = 0; i < SK_ARRAY_COUNT(procs); ++i) {
292 SkPath path;
293 procs[i](&path);
294
295 SkRegion rgn;
296 rgn.setPath(path, clip);
297 path.toggleInverseFillType();
298 rgn.setPath(path, clip);
299 }
300 }
301
302 #ifdef SK_BUILD_FOR_WIN
303 #define SUPPRESS_VISIBILITY_WARNING
304 #else
305 #define SUPPRESS_VISIBILITY_WARNING __attribute__((visibility("hidden")))
306 #endif
307
test_path_close_issue1474(skiatest::Reporter * reporter)308 static void test_path_close_issue1474(skiatest::Reporter* reporter) {
309 // This test checks that r{Line,Quad,Conic,Cubic}To following a close()
310 // are relative to the point we close to, not relative to the point we close from.
311 SkPath path;
312 SkPoint last;
313
314 // Test rLineTo().
315 path.rLineTo(0, 100);
316 path.rLineTo(100, 0);
317 path.close(); // Returns us back to 0,0.
318 path.rLineTo(50, 50); // This should go to 50,50.
319
320 path.getLastPt(&last);
321 REPORTER_ASSERT(reporter, 50 == last.fX);
322 REPORTER_ASSERT(reporter, 50 == last.fY);
323
324 // Test rQuadTo().
325 path.rewind();
326 path.rLineTo(0, 100);
327 path.rLineTo(100, 0);
328 path.close();
329 path.rQuadTo(50, 50, 75, 75);
330
331 path.getLastPt(&last);
332 REPORTER_ASSERT(reporter, 75 == last.fX);
333 REPORTER_ASSERT(reporter, 75 == last.fY);
334
335 // Test rConicTo().
336 path.rewind();
337 path.rLineTo(0, 100);
338 path.rLineTo(100, 0);
339 path.close();
340 path.rConicTo(50, 50, 85, 85, 2);
341
342 path.getLastPt(&last);
343 REPORTER_ASSERT(reporter, 85 == last.fX);
344 REPORTER_ASSERT(reporter, 85 == last.fY);
345
346 // Test rCubicTo().
347 path.rewind();
348 path.rLineTo(0, 100);
349 path.rLineTo(100, 0);
350 path.close();
351 path.rCubicTo(50, 50, 85, 85, 95, 95);
352
353 path.getLastPt(&last);
354 REPORTER_ASSERT(reporter, 95 == last.fX);
355 REPORTER_ASSERT(reporter, 95 == last.fY);
356 }
357
test_gen_id(skiatest::Reporter * reporter)358 static void test_gen_id(skiatest::Reporter* reporter) {
359 SkPath a, b;
360 REPORTER_ASSERT(reporter, a.getGenerationID() == b.getGenerationID());
361
362 a.moveTo(0, 0);
363 const uint32_t z = a.getGenerationID();
364 REPORTER_ASSERT(reporter, z != b.getGenerationID());
365
366 a.reset();
367 REPORTER_ASSERT(reporter, a.getGenerationID() == b.getGenerationID());
368
369 a.moveTo(1, 1);
370 const uint32_t y = a.getGenerationID();
371 REPORTER_ASSERT(reporter, z != y);
372
373 b.moveTo(2, 2);
374 const uint32_t x = b.getGenerationID();
375 REPORTER_ASSERT(reporter, x != y && x != z);
376
377 a.swap(b);
378 REPORTER_ASSERT(reporter, b.getGenerationID() == y && a.getGenerationID() == x);
379
380 b = a;
381 REPORTER_ASSERT(reporter, b.getGenerationID() == x);
382
383 SkPath c(a);
384 REPORTER_ASSERT(reporter, c.getGenerationID() == x);
385
386 c.lineTo(3, 3);
387 const uint32_t w = c.getGenerationID();
388 REPORTER_ASSERT(reporter, b.getGenerationID() == x);
389 REPORTER_ASSERT(reporter, a.getGenerationID() == x);
390 REPORTER_ASSERT(reporter, w != x);
391
392 #ifdef SK_BUILD_FOR_ANDROID_FRAMEWORK
393 static bool kExpectGenIDToIgnoreFill = false;
394 #else
395 static bool kExpectGenIDToIgnoreFill = true;
396 #endif
397
398 c.toggleInverseFillType();
399 const uint32_t v = c.getGenerationID();
400 REPORTER_ASSERT(reporter, (v == w) == kExpectGenIDToIgnoreFill);
401
402 c.rewind();
403 REPORTER_ASSERT(reporter, v != c.getGenerationID());
404 }
405
406 // This used to assert in the debug build, as the edges did not all line-up.
test_bad_cubic_crbug234190()407 static void test_bad_cubic_crbug234190() {
408 SkPath path;
409 path.moveTo(13.8509f, 3.16858f);
410 path.cubicTo(-2.35893e+08f, -4.21044e+08f,
411 -2.38991e+08f, -4.26573e+08f,
412 -2.41016e+08f, -4.30188e+08f);
413 test_draw_AA_path(84, 88, path);
414 }
415
test_bad_cubic_crbug229478()416 static void test_bad_cubic_crbug229478() {
417 const SkPoint pts[] = {
418 { 4595.91064f, -11596.9873f },
419 { 4597.2168f, -11595.9414f },
420 { 4598.52344f, -11594.8955f },
421 { 4599.83008f, -11593.8496f },
422 };
423
424 SkPath path;
425 path.moveTo(pts[0]);
426 path.cubicTo(pts[1], pts[2], pts[3]);
427
428 SkPaint paint;
429 paint.setStyle(SkPaint::kStroke_Style);
430 paint.setStrokeWidth(20);
431
432 SkPath dst;
433 // Before the fix, this would infinite-recurse, and run out of stack
434 // because we would keep trying to subdivide a degenerate cubic segment.
435 paint.getFillPath(path, &dst, nullptr);
436 }
437
build_path_170666(SkPath & path)438 static void build_path_170666(SkPath& path) {
439 path.moveTo(17.9459f, 21.6344f);
440 path.lineTo(139.545f, -47.8105f);
441 path.lineTo(139.545f, -47.8105f);
442 path.lineTo(131.07f, -47.3888f);
443 path.lineTo(131.07f, -47.3888f);
444 path.lineTo(122.586f, -46.9532f);
445 path.lineTo(122.586f, -46.9532f);
446 path.lineTo(18076.6f, 31390.9f);
447 path.lineTo(18076.6f, 31390.9f);
448 path.lineTo(18085.1f, 31390.5f);
449 path.lineTo(18085.1f, 31390.5f);
450 path.lineTo(18076.6f, 31390.9f);
451 path.lineTo(18076.6f, 31390.9f);
452 path.lineTo(17955, 31460.3f);
453 path.lineTo(17955, 31460.3f);
454 path.lineTo(17963.5f, 31459.9f);
455 path.lineTo(17963.5f, 31459.9f);
456 path.lineTo(17971.9f, 31459.5f);
457 path.lineTo(17971.9f, 31459.5f);
458 path.lineTo(17.9551f, 21.6205f);
459 path.lineTo(17.9551f, 21.6205f);
460 path.lineTo(9.47091f, 22.0561f);
461 path.lineTo(9.47091f, 22.0561f);
462 path.lineTo(17.9459f, 21.6344f);
463 path.lineTo(17.9459f, 21.6344f);
464 path.close();path.moveTo(0.995934f, 22.4779f);
465 path.lineTo(0.986725f, 22.4918f);
466 path.lineTo(0.986725f, 22.4918f);
467 path.lineTo(17955, 31460.4f);
468 path.lineTo(17955, 31460.4f);
469 path.lineTo(17971.9f, 31459.5f);
470 path.lineTo(17971.9f, 31459.5f);
471 path.lineTo(18093.6f, 31390.1f);
472 path.lineTo(18093.6f, 31390.1f);
473 path.lineTo(18093.6f, 31390);
474 path.lineTo(18093.6f, 31390);
475 path.lineTo(139.555f, -47.8244f);
476 path.lineTo(139.555f, -47.8244f);
477 path.lineTo(122.595f, -46.9671f);
478 path.lineTo(122.595f, -46.9671f);
479 path.lineTo(0.995934f, 22.4779f);
480 path.lineTo(0.995934f, 22.4779f);
481 path.close();
482 path.moveTo(5.43941f, 25.5223f);
483 path.lineTo(798267, -28871.1f);
484 path.lineTo(798267, -28871.1f);
485 path.lineTo(3.12512e+06f, -113102);
486 path.lineTo(3.12512e+06f, -113102);
487 path.cubicTo(5.16324e+06f, -186882, 8.15247e+06f, -295092, 1.1957e+07f, -432813);
488 path.cubicTo(1.95659e+07f, -708257, 3.04359e+07f, -1.10175e+06f, 4.34798e+07f, -1.57394e+06f);
489 path.cubicTo(6.95677e+07f, -2.51831e+06f, 1.04352e+08f, -3.77748e+06f, 1.39135e+08f, -5.03666e+06f);
490 path.cubicTo(1.73919e+08f, -6.29583e+06f, 2.08703e+08f, -7.555e+06f, 2.34791e+08f, -8.49938e+06f);
491 path.cubicTo(2.47835e+08f, -8.97157e+06f, 2.58705e+08f, -9.36506e+06f, 2.66314e+08f, -9.6405e+06f);
492 path.cubicTo(2.70118e+08f, -9.77823e+06f, 2.73108e+08f, -9.88644e+06f, 2.75146e+08f, -9.96022e+06f);
493 path.cubicTo(2.76165e+08f, -9.99711e+06f, 2.76946e+08f, -1.00254e+07f, 2.77473e+08f, -1.00444e+07f);
494 path.lineTo(2.78271e+08f, -1.00733e+07f);
495 path.lineTo(2.78271e+08f, -1.00733e+07f);
496 path.cubicTo(2.78271e+08f, -1.00733e+07f, 2.08703e+08f, -7.555e+06f, 135.238f, 23.3517f);
497 path.cubicTo(131.191f, 23.4981f, 125.995f, 23.7976f, 123.631f, 24.0206f);
498 path.cubicTo(121.267f, 24.2436f, 122.631f, 24.3056f, 126.677f, 24.1591f);
499 path.cubicTo(2.08703e+08f, -7.555e+06f, 2.78271e+08f, -1.00733e+07f, 2.78271e+08f, -1.00733e+07f);
500 path.lineTo(2.77473e+08f, -1.00444e+07f);
501 path.lineTo(2.77473e+08f, -1.00444e+07f);
502 path.cubicTo(2.76946e+08f, -1.00254e+07f, 2.76165e+08f, -9.99711e+06f, 2.75146e+08f, -9.96022e+06f);
503 path.cubicTo(2.73108e+08f, -9.88644e+06f, 2.70118e+08f, -9.77823e+06f, 2.66314e+08f, -9.6405e+06f);
504 path.cubicTo(2.58705e+08f, -9.36506e+06f, 2.47835e+08f, -8.97157e+06f, 2.34791e+08f, -8.49938e+06f);
505 path.cubicTo(2.08703e+08f, -7.555e+06f, 1.73919e+08f, -6.29583e+06f, 1.39135e+08f, -5.03666e+06f);
506 path.cubicTo(1.04352e+08f, -3.77749e+06f, 6.95677e+07f, -2.51831e+06f, 4.34798e+07f, -1.57394e+06f);
507 path.cubicTo(3.04359e+07f, -1.10175e+06f, 1.95659e+07f, -708258, 1.1957e+07f, -432814);
508 path.cubicTo(8.15248e+06f, -295092, 5.16324e+06f, -186883, 3.12513e+06f, -113103);
509 path.lineTo(798284, -28872);
510 path.lineTo(798284, -28872);
511 path.lineTo(22.4044f, 24.6677f);
512 path.lineTo(22.4044f, 24.6677f);
513 path.cubicTo(22.5186f, 24.5432f, 18.8134f, 24.6337f, 14.1287f, 24.8697f);
514 path.cubicTo(9.4439f, 25.1057f, 5.55359f, 25.3978f, 5.43941f, 25.5223f);
515 path.close();
516 }
517
build_path_simple_170666(SkPath & path)518 static void build_path_simple_170666(SkPath& path) {
519 path.moveTo(126.677f, 24.1591f);
520 path.cubicTo(2.08703e+08f, -7.555e+06f, 2.78271e+08f, -1.00733e+07f, 2.78271e+08f, -1.00733e+07f);
521 }
522
523 // This used to assert in the SK_DEBUG build, as the clip step would fail with
524 // too-few interations in our cubic-line intersection code. That code now runs
525 // 24 interations (instead of 16).
test_crbug_170666()526 static void test_crbug_170666() {
527 SkPath path;
528 build_path_simple_170666(path);
529 test_draw_AA_path(1000, 1000, path);
530
531 build_path_170666(path);
532 test_draw_AA_path(1000, 1000, path);
533 }
534
535
test_tiny_path_convexity(skiatest::Reporter * reporter,const char * pathBug,SkScalar tx,SkScalar ty,SkScalar scale)536 static void test_tiny_path_convexity(skiatest::Reporter* reporter, const char* pathBug,
537 SkScalar tx, SkScalar ty, SkScalar scale) {
538 SkPath smallPath;
539 SkAssertResult(SkParsePath::FromSVGString(pathBug, &smallPath));
540 bool smallConvex = smallPath.isConvex();
541 SkPath largePath;
542 SkAssertResult(SkParsePath::FromSVGString(pathBug, &largePath));
543 SkMatrix matrix;
544 matrix.reset();
545 matrix.preTranslate(100, 100);
546 matrix.preScale(scale, scale);
547 largePath.transform(matrix);
548 bool largeConvex = largePath.isConvex();
549 REPORTER_ASSERT(reporter, smallConvex == largeConvex);
550 }
551
test_crbug_493450(skiatest::Reporter * reporter)552 static void test_crbug_493450(skiatest::Reporter* reporter) {
553 const char reducedCase[] =
554 "M0,0"
555 "L0.0002, 0"
556 "L0.0002, 0.0002"
557 "L0.0001, 0.0001"
558 "L0,0.0002"
559 "Z";
560 test_tiny_path_convexity(reporter, reducedCase, 100, 100, 100000);
561 const char originalFiddleData[] =
562 "M-0.3383152268862998,-0.11217565719203619L-0.33846085183212765,-0.11212264406895281"
563 "L-0.338509393480737,-0.11210607966681395L-0.33857792286700894,-0.1121889121487573"
564 "L-0.3383866116636664,-0.11228834570924921L-0.33842087635680235,-0.11246078673250548"
565 "L-0.33809536177201055,-0.11245415228342878L-0.33797257995493996,-0.11216571641452182"
566 "L-0.33802112160354925,-0.11201996164188659L-0.33819815585141844,-0.11218559834671019Z";
567 test_tiny_path_convexity(reporter, originalFiddleData, 280081.4116670522f, 93268.04618493588f,
568 826357.3384828606f);
569 }
570
test_crbug_495894(skiatest::Reporter * reporter)571 static void test_crbug_495894(skiatest::Reporter* reporter) {
572 const char originalFiddleData[] =
573 "M-0.34004273849857214,-0.11332803232216355L-0.34008271397389744,-0.11324483772714951"
574 "L-0.3401940742265893,-0.11324483772714951L-0.34017694188002134,-0.11329807920275889"
575 "L-0.3402026403998733,-0.11333468903941245L-0.34029972369709194,-0.11334134592705701"
576 "L-0.3403054344792813,-0.11344121970007795L-0.3403140006525653,-0.11351115418399343"
577 "L-0.34024261587519866,-0.11353446986281181L-0.3402197727464413,-0.11360442946144192"
578 "L-0.34013696640469604,-0.11359110237029302L-0.34009128014718143,-0.1135877707043939"
579 "L-0.3400598708451401,-0.11360776134112742L-0.34004273849857214,-0.11355112520064405"
580 "L-0.3400113291965308,-0.11355112520064405L-0.3399970522410575,-0.11359110237029302"
581 "L-0.33997135372120546,-0.11355112520064405L-0.3399627875479215,-0.11353780084493197"
582 "L-0.3399485105924481,-0.11350782354357004L-0.3400027630232468,-0.11346452910331437"
583 "L-0.3399485105924481,-0.11340126558629839L-0.33993994441916414,-0.11340126558629839"
584 "L-0.33988283659727087,-0.11331804756574679L-0.33989140277055485,-0.11324483772714951"
585 "L-0.33997991989448945,-0.11324483772714951L-0.3399856306766788,-0.11324483772714951"
586 "L-0.34002560615200417,-0.11334467443478255ZM-0.3400684370184241,-0.11338461985124307"
587 "L-0.340154098751264,-0.11341791238732665L-0.340162664924548,-0.1134378899559977"
588 "L-0.34017979727111597,-0.11340126558629839L-0.3401655203156427,-0.11338129083212668"
589 "L-0.34012268944922275,-0.11332137577529414L-0.34007414780061346,-0.11334467443478255Z"
590 "M-0.3400027630232468,-0.11290567901106024L-0.3400113291965308,-0.11298876531245433"
591 "L-0.33997991989448945,-0.11301535852306784L-0.33990282433493346,-0.11296217481488612"
592 "L-0.33993994441916414,-0.11288906492739594Z";
593 test_tiny_path_convexity(reporter, originalFiddleData, 22682.240000000005f,7819.72220766405f,
594 65536);
595 }
596
test_crbug_613918()597 static void test_crbug_613918() {
598 SkPath path;
599 path.conicTo(-6.62478e-08f, 4.13885e-08f, -6.36935e-08f, 3.97927e-08f, 0.729058f);
600 path.quadTo(2.28206e-09f, -1.42572e-09f, 3.91919e-09f, -2.44852e-09f);
601 path.cubicTo(-16752.2f, -26792.9f, -21.4673f, 10.9347f, -8.57322f, -7.22739f);
602
603 // This call could lead to an assert or uninitialized read due to a failure
604 // to check the return value from SkCubicClipper::ChopMonoAtY.
605 path.contains(-1.84817e-08f, 1.15465e-08f);
606 }
607
test_addrect(skiatest::Reporter * reporter)608 static void test_addrect(skiatest::Reporter* reporter) {
609 SkPath path;
610 path.lineTo(0, 0);
611 path.addRect(SkRect::MakeWH(50, 100));
612 REPORTER_ASSERT(reporter, path.isRect(nullptr));
613
614 path.reset();
615 path.lineTo(FLT_EPSILON, FLT_EPSILON);
616 path.addRect(SkRect::MakeWH(50, 100));
617 REPORTER_ASSERT(reporter, !path.isRect(nullptr));
618
619 path.reset();
620 path.quadTo(0, 0, 0, 0);
621 path.addRect(SkRect::MakeWH(50, 100));
622 REPORTER_ASSERT(reporter, !path.isRect(nullptr));
623
624 path.reset();
625 path.conicTo(0, 0, 0, 0, 0.5f);
626 path.addRect(SkRect::MakeWH(50, 100));
627 REPORTER_ASSERT(reporter, !path.isRect(nullptr));
628
629 path.reset();
630 path.cubicTo(0, 0, 0, 0, 0, 0);
631 path.addRect(SkRect::MakeWH(50, 100));
632 REPORTER_ASSERT(reporter, !path.isRect(nullptr));
633 }
634
635 // Make sure we stay non-finite once we get there (unless we reset or rewind).
test_addrect_isfinite(skiatest::Reporter * reporter)636 static void test_addrect_isfinite(skiatest::Reporter* reporter) {
637 SkPath path;
638
639 path.addRect(SkRect::MakeWH(50, 100));
640 REPORTER_ASSERT(reporter, path.isFinite());
641
642 path.moveTo(0, 0);
643 path.lineTo(SK_ScalarInfinity, 42);
644 REPORTER_ASSERT(reporter, !path.isFinite());
645
646 path.addRect(SkRect::MakeWH(50, 100));
647 REPORTER_ASSERT(reporter, !path.isFinite());
648
649 path.reset();
650 REPORTER_ASSERT(reporter, path.isFinite());
651
652 path.addRect(SkRect::MakeWH(50, 100));
653 REPORTER_ASSERT(reporter, path.isFinite());
654 }
655
build_big_path(SkPath * path,bool reducedCase)656 static void build_big_path(SkPath* path, bool reducedCase) {
657 if (reducedCase) {
658 path->moveTo(577330, 1971.72f);
659 path->cubicTo(10.7082f, -116.596f, 262.057f, 45.6468f, 294.694f, 1.96237f);
660 } else {
661 path->moveTo(60.1631f, 7.70567f);
662 path->quadTo(60.1631f, 7.70567f, 0.99474f, 0.901199f);
663 path->lineTo(577379, 1977.77f);
664 path->quadTo(577364, 1979.57f, 577325, 1980.26f);
665 path->quadTo(577286, 1980.95f, 577245, 1980.13f);
666 path->quadTo(577205, 1979.3f, 577187, 1977.45f);
667 path->quadTo(577168, 1975.6f, 577183, 1973.8f);
668 path->quadTo(577198, 1972, 577238, 1971.31f);
669 path->quadTo(577277, 1970.62f, 577317, 1971.45f);
670 path->quadTo(577330, 1971.72f, 577341, 1972.11f);
671 path->cubicTo(10.7082f, -116.596f, 262.057f, 45.6468f, 294.694f, 1.96237f);
672 path->moveTo(306.718f, -32.912f);
673 path->cubicTo(30.531f, 10.0005f, 1502.47f, 13.2804f, 84.3088f, 9.99601f);
674 }
675 }
676
test_clipped_cubic()677 static void test_clipped_cubic() {
678 auto surface(SkSurface::MakeRasterN32Premul(640, 480));
679
680 // This path used to assert, because our cubic-chopping code incorrectly
681 // moved control points after the chop. This test should be run in SK_DEBUG
682 // mode to ensure that we no long assert.
683 SkPath path;
684 for (int doReducedCase = 0; doReducedCase <= 1; ++doReducedCase) {
685 build_big_path(&path, SkToBool(doReducedCase));
686
687 SkPaint paint;
688 for (int doAA = 0; doAA <= 1; ++doAA) {
689 paint.setAntiAlias(SkToBool(doAA));
690 surface->getCanvas()->drawPath(path, paint);
691 }
692 }
693 }
694
dump_if_ne(skiatest::Reporter * reporter,const SkRect & expected,const SkRect & bounds)695 static void dump_if_ne(skiatest::Reporter* reporter, const SkRect& expected, const SkRect& bounds) {
696 if (expected != bounds) {
697 ERRORF(reporter, "path.getBounds() returned [%g %g %g %g], but expected [%g %g %g %g]",
698 bounds.left(), bounds.top(), bounds.right(), bounds.bottom(),
699 expected.left(), expected.top(), expected.right(), expected.bottom());
700 }
701 }
702
test_bounds_crbug_513799(skiatest::Reporter * reporter)703 static void test_bounds_crbug_513799(skiatest::Reporter* reporter) {
704 SkPath path;
705 #if 0
706 // As written these tests were failing on LLVM 4.2 MacMini Release mysteriously, so we've
707 // rewritten them to avoid this (compiler-bug?).
708 REPORTER_ASSERT(reporter, SkRect::MakeLTRB(0, 0, 0, 0) == path.getBounds());
709
710 path.moveTo(-5, -8);
711 REPORTER_ASSERT(reporter, SkRect::MakeLTRB(-5, -8, -5, -8) == path.getBounds());
712
713 path.addRect(SkRect::MakeLTRB(1, 2, 3, 4));
714 REPORTER_ASSERT(reporter, SkRect::MakeLTRB(-5, -8, 3, 4) == path.getBounds());
715
716 path.moveTo(1, 2);
717 REPORTER_ASSERT(reporter, SkRect::MakeLTRB(-5, -8, 3, 4) == path.getBounds());
718 #else
719 dump_if_ne(reporter, SkRect::MakeLTRB(0, 0, 0, 0), path.getBounds());
720
721 path.moveTo(-5, -8); // should set the bounds
722 dump_if_ne(reporter, SkRect::MakeLTRB(-5, -8, -5, -8), path.getBounds());
723
724 path.addRect(SkRect::MakeLTRB(1, 2, 3, 4)); // should extend the bounds
725 dump_if_ne(reporter, SkRect::MakeLTRB(-5, -8, 3, 4), path.getBounds());
726
727 path.moveTo(1, 2); // don't expect this to have changed the bounds
728 dump_if_ne(reporter, SkRect::MakeLTRB(-5, -8, 3, 4), path.getBounds());
729 #endif
730 }
731
732 #include "SkSurface.h"
test_fuzz_crbug_627414(skiatest::Reporter * reporter)733 static void test_fuzz_crbug_627414(skiatest::Reporter* reporter) {
734 SkPath path;
735 path.moveTo(0, 0);
736 path.conicTo(3.58732e-43f, 2.72084f, 3.00392f, 3.00392f, 8.46e+37f);
737 test_draw_AA_path(100, 100, path);
738 }
739
740 // Inspired by http://ie.microsoft.com/testdrive/Performance/Chalkboard/
741 // which triggered an assert, from a tricky cubic. This test replicates that
742 // example, so we can ensure that we handle it (in SkEdge.cpp), and don't
743 // assert in the SK_DEBUG build.
test_tricky_cubic()744 static void test_tricky_cubic() {
745 const SkPoint pts[] = {
746 { SkDoubleToScalar(18.8943768), SkDoubleToScalar(129.121277) },
747 { SkDoubleToScalar(18.8937435), SkDoubleToScalar(129.121689) },
748 { SkDoubleToScalar(18.8950119), SkDoubleToScalar(129.120422) },
749 { SkDoubleToScalar(18.5030727), SkDoubleToScalar(129.13121) },
750 };
751
752 SkPath path;
753 path.moveTo(pts[0]);
754 path.cubicTo(pts[1], pts[2], pts[3]);
755 test_draw_AA_path(19, 130, path);
756 }
757
758 // Inspired by http://code.google.com/p/chromium/issues/detail?id=141651
759 //
test_isfinite_after_transform(skiatest::Reporter * reporter)760 static void test_isfinite_after_transform(skiatest::Reporter* reporter) {
761 SkPath path;
762 path.quadTo(157, 366, 286, 208);
763 path.arcTo(37, 442, 315, 163, 957494590897113.0f);
764
765 SkMatrix matrix;
766 matrix.setScale(1000*1000, 1000*1000);
767
768 // Be sure that path::transform correctly updates isFinite and the bounds
769 // if the transformation overflows. The previous bug was that isFinite was
770 // set to true in this case, but the bounds were not set to empty (which
771 // they should be).
772 while (path.isFinite()) {
773 REPORTER_ASSERT(reporter, path.getBounds().isFinite());
774 REPORTER_ASSERT(reporter, !path.getBounds().isEmpty());
775 path.transform(matrix);
776 }
777 REPORTER_ASSERT(reporter, path.getBounds().isEmpty());
778
779 matrix.setTranslate(SK_Scalar1, SK_Scalar1);
780 path.transform(matrix);
781 // we need to still be non-finite
782 REPORTER_ASSERT(reporter, !path.isFinite());
783 REPORTER_ASSERT(reporter, path.getBounds().isEmpty());
784 }
785
add_corner_arc(SkPath * path,const SkRect & rect,SkScalar xIn,SkScalar yIn,int startAngle)786 static void add_corner_arc(SkPath* path, const SkRect& rect,
787 SkScalar xIn, SkScalar yIn,
788 int startAngle)
789 {
790
791 SkScalar rx = SkMinScalar(rect.width(), xIn);
792 SkScalar ry = SkMinScalar(rect.height(), yIn);
793
794 SkRect arcRect;
795 arcRect.set(-rx, -ry, rx, ry);
796 switch (startAngle) {
797 case 0:
798 arcRect.offset(rect.fRight - arcRect.fRight, rect.fBottom - arcRect.fBottom);
799 break;
800 case 90:
801 arcRect.offset(rect.fLeft - arcRect.fLeft, rect.fBottom - arcRect.fBottom);
802 break;
803 case 180:
804 arcRect.offset(rect.fLeft - arcRect.fLeft, rect.fTop - arcRect.fTop);
805 break;
806 case 270:
807 arcRect.offset(rect.fRight - arcRect.fRight, rect.fTop - arcRect.fTop);
808 break;
809 default:
810 break;
811 }
812
813 path->arcTo(arcRect, SkIntToScalar(startAngle), SkIntToScalar(90), false);
814 }
815
make_arb_round_rect(SkPath * path,const SkRect & r,SkScalar xCorner,SkScalar yCorner)816 static void make_arb_round_rect(SkPath* path, const SkRect& r,
817 SkScalar xCorner, SkScalar yCorner) {
818 // we are lazy here and use the same x & y for each corner
819 add_corner_arc(path, r, xCorner, yCorner, 270);
820 add_corner_arc(path, r, xCorner, yCorner, 0);
821 add_corner_arc(path, r, xCorner, yCorner, 90);
822 add_corner_arc(path, r, xCorner, yCorner, 180);
823 path->close();
824 }
825
826 // Chrome creates its own round rects with each corner possibly being different.
827 // Performance will suffer if they are not convex.
828 // Note: PathBench::ArbRoundRectBench performs almost exactly
829 // the same test (but with drawing)
test_arb_round_rect_is_convex(skiatest::Reporter * reporter)830 static void test_arb_round_rect_is_convex(skiatest::Reporter* reporter) {
831 SkRandom rand;
832 SkRect r;
833
834 for (int i = 0; i < 5000; ++i) {
835
836 SkScalar size = rand.nextUScalar1() * 30;
837 if (size < SK_Scalar1) {
838 continue;
839 }
840 r.fLeft = rand.nextUScalar1() * 300;
841 r.fTop = rand.nextUScalar1() * 300;
842 r.fRight = r.fLeft + 2 * size;
843 r.fBottom = r.fTop + 2 * size;
844
845 SkPath temp;
846
847 make_arb_round_rect(&temp, r, r.width() / 10, r.height() / 15);
848
849 REPORTER_ASSERT(reporter, temp.isConvex());
850 }
851 }
852
853 // Chrome will sometimes create a 0 radius round rect. The degenerate
854 // quads prevent the path from being converted to a rect
855 // Note: PathBench::ArbRoundRectBench performs almost exactly
856 // the same test (but with drawing)
test_arb_zero_rad_round_rect_is_rect(skiatest::Reporter * reporter)857 static void test_arb_zero_rad_round_rect_is_rect(skiatest::Reporter* reporter) {
858 SkRandom rand;
859 SkRect r;
860
861 for (int i = 0; i < 5000; ++i) {
862
863 SkScalar size = rand.nextUScalar1() * 30;
864 if (size < SK_Scalar1) {
865 continue;
866 }
867 r.fLeft = rand.nextUScalar1() * 300;
868 r.fTop = rand.nextUScalar1() * 300;
869 r.fRight = r.fLeft + 2 * size;
870 r.fBottom = r.fTop + 2 * size;
871
872 SkPath temp;
873
874 make_arb_round_rect(&temp, r, 0, 0);
875
876 SkRect result;
877 REPORTER_ASSERT(reporter, temp.isRect(&result));
878 REPORTER_ASSERT(reporter, r == result);
879 }
880 }
881
test_rect_isfinite(skiatest::Reporter * reporter)882 static void test_rect_isfinite(skiatest::Reporter* reporter) {
883 const SkScalar inf = SK_ScalarInfinity;
884 const SkScalar negInf = SK_ScalarNegativeInfinity;
885 const SkScalar nan = SK_ScalarNaN;
886
887 SkRect r;
888 r.setEmpty();
889 REPORTER_ASSERT(reporter, r.isFinite());
890 r.set(0, 0, inf, negInf);
891 REPORTER_ASSERT(reporter, !r.isFinite());
892 r.set(0, 0, nan, 0);
893 REPORTER_ASSERT(reporter, !r.isFinite());
894
895 SkPoint pts[] = {
896 { 0, 0 },
897 { SK_Scalar1, 0 },
898 { 0, SK_Scalar1 },
899 };
900
901 bool isFine = r.setBoundsCheck(pts, 3);
902 REPORTER_ASSERT(reporter, isFine);
903 REPORTER_ASSERT(reporter, !r.isEmpty());
904
905 pts[1].set(inf, 0);
906 isFine = r.setBoundsCheck(pts, 3);
907 REPORTER_ASSERT(reporter, !isFine);
908 REPORTER_ASSERT(reporter, r.isEmpty());
909
910 pts[1].set(nan, 0);
911 isFine = r.setBoundsCheck(pts, 3);
912 REPORTER_ASSERT(reporter, !isFine);
913 REPORTER_ASSERT(reporter, r.isEmpty());
914 }
915
test_path_isfinite(skiatest::Reporter * reporter)916 static void test_path_isfinite(skiatest::Reporter* reporter) {
917 const SkScalar inf = SK_ScalarInfinity;
918 const SkScalar negInf = SK_ScalarNegativeInfinity;
919 const SkScalar nan = SK_ScalarNaN;
920
921 SkPath path;
922 REPORTER_ASSERT(reporter, path.isFinite());
923
924 path.reset();
925 REPORTER_ASSERT(reporter, path.isFinite());
926
927 path.reset();
928 path.moveTo(SK_Scalar1, 0);
929 REPORTER_ASSERT(reporter, path.isFinite());
930
931 path.reset();
932 path.moveTo(inf, negInf);
933 REPORTER_ASSERT(reporter, !path.isFinite());
934
935 path.reset();
936 path.moveTo(nan, 0);
937 REPORTER_ASSERT(reporter, !path.isFinite());
938 }
939
test_isfinite(skiatest::Reporter * reporter)940 static void test_isfinite(skiatest::Reporter* reporter) {
941 test_rect_isfinite(reporter);
942 test_path_isfinite(reporter);
943 }
944
test_islastcontourclosed(skiatest::Reporter * reporter)945 static void test_islastcontourclosed(skiatest::Reporter* reporter) {
946 SkPath path;
947 REPORTER_ASSERT(reporter, !path.isLastContourClosed());
948 path.moveTo(0, 0);
949 REPORTER_ASSERT(reporter, !path.isLastContourClosed());
950 path.close();
951 REPORTER_ASSERT(reporter, path.isLastContourClosed());
952 path.lineTo(100, 100);
953 REPORTER_ASSERT(reporter, !path.isLastContourClosed());
954 path.moveTo(200, 200);
955 REPORTER_ASSERT(reporter, !path.isLastContourClosed());
956 path.close();
957 REPORTER_ASSERT(reporter, path.isLastContourClosed());
958 path.moveTo(0, 0);
959 REPORTER_ASSERT(reporter, !path.isLastContourClosed());
960 }
961
962 // assert that we always
963 // start with a moveTo
964 // only have 1 moveTo
965 // only have Lines after that
966 // end with a single close
967 // only have (at most) 1 close
968 //
test_poly(skiatest::Reporter * reporter,const SkPath & path,const SkPoint srcPts[],bool expectClose)969 static void test_poly(skiatest::Reporter* reporter, const SkPath& path,
970 const SkPoint srcPts[], bool expectClose) {
971 SkPath::RawIter iter(path);
972 SkPoint pts[4];
973
974 bool firstTime = true;
975 bool foundClose = false;
976 for (;;) {
977 switch (iter.next(pts)) {
978 case SkPath::kMove_Verb:
979 REPORTER_ASSERT(reporter, firstTime);
980 REPORTER_ASSERT(reporter, pts[0] == srcPts[0]);
981 srcPts++;
982 firstTime = false;
983 break;
984 case SkPath::kLine_Verb:
985 REPORTER_ASSERT(reporter, !firstTime);
986 REPORTER_ASSERT(reporter, pts[1] == srcPts[0]);
987 srcPts++;
988 break;
989 case SkPath::kQuad_Verb:
990 REPORTER_ASSERT(reporter, false, "unexpected quad verb");
991 break;
992 case SkPath::kConic_Verb:
993 REPORTER_ASSERT(reporter, false, "unexpected conic verb");
994 break;
995 case SkPath::kCubic_Verb:
996 REPORTER_ASSERT(reporter, false, "unexpected cubic verb");
997 break;
998 case SkPath::kClose_Verb:
999 REPORTER_ASSERT(reporter, !firstTime);
1000 REPORTER_ASSERT(reporter, !foundClose);
1001 REPORTER_ASSERT(reporter, expectClose);
1002 foundClose = true;
1003 break;
1004 case SkPath::kDone_Verb:
1005 goto DONE;
1006 }
1007 }
1008 DONE:
1009 REPORTER_ASSERT(reporter, foundClose == expectClose);
1010 }
1011
test_addPoly(skiatest::Reporter * reporter)1012 static void test_addPoly(skiatest::Reporter* reporter) {
1013 SkPoint pts[32];
1014 SkRandom rand;
1015
1016 for (size_t i = 0; i < SK_ARRAY_COUNT(pts); ++i) {
1017 pts[i].fX = rand.nextSScalar1();
1018 pts[i].fY = rand.nextSScalar1();
1019 }
1020
1021 for (int doClose = 0; doClose <= 1; ++doClose) {
1022 for (size_t count = 1; count <= SK_ARRAY_COUNT(pts); ++count) {
1023 SkPath path;
1024 path.addPoly(pts, SkToInt(count), SkToBool(doClose));
1025 test_poly(reporter, path, pts, SkToBool(doClose));
1026 }
1027 }
1028 }
1029
test_strokerec(skiatest::Reporter * reporter)1030 static void test_strokerec(skiatest::Reporter* reporter) {
1031 SkStrokeRec rec(SkStrokeRec::kFill_InitStyle);
1032 REPORTER_ASSERT(reporter, rec.isFillStyle());
1033
1034 rec.setHairlineStyle();
1035 REPORTER_ASSERT(reporter, rec.isHairlineStyle());
1036
1037 rec.setStrokeStyle(SK_Scalar1, false);
1038 REPORTER_ASSERT(reporter, SkStrokeRec::kStroke_Style == rec.getStyle());
1039
1040 rec.setStrokeStyle(SK_Scalar1, true);
1041 REPORTER_ASSERT(reporter, SkStrokeRec::kStrokeAndFill_Style == rec.getStyle());
1042
1043 rec.setStrokeStyle(0, false);
1044 REPORTER_ASSERT(reporter, SkStrokeRec::kHairline_Style == rec.getStyle());
1045
1046 rec.setStrokeStyle(0, true);
1047 REPORTER_ASSERT(reporter, SkStrokeRec::kFill_Style == rec.getStyle());
1048 }
1049
1050 // Set this for paths that don't have a consistent direction such as a bowtie.
1051 // (cheapComputeDirection is not expected to catch these.)
1052 const SkPathPriv::FirstDirection kDontCheckDir = static_cast<SkPathPriv::FirstDirection>(-1);
1053
check_direction(skiatest::Reporter * reporter,const SkPath & path,SkPathPriv::FirstDirection expected)1054 static void check_direction(skiatest::Reporter* reporter, const SkPath& path,
1055 SkPathPriv::FirstDirection expected) {
1056 if (expected == kDontCheckDir) {
1057 return;
1058 }
1059 SkPath copy(path); // we make a copy so that we don't cache the result on the passed in path.
1060
1061 SkPathPriv::FirstDirection dir;
1062 if (SkPathPriv::CheapComputeFirstDirection(copy, &dir)) {
1063 REPORTER_ASSERT(reporter, dir == expected);
1064 } else {
1065 REPORTER_ASSERT(reporter, SkPathPriv::kUnknown_FirstDirection == expected);
1066 }
1067 }
1068
test_direction(skiatest::Reporter * reporter)1069 static void test_direction(skiatest::Reporter* reporter) {
1070 size_t i;
1071 SkPath path;
1072 REPORTER_ASSERT(reporter, !SkPathPriv::CheapComputeFirstDirection(path, nullptr));
1073 REPORTER_ASSERT(reporter, !SkPathPriv::CheapIsFirstDirection(path, SkPathPriv::kCW_FirstDirection));
1074 REPORTER_ASSERT(reporter, !SkPathPriv::CheapIsFirstDirection(path, SkPathPriv::kCCW_FirstDirection));
1075 REPORTER_ASSERT(reporter, SkPathPriv::CheapIsFirstDirection(path, SkPathPriv::kUnknown_FirstDirection));
1076
1077 static const char* gDegen[] = {
1078 "M 10 10",
1079 "M 10 10 M 20 20",
1080 "M 10 10 L 20 20",
1081 "M 10 10 L 10 10 L 10 10",
1082 "M 10 10 Q 10 10 10 10",
1083 "M 10 10 C 10 10 10 10 10 10",
1084 };
1085 for (i = 0; i < SK_ARRAY_COUNT(gDegen); ++i) {
1086 path.reset();
1087 bool valid = SkParsePath::FromSVGString(gDegen[i], &path);
1088 REPORTER_ASSERT(reporter, valid);
1089 REPORTER_ASSERT(reporter, !SkPathPriv::CheapComputeFirstDirection(path, nullptr));
1090 }
1091
1092 static const char* gCW[] = {
1093 "M 10 10 L 10 10 Q 20 10 20 20",
1094 "M 10 10 C 20 10 20 20 20 20",
1095 "M 20 10 Q 20 20 30 20 L 10 20", // test double-back at y-max
1096 // rect with top two corners replaced by cubics with identical middle
1097 // control points
1098 "M 10 10 C 10 0 10 0 20 0 L 40 0 C 50 0 50 0 50 10",
1099 "M 20 10 L 0 10 Q 10 10 20 0", // left, degenerate serif
1100 };
1101 for (i = 0; i < SK_ARRAY_COUNT(gCW); ++i) {
1102 path.reset();
1103 bool valid = SkParsePath::FromSVGString(gCW[i], &path);
1104 REPORTER_ASSERT(reporter, valid);
1105 check_direction(reporter, path, SkPathPriv::kCW_FirstDirection);
1106 }
1107
1108 static const char* gCCW[] = {
1109 "M 10 10 L 10 10 Q 20 10 20 -20",
1110 "M 10 10 C 20 10 20 -20 20 -20",
1111 "M 20 10 Q 20 20 10 20 L 30 20", // test double-back at y-max
1112 // rect with top two corners replaced by cubics with identical middle
1113 // control points
1114 "M 50 10 C 50 0 50 0 40 0 L 20 0 C 10 0 10 0 10 10",
1115 "M 10 10 L 30 10 Q 20 10 10 0", // right, degenerate serif
1116 };
1117 for (i = 0; i < SK_ARRAY_COUNT(gCCW); ++i) {
1118 path.reset();
1119 bool valid = SkParsePath::FromSVGString(gCCW[i], &path);
1120 REPORTER_ASSERT(reporter, valid);
1121 check_direction(reporter, path, SkPathPriv::kCCW_FirstDirection);
1122 }
1123
1124 // Test two donuts, each wound a different direction. Only the outer contour
1125 // determines the cheap direction
1126 path.reset();
1127 path.addCircle(0, 0, SkIntToScalar(2), SkPath::kCW_Direction);
1128 path.addCircle(0, 0, SkIntToScalar(1), SkPath::kCCW_Direction);
1129 check_direction(reporter, path, SkPathPriv::kCW_FirstDirection);
1130
1131 path.reset();
1132 path.addCircle(0, 0, SkIntToScalar(1), SkPath::kCW_Direction);
1133 path.addCircle(0, 0, SkIntToScalar(2), SkPath::kCCW_Direction);
1134 check_direction(reporter, path, SkPathPriv::kCCW_FirstDirection);
1135
1136 // triangle with one point really far from the origin.
1137 path.reset();
1138 // the first point is roughly 1.05e10, 1.05e10
1139 path.moveTo(SkBits2Float(0x501c7652), SkBits2Float(0x501c7652));
1140 path.lineTo(110 * SK_Scalar1, -10 * SK_Scalar1);
1141 path.lineTo(-10 * SK_Scalar1, 60 * SK_Scalar1);
1142 check_direction(reporter, path, SkPathPriv::kCCW_FirstDirection);
1143
1144 path.reset();
1145 path.conicTo(20, 0, 20, 20, 0.5f);
1146 path.close();
1147 check_direction(reporter, path, SkPathPriv::kCW_FirstDirection);
1148
1149 path.reset();
1150 path.lineTo(1, 1e7f);
1151 path.lineTo(1e7f, 2e7f);
1152 path.close();
1153 REPORTER_ASSERT(reporter, SkPath::kConvex_Convexity == path.getConvexity());
1154 check_direction(reporter, path, SkPathPriv::kCCW_FirstDirection);
1155 }
1156
add_rect(SkPath * path,const SkRect & r)1157 static void add_rect(SkPath* path, const SkRect& r) {
1158 path->moveTo(r.fLeft, r.fTop);
1159 path->lineTo(r.fRight, r.fTop);
1160 path->lineTo(r.fRight, r.fBottom);
1161 path->lineTo(r.fLeft, r.fBottom);
1162 path->close();
1163 }
1164
test_bounds(skiatest::Reporter * reporter)1165 static void test_bounds(skiatest::Reporter* reporter) {
1166 static const SkRect rects[] = {
1167 { SkIntToScalar(10), SkIntToScalar(160), SkIntToScalar(610), SkIntToScalar(160) },
1168 { SkIntToScalar(610), SkIntToScalar(160), SkIntToScalar(610), SkIntToScalar(199) },
1169 { SkIntToScalar(10), SkIntToScalar(198), SkIntToScalar(610), SkIntToScalar(199) },
1170 { SkIntToScalar(10), SkIntToScalar(160), SkIntToScalar(10), SkIntToScalar(199) },
1171 };
1172
1173 SkPath path0, path1;
1174 for (size_t i = 0; i < SK_ARRAY_COUNT(rects); ++i) {
1175 path0.addRect(rects[i]);
1176 add_rect(&path1, rects[i]);
1177 }
1178
1179 REPORTER_ASSERT(reporter, path0.getBounds() == path1.getBounds());
1180 }
1181
stroke_cubic(const SkPoint pts[4])1182 static void stroke_cubic(const SkPoint pts[4]) {
1183 SkPath path;
1184 path.moveTo(pts[0]);
1185 path.cubicTo(pts[1], pts[2], pts[3]);
1186
1187 SkPaint paint;
1188 paint.setStyle(SkPaint::kStroke_Style);
1189 paint.setStrokeWidth(SK_Scalar1 * 2);
1190
1191 SkPath fill;
1192 paint.getFillPath(path, &fill);
1193 }
1194
1195 // just ensure this can run w/o any SkASSERTS firing in the debug build
1196 // we used to assert due to differences in how we determine a degenerate vector
1197 // but that was fixed with the introduction of SkPoint::CanNormalize
stroke_tiny_cubic()1198 static void stroke_tiny_cubic() {
1199 SkPoint p0[] = {
1200 { 372.0f, 92.0f },
1201 { 372.0f, 92.0f },
1202 { 372.0f, 92.0f },
1203 { 372.0f, 92.0f },
1204 };
1205
1206 stroke_cubic(p0);
1207
1208 SkPoint p1[] = {
1209 { 372.0f, 92.0f },
1210 { 372.0007f, 92.000755f },
1211 { 371.99927f, 92.003922f },
1212 { 371.99826f, 92.003899f },
1213 };
1214
1215 stroke_cubic(p1);
1216 }
1217
check_close(skiatest::Reporter * reporter,const SkPath & path)1218 static void check_close(skiatest::Reporter* reporter, const SkPath& path) {
1219 for (int i = 0; i < 2; ++i) {
1220 SkPath::Iter iter(path, SkToBool(i));
1221 SkPoint mv;
1222 SkPoint pts[4];
1223 SkPath::Verb v;
1224 int nMT = 0;
1225 int nCL = 0;
1226 mv.set(0, 0);
1227 while (SkPath::kDone_Verb != (v = iter.next(pts))) {
1228 switch (v) {
1229 case SkPath::kMove_Verb:
1230 mv = pts[0];
1231 ++nMT;
1232 break;
1233 case SkPath::kClose_Verb:
1234 REPORTER_ASSERT(reporter, mv == pts[0]);
1235 ++nCL;
1236 break;
1237 default:
1238 break;
1239 }
1240 }
1241 // if we force a close on the interator we should have a close
1242 // for every moveTo
1243 REPORTER_ASSERT(reporter, !i || nMT == nCL);
1244 }
1245 }
1246
test_close(skiatest::Reporter * reporter)1247 static void test_close(skiatest::Reporter* reporter) {
1248 SkPath closePt;
1249 closePt.moveTo(0, 0);
1250 closePt.close();
1251 check_close(reporter, closePt);
1252
1253 SkPath openPt;
1254 openPt.moveTo(0, 0);
1255 check_close(reporter, openPt);
1256
1257 SkPath empty;
1258 check_close(reporter, empty);
1259 empty.close();
1260 check_close(reporter, empty);
1261
1262 SkPath rect;
1263 rect.addRect(SK_Scalar1, SK_Scalar1, 10 * SK_Scalar1, 10*SK_Scalar1);
1264 check_close(reporter, rect);
1265 rect.close();
1266 check_close(reporter, rect);
1267
1268 SkPath quad;
1269 quad.quadTo(SK_Scalar1, SK_Scalar1, 10 * SK_Scalar1, 10*SK_Scalar1);
1270 check_close(reporter, quad);
1271 quad.close();
1272 check_close(reporter, quad);
1273
1274 SkPath cubic;
1275 quad.cubicTo(SK_Scalar1, SK_Scalar1, 10 * SK_Scalar1,
1276 10*SK_Scalar1, 20 * SK_Scalar1, 20*SK_Scalar1);
1277 check_close(reporter, cubic);
1278 cubic.close();
1279 check_close(reporter, cubic);
1280
1281 SkPath line;
1282 line.moveTo(SK_Scalar1, SK_Scalar1);
1283 line.lineTo(10 * SK_Scalar1, 10*SK_Scalar1);
1284 check_close(reporter, line);
1285 line.close();
1286 check_close(reporter, line);
1287
1288 SkPath rect2;
1289 rect2.addRect(SK_Scalar1, SK_Scalar1, 10 * SK_Scalar1, 10*SK_Scalar1);
1290 rect2.close();
1291 rect2.addRect(SK_Scalar1, SK_Scalar1, 10 * SK_Scalar1, 10*SK_Scalar1);
1292 check_close(reporter, rect2);
1293 rect2.close();
1294 check_close(reporter, rect2);
1295
1296 SkPath oval3;
1297 oval3.addOval(SkRect::MakeWH(SK_Scalar1*100,SK_Scalar1*100));
1298 oval3.close();
1299 oval3.addOval(SkRect::MakeWH(SK_Scalar1*200,SK_Scalar1*200));
1300 check_close(reporter, oval3);
1301 oval3.close();
1302 check_close(reporter, oval3);
1303
1304 SkPath moves;
1305 moves.moveTo(SK_Scalar1, SK_Scalar1);
1306 moves.moveTo(5 * SK_Scalar1, SK_Scalar1);
1307 moves.moveTo(SK_Scalar1, 10 * SK_Scalar1);
1308 moves.moveTo(10 *SK_Scalar1, SK_Scalar1);
1309 check_close(reporter, moves);
1310
1311 stroke_tiny_cubic();
1312 }
1313
check_convexity(skiatest::Reporter * reporter,const SkPath & path,SkPath::Convexity expected)1314 static void check_convexity(skiatest::Reporter* reporter, const SkPath& path,
1315 SkPath::Convexity expected) {
1316 SkPath copy(path); // we make a copy so that we don't cache the result on the passed in path.
1317 SkPath::Convexity c = copy.getConvexity();
1318 REPORTER_ASSERT(reporter, c == expected);
1319 }
1320
test_path_crbug389050(skiatest::Reporter * reporter)1321 static void test_path_crbug389050(skiatest::Reporter* reporter) {
1322 SkPath tinyConvexPolygon;
1323 tinyConvexPolygon.moveTo(600.131559f, 800.112512f);
1324 tinyConvexPolygon.lineTo(600.161735f, 800.118627f);
1325 tinyConvexPolygon.lineTo(600.148962f, 800.142338f);
1326 tinyConvexPolygon.lineTo(600.134891f, 800.137724f);
1327 tinyConvexPolygon.close();
1328 tinyConvexPolygon.getConvexity();
1329 check_convexity(reporter, tinyConvexPolygon, SkPath::kConvex_Convexity);
1330 check_direction(reporter, tinyConvexPolygon, SkPathPriv::kCW_FirstDirection);
1331
1332 SkPath platTriangle;
1333 platTriangle.moveTo(0, 0);
1334 platTriangle.lineTo(200, 0);
1335 platTriangle.lineTo(100, 0.04f);
1336 platTriangle.close();
1337 platTriangle.getConvexity();
1338 check_direction(reporter, platTriangle, SkPathPriv::kCW_FirstDirection);
1339
1340 platTriangle.reset();
1341 platTriangle.moveTo(0, 0);
1342 platTriangle.lineTo(200, 0);
1343 platTriangle.lineTo(100, 0.03f);
1344 platTriangle.close();
1345 platTriangle.getConvexity();
1346 check_direction(reporter, platTriangle, SkPathPriv::kCW_FirstDirection);
1347 }
1348
test_convexity2(skiatest::Reporter * reporter)1349 static void test_convexity2(skiatest::Reporter* reporter) {
1350 SkPath pt;
1351 pt.moveTo(0, 0);
1352 pt.close();
1353 check_convexity(reporter, pt, SkPath::kConvex_Convexity);
1354 check_direction(reporter, pt, SkPathPriv::kUnknown_FirstDirection);
1355
1356 SkPath line;
1357 line.moveTo(12*SK_Scalar1, 20*SK_Scalar1);
1358 line.lineTo(-12*SK_Scalar1, -20*SK_Scalar1);
1359 line.close();
1360 check_convexity(reporter, line, SkPath::kConvex_Convexity);
1361 check_direction(reporter, line, SkPathPriv::kUnknown_FirstDirection);
1362
1363 SkPath triLeft;
1364 triLeft.moveTo(0, 0);
1365 triLeft.lineTo(SK_Scalar1, 0);
1366 triLeft.lineTo(SK_Scalar1, SK_Scalar1);
1367 triLeft.close();
1368 check_convexity(reporter, triLeft, SkPath::kConvex_Convexity);
1369 check_direction(reporter, triLeft, SkPathPriv::kCW_FirstDirection);
1370
1371 SkPath triRight;
1372 triRight.moveTo(0, 0);
1373 triRight.lineTo(-SK_Scalar1, 0);
1374 triRight.lineTo(SK_Scalar1, SK_Scalar1);
1375 triRight.close();
1376 check_convexity(reporter, triRight, SkPath::kConvex_Convexity);
1377 check_direction(reporter, triRight, SkPathPriv::kCCW_FirstDirection);
1378
1379 SkPath square;
1380 square.moveTo(0, 0);
1381 square.lineTo(SK_Scalar1, 0);
1382 square.lineTo(SK_Scalar1, SK_Scalar1);
1383 square.lineTo(0, SK_Scalar1);
1384 square.close();
1385 check_convexity(reporter, square, SkPath::kConvex_Convexity);
1386 check_direction(reporter, square, SkPathPriv::kCW_FirstDirection);
1387
1388 SkPath redundantSquare;
1389 redundantSquare.moveTo(0, 0);
1390 redundantSquare.lineTo(0, 0);
1391 redundantSquare.lineTo(0, 0);
1392 redundantSquare.lineTo(SK_Scalar1, 0);
1393 redundantSquare.lineTo(SK_Scalar1, 0);
1394 redundantSquare.lineTo(SK_Scalar1, 0);
1395 redundantSquare.lineTo(SK_Scalar1, SK_Scalar1);
1396 redundantSquare.lineTo(SK_Scalar1, SK_Scalar1);
1397 redundantSquare.lineTo(SK_Scalar1, SK_Scalar1);
1398 redundantSquare.lineTo(0, SK_Scalar1);
1399 redundantSquare.lineTo(0, SK_Scalar1);
1400 redundantSquare.lineTo(0, SK_Scalar1);
1401 redundantSquare.close();
1402 check_convexity(reporter, redundantSquare, SkPath::kConvex_Convexity);
1403 check_direction(reporter, redundantSquare, SkPathPriv::kCW_FirstDirection);
1404
1405 SkPath bowTie;
1406 bowTie.moveTo(0, 0);
1407 bowTie.lineTo(0, 0);
1408 bowTie.lineTo(0, 0);
1409 bowTie.lineTo(SK_Scalar1, SK_Scalar1);
1410 bowTie.lineTo(SK_Scalar1, SK_Scalar1);
1411 bowTie.lineTo(SK_Scalar1, SK_Scalar1);
1412 bowTie.lineTo(SK_Scalar1, 0);
1413 bowTie.lineTo(SK_Scalar1, 0);
1414 bowTie.lineTo(SK_Scalar1, 0);
1415 bowTie.lineTo(0, SK_Scalar1);
1416 bowTie.lineTo(0, SK_Scalar1);
1417 bowTie.lineTo(0, SK_Scalar1);
1418 bowTie.close();
1419 check_convexity(reporter, bowTie, SkPath::kConcave_Convexity);
1420 check_direction(reporter, bowTie, kDontCheckDir);
1421
1422 SkPath spiral;
1423 spiral.moveTo(0, 0);
1424 spiral.lineTo(100*SK_Scalar1, 0);
1425 spiral.lineTo(100*SK_Scalar1, 100*SK_Scalar1);
1426 spiral.lineTo(0, 100*SK_Scalar1);
1427 spiral.lineTo(0, 50*SK_Scalar1);
1428 spiral.lineTo(50*SK_Scalar1, 50*SK_Scalar1);
1429 spiral.lineTo(50*SK_Scalar1, 75*SK_Scalar1);
1430 spiral.close();
1431 check_convexity(reporter, spiral, SkPath::kConcave_Convexity);
1432 check_direction(reporter, spiral, kDontCheckDir);
1433
1434 SkPath dent;
1435 dent.moveTo(0, 0);
1436 dent.lineTo(100*SK_Scalar1, 100*SK_Scalar1);
1437 dent.lineTo(0, 100*SK_Scalar1);
1438 dent.lineTo(-50*SK_Scalar1, 200*SK_Scalar1);
1439 dent.lineTo(-200*SK_Scalar1, 100*SK_Scalar1);
1440 dent.close();
1441 check_convexity(reporter, dent, SkPath::kConcave_Convexity);
1442 check_direction(reporter, dent, SkPathPriv::kCW_FirstDirection);
1443
1444 // https://bug.skia.org/2235
1445 SkPath strokedSin;
1446 for (int i = 0; i < 2000; i++) {
1447 SkScalar x = SkIntToScalar(i) / 2;
1448 SkScalar y = 500 - (x + SkScalarSin(x / 100) * 40) / 3;
1449 if (0 == i) {
1450 strokedSin.moveTo(x, y);
1451 } else {
1452 strokedSin.lineTo(x, y);
1453 }
1454 }
1455 SkStrokeRec stroke(SkStrokeRec::kFill_InitStyle);
1456 stroke.setStrokeStyle(2 * SK_Scalar1);
1457 stroke.applyToPath(&strokedSin, strokedSin);
1458 check_convexity(reporter, strokedSin, SkPath::kConcave_Convexity);
1459 check_direction(reporter, strokedSin, kDontCheckDir);
1460
1461 // http://crbug.com/412640
1462 SkPath degenerateConcave;
1463 degenerateConcave.moveTo(148.67912f, 191.875f);
1464 degenerateConcave.lineTo(470.37695f, 7.5f);
1465 degenerateConcave.lineTo(148.67912f, 191.875f);
1466 degenerateConcave.lineTo(41.446522f, 376.25f);
1467 degenerateConcave.lineTo(-55.971577f, 460.0f);
1468 degenerateConcave.lineTo(41.446522f, 376.25f);
1469 check_convexity(reporter, degenerateConcave, SkPath::kConcave_Convexity);
1470 check_direction(reporter, degenerateConcave, SkPathPriv::kUnknown_FirstDirection);
1471
1472 // http://crbug.com/433683
1473 SkPath badFirstVector;
1474 badFirstVector.moveTo(501.087708f, 319.610352f);
1475 badFirstVector.lineTo(501.087708f, 319.610352f);
1476 badFirstVector.cubicTo(501.087677f, 319.610321f, 449.271606f, 258.078674f, 395.084564f, 198.711182f);
1477 badFirstVector.cubicTo(358.967072f, 159.140717f, 321.910553f, 120.650436f, 298.442322f, 101.955399f);
1478 badFirstVector.lineTo(301.557678f, 98.044601f);
1479 badFirstVector.cubicTo(325.283844f, 116.945084f, 362.615204f, 155.720825f, 398.777557f, 195.340454f);
1480 badFirstVector.cubicTo(453.031860f, 254.781662f, 504.912262f, 316.389618f, 504.912292f, 316.389648f);
1481 badFirstVector.lineTo(504.912292f, 316.389648f);
1482 badFirstVector.lineTo(501.087708f, 319.610352f);
1483 badFirstVector.close();
1484 check_convexity(reporter, badFirstVector, SkPath::kConcave_Convexity);
1485 }
1486
check_convex_bounds(skiatest::Reporter * reporter,const SkPath & p,const SkRect & bounds)1487 static void check_convex_bounds(skiatest::Reporter* reporter, const SkPath& p,
1488 const SkRect& bounds) {
1489 REPORTER_ASSERT(reporter, p.isConvex());
1490 REPORTER_ASSERT(reporter, p.getBounds() == bounds);
1491
1492 SkPath p2(p);
1493 REPORTER_ASSERT(reporter, p2.isConvex());
1494 REPORTER_ASSERT(reporter, p2.getBounds() == bounds);
1495
1496 SkPath other;
1497 other.swap(p2);
1498 REPORTER_ASSERT(reporter, other.isConvex());
1499 REPORTER_ASSERT(reporter, other.getBounds() == bounds);
1500 }
1501
setFromString(SkPath * path,const char str[])1502 static void setFromString(SkPath* path, const char str[]) {
1503 bool first = true;
1504 while (str) {
1505 SkScalar x, y;
1506 str = SkParse::FindScalar(str, &x);
1507 if (nullptr == str) {
1508 break;
1509 }
1510 str = SkParse::FindScalar(str, &y);
1511 SkASSERT(str);
1512 if (first) {
1513 path->moveTo(x, y);
1514 first = false;
1515 } else {
1516 path->lineTo(x, y);
1517 }
1518 }
1519 }
1520
test_convexity(skiatest::Reporter * reporter)1521 static void test_convexity(skiatest::Reporter* reporter) {
1522 SkPath path;
1523
1524 check_convexity(reporter, path, SkPath::kConvex_Convexity);
1525 path.addCircle(0, 0, SkIntToScalar(10));
1526 check_convexity(reporter, path, SkPath::kConvex_Convexity);
1527 path.addCircle(0, 0, SkIntToScalar(10)); // 2nd circle
1528 check_convexity(reporter, path, SkPath::kConcave_Convexity);
1529
1530 path.reset();
1531 path.addRect(0, 0, SkIntToScalar(10), SkIntToScalar(10), SkPath::kCCW_Direction);
1532 check_convexity(reporter, path, SkPath::kConvex_Convexity);
1533 REPORTER_ASSERT(reporter, SkPathPriv::CheapIsFirstDirection(path, SkPathPriv::kCCW_FirstDirection));
1534
1535 path.reset();
1536 path.addRect(0, 0, SkIntToScalar(10), SkIntToScalar(10), SkPath::kCW_Direction);
1537 check_convexity(reporter, path, SkPath::kConvex_Convexity);
1538 REPORTER_ASSERT(reporter, SkPathPriv::CheapIsFirstDirection(path, SkPathPriv::kCW_FirstDirection));
1539
1540 path.reset();
1541 path.quadTo(100, 100, 50, 50); // This is a convex path from GM:convexpaths
1542 check_convexity(reporter, path, SkPath::kConvex_Convexity);
1543
1544 static const struct {
1545 const char* fPathStr;
1546 SkPath::Convexity fExpectedConvexity;
1547 SkPathPriv::FirstDirection fExpectedDirection;
1548 } gRec[] = {
1549 { "", SkPath::kConvex_Convexity, SkPathPriv::kUnknown_FirstDirection },
1550 { "0 0", SkPath::kConvex_Convexity, SkPathPriv::kUnknown_FirstDirection },
1551 { "0 0 10 10", SkPath::kConvex_Convexity, SkPathPriv::kUnknown_FirstDirection },
1552 { "0 0 10 10 20 20 0 0 10 10", SkPath::kConcave_Convexity, SkPathPriv::kUnknown_FirstDirection },
1553 { "0 0 10 10 10 20", SkPath::kConvex_Convexity, SkPathPriv::kCW_FirstDirection },
1554 { "0 0 10 10 10 0", SkPath::kConvex_Convexity, SkPathPriv::kCCW_FirstDirection },
1555 { "0 0 10 10 10 0 0 10", SkPath::kConcave_Convexity, kDontCheckDir },
1556 { "0 0 10 0 0 10 -10 -10", SkPath::kConcave_Convexity, SkPathPriv::kCW_FirstDirection },
1557 };
1558
1559 for (size_t i = 0; i < SK_ARRAY_COUNT(gRec); ++i) {
1560 SkPath path;
1561 setFromString(&path, gRec[i].fPathStr);
1562 check_convexity(reporter, path, gRec[i].fExpectedConvexity);
1563 check_direction(reporter, path, gRec[i].fExpectedDirection);
1564 // check after setting the initial convex and direction
1565 if (kDontCheckDir != gRec[i].fExpectedDirection) {
1566 SkPath copy(path);
1567 SkPathPriv::FirstDirection dir;
1568 bool foundDir = SkPathPriv::CheapComputeFirstDirection(copy, &dir);
1569 REPORTER_ASSERT(reporter, (gRec[i].fExpectedDirection == SkPathPriv::kUnknown_FirstDirection)
1570 ^ foundDir);
1571 REPORTER_ASSERT(reporter, !foundDir || gRec[i].fExpectedDirection == dir);
1572 check_convexity(reporter, copy, gRec[i].fExpectedConvexity);
1573 }
1574 REPORTER_ASSERT(reporter, gRec[i].fExpectedConvexity == path.getConvexity());
1575 check_direction(reporter, path, gRec[i].fExpectedDirection);
1576 }
1577
1578 static const SkPoint nonFinitePts[] = {
1579 { SK_ScalarInfinity, 0 },
1580 { 0, SK_ScalarInfinity },
1581 { SK_ScalarInfinity, SK_ScalarInfinity },
1582 { SK_ScalarNegativeInfinity, 0},
1583 { 0, SK_ScalarNegativeInfinity },
1584 { SK_ScalarNegativeInfinity, SK_ScalarNegativeInfinity },
1585 { SK_ScalarNegativeInfinity, SK_ScalarInfinity },
1586 { SK_ScalarInfinity, SK_ScalarNegativeInfinity },
1587 { SK_ScalarNaN, 0 },
1588 { 0, SK_ScalarNaN },
1589 { SK_ScalarNaN, SK_ScalarNaN },
1590 };
1591
1592 const size_t nonFinitePtsCount = sizeof(nonFinitePts) / sizeof(nonFinitePts[0]);
1593
1594 static const SkPoint finitePts[] = {
1595 { SK_ScalarMax, 0 },
1596 { 0, SK_ScalarMax },
1597 { SK_ScalarMax, SK_ScalarMax },
1598 { SK_ScalarMin, 0 },
1599 { 0, SK_ScalarMin },
1600 { SK_ScalarMin, SK_ScalarMin },
1601 };
1602
1603 const size_t finitePtsCount = sizeof(finitePts) / sizeof(finitePts[0]);
1604
1605 for (int index = 0; index < (int) (13 * nonFinitePtsCount * finitePtsCount); ++index) {
1606 int i = (int) (index % nonFinitePtsCount);
1607 int f = (int) (index % finitePtsCount);
1608 int g = (int) ((f + 1) % finitePtsCount);
1609 path.reset();
1610 switch (index % 13) {
1611 case 0: path.lineTo(nonFinitePts[i]); break;
1612 case 1: path.quadTo(nonFinitePts[i], nonFinitePts[i]); break;
1613 case 2: path.quadTo(nonFinitePts[i], finitePts[f]); break;
1614 case 3: path.quadTo(finitePts[f], nonFinitePts[i]); break;
1615 case 4: path.cubicTo(nonFinitePts[i], finitePts[f], finitePts[f]); break;
1616 case 5: path.cubicTo(finitePts[f], nonFinitePts[i], finitePts[f]); break;
1617 case 6: path.cubicTo(finitePts[f], finitePts[f], nonFinitePts[i]); break;
1618 case 7: path.cubicTo(nonFinitePts[i], nonFinitePts[i], finitePts[f]); break;
1619 case 8: path.cubicTo(nonFinitePts[i], finitePts[f], nonFinitePts[i]); break;
1620 case 9: path.cubicTo(finitePts[f], nonFinitePts[i], nonFinitePts[i]); break;
1621 case 10: path.cubicTo(nonFinitePts[i], nonFinitePts[i], nonFinitePts[i]); break;
1622 case 11: path.cubicTo(nonFinitePts[i], finitePts[f], finitePts[g]); break;
1623 case 12: path.moveTo(nonFinitePts[i]); break;
1624 }
1625 check_convexity(reporter, path, SkPath::kUnknown_Convexity);
1626 }
1627
1628 for (int index = 0; index < (int) (11 * finitePtsCount); ++index) {
1629 int f = (int) (index % finitePtsCount);
1630 int g = (int) ((f + 1) % finitePtsCount);
1631 path.reset();
1632 int curveSelect = index % 11;
1633 switch (curveSelect) {
1634 case 0: path.moveTo(finitePts[f]); break;
1635 case 1: path.lineTo(finitePts[f]); break;
1636 case 2: path.quadTo(finitePts[f], finitePts[f]); break;
1637 case 3: path.quadTo(finitePts[f], finitePts[g]); break;
1638 case 4: path.quadTo(finitePts[g], finitePts[f]); break;
1639 case 5: path.cubicTo(finitePts[f], finitePts[f], finitePts[f]); break;
1640 case 6: path.cubicTo(finitePts[f], finitePts[f], finitePts[g]); break;
1641 case 7: path.cubicTo(finitePts[f], finitePts[g], finitePts[f]); break;
1642 case 8: path.cubicTo(finitePts[f], finitePts[g], finitePts[g]); break;
1643 case 9: path.cubicTo(finitePts[g], finitePts[f], finitePts[f]); break;
1644 case 10: path.cubicTo(finitePts[g], finitePts[f], finitePts[g]); break;
1645 }
1646 check_convexity(reporter, path, curveSelect == 0 ? SkPath::kConvex_Convexity
1647 : SkPath::kUnknown_Convexity);
1648 }
1649
1650 path.reset();
1651 path.moveTo(SkBits2Float(0xbe9171db), SkBits2Float(0xbd7eeb5d)); // -0.284072f, -0.0622362f
1652 path.lineTo(SkBits2Float(0xbe9171db), SkBits2Float(0xbd7eea38)); // -0.284072f, -0.0622351f
1653 path.lineTo(SkBits2Float(0xbe9171a0), SkBits2Float(0xbd7ee5a7)); // -0.28407f, -0.0622307f
1654 path.lineTo(SkBits2Float(0xbe917147), SkBits2Float(0xbd7ed886)); // -0.284067f, -0.0622182f
1655 path.lineTo(SkBits2Float(0xbe917378), SkBits2Float(0xbd7ee1a9)); // -0.284084f, -0.0622269f
1656 path.lineTo(SkBits2Float(0xbe9171db), SkBits2Float(0xbd7eeb5d)); // -0.284072f, -0.0622362f
1657 path.close();
1658 check_convexity(reporter, path, SkPath::kConcave_Convexity);
1659
1660 }
1661
test_isLine(skiatest::Reporter * reporter)1662 static void test_isLine(skiatest::Reporter* reporter) {
1663 SkPath path;
1664 SkPoint pts[2];
1665 const SkScalar value = SkIntToScalar(5);
1666
1667 REPORTER_ASSERT(reporter, !path.isLine(nullptr));
1668
1669 // set some non-zero values
1670 pts[0].set(value, value);
1671 pts[1].set(value, value);
1672 REPORTER_ASSERT(reporter, !path.isLine(pts));
1673 // check that pts was untouched
1674 REPORTER_ASSERT(reporter, pts[0].equals(value, value));
1675 REPORTER_ASSERT(reporter, pts[1].equals(value, value));
1676
1677 const SkScalar moveX = SkIntToScalar(1);
1678 const SkScalar moveY = SkIntToScalar(2);
1679 REPORTER_ASSERT(reporter, value != moveX && value != moveY);
1680
1681 path.moveTo(moveX, moveY);
1682 REPORTER_ASSERT(reporter, !path.isLine(nullptr));
1683 REPORTER_ASSERT(reporter, !path.isLine(pts));
1684 // check that pts was untouched
1685 REPORTER_ASSERT(reporter, pts[0].equals(value, value));
1686 REPORTER_ASSERT(reporter, pts[1].equals(value, value));
1687
1688 const SkScalar lineX = SkIntToScalar(2);
1689 const SkScalar lineY = SkIntToScalar(2);
1690 REPORTER_ASSERT(reporter, value != lineX && value != lineY);
1691
1692 path.lineTo(lineX, lineY);
1693 REPORTER_ASSERT(reporter, path.isLine(nullptr));
1694
1695 REPORTER_ASSERT(reporter, !pts[0].equals(moveX, moveY));
1696 REPORTER_ASSERT(reporter, !pts[1].equals(lineX, lineY));
1697 REPORTER_ASSERT(reporter, path.isLine(pts));
1698 REPORTER_ASSERT(reporter, pts[0].equals(moveX, moveY));
1699 REPORTER_ASSERT(reporter, pts[1].equals(lineX, lineY));
1700
1701 path.lineTo(0, 0); // too many points/verbs
1702 REPORTER_ASSERT(reporter, !path.isLine(nullptr));
1703 REPORTER_ASSERT(reporter, !path.isLine(pts));
1704 REPORTER_ASSERT(reporter, pts[0].equals(moveX, moveY));
1705 REPORTER_ASSERT(reporter, pts[1].equals(lineX, lineY));
1706
1707 path.reset();
1708 path.quadTo(1, 1, 2, 2);
1709 REPORTER_ASSERT(reporter, !path.isLine(nullptr));
1710 }
1711
test_conservativelyContains(skiatest::Reporter * reporter)1712 static void test_conservativelyContains(skiatest::Reporter* reporter) {
1713 SkPath path;
1714
1715 // kBaseRect is used to construct most our test paths: a rect, a circle, and a round-rect.
1716 static const SkRect kBaseRect = SkRect::MakeWH(SkIntToScalar(100), SkIntToScalar(100));
1717
1718 // A circle that bounds kBaseRect (with a significant amount of slop)
1719 SkScalar circleR = SkMaxScalar(kBaseRect.width(), kBaseRect.height());
1720 circleR *= 1.75f / 2;
1721 static const SkPoint kCircleC = {kBaseRect.centerX(), kBaseRect.centerY()};
1722
1723 // round-rect radii
1724 static const SkScalar kRRRadii[] = {SkIntToScalar(5), SkIntToScalar(3)};
1725
1726 static const struct SUPPRESS_VISIBILITY_WARNING {
1727 SkRect fQueryRect;
1728 bool fInRect;
1729 bool fInCircle;
1730 bool fInRR;
1731 bool fInCubicRR;
1732 } kQueries[] = {
1733 {kBaseRect, true, true, false, false},
1734
1735 // rect well inside of kBaseRect
1736 {SkRect::MakeLTRB(kBaseRect.fLeft + 0.25f*kBaseRect.width(),
1737 kBaseRect.fTop + 0.25f*kBaseRect.height(),
1738 kBaseRect.fRight - 0.25f*kBaseRect.width(),
1739 kBaseRect.fBottom - 0.25f*kBaseRect.height()),
1740 true, true, true, true},
1741
1742 // rects with edges off by one from kBaseRect's edges
1743 {SkRect::MakeXYWH(kBaseRect.fLeft, kBaseRect.fTop,
1744 kBaseRect.width(), kBaseRect.height() + 1),
1745 false, true, false, false},
1746 {SkRect::MakeXYWH(kBaseRect.fLeft, kBaseRect.fTop,
1747 kBaseRect.width() + 1, kBaseRect.height()),
1748 false, true, false, false},
1749 {SkRect::MakeXYWH(kBaseRect.fLeft, kBaseRect.fTop,
1750 kBaseRect.width() + 1, kBaseRect.height() + 1),
1751 false, true, false, false},
1752 {SkRect::MakeXYWH(kBaseRect.fLeft - 1, kBaseRect.fTop,
1753 kBaseRect.width(), kBaseRect.height()),
1754 false, true, false, false},
1755 {SkRect::MakeXYWH(kBaseRect.fLeft, kBaseRect.fTop - 1,
1756 kBaseRect.width(), kBaseRect.height()),
1757 false, true, false, false},
1758 {SkRect::MakeXYWH(kBaseRect.fLeft - 1, kBaseRect.fTop,
1759 kBaseRect.width() + 2, kBaseRect.height()),
1760 false, true, false, false},
1761 {SkRect::MakeXYWH(kBaseRect.fLeft, kBaseRect.fTop - 1,
1762 kBaseRect.width() + 2, kBaseRect.height()),
1763 false, true, false, false},
1764
1765 // zero-w/h rects at each corner of kBaseRect
1766 {SkRect::MakeXYWH(kBaseRect.fLeft, kBaseRect.fTop, 0, 0), true, true, false, false},
1767 {SkRect::MakeXYWH(kBaseRect.fRight, kBaseRect.fTop, 0, 0), true, true, false, true},
1768 {SkRect::MakeXYWH(kBaseRect.fLeft, kBaseRect.fBottom, 0, 0), true, true, false, true},
1769 {SkRect::MakeXYWH(kBaseRect.fRight, kBaseRect.fBottom, 0, 0), true, true, false, true},
1770
1771 // far away rect
1772 {SkRect::MakeXYWH(10 * kBaseRect.fRight, 10 * kBaseRect.fBottom,
1773 SkIntToScalar(10), SkIntToScalar(10)),
1774 false, false, false, false},
1775
1776 // very large rect containing kBaseRect
1777 {SkRect::MakeXYWH(kBaseRect.fLeft - 5 * kBaseRect.width(),
1778 kBaseRect.fTop - 5 * kBaseRect.height(),
1779 11 * kBaseRect.width(), 11 * kBaseRect.height()),
1780 false, false, false, false},
1781
1782 // skinny rect that spans same y-range as kBaseRect
1783 {SkRect::MakeXYWH(kBaseRect.centerX(), kBaseRect.fTop,
1784 SkIntToScalar(1), kBaseRect.height()),
1785 true, true, true, true},
1786
1787 // short rect that spans same x-range as kBaseRect
1788 {SkRect::MakeXYWH(kBaseRect.fLeft, kBaseRect.centerY(), kBaseRect.width(), SkScalar(1)),
1789 true, true, true, true},
1790
1791 // skinny rect that spans slightly larger y-range than kBaseRect
1792 {SkRect::MakeXYWH(kBaseRect.centerX(), kBaseRect.fTop,
1793 SkIntToScalar(1), kBaseRect.height() + 1),
1794 false, true, false, false},
1795
1796 // short rect that spans slightly larger x-range than kBaseRect
1797 {SkRect::MakeXYWH(kBaseRect.fLeft, kBaseRect.centerY(),
1798 kBaseRect.width() + 1, SkScalar(1)),
1799 false, true, false, false},
1800 };
1801
1802 for (int inv = 0; inv < 4; ++inv) {
1803 for (size_t q = 0; q < SK_ARRAY_COUNT(kQueries); ++q) {
1804 SkRect qRect = kQueries[q].fQueryRect;
1805 if (inv & 0x1) {
1806 SkTSwap(qRect.fLeft, qRect.fRight);
1807 }
1808 if (inv & 0x2) {
1809 SkTSwap(qRect.fTop, qRect.fBottom);
1810 }
1811 for (int d = 0; d < 2; ++d) {
1812 SkPath::Direction dir = d ? SkPath::kCCW_Direction : SkPath::kCW_Direction;
1813 path.reset();
1814 path.addRect(kBaseRect, dir);
1815 REPORTER_ASSERT(reporter, kQueries[q].fInRect ==
1816 path.conservativelyContainsRect(qRect));
1817
1818 path.reset();
1819 path.addCircle(kCircleC.fX, kCircleC.fY, circleR, dir);
1820 REPORTER_ASSERT(reporter, kQueries[q].fInCircle ==
1821 path.conservativelyContainsRect(qRect));
1822
1823 path.reset();
1824 path.addRoundRect(kBaseRect, kRRRadii[0], kRRRadii[1], dir);
1825 REPORTER_ASSERT(reporter, kQueries[q].fInRR ==
1826 path.conservativelyContainsRect(qRect));
1827
1828 path.reset();
1829 path.moveTo(kBaseRect.fLeft + kRRRadii[0], kBaseRect.fTop);
1830 path.cubicTo(kBaseRect.fLeft + kRRRadii[0] / 2, kBaseRect.fTop,
1831 kBaseRect.fLeft, kBaseRect.fTop + kRRRadii[1] / 2,
1832 kBaseRect.fLeft, kBaseRect.fTop + kRRRadii[1]);
1833 path.lineTo(kBaseRect.fLeft, kBaseRect.fBottom);
1834 path.lineTo(kBaseRect.fRight, kBaseRect.fBottom);
1835 path.lineTo(kBaseRect.fRight, kBaseRect.fTop);
1836 path.close();
1837 REPORTER_ASSERT(reporter, kQueries[q].fInCubicRR ==
1838 path.conservativelyContainsRect(qRect));
1839
1840 }
1841 // Slightly non-convex shape, shouldn't contain any rects.
1842 path.reset();
1843 path.moveTo(0, 0);
1844 path.lineTo(SkIntToScalar(50), 0.05f);
1845 path.lineTo(SkIntToScalar(100), 0);
1846 path.lineTo(SkIntToScalar(100), SkIntToScalar(100));
1847 path.lineTo(0, SkIntToScalar(100));
1848 path.close();
1849 REPORTER_ASSERT(reporter, !path.conservativelyContainsRect(qRect));
1850 }
1851 }
1852
1853 // make sure a minimal convex shape works, a right tri with edges along pos x and y axes.
1854 path.reset();
1855 path.moveTo(0, 0);
1856 path.lineTo(SkIntToScalar(100), 0);
1857 path.lineTo(0, SkIntToScalar(100));
1858
1859 // inside, on along top edge
1860 REPORTER_ASSERT(reporter, path.conservativelyContainsRect(SkRect::MakeXYWH(SkIntToScalar(50), 0,
1861 SkIntToScalar(10),
1862 SkIntToScalar(10))));
1863 // above
1864 REPORTER_ASSERT(reporter, !path.conservativelyContainsRect(
1865 SkRect::MakeXYWH(SkIntToScalar(50),
1866 SkIntToScalar(-10),
1867 SkIntToScalar(10),
1868 SkIntToScalar(10))));
1869 // to the left
1870 REPORTER_ASSERT(reporter, !path.conservativelyContainsRect(SkRect::MakeXYWH(SkIntToScalar(-10),
1871 SkIntToScalar(5),
1872 SkIntToScalar(5),
1873 SkIntToScalar(5))));
1874
1875 // outside the diagonal edge
1876 REPORTER_ASSERT(reporter, !path.conservativelyContainsRect(SkRect::MakeXYWH(SkIntToScalar(10),
1877 SkIntToScalar(200),
1878 SkIntToScalar(20),
1879 SkIntToScalar(5))));
1880
1881
1882 // Test that multiple move commands do not cause asserts.
1883 path.moveTo(SkIntToScalar(100), SkIntToScalar(100));
1884 REPORTER_ASSERT(reporter, path.conservativelyContainsRect(SkRect::MakeXYWH(SkIntToScalar(50), 0,
1885 SkIntToScalar(10),
1886 SkIntToScalar(10))));
1887
1888 // Same as above path and first test but with an extra moveTo.
1889 path.reset();
1890 path.moveTo(100, 100);
1891 path.moveTo(0, 0);
1892 path.lineTo(SkIntToScalar(100), 0);
1893 path.lineTo(0, SkIntToScalar(100));
1894 // Convexity logic is now more conservative, so that multiple (non-trailing) moveTos make a
1895 // path non-convex.
1896 REPORTER_ASSERT(reporter, !path.conservativelyContainsRect(
1897 SkRect::MakeXYWH(SkIntToScalar(50), 0,
1898 SkIntToScalar(10),
1899 SkIntToScalar(10))));
1900
1901 // Same as above path and first test but with the extra moveTo making a degenerate sub-path
1902 // following the non-empty sub-path. Verifies that this does not trigger assertions.
1903 path.reset();
1904 path.moveTo(0, 0);
1905 path.lineTo(SkIntToScalar(100), 0);
1906 path.lineTo(0, SkIntToScalar(100));
1907 path.moveTo(100, 100);
1908
1909 REPORTER_ASSERT(reporter, path.conservativelyContainsRect(SkRect::MakeXYWH(SkIntToScalar(50), 0,
1910 SkIntToScalar(10),
1911 SkIntToScalar(10))));
1912
1913 // Test that multiple move commands do not cause asserts and that the function
1914 // is not confused by the multiple moves.
1915 path.reset();
1916 path.moveTo(0, 0);
1917 path.lineTo(SkIntToScalar(100), 0);
1918 path.lineTo(0, SkIntToScalar(100));
1919 path.moveTo(0, SkIntToScalar(200));
1920 path.lineTo(SkIntToScalar(100), SkIntToScalar(200));
1921 path.lineTo(0, SkIntToScalar(300));
1922
1923 REPORTER_ASSERT(reporter, !path.conservativelyContainsRect(
1924 SkRect::MakeXYWH(SkIntToScalar(50), 0,
1925 SkIntToScalar(10),
1926 SkIntToScalar(10))));
1927
1928 path.reset();
1929 path.lineTo(100, 100);
1930 REPORTER_ASSERT(reporter, !path.conservativelyContainsRect(SkRect::MakeXYWH(0, 0, 1, 1)));
1931
1932 // An empty path should not contain any rectangle. It's questionable whether an empty path
1933 // contains an empty rectangle. However, since it is a conservative test it is ok to
1934 // return false.
1935 path.reset();
1936 REPORTER_ASSERT(reporter, !path.conservativelyContainsRect(SkRect::MakeWH(1,1)));
1937 REPORTER_ASSERT(reporter, !path.conservativelyContainsRect(SkRect::MakeWH(0,0)));
1938 }
1939
test_isRect_open_close(skiatest::Reporter * reporter)1940 static void test_isRect_open_close(skiatest::Reporter* reporter) {
1941 SkPath path;
1942 bool isClosed;
1943
1944 path.moveTo(0, 0); path.lineTo(1, 0); path.lineTo(1, 1); path.lineTo(0, 1);
1945 path.close();
1946
1947 REPORTER_ASSERT(reporter, path.isRect(nullptr, &isClosed, nullptr));
1948 REPORTER_ASSERT(reporter, isClosed);
1949 }
1950
1951 // Simple isRect test is inline TestPath, below.
1952 // test_isRect provides more extensive testing.
test_isRect(skiatest::Reporter * reporter)1953 static void test_isRect(skiatest::Reporter* reporter) {
1954 test_isRect_open_close(reporter);
1955
1956 // passing tests (all moveTo / lineTo...
1957 SkPoint r1[] = {{0, 0}, {1, 0}, {1, 1}, {0, 1}};
1958 SkPoint r2[] = {{1, 0}, {1, 1}, {0, 1}, {0, 0}};
1959 SkPoint r3[] = {{1, 1}, {0, 1}, {0, 0}, {1, 0}};
1960 SkPoint r4[] = {{0, 1}, {0, 0}, {1, 0}, {1, 1}};
1961 SkPoint r5[] = {{0, 0}, {0, 1}, {1, 1}, {1, 0}};
1962 SkPoint r6[] = {{0, 1}, {1, 1}, {1, 0}, {0, 0}};
1963 SkPoint r7[] = {{1, 1}, {1, 0}, {0, 0}, {0, 1}};
1964 SkPoint r8[] = {{1, 0}, {0, 0}, {0, 1}, {1, 1}};
1965 SkPoint r9[] = {{0, 1}, {1, 1}, {1, 0}, {0, 0}};
1966 SkPoint ra[] = {{0, 0}, {0, .5f}, {0, 1}, {.5f, 1}, {1, 1}, {1, .5f}, {1, 0}, {.5f, 0}};
1967 SkPoint rb[] = {{0, 0}, {.5f, 0}, {1, 0}, {1, .5f}, {1, 1}, {.5f, 1}, {0, 1}, {0, .5f}};
1968 SkPoint rc[] = {{0, 0}, {1, 0}, {1, 1}, {0, 1}, {0, 0}};
1969 SkPoint rd[] = {{0, 0}, {0, 1}, {1, 1}, {1, 0}, {0, 0}};
1970 SkPoint re[] = {{0, 0}, {1, 0}, {1, 0}, {1, 1}, {0, 1}};
1971 SkPoint rf[] = {{1, 0}, {8, 0}, {8, 8}, {0, 8}, {0, 0}};
1972
1973 // failing tests
1974 SkPoint f1[] = {{0, 0}, {1, 0}, {1, 1}}; // too few points
1975 SkPoint f2[] = {{0, 0}, {1, 1}, {0, 1}, {1, 0}}; // diagonal
1976 SkPoint f3[] = {{0, 0}, {1, 0}, {1, 1}, {0, 1}, {0, 0}, {1, 0}}; // wraps
1977 SkPoint f4[] = {{0, 0}, {1, 0}, {0, 0}, {1, 0}, {1, 1}, {0, 1}}; // backs up
1978 SkPoint f5[] = {{0, 0}, {1, 0}, {1, 1}, {2, 0}}; // end overshoots
1979 SkPoint f6[] = {{0, 0}, {1, 0}, {1, 1}, {0, 1}, {0, 2}}; // end overshoots
1980 SkPoint f7[] = {{0, 0}, {1, 0}, {1, 1}, {0, 2}}; // end overshoots
1981 SkPoint f8[] = {{0, 0}, {1, 0}, {1, 1}, {1, 0}}; // 'L'
1982 SkPoint f9[] = {{1, 0}, {8, 0}, {8, 8}, {0, 8}, {0, 0}, {2, 0}}; // overlaps
1983 SkPoint fa[] = {{1, 0}, {8, 0}, {8, 8}, {0, 8}, {0, -1}, {1, -1}}; // non colinear gap
1984 SkPoint fb[] = {{1, 0}, {8, 0}, {8, 8}, {0, 8}, {0, 1}}; // falls short
1985
1986 // no close, but we should detect them as fillably the same as a rect
1987 SkPoint c1[] = {{0, 0}, {1, 0}, {1, 1}, {0, 1}};
1988 SkPoint c2[] = {{0, 0}, {1, 0}, {1, 2}, {0, 2}, {0, 1}};
1989 SkPoint c3[] = {{0, 0}, {1, 0}, {1, 2}, {0, 2}, {0, 1}, {0, 0}}; // hit the start
1990
1991 // like c2, but we double-back on ourselves
1992 SkPoint d1[] = {{0, 0}, {1, 0}, {1, 2}, {0, 2}, {0, 1}, {0, 2}};
1993 // like c2, but we overshoot the start point
1994 SkPoint d2[] = {{0, 0}, {1, 0}, {1, 2}, {0, 2}, {0, -1}};
1995 SkPoint d3[] = {{0, 0}, {1, 0}, {1, 2}, {0, 2}, {0, -1}, {0, 0}};
1996
1997 struct IsRectTest {
1998 SkPoint *fPoints;
1999 int fPointCount;
2000 bool fClose;
2001 bool fIsRect;
2002 } tests[] = {
2003 { r1, SK_ARRAY_COUNT(r1), true, true },
2004 { r2, SK_ARRAY_COUNT(r2), true, true },
2005 { r3, SK_ARRAY_COUNT(r3), true, true },
2006 { r4, SK_ARRAY_COUNT(r4), true, true },
2007 { r5, SK_ARRAY_COUNT(r5), true, true },
2008 { r6, SK_ARRAY_COUNT(r6), true, true },
2009 { r7, SK_ARRAY_COUNT(r7), true, true },
2010 { r8, SK_ARRAY_COUNT(r8), true, true },
2011 { r9, SK_ARRAY_COUNT(r9), true, true },
2012 { ra, SK_ARRAY_COUNT(ra), true, true },
2013 { rb, SK_ARRAY_COUNT(rb), true, true },
2014 { rc, SK_ARRAY_COUNT(rc), true, true },
2015 { rd, SK_ARRAY_COUNT(rd), true, true },
2016 { re, SK_ARRAY_COUNT(re), true, true },
2017 { rf, SK_ARRAY_COUNT(rf), true, true },
2018
2019 { f1, SK_ARRAY_COUNT(f1), true, false },
2020 { f2, SK_ARRAY_COUNT(f2), true, false },
2021 { f3, SK_ARRAY_COUNT(f3), true, false },
2022 { f4, SK_ARRAY_COUNT(f4), true, false },
2023 { f5, SK_ARRAY_COUNT(f5), true, false },
2024 { f6, SK_ARRAY_COUNT(f6), true, false },
2025 { f7, SK_ARRAY_COUNT(f7), true, false },
2026 { f8, SK_ARRAY_COUNT(f8), true, false },
2027 { f9, SK_ARRAY_COUNT(f9), true, false },
2028 { fa, SK_ARRAY_COUNT(fa), true, false },
2029 { fb, SK_ARRAY_COUNT(fb), true, false },
2030
2031 { c1, SK_ARRAY_COUNT(c1), false, true },
2032 { c2, SK_ARRAY_COUNT(c2), false, true },
2033 { c3, SK_ARRAY_COUNT(c3), false, true },
2034
2035 { d1, SK_ARRAY_COUNT(d1), false, false },
2036 { d2, SK_ARRAY_COUNT(d2), false, false },
2037 { d3, SK_ARRAY_COUNT(d3), false, false },
2038 };
2039
2040 const size_t testCount = SK_ARRAY_COUNT(tests);
2041 int index;
2042 for (size_t testIndex = 0; testIndex < testCount; ++testIndex) {
2043 SkPath path;
2044 path.moveTo(tests[testIndex].fPoints[0].fX, tests[testIndex].fPoints[0].fY);
2045 for (index = 1; index < tests[testIndex].fPointCount; ++index) {
2046 path.lineTo(tests[testIndex].fPoints[index].fX, tests[testIndex].fPoints[index].fY);
2047 }
2048 if (tests[testIndex].fClose) {
2049 path.close();
2050 }
2051 REPORTER_ASSERT(reporter, tests[testIndex].fIsRect == path.isRect(nullptr));
2052
2053 if (tests[testIndex].fIsRect) {
2054 SkRect computed, expected;
2055 bool isClosed;
2056 SkPath::Direction direction;
2057 SkPathPriv::FirstDirection cheapDirection;
2058 expected.set(tests[testIndex].fPoints, tests[testIndex].fPointCount);
2059 REPORTER_ASSERT(reporter, SkPathPriv::CheapComputeFirstDirection(path, &cheapDirection));
2060 REPORTER_ASSERT(reporter, path.isRect(&computed, &isClosed, &direction));
2061 REPORTER_ASSERT(reporter, expected == computed);
2062 REPORTER_ASSERT(reporter, isClosed == tests[testIndex].fClose);
2063 REPORTER_ASSERT(reporter, SkPathPriv::AsFirstDirection(direction) == cheapDirection);
2064 } else {
2065 SkRect computed;
2066 computed.set(123, 456, 789, 1011);
2067 bool isClosed = (bool)-1;
2068 SkPath::Direction direction = (SkPath::Direction) - 1;
2069 REPORTER_ASSERT(reporter, !path.isRect(&computed, &isClosed, &direction));
2070 REPORTER_ASSERT(reporter, computed.fLeft == 123 && computed.fTop == 456);
2071 REPORTER_ASSERT(reporter, computed.fRight == 789 && computed.fBottom == 1011);
2072 REPORTER_ASSERT(reporter, isClosed == (bool) -1);
2073 REPORTER_ASSERT(reporter, direction == (SkPath::Direction) -1);
2074 }
2075 }
2076
2077 // fail, close then line
2078 SkPath path1;
2079 path1.moveTo(r1[0].fX, r1[0].fY);
2080 for (index = 1; index < SkToInt(SK_ARRAY_COUNT(r1)); ++index) {
2081 path1.lineTo(r1[index].fX, r1[index].fY);
2082 }
2083 path1.close();
2084 path1.lineTo(1, 0);
2085 REPORTER_ASSERT(reporter, !path1.isRect(nullptr));
2086
2087 // fail, move in the middle
2088 path1.reset();
2089 path1.moveTo(r1[0].fX, r1[0].fY);
2090 for (index = 1; index < SkToInt(SK_ARRAY_COUNT(r1)); ++index) {
2091 if (index == 2) {
2092 path1.moveTo(1, .5f);
2093 }
2094 path1.lineTo(r1[index].fX, r1[index].fY);
2095 }
2096 path1.close();
2097 REPORTER_ASSERT(reporter, !path1.isRect(nullptr));
2098
2099 // fail, move on the edge
2100 path1.reset();
2101 for (index = 1; index < SkToInt(SK_ARRAY_COUNT(r1)); ++index) {
2102 path1.moveTo(r1[index - 1].fX, r1[index - 1].fY);
2103 path1.lineTo(r1[index].fX, r1[index].fY);
2104 }
2105 path1.close();
2106 REPORTER_ASSERT(reporter, !path1.isRect(nullptr));
2107
2108 // fail, quad
2109 path1.reset();
2110 path1.moveTo(r1[0].fX, r1[0].fY);
2111 for (index = 1; index < SkToInt(SK_ARRAY_COUNT(r1)); ++index) {
2112 if (index == 2) {
2113 path1.quadTo(1, .5f, 1, .5f);
2114 }
2115 path1.lineTo(r1[index].fX, r1[index].fY);
2116 }
2117 path1.close();
2118 REPORTER_ASSERT(reporter, !path1.isRect(nullptr));
2119
2120 // fail, cubic
2121 path1.reset();
2122 path1.moveTo(r1[0].fX, r1[0].fY);
2123 for (index = 1; index < SkToInt(SK_ARRAY_COUNT(r1)); ++index) {
2124 if (index == 2) {
2125 path1.cubicTo(1, .5f, 1, .5f, 1, .5f);
2126 }
2127 path1.lineTo(r1[index].fX, r1[index].fY);
2128 }
2129 path1.close();
2130 REPORTER_ASSERT(reporter, !path1.isRect(nullptr));
2131 }
2132
check_simple_closed_rect(skiatest::Reporter * reporter,const SkPath & path,const SkRect & rect,SkPath::Direction dir,unsigned start)2133 static void check_simple_closed_rect(skiatest::Reporter* reporter, const SkPath& path,
2134 const SkRect& rect, SkPath::Direction dir, unsigned start) {
2135 SkRect r = SkRect::MakeEmpty();
2136 SkPath::Direction d = SkPath::kCCW_Direction;
2137 unsigned s = ~0U;
2138
2139 REPORTER_ASSERT(reporter, SkPathPriv::IsSimpleClosedRect(path, &r, &d, &s));
2140 REPORTER_ASSERT(reporter, r == rect);
2141 REPORTER_ASSERT(reporter, d == dir);
2142 REPORTER_ASSERT(reporter, s == start);
2143 }
2144
test_is_simple_closed_rect(skiatest::Reporter * reporter)2145 static void test_is_simple_closed_rect(skiatest::Reporter* reporter) {
2146 SkRect r = SkRect::MakeEmpty();
2147 SkPath::Direction d = SkPath::kCCW_Direction;
2148 unsigned s = ~0U;
2149
2150 const SkRect testRect = SkRect::MakeXYWH(10, 10, 50, 70);
2151 const SkRect emptyRect = SkRect::MakeEmpty();
2152 SkPath path;
2153 for (int start = 0; start < 4; ++start) {
2154 for (auto dir : {SkPath::kCCW_Direction, SkPath::kCW_Direction}) {
2155 SkPath path;
2156 path.addRect(testRect, dir, start);
2157 check_simple_closed_rect(reporter, path, testRect, dir, start);
2158 path.close();
2159 check_simple_closed_rect(reporter, path, testRect, dir, start);
2160 SkPath path2 = path;
2161 path2.lineTo(10, 10);
2162 REPORTER_ASSERT(reporter, !SkPathPriv::IsSimpleClosedRect(path2, &r, &d, &s));
2163 path2 = path;
2164 path2.moveTo(10, 10);
2165 REPORTER_ASSERT(reporter, !SkPathPriv::IsSimpleClosedRect(path2, &r, &d, &s));
2166 path2 = path;
2167 path2.addRect(testRect, dir, start);
2168 REPORTER_ASSERT(reporter, !SkPathPriv::IsSimpleClosedRect(path2, &r, &d, &s));
2169 // Make the path by hand, manually closing it.
2170 path2.reset();
2171 SkPath::RawIter iter(path);
2172 SkPath::Verb v;
2173 SkPoint verbPts[4];
2174 SkPoint firstPt = {0.f, 0.f};
2175 while ((v = iter.next(verbPts)) != SkPath::kDone_Verb) {
2176 switch(v) {
2177 case SkPath::kMove_Verb:
2178 firstPt = verbPts[0];
2179 path2.moveTo(verbPts[0]);
2180 break;
2181 case SkPath::kLine_Verb:
2182 path2.lineTo(verbPts[1]);
2183 break;
2184 default:
2185 break;
2186 }
2187 }
2188 // We haven't closed it yet...
2189 REPORTER_ASSERT(reporter, !SkPathPriv::IsSimpleClosedRect(path2, &r, &d, &s));
2190 // ... now we do and test again.
2191 path2.lineTo(firstPt);
2192 check_simple_closed_rect(reporter, path2, testRect, dir, start);
2193 // A redundant close shouldn't cause a failure.
2194 path2.close();
2195 check_simple_closed_rect(reporter, path2, testRect, dir, start);
2196 // Degenerate point and line rects are not allowed
2197 path2.reset();
2198 path2.addRect(emptyRect, dir, start);
2199 REPORTER_ASSERT(reporter, !SkPathPriv::IsSimpleClosedRect(path2, &r, &d, &s));
2200 SkRect degenRect = testRect;
2201 degenRect.fLeft = degenRect.fRight;
2202 path2.reset();
2203 path2.addRect(degenRect, dir, start);
2204 REPORTER_ASSERT(reporter, !SkPathPriv::IsSimpleClosedRect(path2, &r, &d, &s));
2205 degenRect = testRect;
2206 degenRect.fTop = degenRect.fBottom;
2207 path2.reset();
2208 path2.addRect(degenRect, dir, start);
2209 REPORTER_ASSERT(reporter, !SkPathPriv::IsSimpleClosedRect(path2, &r, &d, &s));
2210 // An inverted rect makes a rect path, but changes the winding dir and start point.
2211 SkPath::Direction swapDir = (dir == SkPath::kCW_Direction)
2212 ? SkPath::kCCW_Direction
2213 : SkPath::kCW_Direction;
2214 static constexpr unsigned kXSwapStarts[] = { 1, 0, 3, 2 };
2215 static constexpr unsigned kYSwapStarts[] = { 3, 2, 1, 0 };
2216 SkRect swapRect = testRect;
2217 SkTSwap(swapRect.fLeft, swapRect.fRight);
2218 path2.reset();
2219 path2.addRect(swapRect, dir, start);
2220 check_simple_closed_rect(reporter, path2, testRect, swapDir, kXSwapStarts[start]);
2221 swapRect = testRect;
2222 SkTSwap(swapRect.fTop, swapRect.fBottom);
2223 path2.reset();
2224 path2.addRect(swapRect, dir, start);
2225 check_simple_closed_rect(reporter, path2, testRect, swapDir, kYSwapStarts[start]);
2226 }
2227 }
2228 // down, up, left, close
2229 path.reset();
2230 path.moveTo(1, 1);
2231 path.lineTo(1, 2);
2232 path.lineTo(1, 1);
2233 path.lineTo(0, 1);
2234 SkRect rect;
2235 SkPath::Direction dir;
2236 unsigned start;
2237 path.close();
2238 REPORTER_ASSERT(reporter, !SkPathPriv::IsSimpleClosedRect(path, &rect, &dir, &start));
2239 // right, left, up, close
2240 path.reset();
2241 path.moveTo(1, 1);
2242 path.lineTo(2, 1);
2243 path.lineTo(1, 1);
2244 path.lineTo(1, 0);
2245 path.close();
2246 REPORTER_ASSERT(reporter, !SkPathPriv::IsSimpleClosedRect(path, &rect, &dir, &start));
2247 // parallelogram with horizontal edges
2248 path.reset();
2249 path.moveTo(1, 0);
2250 path.lineTo(3, 0);
2251 path.lineTo(2, 1);
2252 path.lineTo(0, 1);
2253 path.close();
2254 REPORTER_ASSERT(reporter, !SkPathPriv::IsSimpleClosedRect(path, &rect, &dir, &start));
2255 // parallelogram with vertical edges
2256 path.reset();
2257 path.moveTo(0, 1);
2258 path.lineTo(0, 3);
2259 path.lineTo(1, 2);
2260 path.lineTo(1, 0);
2261 path.close();
2262 REPORTER_ASSERT(reporter, !SkPathPriv::IsSimpleClosedRect(path, &rect, &dir, &start));
2263
2264 }
2265
test_isNestedFillRects(skiatest::Reporter * reporter)2266 static void test_isNestedFillRects(skiatest::Reporter* reporter) {
2267 // passing tests (all moveTo / lineTo...
2268 SkPoint r1[] = {{0, 0}, {1, 0}, {1, 1}, {0, 1}}; // CW
2269 SkPoint r2[] = {{1, 0}, {1, 1}, {0, 1}, {0, 0}};
2270 SkPoint r3[] = {{1, 1}, {0, 1}, {0, 0}, {1, 0}};
2271 SkPoint r4[] = {{0, 1}, {0, 0}, {1, 0}, {1, 1}};
2272 SkPoint r5[] = {{0, 0}, {0, 1}, {1, 1}, {1, 0}}; // CCW
2273 SkPoint r6[] = {{0, 1}, {1, 1}, {1, 0}, {0, 0}};
2274 SkPoint r7[] = {{1, 1}, {1, 0}, {0, 0}, {0, 1}};
2275 SkPoint r8[] = {{1, 0}, {0, 0}, {0, 1}, {1, 1}};
2276 SkPoint r9[] = {{0, 1}, {1, 1}, {1, 0}, {0, 0}};
2277 SkPoint ra[] = {{0, 0}, {0, .5f}, {0, 1}, {.5f, 1}, {1, 1}, {1, .5f}, {1, 0}, {.5f, 0}}; // CCW
2278 SkPoint rb[] = {{0, 0}, {.5f, 0}, {1, 0}, {1, .5f}, {1, 1}, {.5f, 1}, {0, 1}, {0, .5f}}; // CW
2279 SkPoint rc[] = {{0, 0}, {1, 0}, {1, 1}, {0, 1}, {0, 0}}; // CW
2280 SkPoint rd[] = {{0, 0}, {0, 1}, {1, 1}, {1, 0}, {0, 0}}; // CCW
2281 SkPoint re[] = {{0, 0}, {1, 0}, {1, 0}, {1, 1}, {0, 1}}; // CW
2282
2283 // failing tests
2284 SkPoint f1[] = {{0, 0}, {1, 0}, {1, 1}}; // too few points
2285 SkPoint f2[] = {{0, 0}, {1, 1}, {0, 1}, {1, 0}}; // diagonal
2286 SkPoint f3[] = {{0, 0}, {1, 0}, {1, 1}, {0, 1}, {0, 0}, {1, 0}}; // wraps
2287 SkPoint f4[] = {{0, 0}, {1, 0}, {0, 0}, {1, 0}, {1, 1}, {0, 1}}; // backs up
2288 SkPoint f5[] = {{0, 0}, {1, 0}, {1, 1}, {2, 0}}; // end overshoots
2289 SkPoint f6[] = {{0, 0}, {1, 0}, {1, 1}, {0, 1}, {0, 2}}; // end overshoots
2290 SkPoint f7[] = {{0, 0}, {1, 0}, {1, 1}, {0, 2}}; // end overshoots
2291 SkPoint f8[] = {{0, 0}, {1, 0}, {1, 1}, {1, 0}}; // 'L'
2292
2293 // success, no close is OK
2294 SkPoint c1[] = {{0, 0}, {1, 0}, {1, 1}, {0, 1}}; // close doesn't match
2295 SkPoint c2[] = {{0, 0}, {1, 0}, {1, 2}, {0, 2}, {0, 1}}; // ditto
2296
2297 struct IsNestedRectTest {
2298 SkPoint *fPoints;
2299 int fPointCount;
2300 SkPathPriv::FirstDirection fDirection;
2301 bool fClose;
2302 bool fIsNestedRect; // nests with path.addRect(-1, -1, 2, 2);
2303 } tests[] = {
2304 { r1, SK_ARRAY_COUNT(r1), SkPathPriv::kCW_FirstDirection , true, true },
2305 { r2, SK_ARRAY_COUNT(r2), SkPathPriv::kCW_FirstDirection , true, true },
2306 { r3, SK_ARRAY_COUNT(r3), SkPathPriv::kCW_FirstDirection , true, true },
2307 { r4, SK_ARRAY_COUNT(r4), SkPathPriv::kCW_FirstDirection , true, true },
2308 { r5, SK_ARRAY_COUNT(r5), SkPathPriv::kCCW_FirstDirection, true, true },
2309 { r6, SK_ARRAY_COUNT(r6), SkPathPriv::kCCW_FirstDirection, true, true },
2310 { r7, SK_ARRAY_COUNT(r7), SkPathPriv::kCCW_FirstDirection, true, true },
2311 { r8, SK_ARRAY_COUNT(r8), SkPathPriv::kCCW_FirstDirection, true, true },
2312 { r9, SK_ARRAY_COUNT(r9), SkPathPriv::kCCW_FirstDirection, true, true },
2313 { ra, SK_ARRAY_COUNT(ra), SkPathPriv::kCCW_FirstDirection, true, true },
2314 { rb, SK_ARRAY_COUNT(rb), SkPathPriv::kCW_FirstDirection, true, true },
2315 { rc, SK_ARRAY_COUNT(rc), SkPathPriv::kCW_FirstDirection, true, true },
2316 { rd, SK_ARRAY_COUNT(rd), SkPathPriv::kCCW_FirstDirection, true, true },
2317 { re, SK_ARRAY_COUNT(re), SkPathPriv::kCW_FirstDirection, true, true },
2318
2319 { f1, SK_ARRAY_COUNT(f1), SkPathPriv::kUnknown_FirstDirection, true, false },
2320 { f2, SK_ARRAY_COUNT(f2), SkPathPriv::kUnknown_FirstDirection, true, false },
2321 { f3, SK_ARRAY_COUNT(f3), SkPathPriv::kUnknown_FirstDirection, true, false },
2322 { f4, SK_ARRAY_COUNT(f4), SkPathPriv::kUnknown_FirstDirection, true, false },
2323 { f5, SK_ARRAY_COUNT(f5), SkPathPriv::kUnknown_FirstDirection, true, false },
2324 { f6, SK_ARRAY_COUNT(f6), SkPathPriv::kUnknown_FirstDirection, true, false },
2325 { f7, SK_ARRAY_COUNT(f7), SkPathPriv::kUnknown_FirstDirection, true, false },
2326 { f8, SK_ARRAY_COUNT(f8), SkPathPriv::kUnknown_FirstDirection, true, false },
2327
2328 { c1, SK_ARRAY_COUNT(c1), SkPathPriv::kCW_FirstDirection, false, true },
2329 { c2, SK_ARRAY_COUNT(c2), SkPathPriv::kCW_FirstDirection, false, true },
2330 };
2331
2332 const size_t testCount = SK_ARRAY_COUNT(tests);
2333 int index;
2334 for (int rectFirst = 0; rectFirst <= 1; ++rectFirst) {
2335 for (size_t testIndex = 0; testIndex < testCount; ++testIndex) {
2336 SkPath path;
2337 if (rectFirst) {
2338 path.addRect(-1, -1, 2, 2, SkPath::kCW_Direction);
2339 }
2340 path.moveTo(tests[testIndex].fPoints[0].fX, tests[testIndex].fPoints[0].fY);
2341 for (index = 1; index < tests[testIndex].fPointCount; ++index) {
2342 path.lineTo(tests[testIndex].fPoints[index].fX, tests[testIndex].fPoints[index].fY);
2343 }
2344 if (tests[testIndex].fClose) {
2345 path.close();
2346 }
2347 if (!rectFirst) {
2348 path.addRect(-1, -1, 2, 2, SkPath::kCCW_Direction);
2349 }
2350 REPORTER_ASSERT(reporter,
2351 tests[testIndex].fIsNestedRect == path.isNestedFillRects(nullptr));
2352 if (tests[testIndex].fIsNestedRect) {
2353 SkRect expected[2], computed[2];
2354 SkPathPriv::FirstDirection expectedDirs[2];
2355 SkPath::Direction computedDirs[2];
2356 SkRect testBounds;
2357 testBounds.set(tests[testIndex].fPoints, tests[testIndex].fPointCount);
2358 expected[0] = SkRect::MakeLTRB(-1, -1, 2, 2);
2359 expected[1] = testBounds;
2360 if (rectFirst) {
2361 expectedDirs[0] = SkPathPriv::kCW_FirstDirection;
2362 } else {
2363 expectedDirs[0] = SkPathPriv::kCCW_FirstDirection;
2364 }
2365 expectedDirs[1] = tests[testIndex].fDirection;
2366 REPORTER_ASSERT(reporter, path.isNestedFillRects(computed, computedDirs));
2367 REPORTER_ASSERT(reporter, expected[0] == computed[0]);
2368 REPORTER_ASSERT(reporter, expected[1] == computed[1]);
2369 REPORTER_ASSERT(reporter, expectedDirs[0] == SkPathPriv::AsFirstDirection(computedDirs[0]));
2370 REPORTER_ASSERT(reporter, expectedDirs[1] == SkPathPriv::AsFirstDirection(computedDirs[1]));
2371 }
2372 }
2373
2374 // fail, close then line
2375 SkPath path1;
2376 if (rectFirst) {
2377 path1.addRect(-1, -1, 2, 2, SkPath::kCW_Direction);
2378 }
2379 path1.moveTo(r1[0].fX, r1[0].fY);
2380 for (index = 1; index < SkToInt(SK_ARRAY_COUNT(r1)); ++index) {
2381 path1.lineTo(r1[index].fX, r1[index].fY);
2382 }
2383 path1.close();
2384 path1.lineTo(1, 0);
2385 if (!rectFirst) {
2386 path1.addRect(-1, -1, 2, 2, SkPath::kCCW_Direction);
2387 }
2388 REPORTER_ASSERT(reporter, !path1.isNestedFillRects(nullptr));
2389
2390 // fail, move in the middle
2391 path1.reset();
2392 if (rectFirst) {
2393 path1.addRect(-1, -1, 2, 2, SkPath::kCW_Direction);
2394 }
2395 path1.moveTo(r1[0].fX, r1[0].fY);
2396 for (index = 1; index < SkToInt(SK_ARRAY_COUNT(r1)); ++index) {
2397 if (index == 2) {
2398 path1.moveTo(1, .5f);
2399 }
2400 path1.lineTo(r1[index].fX, r1[index].fY);
2401 }
2402 path1.close();
2403 if (!rectFirst) {
2404 path1.addRect(-1, -1, 2, 2, SkPath::kCCW_Direction);
2405 }
2406 REPORTER_ASSERT(reporter, !path1.isNestedFillRects(nullptr));
2407
2408 // fail, move on the edge
2409 path1.reset();
2410 if (rectFirst) {
2411 path1.addRect(-1, -1, 2, 2, SkPath::kCW_Direction);
2412 }
2413 for (index = 1; index < SkToInt(SK_ARRAY_COUNT(r1)); ++index) {
2414 path1.moveTo(r1[index - 1].fX, r1[index - 1].fY);
2415 path1.lineTo(r1[index].fX, r1[index].fY);
2416 }
2417 path1.close();
2418 if (!rectFirst) {
2419 path1.addRect(-1, -1, 2, 2, SkPath::kCCW_Direction);
2420 }
2421 REPORTER_ASSERT(reporter, !path1.isNestedFillRects(nullptr));
2422
2423 // fail, quad
2424 path1.reset();
2425 if (rectFirst) {
2426 path1.addRect(-1, -1, 2, 2, SkPath::kCW_Direction);
2427 }
2428 path1.moveTo(r1[0].fX, r1[0].fY);
2429 for (index = 1; index < SkToInt(SK_ARRAY_COUNT(r1)); ++index) {
2430 if (index == 2) {
2431 path1.quadTo(1, .5f, 1, .5f);
2432 }
2433 path1.lineTo(r1[index].fX, r1[index].fY);
2434 }
2435 path1.close();
2436 if (!rectFirst) {
2437 path1.addRect(-1, -1, 2, 2, SkPath::kCCW_Direction);
2438 }
2439 REPORTER_ASSERT(reporter, !path1.isNestedFillRects(nullptr));
2440
2441 // fail, cubic
2442 path1.reset();
2443 if (rectFirst) {
2444 path1.addRect(-1, -1, 2, 2, SkPath::kCW_Direction);
2445 }
2446 path1.moveTo(r1[0].fX, r1[0].fY);
2447 for (index = 1; index < SkToInt(SK_ARRAY_COUNT(r1)); ++index) {
2448 if (index == 2) {
2449 path1.cubicTo(1, .5f, 1, .5f, 1, .5f);
2450 }
2451 path1.lineTo(r1[index].fX, r1[index].fY);
2452 }
2453 path1.close();
2454 if (!rectFirst) {
2455 path1.addRect(-1, -1, 2, 2, SkPath::kCCW_Direction);
2456 }
2457 REPORTER_ASSERT(reporter, !path1.isNestedFillRects(nullptr));
2458
2459 // fail, not nested
2460 path1.reset();
2461 path1.addRect(1, 1, 3, 3, SkPath::kCW_Direction);
2462 path1.addRect(2, 2, 4, 4, SkPath::kCW_Direction);
2463 REPORTER_ASSERT(reporter, !path1.isNestedFillRects(nullptr));
2464 }
2465
2466 // pass, constructed explicitly from manually closed rects specified as moves/lines.
2467 SkPath path;
2468 path.moveTo(0, 0);
2469 path.lineTo(10, 0);
2470 path.lineTo(10, 10);
2471 path.lineTo(0, 10);
2472 path.lineTo(0, 0);
2473 path.moveTo(1, 1);
2474 path.lineTo(9, 1);
2475 path.lineTo(9, 9);
2476 path.lineTo(1, 9);
2477 path.lineTo(1, 1);
2478 REPORTER_ASSERT(reporter, path.isNestedFillRects(nullptr));
2479
2480 // pass, stroke rect
2481 SkPath src, dst;
2482 src.addRect(1, 1, 7, 7, SkPath::kCW_Direction);
2483 SkPaint strokePaint;
2484 strokePaint.setStyle(SkPaint::kStroke_Style);
2485 strokePaint.setStrokeWidth(2);
2486 strokePaint.getFillPath(src, &dst);
2487 REPORTER_ASSERT(reporter, dst.isNestedFillRects(nullptr));
2488 }
2489
write_and_read_back(skiatest::Reporter * reporter,const SkPath & p)2490 static void write_and_read_back(skiatest::Reporter* reporter,
2491 const SkPath& p) {
2492 SkWriter32 writer;
2493 writer.writePath(p);
2494 size_t size = writer.bytesWritten();
2495 SkAutoMalloc storage(size);
2496 writer.flatten(storage.get());
2497 SkReader32 reader(storage.get(), size);
2498
2499 SkPath readBack;
2500 REPORTER_ASSERT(reporter, readBack != p);
2501 reader.readPath(&readBack);
2502 REPORTER_ASSERT(reporter, readBack == p);
2503
2504 REPORTER_ASSERT(reporter, readBack.getConvexityOrUnknown() ==
2505 p.getConvexityOrUnknown());
2506
2507 SkRect oval0, oval1;
2508 SkPath::Direction dir0, dir1;
2509 unsigned start0, start1;
2510 REPORTER_ASSERT(reporter, readBack.isOval(nullptr) == p.isOval(nullptr));
2511 if (SkPathPriv::IsOval(p, &oval0, &dir0, &start0) &&
2512 SkPathPriv::IsOval(readBack, &oval1, &dir1, &start1)) {
2513 REPORTER_ASSERT(reporter, oval0 == oval1);
2514 REPORTER_ASSERT(reporter, dir0 == dir1);
2515 REPORTER_ASSERT(reporter, start0 == start1);
2516 }
2517 REPORTER_ASSERT(reporter, readBack.isRRect(nullptr) == p.isRRect(nullptr));
2518 SkRRect rrect0, rrect1;
2519 if (SkPathPriv::IsRRect(p, &rrect0, &dir0, &start0) &&
2520 SkPathPriv::IsRRect(readBack, &rrect1, &dir1, &start1)) {
2521 REPORTER_ASSERT(reporter, rrect0 == rrect1);
2522 REPORTER_ASSERT(reporter, dir0 == dir1);
2523 REPORTER_ASSERT(reporter, start0 == start1);
2524 }
2525 const SkRect& origBounds = p.getBounds();
2526 const SkRect& readBackBounds = readBack.getBounds();
2527
2528 REPORTER_ASSERT(reporter, origBounds == readBackBounds);
2529 }
2530
test_flattening(skiatest::Reporter * reporter)2531 static void test_flattening(skiatest::Reporter* reporter) {
2532 SkPath p;
2533
2534 static const SkPoint pts[] = {
2535 { 0, 0 },
2536 { SkIntToScalar(10), SkIntToScalar(10) },
2537 { SkIntToScalar(20), SkIntToScalar(10) }, { SkIntToScalar(20), 0 },
2538 { 0, 0 }, { 0, SkIntToScalar(10) }, { SkIntToScalar(1), SkIntToScalar(10) }
2539 };
2540 p.moveTo(pts[0]);
2541 p.lineTo(pts[1]);
2542 p.quadTo(pts[2], pts[3]);
2543 p.cubicTo(pts[4], pts[5], pts[6]);
2544
2545 write_and_read_back(reporter, p);
2546
2547 // create a buffer that should be much larger than the path so we don't
2548 // kill our stack if writer goes too far.
2549 char buffer[1024];
2550 size_t size1 = p.writeToMemory(nullptr);
2551 size_t size2 = p.writeToMemory(buffer);
2552 REPORTER_ASSERT(reporter, size1 == size2);
2553
2554 SkPath p2;
2555 size_t size3 = p2.readFromMemory(buffer, 1024);
2556 REPORTER_ASSERT(reporter, size1 == size3);
2557 REPORTER_ASSERT(reporter, p == p2);
2558
2559 size3 = p2.readFromMemory(buffer, 0);
2560 REPORTER_ASSERT(reporter, !size3);
2561
2562 SkPath tooShort;
2563 size3 = tooShort.readFromMemory(buffer, size1 - 1);
2564 REPORTER_ASSERT(reporter, tooShort.isEmpty());
2565
2566 char buffer2[1024];
2567 size3 = p2.writeToMemory(buffer2);
2568 REPORTER_ASSERT(reporter, size1 == size3);
2569 REPORTER_ASSERT(reporter, memcmp(buffer, buffer2, size1) == 0);
2570
2571 // test persistence of the oval flag & convexity
2572 {
2573 SkPath oval;
2574 SkRect rect = SkRect::MakeWH(10, 10);
2575 oval.addOval(rect);
2576
2577 write_and_read_back(reporter, oval);
2578 }
2579 }
2580
test_transform(skiatest::Reporter * reporter)2581 static void test_transform(skiatest::Reporter* reporter) {
2582 SkPath p;
2583
2584 #define CONIC_PERSPECTIVE_BUG_FIXED 0
2585 static const SkPoint pts[] = {
2586 { 0, 0 }, // move
2587 { SkIntToScalar(10), SkIntToScalar(10) }, // line
2588 { SkIntToScalar(20), SkIntToScalar(10) }, { SkIntToScalar(20), 0 }, // quad
2589 { 0, 0 }, { 0, SkIntToScalar(10) }, { SkIntToScalar(1), SkIntToScalar(10) }, // cubic
2590 #if CONIC_PERSPECTIVE_BUG_FIXED
2591 { 0, 0 }, { SkIntToScalar(20), SkIntToScalar(10) }, // conic
2592 #endif
2593 };
2594 const int kPtCount = SK_ARRAY_COUNT(pts);
2595
2596 p.moveTo(pts[0]);
2597 p.lineTo(pts[1]);
2598 p.quadTo(pts[2], pts[3]);
2599 p.cubicTo(pts[4], pts[5], pts[6]);
2600 #if CONIC_PERSPECTIVE_BUG_FIXED
2601 p.conicTo(pts[4], pts[5], 0.5f);
2602 #endif
2603 p.close();
2604
2605 {
2606 SkMatrix matrix;
2607 matrix.reset();
2608 SkPath p1;
2609 p.transform(matrix, &p1);
2610 REPORTER_ASSERT(reporter, p == p1);
2611 }
2612
2613
2614 {
2615 SkMatrix matrix;
2616 matrix.setScale(SK_Scalar1 * 2, SK_Scalar1 * 3);
2617
2618 SkPath p1; // Leave p1 non-unique (i.e., the empty path)
2619
2620 p.transform(matrix, &p1);
2621 SkPoint pts1[kPtCount];
2622 int count = p1.getPoints(pts1, kPtCount);
2623 REPORTER_ASSERT(reporter, kPtCount == count);
2624 for (int i = 0; i < count; ++i) {
2625 SkPoint newPt = SkPoint::Make(pts[i].fX * 2, pts[i].fY * 3);
2626 REPORTER_ASSERT(reporter, newPt == pts1[i]);
2627 }
2628 }
2629
2630 {
2631 SkMatrix matrix;
2632 matrix.reset();
2633 matrix.setPerspX(4);
2634
2635 SkPath p1;
2636 p1.moveTo(SkPoint::Make(0, 0));
2637
2638 p.transform(matrix, &p1);
2639 REPORTER_ASSERT(reporter, matrix.invert(&matrix));
2640 p1.transform(matrix, nullptr);
2641 SkRect pBounds = p.getBounds();
2642 SkRect p1Bounds = p1.getBounds();
2643 REPORTER_ASSERT(reporter, SkScalarNearlyEqual(pBounds.fLeft, p1Bounds.fLeft));
2644 REPORTER_ASSERT(reporter, SkScalarNearlyEqual(pBounds.fTop, p1Bounds.fTop));
2645 REPORTER_ASSERT(reporter, SkScalarNearlyEqual(pBounds.fRight, p1Bounds.fRight));
2646 REPORTER_ASSERT(reporter, SkScalarNearlyEqual(pBounds.fBottom, p1Bounds.fBottom));
2647 }
2648
2649 p.reset();
2650 p.addCircle(0, 0, 1, SkPath::kCW_Direction);
2651
2652 {
2653 SkMatrix matrix;
2654 matrix.reset();
2655 SkPath p1;
2656 p1.moveTo(SkPoint::Make(0, 0));
2657
2658 p.transform(matrix, &p1);
2659 REPORTER_ASSERT(reporter, SkPathPriv::CheapIsFirstDirection(p1, SkPathPriv::kCW_FirstDirection));
2660 }
2661
2662
2663 {
2664 SkMatrix matrix;
2665 matrix.reset();
2666 matrix.setScaleX(-1);
2667 SkPath p1;
2668 p1.moveTo(SkPoint::Make(0, 0)); // Make p1 unique (i.e., not empty path)
2669
2670 p.transform(matrix, &p1);
2671 REPORTER_ASSERT(reporter, SkPathPriv::CheapIsFirstDirection(p1, SkPathPriv::kCCW_FirstDirection));
2672 }
2673
2674 {
2675 SkMatrix matrix;
2676 matrix.setAll(1, 1, 0, 1, 1, 0, 0, 0, 1);
2677 SkPath p1;
2678 p1.moveTo(SkPoint::Make(0, 0)); // Make p1 unique (i.e., not empty path)
2679
2680 p.transform(matrix, &p1);
2681 REPORTER_ASSERT(reporter, SkPathPriv::CheapIsFirstDirection(p1, SkPathPriv::kUnknown_FirstDirection));
2682 }
2683 }
2684
test_zero_length_paths(skiatest::Reporter * reporter)2685 static void test_zero_length_paths(skiatest::Reporter* reporter) {
2686 SkPath p;
2687 uint8_t verbs[32];
2688
2689 struct SUPPRESS_VISIBILITY_WARNING zeroPathTestData {
2690 const char* testPath;
2691 const size_t numResultPts;
2692 const SkRect resultBound;
2693 const SkPath::Verb* resultVerbs;
2694 const size_t numResultVerbs;
2695 };
2696
2697 static const SkPath::Verb resultVerbs1[] = { SkPath::kMove_Verb };
2698 static const SkPath::Verb resultVerbs2[] = { SkPath::kMove_Verb, SkPath::kMove_Verb };
2699 static const SkPath::Verb resultVerbs3[] = { SkPath::kMove_Verb, SkPath::kClose_Verb };
2700 static const SkPath::Verb resultVerbs4[] = { SkPath::kMove_Verb, SkPath::kClose_Verb, SkPath::kMove_Verb, SkPath::kClose_Verb };
2701 static const SkPath::Verb resultVerbs5[] = { SkPath::kMove_Verb, SkPath::kLine_Verb };
2702 static const SkPath::Verb resultVerbs6[] = { SkPath::kMove_Verb, SkPath::kLine_Verb, SkPath::kMove_Verb, SkPath::kLine_Verb };
2703 static const SkPath::Verb resultVerbs7[] = { SkPath::kMove_Verb, SkPath::kLine_Verb, SkPath::kClose_Verb };
2704 static const SkPath::Verb resultVerbs8[] = {
2705 SkPath::kMove_Verb, SkPath::kLine_Verb, SkPath::kClose_Verb, SkPath::kMove_Verb, SkPath::kLine_Verb, SkPath::kClose_Verb
2706 };
2707 static const SkPath::Verb resultVerbs9[] = { SkPath::kMove_Verb, SkPath::kQuad_Verb };
2708 static const SkPath::Verb resultVerbs10[] = { SkPath::kMove_Verb, SkPath::kQuad_Verb, SkPath::kMove_Verb, SkPath::kQuad_Verb };
2709 static const SkPath::Verb resultVerbs11[] = { SkPath::kMove_Verb, SkPath::kQuad_Verb, SkPath::kClose_Verb };
2710 static const SkPath::Verb resultVerbs12[] = {
2711 SkPath::kMove_Verb, SkPath::kQuad_Verb, SkPath::kClose_Verb, SkPath::kMove_Verb, SkPath::kQuad_Verb, SkPath::kClose_Verb
2712 };
2713 static const SkPath::Verb resultVerbs13[] = { SkPath::kMove_Verb, SkPath::kCubic_Verb };
2714 static const SkPath::Verb resultVerbs14[] = { SkPath::kMove_Verb, SkPath::kCubic_Verb, SkPath::kMove_Verb, SkPath::kCubic_Verb };
2715 static const SkPath::Verb resultVerbs15[] = { SkPath::kMove_Verb, SkPath::kCubic_Verb, SkPath::kClose_Verb };
2716 static const SkPath::Verb resultVerbs16[] = {
2717 SkPath::kMove_Verb, SkPath::kCubic_Verb, SkPath::kClose_Verb, SkPath::kMove_Verb, SkPath::kCubic_Verb, SkPath::kClose_Verb
2718 };
2719 static const struct zeroPathTestData gZeroLengthTests[] = {
2720 { "M 1 1", 1, {1, 1, 1, 1}, resultVerbs1, SK_ARRAY_COUNT(resultVerbs1) },
2721 { "M 1 1 M 2 1", 2, {SK_Scalar1, SK_Scalar1, 2*SK_Scalar1, SK_Scalar1}, resultVerbs2, SK_ARRAY_COUNT(resultVerbs2) },
2722 { "M 1 1 z", 1, {1, 1, 1, 1}, resultVerbs3, SK_ARRAY_COUNT(resultVerbs3) },
2723 { "M 1 1 z M 2 1 z", 2, {SK_Scalar1, SK_Scalar1, 2*SK_Scalar1, SK_Scalar1}, resultVerbs4, SK_ARRAY_COUNT(resultVerbs4) },
2724 { "M 1 1 L 1 1", 2, {SK_Scalar1, SK_Scalar1, SK_Scalar1, SK_Scalar1}, resultVerbs5, SK_ARRAY_COUNT(resultVerbs5) },
2725 { "M 1 1 L 1 1 M 2 1 L 2 1", 4, {SK_Scalar1, SK_Scalar1, 2*SK_Scalar1, SK_Scalar1}, resultVerbs6, SK_ARRAY_COUNT(resultVerbs6) },
2726 { "M 1 1 L 1 1 z", 2, {SK_Scalar1, SK_Scalar1, SK_Scalar1, SK_Scalar1}, resultVerbs7, SK_ARRAY_COUNT(resultVerbs7) },
2727 { "M 1 1 L 1 1 z M 2 1 L 2 1 z", 4, {SK_Scalar1, SK_Scalar1, 2*SK_Scalar1, SK_Scalar1}, resultVerbs8, SK_ARRAY_COUNT(resultVerbs8) },
2728 { "M 1 1 Q 1 1 1 1", 3, {SK_Scalar1, SK_Scalar1, SK_Scalar1, SK_Scalar1}, resultVerbs9, SK_ARRAY_COUNT(resultVerbs9) },
2729 { "M 1 1 Q 1 1 1 1 M 2 1 Q 2 1 2 1", 6, {SK_Scalar1, SK_Scalar1, 2*SK_Scalar1, SK_Scalar1}, resultVerbs10, SK_ARRAY_COUNT(resultVerbs10) },
2730 { "M 1 1 Q 1 1 1 1 z", 3, {SK_Scalar1, SK_Scalar1, SK_Scalar1, SK_Scalar1}, resultVerbs11, SK_ARRAY_COUNT(resultVerbs11) },
2731 { "M 1 1 Q 1 1 1 1 z M 2 1 Q 2 1 2 1 z", 6, {SK_Scalar1, SK_Scalar1, 2*SK_Scalar1, SK_Scalar1}, resultVerbs12, SK_ARRAY_COUNT(resultVerbs12) },
2732 { "M 1 1 C 1 1 1 1 1 1", 4, {SK_Scalar1, SK_Scalar1, SK_Scalar1, SK_Scalar1}, resultVerbs13, SK_ARRAY_COUNT(resultVerbs13) },
2733 { "M 1 1 C 1 1 1 1 1 1 M 2 1 C 2 1 2 1 2 1", 8, {SK_Scalar1, SK_Scalar1, 2*SK_Scalar1, SK_Scalar1}, resultVerbs14,
2734 SK_ARRAY_COUNT(resultVerbs14)
2735 },
2736 { "M 1 1 C 1 1 1 1 1 1 z", 4, {SK_Scalar1, SK_Scalar1, SK_Scalar1, SK_Scalar1}, resultVerbs15, SK_ARRAY_COUNT(resultVerbs15) },
2737 { "M 1 1 C 1 1 1 1 1 1 z M 2 1 C 2 1 2 1 2 1 z", 8, {SK_Scalar1, SK_Scalar1, 2*SK_Scalar1, SK_Scalar1}, resultVerbs16,
2738 SK_ARRAY_COUNT(resultVerbs16)
2739 }
2740 };
2741
2742 for (size_t i = 0; i < SK_ARRAY_COUNT(gZeroLengthTests); ++i) {
2743 p.reset();
2744 bool valid = SkParsePath::FromSVGString(gZeroLengthTests[i].testPath, &p);
2745 REPORTER_ASSERT(reporter, valid);
2746 REPORTER_ASSERT(reporter, !p.isEmpty());
2747 REPORTER_ASSERT(reporter, gZeroLengthTests[i].numResultPts == (size_t)p.countPoints());
2748 REPORTER_ASSERT(reporter, gZeroLengthTests[i].resultBound == p.getBounds());
2749 REPORTER_ASSERT(reporter, gZeroLengthTests[i].numResultVerbs == (size_t)p.getVerbs(verbs, SK_ARRAY_COUNT(verbs)));
2750 for (size_t j = 0; j < gZeroLengthTests[i].numResultVerbs; ++j) {
2751 REPORTER_ASSERT(reporter, gZeroLengthTests[i].resultVerbs[j] == verbs[j]);
2752 }
2753 }
2754 }
2755
2756 struct SegmentInfo {
2757 SkPath fPath;
2758 int fPointCount;
2759 };
2760
2761 #define kCurveSegmentMask (SkPath::kQuad_SegmentMask | SkPath::kCubic_SegmentMask)
2762
test_segment_masks(skiatest::Reporter * reporter)2763 static void test_segment_masks(skiatest::Reporter* reporter) {
2764 SkPath p, p2;
2765
2766 p.moveTo(0, 0);
2767 p.quadTo(100, 100, 200, 200);
2768 REPORTER_ASSERT(reporter, SkPath::kQuad_SegmentMask == p.getSegmentMasks());
2769 REPORTER_ASSERT(reporter, !p.isEmpty());
2770 p2 = p;
2771 REPORTER_ASSERT(reporter, p2.getSegmentMasks() == p.getSegmentMasks());
2772 p.cubicTo(100, 100, 200, 200, 300, 300);
2773 REPORTER_ASSERT(reporter, kCurveSegmentMask == p.getSegmentMasks());
2774 REPORTER_ASSERT(reporter, !p.isEmpty());
2775 p2 = p;
2776 REPORTER_ASSERT(reporter, p2.getSegmentMasks() == p.getSegmentMasks());
2777
2778 p.reset();
2779 p.moveTo(0, 0);
2780 p.cubicTo(100, 100, 200, 200, 300, 300);
2781 REPORTER_ASSERT(reporter, SkPath::kCubic_SegmentMask == p.getSegmentMasks());
2782 p2 = p;
2783 REPORTER_ASSERT(reporter, p2.getSegmentMasks() == p.getSegmentMasks());
2784
2785 REPORTER_ASSERT(reporter, !p.isEmpty());
2786 }
2787
test_iter(skiatest::Reporter * reporter)2788 static void test_iter(skiatest::Reporter* reporter) {
2789 SkPath p;
2790 SkPoint pts[4];
2791
2792 // Test an iterator with no path
2793 SkPath::Iter noPathIter;
2794 REPORTER_ASSERT(reporter, noPathIter.next(pts) == SkPath::kDone_Verb);
2795
2796 // Test that setting an empty path works
2797 noPathIter.setPath(p, false);
2798 REPORTER_ASSERT(reporter, noPathIter.next(pts) == SkPath::kDone_Verb);
2799
2800 // Test that close path makes no difference for an empty path
2801 noPathIter.setPath(p, true);
2802 REPORTER_ASSERT(reporter, noPathIter.next(pts) == SkPath::kDone_Verb);
2803
2804 // Test an iterator with an initial empty path
2805 SkPath::Iter iter(p, false);
2806 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kDone_Verb);
2807
2808 // Test that close path makes no difference
2809 iter.setPath(p, true);
2810 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kDone_Verb);
2811
2812
2813 struct iterTestData {
2814 const char* testPath;
2815 const bool forceClose;
2816 const bool consumeDegenerates;
2817 const size_t* numResultPtsPerVerb;
2818 const SkPoint* resultPts;
2819 const SkPath::Verb* resultVerbs;
2820 const size_t numResultVerbs;
2821 };
2822
2823 static const SkPath::Verb resultVerbs1[] = { SkPath::kDone_Verb };
2824 static const SkPath::Verb resultVerbs2[] = {
2825 SkPath::kMove_Verb, SkPath::kLine_Verb, SkPath::kLine_Verb, SkPath::kDone_Verb
2826 };
2827 static const SkPath::Verb resultVerbs3[] = {
2828 SkPath::kMove_Verb, SkPath::kLine_Verb, SkPath::kLine_Verb, SkPath::kLine_Verb, SkPath::kClose_Verb, SkPath::kDone_Verb
2829 };
2830 static const SkPath::Verb resultVerbs4[] = {
2831 SkPath::kMove_Verb, SkPath::kLine_Verb, SkPath::kMove_Verb, SkPath::kClose_Verb, SkPath::kDone_Verb
2832 };
2833 static const SkPath::Verb resultVerbs5[] = {
2834 SkPath::kMove_Verb, SkPath::kLine_Verb, SkPath::kClose_Verb, SkPath::kMove_Verb, SkPath::kClose_Verb, SkPath::kDone_Verb
2835 };
2836 static const size_t resultPtsSizes1[] = { 0 };
2837 static const size_t resultPtsSizes2[] = { 1, 2, 2, 0 };
2838 static const size_t resultPtsSizes3[] = { 1, 2, 2, 2, 1, 0 };
2839 static const size_t resultPtsSizes4[] = { 1, 2, 1, 1, 0 };
2840 static const size_t resultPtsSizes5[] = { 1, 2, 1, 1, 1, 0 };
2841 static const SkPoint* resultPts1 = nullptr;
2842 static const SkPoint resultPts2[] = {
2843 { SK_Scalar1, 0 }, { SK_Scalar1, 0 }, { SK_Scalar1, SK_Scalar1 }, { SK_Scalar1, SK_Scalar1 }, { 0, SK_Scalar1 }
2844 };
2845 static const SkPoint resultPts3[] = {
2846 { SK_Scalar1, 0 }, { SK_Scalar1, 0 }, { SK_Scalar1, SK_Scalar1 }, { SK_Scalar1, SK_Scalar1 }, { 0, SK_Scalar1 },
2847 { 0, SK_Scalar1 }, { SK_Scalar1, 0 }, { SK_Scalar1, 0 }
2848 };
2849 static const SkPoint resultPts4[] = {
2850 { SK_Scalar1, 0 }, { SK_Scalar1, 0 }, { SK_Scalar1, 0 }, { 0, 0 }, { 0, 0 }
2851 };
2852 static const SkPoint resultPts5[] = {
2853 { SK_Scalar1, 0 }, { SK_Scalar1, 0 }, { SK_Scalar1, 0 }, { SK_Scalar1, 0 }, { 0, 0 }, { 0, 0 }
2854 };
2855 static const struct iterTestData gIterTests[] = {
2856 { "M 1 0", false, true, resultPtsSizes1, resultPts1, resultVerbs1, SK_ARRAY_COUNT(resultVerbs1) },
2857 { "M 1 0 M 2 0 M 3 0 M 4 0 M 5 0", false, true, resultPtsSizes1, resultPts1, resultVerbs1, SK_ARRAY_COUNT(resultVerbs1) },
2858 { "M 1 0 M 1 0 M 3 0 M 4 0 M 5 0", true, true, resultPtsSizes1, resultPts1, resultVerbs1, SK_ARRAY_COUNT(resultVerbs1) },
2859 { "z", false, true, resultPtsSizes1, resultPts1, resultVerbs1, SK_ARRAY_COUNT(resultVerbs1) },
2860 { "z", true, true, resultPtsSizes1, resultPts1, resultVerbs1, SK_ARRAY_COUNT(resultVerbs1) },
2861 { "z M 1 0 z z M 2 0 z M 3 0 M 4 0 z", false, true, resultPtsSizes1, resultPts1, resultVerbs1, SK_ARRAY_COUNT(resultVerbs1) },
2862 { "z M 1 0 z z M 2 0 z M 3 0 M 4 0 z", true, true, resultPtsSizes1, resultPts1, resultVerbs1, SK_ARRAY_COUNT(resultVerbs1) },
2863 { "M 1 0 L 1 1 L 0 1 M 0 0 z", false, true, resultPtsSizes2, resultPts2, resultVerbs2, SK_ARRAY_COUNT(resultVerbs2) },
2864 { "M 1 0 L 1 1 L 0 1 M 0 0 z", true, true, resultPtsSizes3, resultPts3, resultVerbs3, SK_ARRAY_COUNT(resultVerbs3) },
2865 { "M 1 0 L 1 0 M 0 0 z", false, true, resultPtsSizes1, resultPts1, resultVerbs1, SK_ARRAY_COUNT(resultVerbs1) },
2866 { "M 1 0 L 1 0 M 0 0 z", true, true, resultPtsSizes1, resultPts1, resultVerbs1, SK_ARRAY_COUNT(resultVerbs1) },
2867 { "M 1 0 L 1 0 M 0 0 z", false, false, resultPtsSizes4, resultPts4, resultVerbs4, SK_ARRAY_COUNT(resultVerbs4) },
2868 { "M 1 0 L 1 0 M 0 0 z", true, false, resultPtsSizes5, resultPts5, resultVerbs5, SK_ARRAY_COUNT(resultVerbs5) }
2869 };
2870
2871 for (size_t i = 0; i < SK_ARRAY_COUNT(gIterTests); ++i) {
2872 p.reset();
2873 bool valid = SkParsePath::FromSVGString(gIterTests[i].testPath, &p);
2874 REPORTER_ASSERT(reporter, valid);
2875 iter.setPath(p, gIterTests[i].forceClose);
2876 int j = 0, l = 0;
2877 do {
2878 REPORTER_ASSERT(reporter, iter.next(pts, gIterTests[i].consumeDegenerates) == gIterTests[i].resultVerbs[j]);
2879 for (int k = 0; k < (int)gIterTests[i].numResultPtsPerVerb[j]; ++k) {
2880 REPORTER_ASSERT(reporter, pts[k] == gIterTests[i].resultPts[l++]);
2881 }
2882 } while (gIterTests[i].resultVerbs[j++] != SkPath::kDone_Verb);
2883 REPORTER_ASSERT(reporter, j == (int)gIterTests[i].numResultVerbs);
2884 }
2885
2886 p.reset();
2887 iter.setPath(p, false);
2888 REPORTER_ASSERT(reporter, !iter.isClosedContour());
2889 p.lineTo(1, 1);
2890 p.close();
2891 iter.setPath(p, false);
2892 REPORTER_ASSERT(reporter, iter.isClosedContour());
2893 p.reset();
2894 iter.setPath(p, true);
2895 REPORTER_ASSERT(reporter, !iter.isClosedContour());
2896 p.lineTo(1, 1);
2897 iter.setPath(p, true);
2898 REPORTER_ASSERT(reporter, iter.isClosedContour());
2899 p.moveTo(0, 0);
2900 p.lineTo(2, 2);
2901 iter.setPath(p, false);
2902 REPORTER_ASSERT(reporter, !iter.isClosedContour());
2903
2904 // this checks to see if the NaN logic is executed in SkPath::autoClose(), but does not
2905 // check to see if the result is correct.
2906 for (int setNaN = 0; setNaN < 4; ++setNaN) {
2907 p.reset();
2908 p.moveTo(setNaN == 0 ? SK_ScalarNaN : 0, setNaN == 1 ? SK_ScalarNaN : 0);
2909 p.lineTo(setNaN == 2 ? SK_ScalarNaN : 1, setNaN == 3 ? SK_ScalarNaN : 1);
2910 iter.setPath(p, true);
2911 iter.next(pts, false);
2912 iter.next(pts, false);
2913 REPORTER_ASSERT(reporter, SkPath::kClose_Verb == iter.next(pts, false));
2914 }
2915
2916 p.reset();
2917 p.quadTo(0, 0, 0, 0);
2918 iter.setPath(p, false);
2919 iter.next(pts, false);
2920 REPORTER_ASSERT(reporter, SkPath::kQuad_Verb == iter.next(pts, false));
2921 iter.setPath(p, false);
2922 iter.next(pts, false);
2923 REPORTER_ASSERT(reporter, SkPath::kDone_Verb == iter.next(pts, true));
2924
2925 p.reset();
2926 p.conicTo(0, 0, 0, 0, 0.5f);
2927 iter.setPath(p, false);
2928 iter.next(pts, false);
2929 REPORTER_ASSERT(reporter, SkPath::kConic_Verb == iter.next(pts, false));
2930 iter.setPath(p, false);
2931 iter.next(pts, false);
2932 REPORTER_ASSERT(reporter, SkPath::kDone_Verb == iter.next(pts, true));
2933
2934 p.reset();
2935 p.cubicTo(0, 0, 0, 0, 0, 0);
2936 iter.setPath(p, false);
2937 iter.next(pts, false);
2938 REPORTER_ASSERT(reporter, SkPath::kCubic_Verb == iter.next(pts, false));
2939 iter.setPath(p, false);
2940 iter.next(pts, false);
2941 REPORTER_ASSERT(reporter, SkPath::kDone_Verb == iter.next(pts, true));
2942
2943 p.moveTo(1, 1); // add a trailing moveto
2944 iter.setPath(p, false);
2945 iter.next(pts, false);
2946 REPORTER_ASSERT(reporter, SkPath::kCubic_Verb == iter.next(pts, false));
2947 iter.setPath(p, false);
2948 iter.next(pts, false);
2949 REPORTER_ASSERT(reporter, SkPath::kDone_Verb == iter.next(pts, true));
2950
2951 // The GM degeneratesegments.cpp test is more extensive
2952
2953 // Test out mixed degenerate and non-degenerate geometry with Conics
2954 const SkVector radii[4] = { { 0, 0 }, { 0, 0 }, { 0, 0 }, { 100, 100 } };
2955 SkRect r = SkRect::MakeWH(100, 100);
2956 SkRRect rr;
2957 rr.setRectRadii(r, radii);
2958 p.reset();
2959 p.addRRect(rr);
2960 iter.setPath(p, false);
2961 REPORTER_ASSERT(reporter, SkPath::kMove_Verb == iter.next(pts));
2962 REPORTER_ASSERT(reporter, SkPath::kLine_Verb == iter.next(pts));
2963 REPORTER_ASSERT(reporter, SkPath::kLine_Verb == iter.next(pts));
2964 REPORTER_ASSERT(reporter, SkPath::kConic_Verb == iter.next(pts));
2965 REPORTER_ASSERT(reporter, SK_ScalarRoot2Over2 == iter.conicWeight());
2966 }
2967
test_raw_iter(skiatest::Reporter * reporter)2968 static void test_raw_iter(skiatest::Reporter* reporter) {
2969 SkPath p;
2970 SkPoint pts[4];
2971
2972 // Test an iterator with no path
2973 SkPath::RawIter noPathIter;
2974 REPORTER_ASSERT(reporter, noPathIter.next(pts) == SkPath::kDone_Verb);
2975 // Test that setting an empty path works
2976 noPathIter.setPath(p);
2977 REPORTER_ASSERT(reporter, noPathIter.next(pts) == SkPath::kDone_Verb);
2978
2979 // Test an iterator with an initial empty path
2980 SkPath::RawIter iter(p);
2981 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kDone_Verb);
2982
2983 // Test that a move-only path returns the move.
2984 p.moveTo(SK_Scalar1, 0);
2985 iter.setPath(p);
2986 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kMove_Verb);
2987 REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1);
2988 REPORTER_ASSERT(reporter, pts[0].fY == 0);
2989 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kDone_Verb);
2990
2991 // No matter how many moves we add, we should get them all back
2992 p.moveTo(SK_Scalar1*2, SK_Scalar1);
2993 p.moveTo(SK_Scalar1*3, SK_Scalar1*2);
2994 iter.setPath(p);
2995 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kMove_Verb);
2996 REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1);
2997 REPORTER_ASSERT(reporter, pts[0].fY == 0);
2998 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kMove_Verb);
2999 REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1*2);
3000 REPORTER_ASSERT(reporter, pts[0].fY == SK_Scalar1);
3001 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kMove_Verb);
3002 REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1*3);
3003 REPORTER_ASSERT(reporter, pts[0].fY == SK_Scalar1*2);
3004 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kDone_Verb);
3005
3006 // Initial close is never ever stored
3007 p.reset();
3008 p.close();
3009 iter.setPath(p);
3010 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kDone_Verb);
3011
3012 // Move/close sequences
3013 p.reset();
3014 p.close(); // Not stored, no purpose
3015 p.moveTo(SK_Scalar1, 0);
3016 p.close();
3017 p.close(); // Not stored, no purpose
3018 p.moveTo(SK_Scalar1*2, SK_Scalar1);
3019 p.close();
3020 p.moveTo(SK_Scalar1*3, SK_Scalar1*2);
3021 p.moveTo(SK_Scalar1*4, SK_Scalar1*3);
3022 p.close();
3023 iter.setPath(p);
3024 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kMove_Verb);
3025 REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1);
3026 REPORTER_ASSERT(reporter, pts[0].fY == 0);
3027 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kClose_Verb);
3028 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kMove_Verb);
3029 REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1*2);
3030 REPORTER_ASSERT(reporter, pts[0].fY == SK_Scalar1);
3031 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kClose_Verb);
3032 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kMove_Verb);
3033 REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1*3);
3034 REPORTER_ASSERT(reporter, pts[0].fY == SK_Scalar1*2);
3035 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kMove_Verb);
3036 REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1*4);
3037 REPORTER_ASSERT(reporter, pts[0].fY == SK_Scalar1*3);
3038 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kClose_Verb);
3039 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kDone_Verb);
3040
3041 // Generate random paths and verify
3042 SkPoint randomPts[25];
3043 for (int i = 0; i < 5; ++i) {
3044 for (int j = 0; j < 5; ++j) {
3045 randomPts[i*5+j].set(SK_Scalar1*i, SK_Scalar1*j);
3046 }
3047 }
3048
3049 // Max of 10 segments, max 3 points per segment
3050 SkRandom rand(9876543);
3051 SkPoint expectedPts[31]; // May have leading moveTo
3052 SkPath::Verb expectedVerbs[22]; // May have leading moveTo
3053 SkPath::Verb nextVerb;
3054
3055 for (int i = 0; i < 500; ++i) {
3056 p.reset();
3057 bool lastWasClose = true;
3058 bool haveMoveTo = false;
3059 SkPoint lastMoveToPt = { 0, 0 };
3060 int numPoints = 0;
3061 int numVerbs = (rand.nextU() >> 16) % 10;
3062 int numIterVerbs = 0;
3063 for (int j = 0; j < numVerbs; ++j) {
3064 do {
3065 nextVerb = static_cast<SkPath::Verb>((rand.nextU() >> 16) % SkPath::kDone_Verb);
3066 } while (lastWasClose && nextVerb == SkPath::kClose_Verb);
3067 switch (nextVerb) {
3068 case SkPath::kMove_Verb:
3069 expectedPts[numPoints] = randomPts[(rand.nextU() >> 16) % 25];
3070 p.moveTo(expectedPts[numPoints]);
3071 lastMoveToPt = expectedPts[numPoints];
3072 numPoints += 1;
3073 lastWasClose = false;
3074 haveMoveTo = true;
3075 break;
3076 case SkPath::kLine_Verb:
3077 if (!haveMoveTo) {
3078 expectedPts[numPoints++] = lastMoveToPt;
3079 expectedVerbs[numIterVerbs++] = SkPath::kMove_Verb;
3080 haveMoveTo = true;
3081 }
3082 expectedPts[numPoints] = randomPts[(rand.nextU() >> 16) % 25];
3083 p.lineTo(expectedPts[numPoints]);
3084 numPoints += 1;
3085 lastWasClose = false;
3086 break;
3087 case SkPath::kQuad_Verb:
3088 if (!haveMoveTo) {
3089 expectedPts[numPoints++] = lastMoveToPt;
3090 expectedVerbs[numIterVerbs++] = SkPath::kMove_Verb;
3091 haveMoveTo = true;
3092 }
3093 expectedPts[numPoints] = randomPts[(rand.nextU() >> 16) % 25];
3094 expectedPts[numPoints + 1] = randomPts[(rand.nextU() >> 16) % 25];
3095 p.quadTo(expectedPts[numPoints], expectedPts[numPoints + 1]);
3096 numPoints += 2;
3097 lastWasClose = false;
3098 break;
3099 case SkPath::kConic_Verb:
3100 if (!haveMoveTo) {
3101 expectedPts[numPoints++] = lastMoveToPt;
3102 expectedVerbs[numIterVerbs++] = SkPath::kMove_Verb;
3103 haveMoveTo = true;
3104 }
3105 expectedPts[numPoints] = randomPts[(rand.nextU() >> 16) % 25];
3106 expectedPts[numPoints + 1] = randomPts[(rand.nextU() >> 16) % 25];
3107 p.conicTo(expectedPts[numPoints], expectedPts[numPoints + 1],
3108 rand.nextUScalar1() * 4);
3109 numPoints += 2;
3110 lastWasClose = false;
3111 break;
3112 case SkPath::kCubic_Verb:
3113 if (!haveMoveTo) {
3114 expectedPts[numPoints++] = lastMoveToPt;
3115 expectedVerbs[numIterVerbs++] = SkPath::kMove_Verb;
3116 haveMoveTo = true;
3117 }
3118 expectedPts[numPoints] = randomPts[(rand.nextU() >> 16) % 25];
3119 expectedPts[numPoints + 1] = randomPts[(rand.nextU() >> 16) % 25];
3120 expectedPts[numPoints + 2] = randomPts[(rand.nextU() >> 16) % 25];
3121 p.cubicTo(expectedPts[numPoints], expectedPts[numPoints + 1],
3122 expectedPts[numPoints + 2]);
3123 numPoints += 3;
3124 lastWasClose = false;
3125 break;
3126 case SkPath::kClose_Verb:
3127 p.close();
3128 haveMoveTo = false;
3129 lastWasClose = true;
3130 break;
3131 default:
3132 SkDEBUGFAIL("unexpected verb");
3133 }
3134 expectedVerbs[numIterVerbs++] = nextVerb;
3135 }
3136
3137 iter.setPath(p);
3138 numVerbs = numIterVerbs;
3139 numIterVerbs = 0;
3140 int numIterPts = 0;
3141 SkPoint lastMoveTo;
3142 SkPoint lastPt;
3143 lastMoveTo.set(0, 0);
3144 lastPt.set(0, 0);
3145 while ((nextVerb = iter.next(pts)) != SkPath::kDone_Verb) {
3146 REPORTER_ASSERT(reporter, nextVerb == expectedVerbs[numIterVerbs]);
3147 numIterVerbs++;
3148 switch (nextVerb) {
3149 case SkPath::kMove_Verb:
3150 REPORTER_ASSERT(reporter, numIterPts < numPoints);
3151 REPORTER_ASSERT(reporter, pts[0] == expectedPts[numIterPts]);
3152 lastPt = lastMoveTo = pts[0];
3153 numIterPts += 1;
3154 break;
3155 case SkPath::kLine_Verb:
3156 REPORTER_ASSERT(reporter, numIterPts < numPoints + 1);
3157 REPORTER_ASSERT(reporter, pts[0] == lastPt);
3158 REPORTER_ASSERT(reporter, pts[1] == expectedPts[numIterPts]);
3159 lastPt = pts[1];
3160 numIterPts += 1;
3161 break;
3162 case SkPath::kQuad_Verb:
3163 case SkPath::kConic_Verb:
3164 REPORTER_ASSERT(reporter, numIterPts < numPoints + 2);
3165 REPORTER_ASSERT(reporter, pts[0] == lastPt);
3166 REPORTER_ASSERT(reporter, pts[1] == expectedPts[numIterPts]);
3167 REPORTER_ASSERT(reporter, pts[2] == expectedPts[numIterPts + 1]);
3168 lastPt = pts[2];
3169 numIterPts += 2;
3170 break;
3171 case SkPath::kCubic_Verb:
3172 REPORTER_ASSERT(reporter, numIterPts < numPoints + 3);
3173 REPORTER_ASSERT(reporter, pts[0] == lastPt);
3174 REPORTER_ASSERT(reporter, pts[1] == expectedPts[numIterPts]);
3175 REPORTER_ASSERT(reporter, pts[2] == expectedPts[numIterPts + 1]);
3176 REPORTER_ASSERT(reporter, pts[3] == expectedPts[numIterPts + 2]);
3177 lastPt = pts[3];
3178 numIterPts += 3;
3179 break;
3180 case SkPath::kClose_Verb:
3181 lastPt = lastMoveTo;
3182 break;
3183 default:
3184 SkDEBUGFAIL("unexpected verb");
3185 }
3186 }
3187 REPORTER_ASSERT(reporter, numIterPts == numPoints);
3188 REPORTER_ASSERT(reporter, numIterVerbs == numVerbs);
3189 }
3190 }
3191
check_for_circle(skiatest::Reporter * reporter,const SkPath & path,bool expectedCircle,SkPathPriv::FirstDirection expectedDir)3192 static void check_for_circle(skiatest::Reporter* reporter,
3193 const SkPath& path,
3194 bool expectedCircle,
3195 SkPathPriv::FirstDirection expectedDir) {
3196 SkRect rect = SkRect::MakeEmpty();
3197 REPORTER_ASSERT(reporter, path.isOval(&rect) == expectedCircle);
3198 SkPath::Direction isOvalDir;
3199 unsigned isOvalStart;
3200 if (SkPathPriv::IsOval(path, &rect, &isOvalDir, &isOvalStart)) {
3201 REPORTER_ASSERT(reporter, rect.height() == rect.width());
3202 REPORTER_ASSERT(reporter, SkPathPriv::AsFirstDirection(isOvalDir) == expectedDir);
3203 SkPath tmpPath;
3204 tmpPath.addOval(rect, isOvalDir, isOvalStart);
3205 REPORTER_ASSERT(reporter, path == tmpPath);
3206 }
3207 REPORTER_ASSERT(reporter, SkPathPriv::CheapIsFirstDirection(path, expectedDir));
3208 }
3209
test_circle_skew(skiatest::Reporter * reporter,const SkPath & path,SkPathPriv::FirstDirection dir)3210 static void test_circle_skew(skiatest::Reporter* reporter,
3211 const SkPath& path,
3212 SkPathPriv::FirstDirection dir) {
3213 SkPath tmp;
3214
3215 SkMatrix m;
3216 m.setSkew(SkIntToScalar(3), SkIntToScalar(5));
3217 path.transform(m, &tmp);
3218 // this matrix reverses the direction.
3219 if (SkPathPriv::kCCW_FirstDirection == dir) {
3220 dir = SkPathPriv::kCW_FirstDirection;
3221 } else {
3222 REPORTER_ASSERT(reporter, SkPathPriv::kCW_FirstDirection == dir);
3223 dir = SkPathPriv::kCCW_FirstDirection;
3224 }
3225 check_for_circle(reporter, tmp, false, dir);
3226 }
3227
test_circle_translate(skiatest::Reporter * reporter,const SkPath & path,SkPathPriv::FirstDirection dir)3228 static void test_circle_translate(skiatest::Reporter* reporter,
3229 const SkPath& path,
3230 SkPathPriv::FirstDirection dir) {
3231 SkPath tmp;
3232
3233 // translate at small offset
3234 SkMatrix m;
3235 m.setTranslate(SkIntToScalar(15), SkIntToScalar(15));
3236 path.transform(m, &tmp);
3237 check_for_circle(reporter, tmp, true, dir);
3238
3239 tmp.reset();
3240 m.reset();
3241
3242 // translate at a relatively big offset
3243 m.setTranslate(SkIntToScalar(1000), SkIntToScalar(1000));
3244 path.transform(m, &tmp);
3245 check_for_circle(reporter, tmp, true, dir);
3246 }
3247
test_circle_rotate(skiatest::Reporter * reporter,const SkPath & path,SkPathPriv::FirstDirection dir)3248 static void test_circle_rotate(skiatest::Reporter* reporter,
3249 const SkPath& path,
3250 SkPathPriv::FirstDirection dir) {
3251 for (int angle = 0; angle < 360; ++angle) {
3252 SkPath tmp;
3253 SkMatrix m;
3254 m.setRotate(SkIntToScalar(angle));
3255 path.transform(m, &tmp);
3256
3257 // TODO: a rotated circle whose rotated angle is not a multiple of 90
3258 // degrees is not an oval anymore, this can be improved. we made this
3259 // for the simplicity of our implementation.
3260 if (angle % 90 == 0) {
3261 check_for_circle(reporter, tmp, true, dir);
3262 } else {
3263 check_for_circle(reporter, tmp, false, dir);
3264 }
3265 }
3266 }
3267
test_circle_mirror_x(skiatest::Reporter * reporter,const SkPath & path,SkPathPriv::FirstDirection dir)3268 static void test_circle_mirror_x(skiatest::Reporter* reporter,
3269 const SkPath& path,
3270 SkPathPriv::FirstDirection dir) {
3271 SkPath tmp;
3272 SkMatrix m;
3273 m.reset();
3274 m.setScaleX(-SK_Scalar1);
3275 path.transform(m, &tmp);
3276 if (SkPathPriv::kCW_FirstDirection == dir) {
3277 dir = SkPathPriv::kCCW_FirstDirection;
3278 } else {
3279 REPORTER_ASSERT(reporter, SkPathPriv::kCCW_FirstDirection == dir);
3280 dir = SkPathPriv::kCW_FirstDirection;
3281 }
3282 check_for_circle(reporter, tmp, true, dir);
3283 }
3284
test_circle_mirror_y(skiatest::Reporter * reporter,const SkPath & path,SkPathPriv::FirstDirection dir)3285 static void test_circle_mirror_y(skiatest::Reporter* reporter,
3286 const SkPath& path,
3287 SkPathPriv::FirstDirection dir) {
3288 SkPath tmp;
3289 SkMatrix m;
3290 m.reset();
3291 m.setScaleY(-SK_Scalar1);
3292 path.transform(m, &tmp);
3293
3294 if (SkPathPriv::kCW_FirstDirection == dir) {
3295 dir = SkPathPriv::kCCW_FirstDirection;
3296 } else {
3297 REPORTER_ASSERT(reporter, SkPathPriv::kCCW_FirstDirection == dir);
3298 dir = SkPathPriv::kCW_FirstDirection;
3299 }
3300
3301 check_for_circle(reporter, tmp, true, dir);
3302 }
3303
test_circle_mirror_xy(skiatest::Reporter * reporter,const SkPath & path,SkPathPriv::FirstDirection dir)3304 static void test_circle_mirror_xy(skiatest::Reporter* reporter,
3305 const SkPath& path,
3306 SkPathPriv::FirstDirection dir) {
3307 SkPath tmp;
3308 SkMatrix m;
3309 m.reset();
3310 m.setScaleX(-SK_Scalar1);
3311 m.setScaleY(-SK_Scalar1);
3312 path.transform(m, &tmp);
3313
3314 check_for_circle(reporter, tmp, true, dir);
3315 }
3316
test_circle_with_direction(skiatest::Reporter * reporter,SkPath::Direction inDir)3317 static void test_circle_with_direction(skiatest::Reporter* reporter,
3318 SkPath::Direction inDir) {
3319 const SkPathPriv::FirstDirection dir = SkPathPriv::AsFirstDirection(inDir);
3320 SkPath path;
3321
3322 // circle at origin
3323 path.addCircle(0, 0, SkIntToScalar(20), inDir);
3324
3325 check_for_circle(reporter, path, true, dir);
3326 test_circle_rotate(reporter, path, dir);
3327 test_circle_translate(reporter, path, dir);
3328 test_circle_skew(reporter, path, dir);
3329 test_circle_mirror_x(reporter, path, dir);
3330 test_circle_mirror_y(reporter, path, dir);
3331 test_circle_mirror_xy(reporter, path, dir);
3332
3333 // circle at an offset at (10, 10)
3334 path.reset();
3335 path.addCircle(SkIntToScalar(10), SkIntToScalar(10),
3336 SkIntToScalar(20), inDir);
3337
3338 check_for_circle(reporter, path, true, dir);
3339 test_circle_rotate(reporter, path, dir);
3340 test_circle_translate(reporter, path, dir);
3341 test_circle_skew(reporter, path, dir);
3342 test_circle_mirror_x(reporter, path, dir);
3343 test_circle_mirror_y(reporter, path, dir);
3344 test_circle_mirror_xy(reporter, path, dir);
3345
3346 // Try different starting points for the contour.
3347 for (unsigned start = 0; start < 4; ++start) {
3348 path.reset();
3349 path.addOval(SkRect::MakeXYWH(20, 10, 5, 5), inDir, start);
3350 test_circle_rotate(reporter, path, dir);
3351 test_circle_translate(reporter, path, dir);
3352 test_circle_skew(reporter, path, dir);
3353 test_circle_mirror_x(reporter, path, dir);
3354 test_circle_mirror_y(reporter, path, dir);
3355 test_circle_mirror_xy(reporter, path, dir);
3356 }
3357 }
3358
test_circle_with_add_paths(skiatest::Reporter * reporter)3359 static void test_circle_with_add_paths(skiatest::Reporter* reporter) {
3360 SkPath path;
3361 SkPath circle;
3362 SkPath rect;
3363 SkPath empty;
3364
3365 const SkPath::Direction kCircleDir = SkPath::kCW_Direction;
3366 const SkPath::Direction kCircleDirOpposite = SkPath::kCCW_Direction;
3367
3368 circle.addCircle(0, 0, SkIntToScalar(10), kCircleDir);
3369 rect.addRect(SkIntToScalar(5), SkIntToScalar(5),
3370 SkIntToScalar(20), SkIntToScalar(20), SkPath::kCW_Direction);
3371
3372 SkMatrix translate;
3373 translate.setTranslate(SkIntToScalar(12), SkIntToScalar(12));
3374
3375 // Although all the path concatenation related operations leave
3376 // the path a circle, most mark it as a non-circle for simplicity
3377
3378 // empty + circle (translate)
3379 path = empty;
3380 path.addPath(circle, translate);
3381 check_for_circle(reporter, path, false, SkPathPriv::AsFirstDirection(kCircleDir));
3382
3383 // circle + empty (translate)
3384 path = circle;
3385 path.addPath(empty, translate);
3386
3387 check_for_circle(reporter, path, true, SkPathPriv::AsFirstDirection(kCircleDir));
3388
3389 // test reverseAddPath
3390 path = circle;
3391 path.reverseAddPath(rect);
3392 check_for_circle(reporter, path, false, SkPathPriv::AsFirstDirection(kCircleDirOpposite));
3393 }
3394
test_circle(skiatest::Reporter * reporter)3395 static void test_circle(skiatest::Reporter* reporter) {
3396 test_circle_with_direction(reporter, SkPath::kCW_Direction);
3397 test_circle_with_direction(reporter, SkPath::kCCW_Direction);
3398
3399 // multiple addCircle()
3400 SkPath path;
3401 path.addCircle(0, 0, SkIntToScalar(10), SkPath::kCW_Direction);
3402 path.addCircle(0, 0, SkIntToScalar(20), SkPath::kCW_Direction);
3403 check_for_circle(reporter, path, false, SkPathPriv::kCW_FirstDirection);
3404
3405 // some extra lineTo() would make isOval() fail
3406 path.reset();
3407 path.addCircle(0, 0, SkIntToScalar(10), SkPath::kCW_Direction);
3408 path.lineTo(0, 0);
3409 check_for_circle(reporter, path, false, SkPathPriv::kCW_FirstDirection);
3410
3411 // not back to the original point
3412 path.reset();
3413 path.addCircle(0, 0, SkIntToScalar(10), SkPath::kCW_Direction);
3414 path.setLastPt(SkIntToScalar(5), SkIntToScalar(5));
3415 check_for_circle(reporter, path, false, SkPathPriv::kCW_FirstDirection);
3416
3417 test_circle_with_add_paths(reporter);
3418
3419 // test negative radius
3420 path.reset();
3421 path.addCircle(0, 0, -1, SkPath::kCW_Direction);
3422 REPORTER_ASSERT(reporter, path.isEmpty());
3423 }
3424
test_oval(skiatest::Reporter * reporter)3425 static void test_oval(skiatest::Reporter* reporter) {
3426 SkRect rect;
3427 SkMatrix m;
3428 SkPath path;
3429 unsigned start = 0;
3430 SkPath::Direction dir = SkPath::kCCW_Direction;
3431
3432 rect = SkRect::MakeWH(SkIntToScalar(30), SkIntToScalar(50));
3433 path.addOval(rect);
3434
3435 // Defaults to dir = CW and start = 1
3436 REPORTER_ASSERT(reporter, path.isOval(nullptr));
3437
3438 m.setRotate(SkIntToScalar(90));
3439 SkPath tmp;
3440 path.transform(m, &tmp);
3441 // an oval rotated 90 degrees is still an oval. The start index changes from 1 to 2. Direction
3442 // is unchanged.
3443 REPORTER_ASSERT(reporter, SkPathPriv::IsOval(tmp, nullptr, &dir, &start));
3444 REPORTER_ASSERT(reporter, 2 == start);
3445 REPORTER_ASSERT(reporter, SkPath::kCW_Direction == dir);
3446
3447 m.reset();
3448 m.setRotate(SkIntToScalar(30));
3449 tmp.reset();
3450 path.transform(m, &tmp);
3451 // an oval rotated 30 degrees is not an oval anymore.
3452 REPORTER_ASSERT(reporter, !tmp.isOval(nullptr));
3453
3454 // since empty path being transformed.
3455 path.reset();
3456 tmp.reset();
3457 m.reset();
3458 path.transform(m, &tmp);
3459 REPORTER_ASSERT(reporter, !tmp.isOval(nullptr));
3460
3461 // empty path is not an oval
3462 tmp.reset();
3463 REPORTER_ASSERT(reporter, !tmp.isOval(nullptr));
3464
3465 // only has moveTo()s
3466 tmp.reset();
3467 tmp.moveTo(0, 0);
3468 tmp.moveTo(SkIntToScalar(10), SkIntToScalar(10));
3469 REPORTER_ASSERT(reporter, !tmp.isOval(nullptr));
3470
3471 // mimic WebKit's calling convention,
3472 // call moveTo() first and then call addOval()
3473 path.reset();
3474 path.moveTo(0, 0);
3475 path.addOval(rect);
3476 REPORTER_ASSERT(reporter, path.isOval(nullptr));
3477
3478 // copy path
3479 path.reset();
3480 tmp.reset();
3481 tmp.addOval(rect);
3482 path = tmp;
3483 REPORTER_ASSERT(reporter, SkPathPriv::IsOval(path, nullptr, &dir, &start));
3484 REPORTER_ASSERT(reporter, SkPath::kCW_Direction == dir);
3485 REPORTER_ASSERT(reporter, 1 == start);
3486 }
3487
test_empty(skiatest::Reporter * reporter,const SkPath & p)3488 static void test_empty(skiatest::Reporter* reporter, const SkPath& p) {
3489 SkPath empty;
3490
3491 REPORTER_ASSERT(reporter, p.isEmpty());
3492 REPORTER_ASSERT(reporter, 0 == p.countPoints());
3493 REPORTER_ASSERT(reporter, 0 == p.countVerbs());
3494 REPORTER_ASSERT(reporter, 0 == p.getSegmentMasks());
3495 REPORTER_ASSERT(reporter, p.isConvex());
3496 REPORTER_ASSERT(reporter, p.getFillType() == SkPath::kWinding_FillType);
3497 REPORTER_ASSERT(reporter, !p.isInverseFillType());
3498 REPORTER_ASSERT(reporter, p == empty);
3499 REPORTER_ASSERT(reporter, !(p != empty));
3500 }
3501
test_rrect_is_convex(skiatest::Reporter * reporter,SkPath * path,SkPath::Direction dir)3502 static void test_rrect_is_convex(skiatest::Reporter* reporter, SkPath* path,
3503 SkPath::Direction dir) {
3504 REPORTER_ASSERT(reporter, path->isConvex());
3505 REPORTER_ASSERT(reporter, SkPathPriv::CheapIsFirstDirection(*path, SkPathPriv::AsFirstDirection(dir)));
3506 path->setConvexity(SkPath::kUnknown_Convexity);
3507 REPORTER_ASSERT(reporter, path->isConvex());
3508 path->reset();
3509 }
3510
test_rrect_convexity_is_unknown(skiatest::Reporter * reporter,SkPath * path,SkPath::Direction dir)3511 static void test_rrect_convexity_is_unknown(skiatest::Reporter* reporter, SkPath* path,
3512 SkPath::Direction dir) {
3513 REPORTER_ASSERT(reporter, path->isConvex());
3514 REPORTER_ASSERT(reporter, SkPathPriv::CheapIsFirstDirection(*path, SkPathPriv::AsFirstDirection(dir)));
3515 path->setConvexity(SkPath::kUnknown_Convexity);
3516 REPORTER_ASSERT(reporter, path->getConvexity() == SkPath::kUnknown_Convexity);
3517 path->reset();
3518 }
3519
test_rrect(skiatest::Reporter * reporter)3520 static void test_rrect(skiatest::Reporter* reporter) {
3521 SkPath p;
3522 SkRRect rr;
3523 SkVector radii[] = {{1, 2}, {3, 4}, {5, 6}, {7, 8}};
3524 SkRect r = {10, 20, 30, 40};
3525 rr.setRectRadii(r, radii);
3526 p.addRRect(rr);
3527 test_rrect_is_convex(reporter, &p, SkPath::kCW_Direction);
3528 p.addRRect(rr, SkPath::kCCW_Direction);
3529 test_rrect_is_convex(reporter, &p, SkPath::kCCW_Direction);
3530 p.addRoundRect(r, &radii[0].fX);
3531 test_rrect_is_convex(reporter, &p, SkPath::kCW_Direction);
3532 p.addRoundRect(r, &radii[0].fX, SkPath::kCCW_Direction);
3533 test_rrect_is_convex(reporter, &p, SkPath::kCCW_Direction);
3534 p.addRoundRect(r, radii[1].fX, radii[1].fY);
3535 test_rrect_is_convex(reporter, &p, SkPath::kCW_Direction);
3536 p.addRoundRect(r, radii[1].fX, radii[1].fY, SkPath::kCCW_Direction);
3537 test_rrect_is_convex(reporter, &p, SkPath::kCCW_Direction);
3538 for (size_t i = 0; i < SK_ARRAY_COUNT(radii); ++i) {
3539 SkVector save = radii[i];
3540 radii[i].set(0, 0);
3541 rr.setRectRadii(r, radii);
3542 p.addRRect(rr);
3543 test_rrect_is_convex(reporter, &p, SkPath::kCW_Direction);
3544 radii[i] = save;
3545 }
3546 p.addRoundRect(r, 0, 0);
3547 SkRect returnedRect;
3548 REPORTER_ASSERT(reporter, p.isRect(&returnedRect));
3549 REPORTER_ASSERT(reporter, returnedRect == r);
3550 test_rrect_is_convex(reporter, &p, SkPath::kCW_Direction);
3551 SkVector zeroRadii[] = {{0, 0}, {0, 0}, {0, 0}, {0, 0}};
3552 rr.setRectRadii(r, zeroRadii);
3553 p.addRRect(rr);
3554 bool closed;
3555 SkPath::Direction dir;
3556 REPORTER_ASSERT(reporter, p.isRect(nullptr, &closed, &dir));
3557 REPORTER_ASSERT(reporter, closed);
3558 REPORTER_ASSERT(reporter, SkPath::kCW_Direction == dir);
3559 test_rrect_is_convex(reporter, &p, SkPath::kCW_Direction);
3560 p.addRRect(rr, SkPath::kCW_Direction);
3561 p.addRRect(rr, SkPath::kCW_Direction);
3562 REPORTER_ASSERT(reporter, !p.isConvex());
3563 p.reset();
3564 p.addRRect(rr, SkPath::kCCW_Direction);
3565 p.addRRect(rr, SkPath::kCCW_Direction);
3566 REPORTER_ASSERT(reporter, !p.isConvex());
3567 p.reset();
3568 SkRect emptyR = {10, 20, 10, 30};
3569 rr.setRectRadii(emptyR, radii);
3570 p.addRRect(rr);
3571 // The round rect is "empty" in that it has no fill area. However,
3572 // the path isn't "empty" in that it should have verbs and points.
3573 REPORTER_ASSERT(reporter, !p.isEmpty());
3574 p.reset();
3575 SkRect largeR = {0, 0, SK_ScalarMax, SK_ScalarMax};
3576 rr.setRectRadii(largeR, radii);
3577 p.addRRect(rr);
3578 test_rrect_convexity_is_unknown(reporter, &p, SkPath::kCW_Direction);
3579
3580 // we check for non-finites
3581 SkRect infR = {0, 0, SK_ScalarMax, SK_ScalarInfinity};
3582 rr.setRectRadii(infR, radii);
3583 REPORTER_ASSERT(reporter, rr.isEmpty());
3584
3585 SkRect tinyR = {0, 0, 1e-9f, 1e-9f};
3586 p.addRoundRect(tinyR, 5e-11f, 5e-11f);
3587 test_rrect_is_convex(reporter, &p, SkPath::kCW_Direction);
3588 }
3589
test_arc(skiatest::Reporter * reporter)3590 static void test_arc(skiatest::Reporter* reporter) {
3591 SkPath p;
3592 SkRect emptyOval = {10, 20, 30, 20};
3593 REPORTER_ASSERT(reporter, emptyOval.isEmpty());
3594 p.addArc(emptyOval, 1, 2);
3595 REPORTER_ASSERT(reporter, p.isEmpty());
3596 p.reset();
3597 SkRect oval = {10, 20, 30, 40};
3598 p.addArc(oval, 1, 0);
3599 REPORTER_ASSERT(reporter, p.isEmpty());
3600 p.reset();
3601 SkPath cwOval;
3602 cwOval.addOval(oval);
3603 p.addArc(oval, 0, 360);
3604 REPORTER_ASSERT(reporter, p == cwOval);
3605 p.reset();
3606 SkPath ccwOval;
3607 ccwOval.addOval(oval, SkPath::kCCW_Direction);
3608 p.addArc(oval, 0, -360);
3609 REPORTER_ASSERT(reporter, p == ccwOval);
3610 p.reset();
3611 p.addArc(oval, 1, 180);
3612 REPORTER_ASSERT(reporter, p.isConvex());
3613 REPORTER_ASSERT(reporter, SkPathPriv::CheapIsFirstDirection(p, SkPathPriv::kCW_FirstDirection));
3614 p.setConvexity(SkPath::kUnknown_Convexity);
3615 REPORTER_ASSERT(reporter, p.isConvex());
3616 }
3617
oval_start_index_to_angle(unsigned start)3618 static inline SkScalar oval_start_index_to_angle(unsigned start) {
3619 switch (start) {
3620 case 0:
3621 return 270.f;
3622 case 1:
3623 return 0.f;
3624 case 2:
3625 return 90.f;
3626 case 3:
3627 return 180.f;
3628 default:
3629 return -1.f;
3630 }
3631 }
3632
canonical_start_angle(float angle)3633 static inline SkScalar canonical_start_angle(float angle) {
3634 while (angle < 0.f) {
3635 angle += 360.f;
3636 }
3637 while (angle >= 360.f) {
3638 angle -= 360.f;
3639 }
3640 return angle;
3641 }
3642
check_oval_arc(skiatest::Reporter * reporter,SkScalar start,SkScalar sweep,const SkPath & path)3643 static void check_oval_arc(skiatest::Reporter* reporter, SkScalar start, SkScalar sweep,
3644 const SkPath& path) {
3645 SkRect r = SkRect::MakeEmpty();
3646 SkPath::Direction d = SkPath::kCCW_Direction;
3647 unsigned s = ~0U;
3648 bool isOval = SkPathPriv::IsOval(path, &r, &d, &s);
3649 REPORTER_ASSERT(reporter, isOval);
3650 SkPath recreatedPath;
3651 recreatedPath.addOval(r, d, s);
3652 REPORTER_ASSERT(reporter, path == recreatedPath);
3653 REPORTER_ASSERT(reporter, oval_start_index_to_angle(s) == canonical_start_angle(start));
3654 REPORTER_ASSERT(reporter, (SkPath::kCW_Direction == d) == (sweep > 0.f));
3655 }
3656
test_arc_ovals(skiatest::Reporter * reporter)3657 static void test_arc_ovals(skiatest::Reporter* reporter) {
3658 SkRect oval = SkRect::MakeWH(10, 20);
3659 for (SkScalar sweep : {-720.f, -540.f, -360.f, 360.f, 432.f, 720.f}) {
3660 for (SkScalar start = -360.f; start <= 360.f; start += 1.f) {
3661 SkPath path;
3662 path.addArc(oval, start, sweep);
3663 // SkPath's interfaces for inserting and extracting ovals only allow contours
3664 // to start at multiples of 90 degrees.
3665 if (std::fmod(start, 90.f) == 0) {
3666 check_oval_arc(reporter, start, sweep, path);
3667 } else {
3668 REPORTER_ASSERT(reporter, !path.isOval(nullptr));
3669 }
3670 }
3671 // Test start angles that are nearly at valid oval start angles.
3672 for (float start : {-180.f, -90.f, 90.f, 180.f}) {
3673 for (float delta : {-SK_ScalarNearlyZero, SK_ScalarNearlyZero}) {
3674 SkPath path;
3675 path.addArc(oval, start + delta, sweep);
3676 check_oval_arc(reporter, start, sweep, path);
3677 }
3678 }
3679 }
3680 }
3681
check_move(skiatest::Reporter * reporter,SkPath::RawIter * iter,SkScalar x0,SkScalar y0)3682 static void check_move(skiatest::Reporter* reporter, SkPath::RawIter* iter,
3683 SkScalar x0, SkScalar y0) {
3684 SkPoint pts[4];
3685 SkPath::Verb v = iter->next(pts);
3686 REPORTER_ASSERT(reporter, v == SkPath::kMove_Verb);
3687 REPORTER_ASSERT(reporter, pts[0].fX == x0);
3688 REPORTER_ASSERT(reporter, pts[0].fY == y0);
3689 }
3690
check_line(skiatest::Reporter * reporter,SkPath::RawIter * iter,SkScalar x1,SkScalar y1)3691 static void check_line(skiatest::Reporter* reporter, SkPath::RawIter* iter,
3692 SkScalar x1, SkScalar y1) {
3693 SkPoint pts[4];
3694 SkPath::Verb v = iter->next(pts);
3695 REPORTER_ASSERT(reporter, v == SkPath::kLine_Verb);
3696 REPORTER_ASSERT(reporter, pts[1].fX == x1);
3697 REPORTER_ASSERT(reporter, pts[1].fY == y1);
3698 }
3699
check_quad(skiatest::Reporter * reporter,SkPath::RawIter * iter,SkScalar x1,SkScalar y1,SkScalar x2,SkScalar y2)3700 static void check_quad(skiatest::Reporter* reporter, SkPath::RawIter* iter,
3701 SkScalar x1, SkScalar y1, SkScalar x2, SkScalar y2) {
3702 SkPoint pts[4];
3703 SkPath::Verb v = iter->next(pts);
3704 REPORTER_ASSERT(reporter, v == SkPath::kQuad_Verb);
3705 REPORTER_ASSERT(reporter, pts[1].fX == x1);
3706 REPORTER_ASSERT(reporter, pts[1].fY == y1);
3707 REPORTER_ASSERT(reporter, pts[2].fX == x2);
3708 REPORTER_ASSERT(reporter, pts[2].fY == y2);
3709 }
3710
check_done(skiatest::Reporter * reporter,SkPath * p,SkPath::RawIter * iter)3711 static void check_done(skiatest::Reporter* reporter, SkPath* p, SkPath::RawIter* iter) {
3712 SkPoint pts[4];
3713 SkPath::Verb v = iter->next(pts);
3714 REPORTER_ASSERT(reporter, v == SkPath::kDone_Verb);
3715 }
3716
check_done_and_reset(skiatest::Reporter * reporter,SkPath * p,SkPath::RawIter * iter)3717 static void check_done_and_reset(skiatest::Reporter* reporter, SkPath* p, SkPath::RawIter* iter) {
3718 check_done(reporter, p, iter);
3719 p->reset();
3720 }
3721
check_path_is_move_and_reset(skiatest::Reporter * reporter,SkPath * p,SkScalar x0,SkScalar y0)3722 static void check_path_is_move_and_reset(skiatest::Reporter* reporter, SkPath* p,
3723 SkScalar x0, SkScalar y0) {
3724 SkPath::RawIter iter(*p);
3725 check_move(reporter, &iter, x0, y0);
3726 check_done_and_reset(reporter, p, &iter);
3727 }
3728
check_path_is_line_and_reset(skiatest::Reporter * reporter,SkPath * p,SkScalar x1,SkScalar y1)3729 static void check_path_is_line_and_reset(skiatest::Reporter* reporter, SkPath* p,
3730 SkScalar x1, SkScalar y1) {
3731 SkPath::RawIter iter(*p);
3732 check_move(reporter, &iter, 0, 0);
3733 check_line(reporter, &iter, x1, y1);
3734 check_done_and_reset(reporter, p, &iter);
3735 }
3736
check_path_is_line(skiatest::Reporter * reporter,SkPath * p,SkScalar x1,SkScalar y1)3737 static void check_path_is_line(skiatest::Reporter* reporter, SkPath* p,
3738 SkScalar x1, SkScalar y1) {
3739 SkPath::RawIter iter(*p);
3740 check_move(reporter, &iter, 0, 0);
3741 check_line(reporter, &iter, x1, y1);
3742 check_done(reporter, p, &iter);
3743 }
3744
check_path_is_line_pair_and_reset(skiatest::Reporter * reporter,SkPath * p,SkScalar x1,SkScalar y1,SkScalar x2,SkScalar y2)3745 static void check_path_is_line_pair_and_reset(skiatest::Reporter* reporter, SkPath* p,
3746 SkScalar x1, SkScalar y1, SkScalar x2, SkScalar y2) {
3747 SkPath::RawIter iter(*p);
3748 check_move(reporter, &iter, 0, 0);
3749 check_line(reporter, &iter, x1, y1);
3750 check_line(reporter, &iter, x2, y2);
3751 check_done_and_reset(reporter, p, &iter);
3752 }
3753
check_path_is_quad_and_reset(skiatest::Reporter * reporter,SkPath * p,SkScalar x1,SkScalar y1,SkScalar x2,SkScalar y2)3754 static void check_path_is_quad_and_reset(skiatest::Reporter* reporter, SkPath* p,
3755 SkScalar x1, SkScalar y1, SkScalar x2, SkScalar y2) {
3756 SkPath::RawIter iter(*p);
3757 check_move(reporter, &iter, 0, 0);
3758 check_quad(reporter, &iter, x1, y1, x2, y2);
3759 check_done_and_reset(reporter, p, &iter);
3760 }
3761
nearly_equal(const SkRect & a,const SkRect & b)3762 static bool nearly_equal(const SkRect& a, const SkRect& b) {
3763 return SkScalarNearlyEqual(a.fLeft, b.fLeft) &&
3764 SkScalarNearlyEqual(a.fTop, b.fTop) &&
3765 SkScalarNearlyEqual(a.fRight, b.fRight) &&
3766 SkScalarNearlyEqual(a.fBottom, b.fBottom);
3767 }
3768
test_arcTo(skiatest::Reporter * reporter)3769 static void test_arcTo(skiatest::Reporter* reporter) {
3770 SkPath p;
3771 p.arcTo(0, 0, 1, 2, 1);
3772 check_path_is_line_and_reset(reporter, &p, 0, 0);
3773 p.arcTo(1, 2, 1, 2, 1);
3774 check_path_is_line_and_reset(reporter, &p, 1, 2);
3775 p.arcTo(1, 2, 3, 4, 0);
3776 check_path_is_line_and_reset(reporter, &p, 1, 2);
3777 p.arcTo(1, 2, 0, 0, 1);
3778 check_path_is_line_and_reset(reporter, &p, 1, 2);
3779 p.arcTo(1, 0, 1, 1, 1);
3780 SkPoint pt;
3781 REPORTER_ASSERT(reporter, p.getLastPt(&pt) && pt.fX == 1 && pt.fY == 1);
3782 p.reset();
3783 p.arcTo(1, 0, 1, -1, 1);
3784 REPORTER_ASSERT(reporter, p.getLastPt(&pt) && pt.fX == 1 && pt.fY == -1);
3785 p.reset();
3786 SkRect oval = {1, 2, 3, 4};
3787 p.arcTo(oval, 0, 0, true);
3788 check_path_is_move_and_reset(reporter, &p, oval.fRight, oval.centerY());
3789 p.arcTo(oval, 0, 0, false);
3790 check_path_is_move_and_reset(reporter, &p, oval.fRight, oval.centerY());
3791 p.arcTo(oval, 360, 0, true);
3792 check_path_is_move_and_reset(reporter, &p, oval.fRight, oval.centerY());
3793 p.arcTo(oval, 360, 0, false);
3794 check_path_is_move_and_reset(reporter, &p, oval.fRight, oval.centerY());
3795
3796 for (float sweep = 359, delta = 0.5f; sweep != (float) (sweep + delta); ) {
3797 p.arcTo(oval, 0, sweep, false);
3798 REPORTER_ASSERT(reporter, nearly_equal(p.getBounds(), oval));
3799 sweep += delta;
3800 delta /= 2;
3801 }
3802 for (float sweep = 361, delta = 0.5f; sweep != (float) (sweep - delta);) {
3803 p.arcTo(oval, 0, sweep, false);
3804 REPORTER_ASSERT(reporter, nearly_equal(p.getBounds(), oval));
3805 sweep -= delta;
3806 delta /= 2;
3807 }
3808 SkRect noOvalWidth = {1, 2, 0, 3};
3809 p.reset();
3810 p.arcTo(noOvalWidth, 0, 360, false);
3811 REPORTER_ASSERT(reporter, p.isEmpty());
3812
3813 SkRect noOvalHeight = {1, 2, 3, 1};
3814 p.reset();
3815 p.arcTo(noOvalHeight, 0, 360, false);
3816 REPORTER_ASSERT(reporter, p.isEmpty());
3817 }
3818
test_addPath(skiatest::Reporter * reporter)3819 static void test_addPath(skiatest::Reporter* reporter) {
3820 SkPath p, q;
3821 p.lineTo(1, 2);
3822 q.moveTo(4, 4);
3823 q.lineTo(7, 8);
3824 q.conicTo(8, 7, 6, 5, 0.5f);
3825 q.quadTo(6, 7, 8, 6);
3826 q.cubicTo(5, 6, 7, 8, 7, 5);
3827 q.close();
3828 p.addPath(q, -4, -4);
3829 SkRect expected = {0, 0, 4, 4};
3830 REPORTER_ASSERT(reporter, p.getBounds() == expected);
3831 p.reset();
3832 p.reverseAddPath(q);
3833 SkRect reverseExpected = {4, 4, 8, 8};
3834 REPORTER_ASSERT(reporter, p.getBounds() == reverseExpected);
3835 }
3836
test_addPathMode(skiatest::Reporter * reporter,bool explicitMoveTo,bool extend)3837 static void test_addPathMode(skiatest::Reporter* reporter, bool explicitMoveTo, bool extend) {
3838 SkPath p, q;
3839 if (explicitMoveTo) {
3840 p.moveTo(1, 1);
3841 }
3842 p.lineTo(1, 2);
3843 if (explicitMoveTo) {
3844 q.moveTo(2, 1);
3845 }
3846 q.lineTo(2, 2);
3847 p.addPath(q, extend ? SkPath::kExtend_AddPathMode : SkPath::kAppend_AddPathMode);
3848 uint8_t verbs[4];
3849 int verbcount = p.getVerbs(verbs, 4);
3850 REPORTER_ASSERT(reporter, verbcount == 4);
3851 REPORTER_ASSERT(reporter, verbs[0] == SkPath::kMove_Verb);
3852 REPORTER_ASSERT(reporter, verbs[1] == SkPath::kLine_Verb);
3853 REPORTER_ASSERT(reporter, verbs[2] == (extend ? SkPath::kLine_Verb : SkPath::kMove_Verb));
3854 REPORTER_ASSERT(reporter, verbs[3] == SkPath::kLine_Verb);
3855 }
3856
test_extendClosedPath(skiatest::Reporter * reporter)3857 static void test_extendClosedPath(skiatest::Reporter* reporter) {
3858 SkPath p, q;
3859 p.moveTo(1, 1);
3860 p.lineTo(1, 2);
3861 p.lineTo(2, 2);
3862 p.close();
3863 q.moveTo(2, 1);
3864 q.lineTo(2, 3);
3865 p.addPath(q, SkPath::kExtend_AddPathMode);
3866 uint8_t verbs[7];
3867 int verbcount = p.getVerbs(verbs, 7);
3868 REPORTER_ASSERT(reporter, verbcount == 7);
3869 REPORTER_ASSERT(reporter, verbs[0] == SkPath::kMove_Verb);
3870 REPORTER_ASSERT(reporter, verbs[1] == SkPath::kLine_Verb);
3871 REPORTER_ASSERT(reporter, verbs[2] == SkPath::kLine_Verb);
3872 REPORTER_ASSERT(reporter, verbs[3] == SkPath::kClose_Verb);
3873 REPORTER_ASSERT(reporter, verbs[4] == SkPath::kMove_Verb);
3874 REPORTER_ASSERT(reporter, verbs[5] == SkPath::kLine_Verb);
3875 REPORTER_ASSERT(reporter, verbs[6] == SkPath::kLine_Verb);
3876
3877 SkPoint pt;
3878 REPORTER_ASSERT(reporter, p.getLastPt(&pt));
3879 REPORTER_ASSERT(reporter, pt == SkPoint::Make(2, 3));
3880 REPORTER_ASSERT(reporter, p.getPoint(3) == SkPoint::Make(1, 1));
3881 }
3882
test_addEmptyPath(skiatest::Reporter * reporter,SkPath::AddPathMode mode)3883 static void test_addEmptyPath(skiatest::Reporter* reporter, SkPath::AddPathMode mode) {
3884 SkPath p, q, r;
3885 // case 1: dst is empty
3886 p.moveTo(2, 1);
3887 p.lineTo(2, 3);
3888 q.addPath(p, mode);
3889 REPORTER_ASSERT(reporter, q == p);
3890 // case 2: src is empty
3891 p.addPath(r, mode);
3892 REPORTER_ASSERT(reporter, q == p);
3893 // case 3: src and dst are empty
3894 q.reset();
3895 q.addPath(r, mode);
3896 REPORTER_ASSERT(reporter, q.isEmpty());
3897 }
3898
test_conicTo_special_case(skiatest::Reporter * reporter)3899 static void test_conicTo_special_case(skiatest::Reporter* reporter) {
3900 SkPath p;
3901 p.conicTo(1, 2, 3, 4, -1);
3902 check_path_is_line_and_reset(reporter, &p, 3, 4);
3903 p.conicTo(1, 2, 3, 4, SK_ScalarInfinity);
3904 check_path_is_line_pair_and_reset(reporter, &p, 1, 2, 3, 4);
3905 p.conicTo(1, 2, 3, 4, 1);
3906 check_path_is_quad_and_reset(reporter, &p, 1, 2, 3, 4);
3907 }
3908
test_get_point(skiatest::Reporter * reporter)3909 static void test_get_point(skiatest::Reporter* reporter) {
3910 SkPath p;
3911 SkPoint pt = p.getPoint(0);
3912 REPORTER_ASSERT(reporter, pt == SkPoint::Make(0, 0));
3913 REPORTER_ASSERT(reporter, !p.getLastPt(nullptr));
3914 REPORTER_ASSERT(reporter, !p.getLastPt(&pt) && pt == SkPoint::Make(0, 0));
3915 p.setLastPt(10, 10);
3916 pt = p.getPoint(0);
3917 REPORTER_ASSERT(reporter, pt == SkPoint::Make(10, 10));
3918 REPORTER_ASSERT(reporter, p.getLastPt(nullptr));
3919 p.rMoveTo(10, 10);
3920 REPORTER_ASSERT(reporter, p.getLastPt(&pt) && pt == SkPoint::Make(20, 20));
3921 }
3922
test_contains(skiatest::Reporter * reporter)3923 static void test_contains(skiatest::Reporter* reporter) {
3924 SkPath p;
3925 p.moveTo(SkBits2Float(0xe085e7b1), SkBits2Float(0x5f512c00)); // -7.7191e+19f, 1.50724e+19f
3926 p.conicTo(SkBits2Float(0xdfdaa221), SkBits2Float(0x5eaac338), SkBits2Float(0x60342f13), SkBits2Float(0xdf0cbb58), SkBits2Float(0x3f3504f3)); // -3.15084e+19f, 6.15237e+18f, 5.19345e+19f, -1.01408e+19f, 0.707107f
3927 p.conicTo(SkBits2Float(0x60ead799), SkBits2Float(0xdfb76c24), SkBits2Float(0x609b9872), SkBits2Float(0xdf730de8), SkBits2Float(0x3f3504f4)); // 1.35377e+20f, -2.6434e+19f, 8.96947e+19f, -1.75139e+19f, 0.707107f
3928 p.lineTo(SkBits2Float(0x609b9872), SkBits2Float(0xdf730de8)); // 8.96947e+19f, -1.75139e+19f
3929 p.conicTo(SkBits2Float(0x6018b296), SkBits2Float(0xdeee870d), SkBits2Float(0xe008cd8e), SkBits2Float(0x5ed5b2db), SkBits2Float(0x3f3504f3)); // 4.40121e+19f, -8.59386e+18f, -3.94308e+19f, 7.69931e+18f, 0.707107f
3930 p.conicTo(SkBits2Float(0xe0d526d9), SkBits2Float(0x5fa67b31), SkBits2Float(0xe085e7b2), SkBits2Float(0x5f512c01), SkBits2Float(0x3f3504f3)); // -1.22874e+20f, 2.39925e+19f, -7.7191e+19f, 1.50724e+19f, 0.707107f
3931 // this may return true or false, depending on the platform's numerics, but it should not crash
3932 (void) p.contains(-77.2027664f, 15.3066053f);
3933
3934 p.reset();
3935 p.setFillType(SkPath::kInverseWinding_FillType);
3936 REPORTER_ASSERT(reporter, p.contains(0, 0));
3937 p.setFillType(SkPath::kWinding_FillType);
3938 REPORTER_ASSERT(reporter, !p.contains(0, 0));
3939 p.moveTo(4, 4);
3940 p.lineTo(6, 8);
3941 p.lineTo(8, 4);
3942 // test on edge
3943 REPORTER_ASSERT(reporter, p.contains(6, 4));
3944 REPORTER_ASSERT(reporter, p.contains(5, 6));
3945 REPORTER_ASSERT(reporter, p.contains(7, 6));
3946 // test quick reject
3947 REPORTER_ASSERT(reporter, !p.contains(4, 0));
3948 REPORTER_ASSERT(reporter, !p.contains(0, 4));
3949 REPORTER_ASSERT(reporter, !p.contains(4, 10));
3950 REPORTER_ASSERT(reporter, !p.contains(10, 4));
3951 // test various crossings in x
3952 REPORTER_ASSERT(reporter, !p.contains(5, 7));
3953 REPORTER_ASSERT(reporter, p.contains(6, 7));
3954 REPORTER_ASSERT(reporter, !p.contains(7, 7));
3955 p.reset();
3956 p.moveTo(4, 4);
3957 p.lineTo(8, 6);
3958 p.lineTo(4, 8);
3959 // test on edge
3960 REPORTER_ASSERT(reporter, p.contains(4, 6));
3961 REPORTER_ASSERT(reporter, p.contains(6, 5));
3962 REPORTER_ASSERT(reporter, p.contains(6, 7));
3963 // test various crossings in y
3964 REPORTER_ASSERT(reporter, !p.contains(7, 5));
3965 REPORTER_ASSERT(reporter, p.contains(7, 6));
3966 REPORTER_ASSERT(reporter, !p.contains(7, 7));
3967 p.reset();
3968 p.moveTo(4, 4);
3969 p.lineTo(8, 4);
3970 p.lineTo(8, 8);
3971 p.lineTo(4, 8);
3972 // test on vertices
3973 REPORTER_ASSERT(reporter, p.contains(4, 4));
3974 REPORTER_ASSERT(reporter, p.contains(8, 4));
3975 REPORTER_ASSERT(reporter, p.contains(8, 8));
3976 REPORTER_ASSERT(reporter, p.contains(4, 8));
3977 p.reset();
3978 p.moveTo(4, 4);
3979 p.lineTo(6, 8);
3980 p.lineTo(2, 8);
3981 // test on edge
3982 REPORTER_ASSERT(reporter, p.contains(5, 6));
3983 REPORTER_ASSERT(reporter, p.contains(4, 8));
3984 REPORTER_ASSERT(reporter, p.contains(3, 6));
3985 p.reset();
3986 p.moveTo(4, 4);
3987 p.lineTo(0, 6);
3988 p.lineTo(4, 8);
3989 // test on edge
3990 REPORTER_ASSERT(reporter, p.contains(2, 5));
3991 REPORTER_ASSERT(reporter, p.contains(2, 7));
3992 REPORTER_ASSERT(reporter, p.contains(4, 6));
3993 // test canceling coincident edge (a smaller triangle is coincident with a larger one)
3994 p.reset();
3995 p.moveTo(4, 0);
3996 p.lineTo(6, 4);
3997 p.lineTo(2, 4);
3998 p.moveTo(4, 0);
3999 p.lineTo(0, 8);
4000 p.lineTo(8, 8);
4001 REPORTER_ASSERT(reporter, !p.contains(1, 2));
4002 REPORTER_ASSERT(reporter, !p.contains(3, 2));
4003 REPORTER_ASSERT(reporter, !p.contains(4, 0));
4004 REPORTER_ASSERT(reporter, p.contains(4, 4));
4005
4006 // test quads
4007 p.reset();
4008 p.moveTo(4, 4);
4009 p.quadTo(6, 6, 8, 8);
4010 p.quadTo(6, 8, 4, 8);
4011 p.quadTo(4, 6, 4, 4);
4012 REPORTER_ASSERT(reporter, p.contains(5, 6));
4013 REPORTER_ASSERT(reporter, !p.contains(6, 5));
4014 // test quad edge
4015 REPORTER_ASSERT(reporter, p.contains(5, 5));
4016 REPORTER_ASSERT(reporter, p.contains(5, 8));
4017 REPORTER_ASSERT(reporter, p.contains(4, 5));
4018 // test quad endpoints
4019 REPORTER_ASSERT(reporter, p.contains(4, 4));
4020 REPORTER_ASSERT(reporter, p.contains(8, 8));
4021 REPORTER_ASSERT(reporter, p.contains(4, 8));
4022
4023 p.reset();
4024 const SkPoint qPts[] = {{6, 6}, {8, 8}, {6, 8}, {4, 8}, {4, 6}, {4, 4}, {6, 6}};
4025 p.moveTo(qPts[0]);
4026 for (int index = 1; index < (int) SK_ARRAY_COUNT(qPts); index += 2) {
4027 p.quadTo(qPts[index], qPts[index + 1]);
4028 }
4029 REPORTER_ASSERT(reporter, p.contains(5, 6));
4030 REPORTER_ASSERT(reporter, !p.contains(6, 5));
4031 // test quad edge
4032 SkPoint halfway;
4033 for (int index = 0; index < (int) SK_ARRAY_COUNT(qPts) - 2; index += 2) {
4034 SkEvalQuadAt(&qPts[index], 0.5f, &halfway, nullptr);
4035 REPORTER_ASSERT(reporter, p.contains(halfway.fX, halfway.fY));
4036 }
4037
4038 // test conics
4039 p.reset();
4040 const SkPoint kPts[] = {{4, 4}, {6, 6}, {8, 8}, {6, 8}, {4, 8}, {4, 6}, {4, 4}};
4041 p.moveTo(kPts[0]);
4042 for (int index = 1; index < (int) SK_ARRAY_COUNT(kPts); index += 2) {
4043 p.conicTo(kPts[index], kPts[index + 1], 0.5f);
4044 }
4045 REPORTER_ASSERT(reporter, p.contains(5, 6));
4046 REPORTER_ASSERT(reporter, !p.contains(6, 5));
4047 // test conic edge
4048 for (int index = 0; index < (int) SK_ARRAY_COUNT(kPts) - 2; index += 2) {
4049 SkConic conic(&kPts[index], 0.5f);
4050 halfway = conic.evalAt(0.5f);
4051 REPORTER_ASSERT(reporter, p.contains(halfway.fX, halfway.fY));
4052 }
4053 // test conic end points
4054 REPORTER_ASSERT(reporter, p.contains(4, 4));
4055 REPORTER_ASSERT(reporter, p.contains(8, 8));
4056 REPORTER_ASSERT(reporter, p.contains(4, 8));
4057
4058 // test cubics
4059 SkPoint pts[] = {{5, 4}, {6, 5}, {7, 6}, {6, 6}, {4, 6}, {5, 7}, {5, 5}, {5, 4}, {6, 5}, {7, 6}};
4060 for (int i = 0; i < 3; ++i) {
4061 p.reset();
4062 p.setFillType(SkPath::kEvenOdd_FillType);
4063 p.moveTo(pts[i].fX, pts[i].fY);
4064 p.cubicTo(pts[i + 1].fX, pts[i + 1].fY, pts[i + 2].fX, pts[i + 2].fY, pts[i + 3].fX, pts[i + 3].fY);
4065 p.cubicTo(pts[i + 4].fX, pts[i + 4].fY, pts[i + 5].fX, pts[i + 5].fY, pts[i + 6].fX, pts[i + 6].fY);
4066 p.close();
4067 REPORTER_ASSERT(reporter, p.contains(5.5f, 5.5f));
4068 REPORTER_ASSERT(reporter, !p.contains(4.5f, 5.5f));
4069 // test cubic edge
4070 SkEvalCubicAt(&pts[i], 0.5f, &halfway, nullptr, nullptr);
4071 REPORTER_ASSERT(reporter, p.contains(halfway.fX, halfway.fY));
4072 SkEvalCubicAt(&pts[i + 3], 0.5f, &halfway, nullptr, nullptr);
4073 REPORTER_ASSERT(reporter, p.contains(halfway.fX, halfway.fY));
4074 // test cubic end points
4075 REPORTER_ASSERT(reporter, p.contains(pts[i].fX, pts[i].fY));
4076 REPORTER_ASSERT(reporter, p.contains(pts[i + 3].fX, pts[i + 3].fY));
4077 REPORTER_ASSERT(reporter, p.contains(pts[i + 6].fX, pts[i + 6].fY));
4078 }
4079 }
4080
4081 class PathRefTest_Private {
4082 public:
TestPathRef(skiatest::Reporter * reporter)4083 static void TestPathRef(skiatest::Reporter* reporter) {
4084 static const int kRepeatCnt = 10;
4085
4086 sk_sp<SkPathRef> pathRef(new SkPathRef);
4087
4088 SkPathRef::Editor ed(&pathRef);
4089
4090 {
4091 ed.growForRepeatedVerb(SkPath::kMove_Verb, kRepeatCnt);
4092 REPORTER_ASSERT(reporter, kRepeatCnt == pathRef->countVerbs());
4093 REPORTER_ASSERT(reporter, kRepeatCnt == pathRef->countPoints());
4094 REPORTER_ASSERT(reporter, 0 == pathRef->getSegmentMasks());
4095 for (int i = 0; i < kRepeatCnt; ++i) {
4096 REPORTER_ASSERT(reporter, SkPath::kMove_Verb == pathRef->atVerb(i));
4097 }
4098 ed.resetToSize(0, 0, 0);
4099 }
4100
4101 {
4102 ed.growForRepeatedVerb(SkPath::kLine_Verb, kRepeatCnt);
4103 REPORTER_ASSERT(reporter, kRepeatCnt == pathRef->countVerbs());
4104 REPORTER_ASSERT(reporter, kRepeatCnt == pathRef->countPoints());
4105 REPORTER_ASSERT(reporter, SkPath::kLine_SegmentMask == pathRef->getSegmentMasks());
4106 for (int i = 0; i < kRepeatCnt; ++i) {
4107 REPORTER_ASSERT(reporter, SkPath::kLine_Verb == pathRef->atVerb(i));
4108 }
4109 ed.resetToSize(0, 0, 0);
4110 }
4111
4112 {
4113 ed.growForRepeatedVerb(SkPath::kQuad_Verb, kRepeatCnt);
4114 REPORTER_ASSERT(reporter, kRepeatCnt == pathRef->countVerbs());
4115 REPORTER_ASSERT(reporter, 2*kRepeatCnt == pathRef->countPoints());
4116 REPORTER_ASSERT(reporter, SkPath::kQuad_SegmentMask == pathRef->getSegmentMasks());
4117 for (int i = 0; i < kRepeatCnt; ++i) {
4118 REPORTER_ASSERT(reporter, SkPath::kQuad_Verb == pathRef->atVerb(i));
4119 }
4120 ed.resetToSize(0, 0, 0);
4121 }
4122
4123 {
4124 SkScalar* weights = nullptr;
4125 ed.growForRepeatedVerb(SkPath::kConic_Verb, kRepeatCnt, &weights);
4126 REPORTER_ASSERT(reporter, kRepeatCnt == pathRef->countVerbs());
4127 REPORTER_ASSERT(reporter, 2*kRepeatCnt == pathRef->countPoints());
4128 REPORTER_ASSERT(reporter, kRepeatCnt == pathRef->countWeights());
4129 REPORTER_ASSERT(reporter, SkPath::kConic_SegmentMask == pathRef->getSegmentMasks());
4130 REPORTER_ASSERT(reporter, weights);
4131 for (int i = 0; i < kRepeatCnt; ++i) {
4132 REPORTER_ASSERT(reporter, SkPath::kConic_Verb == pathRef->atVerb(i));
4133 }
4134 ed.resetToSize(0, 0, 0);
4135 }
4136
4137 {
4138 ed.growForRepeatedVerb(SkPath::kCubic_Verb, kRepeatCnt);
4139 REPORTER_ASSERT(reporter, kRepeatCnt == pathRef->countVerbs());
4140 REPORTER_ASSERT(reporter, 3*kRepeatCnt == pathRef->countPoints());
4141 REPORTER_ASSERT(reporter, SkPath::kCubic_SegmentMask == pathRef->getSegmentMasks());
4142 for (int i = 0; i < kRepeatCnt; ++i) {
4143 REPORTER_ASSERT(reporter, SkPath::kCubic_Verb == pathRef->atVerb(i));
4144 }
4145 ed.resetToSize(0, 0, 0);
4146 }
4147 }
4148 };
4149
test_operatorEqual(skiatest::Reporter * reporter)4150 static void test_operatorEqual(skiatest::Reporter* reporter) {
4151 SkPath a;
4152 SkPath b;
4153 REPORTER_ASSERT(reporter, a == a);
4154 REPORTER_ASSERT(reporter, a == b);
4155 a.setFillType(SkPath::kInverseWinding_FillType);
4156 REPORTER_ASSERT(reporter, a != b);
4157 a.reset();
4158 REPORTER_ASSERT(reporter, a == b);
4159 a.lineTo(1, 1);
4160 REPORTER_ASSERT(reporter, a != b);
4161 a.reset();
4162 REPORTER_ASSERT(reporter, a == b);
4163 a.lineTo(1, 1);
4164 b.lineTo(1, 2);
4165 REPORTER_ASSERT(reporter, a != b);
4166 a.reset();
4167 a.lineTo(1, 2);
4168 REPORTER_ASSERT(reporter, a == b);
4169 }
4170
compare_dump(skiatest::Reporter * reporter,const SkPath & path,bool force,bool dumpAsHex,const char * str)4171 static void compare_dump(skiatest::Reporter* reporter, const SkPath& path, bool force,
4172 bool dumpAsHex, const char* str) {
4173 SkDynamicMemoryWStream wStream;
4174 path.dump(&wStream, force, dumpAsHex);
4175 sk_sp<SkData> data = wStream.detachAsData();
4176 REPORTER_ASSERT(reporter, data->size() == strlen(str));
4177 if (strlen(str) > 0) {
4178 REPORTER_ASSERT(reporter, !memcmp(data->data(), str, strlen(str)));
4179 } else {
4180 REPORTER_ASSERT(reporter, data->data() == nullptr || !memcmp(data->data(), str, strlen(str)));
4181 }
4182 }
4183
test_dump(skiatest::Reporter * reporter)4184 static void test_dump(skiatest::Reporter* reporter) {
4185 SkPath p;
4186 compare_dump(reporter, p, false, false, "path.setFillType(SkPath::kWinding_FillType);\n");
4187 compare_dump(reporter, p, true, false, "path.setFillType(SkPath::kWinding_FillType);\n");
4188 p.moveTo(1, 2);
4189 p.lineTo(3, 4);
4190 compare_dump(reporter, p, false, false, "path.setFillType(SkPath::kWinding_FillType);\n"
4191 "path.moveTo(1, 2);\n"
4192 "path.lineTo(3, 4);\n");
4193 compare_dump(reporter, p, true, false, "path.setFillType(SkPath::kWinding_FillType);\n"
4194 "path.moveTo(1, 2);\n"
4195 "path.lineTo(3, 4);\n"
4196 "path.lineTo(1, 2);\n"
4197 "path.close();\n");
4198 p.reset();
4199 p.setFillType(SkPath::kEvenOdd_FillType);
4200 p.moveTo(1, 2);
4201 p.quadTo(3, 4, 5, 6);
4202 compare_dump(reporter, p, false, false, "path.setFillType(SkPath::kEvenOdd_FillType);\n"
4203 "path.moveTo(1, 2);\n"
4204 "path.quadTo(3, 4, 5, 6);\n");
4205 p.reset();
4206 p.setFillType(SkPath::kInverseWinding_FillType);
4207 p.moveTo(1, 2);
4208 p.conicTo(3, 4, 5, 6, 0.5f);
4209 compare_dump(reporter, p, false, false, "path.setFillType(SkPath::kInverseWinding_FillType);\n"
4210 "path.moveTo(1, 2);\n"
4211 "path.conicTo(3, 4, 5, 6, 0.5f);\n");
4212 p.reset();
4213 p.setFillType(SkPath::kInverseEvenOdd_FillType);
4214 p.moveTo(1, 2);
4215 p.cubicTo(3, 4, 5, 6, 7, 8);
4216 compare_dump(reporter, p, false, false, "path.setFillType(SkPath::kInverseEvenOdd_FillType);\n"
4217 "path.moveTo(1, 2);\n"
4218 "path.cubicTo(3, 4, 5, 6, 7, 8);\n");
4219 p.reset();
4220 p.setFillType(SkPath::kWinding_FillType);
4221 p.moveTo(1, 2);
4222 p.lineTo(3, 4);
4223 compare_dump(reporter, p, false, true,
4224 "path.setFillType(SkPath::kWinding_FillType);\n"
4225 "path.moveTo(SkBits2Float(0x3f800000), SkBits2Float(0x40000000)); // 1, 2\n"
4226 "path.lineTo(SkBits2Float(0x40400000), SkBits2Float(0x40800000)); // 3, 4\n");
4227 p.reset();
4228 p.moveTo(SkBits2Float(0x3f800000), SkBits2Float(0x40000000));
4229 p.lineTo(SkBits2Float(0x40400000), SkBits2Float(0x40800000));
4230 compare_dump(reporter, p, false, false, "path.setFillType(SkPath::kWinding_FillType);\n"
4231 "path.moveTo(1, 2);\n"
4232 "path.lineTo(3, 4);\n");
4233 }
4234
4235 namespace {
4236
4237 class ChangeListener : public SkPathRef::GenIDChangeListener {
4238 public:
ChangeListener(bool * changed)4239 ChangeListener(bool *changed) : fChanged(changed) { *fChanged = false; }
~ChangeListener()4240 ~ChangeListener() override {}
onChange()4241 void onChange() override {
4242 *fChanged = true;
4243 }
4244 private:
4245 bool* fChanged;
4246 };
4247
4248 }
4249
4250 class PathTest_Private {
4251 public:
TestPathTo(skiatest::Reporter * reporter)4252 static void TestPathTo(skiatest::Reporter* reporter) {
4253 SkPath p, q;
4254 p.lineTo(4, 4);
4255 p.reversePathTo(q);
4256 check_path_is_line(reporter, &p, 4, 4);
4257 q.moveTo(-4, -4);
4258 p.reversePathTo(q);
4259 check_path_is_line(reporter, &p, 4, 4);
4260 q.lineTo(7, 8);
4261 q.conicTo(8, 7, 6, 5, 0.5f);
4262 q.quadTo(6, 7, 8, 6);
4263 q.cubicTo(5, 6, 7, 8, 7, 5);
4264 q.close();
4265 p.reversePathTo(q);
4266 SkRect reverseExpected = {-4, -4, 8, 8};
4267 REPORTER_ASSERT(reporter, p.getBounds() == reverseExpected);
4268 }
4269
TestPathrefListeners(skiatest::Reporter * reporter)4270 static void TestPathrefListeners(skiatest::Reporter* reporter) {
4271 SkPath p;
4272
4273 bool changed = false;
4274 p.moveTo(0, 0);
4275
4276 // Check that listener is notified on moveTo().
4277
4278 SkPathPriv::AddGenIDChangeListener(p, new ChangeListener(&changed));
4279 REPORTER_ASSERT(reporter, !changed);
4280 p.moveTo(10, 0);
4281 REPORTER_ASSERT(reporter, changed);
4282
4283 // Check that listener is notified on lineTo().
4284 SkPathPriv::AddGenIDChangeListener(p, new ChangeListener(&changed));
4285 REPORTER_ASSERT(reporter, !changed);
4286 p.lineTo(20, 0);
4287 REPORTER_ASSERT(reporter, changed);
4288
4289 // Check that listener is notified on reset().
4290 SkPathPriv::AddGenIDChangeListener(p, new ChangeListener(&changed));
4291 REPORTER_ASSERT(reporter, !changed);
4292 p.reset();
4293 REPORTER_ASSERT(reporter, changed);
4294
4295 p.moveTo(0, 0);
4296
4297 // Check that listener is notified on rewind().
4298 SkPathPriv::AddGenIDChangeListener(p, new ChangeListener(&changed));
4299 REPORTER_ASSERT(reporter, !changed);
4300 p.rewind();
4301 REPORTER_ASSERT(reporter, changed);
4302
4303 // Check that listener is notified when pathref is deleted.
4304 {
4305 SkPath q;
4306 q.moveTo(10, 10);
4307 SkPathPriv::AddGenIDChangeListener(q, new ChangeListener(&changed));
4308 REPORTER_ASSERT(reporter, !changed);
4309 }
4310 // q went out of scope.
4311 REPORTER_ASSERT(reporter, changed);
4312 }
4313 };
4314
test_crbug_629455(skiatest::Reporter * reporter)4315 static void test_crbug_629455(skiatest::Reporter* reporter) {
4316 SkPath path;
4317 path.moveTo(0, 0);
4318 path.cubicTo(SkBits2Float(0xcdcdcd00), SkBits2Float(0xcdcdcdcd),
4319 SkBits2Float(0xcdcdcdcd), SkBits2Float(0xcdcdcdcd),
4320 SkBits2Float(0x423fcdcd), SkBits2Float(0x40ed9341));
4321 // AKA: cubicTo(-4.31596e+08f, -4.31602e+08f, -4.31602e+08f, -4.31602e+08f, 47.951f, 7.42423f);
4322 path.lineTo(0, 0);
4323 test_draw_AA_path(100, 100, path);
4324 }
4325
test_fuzz_crbug_662952(skiatest::Reporter * reporter)4326 static void test_fuzz_crbug_662952(skiatest::Reporter* reporter) {
4327 SkPath path;
4328 path.moveTo(SkBits2Float(0x4109999a), SkBits2Float(0x411c0000)); // 8.6f, 9.75f
4329 path.lineTo(SkBits2Float(0x410a6666), SkBits2Float(0x411c0000)); // 8.65f, 9.75f
4330 path.lineTo(SkBits2Float(0x410a6666), SkBits2Float(0x411e6666)); // 8.65f, 9.9f
4331 path.lineTo(SkBits2Float(0x4109999a), SkBits2Float(0x411e6666)); // 8.6f, 9.9f
4332 path.lineTo(SkBits2Float(0x4109999a), SkBits2Float(0x411c0000)); // 8.6f, 9.75f
4333 path.close();
4334
4335 auto surface = SkSurface::MakeRasterN32Premul(100, 100);
4336 SkPaint paint;
4337 paint.setAntiAlias(true);
4338 surface->getCanvas()->clipPath(path, true);
4339 surface->getCanvas()->drawRect(SkRect::MakeWH(100, 100), paint);
4340 }
4341
test_path_crbugskia6003()4342 static void test_path_crbugskia6003() {
4343 auto surface(SkSurface::MakeRasterN32Premul(500, 500));
4344 SkCanvas* canvas = surface->getCanvas();
4345 SkPaint paint;
4346 paint.setAntiAlias(true);
4347 SkPath path;
4348 path.moveTo(SkBits2Float(0x4325e666), SkBits2Float(0x42a1999a)); // 165.9f, 80.8f
4349 path.lineTo(SkBits2Float(0x4325e666), SkBits2Float(0x42a2999a)); // 165.9f, 81.3f
4350 path.lineTo(SkBits2Float(0x4325b333), SkBits2Float(0x42a2999a)); // 165.7f, 81.3f
4351 path.lineTo(SkBits2Float(0x4325b333), SkBits2Float(0x42a16666)); // 165.7f, 80.7f
4352 path.lineTo(SkBits2Float(0x4325b333), SkBits2Float(0x429f6666)); // 165.7f, 79.7f
4353 // 165.7f, 79.7f, 165.8f, 79.7f, 165.8f, 79.7f
4354 path.cubicTo(SkBits2Float(0x4325b333), SkBits2Float(0x429f6666), SkBits2Float(0x4325cccc),
4355 SkBits2Float(0x429f6666), SkBits2Float(0x4325cccc), SkBits2Float(0x429f6666));
4356 // 165.8f, 79.7f, 165.8f, 79.7f, 165.9f, 79.7f
4357 path.cubicTo(SkBits2Float(0x4325cccc), SkBits2Float(0x429f6666), SkBits2Float(0x4325cccc),
4358 SkBits2Float(0x429f6666), SkBits2Float(0x4325e666), SkBits2Float(0x429f6666));
4359 path.lineTo(SkBits2Float(0x4325e666), SkBits2Float(0x42a1999a)); // 165.9f, 80.8f
4360 path.close();
4361 canvas->clipPath(path, true);
4362 canvas->drawRect(SkRect::MakeWH(500, 500), paint);
4363 }
4364
test_fuzz_crbug_662730(skiatest::Reporter * reporter)4365 static void test_fuzz_crbug_662730(skiatest::Reporter* reporter) {
4366 SkPath path;
4367 path.moveTo(SkBits2Float(0x00000000), SkBits2Float(0x00000000)); // 0, 0
4368 path.lineTo(SkBits2Float(0xd5394437), SkBits2Float(0x37373737)); // -1.2731e+13f, 1.09205e-05f
4369 path.lineTo(SkBits2Float(0x37373737), SkBits2Float(0x37373737)); // 1.09205e-05f, 1.09205e-05f
4370 path.lineTo(SkBits2Float(0x37373745), SkBits2Float(0x0001b800)); // 1.09205e-05f, 1.57842e-40f
4371 path.close();
4372 test_draw_AA_path(100, 100, path);
4373 }
4374
4375 #if !defined(SK_SUPPORT_LEGACY_DELTA_AA)
test_skbug_6947()4376 static void test_skbug_6947() {
4377 SkPath path;
4378 SkPoint points[] =
4379 {{125.126022f, -0.499872506f}, {125.288895f, -0.499338806f},
4380 {125.299316f, -0.499290764f}, {126.294594f, 0.505449712f},
4381 {125.999992f, 62.5047531f}, {124.0f, 62.4980202f},
4382 {124.122749f, 0.498142242f}, {125.126022f, -0.499872506f},
4383 {125.119476f, 1.50011659f}, {125.122749f, 0.50012207f},
4384 {126.122749f, 0.502101898f}, {126.0f, 62.5019798f},
4385 {125.0f, 62.5f}, {124.000008f, 62.4952469f},
4386 {124.294609f, 0.495946467f}, {125.294601f, 0.50069809f},
4387 {125.289886f, 1.50068688f}, {125.282349f, 1.50065041f},
4388 {125.119476f, 1.50011659f}};
4389 constexpr SkPath::Verb kMove = SkPath::kMove_Verb;
4390 constexpr SkPath::Verb kLine = SkPath::kLine_Verb;
4391 constexpr SkPath::Verb kClose = SkPath::kClose_Verb;
4392 SkPath::Verb verbs[] = {kMove, kLine, kLine, kLine, kLine, kLine, kLine, kLine, kClose,
4393 kMove, kLine, kLine, kLine, kLine, kLine, kLine, kLine, kLine, kLine, kLine, kClose};
4394 int pointIndex = 0;
4395 for(auto verb : verbs) {
4396 switch (verb) {
4397 case kMove:
4398 path.moveTo(points[pointIndex++]);
4399 break;
4400 case kLine:
4401 path.lineTo(points[pointIndex++]);
4402 break;
4403 case kClose:
4404 default:
4405 path.close();
4406 break;
4407 }
4408 }
4409 test_draw_AA_path(250, 125, path);
4410 }
4411
test_skbug_7015()4412 static void test_skbug_7015() {
4413 SkPath path;
4414 path.setFillType(SkPath::kWinding_FillType);
4415 path.moveTo(SkBits2Float(0x4388c000), SkBits2Float(0x43947c08)); // 273.5f, 296.969f
4416 path.lineTo(SkBits2Float(0x4386c000), SkBits2Float(0x43947c08)); // 269.5f, 296.969f
4417 // 269.297f, 292.172f, 273.695f, 292.172f, 273.5f, 296.969f
4418 path.cubicTo(SkBits2Float(0x4386a604), SkBits2Float(0x43921604),
4419 SkBits2Float(0x4388d8f6), SkBits2Float(0x43921604),
4420 SkBits2Float(0x4388c000), SkBits2Float(0x43947c08));
4421 path.close();
4422 test_draw_AA_path(500, 500, path);
4423 }
4424
test_skbug_7051()4425 static void test_skbug_7051() {
4426 SkPath path;
4427 path.moveTo(10, 10);
4428 path.cubicTo(10, 20, 10, 30, 30, 30);
4429 path.lineTo(50, 20);
4430 path.lineTo(50, 10);
4431 path.close();
4432 test_draw_AA_path(100, 100, path);
4433 }
4434
4435 #endif
4436
test_interp(skiatest::Reporter * reporter)4437 static void test_interp(skiatest::Reporter* reporter) {
4438 SkPath p1, p2, out;
4439 REPORTER_ASSERT(reporter, p1.isInterpolatable(p2));
4440 REPORTER_ASSERT(reporter, p1.interpolate(p2, 0, &out));
4441 REPORTER_ASSERT(reporter, p1 == out);
4442 REPORTER_ASSERT(reporter, p1.interpolate(p2, 1, &out));
4443 REPORTER_ASSERT(reporter, p1 == out);
4444 p1.moveTo(0, 2);
4445 p1.lineTo(0, 4);
4446 REPORTER_ASSERT(reporter, !p1.isInterpolatable(p2));
4447 REPORTER_ASSERT(reporter, !p1.interpolate(p2, 1, &out));
4448 p2.moveTo(6, 0);
4449 p2.lineTo(8, 0);
4450 REPORTER_ASSERT(reporter, p1.isInterpolatable(p2));
4451 REPORTER_ASSERT(reporter, p1.interpolate(p2, 0, &out));
4452 REPORTER_ASSERT(reporter, p2 == out);
4453 REPORTER_ASSERT(reporter, p1.interpolate(p2, 1, &out));
4454 REPORTER_ASSERT(reporter, p1 == out);
4455 REPORTER_ASSERT(reporter, p1.interpolate(p2, 0.5f, &out));
4456 REPORTER_ASSERT(reporter, out.getBounds() == SkRect::MakeLTRB(3, 1, 4, 2));
4457 p1.reset();
4458 p1.moveTo(4, 4);
4459 p1.conicTo(5, 4, 5, 5, 1 / SkScalarSqrt(2));
4460 p2.reset();
4461 p2.moveTo(4, 2);
4462 p2.conicTo(7, 2, 7, 5, 1 / SkScalarSqrt(2));
4463 REPORTER_ASSERT(reporter, p1.isInterpolatable(p2));
4464 REPORTER_ASSERT(reporter, p1.interpolate(p2, 0.5f, &out));
4465 REPORTER_ASSERT(reporter, out.getBounds() == SkRect::MakeLTRB(4, 3, 6, 5));
4466 p2.reset();
4467 p2.moveTo(4, 2);
4468 p2.conicTo(6, 3, 6, 5, 1);
4469 REPORTER_ASSERT(reporter, !p1.isInterpolatable(p2));
4470 p2.reset();
4471 p2.moveTo(4, 4);
4472 p2.conicTo(5, 4, 5, 5, 0.5f);
4473 REPORTER_ASSERT(reporter, !p1.isInterpolatable(p2));
4474 }
4475
DEF_TEST(PathInterp,reporter)4476 DEF_TEST(PathInterp, reporter) {
4477 test_interp(reporter);
4478 }
4479
4480 #include "SkSurface.h"
DEF_TEST(PathBigCubic,reporter)4481 DEF_TEST(PathBigCubic, reporter) {
4482 SkPath path;
4483 path.moveTo(SkBits2Float(0x00000000), SkBits2Float(0x00000000)); // 0, 0
4484 path.moveTo(SkBits2Float(0x44000000), SkBits2Float(0x373938b8)); // 512, 1.10401e-05f
4485 path.cubicTo(SkBits2Float(0x00000001), SkBits2Float(0xdf000052), SkBits2Float(0x00000100), SkBits2Float(0x00000000), SkBits2Float(0x00000100), SkBits2Float(0x00000000)); // 1.4013e-45f, -9.22346e+18f, 3.58732e-43f, 0, 3.58732e-43f, 0
4486 path.moveTo(0, 512);
4487
4488 // this call should not assert
4489 SkSurface::MakeRasterN32Premul(255, 255, nullptr)->getCanvas()->drawPath(path, SkPaint());
4490 }
4491
DEF_TEST(PathContains,reporter)4492 DEF_TEST(PathContains, reporter) {
4493 test_contains(reporter);
4494 }
4495
DEF_TEST(Paths,reporter)4496 DEF_TEST(Paths, reporter) {
4497 test_fuzz_crbug_647922();
4498 test_fuzz_crbug_643933();
4499 test_sect_with_horizontal_needs_pinning();
4500 test_crbug_629455(reporter);
4501 test_fuzz_crbug_627414(reporter);
4502 test_path_crbug364224();
4503 test_fuzz_crbug_662952(reporter);
4504 test_fuzz_crbug_662730(reporter);
4505 test_fuzz_crbug_662780();
4506 test_mask_overflow();
4507 test_path_crbugskia6003();
4508 test_fuzz_crbug_668907();
4509 #if !defined(SK_SUPPORT_LEGACY_DELTA_AA)
4510 test_skbug_6947();
4511 test_skbug_7015();
4512 test_skbug_7051();
4513 #endif
4514
4515 SkSize::Make(3, 4);
4516
4517 SkPath p, empty;
4518 SkRect bounds, bounds2;
4519 test_empty(reporter, p);
4520
4521 REPORTER_ASSERT(reporter, p.getBounds().isEmpty());
4522
4523 // this triggers a code path in SkPath::operator= which is otherwise unexercised
4524 SkPath& self = p;
4525 p = self;
4526
4527 // this triggers a code path in SkPath::swap which is otherwise unexercised
4528 p.swap(self);
4529
4530 bounds.set(0, 0, SK_Scalar1, SK_Scalar1);
4531
4532 p.addRoundRect(bounds, SK_Scalar1, SK_Scalar1);
4533 check_convex_bounds(reporter, p, bounds);
4534 // we have quads or cubics
4535 REPORTER_ASSERT(reporter,
4536 p.getSegmentMasks() & (kCurveSegmentMask | SkPath::kConic_SegmentMask));
4537 REPORTER_ASSERT(reporter, !p.isEmpty());
4538
4539 p.reset();
4540 test_empty(reporter, p);
4541
4542 p.addOval(bounds);
4543 check_convex_bounds(reporter, p, bounds);
4544 REPORTER_ASSERT(reporter, !p.isEmpty());
4545
4546 p.rewind();
4547 test_empty(reporter, p);
4548
4549 p.addRect(bounds);
4550 check_convex_bounds(reporter, p, bounds);
4551 // we have only lines
4552 REPORTER_ASSERT(reporter, SkPath::kLine_SegmentMask == p.getSegmentMasks());
4553 REPORTER_ASSERT(reporter, !p.isEmpty());
4554
4555 REPORTER_ASSERT(reporter, p != empty);
4556 REPORTER_ASSERT(reporter, !(p == empty));
4557
4558 // do getPoints and getVerbs return the right result
4559 REPORTER_ASSERT(reporter, p.getPoints(nullptr, 0) == 4);
4560 REPORTER_ASSERT(reporter, p.getVerbs(nullptr, 0) == 5);
4561 SkPoint pts[4];
4562 int count = p.getPoints(pts, 4);
4563 REPORTER_ASSERT(reporter, count == 4);
4564 uint8_t verbs[6];
4565 verbs[5] = 0xff;
4566 p.getVerbs(verbs, 5);
4567 REPORTER_ASSERT(reporter, SkPath::kMove_Verb == verbs[0]);
4568 REPORTER_ASSERT(reporter, SkPath::kLine_Verb == verbs[1]);
4569 REPORTER_ASSERT(reporter, SkPath::kLine_Verb == verbs[2]);
4570 REPORTER_ASSERT(reporter, SkPath::kLine_Verb == verbs[3]);
4571 REPORTER_ASSERT(reporter, SkPath::kClose_Verb == verbs[4]);
4572 REPORTER_ASSERT(reporter, 0xff == verbs[5]);
4573 bounds2.set(pts, 4);
4574 REPORTER_ASSERT(reporter, bounds == bounds2);
4575
4576 bounds.offset(SK_Scalar1*3, SK_Scalar1*4);
4577 p.offset(SK_Scalar1*3, SK_Scalar1*4);
4578 REPORTER_ASSERT(reporter, bounds == p.getBounds());
4579
4580 REPORTER_ASSERT(reporter, p.isRect(nullptr));
4581 bounds2.setEmpty();
4582 REPORTER_ASSERT(reporter, p.isRect(&bounds2));
4583 REPORTER_ASSERT(reporter, bounds == bounds2);
4584
4585 // now force p to not be a rect
4586 bounds.set(0, 0, SK_Scalar1/2, SK_Scalar1/2);
4587 p.addRect(bounds);
4588 REPORTER_ASSERT(reporter, !p.isRect(nullptr));
4589
4590 // Test an edge case w.r.t. the bound returned by isRect (i.e., the
4591 // path has a trailing moveTo. Please see crbug.com\445368)
4592 {
4593 SkRect r;
4594 p.reset();
4595 p.addRect(bounds);
4596 REPORTER_ASSERT(reporter, p.isRect(&r));
4597 REPORTER_ASSERT(reporter, r == bounds);
4598 // add a moveTo outside of our bounds
4599 p.moveTo(bounds.fLeft + 10, bounds.fBottom + 10);
4600 REPORTER_ASSERT(reporter, p.isRect(&r));
4601 REPORTER_ASSERT(reporter, r == bounds);
4602 }
4603
4604 test_operatorEqual(reporter);
4605 test_isLine(reporter);
4606 test_isRect(reporter);
4607 test_is_simple_closed_rect(reporter);
4608 test_isNestedFillRects(reporter);
4609 test_zero_length_paths(reporter);
4610 test_direction(reporter);
4611 test_convexity(reporter);
4612 test_convexity2(reporter);
4613 test_conservativelyContains(reporter);
4614 test_close(reporter);
4615 test_segment_masks(reporter);
4616 test_flattening(reporter);
4617 test_transform(reporter);
4618 test_bounds(reporter);
4619 test_iter(reporter);
4620 test_raw_iter(reporter);
4621 test_circle(reporter);
4622 test_oval(reporter);
4623 test_strokerec(reporter);
4624 test_addPoly(reporter);
4625 test_isfinite(reporter);
4626 test_isfinite_after_transform(reporter);
4627 test_islastcontourclosed(reporter);
4628 test_arb_round_rect_is_convex(reporter);
4629 test_arb_zero_rad_round_rect_is_rect(reporter);
4630 test_addrect(reporter);
4631 test_addrect_isfinite(reporter);
4632 test_tricky_cubic();
4633 test_clipped_cubic();
4634 test_crbug_170666();
4635 test_crbug_493450(reporter);
4636 test_crbug_495894(reporter);
4637 test_crbug_613918();
4638 test_bad_cubic_crbug229478();
4639 test_bad_cubic_crbug234190();
4640 test_gen_id(reporter);
4641 test_path_close_issue1474(reporter);
4642 test_path_to_region(reporter);
4643 test_rrect(reporter);
4644 test_arc(reporter);
4645 test_arc_ovals(reporter);
4646 test_arcTo(reporter);
4647 test_addPath(reporter);
4648 test_addPathMode(reporter, false, false);
4649 test_addPathMode(reporter, true, false);
4650 test_addPathMode(reporter, false, true);
4651 test_addPathMode(reporter, true, true);
4652 test_extendClosedPath(reporter);
4653 test_addEmptyPath(reporter, SkPath::kExtend_AddPathMode);
4654 test_addEmptyPath(reporter, SkPath::kAppend_AddPathMode);
4655 test_conicTo_special_case(reporter);
4656 test_get_point(reporter);
4657 test_contains(reporter);
4658 PathTest_Private::TestPathTo(reporter);
4659 PathRefTest_Private::TestPathRef(reporter);
4660 PathTest_Private::TestPathrefListeners(reporter);
4661 test_dump(reporter);
4662 test_path_crbug389050(reporter);
4663 test_path_crbugskia2820(reporter);
4664 test_path_crbugskia5995();
4665 test_skbug_3469(reporter);
4666 test_skbug_3239(reporter);
4667 test_bounds_crbug_513799(reporter);
4668 test_fuzz_crbug_638223();
4669 }
4670
DEF_TEST(conservatively_contains_rect,reporter)4671 DEF_TEST(conservatively_contains_rect, reporter) {
4672 SkPath path;
4673
4674 path.moveTo(SkBits2Float(0x44000000), SkBits2Float(0x373938b8)); // 512, 1.10401e-05f
4675 // 1.4013e-45f, -9.22346e+18f, 3.58732e-43f, 0, 3.58732e-43f, 0
4676 path.cubicTo(SkBits2Float(0x00000001), SkBits2Float(0xdf000052),
4677 SkBits2Float(0x00000100), SkBits2Float(0x00000000),
4678 SkBits2Float(0x00000100), SkBits2Float(0x00000000));
4679 path.moveTo(0, 0);
4680
4681 // this guy should not assert
4682 path.conservativelyContainsRect({ -211747, 12.1115f, -197893, 25.0321f });
4683 }
4684
4685 ///////////////////////////////////////////////////////////////////////////////////////////////////
4686
rand_path(SkPath * path,SkRandom & rand,SkPath::Verb verb,int n)4687 static void rand_path(SkPath* path, SkRandom& rand, SkPath::Verb verb, int n) {
4688 for (int i = 0; i < n; ++i) {
4689 switch (verb) {
4690 case SkPath::kLine_Verb:
4691 path->lineTo(rand.nextF()*100, rand.nextF()*100);
4692 break;
4693 case SkPath::kQuad_Verb:
4694 path->quadTo(rand.nextF()*100, rand.nextF()*100,
4695 rand.nextF()*100, rand.nextF()*100);
4696 break;
4697 case SkPath::kConic_Verb:
4698 path->conicTo(rand.nextF()*100, rand.nextF()*100,
4699 rand.nextF()*100, rand.nextF()*100, rand.nextF()*10);
4700 break;
4701 case SkPath::kCubic_Verb:
4702 path->cubicTo(rand.nextF()*100, rand.nextF()*100,
4703 rand.nextF()*100, rand.nextF()*100,
4704 rand.nextF()*100, rand.nextF()*100);
4705 break;
4706 default:
4707 SkASSERT(false);
4708 }
4709 }
4710 }
4711
4712 #include "SkPathOps.h"
DEF_TEST(path_tight_bounds,reporter)4713 DEF_TEST(path_tight_bounds, reporter) {
4714 SkRandom rand;
4715
4716 const SkPath::Verb verbs[] = {
4717 SkPath::kLine_Verb, SkPath::kQuad_Verb, SkPath::kConic_Verb, SkPath::kCubic_Verb,
4718 };
4719 for (int i = 0; i < 1000; ++i) {
4720 for (int n = 1; n <= 10; n += 9) {
4721 for (SkPath::Verb verb : verbs) {
4722 SkPath path;
4723 rand_path(&path, rand, verb, n);
4724 SkRect bounds = path.getBounds();
4725 SkRect tight = path.computeTightBounds();
4726 REPORTER_ASSERT(reporter, bounds.contains(tight));
4727
4728 SkRect tight2;
4729 TightBounds(path, &tight2);
4730 REPORTER_ASSERT(reporter, nearly_equal(tight, tight2));
4731 }
4732 }
4733 }
4734 }
4735
DEF_TEST(skbug_6450,r)4736 DEF_TEST(skbug_6450, r) {
4737 SkRect ri = { 0.18554693f, 195.26283f, 0.185784385f, 752.644409f };
4738 SkVector rdi[4] = {
4739 { 1.81159976e-09f, 7.58768801e-05f },
4740 { 0.000118725002f, 0.000118725002f },
4741 { 0.000118725002f, 0.000118725002f },
4742 { 0.000118725002f, 0.486297607f }
4743 };
4744 SkRRect irr;
4745 irr.setRectRadii(ri, rdi);
4746 SkRect ro = { 9.18354821e-39f, 2.1710848e+9f, 2.16945843e+9f, 3.47808128e+9f };
4747 SkVector rdo[4] = {
4748 { 0, 0 },
4749 { 0.0103298295f, 0.185887396f },
4750 { 2.52999727e-29f, 169.001938f },
4751 { 195.262741f, 195.161255f }
4752 };
4753 SkRRect orr;
4754 orr.setRectRadii(ro, rdo);
4755 SkMakeNullCanvas()->drawDRRect(orr, irr, SkPaint());
4756 }
4757
DEF_TEST(PathRefSerialization,reporter)4758 DEF_TEST(PathRefSerialization, reporter) {
4759 SkPath path;
4760 const size_t numMoves = 5;
4761 const size_t numConics = 7;
4762 const size_t numPoints = numMoves + 2 * numConics;
4763 const size_t numVerbs = numMoves + numConics;
4764 for (size_t i = 0; i < numMoves; ++i) path.moveTo(1, 2);
4765 for (size_t i = 0; i < numConics; ++i) path.conicTo(1, 2, 3, 4, 5);
4766 REPORTER_ASSERT(reporter, path.countPoints() == numPoints);
4767 REPORTER_ASSERT(reporter, path.countVerbs() == numVerbs);
4768
4769 // Verify that path serializes/deserializes properly.
4770 sk_sp<SkData> data = path.serialize();
4771 size_t bytesWritten = data->size();
4772
4773 {
4774 SkPath readBack;
4775 REPORTER_ASSERT(reporter, readBack != path);
4776 size_t bytesRead = readBack.readFromMemory(data->data(), bytesWritten);
4777 REPORTER_ASSERT(reporter, bytesRead == bytesWritten);
4778 REPORTER_ASSERT(reporter, readBack == path);
4779 }
4780
4781 // One less byte (rounded down to alignment) than was written will also
4782 // fail to be deserialized.
4783 {
4784 SkPath readBack;
4785 size_t bytesRead = readBack.readFromMemory(data->data(), bytesWritten - 4);
4786 REPORTER_ASSERT(reporter, !bytesRead);
4787 }
4788 }
4789
DEF_TEST(NonFinitePathIteration,reporter)4790 DEF_TEST(NonFinitePathIteration, reporter) {
4791 SkPath path;
4792 path.moveTo(SK_ScalarInfinity, SK_ScalarInfinity);
4793
4794 int verbs = 0;
4795
4796 SkPath::RawIter iter(path);
4797 SkPoint pts[4];
4798 while (iter.next(pts) != SkPath::kDone_Verb) {
4799 verbs++;
4800 }
4801
4802 REPORTER_ASSERT(reporter, verbs == 0);
4803 }
4804
4805
4806 #ifndef SK_SUPPORT_LEGACY_SVG_ARC_TO
DEF_TEST(AndroidArc,reporter)4807 DEF_TEST(AndroidArc, reporter) {
4808 const char* tests[] = {
4809 "M50,0A50,50,0,0 1 100,50 L100,85 A15,15,0,0 1 85,100 L50,100 A50,50,0,0 1 50,0z",
4810 "M50,0L92,0 A8,8,0,0 1 100,8 L100,92 A8,8,0,0 1 92,100 L8,100"
4811 " A8,8,0,0 1 0,92 L 0,8 A8,8,0,0 1 8,0z",
4812 "M50 0A50 50,0,1,1,50 100A50 50,0,1,1,50 0"
4813 };
4814 for (auto test : tests) {
4815 SkPath aPath;
4816 SkAssertResult(SkParsePath::FromSVGString(test, &aPath));
4817 SkASSERT(aPath.isConvex());
4818 for (SkScalar scale = 1; scale < 1000; scale *= 1.1f) {
4819 SkPath scalePath = aPath;
4820 SkMatrix matrix;
4821 matrix.setScale(scale, scale);
4822 scalePath.transform(matrix);
4823 SkASSERT(scalePath.isConvex());
4824 }
4825 for (SkScalar scale = 1; scale < .001; scale /= 1.1f) {
4826 SkPath scalePath = aPath;
4827 SkMatrix matrix;
4828 matrix.setScale(scale, scale);
4829 scalePath.transform(matrix);
4830 SkASSERT(scalePath.isConvex());
4831 }
4832 }
4833 }
4834 #endif
4835
4836 /*
4837 * Try a range of crazy values, just to ensure that we don't assert/crash.
4838 */
DEF_TEST(HugeGeometry,reporter)4839 DEF_TEST(HugeGeometry, reporter) {
4840 auto surf = SkSurface::MakeRasterN32Premul(100, 100);
4841 auto canvas = surf->getCanvas();
4842
4843 const bool aas[] = { false, true };
4844 const SkPaint::Style styles[] = {
4845 SkPaint::kFill_Style, SkPaint::kStroke_Style, SkPaint::kStrokeAndFill_Style
4846 };
4847 const SkScalar values[] = {
4848 0, 1, 1000, 1000 * 1000, 1000.f * 1000 * 10000, SK_ScalarMax / 2, SK_ScalarMax,
4849 SK_ScalarInfinity
4850 };
4851
4852 SkPaint paint;
4853 for (auto x : values) {
4854 SkRect r = { -x, -x, x, x };
4855 for (auto width : values) {
4856 paint.setStrokeWidth(width);
4857 for (auto aa : aas) {
4858 paint.setAntiAlias(aa);
4859 for (auto style : styles) {
4860 paint.setStyle(style);
4861 canvas->drawRect(r, paint);
4862 canvas->drawOval(r, paint);
4863 }
4864 }
4865 }
4866 }
4867
4868 }
4869
4870 // Treat nonfinite paths as "empty" or "full", depending on inverse-filltype
DEF_TEST(ClipPath_nonfinite,reporter)4871 DEF_TEST(ClipPath_nonfinite, reporter) {
4872 auto surf = SkSurface::MakeRasterN32Premul(10, 10);
4873 SkCanvas* canvas = surf->getCanvas();
4874
4875 REPORTER_ASSERT(reporter, !canvas->isClipEmpty());
4876 for (bool aa : {false, true}) {
4877 for (SkPath::FillType ft : {SkPath::kWinding_FillType, SkPath::kInverseWinding_FillType}) {
4878 for (SkScalar bad : {SK_ScalarInfinity, SK_ScalarNaN}) {
4879 for (int bits = 1; bits <= 15; ++bits) {
4880 SkPoint p0 = { 0, 0 };
4881 SkPoint p1 = { 0, 0 };
4882 if (bits & 1) p0.fX = -bad;
4883 if (bits & 2) p0.fY = -bad;
4884 if (bits & 4) p1.fX = bad;
4885 if (bits & 8) p1.fY = bad;
4886
4887 SkPath path;
4888 path.moveTo(p0);
4889 path.lineTo(p1);
4890 path.setFillType(ft);
4891 canvas->save();
4892 canvas->clipPath(path, aa);
4893 REPORTER_ASSERT(reporter, canvas->isClipEmpty() == !path.isInverseFillType());
4894 canvas->restore();
4895 }
4896 }
4897 }
4898 }
4899 REPORTER_ASSERT(reporter, !canvas->isClipEmpty());
4900 }
4901
4902