author | bjarni |
Sat, 22 Jan 2005 23:55:45 +0000 | |
changeset 1099 | ad7522bd5c1c |
parent 1035 | 812f837ee03f |
child 1174 | 6a5e747f3ba6 |
permissions | -rw-r--r-- |
0 | 1 |
#ifndef MACROS_H |
2 |
#define MACROS_H |
|
3 |
||
926
a6d140a6a4de
(svn r1414) Move TileIndex, TILE_MASK and GET_TILE_[XY] to map.h and turn the latter into inline functions names Tile[XY]
tron
parents:
900
diff
changeset
|
4 |
#include "map.h" |
a6d140a6a4de
(svn r1414) Move TileIndex, TILE_MASK and GET_TILE_[XY] to map.h and turn the latter into inline functions names Tile[XY]
tron
parents:
900
diff
changeset
|
5 |
|
0 | 6 |
#define MAX_INT 0x7FFFFFFF |
7 |
||
193
0a7025304867
(svn r194) -Codechange: stripping trailing-spaces. Please keep this that way!
truelight
parents:
22
diff
changeset
|
8 |
#ifdef min |
0 | 9 |
#undef min |
10 |
#endif |
|
11 |
||
12 |
#ifdef max |
|
13 |
#undef max |
|
14 |
#endif |
|
15 |
||
500
8e52f7797b48
(svn r793) Merge INLINE -> inline replacement (revision 376)
tron
parents:
239
diff
changeset
|
16 |
static inline int min(int a, int b) { if (a <= b) return a; return b; } |
8e52f7797b48
(svn r793) Merge INLINE -> inline replacement (revision 376)
tron
parents:
239
diff
changeset
|
17 |
static inline int max(int a, int b) { if (a >= b) return a; return b; } |
8e52f7797b48
(svn r793) Merge INLINE -> inline replacement (revision 376)
tron
parents:
239
diff
changeset
|
18 |
static inline int64 max64(int64 a, int64 b) { if (a >= b) return a; return b; } |
0 | 19 |
|
500
8e52f7797b48
(svn r793) Merge INLINE -> inline replacement (revision 376)
tron
parents:
239
diff
changeset
|
20 |
static inline uint minu(uint a, uint b) { if (a <= b) return a; return b; } |
8e52f7797b48
(svn r793) Merge INLINE -> inline replacement (revision 376)
tron
parents:
239
diff
changeset
|
21 |
static inline uint maxu(uint a, uint b) { if (a >= b) return a; return b; } |
0 | 22 |
|
23 |
||
500
8e52f7797b48
(svn r793) Merge INLINE -> inline replacement (revision 376)
tron
parents:
239
diff
changeset
|
24 |
static inline int clamp(int a, int min, int max) { if (a <= min) return min; if (a >= max) return max; return a; } |
8e52f7797b48
(svn r793) Merge INLINE -> inline replacement (revision 376)
tron
parents:
239
diff
changeset
|
25 |
static inline int clamp2(int a, int min, int max) { if (a <= min) a=min; if (a >= max) a=max; return a; } |
8e52f7797b48
(svn r793) Merge INLINE -> inline replacement (revision 376)
tron
parents:
239
diff
changeset
|
26 |
static inline bool int32_add_overflow(int32 a, int32 b) { return (int32)(a^b)>=0 && (int32)(a^(a+b))<0; } |
8e52f7797b48
(svn r793) Merge INLINE -> inline replacement (revision 376)
tron
parents:
239
diff
changeset
|
27 |
static inline bool int32_sub_overflow(int32 a, int32 b) { return (int32)(a^b)<0 && (int32)(a^(a-b))<0; } |
0 | 28 |
|
500
8e52f7797b48
(svn r793) Merge INLINE -> inline replacement (revision 376)
tron
parents:
239
diff
changeset
|
29 |
static inline bool str_eq(const byte *a, const byte *b) |
0 | 30 |
{ |
31 |
int i=0; |
|
32 |
while (a[i] == b[i]) { |
|
33 |
if (a[i] == 0) |
|
34 |
return true; |
|
35 |
i++; |
|
36 |
} |
|
37 |
return false; |
|
38 |
} |
|
39 |
||
40 |
// Will crash if strings are equal |
|
500
8e52f7797b48
(svn r793) Merge INLINE -> inline replacement (revision 376)
tron
parents:
239
diff
changeset
|
41 |
static inline bool str_is_below(byte *a, byte *b) { |
0 | 42 |
while (*a <= *b) { |
43 |
if (*a < *b) return true; |
|
44 |
a++; |
|
45 |
b++; |
|
46 |
} |
|
47 |
return false; |
|
48 |
} |
|
49 |
||
50 |
||
500
8e52f7797b48
(svn r793) Merge INLINE -> inline replacement (revision 376)
tron
parents:
239
diff
changeset
|
51 |
static inline int32 BIGMULSS(int32 a, int32 b, int shift) { |
0 | 52 |
return (int32)(((int64)(a) * (int64)(b)) >> (shift)); |
53 |
} |
|
54 |
||
500
8e52f7797b48
(svn r793) Merge INLINE -> inline replacement (revision 376)
tron
parents:
239
diff
changeset
|
55 |
static inline int64 BIGMULSS64(int64 a, int64 b, int shift) { |
236
da0ae9d977e0
(svn r237) -Fix: [1025836] Company value problem (again). Now company value rightly shows the value, including ALL your money.
darkvater
parents:
222
diff
changeset
|
56 |
return ((a) * (b)) >> (shift); |
da0ae9d977e0
(svn r237) -Fix: [1025836] Company value problem (again). Now company value rightly shows the value, including ALL your money.
darkvater
parents:
222
diff
changeset
|
57 |
} |
da0ae9d977e0
(svn r237) -Fix: [1025836] Company value problem (again). Now company value rightly shows the value, including ALL your money.
darkvater
parents:
222
diff
changeset
|
58 |
|
500
8e52f7797b48
(svn r793) Merge INLINE -> inline replacement (revision 376)
tron
parents:
239
diff
changeset
|
59 |
static inline uint32 BIGMULUS(uint32 a, uint32 b, int shift) { |
0 | 60 |
return (uint32)(((uint64)(a) * (uint64)(b)) >> (shift)); |
61 |
} |
|
62 |
||
500
8e52f7797b48
(svn r793) Merge INLINE -> inline replacement (revision 376)
tron
parents:
239
diff
changeset
|
63 |
static inline int64 BIGMULS(int32 a, int32 b) { |
0 | 64 |
return (int32)(((int64)(a) * (int64)(b))); |
65 |
} |
|
66 |
||
67 |
/* OPT: optimized into an unsigned comparison */ |
|
68 |
//#define IS_INSIDE_1D(x, base, size) ((x) >= (base) && (x) < (base) + (size)) |
|
69 |
#define IS_INSIDE_1D(x, base, size) ( (uint)((x) - (base)) < ((uint)(size)) ) |
|
70 |
||
71 |
#define LANDSCAPE_SIZE_FACTOR 1 |
|
72 |
||
73 |
enum { |
|
74 |
CORRECT_Z_BITS = 1 << 1 | 1 << 2 | 1 << 3 | 1 << 4 | 1 << 5 | 1 << 6 | 1 << 7 |
|
75 |
}; |
|
76 |
#define CORRECT_Z(tileh) (CORRECT_Z_BITS & (1 << tileh)) |
|
77 |
||
78 |
#define TILE_ASSERT(x) assert( TILE_MASK(x) == (x) ); |
|
79 |
||
80 |
//#define REMADP_COORDS(x,y,z) { int t = x; x = (y-t)*2; y+=t-z; } |
|
81 |
||
82 |
#define PACK_POINT(x,y) ((x) | ((y) << 16)) |
|
83 |
#define UNPACK_POINT_X(p) ((uint16)(p)) |
|
84 |
#define UNPACK_POINT_Y(p) ((uint16)(p>>16)) |
|
85 |
||
86 |
#define PACK_PPOINT(p) PACK_POINT((p).x, (p).y) |
|
87 |
||
954
66c89362a778
(svn r1445) -Fix: reversing a train also reverses the UP and DOWN status for the
truelight
parents:
947
diff
changeset
|
88 |
#define HASBIT(x,y) ((x) & (1 << (y))) |
66c89362a778
(svn r1445) -Fix: reversing a train also reverses the UP and DOWN status for the
truelight
parents:
947
diff
changeset
|
89 |
#define SETBIT(x,y) ((x) |= (1 << (y))) |
66c89362a778
(svn r1445) -Fix: reversing a train also reverses the UP and DOWN status for the
truelight
parents:
947
diff
changeset
|
90 |
#define CLRBIT(x,y) ((x) &= ~(1 << (y))) |
66c89362a778
(svn r1445) -Fix: reversing a train also reverses the UP and DOWN status for the
truelight
parents:
947
diff
changeset
|
91 |
#define TOGGLEBIT(x,y) ((x) ^= (1 << (y))) |
0 | 92 |
|
93 |
// checking more bits. Maybe unneccessary, but easy to use |
|
94 |
#define HASBITS(x,y) ((x) & (y)) |
|
95 |
#define SETBITS(x,y) ((x) |= (y)) |
|
96 |
#define CLRBITS(x,y) ((x) &= ~(y)) |
|
97 |
||
98 |
#define PLAYER_SPRITE_COLOR(owner) ((_player_colors[owner] << 16) + 0x3070000) |
|
99 |
#define SPRITE_PALETTE(x) ((x) + 0x8000) |
|
100 |
||
101 |
extern const byte _ffb_64[128]; |
|
22 | 102 |
/* Returns the position of the first bit that is not zero, counted from the |
103 |
* left. Ie, 10110100 returns 2, 00000001 returns 0, etc. When x == 0 returns |
|
104 |
* 0. |
|
105 |
*/ |
|
0 | 106 |
#define FIND_FIRST_BIT(x) _ffb_64[(x)] |
22 | 107 |
/* Returns x with the first bit that is not zero, counted from the left, set |
108 |
* to zero. So, 10110100 returns 10110000, 00000001 returns 00000000, etc. |
|
109 |
*/ |
|
0 | 110 |
#define KILL_FIRST_BIT(x) _ffb_64[(x)+64] |
111 |
||
500
8e52f7797b48
(svn r793) Merge INLINE -> inline replacement (revision 376)
tron
parents:
239
diff
changeset
|
112 |
static inline int FindFirstBit2x64(int value) |
0 | 113 |
{ |
114 |
int i = 0; |
|
115 |
if ( (byte) value == 0) { |
|
116 |
i += 8; |
|
117 |
value >>= 8; |
|
118 |
} |
|
119 |
return i + FIND_FIRST_BIT(value & 0x3F); |
|
120 |
} |
|
121 |
||
122 |
||
123 |
/* [min,max), strictly less than */ |
|
124 |
#define IS_BYTE_INSIDE(a,min,max) ((byte)((a)-(min)) < (byte)((max)-(min))) |
|
125 |
#define IS_INT_INSIDE(a,min,max) ((uint)((a)-(min)) < (uint)((max)-(min))) |
|
126 |
||
127 |
||
128 |
#define CHANCE16(a,b) ((uint16)Random() <= (uint16)((65536 * a) / b)) |
|
129 |
#define CHANCE16R(a,b,r) ((uint16)(r=Random()) <= (uint16)((65536 * a) / b)) |
|
130 |
#define CHANCE16I(a,b,v) ((uint16)(v) <= (uint16)((65536 * a) / b)) |
|
131 |
||
132 |
#define BEGIN_TILE_LOOP(var,w,h,tile) \ |
|
133 |
{int h_cur = h; \ |
|
134 |
uint var = tile; \ |
|
135 |
do { \ |
|
136 |
int w_cur = w; \ |
|
137 |
do { |
|
138 |
||
139 |
#define END_TILE_LOOP(var,w,h,tile) \ |
|
140 |
} while (++var, --w_cur != 0); \ |
|
141 |
} while (var += TILE_XY(0,1) - (w), --h_cur != 0);} |
|
142 |
||
143 |
||
144 |
#define for_each_bit(_i,_b) \ |
|
145 |
for(_i=0; _b!=0; _i++,_b>>=1) \ |
|
146 |
if (_b&1) |
|
147 |
||
148 |
#define assert_array(i,j) assert(i < lengthof(j)) |
|
149 |
||
150 |
#define abs myabs |
|
151 |
||
152 |
||
500
8e52f7797b48
(svn r793) Merge INLINE -> inline replacement (revision 376)
tron
parents:
239
diff
changeset
|
153 |
static inline int intxchg_(int *a, int b) { int t = *a; *a = b; return t; } |
0 | 154 |
#define intxchg(a,b) intxchg_(&(a), (b)) |
155 |
#define intswap(a,b) ((b) = intxchg_(&(a), (b))) |
|
156 |
||
500
8e52f7797b48
(svn r793) Merge INLINE -> inline replacement (revision 376)
tron
parents:
239
diff
changeset
|
157 |
static inline int myabs(int a) { if (a<0) a = -a; return a; } |
8e52f7797b48
(svn r793) Merge INLINE -> inline replacement (revision 376)
tron
parents:
239
diff
changeset
|
158 |
static inline int64 myabs64(int64 a) { if (a<0) a = -a; return a; } |
0 | 159 |
|
500
8e52f7797b48
(svn r793) Merge INLINE -> inline replacement (revision 376)
tron
parents:
239
diff
changeset
|
160 |
static inline void swap_byte(byte *a, byte *b) { byte t = *a; *a = *b; *b = t; } |
8e52f7797b48
(svn r793) Merge INLINE -> inline replacement (revision 376)
tron
parents:
239
diff
changeset
|
161 |
static inline void swap_uint16(uint16 *a, uint16 *b) { uint16 t = *a; *a = *b; *b = t; } |
8e52f7797b48
(svn r793) Merge INLINE -> inline replacement (revision 376)
tron
parents:
239
diff
changeset
|
162 |
static inline void swap_int16(int16 *a, int16 *b) { int16 t = *a; *a = *b; *b = t; } |
8e52f7797b48
(svn r793) Merge INLINE -> inline replacement (revision 376)
tron
parents:
239
diff
changeset
|
163 |
static inline void swap_tile(TileIndex *a, TileIndex *b) { TileIndex t = *a; *a = *b; *b = t; } |
0 | 164 |
|
165 |
||
166 |
||
167 |
#if defined(TTD_LITTLE_ENDIAN) |
|
222
b88456001397
(svn r223) -Fix: Const correctness and miscellaneous fixes. Thank you Tron for your diligent fixing of warnings (and some possibly bugs) (Tron)
darkvater
parents:
193
diff
changeset
|
168 |
# define READ_LE_UINT16(b) (*(const uint16*)(b)) |
0 | 169 |
# define ADD_WORD(x) (x)&0xFF, ((x) >> 8)&0xFF |
170 |
# define ADD_DWORD(x) (x)&0xFF, ((x) >> 8)&0xFF, ((x) >> 16)&0xFF, ((x) >> 24)&0xFF |
|
171 |
#elif defined(TTD_BIG_ENDIAN) |
|
500
8e52f7797b48
(svn r793) Merge INLINE -> inline replacement (revision 376)
tron
parents:
239
diff
changeset
|
172 |
static inline uint16 READ_LE_UINT16(const void *b) { |
222
b88456001397
(svn r223) -Fix: Const correctness and miscellaneous fixes. Thank you Tron for your diligent fixing of warnings (and some possibly bugs) (Tron)
darkvater
parents:
193
diff
changeset
|
173 |
return ((const byte*)b)[0] + (((const byte*)b)[1] << 8); |
0 | 174 |
} |
193
0a7025304867
(svn r194) -Codechange: stripping trailing-spaces. Please keep this that way!
truelight
parents:
22
diff
changeset
|
175 |
# define ADD_WORD(x) ((x) >> 8)&0xFF, (x)&0xFF |
0 | 176 |
# define ADD_DWORD(x) ((x) >> 24)&0xFF, ((x) >> 16)&0xFF, ((x) >> 8)&0xFF, (x)&0xFF |
177 |
#endif |
|
178 |
||
500
8e52f7797b48
(svn r793) Merge INLINE -> inline replacement (revision 376)
tron
parents:
239
diff
changeset
|
179 |
static inline void WRITE_LE_UINT16(void *b, uint16 x) { |
0 | 180 |
((byte*)b)[0] = (byte)x; |
181 |
((byte*)b)[1] = (byte)(x >> 8); |
|
182 |
} |
|
183 |
||
22 | 184 |
#define MAX_DETOUR 6 |
185 |
||
0 | 186 |
#endif /* MACROS_H */ |