BinarySerializer.h 10 KB

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