BinarySerializer.h 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431
  1. /*
  2. * BinarySerializer.h, part of VCMI engine
  3. *
  4. * Authors: listed in file AUTHORS in main folder
  5. *
  6. * License: GNU General Public License v2.0 or later
  7. * Full text of license available in license.txt file, in main folder
  8. *
  9. */
  10. #pragma once
  11. #include "CTypeList.h"
  12. #include "../mapObjects/CArmedInstance.h"
  13. VCMI_LIB_NAMESPACE_BEGIN
  14. class DLL_LINKAGE CSaverBase
  15. {
  16. protected:
  17. IBinaryWriter * writer;
  18. public:
  19. CSaverBase(IBinaryWriter * w): writer(w){};
  20. inline int write(const void * data, unsigned size)
  21. {
  22. return writer->write(data, size);
  23. };
  24. };
  25. /// Main class for serialization of classes into binary form
  26. /// Behaviour for various classes is following:
  27. /// Primitives: copy memory into underlying stream (defined in CSaverBase)
  28. /// Containers: custom overloaded method that decouples class into primitives
  29. /// VCMI Classes: recursively serialize them via ClassName::serialize( BinarySerializer &, int version) call
  30. class DLL_LINKAGE BinarySerializer : public CSaverBase
  31. {
  32. template<typename Handler>
  33. struct VariantVisitorSaver
  34. {
  35. Handler &h;
  36. VariantVisitorSaver(Handler &H):h(H)
  37. {
  38. }
  39. template <typename T>
  40. void operator()(const T &t)
  41. {
  42. h & t;
  43. }
  44. };
  45. template<typename Ser,typename T>
  46. struct SaveIfStackInstance
  47. {
  48. static bool invoke(Ser &s, const T &data)
  49. {
  50. return false;
  51. }
  52. };
  53. template<typename Ser>
  54. struct SaveIfStackInstance<Ser, CStackInstance *>
  55. {
  56. static bool invoke(Ser &s, const CStackInstance* const &data)
  57. {
  58. assert(data->armyObj);
  59. SlotID slot;
  60. if(data->getNodeType() == CBonusSystemNode::COMMANDER)
  61. slot = SlotID::COMMANDER_SLOT_PLACEHOLDER;
  62. else
  63. slot = data->armyObj->findStack(data);
  64. assert(slot != SlotID());
  65. s & data->armyObj & slot;
  66. return true;
  67. }
  68. };
  69. template <typename T> class CPointerSaver;
  70. class CBasicPointerSaver
  71. {
  72. public:
  73. virtual void savePtr(CSaverBase &ar, const void *data) const =0;
  74. virtual ~CBasicPointerSaver(){}
  75. template<typename T> static CBasicPointerSaver *getApplier(const T * t=nullptr)
  76. {
  77. return new CPointerSaver<T>();
  78. }
  79. };
  80. template <typename T>
  81. class CPointerSaver : public CBasicPointerSaver
  82. {
  83. public:
  84. void savePtr(CSaverBase &ar, const void *data) const override
  85. {
  86. auto & s = static_cast<BinarySerializer &>(ar);
  87. const T *ptr = static_cast<const T*>(data);
  88. //T is most derived known type, it's time to call actual serialize
  89. const_cast<T*>(ptr)->serialize(s, SERIALIZATION_VERSION);
  90. }
  91. };
  92. CApplier<CBasicPointerSaver> applier;
  93. public:
  94. std::map<const void*, ui32> savedPointers;
  95. bool smartPointerSerialization;
  96. bool saving;
  97. BinarySerializer(IBinaryWriter * w): CSaverBase(w)
  98. {
  99. saving=true;
  100. smartPointerSerialization = true;
  101. }
  102. template<typename Base, typename Derived>
  103. void registerType(const Base * b = nullptr, const Derived * d = nullptr)
  104. {
  105. applier.registerType(b, d);
  106. }
  107. template<class T>
  108. BinarySerializer & operator&(const T & t)
  109. {
  110. this->save(t);
  111. return * this;
  112. }
  113. template < typename T, typename std::enable_if < std::is_same<T, bool>::value, int >::type = 0 >
  114. void save(const T &data)
  115. {
  116. ui8 writ = static_cast<ui8>(data);
  117. save(writ);
  118. }
  119. template < typename T, typename std::enable_if < std::is_same<T, std::vector<bool> >::value, int >::type = 0 >
  120. void save(const T &data)
  121. {
  122. std::vector<ui8> convData;
  123. std::copy(data.begin(), data.end(), std::back_inserter(convData));
  124. save(convData);
  125. }
  126. template < class T, typename std::enable_if < std::is_fundamental<T>::value && !std::is_same<T, bool>::value, int >::type = 0 >
  127. void save(const T &data)
  128. {
  129. // save primitive - simply dump binary data to output
  130. this->write(&data,sizeof(data));
  131. }
  132. template < typename T, typename std::enable_if < std::is_enum<T>::value, int >::type = 0 >
  133. void save(const T &data)
  134. {
  135. si32 writ = static_cast<si32>(data);
  136. *this & writ;
  137. }
  138. template < typename T, typename std::enable_if < std::is_array<T>::value, int >::type = 0 >
  139. void save(const T &data)
  140. {
  141. ui32 size = std::size(data);
  142. for(ui32 i=0; i < size; i++)
  143. *this & data[i];
  144. }
  145. template < typename T, typename std::enable_if < std::is_pointer<T>::value, int >::type = 0 >
  146. void save(const T &data)
  147. {
  148. //write if pointer is not nullptr
  149. ui8 hlp = (data!=nullptr);
  150. save(hlp);
  151. //if pointer is nullptr then we don't need anything more...
  152. if(!hlp)
  153. return;
  154. if(writer->smartVectorMembersSerialization)
  155. {
  156. typedef typename std::remove_const<typename std::remove_pointer<T>::type>::type TObjectType;
  157. typedef typename VectorizedTypeFor<TObjectType>::type VType;
  158. typedef typename VectorizedIDType<TObjectType>::type IDType;
  159. if(const auto *info = writer->getVectorizedTypeInfo<VType, IDType>())
  160. {
  161. IDType id = writer->getIdFromVectorItem<VType>(*info, data);
  162. save(id);
  163. if(id != IDType(-1)) //vector id is enough
  164. return;
  165. }
  166. }
  167. if(writer->sendStackInstanceByIds)
  168. {
  169. const bool gotSaved = SaveIfStackInstance<BinarySerializer,T>::invoke(*this, data);
  170. if(gotSaved)
  171. return;
  172. }
  173. savePointerImpl(data);
  174. }
  175. template < typename T, typename std::enable_if < std::is_base_of_v<Entity, std::remove_pointer_t<T>>, int >::type = 0 >
  176. void savePointerImpl(const T &data)
  177. {
  178. auto index = data->getId();
  179. save(index);
  180. }
  181. template < typename T, typename std::enable_if < !std::is_base_of_v<Entity, std::remove_pointer_t<T>>, int >::type = 0 >
  182. void savePointerImpl(const T &data)
  183. {
  184. if(smartPointerSerialization)
  185. {
  186. // We might have an object that has multiple inheritance and store it via the non-first base pointer.
  187. // Therefore, all pointers need to be normalized to the actual object address.
  188. auto actualPointer = typeList.castToMostDerived(data);
  189. auto i = savedPointers.find(actualPointer);
  190. if(i != savedPointers.end())
  191. {
  192. //this pointer has been already serialized - write only it's id
  193. save(i->second);
  194. return;
  195. }
  196. //give id to this pointer
  197. ui32 pid = (ui32)savedPointers.size();
  198. savedPointers[actualPointer] = pid;
  199. save(pid);
  200. }
  201. //write type identifier
  202. ui16 tid = typeList.getTypeID(data);
  203. save(tid);
  204. if(!tid)
  205. save(*data); //if type is unregistered simply write all data in a standard way
  206. else
  207. applier.getApplier(tid)->savePtr(*this, typeList.castToMostDerived(data)); //call serializer specific for our real type
  208. }
  209. template < typename T, typename std::enable_if < is_serializeable<BinarySerializer, T>::value, int >::type = 0 >
  210. void save(const T &data)
  211. {
  212. const_cast<T&>(data).serialize(*this, SERIALIZATION_VERSION);
  213. }
  214. void save(const std::monostate & data)
  215. {
  216. // no-op
  217. }
  218. template <typename T>
  219. void save(const std::shared_ptr<T> &data)
  220. {
  221. T *internalPtr = data.get();
  222. save(internalPtr);
  223. }
  224. template <typename T>
  225. void save(const std::shared_ptr<const T> &data)
  226. {
  227. const T *internalPtr = data.get();
  228. save(internalPtr);
  229. }
  230. template <typename T>
  231. void save(const std::unique_ptr<T> &data)
  232. {
  233. T *internalPtr = data.get();
  234. save(internalPtr);
  235. }
  236. template <typename T, typename std::enable_if < !std::is_same<T, bool >::value, int >::type = 0>
  237. void save(const std::vector<T> &data)
  238. {
  239. ui32 length = (ui32)data.size();
  240. *this & length;
  241. for(ui32 i=0;i<length;i++)
  242. save(data[i]);
  243. }
  244. template <typename T, size_t N>
  245. void save(const std::array<T, N> &data)
  246. {
  247. for(ui32 i=0; i < N; i++)
  248. save(data[i]);
  249. }
  250. template <typename T>
  251. void save(const std::set<T> &data)
  252. {
  253. auto & d = const_cast<std::set<T> &>(data);
  254. ui32 length = (ui32)d.size();
  255. save(length);
  256. for(auto i = d.begin(); i != d.end(); i++)
  257. save(*i);
  258. }
  259. template <typename T, typename U>
  260. void save(const std::unordered_set<T, U> &data)
  261. {
  262. auto & d = const_cast<std::unordered_set<T, U> &>(data);
  263. ui32 length = (ui32)d.size();
  264. *this & length;
  265. for(auto i = d.begin(); i != d.end(); i++)
  266. save(*i);
  267. }
  268. template <typename T>
  269. void save(const std::list<T> &data)
  270. {
  271. auto & d = const_cast<std::list<T> &>(data);
  272. ui32 length = (ui32)d.size();
  273. *this & length;
  274. for(auto i = d.begin(); i != d.end(); i++)
  275. save(*i);
  276. }
  277. void save(const std::string &data)
  278. {
  279. save(ui32(data.length()));
  280. this->write(data.c_str(),(unsigned int)data.size());
  281. }
  282. template <typename T1, typename T2>
  283. void save(const std::pair<T1,T2> &data)
  284. {
  285. save(data.first);
  286. save(data.second);
  287. }
  288. template <typename T1, typename T2>
  289. void save(const std::map<T1,T2> &data)
  290. {
  291. *this & ui32(data.size());
  292. for(auto i = data.begin(); i != data.end(); i++)
  293. {
  294. save(i->first);
  295. save(i->second);
  296. }
  297. }
  298. template <typename T1, typename T2>
  299. void save(const std::multimap<T1, T2> &data)
  300. {
  301. *this & ui32(data.size());
  302. for(auto i = data.begin(); i != data.end(); i++)
  303. {
  304. save(i->first);
  305. save(i->second);
  306. }
  307. }
  308. template<typename T0, typename... TN>
  309. void save(const std::variant<T0, TN...> & data)
  310. {
  311. si32 which = data.index();
  312. save(which);
  313. VariantVisitorSaver<BinarySerializer> visitor(*this);
  314. std::visit(visitor, data);
  315. }
  316. template<typename T>
  317. void save(const std::optional<T> & data)
  318. {
  319. if(data)
  320. {
  321. save((ui8)1);
  322. save(*data);
  323. }
  324. else
  325. {
  326. save((ui8)0);
  327. }
  328. }
  329. template <typename T>
  330. void save(const boost::multi_array<T, 3> &data)
  331. {
  332. ui32 length = data.num_elements();
  333. *this & length;
  334. auto shape = data.shape();
  335. ui32 x = shape[0], y = shape[1], z = shape[2];
  336. *this & x & y & z;
  337. for(ui32 i = 0; i < length; i++)
  338. save(data.data()[i]);
  339. }
  340. template <std::size_t T>
  341. void save(const std::bitset<T> &data)
  342. {
  343. static_assert(T <= 64);
  344. if constexpr (T <= 16)
  345. {
  346. auto writ = static_cast<uint16_t>(data.to_ulong());
  347. save(writ);
  348. }
  349. else if constexpr (T <= 32)
  350. {
  351. auto writ = static_cast<uint32_t>(data.to_ulong());
  352. save(writ);
  353. }
  354. else if constexpr (T <= 64)
  355. {
  356. auto writ = static_cast<uint64_t>(data.to_ulong());
  357. save(writ);
  358. }
  359. }
  360. };
  361. class DLL_LINKAGE CSaveFile : public IBinaryWriter
  362. {
  363. public:
  364. BinarySerializer serializer;
  365. boost::filesystem::path fName;
  366. std::unique_ptr<std::fstream> sfile;
  367. CSaveFile(const boost::filesystem::path &fname); //throws!
  368. ~CSaveFile();
  369. int write(const void * data, unsigned size) override;
  370. void openNextFile(const boost::filesystem::path &fname); //throws!
  371. void clear();
  372. void reportState(vstd::CLoggerBase * out) override;
  373. void putMagicBytes(const std::string &text);
  374. template<class T>
  375. CSaveFile & operator<<(const T &t)
  376. {
  377. serializer & t;
  378. return * this;
  379. }
  380. };
  381. VCMI_LIB_NAMESPACE_END