2
0

BinarySerializer.h 11 KB

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