2
0

BinarySerializer.h 11 KB

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