BinaryDeserializer.h 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518
  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 int read(void * data, unsigned size)
  23. {
  24. return reader->read(data, size);
  25. };
  26. };
  27. /// Main class for deserialization of classes from binary form
  28. /// Effectively revesed version of BinarySerializer
  29. class DLL_LINKAGE BinaryDeserializer : public CLoaderBase
  30. {
  31. template<typename Ser,typename T>
  32. struct LoadIfStackInstance
  33. {
  34. static bool invoke(Ser &s, T &data)
  35. {
  36. return false;
  37. }
  38. };
  39. template<typename Ser>
  40. struct LoadIfStackInstance<Ser, CStackInstance *>
  41. {
  42. static bool invoke(Ser &s, CStackInstance* &data)
  43. {
  44. CArmedInstance *armedObj;
  45. SlotID slot;
  46. s.load(armedObj);
  47. s.load(slot);
  48. if(slot != SlotID::COMMANDER_SLOT_PLACEHOLDER)
  49. {
  50. assert(armedObj->hasStackAtSlot(slot));
  51. data = armedObj->stacks[slot];
  52. }
  53. else
  54. {
  55. auto * hero = dynamic_cast<CGHeroInstance *>(armedObj);
  56. assert(hero);
  57. assert(hero->commander);
  58. data = hero->commander;
  59. }
  60. return true;
  61. }
  62. };
  63. template <typename T, typename Enable = void>
  64. struct ClassObjectCreator
  65. {
  66. static T *invoke(IGameCallback *cb)
  67. {
  68. static_assert(!std::is_base_of_v<GameCallbackHolder, T>, "Cannot call new upon map objects!");
  69. static_assert(!std::is_abstract_v<T>, "Cannot call new upon abstract classes!");
  70. return new T();
  71. }
  72. };
  73. template<typename T>
  74. struct ClassObjectCreator<T, typename std::enable_if_t<std::is_abstract_v<T>>>
  75. {
  76. static T *invoke(IGameCallback *cb)
  77. {
  78. throw std::runtime_error("Something went really wrong during deserialization. Attempted creating an object of an abstract class " + std::string(typeid(T).name()));
  79. }
  80. };
  81. template<typename T>
  82. struct ClassObjectCreator<T, typename std::enable_if_t<std::is_base_of_v<GameCallbackHolder, T> && !std::is_abstract_v<T>>>
  83. {
  84. static T *invoke(IGameCallback *cb)
  85. {
  86. static_assert(!std::is_abstract<T>::value, "Cannot call new upon abstract classes!");
  87. return new T(cb);
  88. }
  89. };
  90. STRONG_INLINE ui32 readAndCheckLength()
  91. {
  92. ui32 length;
  93. load(length);
  94. //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)
  95. if(length > 1000000)
  96. {
  97. logGlobal->warn("Warning: very big length: %d", length);
  98. reader->reportState(logGlobal);
  99. };
  100. return length;
  101. }
  102. template <typename Type> class CPointerLoader;
  103. class IPointerLoader
  104. {
  105. public:
  106. virtual void * loadPtr(CLoaderBase &ar, IGameCallback * cb, ui32 pid) const =0; //data is pointer to the ACTUAL POINTER
  107. virtual ~IPointerLoader() = default;
  108. template<typename Type> static IPointerLoader *getApplier(const Type * t = nullptr)
  109. {
  110. return new CPointerLoader<Type>();
  111. }
  112. };
  113. template <typename Type>
  114. class CPointerLoader : public IPointerLoader
  115. {
  116. public:
  117. void * loadPtr(CLoaderBase &ar, IGameCallback * cb, ui32 pid) const override //data is pointer to the ACTUAL POINTER
  118. {
  119. auto & s = static_cast<BinaryDeserializer &>(ar);
  120. //create new object under pointer
  121. Type * ptr = ClassObjectCreator<Type>::invoke(cb); //does new npT or throws for abstract classes
  122. s.ptrAllocated(ptr, pid);
  123. ptr->serialize(s);
  124. return static_cast<void*>(ptr);
  125. }
  126. };
  127. CApplier<IPointerLoader> applier;
  128. int write(const void * data, unsigned size);
  129. public:
  130. using Version = ESerializationVersion;
  131. bool reverseEndianess; //if source has different endianness than us, we reverse bytes
  132. Version version;
  133. std::map<ui32, void*> loadedPointers;
  134. std::map<const void*, std::shared_ptr<void>> loadedSharedPointers;
  135. IGameCallback * cb = nullptr;
  136. bool smartPointerSerialization;
  137. bool saving;
  138. BinaryDeserializer(IBinaryReader * r);
  139. template<class T>
  140. BinaryDeserializer & operator&(T & t)
  141. {
  142. this->load(t);
  143. return * this;
  144. }
  145. template < class T, typename std::enable_if < std::is_fundamental<T>::value && !std::is_same<T, bool>::value, int >::type = 0 >
  146. void load(T &data)
  147. {
  148. unsigned length = sizeof(data);
  149. char * dataPtr = reinterpret_cast<char *>(&data);
  150. this->read(dataPtr,length);
  151. if(reverseEndianess)
  152. std::reverse(dataPtr, dataPtr + length);
  153. }
  154. template < typename T, typename std::enable_if < is_serializeable<BinaryDeserializer, T>::value, int >::type = 0 >
  155. void load(T &data)
  156. {
  157. ////that const cast is evil because it allows to implicitly overwrite const objects when deserializing
  158. typedef typename std::remove_const<T>::type nonConstT;
  159. auto & hlp = const_cast<nonConstT &>(data);
  160. hlp.serialize(*this);
  161. }
  162. template < typename T, typename std::enable_if < std::is_array<T>::value, int >::type = 0 >
  163. void load(T &data)
  164. {
  165. ui32 size = std::size(data);
  166. for(ui32 i = 0; i < size; i++)
  167. load(data[i]);
  168. }
  169. template < typename T, typename std::enable_if < std::is_enum<T>::value, int >::type = 0 >
  170. void load(T &data)
  171. {
  172. si32 read;
  173. load( read );
  174. data = static_cast<T>(read);
  175. }
  176. template < typename T, typename std::enable_if < std::is_same<T, bool>::value, int >::type = 0 >
  177. void load(T &data)
  178. {
  179. ui8 read;
  180. load( read );
  181. data = static_cast<bool>(read);
  182. }
  183. template <typename T, typename std::enable_if < !std::is_same<T, bool >::value, int >::type = 0>
  184. void load(std::vector<T> &data)
  185. {
  186. ui32 length = readAndCheckLength();
  187. data.resize(length);
  188. for(ui32 i=0;i<length;i++)
  189. load( data[i]);
  190. }
  191. template < typename T, typename std::enable_if < std::is_pointer<T>::value, int >::type = 0 >
  192. void load(T &data)
  193. {
  194. bool isNull;
  195. load( isNull );
  196. if(isNull)
  197. {
  198. data = nullptr;
  199. return;
  200. }
  201. loadPointerImpl(data);
  202. }
  203. template < typename T, typename std::enable_if < std::is_base_of_v<Entity, std::remove_pointer_t<T>>, int >::type = 0 >
  204. void loadPointerImpl(T &data)
  205. {
  206. using DataType = std::remove_pointer_t<T>;
  207. typename DataType::IdentifierType index;
  208. load(index);
  209. auto * constEntity = index.toEntity(VLC);
  210. auto * constData = dynamic_cast<const DataType *>(constEntity);
  211. data = const_cast<DataType *>(constData);
  212. }
  213. template < typename T, typename std::enable_if < !std::is_base_of_v<Entity, std::remove_pointer_t<T>>, int >::type = 0 >
  214. void loadPointerImpl(T &data)
  215. {
  216. if(reader->smartVectorMembersSerialization)
  217. {
  218. typedef typename std::remove_const<typename std::remove_pointer<T>::type>::type 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<BinaryDeserializer,T>::invoke(* this, data);
  235. if(gotLoaded)
  236. return;
  237. }
  238. ui32 pid = 0xffffffff; //pointer id (or maybe rather pointee id)
  239. if(smartPointerSerialization)
  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 = static_cast<T>(i->second);
  248. return;
  249. }
  250. }
  251. //get type id
  252. ui16 tid;
  253. load( tid );
  254. if(!tid)
  255. {
  256. typedef typename std::remove_pointer<T>::type npT;
  257. typedef typename std::remove_const<npT>::type ncpT;
  258. data = ClassObjectCreator<ncpT>::invoke(cb);
  259. ptrAllocated(data, pid);
  260. load(*data);
  261. }
  262. else
  263. {
  264. auto * app = applier.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. data = static_cast<T>(app->loadPtr(*this, cb, pid));
  272. }
  273. }
  274. template <typename T>
  275. void ptrAllocated(const T *ptr, ui32 pid)
  276. {
  277. if(smartPointerSerialization && pid != 0xffffffff)
  278. loadedPointers[pid] = (void*)ptr; //add loaded pointer to our lookup map; cast is to avoid errors with const T* pt
  279. }
  280. template<typename Base, typename Derived> void registerType(const Base * b = nullptr, const Derived * d = nullptr)
  281. {
  282. applier.registerType(b, d);
  283. }
  284. template <typename T>
  285. void load(std::shared_ptr<T> &data)
  286. {
  287. typedef typename std::remove_const<T>::type NonConstT;
  288. NonConstT *internalPtr;
  289. load(internalPtr);
  290. void * internalPtrDerived = static_cast<void*>(internalPtr);
  291. if(internalPtr)
  292. {
  293. auto itr = loadedSharedPointers.find(internalPtrDerived);
  294. if(itr != loadedSharedPointers.end())
  295. {
  296. // This pointers is already loaded. The "data" needs to be pointed to it,
  297. // so their shared state is actually shared.
  298. data = std::static_pointer_cast<T>(itr->second);
  299. }
  300. else
  301. {
  302. auto hlp = std::shared_ptr<NonConstT>(internalPtr);
  303. data = hlp;
  304. loadedSharedPointers[internalPtrDerived] = std::static_pointer_cast<void>(hlp);
  305. }
  306. }
  307. else
  308. data.reset();
  309. }
  310. void load(std::monostate & data)
  311. {
  312. // no-op
  313. }
  314. template <typename T>
  315. void load(std::shared_ptr<const T> & data)
  316. {
  317. std::shared_ptr<T> nonConstData;
  318. load(nonConstData);
  319. data = nonConstData;
  320. }
  321. template <typename T>
  322. void load(std::unique_ptr<T> &data)
  323. {
  324. T *internalPtr;
  325. load( internalPtr );
  326. data.reset(internalPtr);
  327. }
  328. template <typename T, size_t N>
  329. void load(std::array<T, N> &data)
  330. {
  331. for(ui32 i = 0; i < N; i++)
  332. load( data[i] );
  333. }
  334. template <typename T>
  335. void load(std::set<T> &data)
  336. {
  337. ui32 length = readAndCheckLength();
  338. data.clear();
  339. T ins;
  340. for(ui32 i=0;i<length;i++)
  341. {
  342. load( ins );
  343. data.insert(ins);
  344. }
  345. }
  346. template <typename T, typename U>
  347. void load(std::unordered_set<T, U> &data)
  348. {
  349. ui32 length = readAndCheckLength();
  350. data.clear();
  351. T ins;
  352. for(ui32 i=0;i<length;i++)
  353. {
  354. load(ins);
  355. data.insert(ins);
  356. }
  357. }
  358. template <typename T>
  359. void load(std::list<T> &data)
  360. {
  361. ui32 length = readAndCheckLength();
  362. data.clear();
  363. T ins;
  364. for(ui32 i=0;i<length;i++)
  365. {
  366. load(ins);
  367. data.push_back(ins);
  368. }
  369. }
  370. template <typename T1, typename T2>
  371. void load(std::pair<T1,T2> &data)
  372. {
  373. load(data.first);
  374. load(data.second);
  375. }
  376. template <typename T1, typename T2>
  377. void load(std::map<T1,T2> &data)
  378. {
  379. ui32 length = readAndCheckLength();
  380. data.clear();
  381. T1 key;
  382. for(ui32 i=0;i<length;i++)
  383. {
  384. load(key);
  385. load(data[key]);
  386. }
  387. }
  388. void load(std::string &data)
  389. {
  390. ui32 length = readAndCheckLength();
  391. data.resize(length);
  392. this->read((void*)data.c_str(),length);
  393. }
  394. template<typename... TN>
  395. void load(std::variant<TN...> & data)
  396. {
  397. si32 which;
  398. load( which );
  399. assert(which < sizeof...(TN));
  400. // Create array of variants that contains all default-constructed alternatives
  401. const std::variant<TN...> table[] = { TN{ }... };
  402. // use appropriate alternative for result
  403. data = table[which];
  404. // perform actual load via std::visit dispatch
  405. std::visit([&](auto& o) { load(o); }, data);
  406. }
  407. template<typename T>
  408. void load(std::optional<T> & data)
  409. {
  410. ui8 present;
  411. load( present );
  412. if(present)
  413. {
  414. //TODO: replace with emplace once we start request Boost 1.56+, see PR360
  415. T t;
  416. load(t);
  417. data = std::make_optional(std::move(t));
  418. }
  419. else
  420. {
  421. data = std::optional<T>();
  422. }
  423. }
  424. template <typename T>
  425. void load(boost::multi_array<T, 3> & data)
  426. {
  427. ui32 length = readAndCheckLength();
  428. ui32 x;
  429. ui32 y;
  430. ui32 z;
  431. load(x);
  432. load(y);
  433. load(z);
  434. data.resize(boost::extents[x][y][z]);
  435. assert(length == data.num_elements()); //x*y*z should be equal to number of elements
  436. for(ui32 i = 0; i < length; i++)
  437. load(data.data()[i]);
  438. }
  439. template <std::size_t T>
  440. void load(std::bitset<T> &data)
  441. {
  442. static_assert(T <= 64);
  443. if constexpr (T <= 16)
  444. {
  445. uint16_t read;
  446. load(read);
  447. data = read;
  448. }
  449. else if constexpr (T <= 32)
  450. {
  451. uint32_t read;
  452. load(read);
  453. data = read;
  454. }
  455. else if constexpr (T <= 64)
  456. {
  457. uint64_t read;
  458. load(read);
  459. data = read;
  460. }
  461. }
  462. };
  463. VCMI_LIB_NAMESPACE_END