/Tools/ColladaConverter/Collada15/FCollada/FUtils/FUXmlWriter.cpp

https://bitbucket.org/ardalanaz/dava.framework · C++ · 259 lines · 208 code · 29 blank · 22 comment · 42 complexity · ab97a19124d2bbb48f3c8e08c4f020a8 MD5 · raw file 

    

  1. /*

    2. 

  2. 	Copyright (C) 2005-2007 Feeling Software Inc.

    3. 

  3. 	Portions of the code are:

    4. 

  4. 	Copyright (C) 2005-2007 Sony Computer Entertainment America

    5. 

  5. 	

    6. 

  6. 	MIT License: http://www.opensource.org/licenses/mit-license.php

    7. 

  7. */

    8. 

  8. 

    9. 

  9. #include "StdAfx.h"

    10. 

  10. #include "FUXmlWriter.h"

    11. 

  11. #include "FUXmlParser.h"

    12. 

  12. #include "FUStringConversion.h"

    13. 

  13. 

    14. 

  14. #define xcT(text) (const xmlChar*) (text)

    15. 

  15. 

    16. 

  16. // To avoid a nasty 'if' for performance reasons, these are tables of the valid characters

    17. 

  17. static const bool filenameValidityTable[256] =

    18. 

  18. {

    19. 

  19. 	false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, // 0-15

    20. 

  20. 	false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, // 16-31

    21. 

  21. 	false, false, false, false, false, false, false, false, false, false, false, false, false, true , true , true , // 32-47 [45-47 is '-./']

    22. 

  22. 	true , true , true , true , true , true , true , true , true , true , true , false, false, false, false, false, // 48-63 [48-57 are numerals, 58 is ':']

    23. 

  23. 	false, true , true , true , true , true , true , true , true , true , true , true , true , true , true , true , // 64-79 [65-79 is 'A'-'O']

    24. 

  24. 	true , true , true , true , true , true , true , true , true , true , true , false, false, false, false, true , // 80-95 [80-90 is 'P'-'Z'], 95 is '_']

    25. 

  25. 	false, true , true , true , true , true , true , true , true , true , true , true , true , true , true , true , // 96-111 [97-111 is 'a'-'o']

    26. 

  26. 	true , true , true , true , true , true , true , true , true , true , true , false, false, false, false, false, // 112-127 [112-122 is 'p'-'z']

    27. 

  27. 	false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, // 128-143

    28. 

  28. 	false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, // 144-159

    29. 

  29. 	false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, // 160-175

    30. 

  30. 	false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, // 176-191

    31. 

  31. 	false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, // 192-207

    32. 

  32. 	false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, // 208-223

    33. 

  33. 	false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, // 224-239

    34. 

  34. 	false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false  // 240-255

    35. 

  35. };

    36. 

  36. 

    37. 

  37. static const bool xmlValidityTable[256] =

    38. 

  38. {

    39. 

  39. 	false, false, false, false, false, false, false, false, false, false, true , false, false, true , false, false, // 0-15 [10 is \n, 13 is \r]

    40. 

  40. 	false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, // 16-31

    41. 

  41. 	true , true , false, true , true , true , true , false, true , true , true , true , true , true , true , true , // 32-47 [32-33 is ' !', 35-38 is '#$%&', 40-47 is '()*+,-./']

    42. 

  42. 	true , true , true , true , true , true , true , true , true , true , true , true , false, true , false, true , // 48-63 [48-57 are numerals, 58-59 is ':;', 61 is '=', 63 is '?']

    43. 

  43. 	false, true , true , true , true , true , true , true , true , true , true , true , true , true , true , true , // 64-79 [65-79 is 'A'-'O']

    44. 

  44. 	true , true , true , true , true , true , true , true , true , true , true , true , false, true , false, true , // 80-95 [80-90 is 'P'-'Z', 91 is '[', 93 is ']', 95 is '_']

    45. 

  45. 	false, true , true , true , true , true , true , true , true , true , true , true , true , true , true , true , // 96-111 [97-111 is 'a'-'o']

    46. 

  46. 	true , true , true , true , true , true , true , true , true , true , true , true , true , true , false, false, // 112-127 [112-122 is 'p'-'z', 123-125 is '{|}']

    47. 

  47. 	false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, // 128-143

    48. 

  48. 	false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, // 144-159

    49. 

  49. 	false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, // 160-175

    50. 

  50. 	false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, // 176-191

    51. 

  51. 	false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, // 192-207

    52. 

  52. 	false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, // 208-223

    53. 

  53. 	false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, // 224-239

    54. 

  54. 	false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false  // 240-255

    55. 

  55. };

    56. 

  56. 

    57. 

  57. namespace FUXmlWriter

    58. 

  58. {

    59. 

  59. 

    60. 

  60. 	// Create a new XML tree node

    61. 

  61. 	xmlNode* CreateNode(const char* name)

    62. 

  62. 	{

    63. 

  63. 		return xmlNewNode(NULL, xcT(name));

    64. 

  64. 	}

    65. 

  65. 

    66. 

  66. 	void RenameNode(xmlNode* node, const char* newName)

    67. 

  67. 	{

    68. 

  68. 		xmlNodeSetName(node, xcT(newName));

    69. 

  69. 	}

    70. 

  70. 

    71. 

  71. 	// Create a new XML tree child node, parented to the given XML tree node

    72. 

  72. 	void AddChild(xmlNode* parent, xmlNode* child)

    73. 

  73. 	{

    74. 

  74. 		xmlAddChild(parent, child);

    75. 

  75. 	}

    76. 

  76. 

    77. 

  77. 	xmlNode* AddChild(xmlNode* parent, const char* name)

    78. 

  78. 	{

    79. 

  79. 		return (parent != NULL) ? xmlNewChild(parent, NULL, xcT(name), NULL) : NULL;

    80. 

  80. 	}

    81. 

  81. 

    82. 

  82. 	xmlNode* AddChild(xmlNode* parent, const char* name, const char* content)

    83. 

  83. 	{

    84. 

  84. 		xmlNode* node = AddChild(parent, name);

    85. 

  85. 		if (node != NULL && content != NULL && *content != 0) AddContent(node, content);

    86. 

  86. 		return node;

    87. 

  87. 	}

    88. 

  88. 

    89. 

  89. #ifdef UNICODE

    90. 

  90. 	xmlNode* AddChild(xmlNode* parent, const char* name, const fstring& content)

    91. 

  91. 	{

    92. 

  92. 		fm::string s = FUStringConversion::ToString(content);

    93. 

  93. 		return AddChild(parent, name, !s.empty() ? s.c_str() : NULL);

    94. 

  94. 	}

    95. 

  95. #endif

    96. 

  96. 

    97. 

  97. 	xmlNode* AddChildOnce(xmlNode* parent, const char* name, const char* content)

    98. 

  98. 	{

    99. 

  99. 		xmlNode* node = NULL;

    100. 

  100. 		if (parent != NULL)

    101. 

  101. 		{

    102. 

  102. 			node = FUXmlParser::FindChildByType(parent, name);

    103. 

  103. 			if (node == NULL) node = AddChild(parent, name, (content == NULL || *content == 0) ? NULL : content);

    104. 

  104. 		}

    105. 

  105. 		return node;

    106. 

  106. 	}

    107. 

  107. 

    108. 

  108. 	// Create/Append a new XML tree node, as a sibling to a given XML tree node

    109. 

  109. 	void AddSibling(xmlNode* sibling, xmlNode* dangling)

    110. 

  110. 	{

    111. 

  111. 		xmlAddSibling(sibling, dangling);

    112. 

  112. 	}

    113. 

  113. 

    114. 

  114. 	xmlNode* AddSibling(xmlNode* node, const char* name)

    115. 

  115. 	{

    116. 

  116. 		xmlNode* n = CreateNode(name);

    117. 

  117. 		AddSibling(node, n);

    118. 

  118. 		return n;

    119. 

  119. 	}

    120. 

  120. 

    121. 

  121. 	xmlNode* InsertChild(xmlNode* parent, xmlNode* sibling, const char* name)

    122. 

  122. 	{

    123. 

  123. 		xmlNode* n;

    124. 

  124. 		if (sibling == NULL || sibling->parent != parent)

    125. 

  125. 		{

    126. 

  126. 			n = AddChild(parent, name);

    127. 

  127. 		}

    128. 

  128. 		else

    129. 

  129. 		{

    130. 

  130. 			n = xmlAddPrevSibling(sibling, CreateNode(name));

    131. 

  131. 		}

    132. 

  132. 		return n;

    133. 

  133. 	}

    134. 

  134. 

    135. 

  135. 	void AddContent(xmlNode* node, const char* content)

    136. 

  136. 	{

    137. 

  137. 		if (node != NULL)

    138. 

  138. 		{

    139. 

  139. 			// Look for non-UTF8 characters that will need to be converted to %XXXX.

    140. 

  140. 			FUSStringBuilder xmlSBuilder;

    141. 

  141. 			const char* str = content;

    142. 

  142. 			char c;

    143. 

  143. 			for (; (c = *str) != 0; ++str)

    144. 

  144. 			{

    145. 

  145. 				// For performance reason, use a look-up table.

    146. 

  146. 				if (xmlValidityTable[(uint8) c])

    147. 

  147. 				{

    148. 

  148. 					// Valid characters

    149. 

  149. 					xmlSBuilder.append(c);

    150. 

  150. 				}

    151. 

  151. 				else

    152. 

  152. 				{

    153. 

  153. 					// Remove any invalid character(s) in the filename using the %X guideline

    154. 

  154. 					xmlSBuilder.append((char) '%');

    155. 

  155. 					xmlSBuilder.appendHex((uint8) c);

    156. 

  156. 				}

    157. 

  157. 			}

    158. 

  158. 

    159. 

  159. 			xmlNodeAddContent(node, xcT(xmlSBuilder.ToCharPtr()));

    160. 

  160. 		}

    161. 

  161. 	}

    162. 

  162. 

    163. 

  163. #ifdef UNICODE

    164. 

  164. 	void AddContent(xmlNode* node, const fstring& content)

    165. 

  165. 	{

    166. 

  166. 		fm::string s = FUStringConversion::ToString(content);

    167. 

  167. 		AddContent(node, s.c_str());

    168. 

  168. 	}

    169. 

  169. #endif

    170. 

  170. 

    171. 

  171. 	// Converts all the spaces into %20.

    172. 

  172. 	void ConvertFilename(fstring& str)

    173. 

  173. 	{

    174. 

  174. 		FUStringBuilder xmlBuilder;

    175. 

  175. 		const fchar* s = str.c_str();

    176. 

  176. 		fchar c;

    177. 

  177. 		for (; (c = *s) != 0; ++s)

    178. 

  178. 		{

    179. 

  179. 			if (filenameValidityTable[(uint8) c]) xmlBuilder.append(c);

    180. 

  180. 			else

    181. 

  181. 			{

    182. 

  182. 				xmlBuilder.append((fchar) '%');

    183. 

  183. 				xmlBuilder.appendHex((uint8) c);

    184. 

  184. 			}

    185. 

  185. 		}

    186. 

  186. 		str = xmlBuilder.ToString();

    187. 

  187. 	}

    188. 

  188. 	

    189. 

  189. 	void AddContentUnprocessed(xmlNode* node, const char* content)

    190. 

  190. 	{

    191. 

  191. 		if (node != NULL) xmlNodeAddContent(node, xcT(content));

    192. 

  192. 	}

    193. 

  193. 

    194. 

  194. 	void AddAttribute(xmlNode* node, const char* attributeName, const char* value)

    195. 

  195. 	{

    196. 

  196. 		if (node != NULL)

    197. 

  197. 		{

    198. 

  198. 			xmlNewProp(node, xcT(attributeName), xcT(value));

    199. 

  199. 		}

    200. 

  200. 	}

    201. 

  201. 

    202. 

  202. #ifdef UNICODE

    203. 

  203. 	void AddAttribute(xmlNode* node, const char* attributeName, const fstring& attributeValue)

    204. 

  204. 	{

    205. 

  205. 		fm::string s = FUStringConversion::ToString(attributeValue);

    206. 

  206. 		AddAttribute(node, attributeName, s.c_str());

    207. 

  207. 	}

    208. 

  208. #endif

    209. 

  209. 

    210. 

  210. 

    211. 

  211. 	void RemoveAttribute(xmlNode* node, const char* attributeName)

    212. 

  212. 	{

    213. 

  213. 		xmlAttrPtr ptr = xmlHasProp(node, xcT(attributeName));

    214. 

  214. 		xmlRemoveProp(ptr);

    215. 

  215. 	}

    216. 

  216. 

    217. 

  217. 

    218. 

  218. 	// Insert a child, respecting lexical ordering

    219. 

  219. 	void AddChildSorted(xmlNode* parent, xmlNode* child)

    220. 

  220. 	{

    221. 

  221. 		// Do an insertion sort in alphabetical order of the element names. 

    222. 

  222. 		// Walk backward from the last child, to make sure that

    223. 

  223. 		// the chronological ordering of elements of the same type is respected.

    224. 

  224. 		//

    225. 

  225. 		for (xmlNode* p = xmlGetLastChild(parent); p != NULL; p = p->prev)

    226. 

  226. 		{

    227. 

  227. 			if (p->type != XML_ELEMENT_NODE) continue;

    228. 

  228. 			if (strcmp((const char*) p->name, (const char*) child->name) <= 0)

    229. 

  229. 			{

    230. 

  230. 				xmlAddNextSibling(p, child);

    231. 

  231. 				return;

    232. 

  232. 			}

    233. 

  233. 		}

    234. 

  234. 

    235. 

  235. 		// Add to the top of the list.

    236. 

  236. 		if (parent->children && parent->children->type == XML_ELEMENT_NODE)

    237. 

  237. 		{

    238. 

  238. 			xmlAddPrevSibling(parent->children, child);

    239. 

  239. 		}

    240. 

  240. 		else

    241. 

  241. 		{

    242. 

  242. 			AddChild(parent, child);

    243. 

  243. 		}

    244. 

  244. 	}

    245. 

  245. 

    246. 

  246. 	xmlNode* AddChildSorted(xmlNode* parent, const char* name, const char* content)

    247. 

  247. 	{

    248. 

  248. 		xmlNode* node = CreateNode(name);

    249. 

  249. 		if (content != NULL && *content != 0) AddContent(node, content);

    250. 

  250. 		AddChildSorted(parent, node);

    251. 

  251. 		return node;

    252. 

  252. 	}

    253. 

  253. 

    254. 

  254. 	void ReParentNode(xmlNode* node, xmlNode* newParent)

    255. 

  255. 	{

    256. 

  256. 		xmlUnlinkNode(node);

    257. 

  257. 		AddChild(newParent, node);

    258. 

  258. 	}

    259. 

  259. };
    260.