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

static void MarkStationDirty(Station *st)

    29

{

    30

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

    31

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

    32

    33

		MarkAllViewportsDirty(

    34

			st->sign.left - 6,

    35

			st->sign.top,

    36

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

    37

			st->sign.top + 48);

    38

	}

    39

}

    40

    41

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

    42

    radius that is available within the station */

    43

static byte FindCatchmentRadius(Station *st)

    44

{

    45

	byte ret = 0;

    46

    47

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

    48

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

    49

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

    50

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

    51

    52

	if (st->airport_tile) {

    53

		switch (st->airport_type) {

    54

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

    55

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

    56

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

    57

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

    58

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

    59

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

    60

		}

    61

	}

    62

    63

	return ret;

    64

}

    65

    66

#define CHECK_STATIONS_ERR ((Station*)-1)

    67

    68

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

    69

{

    70

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

    71

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

    72

		if (IS_TILETYPE(tile_cur, MP_STATION)) {

    73

			int t;

    74

			t = _map2[tile_cur];

    75

			{

    76

				Station *st = DEREF_STATION(t);

    77

				// you cannot take control of an oilrig!!

    78

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

    79

					continue;

    80

			}

    81

    82

			if (closest_station == -1) {

    83

				closest_station = t;

    84

			} else if (closest_station != t) {

    85

				_error_message = STR_3006_ADJOINS_MORE_THAN_ONE_EXISTING;

    86

				return CHECK_STATIONS_ERR;

    87

			}

    88

		}

    89

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

    90

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

    91

}

    92

    93

TileIndex GetStationTileForVehicle(Vehicle *v, Station *st)

    94

{

    95

	switch (v->type) {

    96

		case VEH_Train: 		return st->train_tile;

    97

		case VEH_Aircraft:	return st->airport_tile;

    98

		case VEH_Ship:			return st->dock_tile;

    99

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

   100

		default:

   101

			assert(false);

   102

			return 0;

   103

	}

   104

}

   105

   106

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

   107

{

   108

	uint16 station_index = st->index;

   109

	uint i;

   110

	uint x1 = GET_TILE_X(tile);

   111

	uint y1 = GET_TILE_Y(tile);

   112

	uint x2 = x1 + w - 1;

   113

	uint y2 = y1 + h - 1;

   114

	uint t;

   115

   116

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

   117

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

   118

			t = GET_TILE_X(i);

   119

			if (t < x1) x1 = t;

   120

			if (t > x2) x2 = t;

   121

   122

			t = GET_TILE_Y(i);

   123

			if (t < y1) y1 = t;

   124

			if (t > y2) y2 = t;

   125

		}

   126

	}

   127

   128

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

   129

		_error_message = STR_306C_STATION_TOO_SPREAD_OUT;

   130

		return false;

   131

	}

   132

   133

	return true;

   134

}

   135

   136

static Station *AllocateStation()

   137

{

   138

	Station *st, *a_free = NULL;

   139

	int count;

   140

	int num_free = 0;

   141

	int i;

   142

   143

	for(st = _stations, count = lengthof(_stations); count != 0; count--, st++) {

   144

		if (st->xy == 0) {

   145

			num_free++;

   146

			if (a_free==NULL)

   147

				a_free = st;

   148

		}

   149

	}

   150

   151

	if (a_free == NULL ||

   152

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

   153

		_error_message = STR_3008_TOO_MANY_STATIONS_LOADING;

   154

		return NULL;

   155

	}

   156

   157

	i = a_free->index;

   158

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

   159

	a_free->index = i;

   160

	return a_free;

   161

}

   162

   163

   164

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

   165

	static const TileIndexDiff _count_square_table[7*7+1] = {

   166

		TILE_XY(-3,-3), 1, 1, 1, 1, 1, 1,

   167

		TILE_XY(-6,1),  1, 1, 1, 1, 1, 1,

   168

		TILE_XY(-6,1),  1, 1, 1, 1, 1, 1,

   169

		TILE_XY(-6,1),  1, 1, 1, 1, 1, 1,

   170

		TILE_XY(-6,1),  1, 1, 1, 1, 1, 1,

   171

		TILE_XY(-6,1),  1, 1, 1, 1, 1, 1,

   172

		TILE_XY(-6,1),  1, 1, 1, 1, 1, 1,

   173

	};

   174

	const TileIndexDiff *p;

   175

	int num = 0;

   176

   177

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

   178

		tile = TILE_MASK(tile + *p);

   179

   180

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

   181

			num++;

   182

	}

   183

   184

	return num;

   185

}

   186

   187

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

   188

   189

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

   190

{

   191

	static const uint32 _gen_station_name_bits[] = {

   192

		0,																/* 0 */

   193

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

   194

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

   195

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

   196

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

   197

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

   198

	};

   199

   200

	Town *t = st->town;

   201

	uint32 free_names = (uint32)-1;

   202

	int found;

   203

	uint z,z2;

   204

	unsigned long tmp;

   205

   206

	{

   207

		Station *s;

   208

   209

		FOR_ALL_STATIONS(s) {

   210

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

   211

				uint str = M(s->string_id);

   212

				if (str <= 0x20) {

   213

					if (str == M(STR_SV_STNAME_FOREST))

   214

						str = M(STR_SV_STNAME_WOODS);

   215

					CLRBIT(free_names, str);

   216

				}

   217

			}

   218

		}

   219

	}

   220

   221

	/* check default names */

   222

	tmp = free_names & _gen_station_name_bits[flag];

   223

	if (tmp != 0) {

   224

		found = FindFirstBit(tmp);

   225

		goto done;

   226

	}

   227

   228

	/* check mine? */

   229

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

   230

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

   231

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

   232

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

   233

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

   234

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

   235

					found = M(STR_SV_STNAME_MINES);

   236

					goto done;

   237

				}

   238

	}

   239

   240

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

   241

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

   242

		found = M(STR_SV_STNAME);

   243

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

   244

   245

		found = M(STR_SV_STNAME_CENTRAL);

   246

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

   247

	}

   248

   249

	/* Check lakeside */

   250

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

   251

			!CheckDistanceFromEdge(tile, 20) &&

   252

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

   253

				found = M(STR_SV_STNAME_LAKESIDE);

   254

				goto done;

   255

			}

   256

   257

	/* Check woods */

   258

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

   259

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

   260

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

   261

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

   262

				goto done;

   263

	}

   264

   265

	/* check elevation compared to town */

   266

	z = GetTileZ(tile);

   267

	z2 = GetTileZ(t->xy);

   268

	if (z < z2) {

   269

		found = M(STR_SV_STNAME_VALLEY);

   270

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

   271

	} else if (z > z2) {

   272

		found = M(STR_SV_STNAME_HEIGHTS);

   273

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

   274

	}

   275

   276

	/* check direction compared to town */

   277

	{

   278

		static const int8 _direction_and_table[] = {

   279

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

   280

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

   281

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

   282

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

   283

		};

   284

   285

		free_names &= _direction_and_table[

   286

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

   287

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

   288

	}

   289

   290

	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));

   291

	if (tmp == 0) {

   292

		_error_message = STR_3007_TOO_MANY_STATIONS_LOADING;

   293

		return false;

   294

	}

   295

	found = FindFirstBit(tmp);

   296

   297

done:

   298

	st->string_id = found + STR_SV_STNAME;

   299

	return true;

   300

}

   301

#undef M

   302

   303

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

   304

{

   305

	Station *st, *best_station = NULL;

   306

	uint cur_dist;

   307

   308

	FOR_ALL_STATIONS(st) {

   309

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

   310

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

   311

			threshold = cur_dist;

   312

			best_station = st;

   313

		}

   314

	}

   315

   316

	return best_station;

   317

}

   318

   319

static void StationInitialize(Station *st, TileIndex tile)

   320

{

   321

	int i;

   322

	GoodsEntry *ge;

   323

   324

	st->xy = tile;

   325

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

   326

	st->had_vehicle_of_type = 0;

   327

	st->time_since_load = 255;

   328

	st->time_since_unload = 255;

   329

	st->delete_ctr = 0;

   330

	st->facilities = 0;

   331

   332

	st->last_vehicle = INVALID_VEHICLE;

   333

   334

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

   335

		ge->waiting_acceptance = 0;

   336

		ge->days_since_pickup = 0;

   337

		ge->enroute_from = 0xFF;

   338

		ge->rating = 175;

   339

		ge->last_speed = 0;

   340

		ge->last_age = 0xFF;

   341

	}

   342

   343

	_global_station_sort_dirty = true; // build a new station

   344

}

   345

   346

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

   347

// st = Station to update for.

   348

static void UpdateStationVirtCoord(Station *st)

   349

{

   350

	Point pt = RemapCoords2(GET_TILE_X(st->xy) * 16, GET_TILE_Y(st->xy) * 16);

   351

	pt.y -= 32;

   352

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

   353

   354

	SetDParam(0, st->index);

   355

	SetDParam(1, st->facilities);

   356

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

   357

}

   358

   359

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

   360

void UpdateAllStationVirtCoord()

   361

{

   362

	Station *st;

   363

	FOR_ALL_STATIONS(st) {

   364

		if (st->xy != 0)

   365

			UpdateStationVirtCoord(st);

   366

	}

   367

}

   368

   369

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

   370

static void UpdateStationVirtCoordDirty(Station *st)

   371

{

   372

	MarkStationDirty(st);

   373

	UpdateStationVirtCoord(st);

   374

	MarkStationDirty(st);

   375

}

   376

   377

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

   378

static uint GetAcceptanceMask(Station *st)

   379

{

   380

	uint mask = 0;

   381

	uint cur_mask = 1;

   382

	int i;

   383

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

   384

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

   385

			mask |= cur_mask;

   386

	}

   387

	return mask;

   388

}

   389

   390

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

   391

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

   392

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

   393

{

   394

	if (items) {

   395

		SetDParam(2, items >> 16);

   396

		SetDParam(1, items & 0xFFFF);

   397

		SetDParam(0, st->index);

   398

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

   399

	}

   400

}

   401

   402

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

   403

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

   404

{

   405

	int x,y;

   406

	int x1,y1,x2,y2;

   407

	int xc,yc;

   408

	byte cargos[2];

   409

   410

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

   411

   412

	x = GET_TILE_X(tile);

   413

	y = GET_TILE_Y(tile);

   414

   415

	// expand the region by 4 tiles on each side

   416

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

   417

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

   418

	x1 = max(x-rad, 0);

   419

   420

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

   421

	y1 = max(y-rad, 0);

   422

   423

	assert(x1 < x2);

   424

	assert(y1 < y2);

   425

	assert(w > 0);

   426

	assert(h > 0);

   427

   428

	yc = y1;

   429

	do {

   430

		xc = x1;

   431

		do {

   432

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

   433

				GetProducedCargoProc *gpc;

   434

				uint tile = TILE_XY(xc, yc);

   435

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

   436

				if (gpc != NULL) {

   437

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

   438

					gpc(tile, cargos);

   439

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

   440

						produced[cargos[0]]++;

   441

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

   442

							produced[cargos[1]]++;

   443

						}

   444

					}

   445

				}

   446

			}

   447

		} while (++xc != x2);

   448

	} while (++yc != y2);

   449

}

   450

   451

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

   452

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

   453

{

   454

	int x,y;

   455

	int x1,y1,x2,y2;

   456

	int xc,yc;

   457

   458

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

   459

   460

	x = GET_TILE_X(tile);

   461

	y = GET_TILE_Y(tile);

   462

   463

	// expand the region by 4 tiles on each side

   464

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

   465

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

   466

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

   467

	x1 = max(x-rad, 0);

   468

	y1 = max(y-rad, 0);

   469

   470

	assert(x1 < x2);

   471

	assert(y1 < y2);

   472

	assert(w > 0);

   473

	assert(h > 0);

   474

   475

	yc = y1;

   476

	do {

   477

		xc = x1;

   478

		do {

   479

			uint tile = TILE_XY(xc, yc);

   480

			if (!IS_TILETYPE(tile, MP_STATION)) {

   481

				AcceptedCargo ac;

   482

				int i;

   483

   484

				GetAcceptedCargo(tile, ac);

   485

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

   486

					accepts[i] += ac[i];

   487

			}

   488

		} while (++xc != x2);

   489

	} while (++yc != y2);

   490

}

   491

   492

// Update the acceptance for a station.

   493

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

   494

static void UpdateStationAcceptance(Station *st, bool show_msg)

   495

{

   496

	uint old_acc, new_acc;

   497

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

   498

	int i;

   499

	int min_x, min_y, max_x, max_y;

   500

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

   501

	uint accepts[NUM_CARGO];

   502

   503

	// Don't update acceptance for a buoy

   504

	if (st->had_vehicle_of_type & HVOT_BUOY)

   505

		return;

   506

   507

	/* old accepted goods types */

   508

	old_acc = GetAcceptanceMask(st);

   509

   510

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

   511

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

   512

	span[0] = st->bus_tile;

   513

	span[1] = st->lorry_tile;

   514

	span[2] = st->train_tile;

   515

	if (st->train_tile != 0) {

   516

		span[3] = st->train_tile + TILE_XY(st->trainst_w-1, st->trainst_h-1);

   517

	}

   518

	span[4] = st->airport_tile;

   519

	if (st->airport_tile != 0) {

   520