global.h 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407
  1. #ifndef __GLOBAL_H__
  2. #define __GLOBAL_H__
  3. #include <iostream>
  4. #include <algorithm> //std::find
  5. #include <string> //std::find
  6. #include <boost/logic/tribool.hpp>
  7. using boost::logic::tribool;
  8. #include <boost/cstdint.hpp>
  9. typedef boost::uint64_t ui64; //unsigned int 64 bits (8 bytes)
  10. typedef boost::uint32_t ui32; //unsigned int 32 bits (4 bytes)
  11. typedef boost::uint16_t ui16; //unsigned int 16 bits (2 bytes)
  12. typedef boost::uint8_t ui8; //unsigned int 8 bits (1 byte)
  13. typedef boost::int64_t si64; //signed int 64 bits (8 bytes)
  14. typedef boost::int32_t si32; //signed int 32 bits (4 bytes)
  15. typedef boost::int16_t si16; //signed int 16 bits (2 bytes)
  16. typedef boost::int8_t si8; //signed int 8 bits (1 byte)
  17. typedef si64 expType;
  18. #include "int3.h"
  19. #include <map>
  20. #include <vector>
  21. #define CHECKTIME 1
  22. #if CHECKTIME
  23. #include "timeHandler.h"
  24. #define THC
  25. #endif
  26. #define NAME_VER ("VCMI 0.81b")
  27. extern std::string NAME; //full name
  28. extern std::string NAME_AFFIX; //client / server
  29. #define CONSOLE_LOGGING_LEVEL 5
  30. #define FILE_LOGGING_LEVEL 6
  31. /*
  32. * DATA_DIR contains the game data (Data/, MP3/, ...).
  33. * USER_DIR is where to save games (Games/) and the config.
  34. * BIN_DIR is where the vcmiclient/vcmiserver binaries reside
  35. * LIB_DIR is where the AI libraries reside (linux only)
  36. */
  37. #ifdef _WIN32
  38. #define DATA_DIR "."
  39. #define USER_DIR "."
  40. #define BIN_DIR "."
  41. #define SERVER_NAME "VCMI_server.exe"
  42. #else
  43. #ifndef DATA_DIR
  44. #error DATA_DIR undefined.
  45. #endif
  46. #ifndef BIN_DIR
  47. #error BIN_DIR undefined.
  48. #endif
  49. #ifndef LIB_DIR
  50. #error LIB_DIR undefined.
  51. #endif
  52. #define SERVER_NAME "vcmiserver"
  53. #endif
  54. #ifdef _WIN32
  55. #define PATH_SEPARATOR "\\"
  56. #else
  57. #define PATH_SEPARATOR "/"
  58. #endif
  59. /*
  60. * global.h, part of VCMI engine
  61. *
  62. * Authors: listed in file AUTHORS in main folder
  63. *
  64. * License: GNU General Public License v2.0 or later
  65. * Full text of license available in license.txt file, in main folder
  66. *
  67. */
  68. enum Ecolor {RED, BLUE, TAN, GREEN, ORANGE, PURPLE, TEAL, PINK}; //player's colors
  69. enum EvictoryConditions {artifact, gatherTroop, gatherResource, buildCity, buildGrail, beatHero,
  70. captureCity, beatMonster, takeDwellings, takeMines, transportItem, winStandard=255};
  71. enum ElossCon {lossCastle, lossHero, timeExpires, lossStandard=255};
  72. enum ECombatInfo{ALIVE = 180, SUMMONED, CLONED, HAD_MORALE, WAITING, MOVED, DEFENDING};
  73. class CGameInfo;
  74. extern CGameInfo* CGI;
  75. const int HEROI_TYPE = 34,
  76. TOWNI_TYPE = 98,
  77. CREI_TYPE = 54,
  78. EVENTI_TYPE = 26;
  79. const int F_NUMBER = 9; //factions (town types) quantity
  80. const int PLAYER_LIMIT = 8; //player limit per map
  81. const int ALL_PLAYERS = 255; //bitfield
  82. const int HEROES_PER_TYPE=8; //amount of heroes of each type
  83. const int SKILL_QUANTITY=28;
  84. const int SKILL_PER_HERO=8;
  85. const int ARTIFACTS_QUANTITY=171;
  86. const int HEROES_QUANTITY=156;
  87. const int SPELLS_QUANTITY=70;
  88. const int RESOURCE_QUANTITY=8;
  89. const int TERRAIN_TYPES=10;
  90. const int PRIMARY_SKILLS=4;
  91. const int NEUTRAL_PLAYER=255;
  92. const int NAMES_PER_TOWN=16;
  93. const int CREATURES_PER_TOWN = 7; //without upgrades
  94. const int MAX_BUILDING_PER_TURN = 1;
  95. const int SPELL_LEVELS = 5;
  96. const int CREEP_SIZE = 4000; // neutral stacks won't grow beyon this number
  97. const int WEEKLY_GROWTH = 10; //percent
  98. const int AVAILABLE_HEROES_PER_PLAYER = 2;
  99. #define BFIELD_WIDTH (17)
  100. #define BFIELD_HEIGHT (11)
  101. #define BFIELD_SIZE ((BFIELD_WIDTH) * (BFIELD_HEIGHT))
  102. enum EMarketMode
  103. {
  104. RESOURCE_RESOURCE, RESOURCE_PLAYER, CREATURE_RESOURCE, RESOURCE_ARTIFACT,
  105. ARTIFACT_RESOURCE, ARTIFACT_EXP, CREATURE_EXP, CREATURE_UNDEAD,
  106. MARTKET_AFTER_LAST_PLACEHOLDER
  107. };
  108. //uncomment to make it work
  109. //#define MARK_BLOCKED_POSITIONS
  110. //#define MARK_VISITABLE_POSITIONS
  111. #define DEFBYPASS
  112. #ifdef _WIN32
  113. #define DLL_F_EXPORT __declspec(dllexport)
  114. #else
  115. #if defined(__GNUC__) && __GNUC__ >= 4
  116. #define DLL_F_EXPORT __attribute__ ((visibility("default")))
  117. #else
  118. #define DLL_F_EXPORT
  119. #endif
  120. #endif
  121. #ifdef _WIN32
  122. #define DLL_F_IMPORT __declspec(dllimport)
  123. #else
  124. #if defined(__GNUC__) && __GNUC__ >= 4
  125. #define DLL_F_IMPORT __attribute__ ((visibility("default")))
  126. #else
  127. #define DLL_F_IMPORT
  128. #endif
  129. #endif
  130. #ifdef VCMI_DLL
  131. #define DLL_EXPORT DLL_F_EXPORT
  132. #else
  133. #define DLL_EXPORT DLL_F_IMPORT
  134. #endif
  135. template<typename T, size_t N> char (&_ArrayCountObj(const T (&)[N]))[N];
  136. #define ARRAY_COUNT(arr) (sizeof(_ArrayCountObj(arr)))
  137. namespace vstd
  138. {
  139. template <typename Container, typename Item>
  140. bool contains(const Container & c, const Item &i) //returns true if container c contains item i
  141. {
  142. return std::find(c.begin(),c.end(),i) != c.end();
  143. }
  144. template <typename V, typename Item, typename Item2>
  145. bool contains(const std::map<Item,V> & c, const Item2 &i) //returns true if map c contains item i
  146. {
  147. return c.find(i)!=c.end();
  148. }
  149. template <typename Container1, typename Container2>
  150. typename Container2::iterator findFirstNot(Container1 &c1, Container2 &c2)//returns first element of c2 not present in c1
  151. {
  152. typename Container2::iterator itr = c2.begin();
  153. while(itr != c2.end())
  154. if(!contains(c1,*itr))
  155. return itr;
  156. else
  157. ++itr;
  158. return c2.end();
  159. }
  160. template <typename Container1, typename Container2>
  161. typename Container2::const_iterator findFirstNot(const Container1 &c1, const Container2 &c2)//returns const first element of c2 not present in c1
  162. {
  163. typename Container2::const_iterator itr = c2.begin();
  164. while(itr != c2.end())
  165. if(!contains(c1,*itr))
  166. return itr;
  167. else
  168. ++itr;
  169. return c2.end();
  170. }
  171. template <typename Container, typename Item>
  172. typename Container::iterator find(const Container & c, const Item &i)
  173. {
  174. return std::find(c.begin(),c.end(),i);
  175. }
  176. template <typename T1, typename T2>
  177. int findPos(const std::vector<T1> & c, const T2 &s) //returns position of first element in vector c equal to s, if there is no such element, -1 is returned
  178. {
  179. for(size_t i=0; i < c.size(); ++i)
  180. if(c[i] == s)
  181. return i;
  182. return -1;
  183. }
  184. template <typename T1, typename T2, typename Func>
  185. int findPos(const std::vector<T1> & c, const T2 &s, const Func &f) //Func(T1,T2) must say if these elements matches
  186. {
  187. for(size_t i=0; i < c.size(); ++i)
  188. if(f(c[i],s))
  189. return i;
  190. return -1;
  191. }
  192. template <typename Container, typename Item>
  193. typename Container::iterator find(Container & c, const Item &i) //returns iterator to the given element if present in container, end() if not
  194. {
  195. return std::find(c.begin(),c.end(),i);
  196. }
  197. template <typename Container, typename Item>
  198. typename Container::const_iterator find(const Container & c, const Item &i)//returns const iterator to the given element if present in container, end() if not
  199. {
  200. return std::find(c.begin(),c.end(),i);
  201. }
  202. template <typename Container, typename Item>
  203. typename Container::size_type operator-=(Container &c, const Item &i) //removes element i from container c, returns false if c does not contain i
  204. {
  205. typename Container::iterator itr = find(c,i);
  206. if(itr == c.end())
  207. return false;
  208. c.erase(itr);
  209. return true;
  210. }
  211. template <typename t1>
  212. void delObj(t1 *a1)
  213. {
  214. delete a1;
  215. }
  216. template <typename t1, typename t2>
  217. void assign(t1 &a1, const t2 &a2)
  218. {
  219. a1 = a2;
  220. }
  221. template <typename t1, typename t2>
  222. struct assigner
  223. {
  224. public:
  225. t1 &op1;
  226. t2 op2;
  227. assigner(t1 &a1, const t2 & a2)
  228. :op1(a1), op2(a2)
  229. {}
  230. void operator()()
  231. {
  232. op1 = op2;
  233. }
  234. };
  235. template <typename t1, typename t2>
  236. assigner<t1,t2> assigno(t1 &a1, const t2 &a2)
  237. {
  238. return assigner<t1,t2>(a1,a2);
  239. }
  240. template <typename t1, typename t2, typename t3>
  241. bool equal(const t1 &a1, const t3 t1::* point, const t2 &a2)
  242. {
  243. return a1.*point == a2;
  244. }
  245. template <typename t1, typename t2>
  246. bool equal(const t1 &a1, const t2 &a2)
  247. {
  248. return a1 == a2;
  249. }
  250. }
  251. using vstd::operator-=;
  252. template <typename t1, typename t2>
  253. t1 & amax(t1 &a, const t2 &b) //assigns greater of (a, b) to a and returns maximum of (a, b)
  254. {
  255. if(a >= b)
  256. return a;
  257. else
  258. {
  259. a = b;
  260. return a;
  261. }
  262. }
  263. template <typename t1, typename t2>
  264. t1 & amin(t1 &a, const t2 &b) //assigns smaller of (a, b) to a and returns minimum of (a, b)
  265. {
  266. if(a <= b)
  267. return a;
  268. else
  269. {
  270. a = b;
  271. return a;
  272. }
  273. }
  274. template <typename t1, typename t2, typename t3>
  275. t1 & abetw(t1 &a, const t2 &b, const t3 &c) //makes a to fit the range <b, c>
  276. {
  277. amax(a,b);
  278. amin(a,c);
  279. return a;
  280. }
  281. template <typename T>
  282. void delNull(T* &ptr) //deleted pointer and sets it to NULL
  283. {
  284. delete ptr;
  285. ptr = NULL;
  286. }
  287. #include "CConsoleHandler.h"
  288. extern DLL_EXPORT std::ostream *logfile;
  289. extern DLL_EXPORT CConsoleHandler *console;
  290. class CLogger //logger, prints log info to console and saves in file
  291. {
  292. const int lvl;
  293. public:
  294. CLogger& operator<<(std::ostream& (*fun)(std::ostream&))
  295. {
  296. if(lvl < CONSOLE_LOGGING_LEVEL)
  297. std::cout << fun;
  298. if((lvl < FILE_LOGGING_LEVEL) && logfile)
  299. *logfile << fun;
  300. return *this;
  301. }
  302. template<typename T>
  303. CLogger & operator<<(const T & data)
  304. {
  305. if(lvl < CONSOLE_LOGGING_LEVEL)
  306. {
  307. if(console)
  308. console->print(data,lvl);
  309. else
  310. std::cout << data << std::flush;
  311. }
  312. if((lvl < FILE_LOGGING_LEVEL) && logfile)
  313. *logfile << data << std::flush;
  314. return *this;
  315. }
  316. CLogger(const int Lvl) : lvl(Lvl) {}
  317. };
  318. extern DLL_EXPORT CLogger tlog0; //green - standard progress info
  319. extern DLL_EXPORT CLogger tlog1; //red - big errors
  320. extern DLL_EXPORT CLogger tlog2; //magenta - major warnings
  321. extern DLL_EXPORT CLogger tlog3; //yellow - minor warnings
  322. extern DLL_EXPORT CLogger tlog4; //white - detailed log info
  323. extern DLL_EXPORT CLogger tlog5; //gray - minor log info
  324. //XXX pls dont - 'debug macros' are usually more trouble than it's worth
  325. #define HANDLE_EXCEPTION \
  326. catch (const std::exception& e) { \
  327. tlog1 << e.what() << std::endl; \
  328. throw; \
  329. } \
  330. catch (const std::exception * e) \
  331. { \
  332. tlog1 << e->what()<< std::endl; \
  333. throw; \
  334. } \
  335. catch (const std::string& e) { \
  336. tlog1 << e << std::endl; \
  337. throw; \
  338. }
  339. #define HANDLE_EXCEPTIONC(COMMAND) \
  340. catch (const std::exception& e) { \
  341. COMMAND; \
  342. tlog1 << e.what() << std::endl; \
  343. throw; \
  344. } \
  345. catch (const std::string &e) \
  346. { \
  347. COMMAND; \
  348. tlog1 << e << std::endl; \
  349. throw; \
  350. }
  351. #if defined(linux) && defined(sparc)
  352. /* SPARC does not support unaligned memory access. Let gcc know when
  353. * to emit the right code. */
  354. struct unaligned_Uint16 { ui16 val __attribute__(( packed )); };
  355. struct unaligned_Uint32 { ui32 val __attribute__(( packed )); };
  356. static inline ui16 read_unaligned_u16(const void *p)
  357. {
  358. const struct unaligned_Uint16 *v = (const struct unaligned_Uint16 *)p;
  359. return v->val;
  360. }
  361. static inline ui32 read_unaligned_u32(const void *p)
  362. {
  363. const struct unaligned_Uint32 *v = (const struct unaligned_Uint32 *)p;
  364. return v->val;
  365. }
  366. #else
  367. #define read_unaligned_u16(p) (* reinterpret_cast<const Uint16 *>(p))
  368. #define read_unaligned_u32(p) (* reinterpret_cast<const Uint32 *>(p))
  369. #endif
  370. #endif // __GLOBAL_H__