BinarySerializer.h 11 KB

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