BinarySerializer.h 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498
  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. 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 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 Fake, typename T>
  49. bool saveIfStackInstance(const T &data)
  50. {
  51. return false;
  52. }
  53. template<typename Fake>
  54. bool saveIfStackInstance(const CStackInstance* const &data)
  55. {
  56. assert(data->armyObj);
  57. SlotID slot;
  58. if(data->getNodeType() == CBonusSystemNode::COMMANDER)
  59. slot = SlotID::COMMANDER_SLOT_PLACEHOLDER;
  60. else
  61. slot = data->armyObj->findStack(data);
  62. assert(slot != SlotID());
  63. save(data->armyObj->id);
  64. save(slot);
  65. if (data->armyObj->id != ObjectInstanceID::NONE)
  66. return true;
  67. else
  68. return false;
  69. }
  70. template <typename T> class CPointerSaver;
  71. class CBasicPointerSaver
  72. {
  73. public:
  74. virtual void savePtr(CSaverBase &ar, const Serializeable *data) const =0;
  75. virtual ~CBasicPointerSaver() = default;
  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 Serializeable *data) const override
  86. {
  87. auto & s = static_cast<BinarySerializer &>(ar);
  88. const T *ptr = dynamic_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);
  91. }
  92. };
  93. CApplier<CBasicPointerSaver> applier;
  94. public:
  95. using Version = ESerializationVersion;
  96. std::map<std::string, uint32_t> savedStrings;
  97. std::map<const Serializeable*, uint32_t> savedPointers;
  98. Version version = Version::CURRENT;
  99. static constexpr bool trackSerializedPointers = true;
  100. static constexpr bool saving = true;
  101. bool loadingGamestate = false;
  102. bool hasFeature(Version what) const
  103. {
  104. return version >= what;
  105. };
  106. DLL_LINKAGE BinarySerializer(IBinaryWriter * w);
  107. template<typename Base, typename Derived>
  108. void registerType(const Base * b = nullptr, const Derived * d = nullptr)
  109. {
  110. applier.registerType(b, d);
  111. }
  112. template<class T>
  113. BinarySerializer & operator&(const T & t)
  114. {
  115. this->save(t);
  116. return * this;
  117. }
  118. void saveEncodedInteger(int64_t value)
  119. {
  120. uint64_t valueUnsigned = std::abs(value);
  121. while (valueUnsigned > 0x3f)
  122. {
  123. uint8_t byteValue = (valueUnsigned & 0x7f) | 0x80;
  124. valueUnsigned = valueUnsigned >> 7;
  125. save(byteValue);
  126. }
  127. uint8_t lastByteValue = valueUnsigned & 0x3f;
  128. if (value < 0)
  129. lastByteValue |= 0x40;
  130. save(lastByteValue);
  131. }
  132. template < typename T, typename std::enable_if_t < std::is_same_v<T, bool>, int > = 0 >
  133. void save(const T &data)
  134. {
  135. uint8_t writ = static_cast<uint8_t>(data);
  136. save(writ);
  137. }
  138. template < class T, typename std::enable_if_t < std::is_floating_point_v<T>, int > = 0 >
  139. void save(const T &data)
  140. {
  141. // save primitive - simply dump binary data to output
  142. this->write(static_cast<const void *>(&data), sizeof(data));
  143. }
  144. template < class T, typename std::enable_if_t < std::is_integral_v<T> && !std::is_same_v<T, bool>, int > = 0 >
  145. void save(const T &data)
  146. {
  147. if constexpr (sizeof(T) == 1)
  148. {
  149. // save primitive - simply dump binary data to output
  150. this->write(static_cast<const void *>(&data), sizeof(data));
  151. }
  152. else
  153. {
  154. if (hasFeature(Version::COMPACT_INTEGER_SERIALIZATION))
  155. saveEncodedInteger(data);
  156. else
  157. this->write(static_cast<const void *>(&data), sizeof(data));
  158. }
  159. }
  160. void save(const Version &data)
  161. {
  162. this->write(static_cast<const void *>(&data), sizeof(data));
  163. }
  164. template < typename T, typename std::enable_if_t < std::is_enum_v<T>, int > = 0 >
  165. void save(const T &data)
  166. {
  167. int32_t writ = static_cast<int32_t>(data);
  168. *this & writ;
  169. }
  170. template < typename T, typename std::enable_if_t < std::is_array_v<T>, int > = 0 >
  171. void save(const T &data)
  172. {
  173. uint32_t size = std::size(data);
  174. for(uint32_t i=0; i < size; i++)
  175. *this & data[i];
  176. }
  177. template < typename T, typename std::enable_if_t < std::is_pointer_v<T>, int > = 0 >
  178. void save(const T &data)
  179. {
  180. //write if pointer is not nullptr
  181. bool isNull = (data == nullptr);
  182. save(isNull);
  183. //if pointer is nullptr then we don't need anything more...
  184. if(data == nullptr)
  185. return;
  186. savePointerImpl(data);
  187. }
  188. template < typename T, typename std::enable_if_t < std::is_base_of_v<Entity, std::remove_pointer_t<T>>, int > = 0 >
  189. void savePointerImpl(const T &data)
  190. {
  191. auto index = data->getId();
  192. save(index);
  193. }
  194. template < typename T, typename std::enable_if_t < !std::is_base_of_v<Entity, std::remove_pointer_t<T>>, int > = 0 >
  195. void savePointerImpl(const T &data)
  196. {
  197. typedef typename std::remove_const_t<typename std::remove_pointer_t<T>> TObjectType;
  198. if(writer->smartVectorMembersSerialization)
  199. {
  200. typedef typename VectorizedTypeFor<TObjectType>::type VType;
  201. typedef typename VectorizedIDType<TObjectType>::type IDType;
  202. if(const auto *info = writer->getVectorizedTypeInfo<VType, IDType>())
  203. {
  204. IDType id = writer->getIdFromVectorItem<VType>(*info, data);
  205. save(id);
  206. if(id != IDType(-1)) //vector id is enough
  207. return;
  208. }
  209. }
  210. if(writer->sendStackInstanceByIds)
  211. {
  212. const bool gotSaved = saveIfStackInstance<void>(data);
  213. if(gotSaved)
  214. return;
  215. }
  216. if(trackSerializedPointers)
  217. {
  218. // We might have an object that has multiple inheritance and store it via the non-first base pointer.
  219. // Therefore, all pointers need to be normalized to the actual object address.
  220. const auto * actualPointer = static_cast<const Serializeable*>(data);
  221. auto i = savedPointers.find(actualPointer);
  222. if(i != savedPointers.end())
  223. {
  224. //this pointer has been already serialized - write only it's id
  225. save(i->second);
  226. return;
  227. }
  228. //give id to this pointer
  229. uint32_t pid = savedPointers.size();
  230. savedPointers[actualPointer] = pid;
  231. save(pid);
  232. }
  233. //write type identifier
  234. uint16_t tid = CTypeList::getInstance().getTypeID(data);
  235. save(tid);
  236. if(!tid)
  237. save(*data); //if type is unregistered simply write all data in a standard way
  238. else
  239. applier.getApplier(tid)->savePtr(*this, static_cast<const Serializeable*>(data)); //call serializer specific for our real type
  240. }
  241. template < typename T, typename std::enable_if_t < is_serializeable<BinarySerializer, T>::value, int > = 0 >
  242. void save(const T &data)
  243. {
  244. const_cast<T&>(data).serialize(*this);
  245. }
  246. void save(const std::monostate & data)
  247. {
  248. // no-op
  249. }
  250. template <typename T>
  251. void save(const std::shared_ptr<T> &data)
  252. {
  253. T *internalPtr = data.get();
  254. save(internalPtr);
  255. }
  256. template <typename T>
  257. void save(const std::shared_ptr<const T> &data)
  258. {
  259. const T *internalPtr = data.get();
  260. save(internalPtr);
  261. }
  262. template <typename T>
  263. void save(const std::unique_ptr<T> &data)
  264. {
  265. T *internalPtr = data.get();
  266. save(internalPtr);
  267. }
  268. template <typename T, typename std::enable_if_t < !std::is_same_v<T, bool >, int > = 0>
  269. void save(const std::vector<T> &data)
  270. {
  271. uint32_t length = data.size();
  272. *this & length;
  273. for(uint32_t i=0;i<length;i++)
  274. save(data[i]);
  275. }
  276. template <typename T, typename std::enable_if_t < !std::is_same_v<T, bool >, int > = 0>
  277. void save(const std::deque<T> & data)
  278. {
  279. uint32_t length = data.size();
  280. *this & length;
  281. for(uint32_t i = 0; i < length; i++)
  282. save(data[i]);
  283. }
  284. template <typename T, size_t N>
  285. void save(const std::array<T, N> &data)
  286. {
  287. for(uint32_t i=0; i < N; i++)
  288. save(data[i]);
  289. }
  290. template <typename T>
  291. void save(const std::set<T> &data)
  292. {
  293. auto & d = const_cast<std::set<T> &>(data);
  294. uint32_t length = d.size();
  295. save(length);
  296. for(auto i = d.begin(); i != d.end(); i++)
  297. save(*i);
  298. }
  299. template <typename T, typename U>
  300. void save(const std::unordered_set<T, U> &data)
  301. {
  302. auto & d = const_cast<std::unordered_set<T, U> &>(data);
  303. uint32_t length = d.size();
  304. *this & length;
  305. for(auto i = d.begin(); i != d.end(); i++)
  306. save(*i);
  307. }
  308. template <typename T>
  309. void save(const std::list<T> &data)
  310. {
  311. auto & d = const_cast<std::list<T> &>(data);
  312. uint32_t length = d.size();
  313. *this & length;
  314. for(auto i = d.begin(); i != d.end(); i++)
  315. save(*i);
  316. }
  317. void save(const std::string &data)
  318. {
  319. if (hasFeature(Version::COMPACT_STRING_SERIALIZATION))
  320. {
  321. if (data.empty())
  322. {
  323. save(static_cast<uint32_t>(0));
  324. return;
  325. }
  326. auto it = savedStrings.find(data);
  327. if (it == savedStrings.end())
  328. {
  329. save(static_cast<uint32_t>(data.length()));
  330. this->write(static_cast<const void *>(data.data()), data.size());
  331. // -1, -2...
  332. int32_t newStringID = -1 - savedStrings.size();
  333. savedStrings[data] = newStringID;
  334. }
  335. else
  336. {
  337. int32_t index = it->second;
  338. save(index);
  339. }
  340. }
  341. else
  342. {
  343. save(static_cast<uint32_t>(data.length()));
  344. this->write(static_cast<const void *>(data.data()), data.size());
  345. }
  346. }
  347. template <typename T1, typename T2>
  348. void save(const std::pair<T1,T2> &data)
  349. {
  350. save(data.first);
  351. save(data.second);
  352. }
  353. template <typename T1, typename T2>
  354. void save(const std::unordered_map<T1,T2> &data)
  355. {
  356. *this & static_cast<uint32_t>(data.size());
  357. for(auto i = data.begin(); i != data.end(); i++)
  358. {
  359. save(i->first);
  360. save(i->second);
  361. }
  362. }
  363. template <typename T1, typename T2>
  364. void save(const std::map<T1,T2> &data)
  365. {
  366. *this & static_cast<uint32_t>(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 & static_cast<uint32_t>(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. int32_t 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(static_cast<uint8_t>(1));
  397. save(*data);
  398. }
  399. else
  400. {
  401. save(static_cast<uint32_t>(0));
  402. }
  403. }
  404. template <typename T>
  405. void save(const boost::multi_array<T, 3> &data)
  406. {
  407. uint32_t length = data.num_elements();
  408. *this & length;
  409. auto shape = data.shape();
  410. uint32_t x = shape[0];
  411. uint32_t y = shape[1];
  412. uint32_t z = shape[2];
  413. *this & x & y & z;
  414. for(uint32_t 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