1

/* $Id$ */

     2

     3

#ifndef MAP_H

     4

#define MAP_H

     5

     6

#include "stdafx.h"

     7

     8

// Putting externs inside inline functions seems to confuse the aliasing

     9

// checking on MSVC6. Never use those variables directly.

    10

extern uint _map_log_x;

    11

extern uint _map_size_x;

    12

extern uint _map_size_y;

    13

extern uint _map_tile_mask;

    14

extern uint _map_size;

    15

    16

#define TILE_MASK(x) ((x) & _map_tile_mask)

    17

#define TILE_ASSERT(x) assert(TILE_MASK(x) == (x));

    18

    19

typedef struct Tile {

    20

	byte type_height;

    21

	byte m1;

    22

	uint16 m2;

    23

	byte m3;

    24

	byte m4;

    25

	byte m5;

    26

	byte m6;

    27

} Tile;

    28

    29

extern Tile* _m;

    30

    31

void AllocateMap(uint size_x, uint size_y);

    32

    33

// binary logarithm of the map size, try to avoid using this one

    34

static inline uint MapLogX(void)  { return _map_log_x; }

    35

/* The size of the map */

    36

static inline uint MapSizeX(void) { return _map_size_x; }

    37

static inline uint MapSizeY(void) { return _map_size_y; }

    38

/* The maximum coordinates */

    39

static inline uint MapMaxX(void) { return _map_size_x - 1; }

    40

static inline uint MapMaxY(void) { return _map_size_y - 1; }

    41

/* The number of tiles in the map */

    42

static inline uint MapSize(void) { return _map_size; }

    43

    44

// Scale a number relative to the map size

    45

uint ScaleByMapSize(uint); // Scale relative to the number of tiles

    46

uint ScaleByMapSize1D(uint); // Scale relative to the circumference of the map

    47

    48

typedef uint32 TileIndex;

    49

typedef int32 TileIndexDiff;

    50

    51

static inline TileIndex TileXY(uint x, uint y)

    52

{

    53

	return (y * MapSizeX()) + x;

    54

}

    55

    56

static inline TileIndexDiff TileDiffXY(int x, int y)

    57

{

    58

	// Multiplication gives much better optimization on MSVC than shifting.

    59

	// 0 << shift isn't optimized to 0 properly.

    60

	// Typically x and y are constants, and then this doesn't result

    61

	// in any actual multiplication in the assembly code..

    62

	return (y * MapSizeX()) + x;

    63

}

    64

    65

static inline TileIndex TileVirtXY(uint x, uint y)

    66

{

    67

	return (y >> 4 << MapLogX()) + (x >> 4);

    68

}

    69

    70

    71

enum {

    72

	INVALID_TILE = (TileIndex)-1

    73

};

    74

    75

enum {

    76

	TILE_SIZE   = 16,   /* Tiles are 16x16 "units" in size */

    77

	TILE_PIXELS = 32,   /* a tile is 32x32 pixels */

    78

	TILE_HEIGHT =  8,   /* The standard height-difference between tiles on two levels is 8 (z-diff 8) */

    79

};

    80

    81

    82

static inline uint TileX(TileIndex tile)

    83

{

    84

	return tile & MapMaxX();

    85

}

    86

    87

static inline uint TileY(TileIndex tile)

    88

{

    89

	return tile >> MapLogX();

    90

}

    91

    92

    93

typedef struct TileIndexDiffC {

    94

	int16 x;

    95

	int16 y;

    96

} TileIndexDiffC;

    97

    98

static inline TileIndexDiff ToTileIndexDiff(TileIndexDiffC tidc)

    99

{

   100

	return (tidc.y << MapLogX()) + tidc.x;

   101

}

   102

   103

   104

#ifndef _DEBUG

   105

	#define TILE_ADD(x,y) ((x) + (y))

   106

#else

   107

	extern TileIndex TileAdd(TileIndex tile, TileIndexDiff add,

   108

		const char *exp, const char *file, int line);

   109

	#define TILE_ADD(x, y) (TileAdd((x), (y), #x " + " #y, __FILE__, __LINE__))

   110

#endif

   111

   112

#define TILE_ADDXY(tile, x, y) TILE_ADD(tile, TileDiffXY(x, y))

   113

   114

uint TileAddWrap(TileIndex tile, int addx, int addy);

   115

   116

static inline TileIndexDiffC TileIndexDiffCByDiagDir(uint dir) {

   117

	extern const TileIndexDiffC _tileoffs_by_diagdir[4];

   118

   119

	assert(dir < lengthof(_tileoffs_by_diagdir));

   120

	return _tileoffs_by_diagdir[dir];

   121

}

   122

   123

/* Returns tile + the diff given in diff. If the result tile would end up

   124

 * outside of the map, INVALID_TILE is returned instead.

   125

 */

   126

static inline TileIndex AddTileIndexDiffCWrap(TileIndex tile, TileIndexDiffC diff) {

   127

	int x = TileX(tile) + diff.x;

   128

	int y = TileY(tile) + diff.y;

   129

	if (x < 0 || y < 0 || x > (int)MapMaxX() || y > (int)MapMaxY())

   130

		return INVALID_TILE;

   131

	else

   132

		return TileXY(x, y);

   133

}

   134

   135

// Functions to calculate distances

   136

uint DistanceManhattan(TileIndex, TileIndex); // also known as L1-Norm. Is the shortest distance one could go over diagonal tracks (or roads)

   137

uint DistanceSquare(TileIndex, TileIndex); // euclidian- or L2-Norm squared

   138

uint DistanceMax(TileIndex, TileIndex); // also known as L-Infinity-Norm

   139

uint DistanceMaxPlusManhattan(TileIndex, TileIndex); // Max + Manhattan

   140

uint DistanceFromEdge(TileIndex); // shortest distance from any edge of the map

   141

   142

   143

#define BEGIN_TILE_LOOP(var,w,h,tile)                      \

   144

	{                                                        \

   145

		int h_cur = h;                                         \

   146

		uint var = tile;                                       \

   147

		do {                                                   \

   148

			int w_cur = w;                                       \

   149

			do {

   150

   151

#define END_TILE_LOOP(var,w,h,tile)                        \

   152

			} while (++var, --w_cur != 0);                       \

   153

		} while (var += TileDiffXY(0, 1) - (w), --h_cur != 0); \

   154

	}

   155

   156

static inline TileIndexDiff TileOffsByDiagDir(uint dir)

   157

{

   158

	extern const TileIndexDiffC _tileoffs_by_diagdir[4];

   159

   160

	assert(dir < lengthof(_tileoffs_by_diagdir));

   161

	return ToTileIndexDiff(_tileoffs_by_diagdir[dir]);

   162

}

   163

   164

static inline TileIndexDiff TileOffsByDir(uint dir)

   165

{

   166

	extern const TileIndexDiffC _tileoffs_by_dir[8];

   167

   168

	assert(dir < lengthof(_tileoffs_by_dir));

   169

	return ToTileIndexDiff(_tileoffs_by_dir[dir]);

   170

}

   171

   172

typedef bool TestTileOnSearchProc(TileIndex tile, uint32 data);

   173

bool CircularTileSearch(TileIndex tile, uint size, TestTileOnSearchProc proc, uint32 data);

   174

   175

/* Approximation of the length of a straight track, relative to a diagonal

   176

 * track (ie the size of a tile side). #defined instead of const so it can

   177

 * stay integer. (no runtime float operations) Is this needed?

   178

 * Watch out! There are _no_ brackets around here, to prevent intermediate

   179

 * rounding! Be careful when using this!

   180

 * This value should be sqrt(2)/2 ~ 0.7071 */

   181

#define STRAIGHT_TRACK_LENGTH 7071/10000

   182

   183

#endif /* MAP_H */