2
0

BinarySerializer.h 8.9 KB

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