1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
|
/*
* Copyright 2016 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "Fuzz.h"
#include "SkPath.h"
#include "SkPathOps.h"
const int kLastOp = SkPathOp::kReverseDifference_SkPathOp;
void BuildPath(Fuzz* fuzz,
SkPath* path,
int last_verb) {
uint8_t operation;
SkScalar a, b, c, d, e, f;
while (fuzz->next<uint8_t>(&operation)) {
switch (operation % (last_verb + 1)) {
case SkPath::Verb::kMove_Verb:
if (!fuzz->next<SkScalar>(&a) || !fuzz->next<SkScalar>(&b))
return;
path->moveTo(a, b);
break;
case SkPath::Verb::kLine_Verb:
if (!fuzz->next<SkScalar>(&a) || !fuzz->next<SkScalar>(&b))
return;
path->lineTo(a, b);
break;
case SkPath::Verb::kQuad_Verb:
if (!fuzz->next<SkScalar>(&a) ||
!fuzz->next<SkScalar>(&b) ||
!fuzz->next<SkScalar>(&c) ||
!fuzz->next<SkScalar>(&d))
return;
path->quadTo(a, b, c, d);
break;
case SkPath::Verb::kConic_Verb:
if (!fuzz->next<SkScalar>(&a) ||
!fuzz->next<SkScalar>(&b) ||
!fuzz->next<SkScalar>(&c) ||
!fuzz->next<SkScalar>(&d) ||
!fuzz->next<SkScalar>(&e))
return;
path->conicTo(a, b, c, d, e);
break;
case SkPath::Verb::kCubic_Verb:
if (!fuzz->next<SkScalar>(&a) ||
!fuzz->next<SkScalar>(&b) ||
!fuzz->next<SkScalar>(&c) ||
!fuzz->next<SkScalar>(&d) ||
!fuzz->next<SkScalar>(&e) ||
!fuzz->next<SkScalar>(&f))
return;
path->cubicTo(a, b, c, d, e, f);
break;
case SkPath::Verb::kClose_Verb:
path->close();
break;
case SkPath::Verb::kDone_Verb:
// In this case, simply exit.
return;
}
}
}
DEF_FUZZ(Pathop, fuzz) {
SkOpBuilder builder;
while (fuzz->remaining() >= sizeof(uint8_t)) {
SkPath path;
uint8_t op = fuzz->nextB();
BuildPath(fuzz, &path, SkPath::Verb::kDone_Verb);
builder.add(path, static_cast<SkPathOp>(op % (kLastOp + 1)));
}
SkPath result;
builder.resolve(&result);
}
|
