BinaryDeserializer.h 12 KB

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