BinaryDeserializer.h 12 KB

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