1

#ifndef MACROS_H

     2

#define MACROS_H

     3

     4

#include "map.h"

     5

     6

#define MAX_INT 0x7FFFFFFF

     7

     8

#ifdef min

     9

#undef min

    10

#endif

    11

    12

#ifdef max

    13

#undef max

    14

#endif

    15

    16

static inline int min(int a, int b) { if (a <= b) return a; return b; }

    17

static inline int max(int a, int b) { if (a >= b) return a; return b; }

    18

static inline int64 max64(int64 a, int64 b) { if (a >= b) return a; return b; }

    19

    20

static inline uint minu(uint a, uint b) { if (a <= b) return a; return b; }

    21

static inline uint maxu(uint a, uint b) { if (a >= b) return a; return b; }

    22

    23

    24

static inline int clamp(int a, int min, int max) { if (a <= min) return min; if (a >= max) return max; return a; }

    25

static inline int clamp2(int a, int min, int max) { if (a <= min) a=min; if (a >= max) a=max; return a; }

    26

static inline bool int32_add_overflow(int32 a, int32 b) { return (int32)(a^b)>=0 && (int32)(a^(a+b))<0; }

    27

static inline bool int32_sub_overflow(int32 a, int32 b) { return (int32)(a^b)<0 && (int32)(a^(a-b))<0; }

    28

    29

static inline bool str_eq(const byte *a, const byte *b)

    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

    41

static inline bool str_is_below(byte *a, byte *b) {

    42

	while (*a <= *b) {

    43

		if (*a < *b) return true;

    44

		a++;

    45

		b++;

    46

	}

    47

	return false;

    48

}

    49

    50

    51

static inline int32 BIGMULSS(int32 a, int32 b, int shift) {

    52

	return (int32)(((int64)(a) * (int64)(b)) >> (shift));

    53

}

    54

    55

static inline int64 BIGMULSS64(int64 a, int64 b, int shift) {

    56

	return ((a) * (b)) >> (shift);

    57

}

    58

    59

static inline uint32 BIGMULUS(uint32 a, uint32 b, int shift) {

    60

	return (uint32)(((uint64)(a) * (uint64)(b)) >> (shift));

    61

}

    62

    63

static inline int64 BIGMULS(int32 a, int32 b) {

    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

    88

#define HASBIT(x,y)    ((x) &   (1 << (y)))

    89

#define SETBIT(x,y)    ((x) |=  (1 << (y)))

    90

#define CLRBIT(x,y)    ((x) &= ~(1 << (y)))

    91

#define TOGGLEBIT(x,y) ((x) ^=  (1 << (y)))

    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];

   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

 */

   106

#define FIND_FIRST_BIT(x) _ffb_64[(x)]

   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

 */

   110

#define KILL_FIRST_BIT(x) _ffb_64[(x)+64]

   111

   112

static inline int FindFirstBit2x64(int value)

   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

   153

static inline int intxchg_(int *a, int b) { int t = *a; *a = b; return t; }

   154

#define intxchg(a,b) intxchg_(&(a), (b))

   155

#define intswap(a,b) ((b) = intxchg_(&(a), (b)))

   156

   157

static inline int myabs(int a) { if (a<0) a = -a; return a; }

   158

static inline int64 myabs64(int64 a) { if (a<0) a = -a; return a; }

   159

   160

static inline void swap_byte(byte *a, byte *b) { byte t = *a; *a = *b; *b = t; }

   161

static inline void swap_uint16(uint16 *a, uint16 *b) { uint16 t = *a; *a = *b; *b = t; }

   162

static inline void swap_int16(int16 *a, int16 *b) { int16 t = *a; *a = *b; *b = t; }

   163

static inline void swap_tile(TileIndex *a, TileIndex *b) { TileIndex t = *a; *a = *b; *b = t; }

   164

   165

   166

   167

#if defined(TTD_LITTLE_ENDIAN)

   168

#	define READ_LE_UINT16(b) (*(const uint16*)(b))

   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)

   172

	static inline uint16 READ_LE_UINT16(const void *b) {

   173

		return ((const byte*)b)[0] + (((const byte*)b)[1] << 8);

   174

	}

   175

#	define ADD_WORD(x) ((x) >> 8)&0xFF, (x)&0xFF

   176

#	define ADD_DWORD(x) ((x) >> 24)&0xFF, ((x) >> 16)&0xFF, ((x) >> 8)&0xFF,  (x)&0xFF

   177

#endif

   178

   179

static inline void WRITE_LE_UINT16(void *b, uint16 x) {

   180

	((byte*)b)[0] = (byte)x;

   181

	((byte*)b)[1] = (byte)(x >> 8);

   182

}

   183

   184

#define MAX_DETOUR 6

   185

   186

#endif /* MACROS_H */