AIUtility.h 7.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306
  1. /*
  2. * AIUtility.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. // Check windows
  12. #if _WIN32 || _WIN64
  13. #if _WIN64
  14. #define ENVIRONMENT64
  15. #else
  16. #define ENVIRONMENT32
  17. #endif
  18. #endif
  19. // Check GCC
  20. #if __GNUC__
  21. #if __x86_64__ || __ppc64__
  22. #define ENVIRONMENT64
  23. #else
  24. #define ENVIRONMENT32
  25. #endif
  26. #endif
  27. /*********************** TBB.h ********************/
  28. #include "tbb/blocked_range.h"
  29. #include "tbb/concurrent_hash_map.h"
  30. #include "tbb/concurrent_unordered_map.h"
  31. #include "tbb/concurrent_unordered_set.h"
  32. #include "tbb/concurrent_vector.h"
  33. #include "tbb/parallel_for.h"
  34. #include "tbb/parallel_invoke.h"
  35. /*********************** TBB.h ********************/
  36. #include "../../lib/VCMI_Lib.h"
  37. #include "../../lib/CBuildingHandler.h"
  38. #include "../../lib/CCreatureHandler.h"
  39. #include "../../lib/CTownHandler.h"
  40. #include "../../lib/spells/CSpellHandler.h"
  41. #include "../../lib/CStopWatch.h"
  42. #include "../../lib/mapObjects/CGHeroInstance.h"
  43. #include "../../CCallback.h"
  44. #include <chrono>
  45. using dwellingContent = std::pair<ui32, std::vector<CreatureID>>;
  46. namespace NKAI
  47. {
  48. struct creInfo;
  49. class AIGateway;
  50. class Nullkiller;
  51. const int GOLD_MINE_PRODUCTION = 1000;
  52. const int WOOD_ORE_MINE_PRODUCTION = 2;
  53. const int RESOURCE_MINE_PRODUCTION = 1;
  54. const int ACTUAL_RESOURCE_COUNT = 7;
  55. const int ALLOWED_ROAMING_HEROES = 8;
  56. //implementation-dependent
  57. extern const float SAFE_ATTACK_CONSTANT;
  58. extern const int GOLD_RESERVE;
  59. extern thread_local CCallback * cb;
  60. enum HeroRole
  61. {
  62. SCOUT = 0,
  63. MAIN = 1
  64. };
  65. //provisional class for AI to store a reference to an owned hero object
  66. //checks if it's valid on access, should be used in place of const CGHeroInstance*
  67. struct DLL_EXPORT HeroPtr
  68. {
  69. const CGHeroInstance * h;
  70. ObjectInstanceID hid;
  71. public:
  72. std::string name() const;
  73. HeroPtr();
  74. HeroPtr(const CGHeroInstance * H);
  75. ~HeroPtr();
  76. operator bool() const
  77. {
  78. return validAndSet();
  79. }
  80. bool operator<(const HeroPtr & rhs) const;
  81. const CGHeroInstance * operator->() const;
  82. const CGHeroInstance * operator*() const; //not that consistent with -> but all interfaces use CGHeroInstance*, so it's convenient
  83. bool operator==(const HeroPtr & rhs) const;
  84. bool operator!=(const HeroPtr & rhs) const
  85. {
  86. return !(*this == rhs);
  87. }
  88. const CGHeroInstance * get(bool doWeExpectNull = false) const;
  89. const CGHeroInstance * get(const CPlayerSpecificInfoCallback * cb, bool doWeExpectNull = false) const;
  90. bool validAndSet() const;
  91. };
  92. enum BattleState
  93. {
  94. NO_BATTLE,
  95. UPCOMING_BATTLE,
  96. ONGOING_BATTLE,
  97. ENDING_BATTLE
  98. };
  99. // AI lives in a dangerous world. CGObjectInstances under pointer may got deleted/hidden.
  100. // This class stores object id, so we can detect when we lose access to the underlying object.
  101. struct ObjectIdRef
  102. {
  103. ObjectInstanceID id;
  104. const CGObjectInstance * operator->() const;
  105. operator const CGObjectInstance *() const;
  106. operator bool() const;
  107. ObjectIdRef(ObjectInstanceID _id);
  108. ObjectIdRef(const CGObjectInstance * obj);
  109. bool operator<(const ObjectIdRef & rhs) const;
  110. };
  111. template<Obj::Type id>
  112. bool objWithID(const CGObjectInstance * obj)
  113. {
  114. return obj->ID == id;
  115. }
  116. struct creInfo
  117. {
  118. int count;
  119. CreatureID creID;
  120. int level;
  121. };
  122. creInfo infoFromDC(const dwellingContent & dc);
  123. template<class Func>
  124. void foreach_tile_pos(const Func & foo)
  125. {
  126. // some micro-optimizations since this function gets called a LOT
  127. // callback pointer is thread-specific and slow to retrieve -> read map size only once
  128. int3 mapSize = cb->getMapSize();
  129. for(int z = 0; z < mapSize.z; z++)
  130. {
  131. for(int x = 0; x < mapSize.x; x++)
  132. {
  133. for(int y = 0; y < mapSize.y; y++)
  134. {
  135. foo(int3(x, y, z));
  136. }
  137. }
  138. }
  139. }
  140. template<class Func, class TCallback>
  141. void foreach_tile_pos(TCallback * cbp, const Func & foo) // avoid costly retrieval of thread-specific pointer
  142. {
  143. int3 mapSize = cbp->getMapSize();
  144. for(int z = 0; z < mapSize.z; z++)
  145. {
  146. for(int x = 0; x < mapSize.x; x++)
  147. {
  148. for(int y = 0; y < mapSize.y; y++)
  149. {
  150. foo(cbp, int3(x, y, z));
  151. }
  152. }
  153. }
  154. }
  155. template<class Func>
  156. void foreach_neighbour(const int3 & pos, const Func & foo)
  157. {
  158. CCallback * cbp = cb; // avoid costly retrieval of thread-specific pointer
  159. for(const int3 & dir : int3::getDirs())
  160. {
  161. const int3 n = pos + dir;
  162. if(cbp->isInTheMap(n))
  163. foo(pos + dir);
  164. }
  165. }
  166. template<class Func>
  167. void foreach_neighbour(CCallback * cbp, const int3 & pos, const Func & foo) // avoid costly retrieval of thread-specific pointer
  168. {
  169. for(const int3 & dir : int3::getDirs())
  170. {
  171. const int3 n = pos + dir;
  172. if(cbp->isInTheMap(n))
  173. foo(cbp, pos + dir);
  174. }
  175. }
  176. bool canBeEmbarkmentPoint(const TerrainTile * t, bool fromWater);
  177. bool isObjectPassable(const Nullkiller * ai, const CGObjectInstance * obj);
  178. bool isObjectPassable(const CGObjectInstance * obj, PlayerColor playerColor, PlayerRelations objectRelations);
  179. bool isBlockVisitObj(const int3 & pos);
  180. bool isWeeklyRevisitable(const Nullkiller * ai, const CGObjectInstance * obj);
  181. bool isObjectRemovable(const CGObjectInstance * obj); //FIXME FIXME: move logic to object property!
  182. bool isSafeToVisit(const CGHeroInstance * h, uint64_t dangerStrength);
  183. bool isSafeToVisit(const CGHeroInstance * h, const CCreatureSet *, uint64_t dangerStrength);
  184. bool compareHeroStrength(const CGHeroInstance * h1, const CGHeroInstance * h2);
  185. bool compareArmyStrength(const CArmedInstance * a1, const CArmedInstance * a2);
  186. bool compareArtifacts(const CArtifactInstance * a1, const CArtifactInstance * a2);
  187. bool townHasFreeTavern(const CGTownInstance * town);
  188. uint64_t getHeroArmyStrengthWithCommander(const CGHeroInstance * hero, const CCreatureSet * heroArmy);
  189. uint64_t timeElapsed(std::chrono::time_point<std::chrono::high_resolution_clock> start);
  190. // todo: move to obj manager
  191. bool shouldVisit(const Nullkiller * ai, const CGHeroInstance * h, const CGObjectInstance * obj);
  192. int getDuplicatingSlots(const CArmedInstance * army);
  193. template <class T>
  194. class SharedPool
  195. {
  196. public:
  197. struct External_Deleter
  198. {
  199. explicit External_Deleter(std::weak_ptr<SharedPool<T>* > pool)
  200. : pool(pool)
  201. {
  202. }
  203. void operator()(T * ptr)
  204. {
  205. std::unique_ptr<T> uptr(ptr);
  206. if(auto pool_ptr = pool.lock())
  207. {
  208. (*pool_ptr.get())->add(std::move(uptr));
  209. }
  210. }
  211. private:
  212. std::weak_ptr<SharedPool<T>* > pool;
  213. };
  214. public:
  215. using ptr_type = std::unique_ptr<T, External_Deleter>;
  216. SharedPool(std::function<std::unique_ptr<T>()> elementFactory):
  217. elementFactory(elementFactory), pool(), instance_tracker(new SharedPool<T> *(this))
  218. {}
  219. void add(std::unique_ptr<T> t)
  220. {
  221. boost::lock_guard<boost::mutex> lock(sync);
  222. pool.push_back(std::move(t));
  223. }
  224. ptr_type acquire()
  225. {
  226. boost::lock_guard<boost::mutex> lock(sync);
  227. bool poolIsEmpty = pool.empty();
  228. T * element = poolIsEmpty
  229. ? elementFactory().release()
  230. : pool.back().release();
  231. ptr_type tmp(
  232. element,
  233. External_Deleter(std::weak_ptr<SharedPool<T>*>(instance_tracker)));
  234. if(!poolIsEmpty) pool.pop_back();
  235. return tmp;
  236. }
  237. bool empty() const
  238. {
  239. return pool.empty();
  240. }
  241. size_t size() const
  242. {
  243. return pool.size();
  244. }
  245. private:
  246. std::vector<std::unique_ptr<T>> pool;
  247. std::function<std::unique_ptr<T>()> elementFactory;
  248. std::shared_ptr<SharedPool<T> *> instance_tracker;
  249. boost::mutex sync;
  250. };
  251. }