import-svg.cpp 42 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065
  1. #ifndef _USE_MATH_DEFINES
  2. #define _USE_MATH_DEFINES
  3. #endif
  4. #ifndef _CRT_SECURE_NO_WARNINGS
  5. #define _CRT_SECURE_NO_WARNINGS
  6. #endif
  7. #include "import-svg.h"
  8. #ifndef MSDFGEN_DISABLE_SVG
  9. #include <cstdlib>
  10. #include <cstdio>
  11. #include <cstring>
  12. #include <vector>
  13. #include <string>
  14. #include <stack>
  15. #ifdef MSDFGEN_USE_TINYXML2
  16. #include <tinyxml2.h>
  17. #endif
  18. #ifdef MSDFGEN_USE_DROPXML
  19. #include <dropXML.hpp>
  20. #endif
  21. #ifdef MSDFGEN_USE_SKIA
  22. #include <skia/core/SkPath.h>
  23. #include <skia/utils/SkParsePath.h>
  24. #include <skia/pathops/SkPathOps.h>
  25. #endif
  26. #include "../core/arithmetics.hpp"
  27. #define ARC_SEGMENTS_PER_PI 2
  28. #define ENDPOINT_SNAP_RANGE_PROPORTION (1/16384.)
  29. namespace msdfgen {
  30. #if defined(_DEBUG) || !NDEBUG
  31. #define REQUIRE(cond) { if (!(cond)) { fprintf(stderr, "SVG Parse Error (%s:%d): " #cond "\n", __FILE__, __LINE__); return false; } }
  32. #else
  33. #define REQUIRE(cond) { if (!(cond)) return false; }
  34. #endif
  35. MSDFGEN_EXT_PUBLIC const int SVG_IMPORT_FAILURE = 0x00;
  36. MSDFGEN_EXT_PUBLIC const int SVG_IMPORT_SUCCESS_FLAG = 0x01;
  37. MSDFGEN_EXT_PUBLIC const int SVG_IMPORT_PARTIAL_FAILURE_FLAG = 0x02;
  38. MSDFGEN_EXT_PUBLIC const int SVG_IMPORT_INCOMPLETE_FLAG = 0x04;
  39. MSDFGEN_EXT_PUBLIC const int SVG_IMPORT_UNSUPPORTED_FEATURE_FLAG = 0x08;
  40. MSDFGEN_EXT_PUBLIC const int SVG_IMPORT_TRANSFORMATION_IGNORED_FLAG = 0x10;
  41. #define FLAGS_FINAL(flags) (((flags)&(SVG_IMPORT_SUCCESS_FLAG|SVG_IMPORT_INCOMPLETE_FLAG|SVG_IMPORT_UNSUPPORTED_FEATURE_FLAG)) == (SVG_IMPORT_SUCCESS_FLAG|SVG_IMPORT_INCOMPLETE_FLAG|SVG_IMPORT_UNSUPPORTED_FEATURE_FLAG))
  42. static void skipExtraChars(const char *&pathDef) {
  43. while (*pathDef == ',' || *pathDef == ' ' || *pathDef == '\t' || *pathDef == '\r' || *pathDef == '\n')
  44. ++pathDef;
  45. }
  46. static bool readNodeType(char &output, const char *&pathDef) {
  47. skipExtraChars(pathDef);
  48. char nodeType = *pathDef;
  49. if (nodeType && nodeType != '+' && nodeType != '-' && nodeType != '.' && nodeType != ',' && (nodeType < '0' || nodeType > '9')) {
  50. ++pathDef;
  51. output = nodeType;
  52. return true;
  53. }
  54. return false;
  55. }
  56. static bool readDouble(double &output, const char *&pathDef) {
  57. skipExtraChars(pathDef);
  58. char *end = NULL;
  59. output = strtod(pathDef, &end);
  60. if (end > pathDef) {
  61. pathDef = end;
  62. return true;
  63. }
  64. return false;
  65. }
  66. static bool readCoord(Point2 &output, const char *&pathDef) {
  67. return readDouble(output.x, pathDef) && readDouble(output.y, pathDef);
  68. }
  69. static bool readBool(bool &output, const char *&pathDef) {
  70. skipExtraChars(pathDef);
  71. char *end = NULL;
  72. long v = strtol(pathDef, &end, 10);
  73. if (end > pathDef) {
  74. pathDef = end;
  75. output = v != 0;
  76. return true;
  77. }
  78. return false;
  79. }
  80. static double arcAngle(Vector2 u, Vector2 v) {
  81. return nonZeroSign(crossProduct(u, v))*acos(clamp(dotProduct(u, v)/(u.length()*v.length()), -1., +1.));
  82. }
  83. static Vector2 rotateVector(Vector2 v, Vector2 direction) {
  84. return Vector2(direction.x*v.x-direction.y*v.y, direction.y*v.x+direction.x*v.y);
  85. }
  86. static void addArcApproximate(Contour &contour, Point2 startPoint, Point2 endPoint, Vector2 radius, double rotation, bool largeArc, bool sweep) {
  87. if (endPoint == startPoint)
  88. return;
  89. if (radius.x == 0 || radius.y == 0)
  90. return contour.addEdge(EdgeHolder(startPoint, endPoint));
  91. radius.x = fabs(radius.x);
  92. radius.y = fabs(radius.y);
  93. Vector2 axis(cos(rotation), sin(rotation));
  94. Vector2 rm = rotateVector(.5*(startPoint-endPoint), Vector2(axis.x, -axis.y));
  95. Vector2 rm2 = rm*rm;
  96. Vector2 radius2 = radius*radius;
  97. double radiusGap = rm2.x/radius2.x+rm2.y/radius2.y;
  98. if (radiusGap > 1) {
  99. radius *= sqrt(radiusGap);
  100. radius2 = radius*radius;
  101. }
  102. double dq = (radius2.x*rm2.y+radius2.y*rm2.x);
  103. double pq = radius2.x*radius2.y/dq-1;
  104. double q = (largeArc == sweep ? -1 : +1)*sqrt(max(pq, 0.));
  105. Vector2 rc(q*radius.x*rm.y/radius.y, -q*radius.y*rm.x/radius.x);
  106. Point2 center = .5*(startPoint+endPoint)+rotateVector(rc, axis);
  107. double angleStart = arcAngle(Vector2(1, 0), (rm-rc)/radius);
  108. double angleExtent = arcAngle((rm-rc)/radius, (-rm-rc)/radius);
  109. if (!sweep && angleExtent > 0)
  110. angleExtent -= 2*M_PI;
  111. else if (sweep && angleExtent < 0)
  112. angleExtent += 2*M_PI;
  113. int segments = (int) ceil(ARC_SEGMENTS_PER_PI/M_PI*fabs(angleExtent));
  114. double angleIncrement = angleExtent/segments;
  115. double cl = 4/3.*sin(.5*angleIncrement)/(1+cos(.5*angleIncrement));
  116. Point2 prevNode = startPoint;
  117. double angle = angleStart;
  118. for (int i = 0; i < segments; ++i) {
  119. Point2 controlPoint[2];
  120. Vector2 d(cos(angle), sin(angle));
  121. controlPoint[0] = center+rotateVector(Vector2(d.x-cl*d.y, d.y+cl*d.x)*radius, axis);
  122. angle += angleIncrement;
  123. d.set(cos(angle), sin(angle));
  124. controlPoint[1] = center+rotateVector(Vector2(d.x+cl*d.y, d.y-cl*d.x)*radius, axis);
  125. Point2 node = i == segments-1 ? endPoint : center+rotateVector(d*radius, axis);
  126. contour.addEdge(EdgeHolder(prevNode, controlPoint[0], controlPoint[1], node));
  127. prevNode = node;
  128. }
  129. }
  130. bool buildShapeFromSvgPath(Shape &shape, const char *pathDef, double endpointSnapRange) {
  131. char nodeType = '\0';
  132. char prevNodeType = '\0';
  133. Point2 prevNode(0, 0);
  134. bool nodeTypePreread = false;
  135. while (nodeTypePreread || readNodeType(nodeType, pathDef)) {
  136. nodeTypePreread = false;
  137. Contour &contour = shape.addContour();
  138. bool contourStart = true;
  139. Point2 startPoint;
  140. Point2 controlPoint[2];
  141. Point2 node;
  142. while (*pathDef) {
  143. switch (nodeType) {
  144. case 'M': case 'm':
  145. if (!contourStart) {
  146. nodeTypePreread = true;
  147. goto NEXT_CONTOUR;
  148. }
  149. REQUIRE(readCoord(node, pathDef));
  150. if (nodeType == 'm')
  151. node += prevNode;
  152. startPoint = node;
  153. --nodeType; // to 'L' or 'l'
  154. break;
  155. case 'Z': case 'z':
  156. REQUIRE(!contourStart);
  157. goto NEXT_CONTOUR;
  158. case 'L': case 'l':
  159. REQUIRE(readCoord(node, pathDef));
  160. if (nodeType == 'l')
  161. node += prevNode;
  162. contour.addEdge(EdgeHolder(prevNode, node));
  163. break;
  164. case 'H': case 'h':
  165. REQUIRE(readDouble(node.x, pathDef));
  166. if (nodeType == 'h')
  167. node.x += prevNode.x;
  168. contour.addEdge(EdgeHolder(prevNode, node));
  169. break;
  170. case 'V': case 'v':
  171. REQUIRE(readDouble(node.y, pathDef));
  172. if (nodeType == 'v')
  173. node.y += prevNode.y;
  174. contour.addEdge(EdgeHolder(prevNode, node));
  175. break;
  176. case 'Q': case 'q':
  177. REQUIRE(readCoord(controlPoint[0], pathDef));
  178. REQUIRE(readCoord(node, pathDef));
  179. if (nodeType == 'q') {
  180. controlPoint[0] += prevNode;
  181. node += prevNode;
  182. }
  183. contour.addEdge(EdgeHolder(prevNode, controlPoint[0], node));
  184. break;
  185. case 'T': case 't':
  186. if (prevNodeType == 'Q' || prevNodeType == 'q' || prevNodeType == 'T' || prevNodeType == 't')
  187. controlPoint[0] = node+node-controlPoint[0];
  188. else
  189. controlPoint[0] = node;
  190. REQUIRE(readCoord(node, pathDef));
  191. if (nodeType == 't')
  192. node += prevNode;
  193. contour.addEdge(EdgeHolder(prevNode, controlPoint[0], node));
  194. break;
  195. case 'C': case 'c':
  196. REQUIRE(readCoord(controlPoint[0], pathDef));
  197. REQUIRE(readCoord(controlPoint[1], pathDef));
  198. REQUIRE(readCoord(node, pathDef));
  199. if (nodeType == 'c') {
  200. controlPoint[0] += prevNode;
  201. controlPoint[1] += prevNode;
  202. node += prevNode;
  203. }
  204. contour.addEdge(EdgeHolder(prevNode, controlPoint[0], controlPoint[1], node));
  205. break;
  206. case 'S': case 's':
  207. if (prevNodeType == 'C' || prevNodeType == 'c' || prevNodeType == 'S' || prevNodeType == 's')
  208. controlPoint[0] = node+node-controlPoint[1];
  209. else
  210. controlPoint[0] = node;
  211. REQUIRE(readCoord(controlPoint[1], pathDef));
  212. REQUIRE(readCoord(node, pathDef));
  213. if (nodeType == 's') {
  214. controlPoint[1] += prevNode;
  215. node += prevNode;
  216. }
  217. contour.addEdge(EdgeHolder(prevNode, controlPoint[0], controlPoint[1], node));
  218. break;
  219. case 'A': case 'a':
  220. {
  221. Vector2 radius;
  222. double angle;
  223. bool largeArg;
  224. bool sweep;
  225. REQUIRE(readCoord(radius, pathDef));
  226. REQUIRE(readDouble(angle, pathDef));
  227. REQUIRE(readBool(largeArg, pathDef));
  228. REQUIRE(readBool(sweep, pathDef));
  229. REQUIRE(readCoord(node, pathDef));
  230. if (nodeType == 'a')
  231. node += prevNode;
  232. angle *= M_PI/180.0;
  233. addArcApproximate(contour, prevNode, node, radius, angle, largeArg, sweep);
  234. }
  235. break;
  236. default:
  237. REQUIRE(!"Unknown node type");
  238. }
  239. contourStart &= nodeType == 'M' || nodeType == 'm';
  240. prevNode = node;
  241. prevNodeType = nodeType;
  242. readNodeType(nodeType, pathDef);
  243. }
  244. NEXT_CONTOUR:
  245. // Fix contour if it isn't properly closed
  246. if (!contour.edges.empty() && prevNode != startPoint) {
  247. if ((contour.edges.back()->point(1)-contour.edges[0]->point(0)).length() < endpointSnapRange)
  248. contour.edges.back()->moveEndPoint(contour.edges[0]->point(0));
  249. else
  250. contour.addEdge(EdgeHolder(prevNode, startPoint));
  251. }
  252. prevNode = startPoint;
  253. prevNodeType = '\0';
  254. }
  255. return true;
  256. }
  257. #ifdef MSDFGEN_USE_TINYXML2
  258. static void findPathByForwardIndex(tinyxml2::XMLElement *&path, int &flags, int &skips, tinyxml2::XMLElement *parent, bool hasTransformation) {
  259. for (tinyxml2::XMLElement *cur = parent->FirstChildElement(); cur && !FLAGS_FINAL(flags); cur = cur->NextSiblingElement()) {
  260. if (!strcmp(cur->Name(), "path")) {
  261. if (!skips--) {
  262. path = cur;
  263. flags |= SVG_IMPORT_SUCCESS_FLAG;
  264. if (hasTransformation || cur->Attribute("transform"))
  265. flags |= SVG_IMPORT_TRANSFORMATION_IGNORED_FLAG;
  266. } else if (flags&SVG_IMPORT_SUCCESS_FLAG)
  267. flags |= SVG_IMPORT_INCOMPLETE_FLAG;
  268. } else if (!strcmp(cur->Name(), "g"))
  269. findPathByForwardIndex(path, flags, skips, cur, hasTransformation || cur->Attribute("transform"));
  270. else if (!strcmp(cur->Name(), "rect") || !strcmp(cur->Name(), "circle") || !strcmp(cur->Name(), "ellipse") || !strcmp(cur->Name(), "polygon"))
  271. flags |= SVG_IMPORT_INCOMPLETE_FLAG;
  272. else if (!strcmp(cur->Name(), "mask") || !strcmp(cur->Name(), "use"))
  273. flags |= SVG_IMPORT_UNSUPPORTED_FEATURE_FLAG;
  274. }
  275. }
  276. static void findPathByBackwardIndex(tinyxml2::XMLElement *&path, int &flags, int &skips, tinyxml2::XMLElement *parent, bool hasTransformation) {
  277. for (tinyxml2::XMLElement *cur = parent->LastChildElement(); cur && !FLAGS_FINAL(flags); cur = cur->PreviousSiblingElement()) {
  278. if (!strcmp(cur->Name(), "path")) {
  279. if (!skips--) {
  280. path = cur;
  281. flags |= SVG_IMPORT_SUCCESS_FLAG;
  282. if (hasTransformation || cur->Attribute("transform"))
  283. flags |= SVG_IMPORT_TRANSFORMATION_IGNORED_FLAG;
  284. } else if (flags&SVG_IMPORT_SUCCESS_FLAG)
  285. flags |= SVG_IMPORT_INCOMPLETE_FLAG;
  286. } else if (!strcmp(cur->Name(), "g"))
  287. findPathByBackwardIndex(path, flags, skips, cur, hasTransformation || cur->Attribute("transform"));
  288. else if (!strcmp(cur->Name(), "rect") || !strcmp(cur->Name(), "circle") || !strcmp(cur->Name(), "ellipse") || !strcmp(cur->Name(), "polygon"))
  289. flags |= SVG_IMPORT_INCOMPLETE_FLAG;
  290. else if (!strcmp(cur->Name(), "mask") || !strcmp(cur->Name(), "use"))
  291. flags |= SVG_IMPORT_UNSUPPORTED_FEATURE_FLAG;
  292. }
  293. }
  294. bool loadSvgShape(Shape &output, const char *filename, int pathIndex, Vector2 *dimensions) {
  295. tinyxml2::XMLDocument doc;
  296. if (doc.LoadFile(filename))
  297. return false;
  298. tinyxml2::XMLElement *root = doc.FirstChildElement("svg");
  299. if (!root)
  300. return false;
  301. tinyxml2::XMLElement *path = NULL;
  302. int flags = 0;
  303. int skippedPaths = abs(pathIndex)-(pathIndex != 0);
  304. if (pathIndex > 0)
  305. findPathByForwardIndex(path, flags, skippedPaths, root, false);
  306. else
  307. findPathByBackwardIndex(path, flags, skippedPaths, root, false);
  308. if (!path)
  309. return false;
  310. const char *pd = path->Attribute("d");
  311. if (!pd)
  312. return false;
  313. Vector2 dims(root->DoubleAttribute("width"), root->DoubleAttribute("height"));
  314. if (const char *viewBox = root->Attribute("viewBox")) {
  315. double left = 0, top = 0;
  316. readDouble(left, viewBox) && readDouble(top, viewBox) && readDouble(dims.x, viewBox) && readDouble(dims.y, viewBox);
  317. }
  318. if (dimensions)
  319. *dimensions = dims;
  320. output.contours.clear();
  321. output.inverseYAxis = true;
  322. return buildShapeFromSvgPath(output, pd, ENDPOINT_SNAP_RANGE_PROPORTION*dims.length());
  323. }
  324. #endif
  325. #ifdef MSDFGEN_USE_DROPXML
  326. struct StrRange {
  327. const char *start, *end;
  328. inline StrRange() : start(), end() { }
  329. inline StrRange(const char *start, const char *end) : start(start), end(end) { }
  330. inline std::string str() const { return std::string(start, end); }
  331. };
  332. static bool matchName(const char *start, const char *end, const char *value) {
  333. for (const char *c = start; c < end; ++c, ++value) {
  334. if (*c != *value)
  335. return false;
  336. }
  337. return !*value;
  338. }
  339. static std::string xmlDecode(const char *start, const char *end) {
  340. if (!dropXML::decode(start, end, nullptr, nullptr)) {
  341. std::string buffer(end-start+1, '\0');
  342. if (!dropXML::decode(start, end, &buffer[0], &buffer[buffer.size()-1]))
  343. return std::string();
  344. if (start == buffer.data()) {
  345. buffer.resize(end-start, '\0');
  346. return (std::string &&) buffer;
  347. }
  348. }
  349. return std::string(start, end);
  350. }
  351. static double xmlGetDouble(const char *start, const char *end) {
  352. double x = 0;
  353. std::string decodedStr(xmlDecode(start, end));
  354. const char *strPtr = decodedStr.c_str();
  355. readDouble(x, strPtr);
  356. return x;
  357. }
  358. #define SVG_NAME_IS(x) matchName(nameStart, nameEnd, x)
  359. #define SVG_DEC_VAL() xmlDecode(valueStart, valueEnd)
  360. #define SVG_DOUBLEVAL() xmlGetDouble(valueStart, valueEnd)
  361. static bool readFile(std::vector<char> &output, const char *filename) {
  362. if (FILE *f = fopen(filename, "rb")) {
  363. struct FileGuard {
  364. FILE *f;
  365. ~FileGuard() {
  366. fclose(f);
  367. }
  368. } fileGuard = { f };
  369. if (fseek(f, 0, SEEK_END))
  370. return false;
  371. long size = ftell(f);
  372. if (size < 0)
  373. return false;
  374. output.resize(size);
  375. if (!size)
  376. return true;
  377. if (fseek(f, 0, SEEK_SET))
  378. return false;
  379. return fread(&output[0], 1, size, f) == (size_t) size;
  380. }
  381. return false;
  382. }
  383. class BaseSvgConsumer {
  384. public:
  385. inline bool processingInstruction(const char *, const char *) { return true; }
  386. inline bool doctype(const char *, const char *) { return true; }
  387. inline bool text(const char *, const char *) { return true; }
  388. inline bool cdata(const char *, const char *) { return true; }
  389. };
  390. class SvgPathAggregator : public BaseSvgConsumer {
  391. enum {
  392. IGNORED,
  393. SVG,
  394. G,
  395. PATH
  396. } curElement;
  397. int ignoredDepth;
  398. public:
  399. int flags;
  400. Vector2 dimensions;
  401. StrRange viewBox;
  402. std::vector<StrRange> pathDefs;
  403. inline SvgPathAggregator() : curElement(IGNORED), ignoredDepth(0), flags(0) { }
  404. inline bool enterElement(const char *nameStart, const char *nameEnd) {
  405. curElement = IGNORED;
  406. if (ignoredDepth)
  407. ++ignoredDepth;
  408. else if (SVG_NAME_IS("svg"))
  409. curElement = SVG;
  410. else if (SVG_NAME_IS("g"))
  411. curElement = G;
  412. else if (SVG_NAME_IS("path"))
  413. curElement = PATH;
  414. else {
  415. if (SVG_NAME_IS("rect") || SVG_NAME_IS("circle") || SVG_NAME_IS("ellipse") || SVG_NAME_IS("polygon"))
  416. flags |= SVG_IMPORT_INCOMPLETE_FLAG;
  417. else if (SVG_NAME_IS("mask") || SVG_NAME_IS("use"))
  418. flags |= SVG_IMPORT_UNSUPPORTED_FEATURE_FLAG;
  419. ++ignoredDepth;
  420. }
  421. return true;
  422. }
  423. inline bool leaveElement(const char *, const char *) {
  424. if (ignoredDepth)
  425. --ignoredDepth;
  426. return true;
  427. }
  428. inline bool elementAttribute(const char *nameStart, const char *nameEnd, const char *valueStart, const char *valueEnd) {
  429. switch (curElement) {
  430. case IGNORED:
  431. break;
  432. case SVG:
  433. if (SVG_NAME_IS("width"))
  434. dimensions.x = xmlGetDouble(valueStart, valueEnd);
  435. else if (SVG_NAME_IS("height"))
  436. dimensions.y = xmlGetDouble(valueStart, valueEnd);
  437. else if (SVG_NAME_IS("viewBox"))
  438. viewBox = StrRange(valueStart, valueEnd);
  439. break;
  440. case PATH:
  441. if (SVG_NAME_IS("d"))
  442. pathDefs.push_back(StrRange(valueStart, valueEnd));
  443. // fallthrough
  444. case G:
  445. if (SVG_NAME_IS("transform"))
  446. flags |= SVG_IMPORT_TRANSFORMATION_IGNORED_FLAG;
  447. break;
  448. }
  449. return true;
  450. }
  451. inline bool finishAttributes() { return true; }
  452. inline bool finish() { return !ignoredDepth; }
  453. };
  454. bool loadSvgShape(Shape &output, const char *filename, int pathIndex, Vector2 *dimensions) {
  455. std::vector<char> svgData;
  456. if (!(readFile(svgData, filename) && !svgData.empty()))
  457. return false;
  458. SvgPathAggregator pathAggregator;
  459. if (!dropXML::parse(pathAggregator, &svgData[0], &svgData[0]+svgData.size()))
  460. return false;
  461. if (pathIndex <= 0) {
  462. if (pathIndex == 0)
  463. pathIndex = -1;
  464. pathIndex = pathAggregator.pathDefs.size()+pathIndex;
  465. } else
  466. --pathIndex;
  467. if (!(pathIndex > 0 && pathIndex < (int) pathAggregator.pathDefs.size()))
  468. return false;
  469. Vector2 dims(pathAggregator.dimensions);
  470. if (pathAggregator.viewBox.start < pathAggregator.viewBox.end) {
  471. std::string viewBoxStr = xmlDecode(pathAggregator.viewBox.start, pathAggregator.viewBox.end);
  472. const char *viewBoxPtr = viewBoxStr.c_str();
  473. double left = 0, top = 0;
  474. readDouble(left, viewBoxPtr) && readDouble(top, viewBoxPtr) && readDouble(dims.x, viewBoxPtr) && readDouble(dims.y, viewBoxPtr);
  475. }
  476. if (dimensions)
  477. *dimensions = dims;
  478. output.contours.clear();
  479. output.inverseYAxis = true;
  480. return buildShapeFromSvgPath(output, xmlDecode(pathAggregator.pathDefs[pathIndex].start, pathAggregator.pathDefs[pathIndex].end).c_str(), ENDPOINT_SNAP_RANGE_PROPORTION*dims.length());
  481. }
  482. #endif
  483. #ifndef MSDFGEN_USE_SKIA
  484. #ifdef MSDFGEN_USE_TINYXML2
  485. int loadSvgShape(Shape &output, Shape::Bounds &viewBox, const char *filename) {
  486. tinyxml2::XMLDocument doc;
  487. if (doc.LoadFile(filename))
  488. return SVG_IMPORT_FAILURE;
  489. tinyxml2::XMLElement *root = doc.FirstChildElement("svg");
  490. if (!root)
  491. return SVG_IMPORT_FAILURE;
  492. tinyxml2::XMLElement *path = NULL;
  493. int flags = 0;
  494. int skippedPaths = 0;
  495. findPathByBackwardIndex(path, flags, skippedPaths, root, false);
  496. if (!(path && (flags&SVG_IMPORT_SUCCESS_FLAG)))
  497. return SVG_IMPORT_FAILURE;
  498. const char *pd = path->Attribute("d");
  499. if (!pd)
  500. return SVG_IMPORT_FAILURE;
  501. viewBox.l = 0, viewBox.b = 0;
  502. Vector2 dims(root->DoubleAttribute("width"), root->DoubleAttribute("height"));
  503. if (const char *viewBoxStr = root->Attribute("viewBox"))
  504. readDouble(viewBox.l, viewBoxStr) && readDouble(viewBox.b, viewBoxStr) && readDouble(dims.x, viewBoxStr) && readDouble(dims.y, viewBoxStr);
  505. viewBox.r = viewBox.l+dims.x;
  506. viewBox.t = viewBox.b+dims.y;
  507. output.contours.clear();
  508. output.inverseYAxis = true;
  509. if (!buildShapeFromSvgPath(output, pd, ENDPOINT_SNAP_RANGE_PROPORTION*dims.length()))
  510. return SVG_IMPORT_FAILURE;
  511. return flags;
  512. }
  513. #endif
  514. #ifdef MSDFGEN_USE_DROPXML
  515. int loadSvgShape(Shape &output, Shape::Bounds &viewBox, const char *filename) {
  516. std::vector<char> svgData;
  517. if (!(readFile(svgData, filename) && !svgData.empty()))
  518. return SVG_IMPORT_FAILURE;
  519. SvgPathAggregator pathAggregator;
  520. if (!dropXML::parse(pathAggregator, &svgData[0], &svgData[0]+svgData.size()) || pathAggregator.pathDefs.empty())
  521. return SVG_IMPORT_FAILURE;
  522. viewBox.l = 0, viewBox.b = 0;
  523. Vector2 dims(pathAggregator.dimensions);
  524. if (pathAggregator.viewBox.start < pathAggregator.viewBox.end) {
  525. std::string viewBoxStr = xmlDecode(pathAggregator.viewBox.start, pathAggregator.viewBox.end);
  526. const char *viewBoxPtr = viewBoxStr.c_str();
  527. readDouble(viewBox.l, viewBoxPtr) && readDouble(viewBox.b, viewBoxPtr) && readDouble(dims.x, viewBoxPtr) && readDouble(dims.y, viewBoxPtr);
  528. }
  529. viewBox.r = viewBox.l+dims.x;
  530. viewBox.t = viewBox.b+dims.y;
  531. output.contours.clear();
  532. output.inverseYAxis = true;
  533. if (!buildShapeFromSvgPath(output, xmlDecode(pathAggregator.pathDefs.back().start, pathAggregator.pathDefs.back().end).c_str(), ENDPOINT_SNAP_RANGE_PROPORTION*dims.length()))
  534. return SVG_IMPORT_FAILURE;
  535. return SVG_IMPORT_SUCCESS_FLAG|pathAggregator.flags;
  536. }
  537. #endif
  538. #else
  539. void shapeFromSkiaPath(Shape &shape, const SkPath &skPath); // defined in resolve-shape-geometry.cpp
  540. static bool readTransformationOp(SkScalar dst[6], int &count, const char *&str, const char *name) {
  541. int nameLen = int(strlen(name));
  542. if (!memcmp(str, name, nameLen)) {
  543. const char *curStr = str+nameLen;
  544. skipExtraChars(curStr);
  545. if (*curStr == '(') {
  546. skipExtraChars(++curStr);
  547. count = 0;
  548. while (*curStr && *curStr != ')') {
  549. double x;
  550. if (!(count < 6 && readDouble(x, curStr)))
  551. return false;
  552. dst[count++] = SkScalar(x);
  553. skipExtraChars(curStr);
  554. }
  555. if (*curStr == ')') {
  556. str = curStr+1;
  557. return true;
  558. }
  559. }
  560. }
  561. return false;
  562. }
  563. static SkMatrix parseTransformation(int &flags, const char *str) {
  564. SkMatrix transformation;
  565. skipExtraChars(str);
  566. while (*str) {
  567. SkScalar values[6];
  568. int count;
  569. SkMatrix partial;
  570. if (readTransformationOp(values, count, str, "matrix") && count == 6) {
  571. partial.setAll(values[0], values[2], values[4], values[1], values[3], values[5], SkScalar(0), SkScalar(0), SkScalar(1));
  572. } else if (readTransformationOp(values, count, str, "translate") && (count == 1 || count == 2)) {
  573. if (count == 1)
  574. values[1] = SkScalar(0);
  575. partial.setTranslate(values[0], values[1]);
  576. } else if (readTransformationOp(values, count, str, "scale") && (count == 1 || count == 2)) {
  577. if (count == 1)
  578. values[1] = values[0];
  579. partial.setScale(values[0], values[1]);
  580. } else if (readTransformationOp(values, count, str, "rotate") && (count == 1 || count == 3)) {
  581. if (count == 3)
  582. partial.setRotate(values[0], values[1], values[2]);
  583. else
  584. partial.setRotate(values[0]);
  585. } else if (readTransformationOp(values, count, str, "skewX") && count == 1) {
  586. partial.setSkewX(SkScalar(tan(M_PI/180*values[0])));
  587. } else if (readTransformationOp(values, count, str, "skewY") && count == 1) {
  588. partial.setSkewY(SkScalar(tan(M_PI/180*values[0])));
  589. } else {
  590. flags |= SVG_IMPORT_PARTIAL_FAILURE_FLAG;
  591. break;
  592. }
  593. transformation = transformation*partial;
  594. skipExtraChars(str);
  595. }
  596. return transformation;
  597. }
  598. static SkMatrix combineTransformation(int &flags, const SkMatrix &parentTransformation, const char *transformationString, const char *transformationOriginString) {
  599. if (transformationString && *transformationString) {
  600. SkMatrix transformation = parseTransformation(flags, transformationString);
  601. if (transformationOriginString && *transformationOriginString) {
  602. Point2 origin;
  603. if (readCoord(origin, transformationOriginString))
  604. transformation = SkMatrix::Translate(SkScalar(origin.x), SkScalar(origin.y))*transformation*SkMatrix::Translate(SkScalar(-origin.x), SkScalar(-origin.y));
  605. else
  606. flags |= SVG_IMPORT_PARTIAL_FAILURE_FLAG;
  607. }
  608. return parentTransformation*transformation;
  609. }
  610. return parentTransformation;
  611. }
  612. #ifdef MSDFGEN_USE_TINYXML2
  613. static void gatherPaths(SkPath &fullPath, int &flags, tinyxml2::XMLElement *parent, const SkMatrix &transformation) {
  614. for (tinyxml2::XMLElement *cur = parent->FirstChildElement(); cur && !FLAGS_FINAL(flags); cur = cur->NextSiblingElement()) {
  615. if (!strcmp(cur->Name(), "g"))
  616. gatherPaths(fullPath, flags, cur, combineTransformation(flags, transformation, cur->Attribute("transform"), cur->Attribute("transform-origin")));
  617. else if (!strcmp(cur->Name(), "mask") || !strcmp(cur->Name(), "use"))
  618. flags |= SVG_IMPORT_UNSUPPORTED_FEATURE_FLAG;
  619. else {
  620. SkPath curPath;
  621. if (!strcmp(cur->Name(), "path")) {
  622. const char *pd = cur->Attribute("d");
  623. if (!(pd && SkParsePath::FromSVGString(pd, &curPath))) {
  624. flags |= SVG_IMPORT_PARTIAL_FAILURE_FLAG;
  625. continue;
  626. }
  627. } else if (!strcmp(cur->Name(), "rect")) {
  628. SkScalar x = SkScalar(cur->DoubleAttribute("x")), y = SkScalar(cur->DoubleAttribute("y"));
  629. SkScalar width = SkScalar(cur->DoubleAttribute("width")), height = SkScalar(cur->DoubleAttribute("height"));
  630. SkScalar rx = SkScalar(cur->DoubleAttribute("rx")), ry = SkScalar(cur->DoubleAttribute("ry"));
  631. if (!(width && height))
  632. continue;
  633. SkRect rect = SkRect::MakeLTRB(x, y, x+width, y+height);
  634. if (rx || ry) {
  635. SkScalar radii[] = { rx, ry, rx, ry, rx, ry, rx, ry };
  636. curPath.addRoundRect(rect, radii);
  637. } else
  638. curPath.addRect(rect);
  639. } else if (!strcmp(cur->Name(), "circle")) {
  640. SkScalar cx = SkScalar(cur->DoubleAttribute("cx")), cy = SkScalar(cur->DoubleAttribute("cy"));
  641. SkScalar r = SkScalar(cur->DoubleAttribute("r"));
  642. if (!r)
  643. continue;
  644. curPath.addCircle(cx, cy, r);
  645. } else if (!strcmp(cur->Name(), "ellipse")) {
  646. SkScalar cx = SkScalar(cur->DoubleAttribute("cx")), cy = SkScalar(cur->DoubleAttribute("cy"));
  647. SkScalar rx = SkScalar(cur->DoubleAttribute("rx")), ry = SkScalar(cur->DoubleAttribute("ry"));
  648. if (!(rx && ry))
  649. continue;
  650. curPath.addOval(SkRect::MakeLTRB(cx-rx, cy-ry, cx+rx, cy+ry));
  651. } else if (!strcmp(cur->Name(), "polygon")) {
  652. const char *pd = cur->Attribute("points");
  653. if (!pd) {
  654. flags |= SVG_IMPORT_PARTIAL_FAILURE_FLAG;
  655. continue;
  656. }
  657. Point2 point;
  658. if (!readCoord(point, pd))
  659. continue;
  660. curPath.moveTo(SkScalar(point.x), SkScalar(point.y));
  661. if (!readCoord(point, pd))
  662. continue;
  663. do {
  664. curPath.lineTo(SkScalar(point.x), SkScalar(point.y));
  665. } while (readCoord(point, pd));
  666. curPath.close();
  667. } else
  668. continue;
  669. const char *fillRule = cur->Attribute("fill-rule");
  670. if (fillRule && !strcmp(fillRule, "evenodd"))
  671. curPath.setFillType(SkPathFillType::kEvenOdd);
  672. curPath.transform(combineTransformation(flags, transformation, cur->Attribute("transform"), cur->Attribute("transform-origin")));
  673. if (Op(fullPath, curPath, kUnion_SkPathOp, &fullPath))
  674. flags |= SVG_IMPORT_SUCCESS_FLAG;
  675. else
  676. flags |= SVG_IMPORT_PARTIAL_FAILURE_FLAG;
  677. }
  678. }
  679. }
  680. int loadSvgShape(Shape &output, Shape::Bounds &viewBox, const char *filename) {
  681. tinyxml2::XMLDocument doc;
  682. if (doc.LoadFile(filename))
  683. return SVG_IMPORT_FAILURE;
  684. tinyxml2::XMLElement *root = doc.FirstChildElement("svg");
  685. if (!root)
  686. return SVG_IMPORT_FAILURE;
  687. SkPath fullPath;
  688. int flags = 0;
  689. gatherPaths(fullPath, flags, root, SkMatrix());
  690. if (!((flags&SVG_IMPORT_SUCCESS_FLAG) && Simplify(fullPath, &fullPath)))
  691. return SVG_IMPORT_FAILURE;
  692. shapeFromSkiaPath(output, fullPath);
  693. output.inverseYAxis = true;
  694. output.orientContours();
  695. viewBox.l = 0, viewBox.b = 0;
  696. Vector2 dims(root->DoubleAttribute("width"), root->DoubleAttribute("height"));
  697. if (const char *viewBoxStr = root->Attribute("viewBox"))
  698. readDouble(viewBox.l, viewBoxStr) && readDouble(viewBox.b, viewBoxStr) && readDouble(dims.x, viewBoxStr) && readDouble(dims.y, viewBoxStr);
  699. viewBox.r = viewBox.l+dims.x;
  700. viewBox.t = viewBox.b+dims.y;
  701. return flags;
  702. }
  703. #endif
  704. #ifdef MSDFGEN_USE_DROPXML
  705. int parseSvgShape(Shape &output, Shape::Bounds &viewBox, const char *svgData, size_t svgLength) {
  706. class SvgConsumer : public BaseSvgConsumer {
  707. enum Element {
  708. BEGINNING,
  709. IGNORED,
  710. SVG,
  711. G,
  712. PATH,
  713. RECT,
  714. CIRCLE,
  715. ELLIPSE,
  716. POLYGON
  717. } curElement;
  718. // Current element attributes
  719. struct ElementData {
  720. StrRange transform, transformOrigin;
  721. Vector2 pos, dims, radius;
  722. StrRange pathDef;
  723. bool fillRuleEvenOdd;
  724. ElementData() : fillRuleEvenOdd(false) { }
  725. } elem;
  726. int ignoredDepth;
  727. SkMatrix transformation;
  728. std::stack<SkMatrix> transformationStack;
  729. public:
  730. int flags;
  731. Vector2 dimensions;
  732. Shape::Bounds viewBox;
  733. SkPath fullPath;
  734. SvgConsumer() : curElement(BEGINNING), ignoredDepth(0), flags(0), viewBox() { }
  735. bool enterElement(const char *nameStart, const char *nameEnd) {
  736. if (ignoredDepth) {
  737. ++ignoredDepth;
  738. return true;
  739. }
  740. if (curElement == BEGINNING && SVG_NAME_IS("svg"))
  741. curElement = SVG;
  742. else if (SVG_NAME_IS("g"))
  743. curElement = G;
  744. else if (SVG_NAME_IS("path"))
  745. curElement = PATH;
  746. else if (SVG_NAME_IS("rect"))
  747. curElement = RECT;
  748. else if (SVG_NAME_IS("circle"))
  749. curElement = CIRCLE;
  750. else if (SVG_NAME_IS("ellipse"))
  751. curElement = ELLIPSE;
  752. else if (SVG_NAME_IS("polygon"))
  753. curElement = POLYGON;
  754. else {
  755. curElement = IGNORED;
  756. ++ignoredDepth;
  757. if (SVG_NAME_IS("mask") || SVG_NAME_IS("use"))
  758. flags |= SVG_IMPORT_UNSUPPORTED_FEATURE_FLAG;
  759. }
  760. if (curElement != IGNORED)
  761. elem = ElementData();
  762. return true;
  763. }
  764. bool leaveElement(const char *nameStart, const char *nameEnd) {
  765. if (ignoredDepth) {
  766. --ignoredDepth;
  767. return true;
  768. }
  769. if (SVG_NAME_IS("g")) {
  770. if (transformationStack.empty())
  771. return false;
  772. transformation = transformationStack.top();
  773. transformationStack.pop();
  774. }
  775. return true;
  776. }
  777. bool elementAttribute(const char *nameStart, const char *nameEnd, const char *valueStart, const char *valueEnd) {
  778. switch (curElement) {
  779. case BEGINNING:
  780. case IGNORED:
  781. break;
  782. case SVG:
  783. if (SVG_NAME_IS("width"))
  784. dimensions.x = SVG_DOUBLEVAL();
  785. else if (SVG_NAME_IS("height"))
  786. dimensions.y = SVG_DOUBLEVAL();
  787. else if (SVG_NAME_IS("viewBox")) {
  788. std::string viewBoxStr(SVG_DEC_VAL());
  789. const char *strPtr = viewBoxStr.c_str();
  790. double w = 0, h = 0;
  791. readDouble(viewBox.l, strPtr) && readDouble(viewBox.b, strPtr) && readDouble(w, strPtr) && readDouble(h, strPtr);
  792. viewBox.r = viewBox.l+w;
  793. viewBox.t = viewBox.b+h;
  794. }
  795. break;
  796. case G:
  797. break;
  798. case PATH:
  799. if (SVG_NAME_IS("d"))
  800. elem.pathDef = StrRange(valueStart, valueEnd);
  801. break;
  802. case RECT:
  803. if (SVG_NAME_IS("x"))
  804. elem.pos.x = SVG_DOUBLEVAL();
  805. else if (SVG_NAME_IS("y"))
  806. elem.pos.y = SVG_DOUBLEVAL();
  807. else if (SVG_NAME_IS("width"))
  808. elem.dims.x = SVG_DOUBLEVAL();
  809. else if (SVG_NAME_IS("height"))
  810. elem.dims.y = SVG_DOUBLEVAL();
  811. else if (SVG_NAME_IS("rx"))
  812. elem.radius.x = SVG_DOUBLEVAL();
  813. else if (SVG_NAME_IS("ry"))
  814. elem.radius.y = SVG_DOUBLEVAL();
  815. break;
  816. case CIRCLE:
  817. if (SVG_NAME_IS("cx"))
  818. elem.pos.x = SVG_DOUBLEVAL();
  819. else if (SVG_NAME_IS("cy"))
  820. elem.pos.y = SVG_DOUBLEVAL();
  821. else if (SVG_NAME_IS("r"))
  822. elem.radius.x = SVG_DOUBLEVAL();
  823. break;
  824. case ELLIPSE:
  825. if (SVG_NAME_IS("cx"))
  826. elem.pos.x = SVG_DOUBLEVAL();
  827. else if (SVG_NAME_IS("cy"))
  828. elem.pos.y = SVG_DOUBLEVAL();
  829. else if (SVG_NAME_IS("rx"))
  830. elem.radius.x = SVG_DOUBLEVAL();
  831. else if (SVG_NAME_IS("ry"))
  832. elem.radius.y = SVG_DOUBLEVAL();
  833. break;
  834. case POLYGON:
  835. if (SVG_NAME_IS("points"))
  836. elem.pathDef = StrRange(valueStart, valueEnd);
  837. break;
  838. }
  839. switch (curElement) {
  840. case PATH:
  841. case RECT:
  842. case CIRCLE:
  843. case ELLIPSE:
  844. case POLYGON:
  845. if (SVG_NAME_IS("fill-rule"))
  846. elem.fillRuleEvenOdd = SVG_DEC_VAL() == "evenodd";
  847. // fallthrough
  848. case G:
  849. if (SVG_NAME_IS("transform"))
  850. elem.transform = StrRange(valueStart, valueEnd);
  851. else if (SVG_NAME_IS("transform-origin"))
  852. elem.transformOrigin = StrRange(valueStart, valueEnd);
  853. break;
  854. default:;
  855. }
  856. return true;
  857. }
  858. bool finishAttributes() {
  859. switch (curElement) {
  860. case BEGINNING:
  861. case IGNORED:
  862. case SVG:
  863. break;
  864. case G:
  865. transformationStack.push(transformation);
  866. transformation = combineTransformation(flags, transformation, elem.transform.str().c_str(), elem.transformOrigin.str().c_str());
  867. break;
  868. case PATH:
  869. case RECT:
  870. case CIRCLE:
  871. case ELLIPSE:
  872. case POLYGON:
  873. {
  874. SkPath curPath;
  875. switch (curElement) {
  876. case PATH:
  877. if (!SkParsePath::FromSVGString(elem.pathDef.str().c_str(), &curPath)) {
  878. flags |= SVG_IMPORT_PARTIAL_FAILURE_FLAG;
  879. return true;
  880. }
  881. break;
  882. case RECT:
  883. {
  884. if (!(elem.dims.x && elem.dims.y))
  885. return true;
  886. SkRect rect = SkRect::MakeLTRB(elem.pos.x, elem.pos.y, elem.pos.x+elem.dims.x, elem.pos.y+elem.dims.y);
  887. if (elem.radius.x || elem.radius.y) {
  888. SkScalar rx = SkScalar(elem.radius.x), ry = SkScalar(elem.radius.y);
  889. SkScalar radii[] = { rx, ry, rx, ry, rx, ry, rx, ry };
  890. curPath.addRoundRect(rect, radii);
  891. } else
  892. curPath.addRect(rect);
  893. }
  894. break;
  895. case CIRCLE:
  896. if (!elem.radius.x)
  897. return true;
  898. curPath.addCircle(elem.pos.x, elem.pos.y, elem.radius.x);
  899. break;
  900. case ELLIPSE:
  901. if (!(elem.radius.x && elem.radius.y))
  902. return true;
  903. curPath.addOval(SkRect::MakeLTRB(elem.pos.x-elem.radius.x, elem.pos.y-elem.radius.y, elem.pos.x+elem.radius.x, elem.pos.y+elem.radius.y));
  904. break;
  905. case POLYGON:
  906. {
  907. if (elem.pathDef.start == elem.pathDef.end) {
  908. flags |= SVG_IMPORT_PARTIAL_FAILURE_FLAG;
  909. return true;
  910. }
  911. std::string pdStr = elem.pathDef.str();
  912. const char *pd = pdStr.c_str();
  913. Point2 point;
  914. if (!readCoord(point, pd))
  915. return true;
  916. curPath.moveTo(SkScalar(point.x), SkScalar(point.y));
  917. if (!readCoord(point, pd))
  918. return true;
  919. do {
  920. curPath.lineTo(SkScalar(point.x), SkScalar(point.y));
  921. } while (readCoord(point, pd));
  922. curPath.close();
  923. }
  924. break;
  925. default:
  926. return true;
  927. }
  928. if (elem.fillRuleEvenOdd)
  929. curPath.setFillType(SkPathFillType::kEvenOdd);
  930. curPath.transform(combineTransformation(flags, transformation, elem.transform.str().c_str(), elem.transformOrigin.str().c_str()));
  931. if (Op(fullPath, curPath, kUnion_SkPathOp, &fullPath))
  932. flags |= SVG_IMPORT_SUCCESS_FLAG;
  933. else
  934. flags |= SVG_IMPORT_PARTIAL_FAILURE_FLAG;
  935. }
  936. break;
  937. }
  938. return true;
  939. }
  940. bool finish() {
  941. return !ignoredDepth && transformationStack.empty();
  942. }
  943. };
  944. SvgConsumer svg;
  945. if (!(
  946. dropXML::parse(svg, svgData, svgData+svgLength) &&
  947. (svg.flags&SVG_IMPORT_SUCCESS_FLAG) &&
  948. Simplify(svg.fullPath, &svg.fullPath)
  949. ))
  950. return SVG_IMPORT_FAILURE;
  951. shapeFromSkiaPath(output, svg.fullPath);
  952. output.inverseYAxis = true;
  953. output.orientContours();
  954. viewBox = svg.viewBox;
  955. if (svg.dimensions.x > 0 && viewBox.r == viewBox.l)
  956. viewBox.r += svg.dimensions.x;
  957. if (svg.dimensions.y > 0 && viewBox.t == viewBox.b)
  958. viewBox.t += svg.dimensions.y;
  959. return svg.flags;
  960. }
  961. int loadSvgShape(Shape &output, Shape::Bounds &viewBox, const char *filename) {
  962. std::vector<char> svgData;
  963. if (!readFile(svgData, filename))
  964. return SVG_IMPORT_FAILURE;
  965. return parseSvgShape(output, viewBox, svgData.empty() ? NULL : &svgData[0], svgData.size());
  966. }
  967. #endif
  968. #endif
  969. }
  970. #endif