1

/* $Id$ */

     2

     3

#ifndef MACROS_H

     4

#define MACROS_H

     5

     6

#include "map.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

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

    24

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

    25

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

    26

    27

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

    28

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

    29

    30

    31

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

    32

{

    33

	if (a <= min) return min;

    34

	if (a >= max) return max;

    35

	return a;

    36

}

    37

    38

    39

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

    40

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

    41

}

    42

    43

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

    44

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

    45

}

    46

    47

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

    48

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

    49

}

    50

    51

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

    52

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

    53

}

    54

    55

/* OPT: optimized into an unsigned comparison */

    56

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

    57

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

    58

    59

    60

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

    61

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

    62

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

    63

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

    64

    65

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

    66

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

    67

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

    68

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

    69

    70

#define PLAYER_SPRITE_COLOR(owner) ( (_player_colors[owner] + 0x307) << PALETTE_SPRITE_START)

    71

#define SPRITE_PALETTE(x) ((x) | PALETTE_MODIFIER_COLOR)

    72

    73

extern const byte _ffb_64[128];

    74

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

    75

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

    76

 * 0.

    77

 */

    78

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

    79

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

    80

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

    81

 */

    82

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

    83

    84

static inline int FindFirstBit2x64(int value)

    85

{

    86

/*

    87

	int i = 0;

    88

	if ( (byte) value == 0) {

    89

		i += 8;

    90

		value >>= 8;

    91

	}

    92

	return i + FIND_FIRST_BIT(value & 0x3F);

    93

    94

Faster ( or at least cleaner ) implementation below?

    95

*/

    96

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

    97

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

    98

	} else {

    99

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

   100

	}

   101

   102

}

   103

   104

static inline int KillFirstBit2x64(int value)

   105

{

   106

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

   107

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

   108

	} else {

   109

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

   110

	}

   111

}

   112

   113

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

   114

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

   115

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

   116

   117

   118

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

   119

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

   120

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

   121

   122

   123

#define for_each_bit(_i, _b)            \

   124

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

   125

		if (_b & 1)

   126

   127

#define abs myabs

   128

   129

   130

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

   131

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

   132

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

   133

#define uintswap(a,b) ((b) = uintxchg_(&(a), (b)))

   134

   135

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

   136

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

   137

   138

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

   139

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

   140

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

   141

static inline void swap_int32(int32 *a, int32 *b) { int32 t = *a; *a = *b; *b = t; }

   142

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

   143

   144

   145

static inline uint16 ReadLE16Aligned(const void* x)

   146

{

   147

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

   148

}

   149

   150

static inline uint16 ReadLE16Unaligned(const void* x)

   151

{

   152

#ifdef OTTD_ALIGNMENT

   153

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

   154

#else

   155

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

   156

#endif

   157

}

   158

   159

   160

/**

   161

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

   162

 * @note Assumes a byte has 8 bits

   163

 */

   164

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

   165

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

   166

   167

/**

   168

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

   169

 * @note n must be a power of 2

   170

 */

   171

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

   172

   173

#endif /* MACROS_H */