1

#include "stdafx.h"

     2

#include "ttd.h"

     3

#include "functions.h"

     4

#include "map.h"

     5

     6

uint _map_log_x;

     7

uint _map_log_y;

     8

     9

byte   *_map_type_and_height = NULL;

    10

byte   *_map_owner           = NULL;

    11

uint16 *_map2                = NULL;

    12

byte   *_map3_lo             = NULL;

    13

byte   *_map3_hi             = NULL;

    14

byte   *_map5                = NULL;

    15

byte   *_map_extra_bits      = NULL;

    16

    17

    18

void InitMap(uint log_x, uint log_y)

    19

{

    20

	uint map_size;

    21

    22

	if (log_x < 6 || log_x > 11 || log_y < 6 || log_y > 11)

    23

		error("Invalid map size");

    24

    25

	DEBUG(map, 1)("Allocating map of size %dx%d", log_x, log_y);

    26

    27

	_map_log_x = log_x;

    28

	_map_log_y = log_y;

    29

    30

	map_size = MapSize();

    31

    32

	_map_type_and_height =

    33

		realloc(_map_type_and_height, map_size * sizeof(_map_type_and_height[0]));

    34

	_map_owner = realloc(_map_owner, map_size * sizeof(_map_owner[0]));

    35

	_map2      = realloc(_map2,      map_size * sizeof(_map2[0]));

    36

	_map3_lo   = realloc(_map3_lo,   map_size * sizeof(_map3_lo[0]));

    37

	_map3_hi   = realloc(_map3_hi,   map_size * sizeof(_map3_hi[0]));

    38

	_map5      = realloc(_map5,      map_size * sizeof(_map5[0]));

    39

	_map_extra_bits =

    40

		realloc(_map_extra_bits, map_size * sizeof(_map_extra_bits[0] / 4));

    41

    42

	// XXX TODO handle memory shortage more gracefully

    43

	if (_map_type_and_height == NULL ||

    44

			_map_owner           == NULL ||

    45

			_map2                == NULL ||

    46

			_map3_lo             == NULL ||

    47

			_map3_hi             == NULL ||

    48

			_map5                == NULL ||

    49

			_map_extra_bits      == NULL)

    50

		error("Failed to allocate memory for the map");

    51

}

    52

    53

    54

#ifdef _DEBUG

    55

TileIndex TileAdd(TileIndex tile, TileIndexDiff add,

    56

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

    57

{

    58

	int dx;

    59

	int dy;

    60

	uint x;

    61

	uint y;

    62

    63

	dx = add & MapMaxX();

    64

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

    65

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

    66

    67

	x = TileX(tile) + dx;

    68

	y = TileY(tile) + dy;

    69

    70

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

    71

		char buf[512];

    72

    73

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

    74

			exp, tile, add);

    75

#if !defined(_MSC_VER)

    76

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

    77

#else

    78

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

    79

#endif

    80

	}

    81

    82

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

    83

    84

	return TILE_XY(x,y);

    85

}

    86

#endif

    87

    88

    89

uint ScaleByMapSize(uint n)

    90

{

    91

	int shift = (int)MapLogX() - 8 + (int)MapLogY() - 8;

    92

    93

	if (shift < 0)

    94

		return (n + (1 << -shift) - 1) >> -shift;

    95

	else

    96

		return n << shift;

    97

}

    98

    99

   100

uint ScaleByMapSize1D(uint n)

   101

{

   102

	int shift = ((int)MapLogX() - 8 + (int)MapLogY() - 8) / 2;

   103

   104

	if (shift < 0)

   105

		return (n + (1 << -shift) - 1) >> -shift;

   106

	else

   107

		return n << shift;

   108

}

   109

   110

   111

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

   112

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

   113

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

   114

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

   115

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

   116

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

   117

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

   118

{

   119

	uint x, y;

   120

	x = TileX(tile) + addx;

   121

	y = TileY(tile) + addy;

   122

   123

	// Are we about to wrap?

   124

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

   125

		return tile + TILE_XY(addx, addy);

   126

   127

	return INVALID_TILE;

   128

}

   129

   130

const TileIndexDiffC _tileoffs_by_dir[] = {

   131

	{-1,  0},

   132

	{ 0,  1},

   133

	{ 1,  0},

   134

	{ 0, -1}

   135

};

   136

   137

uint DistanceManhattan(TileIndex t0, TileIndex t1)

   138

{

   139

	return

   140

		abs(TileX(t0) - TileX(t1)) +

   141

		abs(TileY(t0) - TileY(t1));

   142

}

   143

   144

   145

uint DistanceSquare(TileIndex t0, TileIndex t1)

   146

{

   147

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

   148

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

   149

	return x * x + y * y;

   150

}

   151

   152

   153

uint DistanceMax(TileIndex t0, TileIndex t1)

   154

{

   155

	const uint x = abs(TileX(t0) - TileX(t1));

   156

	const uint y = abs(TileY(t0) - TileY(t1));

   157

	return x > y ? x : y;

   158

}

   159

   160

   161

uint DistanceMaxPlusManhattan(TileIndex t0, TileIndex t1)

   162

{

   163

	const uint x = abs(TileX(t0) - TileX(t1));

   164

	const uint y = abs(TileY(t0) - TileY(t1));

   165

	return x > y ? 2 * x + y : 2 * y + x;

   166

}

   167

   168

   169

uint DistanceFromEdge(TileIndex tile)

   170

{

   171

	const uint xl = TileX(tile);

   172

	const uint yl = TileY(tile);

   173

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

   174

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

   175

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

   176

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

   177

	return minl < minh ? minl : minh;

   178

}

   179