1

/* $Id$ */

     2

     3

/** @file macros.h */

     4

     5

#ifndef MACROS_H

     6

#define MACROS_H

     7

     8

/* Fetch n bits starting at bit s from x */

     9

#define GB(x, s, n) (((x) >> (s)) & ((1U << (n)) - 1))

    10

/* Set n bits starting at bit s in x to d */

    11

#define SB(x, s, n, d) ((x) = ((x) & ~(((1U << (n)) - 1) << (s))) | ((d) << (s)))

    12

/* Add i to the n bits starting at bit s in x */

    13

#define AB(x, s, n, i) ((x) = ((x) & ~(((1U << (n)) - 1) << (s))) | (((x) + ((i) << (s))) & (((1U << (n)) - 1) << (s))))

    14

    15

#ifdef min

    16

#undef min

    17

#endif

    18

    19

#ifdef max

    20

#undef max

    21

#endif

    22

    23

template <typename T>

    24

static inline T max(T a, T b)

    25

{

    26

	return a >= b ? a : b;

    27

}

    28

    35

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

    36

    37

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

    38

    39

    40

static inline int clamp(int a, int min, int max)

    41

{

    42

	if (a <= min) return min;

    43

	if (a >= max) return max;

    44

	return a;

    45

}

    46

    47

static inline uint clampu(uint a, uint min, uint max)

    48

{

    49

	if (a <= min) return min;

    50

	if (a >= max) return max;

    51

	return a;

    52

}

    53

    62

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

    63

{

    64

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

    65

}

    66

    67

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

    68

{

    69

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

    70

}

    71

    72

    73

/* OPT: optimized into an unsigned comparison */

    74

//#define IS_INSIDE_1D(x, base, size) ((x) >= (base) && (x) < (base) + (size))

    75

#define IS_INSIDE_1D(x, base, size) ( (uint)((x) - (base)) < ((uint)(size)) )

    76

    77

template<typename T> static inline bool HASBIT(T x, int y)

    78

{

    79

	return (x & ((T)1 << y)) != 0;

    80

}

    81

    82

template<typename T> static inline T SETBIT(T& x, int y)

    83

{

    84

	return x |= (T)1 << y;

    85

}

    86

    87

template<typename T> static inline T CLRBIT(T& x, int y)

    88

{

    89

	return x &= ~((T)1 << y);

    90

}

    91

    92

template<typename T> static inline T TOGGLEBIT(T& x, int y)

    93

{

    94

	return x ^= (T)1 << y;

    95

}

    96

    97

    98

/* checking more bits. Maybe unneccessary, but easy to use */

    99

#define HASBITS(x, y) ((x) & (y))

   100

#define SETBITS(x, y) ((x) |= (y))

   101

#define CLRBITS(x, y) ((x) &= ~(y))

   102

   103

#define GENERAL_SPRITE_COLOR(color) ((color) + PALETTE_RECOLOR_START)

   104

#define PLAYER_SPRITE_COLOR(owner) (GENERAL_SPRITE_COLOR(_player_colors[owner]))

   105

   106

extern const byte _ffb_64[128];

   107

/* Returns the position of the first bit that is not zero, counted from the

   108

 * left. Ie, 10110100 returns 2, 00000001 returns 0, etc. When x == 0 returns

   109

 * 0.

   110

 */

   111

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

   112

/* Returns x with the first bit that is not zero, counted from the left, set

   113

 * to zero. So, 10110100 returns 10110000, 00000001 returns 00000000, etc.

   114

 */

   115

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

   116

   117

static inline int FindFirstBit2x64(int value)

   118

{

   119

/*

   120

	int i = 0;

   121

	if ( (byte) value == 0) {

   122

		i += 8;

   123

		value >>= 8;

   124

	}

   125

	return i + FIND_FIRST_BIT(value & 0x3F);

   126

   127

Faster ( or at least cleaner ) implementation below?

   128

*/

   129

	if (GB(value, 0, 8) == 0) {

   130

		return FIND_FIRST_BIT(GB(value, 8, 6)) + 8;

   131

	} else {

   132

		return FIND_FIRST_BIT(GB(value, 0, 6));

   133

	}

   134

   135

}

   136

   137

static inline int KillFirstBit2x64(int value)

   138

{

   139

	if (GB(value, 0, 8) == 0) {

   140

		return KILL_FIRST_BIT(GB(value, 8, 6)) << 8;

   141

	} else {

   142

		return value & (KILL_FIRST_BIT(GB(value, 0, 6)) | 0x3F00);

   143

	}

   144

}

   145

   146

/** returns true if value a has only one bit set to 1 */

   147

#define HAS_SINGLE_BIT(a) ( ((a) & ((a) - 1)) == 0)

   148

   149

/* [min,max), strictly less than */

   150

#define IS_BYTE_INSIDE(a, min, max) ((byte)((a) - (min)) < (byte)((max) - (min)))

   151

#define IS_INT_INSIDE(a, min, max) ((uint)((a) - (min)) < (uint)((max) - (min)))

   152

   153

   154

#define CHANCE16(a, b) ((uint16)Random() <= (uint16)((65536 * (a)) / (b)))

   155

#define CHANCE16R(a, b, r) ((uint16)(r = Random()) <= (uint16)((65536 * (a)) / (b)))

   156

#define CHANCE16I(a, b, v) ((uint16)(v) <= (uint16)((65536 * (a)) / (b)))

   157

   158

   159

#define for_each_bit(_i, _b)            \

   160

	for (_i = 0; _b != 0; _i++, _b >>= 1) \

   161

		if (_b & 1)

   162

   163

#define abs myabs

   164

   165

   166

static inline uint16 ReadLE16Aligned(const void* x)

   167

{

   168

	return FROM_LE16(*(const uint16*)x);

   169

}

   170

   171

static inline uint16 ReadLE16Unaligned(const void* x)

   172

{

   173

#ifdef OTTD_ALIGNMENT

   174

	return ((const byte*)x)[0] | ((const byte*)x)[1] << 8;

   175

#else

   176

	return FROM_LE16(*(const uint16*)x);

   177

#endif

   178

}

   179

   180

   181

/**

   182

 * ROtate x Left/Right by n (must be >= 0)

   183

 * @note Assumes a byte has 8 bits

   184

 */

   185

#define ROL(x, n) ((x) << (n) | (x) >> (sizeof(x) * 8 - (n)))

   186

#define ROR(x, n) ((x) >> (n) | (x) << (sizeof(x) * 8 - (n)))

   187

   188

/**

   189

 * Return the smallest multiple of n equal or greater than x

   190

 * @note n must be a power of 2

   191

 */

   192

#define ALIGN(x, n) (((x) + (n) - 1) & ~((n) - 1))

   193

   194

/** return the largest value that can be entered in a variable.

   195

 */

   196

#define MAX_UVALUE(type) ((type)~(type)0)

   197

   198

#endif /* MACROS_H */