1

/* $Id$ */

     2

     3

/** @file map.h */

     4

     5

#ifndef MAP_H

     6

#define MAP_H

     7

     8

#include "stdafx.h"

     9

#include "direction.h"

    10

    11

extern uint _map_tile_mask;

    12

    13

/**

    14

 * 'Wraps' the given tile to it is within the map. It does

    15

 * this by masking the 'high' bits of.

    16

 * @param x the tile to 'wrap'

    17

 */

    18

    19

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

    20

/**

    21

 * Asserts when the tile is outside of the map.

    22

 * @param x the tile to check

    23

 */

    24

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

    25

    26

/**

    27

 * Data that is stored per tile. Also used TileExtended for this.

    28

 * Look at docs/landscape.html for the exact meaning of the members.

    29

 */

    30

struct Tile {

    31

	byte type_height; ///< The type (bits 4..7) and height of the northern corner

    32

	byte m1;   ///< Primarily used for ownership information

    33

	uint16 m2; ///< Primarily used for indices to towns, industries and stations

    34

	byte m3;   ///< General purpose

    35

	byte m4;   ///< General purpose

    36

	byte m5;   ///< General purpose

    37

	byte m6;   ///< Primarily used for bridges and rainforest/desert

    38

};

    39

    40

/**

    41

 * Data that is stored per tile. Also used Tile for this.

    42

 * Look at docs/landscape.html for the exact meaning of the members.

    43

 */

    44

struct TileExtended {

    45

	byte m7; ///< Primarily used for newgrf support

    46

};

    47

    54

extern Tile *_m;

    62

extern TileExtended *_me;

    63

    67

void AllocateMap(uint size_x, uint size_y);

    68

    69

/**

    70

 * Logarithm of the map size along the X side.

    71

 * @note try to avoid using this one

    72

 * @return 2^"return value" == MapSizeX()

    73

 */

    74

static inline uint MapLogX()

    75

{

    76

	extern uint _map_log_x;

    77

	return _map_log_x;

    78

}

    79

    80

/**

    81

 * Get the size of the map along the X

    82

 * @return the number of tiles along the X of the map

    83

 */

    84

static inline uint MapSizeX()

    85

{

    86

	extern uint _map_size_x;

    87

	return _map_size_x;

    88

}

    89

    90

/**

    91

 * Get the size of the map along the Y

    92

 * @return the number of tiles along the Y of the map

    93

 */

    94

static inline uint MapSizeY()

    95

{

    96

	extern uint _map_size_y;

    97

	return _map_size_y;

    98

}

    99

   100

/**

   101

 * Get the size of the map

   102

 * @return the number of tiles of the map

   103

 */

   104

static inline uint MapSize()

   105

{

   106

	extern uint _map_size;

   107

	return _map_size;

   108

}

   109

   110

/**

   111

 * Gets the maximum X coordinate within the map, including MP_VOID

   112

 * @return the maximum X coordinate

   113

 */

   114

static inline uint MapMaxX()

   115

{

   116

	return MapSizeX() - 1;

   117

}

   118

   119

/**

   120

 * Gets the maximum X coordinate within the map, including MP_VOID

   121

 * @return the maximum X coordinate

   122

 */

   123

static inline uint MapMaxY()

   124

{

   125

	return MapSizeY() - 1;

   126

}

   127

   132

   141

typedef uint32 TileIndex;

   153

typedef int32 TileIndexDiff;

   154

   162

static inline TileIndex TileXY(uint x, uint y)

   163

{

   164

	return (y * MapSizeX()) + x;

   165

}

   166

   178

static inline TileIndexDiff TileDiffXY(int x, int y)

   179

{

   180

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

   181

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

   182

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

   183

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

   184

	return (y * MapSizeX()) + x;

   185

}

   186

   187

static inline TileIndex TileVirtXY(uint x, uint y)

   188

{

   189

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

   190

}

   191

   192

   193

enum {

   194

	INVALID_TILE = (TileIndex)-1 ///< The very nice invalid tile marker

   195

};

   196

   197

enum {

   198

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

   199

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

   200

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

   201

};

   202

   203

   204

/**

   205

 * Get the X component of a tile

   206

 * @param tile the tile to get the X component of

   207

 * @return the X component

   208

 */

   209

static inline uint TileX(TileIndex tile)

   210

{

   211

	return tile & MapMaxX();

   212

}

   213

   214

/**

   215

 * Get the Y component of a tile

   216

 * @param tile the tile to get the Y component of

   217

 * @return the Y component

   218

 */

   219

static inline uint TileY(TileIndex tile)

   220

{

   221

	return tile >> MapLogX();

   222

}

   223

   230

struct TileIndexDiffC {

   233

};

   234

   245

static inline TileIndexDiff ToTileIndexDiff(TileIndexDiffC tidc)

   246

{

   247

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

   248

}

   249

   250

   251

#ifndef _DEBUG

   259

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

   260

#else

   261

	extern TileIndex TileAdd(TileIndex tile, TileIndexDiff add,

   262

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

   263

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

   264

#endif

   265

   273

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

   274

   278

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

   279

   286

static inline TileIndexDiffC TileIndexDiffCByDiagDir(DiagDirection dir)

   287

{

   288

	extern const TileIndexDiffC _tileoffs_by_diagdir[DIAGDIR_END];

   289

   290

	assert(IsValidDiagDirection(dir));

   291

	return _tileoffs_by_diagdir[dir];

   292

}

   297

 * outside of the map, INVALID_TILE is returned instead.

   302

 */

   303

static inline TileIndex AddTileIndexDiffCWrap(TileIndex tile, TileIndexDiffC diff)

   304

{

   305

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

   306

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

   307

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

   308

		return INVALID_TILE;

   309

	else

   310

		return TileXY(x, y);

   311

}

   312

   313

/**

   314

 * Returns the diff between two tiles

   315

 *

   316

 * @param tile_a from tile

   317

 * @param tile_b to tile

   318

 * @return the difference between tila_a and tile_b

   319

 */

   320

static inline TileIndexDiffC TileIndexToTileIndexDiffC(TileIndex tile_a, TileIndex tile_b)

   321

{

   322

	TileIndexDiffC difference;

   323

   324

	difference.x = TileX(tile_a) - TileX(tile_b);

   325

	difference.y = TileY(tile_a) - TileY(tile_b);

   326

   327

	return difference;

   328

}

   329

   330

/* Functions to calculate distances */

   331

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

   332

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

   333

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

   334

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

   335

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

   336

   347

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

   348

	{                                                        \

   349

		int h_cur = h;                                         \

   350

		uint var = tile;                                       \

   351

		do {                                                   \

   352

			int w_cur = w;                                       \

   353

			do {

   359

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

   360

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

   361

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

   362

	}

   370

static inline TileIndexDiff TileOffsByDiagDir(DiagDirection dir)

   371

{

   372

	extern const TileIndexDiffC _tileoffs_by_diagdir[DIAGDIR_END];

   373

   374

	assert(IsValidDiagDirection(dir));

   375

	return ToTileIndexDiff(_tileoffs_by_diagdir[dir]);

   376

}

   377

   384

static inline TileIndexDiff TileOffsByDir(Direction dir)

   385

{

   386

	extern const TileIndexDiffC _tileoffs_by_dir[DIR_END];

   387

   388

	assert(IsValidDirection(dir));

   389

	return ToTileIndexDiff(_tileoffs_by_dir[dir]);

   390

}

   391

   411

typedef bool TestTileOnSearchProc(TileIndex tile, uint32 data);

   416

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

   417

   422

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

   423

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

   424

 * rounding! Be careful when using this!

   425

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

   426

#define STRAIGHT_TRACK_LENGTH 7071/10000

   427

   428

#endif /* MAP_H */