1

#ifndef MAP_H

     2

#define MAP_H

     3

     4

#include "stdafx.h"

     5

     6

#define TILE_XY(x,y) (((y) << MapLogX()) + (x))

     7

     8

#define TILE_MASK(x) ((x) & ((1 << (MapLogX() + MapLogY())) - 1))

     9

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

    10

    11

extern byte   *_map_type_and_height;

    12

extern byte   *_map_owner;

    13

extern uint16 *_map2;

    14

extern byte   *_map3_lo;

    15

extern byte   *_map3_hi;

    16

extern byte   *_map5;

    17

extern byte   *_map_extra_bits;

    18

    19

void InitMap(uint log_x, uint log_y);

    20

    21

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

    22

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

    23

static inline uint MapLogY(void)  { extern uint _map_log_y; return _map_log_y; }

    24

/* The size of the map */

    25

static inline uint MapSizeX(void) { return 1 << MapLogX(); }

    26

static inline uint MapSizeY(void) { return 1 << MapLogY(); }

    27

/* The maximum coordinates */

    28

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

    29

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

    30

/* The number of tiles in the map */

    31

static inline uint MapSize(void) { return MapSizeX() * MapSizeY(); }

    32

    33

// Scale a number relative to the map size

    34

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

    35

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

    36

    37

typedef uint32 TileIndex;

    38

    44

typedef enum {

    45

	OWNER_TOWN			= 0xf,	// a town owns the tile

    46

	OWNER_NONE			= 0x10,	// nobody owns the tile

    47

	OWNER_WATER			= 0x11,	// "water" owns the tile

    48

	OWNER_SPECTATOR	= 0xff,	// spectator in MP or in scenario editor

    49

} Owner;

    50

    51

enum {

    52

	INVALID_TILE = (TileIndex)-1

    53

};

    54

    55

enum {

    56

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

    57

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

    58

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

    59

};

    60

    61

    62

static inline uint TileX(TileIndex tile)

    63

{

    64

	return tile & MapMaxX();

    65

}

    66

    67

static inline uint TileY(TileIndex tile)

    68

{

    69

	return tile >> MapLogX();

    70

}

    71

    72

    73

typedef int32 TileIndexDiff;

    74

    75

typedef struct TileIndexDiffC {

    76

	int16 x;

    77

	int16 y;

    78

} TileIndexDiffC;

    79

    80

static inline TileIndexDiff ToTileIndexDiff(TileIndexDiffC tidc)

    81

{

    82

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

    83

}

    84

    85

    86

#ifndef _DEBUG

    87

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

    88

#else

    89

	extern TileIndex TileAdd(TileIndex tile, TileIndexDiff add,

    90

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

    91

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

    92

#endif

    93

    94

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

    95

    96

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

    97

    98

static inline TileIndexDiffC TileIndexDiffCByDir(uint dir) {

    99

	extern const TileIndexDiffC _tileoffs_by_dir[4];

   100

	return _tileoffs_by_dir[dir];

   101

}

   102

   103

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

   104

 * outside of the map, INVALID_TILE is returned instead.

   105

 */

   106

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

   107

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

   108

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

   109

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

   110

		return INVALID_TILE;

   111

	else

   112

		return TILE_XY(x, y);

   113

}

   114

   115

// Functions to calculate distances

   116

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

   117

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

   118

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

   119

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

   120

uint DistanceTrack(TileIndex, TileIndex); // Returns the shortest distance one could go over tracks

   121

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

   122

   123

   124

static inline TileIndexDiff TileOffsByDir(uint dir)

   125

{

   126

	extern const TileIndexDiffC _tileoffs_by_dir[4];

   127

   128

	assert(dir < lengthof(_tileoffs_by_dir));

   129

	return ToTileIndexDiff(_tileoffs_by_dir[dir]);

   130

}

   131

   132

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

   133

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

   134

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

   135

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

   136

 * rounding! Be careful when using this!

   137

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

   138

#define STRAIGHT_TRACK_LENGTH 7071/10000

   139

   140

#endif