BinaryDeserializer.h 14 KB

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