BinaryDeserializer.h 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537
  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->getCommander());
  64. data = hero->getCommander();
  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. data = loadEncodedInteger();
  143. }
  144. }
  145. template < typename T, typename std::enable_if_t < is_serializeable<BinaryDeserializer, T>::value, int > = 0 >
  146. void load(T &data)
  147. {
  148. ////that const cast is evil because it allows to implicitly overwrite const objects when deserializing
  149. typedef typename std::remove_const_t<T> nonConstT;
  150. auto & hlp = const_cast<nonConstT &>(data);
  151. hlp.serialize(*this);
  152. }
  153. template < typename T, typename std::enable_if_t < std::is_array_v<T>, int > = 0 >
  154. void load(T &data)
  155. {
  156. uint32_t size = std::size(data);
  157. for(uint32_t i = 0; i < size; i++)
  158. load(data[i]);
  159. }
  160. void load(Version &data)
  161. {
  162. this->read(static_cast<void *>(&data), sizeof(data), reverseEndianness);
  163. }
  164. template < typename T, typename std::enable_if_t < std::is_enum_v<T>, int > = 0 >
  165. void load(T &data)
  166. {
  167. int32_t read;
  168. load( read );
  169. data = static_cast<T>(read);
  170. }
  171. template < typename T, typename std::enable_if_t < std::is_same_v<T, bool>, int > = 0 >
  172. void load(T &data)
  173. {
  174. uint8_t read;
  175. load( read );
  176. data = static_cast<bool>(read);
  177. }
  178. template <typename T, typename std::enable_if_t < !std::is_same_v<T, bool >, int > = 0>
  179. void load(std::vector<T> &data)
  180. {
  181. uint32_t length = readAndCheckLength();
  182. data.resize(length);
  183. for(uint32_t i=0;i<length;i++)
  184. load( data[i]);
  185. }
  186. template <typename T, size_t N>
  187. void load(boost::container::small_vector<T, N>& data)
  188. {
  189. uint32_t length = readAndCheckLength();
  190. data.resize(length);
  191. for (uint32_t i = 0; i < length; i++)
  192. load(data[i]);
  193. }
  194. template <typename T, typename std::enable_if_t < !std::is_same_v<T, bool >, int > = 0>
  195. void load(std::deque<T> & data)
  196. {
  197. uint32_t length = readAndCheckLength();
  198. data.resize(length);
  199. for(uint32_t i = 0; i < length; i++)
  200. load(data[i]);
  201. }
  202. template < typename T, typename std::enable_if_t < std::is_pointer_v<T>, int > = 0 >
  203. void load(T &data)
  204. {
  205. bool isNull;
  206. load( isNull );
  207. if(isNull)
  208. {
  209. data = nullptr;
  210. return;
  211. }
  212. if(reader->smartVectorMembersSerialization)
  213. {
  214. typedef typename std::remove_const_t<typename std::remove_pointer_t<T>> TObjectType; //eg: const CGHeroInstance * => CGHeroInstance
  215. typedef typename VectorizedTypeFor<TObjectType>::type VType; //eg: CGHeroInstance -> CGobjectInstance
  216. typedef typename VectorizedIDType<TObjectType>::type IDType;
  217. if(const auto *info = reader->getVectorizedTypeInfo<VType, IDType>())
  218. {
  219. IDType id;
  220. load(id);
  221. if(id != IDType(-1))
  222. {
  223. data = static_cast<T>(reader->getVectorItemFromId<VType, IDType>(*info, id));
  224. return;
  225. }
  226. }
  227. }
  228. if(reader->sendStackInstanceByIds)
  229. {
  230. bool gotLoaded = loadIfStackInstance<void>(data);
  231. if(gotLoaded)
  232. return;
  233. }
  234. uint32_t pid = 0xffffffff; //pointer id (or maybe rather pointee id)
  235. if(trackSerializedPointers)
  236. {
  237. load( pid ); //get the id
  238. auto i = loadedPointers.find(pid); //lookup
  239. if(i != loadedPointers.end())
  240. {
  241. // We already got this pointer
  242. // Cast it in case we are loading it to a non-first base pointer
  243. data = dynamic_cast<T>(i->second);
  244. return;
  245. }
  246. }
  247. //get type id
  248. uint16_t tid;
  249. load( tid );
  250. typedef typename std::remove_pointer_t<T> npT;
  251. typedef typename std::remove_const_t<npT> ncpT;
  252. if(!tid)
  253. {
  254. data = ClassObjectCreator<ncpT>::invoke(cb);
  255. ptrAllocated(data, pid);
  256. load(*data);
  257. }
  258. else
  259. {
  260. auto * app = CSerializationApplier::getInstance().getApplier(tid);
  261. if(app == nullptr)
  262. {
  263. logGlobal->error("load %d %d - no loader exists", tid, pid);
  264. data = nullptr;
  265. return;
  266. }
  267. auto dataNonConst = dynamic_cast<ncpT*>(app->createPtr(*this, cb));
  268. data = dataNonConst;
  269. ptrAllocated(data, pid);
  270. app->loadPtr(*this, cb, dataNonConst);
  271. }
  272. }
  273. template <typename T>
  274. void ptrAllocated(T *ptr, uint32_t pid)
  275. {
  276. if(trackSerializedPointers && pid != 0xffffffff)
  277. 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
  278. }
  279. template <typename T>
  280. void load(std::shared_ptr<T> &data)
  281. {
  282. typedef typename std::remove_const_t<T> NonConstT;
  283. NonConstT *internalPtr;
  284. load(internalPtr);
  285. const auto * internalPtrDerived = static_cast<Serializeable*>(internalPtr);
  286. if(internalPtr)
  287. {
  288. auto itr = loadedSharedPointers.find(internalPtrDerived);
  289. if(itr != loadedSharedPointers.end())
  290. {
  291. // This pointers is already loaded. The "data" needs to be pointed to it,
  292. // so their shared state is actually shared.
  293. data = std::dynamic_pointer_cast<T>(itr->second);
  294. }
  295. else
  296. {
  297. auto hlp = std::shared_ptr<NonConstT>(internalPtr);
  298. data = hlp;
  299. loadedSharedPointers[internalPtrDerived] = std::static_pointer_cast<Serializeable>(hlp);
  300. }
  301. }
  302. else
  303. data.reset();
  304. }
  305. void load(std::monostate & data)
  306. {
  307. // no-op
  308. }
  309. template <typename T>
  310. void load(std::shared_ptr<const T> & data)
  311. {
  312. std::shared_ptr<T> nonConstData;
  313. load(nonConstData);
  314. data = nonConstData;
  315. }
  316. template <typename T>
  317. void load(std::unique_ptr<T> &data)
  318. {
  319. T *internalPtr;
  320. load( internalPtr );
  321. data.reset(internalPtr);
  322. }
  323. template <typename T, size_t N>
  324. void load(std::array<T, N> &data)
  325. {
  326. for(uint32_t i = 0; i < N; i++)
  327. load( data[i] );
  328. }
  329. template <typename T>
  330. void load(std::set<T> &data)
  331. {
  332. uint32_t length = readAndCheckLength();
  333. data.clear();
  334. T ins;
  335. for(uint32_t i=0;i<length;i++)
  336. {
  337. load( ins );
  338. data.insert(ins);
  339. }
  340. }
  341. template <typename T, typename U>
  342. void load(std::unordered_set<T, U> &data)
  343. {
  344. uint32_t length = readAndCheckLength();
  345. data.clear();
  346. T ins;
  347. for(uint32_t i=0;i<length;i++)
  348. {
  349. load(ins);
  350. data.insert(ins);
  351. }
  352. }
  353. template <typename T>
  354. void load(std::list<T> &data)
  355. {
  356. uint32_t length = readAndCheckLength();
  357. data.clear();
  358. T ins;
  359. for(uint32_t i=0;i<length;i++)
  360. {
  361. load(ins);
  362. data.push_back(ins);
  363. }
  364. }
  365. template <typename T1, typename T2>
  366. void load(std::pair<T1,T2> &data)
  367. {
  368. load(data.first);
  369. load(data.second);
  370. }
  371. template <typename T1, typename T2>
  372. void load(std::unordered_map<T1,T2> &data)
  373. {
  374. uint32_t length = readAndCheckLength();
  375. data.clear();
  376. T1 key;
  377. for(uint32_t i=0;i<length;i++)
  378. {
  379. load(key);
  380. load(data[key]);
  381. }
  382. }
  383. template <typename T1, typename T2>
  384. void load(std::map<T1,T2> &data)
  385. {
  386. uint32_t length = readAndCheckLength();
  387. data.clear();
  388. T1 key;
  389. for(uint32_t i=0;i<length;i++)
  390. {
  391. load(key);
  392. load(data[key]);
  393. }
  394. }
  395. void load(std::string &data)
  396. {
  397. int32_t length;
  398. load(length);
  399. if (length < 0)
  400. {
  401. int32_t stringID = -length - 1; // -1, -2 ... -> 0, 1 ...
  402. data = loadedStrings[stringID];
  403. }
  404. if (length == 0)
  405. {
  406. data = {};
  407. }
  408. if (length > 0)
  409. {
  410. data.resize(length);
  411. this->read(static_cast<void *>(data.data()), length, false);
  412. loadedStrings.push_back(data);
  413. }
  414. }
  415. template<typename... TN>
  416. void load(std::variant<TN...> & data)
  417. {
  418. int32_t which;
  419. load( which );
  420. assert(which < sizeof...(TN));
  421. // Create array of variants that contains all default-constructed alternatives
  422. const std::variant<TN...> table[] = { TN{ }... };
  423. // use appropriate alternative for result
  424. data = table[which];
  425. // perform actual load via std::visit dispatch
  426. std::visit([&](auto& o) { load(o); }, data);
  427. }
  428. template<typename T>
  429. void load(std::optional<T> & data)
  430. {
  431. uint8_t present;
  432. load( present );
  433. if(present)
  434. {
  435. //TODO: replace with emplace once we start request Boost 1.56+, see PR360
  436. T t;
  437. load(t);
  438. data = std::make_optional(std::move(t));
  439. }
  440. else
  441. {
  442. data = std::optional<T>();
  443. }
  444. }
  445. template <typename T>
  446. void load(boost::multi_array<T, 3> & data)
  447. {
  448. uint32_t length = readAndCheckLength();
  449. uint32_t x;
  450. uint32_t y;
  451. uint32_t z;
  452. load(x);
  453. load(y);
  454. load(z);
  455. data.resize(boost::extents[x][y][z]);
  456. assert(length == data.num_elements()); //x*y*z should be equal to number of elements
  457. for(uint32_t i = 0; i < length; i++)
  458. load(data.data()[i]);
  459. }
  460. template <std::size_t T>
  461. void load(std::bitset<T> &data)
  462. {
  463. static_assert(T <= 64);
  464. if constexpr (T <= 16)
  465. {
  466. uint16_t read;
  467. load(read);
  468. data = read;
  469. }
  470. else if constexpr (T <= 32)
  471. {
  472. uint32_t read;
  473. load(read);
  474. data = read;
  475. }
  476. else if constexpr (T <= 64)
  477. {
  478. uint64_t read;
  479. load(read);
  480. data = read;
  481. }
  482. }
  483. };
  484. VCMI_LIB_NAMESPACE_END