convexpaths.cpp 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305
  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. #include "gm/gm.h"
  8. #include "include/core/SkCanvas.h"
  9. #include "include/core/SkColor.h"
  10. #include "include/core/SkMatrix.h"
  11. #include "include/core/SkPaint.h"
  12. #include "include/core/SkPath.h"
  13. #include "include/core/SkRect.h"
  14. #include "include/core/SkScalar.h"
  15. #include "include/core/SkSize.h"
  16. #include "include/core/SkString.h"
  17. #include "include/core/SkTypes.h"
  18. #include "include/private/SkNoncopyable.h"
  19. #include "include/private/SkTArray.h"
  20. #include "include/utils/SkRandom.h"
  21. namespace {
  22. class SkDoOnce : SkNoncopyable {
  23. public:
  24. SkDoOnce() { fDidOnce = false; }
  25. bool needToDo() const { return !fDidOnce; }
  26. bool alreadyDone() const { return fDidOnce; }
  27. void accomplished() {
  28. SkASSERT(!fDidOnce);
  29. fDidOnce = true;
  30. }
  31. private:
  32. bool fDidOnce;
  33. };
  34. class ConvexPathsGM : public skiagm::GM {
  35. SkDoOnce fOnce;
  36. void onOnceBeforeDraw() override { this->setBGColor(0xFF000000); }
  37. SkString onShortName() override { return SkString("convexpaths"); }
  38. SkISize onISize() override { return {1200, 1100}; }
  39. void makePaths() {
  40. if (fOnce.alreadyDone()) {
  41. return;
  42. }
  43. fOnce.accomplished();
  44. fPaths.push_back().moveTo(0, 0);
  45. fPaths.back().quadTo(50 * SK_Scalar1, 100 * SK_Scalar1,
  46. 0, 100 * SK_Scalar1);
  47. fPaths.back().lineTo(0, 0);
  48. fPaths.push_back().moveTo(0, 50 * SK_Scalar1);
  49. fPaths.back().quadTo(50 * SK_Scalar1, 0,
  50. 100 * SK_Scalar1, 50 * SK_Scalar1);
  51. fPaths.back().quadTo(50 * SK_Scalar1, 100 * SK_Scalar1,
  52. 0, 50 * SK_Scalar1);
  53. fPaths.push_back().addRect(0, 0,
  54. 100 * SK_Scalar1, 100 * SK_Scalar1,
  55. SkPath::kCW_Direction);
  56. fPaths.push_back().addRect(0, 0,
  57. 100 * SK_Scalar1, 100 * SK_Scalar1,
  58. SkPath::kCCW_Direction);
  59. fPaths.push_back().addCircle(50 * SK_Scalar1, 50 * SK_Scalar1,
  60. 50 * SK_Scalar1, SkPath::kCW_Direction);
  61. fPaths.push_back().addOval(SkRect::MakeXYWH(0, 0,
  62. 50 * SK_Scalar1,
  63. 100 * SK_Scalar1),
  64. SkPath::kCW_Direction);
  65. fPaths.push_back().addOval(SkRect::MakeXYWH(0, 0,
  66. 100 * SK_Scalar1,
  67. 5 * SK_Scalar1),
  68. SkPath::kCCW_Direction);
  69. fPaths.push_back().addOval(SkRect::MakeXYWH(0, 0,
  70. SK_Scalar1,
  71. 100 * SK_Scalar1),
  72. SkPath::kCCW_Direction);
  73. fPaths.push_back().addRoundRect(SkRect::MakeXYWH(0, 0,
  74. SK_Scalar1 * 100,
  75. SK_Scalar1 * 100),
  76. 40 * SK_Scalar1, 20 * SK_Scalar1,
  77. SkPath::kCW_Direction);
  78. // large number of points
  79. enum {
  80. kLength = 100,
  81. kPtsPerSide = (1 << 12),
  82. };
  83. fPaths.push_back().moveTo(0, 0);
  84. for (int i = 1; i < kPtsPerSide; ++i) { // skip the first point due to moveTo.
  85. fPaths.back().lineTo(kLength * SkIntToScalar(i) / kPtsPerSide, 0);
  86. }
  87. for (int i = 0; i < kPtsPerSide; ++i) {
  88. fPaths.back().lineTo(kLength, kLength * SkIntToScalar(i) / kPtsPerSide);
  89. }
  90. for (int i = kPtsPerSide; i > 0; --i) {
  91. fPaths.back().lineTo(kLength * SkIntToScalar(i) / kPtsPerSide, kLength);
  92. }
  93. for (int i = kPtsPerSide; i > 0; --i) {
  94. fPaths.back().lineTo(0, kLength * SkIntToScalar(i) / kPtsPerSide);
  95. }
  96. // shallow diagonals
  97. fPaths.push_back().lineTo(100 * SK_Scalar1, SK_Scalar1);
  98. fPaths.back().lineTo(98 * SK_Scalar1, 100 * SK_Scalar1);
  99. fPaths.back().lineTo(3 * SK_Scalar1, 96 * SK_Scalar1);
  100. fPaths.push_back().arcTo(SkRect::MakeXYWH(0, 0,
  101. 50 * SK_Scalar1,
  102. 100 * SK_Scalar1),
  103. 25 * SK_Scalar1, 130 * SK_Scalar1, false);
  104. // cubics
  105. fPaths.push_back().cubicTo( 1 * SK_Scalar1, 1 * SK_Scalar1,
  106. 10 * SK_Scalar1, 90 * SK_Scalar1,
  107. 0 * SK_Scalar1, 100 * SK_Scalar1);
  108. fPaths.push_back().cubicTo(100 * SK_Scalar1, 50 * SK_Scalar1,
  109. 20 * SK_Scalar1, 100 * SK_Scalar1,
  110. 0 * SK_Scalar1, 0 * SK_Scalar1);
  111. // path that has a cubic with a repeated first control point and
  112. // a repeated last control point.
  113. fPaths.push_back().moveTo(SK_Scalar1 * 10, SK_Scalar1 * 10);
  114. fPaths.back().cubicTo(10 * SK_Scalar1, 10 * SK_Scalar1,
  115. 10 * SK_Scalar1, 0,
  116. 20 * SK_Scalar1, 0);
  117. fPaths.back().lineTo(40 * SK_Scalar1, 0);
  118. fPaths.back().cubicTo(40 * SK_Scalar1, 0,
  119. 50 * SK_Scalar1, 0,
  120. 50 * SK_Scalar1, 10 * SK_Scalar1);
  121. // path that has two cubics with repeated middle control points.
  122. fPaths.push_back().moveTo(SK_Scalar1 * 10, SK_Scalar1 * 10);
  123. fPaths.back().cubicTo(10 * SK_Scalar1, 0,
  124. 10 * SK_Scalar1, 0,
  125. 20 * SK_Scalar1, 0);
  126. fPaths.back().lineTo(40 * SK_Scalar1, 0);
  127. fPaths.back().cubicTo(50 * SK_Scalar1, 0,
  128. 50 * SK_Scalar1, 0,
  129. 50 * SK_Scalar1, 10 * SK_Scalar1);
  130. // cubic where last three points are almost a line
  131. fPaths.push_back().moveTo(0, 228 * SK_Scalar1 / 8);
  132. fPaths.back().cubicTo(628 * SK_Scalar1 / 8, 82 * SK_Scalar1 / 8,
  133. 1255 * SK_Scalar1 / 8, 141 * SK_Scalar1 / 8,
  134. 1883 * SK_Scalar1 / 8, 202 * SK_Scalar1 / 8);
  135. // flat cubic where the at end point tangents both point outward.
  136. fPaths.push_back().moveTo(10 * SK_Scalar1, 0);
  137. fPaths.back().cubicTo(0, SK_Scalar1,
  138. 30 * SK_Scalar1, SK_Scalar1,
  139. 20 * SK_Scalar1, 0);
  140. // flat cubic where initial tangent is in, end tangent out
  141. fPaths.push_back().moveTo(0, 0 * SK_Scalar1);
  142. fPaths.back().cubicTo(10 * SK_Scalar1, SK_Scalar1,
  143. 30 * SK_Scalar1, SK_Scalar1,
  144. 20 * SK_Scalar1, 0);
  145. // flat cubic where initial tangent is out, end tangent in
  146. fPaths.push_back().moveTo(10 * SK_Scalar1, 0);
  147. fPaths.back().cubicTo(0, SK_Scalar1,
  148. 20 * SK_Scalar1, SK_Scalar1,
  149. 30 * SK_Scalar1, 0);
  150. // triangle where one edge is a degenerate quad
  151. fPaths.push_back().moveTo(8.59375f, 45 * SK_Scalar1);
  152. fPaths.back().quadTo(16.9921875f, 45 * SK_Scalar1,
  153. 31.25f, 45 * SK_Scalar1);
  154. fPaths.back().lineTo(100 * SK_Scalar1, 100 * SK_Scalar1);
  155. fPaths.back().lineTo(8.59375f, 45 * SK_Scalar1);
  156. // triangle where one edge is a quad with a repeated point
  157. fPaths.push_back().moveTo(0, 25 * SK_Scalar1);
  158. fPaths.back().lineTo(50 * SK_Scalar1, 0);
  159. fPaths.back().quadTo(50 * SK_Scalar1, 50 * SK_Scalar1, 50 * SK_Scalar1, 50 * SK_Scalar1);
  160. // triangle where one edge is a cubic with a 2x repeated point
  161. fPaths.push_back().moveTo(0, 25 * SK_Scalar1);
  162. fPaths.back().lineTo(50 * SK_Scalar1, 0);
  163. fPaths.back().cubicTo(50 * SK_Scalar1, 0,
  164. 50 * SK_Scalar1, 50 * SK_Scalar1,
  165. 50 * SK_Scalar1, 50 * SK_Scalar1);
  166. // triangle where one edge is a quad with a nearly repeated point
  167. fPaths.push_back().moveTo(0, 25 * SK_Scalar1);
  168. fPaths.back().lineTo(50 * SK_Scalar1, 0);
  169. fPaths.back().quadTo(50 * SK_Scalar1, 49.95f,
  170. 50 * SK_Scalar1, 50 * SK_Scalar1);
  171. // triangle where one edge is a cubic with a 3x nearly repeated point
  172. fPaths.push_back().moveTo(0, 25 * SK_Scalar1);
  173. fPaths.back().lineTo(50 * SK_Scalar1, 0);
  174. fPaths.back().cubicTo(50 * SK_Scalar1, 49.95f,
  175. 50 * SK_Scalar1, 49.97f,
  176. 50 * SK_Scalar1, 50 * SK_Scalar1);
  177. // triangle where there is a point degenerate cubic at one corner
  178. fPaths.push_back().moveTo(0, 25 * SK_Scalar1);
  179. fPaths.back().lineTo(50 * SK_Scalar1, 0);
  180. fPaths.back().lineTo(50 * SK_Scalar1, 50 * SK_Scalar1);
  181. fPaths.back().cubicTo(50 * SK_Scalar1, 50 * SK_Scalar1,
  182. 50 * SK_Scalar1, 50 * SK_Scalar1,
  183. 50 * SK_Scalar1, 50 * SK_Scalar1);
  184. // point line
  185. fPaths.push_back().moveTo(50 * SK_Scalar1, 50 * SK_Scalar1);
  186. fPaths.back().lineTo(50 * SK_Scalar1, 50 * SK_Scalar1);
  187. // point quad
  188. fPaths.push_back().moveTo(50 * SK_Scalar1, 50 * SK_Scalar1);
  189. fPaths.back().quadTo(50 * SK_Scalar1, 50 * SK_Scalar1,
  190. 50 * SK_Scalar1, 50 * SK_Scalar1);
  191. // point cubic
  192. fPaths.push_back().moveTo(50 * SK_Scalar1, 50 * SK_Scalar1);
  193. fPaths.back().cubicTo(50 * SK_Scalar1, 50 * SK_Scalar1,
  194. 50 * SK_Scalar1, 50 * SK_Scalar1,
  195. 50 * SK_Scalar1, 50 * SK_Scalar1);
  196. // moveTo only paths
  197. fPaths.push_back().moveTo(0, 0);
  198. fPaths.back().moveTo(0, 0);
  199. fPaths.back().moveTo(SK_Scalar1, SK_Scalar1);
  200. fPaths.back().moveTo(SK_Scalar1, SK_Scalar1);
  201. fPaths.back().moveTo(10 * SK_Scalar1, 10 * SK_Scalar1);
  202. fPaths.push_back().moveTo(0, 0);
  203. fPaths.back().moveTo(0, 0);
  204. // line degenerate
  205. fPaths.push_back().lineTo(100 * SK_Scalar1, 100 * SK_Scalar1);
  206. fPaths.push_back().quadTo(100 * SK_Scalar1, 100 * SK_Scalar1, 0, 0);
  207. fPaths.push_back().quadTo(100 * SK_Scalar1, 100 * SK_Scalar1,
  208. 50 * SK_Scalar1, 50 * SK_Scalar1);
  209. fPaths.push_back().quadTo(50 * SK_Scalar1, 50 * SK_Scalar1,
  210. 100 * SK_Scalar1, 100 * SK_Scalar1);
  211. fPaths.push_back().cubicTo(0, 0,
  212. 0, 0,
  213. 100 * SK_Scalar1, 100 * SK_Scalar1);
  214. // skbug.com/8928
  215. fPaths.push_back().moveTo(16.875f, 192.594f);
  216. fPaths.back().cubicTo(45.625f, 192.594f, 74.375f, 192.594f, 103.125f, 192.594f);
  217. fPaths.back().cubicTo(88.75f, 167.708f, 74.375f, 142.823f, 60, 117.938f);
  218. fPaths.back().cubicTo(45.625f, 142.823f, 31.25f, 167.708f, 16.875f, 192.594f);
  219. fPaths.back().close();
  220. SkMatrix m;
  221. m.setAll(0.1f, 0, -1, 0, 0.115207f, -2.64977f, 0, 0, 1);
  222. fPaths.back().transform(m);
  223. // small circle. This is listed last so that it has device coords far
  224. // from the origin (small area relative to x,y values).
  225. fPaths.push_back().addCircle(0, 0, 1.2f);
  226. }
  227. void onDraw(SkCanvas* canvas) override {
  228. this->makePaths();
  229. SkPaint paint;
  230. paint.setAntiAlias(true);
  231. SkRandom rand;
  232. canvas->translate(20 * SK_Scalar1, 20 * SK_Scalar1);
  233. // As we've added more paths this has gotten pretty big. Scale the whole thing down.
  234. canvas->scale(2 * SK_Scalar1 / 3, 2 * SK_Scalar1 / 3);
  235. for (int i = 0; i < fPaths.count(); ++i) {
  236. canvas->save();
  237. // position the path, and make it at off-integer coords.
  238. canvas->translate(SK_Scalar1 * 200 * (i % 5) + SK_Scalar1 / 10,
  239. SK_Scalar1 * 200 * (i / 5) + 9 * SK_Scalar1 / 10);
  240. SkColor color = rand.nextU();
  241. color |= 0xff000000;
  242. paint.setColor(color);
  243. #if 0 // This hitting on 32bit Linux builds for some paths. Temporarily disabling while it is
  244. // debugged.
  245. SkASSERT(fPaths[i].isConvex());
  246. #endif
  247. canvas->drawPath(fPaths[i], paint);
  248. canvas->restore();
  249. }
  250. }
  251. SkTArray<SkPath> fPaths;
  252. };
  253. } // namespace
  254. DEF_GM( return new ConvexPathsGM; )