1

#include "stdafx.h"

     2

#include "ttd.h"

     3

#include "table/strings.h"

     4

#include "map.h"

     5

#include "station.h"

     6

#include "gfx.h"

     7

#include "window.h"

     8

#include "viewport.h"

     9

#include "command.h"

    10

#include "town.h"

    11

#include "vehicle.h"

    12

#include "news.h"

    13

#include "saveload.h"

    14

#include "economy.h"

    15

#include "player.h"

    16

#include "airport.h"

    17

#include "sprite.h"

    18

#include "table/directions.h"

    19

    20

// FIXME -- need to be embedded into Airport variable. Is dynamically

    21

// deducteable from graphics-tile array, so will not be needed

    22

const byte _airport_size_x[5] = {4, 6, 1, 6, 7 };

    23

const byte _airport_size_y[5] = {3, 6, 1, 6, 7 };

    24

    25

void ShowAircraftDepotWindow(uint tile);

    26

extern void UpdateAirplanesOnNewStation(Station *st);

    27

    28

enum {

    29

	STATIONS_MIN_FREE_FOR_AI = 30

    30

};

    31

    32

static void MarkStationDirty(Station *st)

    33

{

    34

	if (st->sign.width_1 != 0) {

    35

		InvalidateWindowWidget(WC_STATION_VIEW, st->index, 1);

    36

    37

		MarkAllViewportsDirty(

    38

			st->sign.left - 6,

    39

			st->sign.top,

    40

			st->sign.left + (st->sign.width_1 << 2) + 12,

    41

			st->sign.top + 48);

    42

	}

    43

}

    44

    45

/* Calculate the radius of the station. Basicly it is the biggest

    46

    radius that is available within the station */

    47

static byte FindCatchmentRadius(Station *st)

    48

{

    49

	byte ret = 0;

    50

    51

	if (st->bus_tile)   ret = max(ret, CA_BUS);

    52

	if (st->lorry_tile) ret = max(ret, CA_TRUCK);

    53

	if (st->train_tile) ret = max(ret, CA_TRAIN);

    54

	if (st->dock_tile)  ret = max(ret, CA_DOCK);

    55

    56

	if (st->airport_tile) {

    57

		switch (st->airport_type) {

    58

			case AT_OILRIG:        ret = max(ret, CA_AIR_OILPAD);   break;

    59

			case AT_SMALL:         ret = max(ret, CA_AIR_SMALL);    break;

    60

			case AT_HELIPORT:      ret = max(ret, CA_AIR_HELIPORT); break;

    61

			case AT_LARGE:         ret = max(ret, CA_AIR_LARGE);    break;

    62

			case AT_METROPOLITAN:  ret = max(ret, CA_AIR_METRO);    break;

    63

			case AT_INTERNATIONAL: ret = max(ret, CA_AIR_INTER);    break;

    64

		}

    65

	}

    66

    67

	return ret;

    68

}

    69

    70

#define CHECK_STATIONS_ERR ((Station*)-1)

    71

    72

static Station *GetStationAround(uint tile, int w, int h, int closest_station)

    73

{

    74

	// check around to see if there's any stations there

    75

	BEGIN_TILE_LOOP(tile_cur, w + 2, h + 2, tile - TILE_XY(1,1))

    76

		if (IS_TILETYPE(tile_cur, MP_STATION)) {

    77

			int t;

    78

			t = _map2[tile_cur];

    79

			{

    80

				Station *st = GetStation(t);

    81

				// you cannot take control of an oilrig!!

    82

				if (st->airport_type == AT_OILRIG && st->facilities == (FACIL_AIRPORT|FACIL_DOCK))

    83

					continue;

    84

			}

    85

    86

			if (closest_station == -1) {

    87

				closest_station = t;

    88

			} else if (closest_station != t) {

    89

				_error_message = STR_3006_ADJOINS_MORE_THAN_ONE_EXISTING;

    90

				return CHECK_STATIONS_ERR;

    91

			}

    92

		}

    93

	END_TILE_LOOP(tile_cur, w + 2, h + 2, tile - TILE_XY(1,1))

    94

	return (closest_station == -1) ? NULL : GetStation(closest_station);

    95

}

    96

    97

TileIndex GetStationTileForVehicle(Vehicle *v, Station *st)

    98

{

    99

	switch (v->type) {

   100

		case VEH_Train: 		return st->train_tile;

   101

		case VEH_Aircraft:	return st->airport_tile;

   102

		case VEH_Ship:			return st->dock_tile;

   103

		case VEH_Road:			return (v->cargo_type == CT_PASSENGERS) ? st->bus_tile : st->lorry_tile;

   104

		default:

   105

			assert(false);

   106

			return 0;

   107

	}

   108

}

   109

   110

static bool CheckStationSpreadOut(Station *st, uint tile, int w, int h)

   111

{

   112

	uint16 station_index = st->index;

   113

	uint i;

   114

	uint x1 = TileX(tile);

   115

	uint y1 = TileY(tile);

   116

	uint x2 = x1 + w - 1;

   117

	uint y2 = y1 + h - 1;

   118

	uint t;

   119

   120

	for (i = 0; i != MapSize(); i++) {

   121

		if (IS_TILETYPE(i, MP_STATION) && _map2[i] == station_index) {

   122

			t = TileX(i);

   123

			if (t < x1) x1 = t;

   124

			if (t > x2) x2 = t;

   125

   126

			t = TileY(i);

   127

			if (t < y1) y1 = t;

   128

			if (t > y2) y2 = t;

   129

		}

   130

	}

   131

   132

	if (y2-y1 >= _patches.station_spread || x2-x1 >= _patches.station_spread) {

   133

		_error_message = STR_306C_STATION_TOO_SPREAD_OUT;

   134

		return false;

   135

	}

   136

   137

	return true;

   138

}

   139

   140

static Station *AllocateStation()

   141

{

   142

	Station *st, *a_free = NULL;

   143

	int num_free = 0;

   144

	int i;

   145

   146

	FOR_ALL_STATIONS(st) {

   147

		if (st->xy == 0) {

   148

			num_free++;

   149

			if (a_free == NULL)

   150

				a_free = st;

   151

		}

   152

	}

   153

   154

	if (a_free == NULL ||

   155

			(num_free < STATIONS_MIN_FREE_FOR_AI && IS_HUMAN_PLAYER(_current_player))) {

   156

		_error_message = STR_3008_TOO_MANY_STATIONS_LOADING;

   157

		return NULL;

   158

	}

   159

   160

	i = a_free->index;

   161

	memset(a_free, 0, sizeof(Station));

   162

	a_free->index = i;

   163

	return a_free;

   164

}

   165

   166

   167

static int CountMapSquareAround(uint tile, byte type, byte min, byte max) {

   168

	static const TileIndexDiffC _count_square_table[] = {

   169

		{-3, -3}, {1, 0}, {1, 0}, {1, 0}, {1, 0}, {1, 0}, {1, 0},

   170

		{-6,  1}, {1, 0}, {1, 0}, {1, 0}, {1, 0}, {1, 0}, {1, 0},

   171

		{-6,  1}, {1, 0}, {1, 0}, {1, 0}, {1, 0}, {1, 0}, {1, 0},

   172

		{-6,  1}, {1, 0}, {1, 0}, {1, 0}, {1, 0}, {1, 0}, {1, 0},

   173

		{-6,  1}, {1, 0}, {1, 0}, {1, 0}, {1, 0}, {1, 0}, {1, 0},

   174

		{-6,  1}, {1, 0}, {1, 0}, {1, 0}, {1, 0}, {1, 0}, {1, 0},

   175

		{-6,  1}, {1, 0}, {1, 0}, {1, 0}, {1, 0}, {1, 0}, {1, 0}

   176

	};

   177

	const TileIndexDiffC *p;

   178

	int num = 0;

   179

   180

	for (p = _count_square_table; p != endof(_count_square_table); ++p) {

   181

		tile = TILE_MASK(tile + ToTileIndexDiff(*p));

   182

   183

		if (IS_TILETYPE(tile, type) && _map5[tile] >= min && _map5[tile] <= max)

   184

			num++;

   185

	}

   186

   187

	return num;

   188

}

   189

   190

#define M(x) ((x) - STR_SV_STNAME)

   191

   192

static bool GenerateStationName(Station *st, uint tile, int flag)

   193

{

   194

	static const uint32 _gen_station_name_bits[] = {

   195

		0,																/* 0 */

   196

		1 << M(STR_SV_STNAME_AIRPORT),		/* 1 */

   197

		1 << M(STR_SV_STNAME_OILFIELD),		/* 2 */

   198

		1 << M(STR_SV_STNAME_DOCKS),			/* 3 */

   199

		0x1FF << M(STR_SV_STNAME_BUOY_1),	/* 4 */

   200

		1 << M(STR_SV_STNAME_HELIPORT),		/* 5 */

   201

	};

   202

   203

	Town *t = st->town;

   204

	uint32 free_names = (uint32)-1;

   205

	int found;

   206

	uint z,z2;

   207

	unsigned long tmp;

   208

   209

	{

   210

		Station *s;

   211

   212

		FOR_ALL_STATIONS(s) {

   213

			if (s != st && s->xy != 0 && s->town==t) {

   214

				uint str = M(s->string_id);

   215

				if (str <= 0x20) {

   216

					if (str == M(STR_SV_STNAME_FOREST))

   217

						str = M(STR_SV_STNAME_WOODS);

   218

					CLRBIT(free_names, str);

   219

				}

   220

			}

   221

		}

   222

	}

   223

   224

	/* check default names */

   225

	tmp = free_names & _gen_station_name_bits[flag];

   226

	if (tmp != 0) {

   227

		found = FindFirstBit(tmp);

   228

		goto done;

   229

	}

   230

   231

	/* check mine? */

   232

	if (HASBIT(free_names, M(STR_SV_STNAME_MINES))) {

   233

		if (CountMapSquareAround(tile, MP_INDUSTRY, 0, 6) >= 2 ||

   234

		    CountMapSquareAround(tile, MP_INDUSTRY, 0x64, 0x73) >= 2 ||

   235

				CountMapSquareAround(tile, MP_INDUSTRY, 0x2F, 0x33) >= 2 ||

   236

				CountMapSquareAround(tile, MP_INDUSTRY, 0x48, 0x58) >= 2 ||

   237

				CountMapSquareAround(tile, MP_INDUSTRY, 0x5B, 0x63) >= 2) {

   238

					found = M(STR_SV_STNAME_MINES);

   239

					goto done;

   240

				}

   241

	}

   242

   243

	/* check close enough to town to get central as name? */

   244

	if (GetTileDist1D(tile,t->xy) < 8) {

   245

		found = M(STR_SV_STNAME);

   246

		if (HASBIT(free_names, M(STR_SV_STNAME))) goto done;

   247

   248

		found = M(STR_SV_STNAME_CENTRAL);

   249

		if (HASBIT(free_names, M(STR_SV_STNAME_CENTRAL))) goto done;

   250

	}

   251

   252

	/* Check lakeside */

   253

	if (HASBIT(free_names, M(STR_SV_STNAME_LAKESIDE)) &&

   254

			!CheckDistanceFromEdge(tile, 20) &&

   255

			CountMapSquareAround(tile, MP_WATER, 0, 0) >= 5) {

   256

				found = M(STR_SV_STNAME_LAKESIDE);

   257

				goto done;

   258

			}

   259

   260

	/* Check woods */

   261

	if (HASBIT(free_names, M(STR_SV_STNAME_WOODS)) && (

   262

			CountMapSquareAround(tile, MP_TREES, 0, 255) >= 8 ||

   263

			CountMapSquareAround(tile, MP_INDUSTRY, 0x10, 0x11) >= 2 )) {

   264

				found = (_opt.landscape==LT_DESERT) ? M(STR_SV_STNAME_FOREST) : M(STR_SV_STNAME_WOODS);

   265

				goto done;

   266

	}

   267

   268

	/* check elevation compared to town */

   269

	z = GetTileZ(tile);

   270

	z2 = GetTileZ(t->xy);

   271

	if (z < z2) {

   272

		found = M(STR_SV_STNAME_VALLEY);

   273

		if (HASBIT(free_names, M(STR_SV_STNAME_VALLEY))) goto done;

   274

	} else if (z > z2) {

   275

		found = M(STR_SV_STNAME_HEIGHTS);

   276

		if (HASBIT(free_names, M(STR_SV_STNAME_HEIGHTS))) goto done;

   277

	}

   278

   279

	/* check direction compared to town */

   280

	{

   281

		static const int8 _direction_and_table[] = {

   282

			~( (1<<M(STR_SV_STNAME_WEST)) | (1<<M(STR_SV_STNAME_EAST)) | (1<<M(STR_SV_STNAME_NORTH)) ),

   283

			~( (1<<M(STR_SV_STNAME_SOUTH)) | (1<<M(STR_SV_STNAME_WEST)) | (1<<M(STR_SV_STNAME_NORTH)) ),

   284

			~( (1<<M(STR_SV_STNAME_SOUTH)) | (1<<M(STR_SV_STNAME_EAST)) | (1<<M(STR_SV_STNAME_NORTH)) ),

   285

			~( (1<<M(STR_SV_STNAME_SOUTH)) | (1<<M(STR_SV_STNAME_WEST)) | (1<<M(STR_SV_STNAME_EAST)) ),

   286

		};

   287

   288

		free_names &= _direction_and_table[

   289

			(TileX(tile) < TileX(t->xy)) +

   290

			(TileY(tile) < TileY(t->xy)) * 2];

   291

	}

   292

   293

	tmp = free_names & ((1<<1)|(1<<2)|(1<<3)|(1<<4)|(1<<6)|(1<<7)|(1<<12)|(1<<26)|(1<<27)|(1<<28)|(1<<29)|(1<<30));

   294

	if (tmp == 0) {

   295

		_error_message = STR_3007_TOO_MANY_STATIONS_LOADING;

   296

		return false;

   297

	}

   298

	found = FindFirstBit(tmp);

   299

   300

done:

   301

	st->string_id = found + STR_SV_STNAME;

   302

	return true;

   303

}

   304

#undef M

   305

   306

static Station *GetClosestStationFromTile(uint tile, uint threshold, byte owner)

   307

{

   308

	Station *st, *best_station = NULL;

   309

	uint cur_dist;

   310

   311

	FOR_ALL_STATIONS(st) {

   312

		cur_dist = GetTileDist(tile, st->xy);

   313

		if (cur_dist < threshold && (owner == 0xFF || st->owner == owner) && (st->xy != 0)) {

   314

			threshold = cur_dist;

   315

			best_station = st;

   316

		}

   317

	}

   318

   319

	return best_station;

   320

}

   321

   322

static void StationInitialize(Station *st, TileIndex tile)

   323

{

   324

	int i;

   325

	GoodsEntry *ge;

   326

   327

	st->xy = tile;

   328

	st->bus_tile = st->lorry_tile = st->airport_tile = st->dock_tile = st->train_tile = 0;

   329

	st->had_vehicle_of_type = 0;

   330

	st->time_since_load = 255;

   331

	st->time_since_unload = 255;

   332

	st->delete_ctr = 0;

   333

	st->facilities = 0;

   334

   335

	st->last_vehicle = INVALID_VEHICLE;

   336

   337

	for(i=0,ge=st->goods; i!=NUM_CARGO; i++, ge++) {

   338

		ge->waiting_acceptance = 0;

   339

		ge->days_since_pickup = 0;

   340

		ge->enroute_from = 0xFF;

   341

		ge->rating = 175;

   342

		ge->last_speed = 0;

   343

		ge->last_age = 0xFF;

   344

	}

   345

   346

	_global_station_sort_dirty = true; // build a new station

   347

}

   348

   349

// Update the virtual coords needed to draw the station sign.

   350

// st = Station to update for.

   351

static void UpdateStationVirtCoord(Station *st)

   352

{

   353

	Point pt = RemapCoords2(TileX(st->xy) * 16, TileY(st->xy) * 16);

   354

	pt.y -= 32;

   355

	if (st->facilities&FACIL_AIRPORT && st->airport_type==AT_OILRIG) pt.y -= 16;

   356

   357

	SetDParam(0, st->index);

   358

	SetDParam(1, st->facilities);

   359

	UpdateViewportSignPos(&st->sign, pt.x, pt.y, STR_305C_0);

   360

}

   361

   362

// Update the virtual coords needed to draw the station sign for all stations.

   363

void UpdateAllStationVirtCoord()

   364

{

   365

	Station *st;

   366

	FOR_ALL_STATIONS(st) {

   367

		if (st->xy != 0)

   368

			UpdateStationVirtCoord(st);

   369

	}

   370

}

   371

   372

// Update the station virt coords while making the modified parts dirty.

   373

static void UpdateStationVirtCoordDirty(Station *st)

   374

{

   375

	MarkStationDirty(st);

   376

	UpdateStationVirtCoord(st);

   377

	MarkStationDirty(st);

   378

}

   379

   380

// Get a mask of the cargo types that the station accepts.

   381

static uint GetAcceptanceMask(Station *st)

   382

{

   383

	uint mask = 0;

   384

	uint cur_mask = 1;

   385

	int i;

   386

	for(i=0; i!=NUM_CARGO; i++,cur_mask*=2) {

   387

		if (st->goods[i].waiting_acceptance & 0x8000)

   388

			mask |= cur_mask;

   389

	}

   390

	return mask;

   391

}

   392

   393

// Items contains the two cargo names that are to be accepted or rejected.

   394

// msg is the string id of the message to display.

   395

static void ShowRejectOrAcceptNews(Station *st, uint32 items, StringID msg)

   396

{

   397

	if (items) {

   398

		SetDParam(2, items >> 16);

   399

		SetDParam(1, items & 0xFFFF);

   400

		SetDParam(0, st->index);

   401

		AddNewsItem(msg + ((items >> 16)?1:0), NEWS_FLAGS(NM_SMALL, NF_VIEWPORT|NF_TILE, NT_ACCEPTANCE, 0), st->xy, 0);

   402

	}

   403

}

   404

   405

// Get a list of the cargo types being produced around the tile.

   406

void GetProductionAroundTiles(uint *produced, uint tile, int w, int h, int rad)

   407

{

   408

	int x,y;

   409

	int x1,y1,x2,y2;

   410

	int xc,yc;

   411

	byte cargos[2];

   412

   413

	memset(produced, 0, NUM_CARGO * sizeof(uint));

   414

   415

	x = TileX(tile);

   416

	y = TileY(tile);

   417

   418

	// expand the region by 4 tiles on each side

   419

	// while making sure that we remain inside the board.

   420

	x2 = min(x + w + rad, MapSizeX());

   421

	x1 = max(x-rad, 0);

   422

   423

	y2 = min(y + h + rad, MapSizeY());

   424

	y1 = max(y-rad, 0);

   425

   426

	assert(x1 < x2);

   427

	assert(y1 < y2);

   428

	assert(w > 0);

   429

	assert(h > 0);

   430

   431

	yc = y1;

   432

	do {

   433

		xc = x1;

   434

		do {

   435

			if (!(IS_INSIDE_1D(xc, x, w) && IS_INSIDE_1D(yc, y, h))) {

   436

				GetProducedCargoProc *gpc;

   437

				uint tile = TILE_XY(xc, yc);

   438

				gpc = _tile_type_procs[GET_TILETYPE(tile)]->get_produced_cargo_proc;

   439

				if (gpc != NULL) {

   440

					cargos[0] = cargos[1] = 0xFF;

   441

					gpc(tile, cargos);

   442

					if (cargos[0] != 0xFF) {

   443

						produced[cargos[0]]++;

   444

						if (cargos[1] != 0xFF) {

   445

							produced[cargos[1]]++;

   446

						}

   447

					}

   448

				}

   449

			}

   450

		} while (++xc != x2);

   451

	} while (++yc != y2);

   452

}

   453

   454

// Get a list of the cargo types that are accepted around the tile.

   455

void GetAcceptanceAroundTiles(uint *accepts, uint tile, int w, int h, int rad)

   456

{

   457

	int x,y;

   458

	int x1,y1,x2,y2;

   459

	int xc,yc;

   460

   461

	memset(accepts, 0, sizeof(AcceptedCargo));

   462

   463

	x = TileX(tile);

   464

	y = TileY(tile);

   465

   466

	// expand the region by 4 tiles on each side

   467

	// while making sure that we remain inside the board.

   468

	x2 = min(x + w + rad, MapSizeX());

   469

	y2 = min(y + h + rad, MapSizeY());

   470

	x1 = max(x-rad, 0);

   471

	y1 = max(y-rad, 0);

   472

   473

	assert(x1 < x2);

   474

	assert(y1 < y2);

   475

	assert(w > 0);

   476

	assert(h > 0);

   477

   478

	yc = y1;

   479

	do {

   480

		xc = x1;

   481

		do {

   482

			uint tile = TILE_XY(xc, yc);

   483

			if (!IS_TILETYPE(tile, MP_STATION)) {

   484

				AcceptedCargo ac;

   485

				int i;

   486

   487

				GetAcceptedCargo(tile, ac);

   488

				for (i = 0; i < NUM_CARGO; ++i)

   489

					accepts[i] += ac[i];

   490

			}

   491

		} while (++xc != x2);

   492

	} while (++yc != y2);

   493

}

   494

   495

// Update the acceptance for a station.

   496

// show_msg controls whether to display a message that acceptance was changed.

   497

static void UpdateStationAcceptance(Station *st, bool show_msg)

   498

{

   499

	uint old_acc, new_acc;

   500

	TileIndex span[1+1+2+2+1];

   501

	int i;

   502

	int min_x, min_y, max_x, max_y;

   503

	int rad = 4;	//Put this to surpress a compiler warning

   504

	uint accepts[NUM_CARGO];

   505

   506

	// Don't update acceptance for a buoy

   507

	if (st->had_vehicle_of_type & HVOT_BUOY)

   508

		return;

   509

   510

	/* old accepted goods types */

   511

	old_acc = GetAcceptanceMask(st);

   512

   513

	// Put all the tiles that span an area in the table.

   514

	span[3] = span[5] = 0;

   515

	span[0] = st->bus_tile;

   516

	span[1] = st->lorry_tile;