BinaryDeserializer.h 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533
  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()
  66. {
  67. static_assert(!std::is_abstract<T>::value, "Cannot call new upon abstract classes!");
  68. return new T();
  69. }
  70. };
  71. template<typename T>
  72. struct ClassObjectCreator<T, typename std::enable_if<std::is_abstract<T>::value>::type>
  73. {
  74. static T *invoke()
  75. {
  76. throw std::runtime_error("Something went really wrong during deserialization. Attempted creating an object of an abstract class " + std::string(typeid(T).name()));
  77. }
  78. };
  79. STRONG_INLINE ui32 readAndCheckLength()
  80. {
  81. ui32 length;
  82. load(length);
  83. //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)
  84. if(length > 1000000)
  85. {
  86. logGlobal->warn("Warning: very big length: %d", length);
  87. reader->reportState(logGlobal);
  88. };
  89. return length;
  90. }
  91. template <typename Type> class CPointerLoader;
  92. class IPointerLoader
  93. {
  94. public:
  95. virtual void * loadPtr(CLoaderBase &ar, ui32 pid) const =0; //data is pointer to the ACTUAL POINTER
  96. virtual ~IPointerLoader() = default;
  97. template<typename Type> static IPointerLoader *getApplier(const Type * t = nullptr)
  98. {
  99. return new CPointerLoader<Type>();
  100. }
  101. };
  102. template <typename Type>
  103. class CPointerLoader : public IPointerLoader
  104. {
  105. public:
  106. void * loadPtr(CLoaderBase &ar, ui32 pid) const override //data is pointer to the ACTUAL POINTER
  107. {
  108. auto & s = static_cast<BinaryDeserializer &>(ar);
  109. //create new object under pointer
  110. Type * ptr = ClassObjectCreator<Type>::invoke(); //does new npT or throws for abstract classes
  111. s.ptrAllocated(ptr, pid);
  112. assert(s.fileVersion != 0);
  113. ptr->serialize(s,s.fileVersion);
  114. return static_cast<void*>(ptr);
  115. }
  116. };
  117. CApplier<IPointerLoader> applier;
  118. int write(const void * data, unsigned size);
  119. public:
  120. bool reverseEndianess; //if source has different endianness than us, we reverse bytes
  121. si32 fileVersion;
  122. std::map<ui32, void*> loadedPointers;
  123. std::map<ui32, const std::type_info*> loadedPointersTypes;
  124. std::map<const void*, std::shared_ptr<void>> loadedSharedPointers;
  125. bool smartPointerSerialization;
  126. bool saving;
  127. BinaryDeserializer(IBinaryReader * r);
  128. template<class T>
  129. BinaryDeserializer & operator&(T & t)
  130. {
  131. this->load(t);
  132. return * this;
  133. }
  134. template < class T, typename std::enable_if < std::is_fundamental<T>::value && !std::is_same<T, bool>::value, int >::type = 0 >
  135. void load(T &data)
  136. {
  137. unsigned length = sizeof(data);
  138. char * dataPtr = reinterpret_cast<char *>(&data);
  139. this->read(dataPtr,length);
  140. if(reverseEndianess)
  141. std::reverse(dataPtr, dataPtr + length);
  142. }
  143. template < typename T, typename std::enable_if < is_serializeable<BinaryDeserializer, T>::value, int >::type = 0 >
  144. void load(T &data)
  145. {
  146. assert( fileVersion != 0 );
  147. ////that const cast is evil because it allows to implicitly overwrite const objects when deserializing
  148. typedef typename std::remove_const<T>::type nonConstT;
  149. auto & hlp = const_cast<nonConstT &>(data);
  150. hlp.serialize(*this,fileVersion);
  151. }
  152. template < typename T, typename std::enable_if < std::is_array<T>::value, int >::type = 0 >
  153. void load(T &data)
  154. {
  155. ui32 size = std::size(data);
  156. for(ui32 i = 0; i < size; i++)
  157. load(data[i]);
  158. }
  159. template < typename T, typename std::enable_if < std::is_enum<T>::value, int >::type = 0 >
  160. void load(T &data)
  161. {
  162. si32 read;
  163. load( read );
  164. data = static_cast<T>(read);
  165. }
  166. template < typename T, typename std::enable_if < std::is_same<T, bool>::value, int >::type = 0 >
  167. void load(T &data)
  168. {
  169. ui8 read;
  170. load( read );
  171. data = static_cast<bool>(read);
  172. }
  173. template < typename T, typename std::enable_if < std::is_same<T, std::vector<bool> >::value, int >::type = 0 >
  174. void load(T & data)
  175. {
  176. std::vector<ui8> convData;
  177. load(convData);
  178. convData.resize(data.size());
  179. range::copy(convData, data.begin());
  180. }
  181. template <typename T, typename std::enable_if < !std::is_same<T, bool >::value, int >::type = 0>
  182. void load(std::vector<T> &data)
  183. {
  184. ui32 length = readAndCheckLength();
  185. data.resize(length);
  186. for(ui32 i=0;i<length;i++)
  187. load( data[i]);
  188. }
  189. template < typename T, typename std::enable_if < std::is_pointer<T>::value, int >::type = 0 >
  190. void load(T &data)
  191. {
  192. bool isNull;
  193. load( isNull );
  194. if(isNull)
  195. {
  196. data = nullptr;
  197. return;
  198. }
  199. loadPointerImpl(data);
  200. }
  201. template < typename T, typename std::enable_if < std::is_base_of_v<Entity, std::remove_pointer_t<T>>, int >::type = 0 >
  202. void loadPointerImpl(T &data)
  203. {
  204. using DataType = std::remove_pointer_t<T>;
  205. typename DataType::IdentifierType index;
  206. load(index);
  207. auto * constEntity = index.toEntity(VLC);
  208. auto * constData = dynamic_cast<const DataType *>(constEntity);
  209. data = const_cast<DataType *>(constData);
  210. }
  211. template < typename T, typename std::enable_if < !std::is_base_of_v<Entity, std::remove_pointer_t<T>>, int >::type = 0 >
  212. void loadPointerImpl(T &data)
  213. {
  214. if(reader->smartVectorMembersSerialization)
  215. {
  216. typedef typename std::remove_const<typename std::remove_pointer<T>::type>::type TObjectType; //eg: const CGHeroInstance * => CGHeroInstance
  217. typedef typename VectorizedTypeFor<TObjectType>::type VType; //eg: CGHeroInstance -> CGobjectInstance
  218. typedef typename VectorizedIDType<TObjectType>::type IDType;
  219. if(const auto *info = reader->getVectorizedTypeInfo<VType, IDType>())
  220. {
  221. IDType id;
  222. load(id);
  223. if(id != IDType(-1))
  224. {
  225. data = static_cast<T>(reader->getVectorItemFromId<VType, IDType>(*info, id));
  226. return;
  227. }
  228. }
  229. }
  230. if(reader->sendStackInstanceByIds)
  231. {
  232. bool gotLoaded = LoadIfStackInstance<BinaryDeserializer,T>::invoke(* this, data);
  233. if(gotLoaded)
  234. return;
  235. }
  236. ui32 pid = 0xffffffff; //pointer id (or maybe rather pointee id)
  237. if(smartPointerSerialization)
  238. {
  239. load( pid ); //get the id
  240. auto i = loadedPointers.find(pid); //lookup
  241. if(i != loadedPointers.end())
  242. {
  243. // We already got this pointer
  244. // Cast it in case we are loading it to a non-first base pointer
  245. assert(loadedPointersTypes.count(pid));
  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();
  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. {
  278. loadedPointersTypes[pid] = &typeid(T);
  279. loadedPointers[pid] = (void*)ptr; //add loaded pointer to our lookup map; cast is to avoid errors with const T* pt
  280. }
  281. }
  282. template<typename Base, typename Derived> void registerType(const Base * b = nullptr, const Derived * d = nullptr)
  283. {
  284. applier.registerType(b, d);
  285. }
  286. template <typename T>
  287. void load(std::shared_ptr<T> &data)
  288. {
  289. typedef typename std::remove_const<T>::type NonConstT;
  290. NonConstT *internalPtr;
  291. load(internalPtr);
  292. void * internalPtrDerived = static_cast<void*>(internalPtr);
  293. if(internalPtr)
  294. {
  295. auto itr = loadedSharedPointers.find(internalPtrDerived);
  296. if(itr != loadedSharedPointers.end())
  297. {
  298. // This pointers is already loaded. The "data" needs to be pointed to it,
  299. // so their shared state is actually shared.
  300. data = std::static_pointer_cast<T>(itr->second);
  301. }
  302. else
  303. {
  304. auto hlp = std::shared_ptr<NonConstT>(internalPtr);
  305. data = hlp;
  306. loadedSharedPointers[internalPtrDerived] = std::static_pointer_cast<void>(hlp);
  307. }
  308. }
  309. else
  310. data.reset();
  311. }
  312. void load(std::monostate & data)
  313. {
  314. // no-op
  315. }
  316. template <typename T>
  317. void load(std::shared_ptr<const T> & data)
  318. {
  319. std::shared_ptr<T> nonConstData;
  320. load(nonConstData);
  321. data = nonConstData;
  322. }
  323. template <typename T>
  324. void load(std::unique_ptr<T> &data)
  325. {
  326. T *internalPtr;
  327. load( internalPtr );
  328. data.reset(internalPtr);
  329. }
  330. template <typename T, size_t N>
  331. void load(std::array<T, N> &data)
  332. {
  333. for(ui32 i = 0; i < N; i++)
  334. load( data[i] );
  335. }
  336. template <typename T>
  337. void load(std::set<T> &data)
  338. {
  339. ui32 length = readAndCheckLength();
  340. data.clear();
  341. T ins;
  342. for(ui32 i=0;i<length;i++)
  343. {
  344. load( ins );
  345. data.insert(ins);
  346. }
  347. }
  348. template <typename T, typename U>
  349. void load(std::unordered_set<T, U> &data)
  350. {
  351. ui32 length = readAndCheckLength();
  352. data.clear();
  353. T ins;
  354. for(ui32 i=0;i<length;i++)
  355. {
  356. load(ins);
  357. data.insert(ins);
  358. }
  359. }
  360. template <typename T>
  361. void load(std::list<T> &data)
  362. {
  363. ui32 length = readAndCheckLength();
  364. data.clear();
  365. T ins;
  366. for(ui32 i=0;i<length;i++)
  367. {
  368. load(ins);
  369. data.push_back(ins);
  370. }
  371. }
  372. template <typename T1, typename T2>
  373. void load(std::pair<T1,T2> &data)
  374. {
  375. load(data.first);
  376. load(data.second);
  377. }
  378. template <typename T1, typename T2>
  379. void load(std::map<T1,T2> &data)
  380. {
  381. ui32 length = readAndCheckLength();
  382. data.clear();
  383. T1 key;
  384. T2 value;
  385. for(ui32 i=0;i<length;i++)
  386. {
  387. load(key);
  388. load(value);
  389. data.insert(std::pair<T1, T2>(std::move(key), std::move(value)));
  390. }
  391. }
  392. template <typename T1, typename T2>
  393. void load(std::multimap<T1, T2> &data)
  394. {
  395. ui32 length = readAndCheckLength();
  396. data.clear();
  397. T1 key;
  398. T2 value;
  399. for(ui32 i = 0; i < length; i++)
  400. {
  401. load(key);
  402. load(value);
  403. data.insert(std::pair<T1, T2>(std::move(key), std::move(value)));
  404. }
  405. }
  406. void load(std::string &data)
  407. {
  408. ui32 length = readAndCheckLength();
  409. data.resize(length);
  410. this->read((void*)data.c_str(),length);
  411. }
  412. template<typename... TN>
  413. void load(std::variant<TN...> & data)
  414. {
  415. si32 which;
  416. load( which );
  417. assert(which < sizeof...(TN));
  418. // Create array of variants that contains all default-constructed alternatives
  419. const std::variant<TN...> table[] = { TN{ }... };
  420. // use appropriate alternative for result
  421. data = table[which];
  422. // perform actual load via std::visit dispatch
  423. std::visit([&](auto& o) { load(o); }, data);
  424. }
  425. template<typename T>
  426. void load(std::optional<T> & data)
  427. {
  428. ui8 present;
  429. load( present );
  430. if(present)
  431. {
  432. //TODO: replace with emplace once we start request Boost 1.56+, see PR360
  433. T t;
  434. load(t);
  435. data = std::make_optional(std::move(t));
  436. }
  437. else
  438. {
  439. data = std::optional<T>();
  440. }
  441. }
  442. template <typename T>
  443. void load(boost::multi_array<T, 3> & data)
  444. {
  445. ui32 length = readAndCheckLength();
  446. ui32 x, y, z;
  447. load(x);
  448. load(y);
  449. load(z);
  450. data.resize(boost::extents[x][y][z]);
  451. assert(length == data.num_elements()); //x*y*z should be equal to number of elements
  452. for(ui32 i = 0; i < length; i++)
  453. load(data.data()[i]);
  454. }
  455. template <std::size_t T>
  456. void load(std::bitset<T> &data)
  457. {
  458. static_assert(T <= 64);
  459. if constexpr (T <= 16)
  460. {
  461. uint16_t read;
  462. load(read);
  463. data = read;
  464. }
  465. else if constexpr (T <= 32)
  466. {
  467. uint32_t read;
  468. load(read);
  469. data = read;
  470. }
  471. else if constexpr (T <= 64)
  472. {
  473. uint64_t read;
  474. load(read);
  475. data = read;
  476. }
  477. }
  478. };
  479. VCMI_LIB_NAMESPACE_END