XMLFile.cpp 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377
  1. //
  2. // Copyright (c) 2008-2015 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. #include <PugiXml/pugixml.hpp>
  33. #include "../DebugNew.h"
  34. namespace Urho3D
  35. {
  36. /// XML writer for pugixml.
  37. class XMLWriter : public pugi::xml_writer
  38. {
  39. public:
  40. /// Construct.
  41. XMLWriter(Serializer& dest) :
  42. dest_(dest),
  43. success_(true)
  44. {
  45. }
  46. /// Write bytes to output.
  47. void write(const void* data, size_t size)
  48. {
  49. if (dest_.Write(data, (unsigned)size) != size)
  50. success_ = false;
  51. }
  52. /// Destination serializer.
  53. Serializer& dest_;
  54. /// Success flag.
  55. bool success_;
  56. };
  57. XMLFile::XMLFile(Context* context) :
  58. Resource(context),
  59. document_(new pugi::xml_document())
  60. {
  61. }
  62. XMLFile::~XMLFile()
  63. {
  64. delete document_;
  65. document_ = 0;
  66. }
  67. void XMLFile::RegisterObject(Context* context)
  68. {
  69. context->RegisterFactory<XMLFile>();
  70. }
  71. bool XMLFile::BeginLoad(Deserializer& source)
  72. {
  73. unsigned dataSize = source.GetSize();
  74. if (!dataSize && !source.GetName().Empty())
  75. {
  76. URHO3D_LOGERROR("Zero sized XML data in " + source.GetName());
  77. return false;
  78. }
  79. SharedArrayPtr<char> buffer(new char[dataSize]);
  80. if (source.Read(buffer.Get(), dataSize) != dataSize)
  81. return false;
  82. if (!document_->load_buffer(buffer.Get(), dataSize))
  83. {
  84. URHO3D_LOGERROR("Could not parse XML data from " + source.GetName());
  85. document_->reset();
  86. return false;
  87. }
  88. XMLElement rootElem = GetRoot();
  89. String inherit = rootElem.GetAttribute("inherit");
  90. if (!inherit.Empty())
  91. {
  92. // The existence of this attribute indicates this is an RFC 5261 patch file
  93. ResourceCache* cache = GetSubsystem<ResourceCache>();
  94. // If being async loaded, GetResource() is not safe, so use GetTempResource() instead
  95. XMLFile* inheritedXMLFile = GetAsyncLoadState() == ASYNC_DONE ? cache->GetResource<XMLFile>(inherit) :
  96. cache->GetTempResource<XMLFile>(inherit);
  97. if (!inheritedXMLFile)
  98. {
  99. LOGERRORF("Could not find inherited XML file: %s", inherit.CString());
  100. return false;
  101. }
  102. // Patch this XMLFile and leave the original inherited XMLFile as it is
  103. pugi::xml_document* patchDocument = document_;
  104. document_ = new pugi::xml_document();
  105. document_->reset(*inheritedXMLFile->document_);
  106. Patch(rootElem);
  107. delete patchDocument;
  108. // Store resource dependencies so we know when to reload/repatch when the inherited resource changes
  109. cache->StoreResourceDependency(this, inherit);
  110. // Approximate patched data size
  111. dataSize += inheritedXMLFile->GetMemoryUse();
  112. }
  113. // Note: this probably does not reflect internal data structure size accurately
  114. SetMemoryUse(dataSize);
  115. return true;
  116. }
  117. bool XMLFile::Save(Serializer& dest) const
  118. {
  119. return Save(dest, "\t");
  120. }
  121. bool XMLFile::Save(Serializer& dest, const String& indentation) const
  122. {
  123. XMLWriter writer(dest);
  124. document_->save(writer, indentation.CString());
  125. return writer.success_;
  126. }
  127. XMLElement XMLFile::CreateRoot(const String& name)
  128. {
  129. document_->reset();
  130. pugi::xml_node root = document_->append_child(name.CString());
  131. return XMLElement(this, root.internal_object());
  132. }
  133. bool XMLFile::FromString(const String& source)
  134. {
  135. if (source.Empty())
  136. return false;
  137. MemoryBuffer buffer(source.CString(), source.Length());
  138. return Load(buffer);
  139. }
  140. XMLElement XMLFile::GetRoot(const String& name)
  141. {
  142. pugi::xml_node root = document_->first_child();
  143. if (root.empty())
  144. return XMLElement();
  145. if (!name.Empty() && name != root.name())
  146. return XMLElement();
  147. else
  148. return XMLElement(this, root.internal_object());
  149. }
  150. String XMLFile::ToString(const String& indentation) const
  151. {
  152. VectorBuffer dest;
  153. XMLWriter writer(dest);
  154. document_->save(writer, indentation.CString());
  155. return String((const char*)dest.GetData(), dest.GetSize());
  156. }
  157. void XMLFile::Patch(XMLFile* patchFile)
  158. {
  159. Patch(patchFile->GetRoot());
  160. }
  161. void XMLFile::Patch(XMLElement patchElement)
  162. {
  163. pugi::xml_node root = pugi::xml_node(patchElement.GetNode());
  164. for (pugi::xml_node::iterator patch = root.begin(); patch != root.end(); patch++)
  165. {
  166. pugi::xml_attribute sel = patch->attribute("sel");
  167. if (sel.empty())
  168. {
  169. URHO3D_LOGERROR("XML Patch failed due to node not having a sel attribute.");
  170. continue;
  171. }
  172. // 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
  173. pugi::xpath_node original = document_->select_single_node(sel.value());
  174. if (!original)
  175. {
  176. LOGERRORF("XML Patch failed with bad select: %s.", sel.value());
  177. continue;
  178. }
  179. if (strcmp(patch->name(), "add") == 0)
  180. PatchAdd(*patch, original);
  181. else if (strcmp(patch->name(), "replace") == 0)
  182. PatchReplace(*patch, original);
  183. else if (strcmp(patch->name(), "remove") == 0)
  184. PatchRemove(original);
  185. else
  186. URHO3D_LOGERROR("XMLFiles used for patching should only use 'add', 'replace' or 'remove' elements.");
  187. }
  188. }
  189. void XMLFile::PatchAdd(const pugi::xml_node& patch, pugi::xpath_node& original) const
  190. {
  191. // If not a node, log an error
  192. if (original.attribute())
  193. {
  194. LOGERRORF("XML Patch failed calling Add due to not selecting a node, %s attribute was selected.",
  195. original.attribute().name());
  196. return;
  197. }
  198. // If no type add node, if contains '@' treat as attribute
  199. pugi::xml_attribute type = patch.attribute("type");
  200. if (!type || strlen(type.value()) <= 0)
  201. AddNode(patch, original);
  202. else if (type.value()[0] == '@')
  203. AddAttribute(patch, original);
  204. }
  205. void XMLFile::PatchReplace(const pugi::xml_node& patch, pugi::xpath_node& original) const
  206. {
  207. // If no attribute but node then its a node, otherwise its an attribute or null
  208. if (!original.attribute() && original.node())
  209. {
  210. pugi::xml_node parent = original.node().parent();
  211. parent.insert_copy_before(patch.first_child(), original.node());
  212. parent.remove_child(original.node());
  213. }
  214. else if (original.attribute())
  215. {
  216. original.attribute().set_value(patch.child_value());
  217. }
  218. }
  219. void XMLFile::PatchRemove(const pugi::xpath_node& original) const
  220. {
  221. // If no attribute but node then its a node, otherwise its an attribute or null
  222. if (!original.attribute() && original.node())
  223. {
  224. pugi::xml_node parent = original.parent();
  225. parent.remove_child(original.node());
  226. }
  227. else if (original.attribute())
  228. {
  229. pugi::xml_node parent = original.parent();
  230. parent.remove_attribute(original.attribute());
  231. }
  232. }
  233. void XMLFile::AddNode(const pugi::xml_node& patch, const pugi::xpath_node& original) const
  234. {
  235. // If pos is null, append or prepend add as a child, otherwise add before or after, the default is to append as a child
  236. pugi::xml_attribute pos = patch.attribute("pos");
  237. if (!pos || strlen(pos.value()) <= 0 || strcmp(pos.value(), "append") == 0)
  238. {
  239. pugi::xml_node::iterator start = patch.begin();
  240. pugi::xml_node::iterator end = patch.end();
  241. // There can not be two consecutive text nodes, so check to see if they need to be combined
  242. // If they have been we can skip the first node of the nodes to add
  243. if (CombineText(patch.first_child(), original.node().last_child(), false))
  244. start++;
  245. for (; start != end; start++)
  246. original.node().append_copy(*start);
  247. }
  248. else if (strcmp(pos.value(), "prepend") == 0)
  249. {
  250. pugi::xml_node::iterator start = patch.begin();
  251. pugi::xml_node::iterator end = patch.end();
  252. // There can not be two consecutive text nodes, so check to see if they need to be combined
  253. // If they have been we can skip the last node of the nodes to add
  254. if (CombineText(patch.last_child(), original.node().first_child(), true))
  255. end--;
  256. pugi::xml_node pos = original.node().first_child();
  257. for (; start != end; start++)
  258. original.node().insert_copy_before(*start, pos);
  259. }
  260. else if (strcmp(pos.value(), "before") == 0)
  261. {
  262. pugi::xml_node::iterator start = patch.begin();
  263. pugi::xml_node::iterator end = patch.end();
  264. // There can not be two consecutive text nodes, so check to see if they need to be combined
  265. // If they have been we can skip the first node of the nodes to add
  266. if (CombineText(patch.first_child(), original.node().previous_sibling(), false))
  267. start++;
  268. // There can not be two consecutive text nodes, so check to see if they need to be combined
  269. // If they have been we can skip the last node of the nodes to add
  270. if (CombineText(patch.last_child(), original.node(), true))
  271. end--;
  272. for (; start != end; start++)
  273. original.parent().insert_copy_before(*start, original.node());
  274. }
  275. else if (strcmp(pos.value(), "after") == 0)
  276. {
  277. pugi::xml_node::iterator start = patch.begin();
  278. pugi::xml_node::iterator end = patch.end();
  279. // There can not be two consecutive text nodes, so check to see if they need to be combined
  280. // If they have been we can skip the first node of the nodes to add
  281. if (CombineText(patch.first_child(), original.node(), false))
  282. start++;
  283. // There can not be two consecutive text nodes, so check to see if they need to be combined
  284. // If they have been we can skip the last node of the nodes to add
  285. if (CombineText(patch.last_child(), original.node().next_sibling(), true))
  286. end--;
  287. pugi::xml_node pos = original.node();
  288. for (; start != end; start++)
  289. pos = original.parent().insert_copy_after(*start, pos);
  290. }
  291. }
  292. void XMLFile::AddAttribute(const pugi::xml_node& patch, const pugi::xpath_node& original) const
  293. {
  294. pugi::xml_attribute attribute = patch.attribute("type");
  295. if (!patch.first_child() && patch.first_child().type() != pugi::node_pcdata)
  296. {
  297. LOGERRORF("XML Patch failed calling Add due to attempting to add non text to an attribute for %s.", attribute.value());
  298. return;
  299. }
  300. String name(attribute.value());
  301. name = name.Substring(1);
  302. pugi::xml_attribute newAttribute = original.node().append_attribute(name.CString());
  303. newAttribute.set_value(patch.child_value());
  304. }
  305. bool XMLFile::CombineText(const pugi::xml_node& patch, const pugi::xml_node& original, bool prepend) const
  306. {
  307. if (!patch || !original)
  308. return false;
  309. if ((patch.type() == pugi::node_pcdata && original.type() == pugi::node_pcdata) ||
  310. (patch.type() == pugi::node_cdata && original.type() == pugi::node_cdata))
  311. {
  312. if (prepend)
  313. const_cast<pugi::xml_node&>(original).set_value(Urho3D::ToString("%s%s", patch.value(), original.value()).CString());
  314. else
  315. const_cast<pugi::xml_node&>(original).set_value(Urho3D::ToString("%s%s", original.value(), patch.value()).CString());
  316. return true;
  317. }
  318. return false;
  319. }
  320. }