import-svg.cpp 42 KB

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