BinarySerializer.h 9.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409
  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 "ESerializationVersion.h"
  14. #include "../mapObjects/CArmedInstance.h"
  15. VCMI_LIB_NAMESPACE_BEGIN
  16. class DLL_LINKAGE CSaverBase
  17. {
  18. protected:
  19. IBinaryWriter * writer;
  20. public:
  21. CSaverBase(IBinaryWriter * w): writer(w){};
  22. inline void write(const void * data, unsigned size)
  23. {
  24. writer->write(reinterpret_cast<const std::byte*>(data), size);
  25. };
  26. };
  27. /// Main class for serialization of classes into binary form
  28. /// Behaviour for various classes is following:
  29. /// Primitives: copy memory into underlying stream (defined in CSaverBase)
  30. /// Containers: custom overloaded method that decouples class into primitives
  31. /// VCMI Classes: recursively serialize them via ClassName::serialize( BinarySerializer &, int version) call
  32. class DLL_LINKAGE BinarySerializer : public CSaverBase
  33. {
  34. template<typename Handler>
  35. struct VariantVisitorSaver
  36. {
  37. Handler &h;
  38. VariantVisitorSaver(Handler &H):h(H)
  39. {
  40. }
  41. template <typename T>
  42. void operator()(const T &t)
  43. {
  44. h & t;
  45. }
  46. };
  47. template<typename Ser,typename T>
  48. struct SaveIfStackInstance
  49. {
  50. static bool invoke(Ser &s, const T &data)
  51. {
  52. return false;
  53. }
  54. };
  55. template<typename Ser>
  56. struct SaveIfStackInstance<Ser, CStackInstance *>
  57. {
  58. static bool invoke(Ser &s, const CStackInstance* const &data)
  59. {
  60. assert(data->armyObj);
  61. SlotID slot;
  62. if(data->getNodeType() == CBonusSystemNode::COMMANDER)
  63. slot = SlotID::COMMANDER_SLOT_PLACEHOLDER;
  64. else
  65. slot = data->armyObj->findStack(data);
  66. assert(slot != SlotID());
  67. s & data->armyObj & slot;
  68. return true;
  69. }
  70. };
  71. template <typename T> class CPointerSaver;
  72. class CBasicPointerSaver
  73. {
  74. public:
  75. virtual void savePtr(CSaverBase &ar, const void *data) const =0;
  76. virtual ~CBasicPointerSaver(){}
  77. template<typename T> static CBasicPointerSaver *getApplier(const T * t=nullptr)
  78. {
  79. return new CPointerSaver<T>();
  80. }
  81. };
  82. template <typename T>
  83. class CPointerSaver : public CBasicPointerSaver
  84. {
  85. public:
  86. void savePtr(CSaverBase &ar, const void *data) const override
  87. {
  88. auto & s = static_cast<BinarySerializer &>(ar);
  89. const T *ptr = static_cast<const T*>(data);
  90. //T is most derived known type, it's time to call actual serialize
  91. const_cast<T*>(ptr)->serialize(s);
  92. }
  93. };
  94. CApplier<CBasicPointerSaver> applier;
  95. public:
  96. using Version = ESerializationVersion;
  97. std::map<const void*, ui32> savedPointers;
  98. Version version = Version::CURRENT;
  99. bool smartPointerSerialization;
  100. bool saving;
  101. BinarySerializer(IBinaryWriter * w);
  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_t < std::is_same_v<T, bool>, int > = 0 >
  114. void save(const T &data)
  115. {
  116. ui8 writ = static_cast<ui8>(data);
  117. save(writ);
  118. }
  119. template < class T, typename std::enable_if_t < std::is_fundamental_v<T> && !std::is_same_v<T, bool>, int > = 0 >
  120. void save(const T &data)
  121. {
  122. // save primitive - simply dump binary data to output
  123. this->write(static_cast<const void *>(&data), sizeof(data));
  124. }
  125. template < typename T, typename std::enable_if_t < std::is_enum_v<T>, int > = 0 >
  126. void save(const T &data)
  127. {
  128. si32 writ = static_cast<si32>(data);
  129. *this & writ;
  130. }
  131. template < typename T, typename std::enable_if_t < std::is_array_v<T>, int > = 0 >
  132. void save(const T &data)
  133. {
  134. ui32 size = std::size(data);
  135. for(ui32 i=0; i < size; i++)
  136. *this & data[i];
  137. }
  138. template < typename T, typename std::enable_if_t < std::is_pointer_v<T>, int > = 0 >
  139. void save(const T &data)
  140. {
  141. //write if pointer is not nullptr
  142. bool isNull = (data == nullptr);
  143. save(isNull);
  144. //if pointer is nullptr then we don't need anything more...
  145. if(data == nullptr)
  146. return;
  147. savePointerImpl(data);
  148. }
  149. template < typename T, typename std::enable_if_t < std::is_base_of_v<Entity, std::remove_pointer_t<T>>, int > = 0 >
  150. void savePointerImpl(const T &data)
  151. {
  152. auto index = data->getId();
  153. save(index);
  154. }
  155. template < typename T, typename std::enable_if_t < !std::is_base_of_v<Entity, std::remove_pointer_t<T>>, int > = 0 >
  156. void savePointerImpl(const T &data)
  157. {
  158. typedef typename std::remove_const_t<typename std::remove_pointer_t<T>> TObjectType;
  159. if(writer->smartVectorMembersSerialization)
  160. {
  161. typedef typename VectorizedTypeFor<TObjectType>::type VType;
  162. typedef typename VectorizedIDType<TObjectType>::type IDType;
  163. if(const auto *info = writer->getVectorizedTypeInfo<VType, IDType>())
  164. {
  165. IDType id = writer->getIdFromVectorItem<VType>(*info, data);
  166. save(id);
  167. if(id != IDType(-1)) //vector id is enough
  168. return;
  169. }
  170. }
  171. if(writer->sendStackInstanceByIds)
  172. {
  173. const bool gotSaved = SaveIfStackInstance<BinarySerializer,T>::invoke(*this, data);
  174. if(gotSaved)
  175. return;
  176. }
  177. if(smartPointerSerialization)
  178. {
  179. // We might have an object that has multiple inheritance and store it via the non-first base pointer.
  180. // Therefore, all pointers need to be normalized to the actual object address.
  181. const void * actualPointer = static_cast<const void*>(data);
  182. auto i = savedPointers.find(actualPointer);
  183. if(i != savedPointers.end())
  184. {
  185. //this pointer has been already serialized - write only it's id
  186. save(i->second);
  187. return;
  188. }
  189. //give id to this pointer
  190. ui32 pid = (ui32)savedPointers.size();
  191. savedPointers[actualPointer] = pid;
  192. save(pid);
  193. }
  194. //write type identifier
  195. uint16_t tid = CTypeList::getInstance().getTypeID(data);
  196. save(tid);
  197. if(!tid)
  198. save(*data); //if type is unregistered simply write all data in a standard way
  199. else
  200. applier.getApplier(tid)->savePtr(*this, static_cast<const void*>(data)); //call serializer specific for our real type
  201. }
  202. template < typename T, typename std::enable_if_t < is_serializeable<BinarySerializer, T>::value, int > = 0 >
  203. void save(const T &data)
  204. {
  205. const_cast<T&>(data).serialize(*this);
  206. }
  207. void save(const std::monostate & data)
  208. {
  209. // no-op
  210. }
  211. template <typename T>
  212. void save(const std::shared_ptr<T> &data)
  213. {
  214. T *internalPtr = data.get();
  215. save(internalPtr);
  216. }
  217. template <typename T>
  218. void save(const std::shared_ptr<const T> &data)
  219. {
  220. const T *internalPtr = data.get();
  221. save(internalPtr);
  222. }
  223. template <typename T>
  224. void save(const std::unique_ptr<T> &data)
  225. {
  226. T *internalPtr = data.get();
  227. save(internalPtr);
  228. }
  229. template <typename T, typename std::enable_if_t < !std::is_same_v<T, bool >, int > = 0>
  230. void save(const std::vector<T> &data)
  231. {
  232. ui32 length = (ui32)data.size();
  233. *this & length;
  234. for(ui32 i=0;i<length;i++)
  235. save(data[i]);
  236. }
  237. template <typename T, typename std::enable_if_t < !std::is_same_v<T, bool >, int > = 0>
  238. void save(const std::deque<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(static_cast<const void *>(data.data()), 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];
  337. ui32 y = shape[1];
  338. ui32 z = shape[2];
  339. *this & x & y & z;
  340. for(ui32 i = 0; i < length; i++)
  341. save(data.data()[i]);
  342. }
  343. template <std::size_t T>
  344. void save(const std::bitset<T> &data)
  345. {
  346. static_assert(T <= 64);
  347. if constexpr (T <= 16)
  348. {
  349. auto writ = static_cast<uint16_t>(data.to_ulong());
  350. save(writ);
  351. }
  352. else if constexpr (T <= 32)
  353. {
  354. auto writ = static_cast<uint32_t>(data.to_ulong());
  355. save(writ);
  356. }
  357. else if constexpr (T <= 64)
  358. {
  359. auto writ = static_cast<uint64_t>(data.to_ulong());
  360. save(writ);
  361. }
  362. }
  363. };
  364. VCMI_LIB_NAMESPACE_END