XMLFile.cpp 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379
  1. //
  2. // Copyright (c) 2008-2016 the Urho3D project.
  3. //
  4. // Permission is hereby granted, free of charge, to any person obtaining a copy
  5. // of this software and associated documentation files (the "Software"), to deal
  6. // in the Software without restriction, including without limitation the rights
  7. // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  8. // copies of the Software, and to permit persons to whom the Software is
  9. // furnished to do so, subject to the following conditions:
  10. //
  11. // The above copyright notice and this permission notice shall be included in
  12. // all copies or substantial portions of the Software.
  13. //
  14. // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  15. // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  16. // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  17. // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  18. // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  19. // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  20. // THE SOFTWARE.
  21. //
  22. #include "../Precompiled.h"
  23. #include "../Container/ArrayPtr.h"
  24. #include "../Core/Context.h"
  25. #include "../Core/Profiler.h"
  26. #include "../IO/Deserializer.h"
  27. #include "../IO/Log.h"
  28. #include "../IO/MemoryBuffer.h"
  29. #include "../IO/VectorBuffer.h"
  30. #include "../Resource/ResourceCache.h"
  31. #include "../Resource/XMLFile.h"
  32. // ATOMIC BEGIN
  33. #include <PugiXml/src/pugixml.hpp>
  34. // ATOMIC END
  35. #include "../DebugNew.h"
  36. namespace Atomic
  37. {
  38. /// XML writer for pugixml.
  39. class XMLWriter : public pugi::xml_writer
  40. {
  41. public:
  42. /// Construct.
  43. XMLWriter(Serializer& dest) :
  44. dest_(dest),
  45. success_(true)
  46. {
  47. }
  48. /// Write bytes to output.
  49. void write(const void* data, size_t size)
  50. {
  51. if (dest_.Write(data, (unsigned)size) != size)
  52. success_ = false;
  53. }
  54. /// Destination serializer.
  55. Serializer& dest_;
  56. /// Success flag.
  57. bool success_;
  58. };
  59. XMLFile::XMLFile(Context* context) :
  60. Resource(context),
  61. document_(new pugi::xml_document())
  62. {
  63. }
  64. XMLFile::~XMLFile()
  65. {
  66. delete document_;
  67. document_ = 0;
  68. }
  69. void XMLFile::RegisterObject(Context* context)
  70. {
  71. context->RegisterFactory<XMLFile>();
  72. }
  73. bool XMLFile::BeginLoad(Deserializer& source)
  74. {
  75. unsigned dataSize = source.GetSize();
  76. if (!dataSize && !source.GetName().Empty())
  77. {
  78. ATOMIC_LOGERROR("Zero sized XML data in " + source.GetName());
  79. return false;
  80. }
  81. SharedArrayPtr<char> buffer(new char[dataSize]);
  82. if (source.Read(buffer.Get(), dataSize) != dataSize)
  83. return false;
  84. if (!document_->load_buffer(buffer.Get(), dataSize))
  85. {
  86. ATOMIC_LOGERROR("Could not parse XML data from " + source.GetName());
  87. document_->reset();
  88. return false;
  89. }
  90. XMLElement rootElem = GetRoot();
  91. String inherit = rootElem.GetAttribute("inherit");
  92. if (!inherit.Empty())
  93. {
  94. // The existence of this attribute indicates this is an RFC 5261 patch file
  95. ResourceCache* cache = GetSubsystem<ResourceCache>();
  96. // If being async loaded, GetResource() is not safe, so use GetTempResource() instead
  97. XMLFile* inheritedXMLFile = GetAsyncLoadState() == ASYNC_DONE ? cache->GetResource<XMLFile>(inherit) :
  98. cache->GetTempResource<XMLFile>(inherit);
  99. if (!inheritedXMLFile)
  100. {
  101. ATOMIC_LOGERRORF("Could not find inherited XML file: %s", inherit.CString());
  102. return false;
  103. }
  104. // Patch this XMLFile and leave the original inherited XMLFile as it is
  105. pugi::xml_document* patchDocument = document_;
  106. document_ = new pugi::xml_document();
  107. document_->reset(*inheritedXMLFile->document_);
  108. Patch(rootElem);
  109. delete patchDocument;
  110. // Store resource dependencies so we know when to reload/repatch when the inherited resource changes
  111. cache->StoreResourceDependency(this, inherit);
  112. // Approximate patched data size
  113. dataSize += inheritedXMLFile->GetMemoryUse();
  114. }
  115. // Note: this probably does not reflect internal data structure size accurately
  116. SetMemoryUse(dataSize);
  117. return true;
  118. }
  119. bool XMLFile::Save(Serializer& dest) const
  120. {
  121. return Save(dest, "\t");
  122. }
  123. bool XMLFile::Save(Serializer& dest, const String& indentation) const
  124. {
  125. XMLWriter writer(dest);
  126. document_->save(writer, indentation.CString());
  127. return writer.success_;
  128. }
  129. XMLElement XMLFile::CreateRoot(const String& name)
  130. {
  131. document_->reset();
  132. pugi::xml_node root = document_->append_child(name.CString());
  133. return XMLElement(this, root.internal_object());
  134. }
  135. bool XMLFile::FromString(const String& source)
  136. {
  137. if (source.Empty())
  138. return false;
  139. MemoryBuffer buffer(source.CString(), source.Length());
  140. return Load(buffer);
  141. }
  142. XMLElement XMLFile::GetRoot(const String& name)
  143. {
  144. pugi::xml_node root = document_->first_child();
  145. if (root.empty())
  146. return XMLElement();
  147. if (!name.Empty() && name != root.name())
  148. return XMLElement();
  149. else
  150. return XMLElement(this, root.internal_object());
  151. }
  152. String XMLFile::ToString(const String& indentation) const
  153. {
  154. VectorBuffer dest;
  155. XMLWriter writer(dest);
  156. document_->save(writer, indentation.CString());
  157. return String((const char*)dest.GetData(), dest.GetSize());
  158. }
  159. void XMLFile::Patch(XMLFile* patchFile)
  160. {
  161. Patch(patchFile->GetRoot());
  162. }
  163. void XMLFile::Patch(XMLElement patchElement)
  164. {
  165. pugi::xml_node root = pugi::xml_node(patchElement.GetNode());
  166. for (pugi::xml_node::iterator patch = root.begin(); patch != root.end(); patch++)
  167. {
  168. pugi::xml_attribute sel = patch->attribute("sel");
  169. if (sel.empty())
  170. {
  171. ATOMIC_LOGERROR("XML Patch failed due to node not having a sel attribute.");
  172. continue;
  173. }
  174. // Only select a single node at a time, they can use xpath to select specific ones in multiple otherwise the node set becomes invalid due to changes
  175. pugi::xpath_node original = document_->select_single_node(sel.value());
  176. if (!original)
  177. {
  178. ATOMIC_LOGERRORF("XML Patch failed with bad select: %s.", sel.value());
  179. continue;
  180. }
  181. if (strcmp(patch->name(), "add") == 0)
  182. PatchAdd(*patch, original);
  183. else if (strcmp(patch->name(), "replace") == 0)
  184. PatchReplace(*patch, original);
  185. else if (strcmp(patch->name(), "remove") == 0)
  186. PatchRemove(original);
  187. else
  188. ATOMIC_LOGERROR("XMLFiles used for patching should only use 'add', 'replace' or 'remove' elements.");
  189. }
  190. }
  191. void XMLFile::PatchAdd(const pugi::xml_node& patch, pugi::xpath_node& original) const
  192. {
  193. // If not a node, log an error
  194. if (original.attribute())
  195. {
  196. ATOMIC_LOGERRORF("XML Patch failed calling Add due to not selecting a node, %s attribute was selected.",
  197. original.attribute().name());
  198. return;
  199. }
  200. // If no type add node, if contains '@' treat as attribute
  201. pugi::xml_attribute type = patch.attribute("type");
  202. if (!type || strlen(type.value()) <= 0)
  203. AddNode(patch, original);
  204. else if (type.value()[0] == '@')
  205. AddAttribute(patch, original);
  206. }
  207. void XMLFile::PatchReplace(const pugi::xml_node& patch, pugi::xpath_node& original) const
  208. {
  209. // If no attribute but node then its a node, otherwise its an attribute or null
  210. if (!original.attribute() && original.node())
  211. {
  212. pugi::xml_node parent = original.node().parent();
  213. parent.insert_copy_before(patch.first_child(), original.node());
  214. parent.remove_child(original.node());
  215. }
  216. else if (original.attribute())
  217. {
  218. original.attribute().set_value(patch.child_value());
  219. }
  220. }
  221. void XMLFile::PatchRemove(const pugi::xpath_node& original) const
  222. {
  223. // If no attribute but node then its a node, otherwise its an attribute or null
  224. if (!original.attribute() && original.node())
  225. {
  226. pugi::xml_node parent = original.parent();
  227. parent.remove_child(original.node());
  228. }
  229. else if (original.attribute())
  230. {
  231. pugi::xml_node parent = original.parent();
  232. parent.remove_attribute(original.attribute());
  233. }
  234. }
  235. void XMLFile::AddNode(const pugi::xml_node& patch, const pugi::xpath_node& original) const
  236. {
  237. // If pos is null, append or prepend add as a child, otherwise add before or after, the default is to append as a child
  238. pugi::xml_attribute pos = patch.attribute("pos");
  239. if (!pos || strlen(pos.value()) <= 0 || strcmp(pos.value(), "append") == 0)
  240. {
  241. pugi::xml_node::iterator start = patch.begin();
  242. pugi::xml_node::iterator end = patch.end();
  243. // There can not be two consecutive text nodes, so check to see if they need to be combined
  244. // If they have been we can skip the first node of the nodes to add
  245. if (CombineText(patch.first_child(), original.node().last_child(), false))
  246. start++;
  247. for (; start != end; start++)
  248. original.node().append_copy(*start);
  249. }
  250. else if (strcmp(pos.value(), "prepend") == 0)
  251. {
  252. pugi::xml_node::iterator start = patch.begin();
  253. pugi::xml_node::iterator end = patch.end();
  254. // There can not be two consecutive text nodes, so check to see if they need to be combined
  255. // If they have been we can skip the last node of the nodes to add
  256. if (CombineText(patch.last_child(), original.node().first_child(), true))
  257. end--;
  258. pugi::xml_node pos = original.node().first_child();
  259. for (; start != end; start++)
  260. original.node().insert_copy_before(*start, pos);
  261. }
  262. else if (strcmp(pos.value(), "before") == 0)
  263. {
  264. pugi::xml_node::iterator start = patch.begin();
  265. pugi::xml_node::iterator end = patch.end();
  266. // There can not be two consecutive text nodes, so check to see if they need to be combined
  267. // If they have been we can skip the first node of the nodes to add
  268. if (CombineText(patch.first_child(), original.node().previous_sibling(), false))
  269. start++;
  270. // There can not be two consecutive text nodes, so check to see if they need to be combined
  271. // If they have been we can skip the last node of the nodes to add
  272. if (CombineText(patch.last_child(), original.node(), true))
  273. end--;
  274. for (; start != end; start++)
  275. original.parent().insert_copy_before(*start, original.node());
  276. }
  277. else if (strcmp(pos.value(), "after") == 0)
  278. {
  279. pugi::xml_node::iterator start = patch.begin();
  280. pugi::xml_node::iterator end = patch.end();
  281. // There can not be two consecutive text nodes, so check to see if they need to be combined
  282. // If they have been we can skip the first node of the nodes to add
  283. if (CombineText(patch.first_child(), original.node(), false))
  284. start++;
  285. // There can not be two consecutive text nodes, so check to see if they need to be combined
  286. // If they have been we can skip the last node of the nodes to add
  287. if (CombineText(patch.last_child(), original.node().next_sibling(), true))
  288. end--;
  289. pugi::xml_node pos = original.node();
  290. for (; start != end; start++)
  291. pos = original.parent().insert_copy_after(*start, pos);
  292. }
  293. }
  294. void XMLFile::AddAttribute(const pugi::xml_node& patch, const pugi::xpath_node& original) const
  295. {
  296. pugi::xml_attribute attribute = patch.attribute("type");
  297. if (!patch.first_child() && patch.first_child().type() != pugi::node_pcdata)
  298. {
  299. ATOMIC_LOGERRORF("XML Patch failed calling Add due to attempting to add non text to an attribute for %s.", attribute.value());
  300. return;
  301. }
  302. String name(attribute.value());
  303. name = name.Substring(1);
  304. pugi::xml_attribute newAttribute = original.node().append_attribute(name.CString());
  305. newAttribute.set_value(patch.child_value());
  306. }
  307. bool XMLFile::CombineText(const pugi::xml_node& patch, const pugi::xml_node& original, bool prepend) const
  308. {
  309. if (!patch || !original)
  310. return false;
  311. if ((patch.type() == pugi::node_pcdata && original.type() == pugi::node_pcdata) ||
  312. (patch.type() == pugi::node_cdata && original.type() == pugi::node_cdata))
  313. {
  314. if (prepend)
  315. const_cast<pugi::xml_node&>(original).set_value(Atomic::ToString("%s%s", patch.value(), original.value()).CString());
  316. else
  317. const_cast<pugi::xml_node&>(original).set_value(Atomic::ToString("%s%s", original.value(), patch.value()).CString());
  318. return true;
  319. }
  320. return false;
  321. }
  322. }