BinarySerializer.h 8.8 KB

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