BinaryDeserializer.h 13 KB

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