BinaryDeserializer.h 12 KB

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