1

/* $Id$ */

     2

     3

#include "stdafx.h"

     4

#include "openttd.h"

     5

#include "debug.h"

     6

#include "functions.h"

     7

#include "macros.h"

     8

#include "map.h"

     9

#include "direction.h"

    10

#include "helpers.hpp"

    11

    12

#if defined(_MSC_VER) && _MSC_VER >= 1400 /* VStudio 2005 is stupid! */

    13

/* Why the hell is that not in all MSVC headers?? */

    14

extern "C" _CRTIMP void __cdecl _assert(void *, void *, unsigned);

    15

#endif

    16

    17

uint _map_log_x;

    18

uint _map_size_x;

    19

uint _map_size_y;

    20

uint _map_tile_mask;

    21

uint _map_size;

    22

    23

Tile* _m = NULL;

    24

    25

    26

void AllocateMap(uint size_x, uint size_y)

    27

{

    28

	// Make sure that the map size is within the limits and that

    29

	// the x axis size is a power of 2.

    30

	if (size_x < 64 || size_x > 2048 ||

    31

			size_y < 64 || size_y > 2048 ||

    32

			(size_x&(size_x-1)) != 0 ||

    33

			(size_y&(size_y-1)) != 0)

    34

		error("Invalid map size");

    35

    36

	DEBUG(map, 1, "Allocating map of size %dx%d", size_x, size_y);

    37

    38

	_map_log_x = FindFirstBit(size_x);

    39

	_map_size_x = size_x;

    40

	_map_size_y = size_y;

    41

	_map_size = size_x * size_y;

    42

	_map_tile_mask = _map_size - 1;

    43

    44

	free(_m);

    45

	_m = CallocT<Tile>(_map_size);

    46

    47

	// XXX TODO handle memory shortage more gracefully

    48

	if (_m == NULL) error("Failed to allocate memory for the map");

    49

}

    50

    51

    52

#ifdef _DEBUG

    53

TileIndex TileAdd(TileIndex tile, TileIndexDiff add,

    54

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

    55

{

    56

	int dx;

    57

	int dy;

    58

	uint x;

    59

	uint y;

    60

    61

	dx = add & MapMaxX();

    62

	if (dx >= (int)MapSizeX() / 2) dx -= MapSizeX();

    63

	dy = (add - dx) / (int)MapSizeX();

    64

    65

	x = TileX(tile) + dx;

    66

	y = TileY(tile) + dy;

    67

    68

	if (x >= MapSizeX() || y >= MapSizeY()) {

    69

		char buf[512];

    70

    71

		snprintf(buf, lengthof(buf), "TILE_ADD(%s) when adding 0x%.4X and 0x%.4X failed",

    72

			exp, tile, add);

    73

#if !defined(_MSC_VER)

    74

		fprintf(stderr, "%s:%d %s\n", file, line, buf);

    75

#else

    76

		_assert(buf, (char*)file, line);

    77

#endif

    78

	}

    79

    80

	assert(TileXY(x,y) == TILE_MASK(tile + add));

    81

    82

	return TileXY(x,y);

    83

}

    84

#endif

    85

    86

    87

uint ScaleByMapSize(uint n)

    88

{

    89

	// First shift by 12 to prevent integer overflow for large values of n.

    90

	// >>12 is safe since the min mapsize is 64x64

    91

	// Add (1<<4)-1 to round upwards.

    92

	return (n * (MapSize() >> 12) + (1<<4) - 1) >> 4;

    93

}

    94

    95

    96

// Scale relative to the circumference of the map

    97

uint ScaleByMapSize1D(uint n)

    98

{

    99

	// Normal circumference for the X+Y is 256+256 = 1<<9

   100

	// Note, not actually taking the full circumference into account,

   101

	// just half of it.

   102

	// (1<<9) - 1 is there to scale upwards.

   103

	return (n * (MapSizeX() + MapSizeY()) + (1<<9) - 1) >> 9;

   104

}

   105

   106

   107

// This function checks if we add addx/addy to tile, if we

   108

//  do wrap around the edges. For example, tile = (10,2) and

   109

//  addx = +3 and addy = -4. This function will now return

   110

//  INVALID_TILE, because the y is wrapped. This is needed in

   111

//  for example, farmland. When the tile is not wrapped,

   112

//  the result will be tile + TileDiffXY(addx, addy)

   113

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

   114

{

   115

	uint x = TileX(tile) + addx;

   116

	uint y = TileY(tile) + addy;

   117

   118

	// Are we about to wrap?

   119

	if (x < MapMaxX() && y < MapMaxY())

   120

		return tile + TileDiffXY(addx, addy);

   121

   122

	return INVALID_TILE;

   123

}

   124

   125

extern const TileIndexDiffC _tileoffs_by_diagdir[] = {

   126

	{-1,  0}, // DIAGDIR_NE

   127

	{ 0,  1}, // DIAGDIR_SE

   128

	{ 1,  0}, // DIAGDIR_SW

   129

	{ 0, -1}  // DIAGDIR_NW

   130

};

   131

   132

extern const TileIndexDiffC _tileoffs_by_dir[] = {

   133

	{-1, -1}, // DIR_N

   134

	{-1,  0}, // DIR_NE

   135

	{-1,  1}, // DIR_E

   136

	{ 0,  1}, // DIR_SE

   137

	{ 1,  1}, // DIR_S

   138

	{ 1,  0}, // DIR_SW

   139

	{ 1, -1}, // DIR_W

   140

	{ 0, -1}  // DIR_NW

   141

};

   142

   143

uint DistanceManhattan(TileIndex t0, TileIndex t1)

   144

{

   145

	const uint dx = delta(TileX(t0), TileX(t1));

   146

	const uint dy = delta(TileY(t0), TileY(t1));

   147

	return dx + dy;

   148

}

   149

   150

   151

uint DistanceSquare(TileIndex t0, TileIndex t1)

   152

{

   153

	const int dx = TileX(t0) - TileX(t1);

   154

	const int dy = TileY(t0) - TileY(t1);

   155

	return dx * dx + dy * dy;

   156

}

   157

   158

   159

uint DistanceMax(TileIndex t0, TileIndex t1)

   160

{

   161

	const uint dx = delta(TileX(t0), TileX(t1));

   162

	const uint dy = delta(TileY(t0), TileY(t1));

   163

	return dx > dy ? dx : dy;

   164

}

   165

   166

   167

uint DistanceMaxPlusManhattan(TileIndex t0, TileIndex t1)

   168

{

   169

	const uint dx = delta(TileX(t0), TileX(t1));

   170

	const uint dy = delta(TileY(t0), TileY(t1));

   171

	return dx > dy ? 2 * dx + dy : 2 * dy + dx;

   172

}

   173

   174

uint DistanceFromEdge(TileIndex tile)

   175

{

   176

	const uint xl = TileX(tile);

   177

	const uint yl = TileY(tile);

   178

	const uint xh = MapSizeX() - 1 - xl;

   179

	const uint yh = MapSizeY() - 1 - yl;

   180

	const uint minl = xl < yl ? xl : yl;

   181

	const uint minh = xh < yh ? xh : yh;

   182

	return minl < minh ? minl : minh;

   183

}

   184

   185

/**

   186

 * Function performing a search around a center tile and going outward, thus in circle.

   187

 * Although it really is a square search...

   188

 * Every tile will be tested by means of the callback function proc,

   189

 * which will determine if yes or no the given tile meets criteria of search.

   190

 * @param tile to start the search from

   191

 * @param size: number of tiles per side of the desired search area

   192

 * @param proc: callback testing function pointer.

   193

 * @param data to be passed to the callback function. Depends on the implementation

   194

 * @result of the search

   195

 * @pre proc != NULL

   196

 * @pre size > 0

   197

 */

   198

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

   199

{

   200

	uint n, x, y;

   201

	DiagDirection dir;

   202

   203

	assert(proc != NULL);

   204

	assert(size > 0);

   205

   206

	x = TileX(tile);

   207

	y = TileY(tile);

   208

   209

	if (size % 2 == 1) {

   210

		/* If the length of the side is uneven, the center has to be checked

   211

		 * separately, as the pattern of uneven sides requires to go around the center */

   212

		n = 2;

   213

		if (proc(TileXY(x, y), data)) return true;

   214

   215

		/* If tile test is not successfull, get one tile down and left,

   216

		 * ready for a test in first circle around center tile */

   217

		x += _tileoffs_by_dir[DIR_W].x;

   218

		y += _tileoffs_by_dir[DIR_W].y;

   219

	} else {

   220

		n = 1;

   221

		/* To use _tileoffs_by_diagdir's order, we must relocate to

   222

		 * another tile, as we now first go 'up', 'right', 'down', 'left'

   223

		 * instead of 'right', 'down', 'left', 'up', which the calling

   224

		 * function assume. */

   225

		x++;

   226

	}

   227

   228

	for (; n < size; n += 2) {

   229

		for (dir = DIAGDIR_NE; dir < DIAGDIR_END; dir++) {

   230

			uint j;

   231

			for (j = n; j != 0; j--) {

   232

				if (x <= MapMaxX() && y <= MapMaxY() && ///< Is the tile within the map?

   233

						proc(TileXY(x, y), data)) {     ///< Is the callback successfulll?

   234

					return true;                        ///< then stop the search

   235

				}

   236

   237

				/* Step to the next 'neighbour' in the circular line */

   238

				x += _tileoffs_by_diagdir[dir].x;

   239

				y += _tileoffs_by_diagdir[dir].y;

   240

			}

   241

		}

   242

		/* Jump to next circle to test */

   243

		x += _tileoffs_by_dir[DIR_W].x;

   244

		y += _tileoffs_by_dir[DIR_W].y;

   245

	}

   246

	return false;

   247

}