BinaryDeserializer.h 12 KB

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