SVGPathElement.cpp 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272
  1. /*
  2. * Copyright (c) 2020, Matthew Olsson <mattco@serenityos.org>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include <AK/Debug.h>
  7. #include <AK/ExtraMathConstants.h>
  8. #include <LibGfx/Painter.h>
  9. #include <LibGfx/Path.h>
  10. #include <LibWeb/DOM/Document.h>
  11. #include <LibWeb/DOM/Event.h>
  12. #include <LibWeb/Layout/SVGGeometryBox.h>
  13. #include <LibWeb/SVG/SVGPathElement.h>
  14. namespace Web::SVG {
  15. [[maybe_unused]] static void print_instruction(const PathInstruction& instruction)
  16. {
  17. VERIFY(PATH_DEBUG);
  18. auto& data = instruction.data;
  19. switch (instruction.type) {
  20. case PathInstructionType::Move:
  21. dbgln("Move (absolute={})", instruction.absolute);
  22. for (size_t i = 0; i < data.size(); i += 2)
  23. dbgln(" x={}, y={}", data[i], data[i + 1]);
  24. break;
  25. case PathInstructionType::ClosePath:
  26. dbgln("ClosePath (absolute={})", instruction.absolute);
  27. break;
  28. case PathInstructionType::Line:
  29. dbgln("Line (absolute={})", instruction.absolute);
  30. for (size_t i = 0; i < data.size(); i += 2)
  31. dbgln(" x={}, y={}", data[i], data[i + 1]);
  32. break;
  33. case PathInstructionType::HorizontalLine:
  34. dbgln("HorizontalLine (absolute={})", instruction.absolute);
  35. for (size_t i = 0; i < data.size(); ++i)
  36. dbgln(" x={}", data[i]);
  37. break;
  38. case PathInstructionType::VerticalLine:
  39. dbgln("VerticalLine (absolute={})", instruction.absolute);
  40. for (size_t i = 0; i < data.size(); ++i)
  41. dbgln(" y={}", data[i]);
  42. break;
  43. case PathInstructionType::Curve:
  44. dbgln("Curve (absolute={})", instruction.absolute);
  45. for (size_t i = 0; i < data.size(); i += 6)
  46. dbgln(" (x1={}, y1={}, x2={}, y2={}), (x={}, y={})", data[i], data[i + 1], data[i + 2], data[i + 3], data[i + 4], data[i + 5]);
  47. break;
  48. case PathInstructionType::SmoothCurve:
  49. dbgln("SmoothCurve (absolute={})", instruction.absolute);
  50. for (size_t i = 0; i < data.size(); i += 4)
  51. dbgln(" (x2={}, y2={}), (x={}, y={})", data[i], data[i + 1], data[i + 2], data[i + 3]);
  52. break;
  53. case PathInstructionType::QuadraticBezierCurve:
  54. dbgln("QuadraticBezierCurve (absolute={})", instruction.absolute);
  55. for (size_t i = 0; i < data.size(); i += 4)
  56. dbgln(" (x1={}, y1={}), (x={}, y={})", data[i], data[i + 1], data[i + 2], data[i + 3]);
  57. break;
  58. case PathInstructionType::SmoothQuadraticBezierCurve:
  59. dbgln("SmoothQuadraticBezierCurve (absolute={})", instruction.absolute);
  60. for (size_t i = 0; i < data.size(); i += 2)
  61. dbgln(" x={}, y={}", data[i], data[i + 1]);
  62. break;
  63. case PathInstructionType::EllipticalArc:
  64. dbgln("EllipticalArc (absolute={})", instruction.absolute);
  65. for (size_t i = 0; i < data.size(); i += 7)
  66. dbgln(" (rx={}, ry={}) x-axis-rotation={}, large-arc-flag={}, sweep-flag={}, (x={}, y={})",
  67. data[i],
  68. data[i + 1],
  69. data[i + 2],
  70. data[i + 3],
  71. data[i + 4],
  72. data[i + 5],
  73. data[i + 6]);
  74. break;
  75. case PathInstructionType::Invalid:
  76. dbgln("Invalid");
  77. break;
  78. }
  79. }
  80. SVGPathElement::SVGPathElement(DOM::Document& document, DOM::QualifiedName qualified_name)
  81. : SVGGeometryElement(document, move(qualified_name))
  82. {
  83. }
  84. void SVGPathElement::parse_attribute(FlyString const& name, String const& value)
  85. {
  86. SVGGeometryElement::parse_attribute(name, value);
  87. if (name == "d") {
  88. m_instructions = AttributeParser::parse_path_data(value);
  89. m_path.clear();
  90. }
  91. }
  92. Gfx::Path& SVGPathElement::get_path()
  93. {
  94. if (m_path.has_value())
  95. return m_path.value();
  96. Gfx::Path path;
  97. PathInstructionType last_instruction = PathInstructionType::Invalid;
  98. for (auto& instruction : m_instructions) {
  99. // If the first path element uses relative coordinates, we treat them as absolute by making them relative to (0, 0).
  100. auto last_point = path.segments().is_empty() ? Gfx::FloatPoint { 0, 0 } : path.segments().last().point();
  101. auto& absolute = instruction.absolute;
  102. auto& data = instruction.data;
  103. if constexpr (PATH_DEBUG) {
  104. print_instruction(instruction);
  105. }
  106. bool clear_last_control_point = true;
  107. switch (instruction.type) {
  108. case PathInstructionType::Move: {
  109. Gfx::FloatPoint point = { data[0], data[1] };
  110. if (absolute) {
  111. path.move_to(point);
  112. } else {
  113. path.move_to(point + last_point);
  114. }
  115. break;
  116. }
  117. case PathInstructionType::ClosePath:
  118. path.close();
  119. break;
  120. case PathInstructionType::Line: {
  121. Gfx::FloatPoint point = { data[0], data[1] };
  122. if (absolute) {
  123. path.line_to(point);
  124. } else {
  125. path.line_to(point + last_point);
  126. }
  127. break;
  128. }
  129. case PathInstructionType::HorizontalLine: {
  130. if (absolute)
  131. path.line_to(Gfx::FloatPoint { data[0], last_point.y() });
  132. else
  133. path.line_to(Gfx::FloatPoint { data[0] + last_point.x(), last_point.y() });
  134. break;
  135. }
  136. case PathInstructionType::VerticalLine: {
  137. if (absolute)
  138. path.line_to(Gfx::FloatPoint { last_point.x(), data[0] });
  139. else
  140. path.line_to(Gfx::FloatPoint { last_point.x(), data[0] + last_point.y() });
  141. break;
  142. }
  143. case PathInstructionType::EllipticalArc: {
  144. double rx = data[0];
  145. double ry = data[1];
  146. double x_axis_rotation = double { data[2] } * M_DEG2RAD;
  147. double large_arc_flag = data[3];
  148. double sweep_flag = data[4];
  149. Gfx::FloatPoint next_point;
  150. if (absolute)
  151. next_point = { data[5], data[6] };
  152. else
  153. next_point = { data[5] + last_point.x(), data[6] + last_point.y() };
  154. path.elliptical_arc_to(next_point, { rx, ry }, x_axis_rotation, large_arc_flag != 0, sweep_flag != 0);
  155. break;
  156. }
  157. case PathInstructionType::QuadraticBezierCurve: {
  158. clear_last_control_point = false;
  159. Gfx::FloatPoint through = { data[0], data[1] };
  160. Gfx::FloatPoint point = { data[2], data[3] };
  161. if (absolute) {
  162. path.quadratic_bezier_curve_to(through, point);
  163. m_previous_control_point = through;
  164. } else {
  165. auto control_point = through + last_point;
  166. path.quadratic_bezier_curve_to(control_point, point + last_point);
  167. m_previous_control_point = control_point;
  168. }
  169. break;
  170. }
  171. case PathInstructionType::SmoothQuadraticBezierCurve: {
  172. clear_last_control_point = false;
  173. if (m_previous_control_point.is_null()
  174. || ((last_instruction != PathInstructionType::QuadraticBezierCurve) && (last_instruction != PathInstructionType::SmoothQuadraticBezierCurve))) {
  175. m_previous_control_point = last_point;
  176. }
  177. auto dx_end_control = last_point.dx_relative_to(m_previous_control_point);
  178. auto dy_end_control = last_point.dy_relative_to(m_previous_control_point);
  179. auto control_point = Gfx::FloatPoint { last_point.x() + dx_end_control, last_point.y() + dy_end_control };
  180. Gfx::FloatPoint end_point = { data[0], data[1] };
  181. if (absolute) {
  182. path.quadratic_bezier_curve_to(control_point, end_point);
  183. } else {
  184. path.quadratic_bezier_curve_to(control_point, end_point + last_point);
  185. }
  186. m_previous_control_point = control_point;
  187. break;
  188. }
  189. case PathInstructionType::Curve: {
  190. clear_last_control_point = false;
  191. Gfx::FloatPoint c1 = { data[0], data[1] };
  192. Gfx::FloatPoint c2 = { data[2], data[3] };
  193. Gfx::FloatPoint p2 = { data[4], data[5] };
  194. if (!absolute) {
  195. p2 += last_point;
  196. c1 += last_point;
  197. c2 += last_point;
  198. }
  199. path.cubic_bezier_curve_to(c1, c2, p2);
  200. m_previous_control_point = c2;
  201. break;
  202. }
  203. case PathInstructionType::SmoothCurve: {
  204. clear_last_control_point = false;
  205. if (m_previous_control_point.is_null()
  206. || ((last_instruction != PathInstructionType::Curve) && (last_instruction != PathInstructionType::SmoothCurve))) {
  207. m_previous_control_point = last_point;
  208. }
  209. // 9.5.2. Reflected control points https://svgwg.org/svg2-draft/paths.html#ReflectedControlPoints
  210. // If the current point is (curx, cury) and the final control point of the previous path segment is (oldx2, oldy2),
  211. // then the reflected point (i.e., (newx1, newy1), the first control point of the current path segment) is:
  212. // (newx1, newy1) = (curx - (oldx2 - curx), cury - (oldy2 - cury))
  213. auto reflected_previous_control_x = last_point.x() - m_previous_control_point.dx_relative_to(last_point);
  214. auto reflected_previous_control_y = last_point.y() - m_previous_control_point.dy_relative_to(last_point);
  215. Gfx::FloatPoint c1 = Gfx::FloatPoint { reflected_previous_control_x, reflected_previous_control_y };
  216. Gfx::FloatPoint c2 = { data[0], data[1] };
  217. Gfx::FloatPoint p2 = { data[2], data[3] };
  218. if (!absolute) {
  219. p2 += last_point;
  220. c2 += last_point;
  221. }
  222. path.cubic_bezier_curve_to(c1, c2, p2);
  223. m_previous_control_point = c2;
  224. break;
  225. }
  226. case PathInstructionType::Invalid:
  227. VERIFY_NOT_REACHED();
  228. }
  229. if (clear_last_control_point) {
  230. m_previous_control_point = Gfx::FloatPoint {};
  231. }
  232. last_instruction = instruction.type;
  233. }
  234. m_path = path;
  235. return m_path.value();
  236. }
  237. }