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