BinarySerializer.h 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497
  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. bool smartPointerSerialization;
  100. bool saving;
  101. bool hasFeature(Version what) const
  102. {
  103. return version >= what;
  104. };
  105. DLL_LINKAGE BinarySerializer(IBinaryWriter * w);
  106. template<typename Base, typename Derived>
  107. void registerType(const Base * b = nullptr, const Derived * d = nullptr)
  108. {
  109. applier.registerType(b, d);
  110. }
  111. template<class T>
  112. BinarySerializer & operator&(const T & t)
  113. {
  114. this->save(t);
  115. return * this;
  116. }
  117. void saveEncodedInteger(int64_t value)
  118. {
  119. uint64_t valueUnsigned = std::abs(value);
  120. while (valueUnsigned > 0x3f)
  121. {
  122. uint8_t byteValue = (valueUnsigned & 0x7f) | 0x80;
  123. valueUnsigned = valueUnsigned >> 7;
  124. save(byteValue);
  125. }
  126. uint8_t lastByteValue = valueUnsigned & 0x3f;
  127. if (value < 0)
  128. lastByteValue |= 0x40;
  129. save(lastByteValue);
  130. }
  131. template < typename T, typename std::enable_if_t < std::is_same_v<T, bool>, int > = 0 >
  132. void save(const T &data)
  133. {
  134. uint8_t writ = static_cast<uint8_t>(data);
  135. save(writ);
  136. }
  137. template < class T, typename std::enable_if_t < std::is_floating_point_v<T>, int > = 0 >
  138. void save(const T &data)
  139. {
  140. // save primitive - simply dump binary data to output
  141. this->write(static_cast<const void *>(&data), sizeof(data));
  142. }
  143. template < class T, typename std::enable_if_t < std::is_integral_v<T> && !std::is_same_v<T, bool>, int > = 0 >
  144. void save(const T &data)
  145. {
  146. if constexpr (sizeof(T) == 1)
  147. {
  148. // save primitive - simply dump binary data to output
  149. this->write(static_cast<const void *>(&data), sizeof(data));
  150. }
  151. else
  152. {
  153. if (hasFeature(Version::COMPACT_INTEGER_SERIALIZATION))
  154. saveEncodedInteger(data);
  155. else
  156. this->write(static_cast<const void *>(&data), sizeof(data));
  157. }
  158. }
  159. void save(const Version &data)
  160. {
  161. this->write(static_cast<const void *>(&data), sizeof(data));
  162. }
  163. template < typename T, typename std::enable_if_t < std::is_enum_v<T>, int > = 0 >
  164. void save(const T &data)
  165. {
  166. int32_t writ = static_cast<int32_t>(data);
  167. *this & writ;
  168. }
  169. template < typename T, typename std::enable_if_t < std::is_array_v<T>, int > = 0 >
  170. void save(const T &data)
  171. {
  172. uint32_t size = std::size(data);
  173. for(uint32_t i=0; i < size; i++)
  174. *this & data[i];
  175. }
  176. template < typename T, typename std::enable_if_t < std::is_pointer_v<T>, int > = 0 >
  177. void save(const T &data)
  178. {
  179. //write if pointer is not nullptr
  180. bool isNull = (data == nullptr);
  181. save(isNull);
  182. //if pointer is nullptr then we don't need anything more...
  183. if(data == nullptr)
  184. return;
  185. savePointerImpl(data);
  186. }
  187. template < typename T, typename std::enable_if_t < std::is_base_of_v<Entity, std::remove_pointer_t<T>>, int > = 0 >
  188. void savePointerImpl(const T &data)
  189. {
  190. auto index = data->getId();
  191. save(index);
  192. }
  193. template < typename T, typename std::enable_if_t < !std::is_base_of_v<Entity, std::remove_pointer_t<T>>, int > = 0 >
  194. void savePointerImpl(const T &data)
  195. {
  196. typedef typename std::remove_const_t<typename std::remove_pointer_t<T>> TObjectType;
  197. if(writer->smartVectorMembersSerialization)
  198. {
  199. typedef typename VectorizedTypeFor<TObjectType>::type VType;
  200. typedef typename VectorizedIDType<TObjectType>::type IDType;
  201. if(const auto *info = writer->getVectorizedTypeInfo<VType, IDType>())
  202. {
  203. IDType id = writer->getIdFromVectorItem<VType>(*info, data);
  204. save(id);
  205. if(id != IDType(-1)) //vector id is enough
  206. return;
  207. }
  208. }
  209. if(writer->sendStackInstanceByIds)
  210. {
  211. const bool gotSaved = saveIfStackInstance<void>(data);
  212. if(gotSaved)
  213. return;
  214. }
  215. if(smartPointerSerialization)
  216. {
  217. // We might have an object that has multiple inheritance and store it via the non-first base pointer.
  218. // Therefore, all pointers need to be normalized to the actual object address.
  219. const auto * actualPointer = static_cast<const Serializeable*>(data);
  220. auto i = savedPointers.find(actualPointer);
  221. if(i != savedPointers.end())
  222. {
  223. //this pointer has been already serialized - write only it's id
  224. save(i->second);
  225. return;
  226. }
  227. //give id to this pointer
  228. uint32_t pid = savedPointers.size();
  229. savedPointers[actualPointer] = pid;
  230. save(pid);
  231. }
  232. //write type identifier
  233. uint16_t tid = CTypeList::getInstance().getTypeID(data);
  234. save(tid);
  235. if(!tid)
  236. save(*data); //if type is unregistered simply write all data in a standard way
  237. else
  238. applier.getApplier(tid)->savePtr(*this, static_cast<const Serializeable*>(data)); //call serializer specific for our real type
  239. }
  240. template < typename T, typename std::enable_if_t < is_serializeable<BinarySerializer, T>::value, int > = 0 >
  241. void save(const T &data)
  242. {
  243. const_cast<T&>(data).serialize(*this);
  244. }
  245. void save(const std::monostate & data)
  246. {
  247. // no-op
  248. }
  249. template <typename T>
  250. void save(const std::shared_ptr<T> &data)
  251. {
  252. T *internalPtr = data.get();
  253. save(internalPtr);
  254. }
  255. template <typename T>
  256. void save(const std::shared_ptr<const T> &data)
  257. {
  258. const T *internalPtr = data.get();
  259. save(internalPtr);
  260. }
  261. template <typename T>
  262. void save(const std::unique_ptr<T> &data)
  263. {
  264. T *internalPtr = data.get();
  265. save(internalPtr);
  266. }
  267. template <typename T, typename std::enable_if_t < !std::is_same_v<T, bool >, int > = 0>
  268. void save(const std::vector<T> &data)
  269. {
  270. uint32_t length = data.size();
  271. *this & length;
  272. for(uint32_t i=0;i<length;i++)
  273. save(data[i]);
  274. }
  275. template <typename T, typename std::enable_if_t < !std::is_same_v<T, bool >, int > = 0>
  276. void save(const std::deque<T> & data)
  277. {
  278. uint32_t length = data.size();
  279. *this & length;
  280. for(uint32_t i = 0; i < length; i++)
  281. save(data[i]);
  282. }
  283. template <typename T, size_t N>
  284. void save(const std::array<T, N> &data)
  285. {
  286. for(uint32_t i=0; i < N; i++)
  287. save(data[i]);
  288. }
  289. template <typename T>
  290. void save(const std::set<T> &data)
  291. {
  292. auto & d = const_cast<std::set<T> &>(data);
  293. uint32_t length = d.size();
  294. save(length);
  295. for(auto i = d.begin(); i != d.end(); i++)
  296. save(*i);
  297. }
  298. template <typename T, typename U>
  299. void save(const std::unordered_set<T, U> &data)
  300. {
  301. auto & d = const_cast<std::unordered_set<T, U> &>(data);
  302. uint32_t length = d.size();
  303. *this & length;
  304. for(auto i = d.begin(); i != d.end(); i++)
  305. save(*i);
  306. }
  307. template <typename T>
  308. void save(const std::list<T> &data)
  309. {
  310. auto & d = const_cast<std::list<T> &>(data);
  311. uint32_t length = d.size();
  312. *this & length;
  313. for(auto i = d.begin(); i != d.end(); i++)
  314. save(*i);
  315. }
  316. void save(const std::string &data)
  317. {
  318. if (hasFeature(Version::COMPACT_STRING_SERIALIZATION))
  319. {
  320. if (data.empty())
  321. {
  322. save(static_cast<uint32_t>(0));
  323. return;
  324. }
  325. auto it = savedStrings.find(data);
  326. if (it == savedStrings.end())
  327. {
  328. save(static_cast<uint32_t>(data.length()));
  329. this->write(static_cast<const void *>(data.data()), data.size());
  330. // -1, -2...
  331. int32_t newStringID = -1 - savedStrings.size();
  332. savedStrings[data] = newStringID;
  333. }
  334. else
  335. {
  336. int32_t index = it->second;
  337. save(index);
  338. }
  339. }
  340. else
  341. {
  342. save(static_cast<uint32_t>(data.length()));
  343. this->write(static_cast<const void *>(data.data()), data.size());
  344. }
  345. }
  346. template <typename T1, typename T2>
  347. void save(const std::pair<T1,T2> &data)
  348. {
  349. save(data.first);
  350. save(data.second);
  351. }
  352. template <typename T1, typename T2>
  353. void save(const std::unordered_map<T1,T2> &data)
  354. {
  355. *this & static_cast<uint32_t>(data.size());
  356. for(auto i = data.begin(); i != data.end(); i++)
  357. {
  358. save(i->first);
  359. save(i->second);
  360. }
  361. }
  362. template <typename T1, typename T2>
  363. void save(const std::map<T1,T2> &data)
  364. {
  365. *this & static_cast<uint32_t>(data.size());
  366. for(auto i = data.begin(); i != data.end(); i++)
  367. {
  368. save(i->first);
  369. save(i->second);
  370. }
  371. }
  372. template <typename T1, typename T2>
  373. void save(const std::multimap<T1, T2> &data)
  374. {
  375. *this & static_cast<uint32_t>(data.size());
  376. for(auto i = data.begin(); i != data.end(); i++)
  377. {
  378. save(i->first);
  379. save(i->second);
  380. }
  381. }
  382. template<typename T0, typename... TN>
  383. void save(const std::variant<T0, TN...> & data)
  384. {
  385. int32_t which = data.index();
  386. save(which);
  387. VariantVisitorSaver<BinarySerializer> visitor(*this);
  388. std::visit(visitor, data);
  389. }
  390. template<typename T>
  391. void save(const std::optional<T> & data)
  392. {
  393. if(data)
  394. {
  395. save(static_cast<uint8_t>(1));
  396. save(*data);
  397. }
  398. else
  399. {
  400. save(static_cast<uint32_t>(0));
  401. }
  402. }
  403. template <typename T>
  404. void save(const boost::multi_array<T, 3> &data)
  405. {
  406. uint32_t length = data.num_elements();
  407. *this & length;
  408. auto shape = data.shape();
  409. uint32_t x = shape[0];
  410. uint32_t y = shape[1];
  411. uint32_t z = shape[2];
  412. *this & x & y & z;
  413. for(uint32_t i = 0; i < length; i++)
  414. save(data.data()[i]);
  415. }
  416. template <std::size_t T>
  417. void save(const std::bitset<T> &data)
  418. {
  419. static_assert(T <= 64);
  420. if constexpr (T <= 16)
  421. {
  422. auto writ = static_cast<uint16_t>(data.to_ulong());
  423. save(writ);
  424. }
  425. else if constexpr (T <= 32)
  426. {
  427. auto writ = static_cast<uint32_t>(data.to_ulong());
  428. save(writ);
  429. }
  430. else if constexpr (T <= 64)
  431. {
  432. auto writ = static_cast<uint64_t>(data.to_ulong());
  433. save(writ);
  434. }
  435. }
  436. };
  437. VCMI_LIB_NAMESPACE_END