global.h 11 KB

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