BinaryDeserializer.h 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483
  1. /*
  2. * BinaryDeserializer.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 "ESerializationVersion.h"
  13. #include "SerializerReflection.h"
  14. #include "../bonuses/BonusEnum.h"
  15. VCMI_LIB_NAMESPACE_BEGIN
  16. /// Main class for deserialization of classes from binary form
  17. /// Effectively revesed version of BinarySerializer
  18. class BinaryDeserializer
  19. {
  20. public:
  21. using Version = ESerializationVersion;
  22. static constexpr bool saving = false;
  23. IGameInfoCallback * cb = nullptr;
  24. Version version = Version::NONE;
  25. bool loadingGamestate = false;
  26. bool reverseEndianness = false; //if source has different endianness than us, we reverse bytes
  27. BinaryDeserializer(IBinaryReader * r)
  28. : reader(r)
  29. {
  30. }
  31. template<class T>
  32. BinaryDeserializer & operator&(T & t)
  33. {
  34. this->load(t);
  35. return *this;
  36. }
  37. void clear()
  38. {
  39. loadedPointers.clear();
  40. loadedSharedPointers.clear();
  41. loadedUniquePointers.clear();
  42. }
  43. bool hasFeature(Version v) const
  44. {
  45. return version >= v;
  46. }
  47. private:
  48. static constexpr bool trackSerializedPointers = true;
  49. std::vector<std::string> loadedStrings;
  50. std::map<uint32_t, Serializeable *> loadedPointers;
  51. std::set<Serializeable *> loadedUniquePointers;
  52. std::map<const Serializeable *, std::shared_ptr<Serializeable>> loadedSharedPointers;
  53. IBinaryReader * reader;
  54. uint32_t readAndCheckLength()
  55. {
  56. uint32_t length;
  57. load(length);
  58. //NOTE: also used for h3m's embedded in campaigns, so it may be quite large in some cases (e.g. XXL maps with multiple objects)
  59. if(length > 1000000)
  60. {
  61. logGlobal->warn("Warning: very big length: %d", length);
  62. };
  63. return length;
  64. }
  65. void read(void * data, unsigned size)
  66. {
  67. auto bytePtr = reinterpret_cast<std::byte *>(data);
  68. reader->read(bytePtr, size);
  69. if(reverseEndianness)
  70. std::reverse(bytePtr, bytePtr + size);
  71. };
  72. int64_t loadEncodedInteger()
  73. {
  74. uint64_t valueUnsigned = 0;
  75. uint_fast8_t offset = 0;
  76. for(;;)
  77. {
  78. uint8_t byteValue;
  79. load(byteValue);
  80. if((byteValue & 0x80) != 0)
  81. {
  82. valueUnsigned |= static_cast<uint64_t>(byteValue & 0x7f) << offset;
  83. offset += 7;
  84. }
  85. else
  86. {
  87. valueUnsigned |= static_cast<uint64_t>(byteValue & 0x3f) << offset;
  88. bool isNegative = (byteValue & 0x40) != 0;
  89. if(isNegative)
  90. return -static_cast<int64_t>(valueUnsigned);
  91. else
  92. return valueUnsigned;
  93. }
  94. }
  95. }
  96. template<class T, typename std::enable_if_t<std::is_floating_point_v<T>, int> = 0>
  97. void load(T & data)
  98. {
  99. this->read(static_cast<void *>(&data), sizeof(data));
  100. }
  101. template<class T, typename std::enable_if_t<std::is_integral_v<T> && !std::is_same_v<T, bool>, int> = 0>
  102. void load(T & data)
  103. {
  104. if constexpr(sizeof(T) == 1)
  105. {
  106. this->read(static_cast<void *>(&data), sizeof(data));
  107. }
  108. else
  109. {
  110. static_assert(!std::is_same_v<uint64_t, T>, "Serialization of unsigned 64-bit value may not work in some cases");
  111. data = loadEncodedInteger();
  112. }
  113. }
  114. template<typename T, typename std::enable_if_t<is_serializeable<BinaryDeserializer, T>::value, int> = 0>
  115. void load(T & data)
  116. {
  117. ////that const cast is evil because it allows to implicitly overwrite const objects when deserializing
  118. typedef typename std::remove_const_t<T> nonConstT;
  119. auto & hlp = const_cast<nonConstT &>(data);
  120. if constexpr(std::is_base_of_v<IGameInfoCallback, std::remove_pointer_t<nonConstT>>)
  121. {
  122. cb = &data;
  123. }
  124. hlp.serialize(*this);
  125. }
  126. template<typename T, typename std::enable_if_t<std::is_array_v<T>, int> = 0>
  127. void load(T & data)
  128. {
  129. uint32_t size = std::size(data);
  130. for(uint32_t i = 0; i < size; i++)
  131. load(data[i]);
  132. }
  133. void load(Version & data)
  134. {
  135. this->read(static_cast<void *>(&data), sizeof(data));
  136. }
  137. void load(BonusType & data)
  138. {
  139. int32_t read;
  140. load(read);
  141. if (!hasFeature(Version::RANDOMIZATION_REWORK))
  142. read += 1;
  143. data = static_cast<BonusType>(read);
  144. }
  145. template<typename T, typename std::enable_if_t<std::is_enum_v<T>, int> = 0>
  146. void load(T & data)
  147. {
  148. int32_t read;
  149. load(read);
  150. data = static_cast<T>(read);
  151. }
  152. template<typename T, typename std::enable_if_t<std::is_same_v<T, bool>, int> = 0>
  153. void load(T & data)
  154. {
  155. uint8_t read;
  156. load(read);
  157. assert(read == 0 || read == 1);
  158. data = static_cast<bool>(read);
  159. }
  160. template<typename T, typename std::enable_if_t<!std::is_same_v<T, bool>, int> = 0>
  161. void load(std::vector<T> & data)
  162. {
  163. uint32_t length = readAndCheckLength();
  164. if constexpr(std::is_base_of_v<GameCallbackHolder, T>)
  165. data.resize(length, T(cb));
  166. else
  167. data.resize(length);
  168. for(uint32_t i=0;i<length;i++)
  169. load( data[i]);
  170. }
  171. template <typename T, size_t N>
  172. void load(boost::container::small_vector<T, N>& data)
  173. {
  174. uint32_t length = readAndCheckLength();
  175. data.resize(length);
  176. for (uint32_t i = 0; i < length; i++)
  177. load(data[i]);
  178. }
  179. template<typename T>
  180. void loadRawPointer(T & data)
  181. {
  182. bool isNull;
  183. load(isNull);
  184. if(isNull)
  185. {
  186. data = nullptr;
  187. return;
  188. }
  189. uint32_t pid = 0xffffffff; //pointer id (or maybe rather pointee id)
  190. if(trackSerializedPointers)
  191. {
  192. load(pid); //get the id
  193. auto i = loadedPointers.find(pid); //lookup
  194. if(i != loadedPointers.end())
  195. {
  196. // We already got this pointer
  197. // Cast it in case we are loading it to a non-first base pointer
  198. data = dynamic_cast<T>(i->second);
  199. if (vstd::contains(loadedUniquePointers, data))
  200. throw std::runtime_error("Attempt to deserialize duplicated unique_ptr!");
  201. return;
  202. }
  203. }
  204. //get type id
  205. uint16_t tid;
  206. load(tid);
  207. typedef typename std::remove_pointer_t<T> npT;
  208. typedef typename std::remove_const_t<npT> ncpT;
  209. if(!tid)
  210. {
  211. data = ClassObjectCreator<ncpT>::invoke(cb);
  212. ptrAllocated(data, pid);
  213. load(*data);
  214. }
  215. else
  216. {
  217. auto * app = CSerializationApplier::getInstance().getApplier(tid);
  218. if(app == nullptr)
  219. {
  220. logGlobal->error("load %d %d - no loader exists", tid, pid);
  221. data = nullptr;
  222. return;
  223. }
  224. auto createdPtr = app->createPtr(*this, cb);
  225. auto dataNonConst = dynamic_cast<ncpT *>(createdPtr);
  226. assert(createdPtr);
  227. assert(dataNonConst);
  228. data = dataNonConst;
  229. ptrAllocated(data, pid);
  230. app->loadPtr(*this, cb, dataNonConst);
  231. }
  232. }
  233. template<typename T>
  234. void ptrAllocated(T * ptr, uint32_t pid)
  235. {
  236. if(trackSerializedPointers && pid != 0xffffffff)
  237. loadedPointers[pid] = const_cast<Serializeable*>(dynamic_cast<const Serializeable*>(ptr)); //add loaded pointer to our lookup map; cast is to avoid errors with const T* pt
  238. }
  239. template<typename T>
  240. void load(std::shared_ptr<T> & data)
  241. {
  242. typedef typename std::remove_const_t<T> NonConstT;
  243. NonConstT * internalPtr;
  244. loadRawPointer(internalPtr);
  245. const auto * internalPtrDerived = static_cast<Serializeable *>(internalPtr);
  246. if(internalPtr)
  247. {
  248. auto itr = loadedSharedPointers.find(internalPtrDerived);
  249. if(itr != loadedSharedPointers.end())
  250. {
  251. // This pointers is already loaded. The "data" needs to be pointed to it,
  252. // so their shared state is actually shared.
  253. data = std::dynamic_pointer_cast<T>(itr->second);
  254. }
  255. else
  256. {
  257. auto hlp = std::shared_ptr<NonConstT>(internalPtr);
  258. data = hlp;
  259. loadedSharedPointers[internalPtrDerived] = std::static_pointer_cast<Serializeable>(hlp);
  260. }
  261. }
  262. else
  263. data.reset();
  264. }
  265. void load(std::monostate & data)
  266. {
  267. // no-op
  268. }
  269. template<typename T>
  270. void load(std::shared_ptr<const T> & data)
  271. {
  272. std::shared_ptr<T> nonConstData;
  273. load(nonConstData);
  274. data = nonConstData;
  275. }
  276. template<typename T>
  277. void load(std::unique_ptr<T> & data)
  278. {
  279. T * internalPtr;
  280. loadRawPointer(internalPtr);
  281. data.reset(internalPtr);
  282. if (internalPtr != nullptr)
  283. loadedUniquePointers.insert(internalPtr);
  284. }
  285. template<typename T, size_t N>
  286. void load(std::array<T, N> & data)
  287. {
  288. for(uint32_t i = 0; i < N; i++)
  289. load(data[i]);
  290. }
  291. template<typename T>
  292. void load(std::set<T> & data)
  293. {
  294. uint32_t length = readAndCheckLength();
  295. data.clear();
  296. T ins;
  297. for(uint32_t i = 0; i < length; i++)
  298. {
  299. load(ins);
  300. data.insert(ins);
  301. }
  302. }
  303. template <typename T, typename U>
  304. void load(std::unordered_set<T, U> &data)
  305. {
  306. uint32_t length = readAndCheckLength();
  307. data.clear();
  308. T ins;
  309. for(uint32_t i = 0; i < length; i++)
  310. {
  311. load(ins);
  312. data.insert(ins);
  313. }
  314. }
  315. template<typename T1, typename T2>
  316. void load(std::pair<T1, T2> & data)
  317. {
  318. load(data.first);
  319. load(data.second);
  320. }
  321. template<typename T1, typename T2>
  322. void load(std::unordered_map<T1, T2> & data)
  323. {
  324. uint32_t length = readAndCheckLength();
  325. data.clear();
  326. T1 key;
  327. for(uint32_t i = 0; i < length; i++)
  328. {
  329. load(key);
  330. load(data[key]);
  331. }
  332. }
  333. template<typename T1, typename T2>
  334. void load(std::map<T1, T2> & data)
  335. {
  336. uint32_t length = readAndCheckLength();
  337. data.clear();
  338. T1 key;
  339. for(uint32_t i = 0; i < length; i++)
  340. {
  341. load(key);
  342. if constexpr(std::is_base_of_v<GameCallbackHolder, T2>)
  343. {
  344. data.try_emplace(key, cb);
  345. load(data.at(key));
  346. }
  347. else
  348. load(data[key]);
  349. }
  350. }
  351. void load(std::string & data)
  352. {
  353. int32_t length;
  354. load(length);
  355. if(length < 0)
  356. {
  357. int32_t stringID = -length - 1; // -1, -2 ... -> 0, 1 ...
  358. data = loadedStrings[stringID];
  359. }
  360. if(length == 0)
  361. {
  362. data = {};
  363. }
  364. if(length > 0)
  365. {
  366. data.resize(length);
  367. this->read(static_cast<void *>(data.data()), length);
  368. loadedStrings.push_back(data);
  369. }
  370. }
  371. template<typename... TN>
  372. void load(std::variant<TN...> & data)
  373. {
  374. int32_t which;
  375. load(which);
  376. assert(which < sizeof...(TN));
  377. // Create array of variants that contains all default-constructed alternatives
  378. const std::variant<TN...> table[] = { TN{ }... };
  379. // use appropriate alternative for result
  380. data = table[which];
  381. // perform actual load via std::visit dispatch
  382. std::visit([&](auto& o) { load(o); }, data);
  383. }
  384. template<typename T>
  385. void load(std::optional<T> & data)
  386. {
  387. uint8_t present;
  388. load(present);
  389. if(present)
  390. {
  391. //TODO: replace with emplace once we start request Boost 1.56+, see PR360
  392. T t;
  393. load(t);
  394. data = std::make_optional(std::move(t));
  395. }
  396. else
  397. {
  398. data = std::optional<T>();
  399. }
  400. }
  401. template<std::size_t T>
  402. void load(std::bitset<T> & data)
  403. {
  404. static_assert(T <= 64);
  405. if constexpr(T <= 16)
  406. {
  407. uint16_t read;
  408. load(read);
  409. data = read;
  410. }
  411. else if constexpr(T <= 32)
  412. {
  413. uint32_t read;
  414. load(read);
  415. data = read;
  416. }
  417. else if constexpr(T <= 64)
  418. {
  419. uint64_t read;
  420. load(read);
  421. data = read;
  422. }
  423. }
  424. };
  425. VCMI_LIB_NAMESPACE_END