BinaryDeserializer.h 12 KB

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