2 * Copyright 2011 Google Inc.
4 * Use of this source code is governed by a BSD-style license that can be
5 * found in the LICENSE file.
12 class SkDoOnce : SkNoncopyable {
14 SkDoOnce() { fDidOnce = false; }
16 bool needToDo() const { return !fDidOnce; }
17 bool alreadyDone() const { return fDidOnce; }
29 class ConvexPathsGM : public GM {
33 this->setBGColor(0xFF000000);
38 virtual SkString onShortName() {
39 return SkString("convexpaths");
43 virtual SkISize onISize() {
44 return SkISize::Make(1200, 1100);
48 if (fOnce.alreadyDone()) {
53 fPaths.push_back().moveTo(0, 0);
54 fPaths.back().quadTo(50 * SK_Scalar1, 100 * SK_Scalar1,
56 fPaths.back().lineTo(0, 0);
58 fPaths.push_back().moveTo(0, 50 * SK_Scalar1);
59 fPaths.back().quadTo(50 * SK_Scalar1, 0,
60 100 * SK_Scalar1, 50 * SK_Scalar1);
61 fPaths.back().quadTo(50 * SK_Scalar1, 100 * SK_Scalar1,
64 fPaths.push_back().addRect(0, 0,
65 100 * SK_Scalar1, 100 * SK_Scalar1,
66 SkPath::kCW_Direction);
68 fPaths.push_back().addRect(0, 0,
69 100 * SK_Scalar1, 100 * SK_Scalar1,
70 SkPath::kCCW_Direction);
72 fPaths.push_back().addCircle(50 * SK_Scalar1, 50 * SK_Scalar1,
73 50 * SK_Scalar1, SkPath::kCW_Direction);
76 fPaths.push_back().addOval(SkRect::MakeXYWH(0, 0,
79 SkPath::kCW_Direction);
81 fPaths.push_back().addOval(SkRect::MakeXYWH(0, 0,
84 SkPath::kCCW_Direction);
86 fPaths.push_back().addOval(SkRect::MakeXYWH(0, 0,
89 SkPath::kCCW_Direction);
91 fPaths.push_back().addRoundRect(SkRect::MakeXYWH(0, 0,
94 40 * SK_Scalar1, 20 * SK_Scalar1,
95 SkPath::kCW_Direction);
97 // large number of points
100 kPtsPerSide = (1 << 12),
102 fPaths.push_back().moveTo(0, 0);
103 for (int i = 1; i < kPtsPerSide; ++i) { // skip the first point due to moveTo.
104 fPaths.back().lineTo(kLength * SkIntToScalar(i) / kPtsPerSide, 0);
106 for (int i = 0; i < kPtsPerSide; ++i) {
107 fPaths.back().lineTo(kLength, kLength * SkIntToScalar(i) / kPtsPerSide);
109 for (int i = kPtsPerSide; i > 0; --i) {
110 fPaths.back().lineTo(kLength * SkIntToScalar(i) / kPtsPerSide, kLength);
112 for (int i = kPtsPerSide; i > 0; --i) {
113 fPaths.back().lineTo(0, kLength * SkIntToScalar(i) / kPtsPerSide);
117 fPaths.push_back().lineTo(100 * SK_Scalar1, SK_Scalar1);
118 fPaths.back().lineTo(98 * SK_Scalar1, 100 * SK_Scalar1);
119 fPaths.back().lineTo(3 * SK_Scalar1, 96 * SK_Scalar1);
121 fPaths.push_back().arcTo(SkRect::MakeXYWH(0, 0,
124 25 * SK_Scalar1, 130 * SK_Scalar1, false);
127 fPaths.push_back().cubicTo( 1 * SK_Scalar1, 1 * SK_Scalar1,
128 10 * SK_Scalar1, 90 * SK_Scalar1,
129 0 * SK_Scalar1, 100 * SK_Scalar1);
130 fPaths.push_back().cubicTo(100 * SK_Scalar1, 50 * SK_Scalar1,
131 20 * SK_Scalar1, 100 * SK_Scalar1,
132 0 * SK_Scalar1, 0 * SK_Scalar1);
134 // path that has a cubic with a repeated first control point and
135 // a repeated last control point.
136 fPaths.push_back().moveTo(SK_Scalar1 * 10, SK_Scalar1 * 10);
137 fPaths.back().cubicTo(10 * SK_Scalar1, 10 * SK_Scalar1,
140 fPaths.back().lineTo(40 * SK_Scalar1, 0);
141 fPaths.back().cubicTo(40 * SK_Scalar1, 0,
143 50 * SK_Scalar1, 10 * SK_Scalar1);
145 // path that has two cubics with repeated middle control points.
146 fPaths.push_back().moveTo(SK_Scalar1 * 10, SK_Scalar1 * 10);
147 fPaths.back().cubicTo(10 * SK_Scalar1, 0,
150 fPaths.back().lineTo(40 * SK_Scalar1, 0);
151 fPaths.back().cubicTo(50 * SK_Scalar1, 0,
153 50 * SK_Scalar1, 10 * SK_Scalar1);
155 // cubic where last three points are almost a line
156 fPaths.push_back().moveTo(0, 228 * SK_Scalar1 / 8);
157 fPaths.back().cubicTo(628 * SK_Scalar1 / 8, 82 * SK_Scalar1 / 8,
158 1255 * SK_Scalar1 / 8, 141 * SK_Scalar1 / 8,
159 1883 * SK_Scalar1 / 8, 202 * SK_Scalar1 / 8);
161 // flat cubic where the at end point tangents both point outward.
162 fPaths.push_back().moveTo(10 * SK_Scalar1, 0);
163 fPaths.back().cubicTo(0, SK_Scalar1,
164 30 * SK_Scalar1, SK_Scalar1,
167 // flat cubic where initial tangent is in, end tangent out
168 fPaths.push_back().moveTo(0, 0 * SK_Scalar1);
169 fPaths.back().cubicTo(10 * SK_Scalar1, SK_Scalar1,
170 30 * SK_Scalar1, SK_Scalar1,
173 // flat cubic where initial tangent is out, end tangent in
174 fPaths.push_back().moveTo(10 * SK_Scalar1, 0);
175 fPaths.back().cubicTo(0, SK_Scalar1,
176 20 * SK_Scalar1, SK_Scalar1,
179 // triangle where one edge is a degenerate quad
180 fPaths.push_back().moveTo(8.59375f, 45 * SK_Scalar1);
181 fPaths.back().quadTo(16.9921875f, 45 * SK_Scalar1,
182 31.25f, 45 * SK_Scalar1);
183 fPaths.back().lineTo(100 * SK_Scalar1, 100 * SK_Scalar1);
184 fPaths.back().lineTo(8.59375f, 45 * SK_Scalar1);
186 // triangle where one edge is a quad with a repeated point
187 fPaths.push_back().moveTo(0, 25 * SK_Scalar1);
188 fPaths.back().lineTo(50 * SK_Scalar1, 0);
189 fPaths.back().quadTo(50 * SK_Scalar1, 50 * SK_Scalar1, 50 * SK_Scalar1, 50 * SK_Scalar1);
191 // triangle where one edge is a cubic with a 2x repeated point
192 fPaths.push_back().moveTo(0, 25 * SK_Scalar1);
193 fPaths.back().lineTo(50 * SK_Scalar1, 0);
194 fPaths.back().cubicTo(50 * SK_Scalar1, 0,
195 50 * SK_Scalar1, 50 * SK_Scalar1,
196 50 * SK_Scalar1, 50 * SK_Scalar1);
198 // triangle where one edge is a quad with a nearly repeated point
199 fPaths.push_back().moveTo(0, 25 * SK_Scalar1);
200 fPaths.back().lineTo(50 * SK_Scalar1, 0);
201 fPaths.back().quadTo(50 * SK_Scalar1, 49.95f,
202 50 * SK_Scalar1, 50 * SK_Scalar1);
204 // triangle where one edge is a cubic with a 3x nearly repeated point
205 fPaths.push_back().moveTo(0, 25 * SK_Scalar1);
206 fPaths.back().lineTo(50 * SK_Scalar1, 0);
207 fPaths.back().cubicTo(50 * SK_Scalar1, 49.95f,
208 50 * SK_Scalar1, 49.97f,
209 50 * SK_Scalar1, 50 * SK_Scalar1);
211 // triangle where there is a point degenerate cubic at one corner
212 fPaths.push_back().moveTo(0, 25 * SK_Scalar1);
213 fPaths.back().lineTo(50 * SK_Scalar1, 0);
214 fPaths.back().lineTo(50 * SK_Scalar1, 50 * SK_Scalar1);
215 fPaths.back().cubicTo(50 * SK_Scalar1, 50 * SK_Scalar1,
216 50 * SK_Scalar1, 50 * SK_Scalar1,
217 50 * SK_Scalar1, 50 * SK_Scalar1);
220 fPaths.push_back().moveTo(50 * SK_Scalar1, 50 * SK_Scalar1);
221 fPaths.back().lineTo(50 * SK_Scalar1, 50 * SK_Scalar1);
224 fPaths.push_back().moveTo(50 * SK_Scalar1, 50 * SK_Scalar1);
225 fPaths.back().quadTo(50 * SK_Scalar1, 50 * SK_Scalar1,
226 50 * SK_Scalar1, 50 * SK_Scalar1);
229 fPaths.push_back().moveTo(50 * SK_Scalar1, 50 * SK_Scalar1);
230 fPaths.back().cubicTo(50 * SK_Scalar1, 50 * SK_Scalar1,
231 50 * SK_Scalar1, 50 * SK_Scalar1,
232 50 * SK_Scalar1, 50 * SK_Scalar1);
235 fPaths.push_back().moveTo(0, 0);
236 fPaths.back().moveTo(0, 0);
237 fPaths.back().moveTo(SK_Scalar1, SK_Scalar1);
238 fPaths.back().moveTo(SK_Scalar1, SK_Scalar1);
239 fPaths.back().moveTo(10 * SK_Scalar1, 10 * SK_Scalar1);
241 fPaths.push_back().moveTo(0, 0);
242 fPaths.back().moveTo(0, 0);
245 fPaths.push_back().lineTo(100 * SK_Scalar1, 100 * SK_Scalar1);
246 fPaths.push_back().quadTo(100 * SK_Scalar1, 100 * SK_Scalar1, 0, 0);
247 fPaths.push_back().quadTo(100 * SK_Scalar1, 100 * SK_Scalar1,
248 50 * SK_Scalar1, 50 * SK_Scalar1);
249 fPaths.push_back().quadTo(50 * SK_Scalar1, 50 * SK_Scalar1,
250 100 * SK_Scalar1, 100 * SK_Scalar1);
251 fPaths.push_back().cubicTo(0, 0,
253 100 * SK_Scalar1, 100 * SK_Scalar1);
255 // small circle. This is listed last so that it has device coords far
256 // from the origin (small area relative to x,y values).
257 fPaths.push_back().addCircle(0, 0, 1.2f);
260 virtual void onDraw(SkCanvas* canvas) {
264 paint.setAntiAlias(true);
266 canvas->translate(20 * SK_Scalar1, 20 * SK_Scalar1);
268 // As we've added more paths this has gotten pretty big. Scale the whole thing down.
269 canvas->scale(2 * SK_Scalar1 / 3, 2 * SK_Scalar1 / 3);
271 for (int i = 0; i < fPaths.count(); ++i) {
273 // position the path, and make it at off-integer coords.
274 canvas->translate(SK_Scalar1 * 200 * (i % 5) + SK_Scalar1 / 10,
275 SK_Scalar1 * 200 * (i / 5) + 9 * SK_Scalar1 / 10);
276 SkColor color = rand.nextU();
278 paint.setColor(color);
279 #if 0 // This hitting on 32bit Linux builds for some paths. Temporarily disabling while it is
281 SkASSERT(fPaths[i].isConvex());
283 canvas->drawPath(fPaths[i], paint);
289 typedef GM INHERITED;
290 SkTArray<SkPath> fPaths;
293 //////////////////////////////////////////////////////////////////////////////
295 static GM* MyFactory(void*) { return new ConvexPathsGM; }
296 static GMRegistry reg(MyFactory);