1

#include "stdafx.h"

     2

#include "ttd.h"

     3

#include "table/strings.h"

     4

#include "station.h"

     5

#include "gfx.h"

     6

#include "window.h"

     7

#include "viewport.h"

     8

#include "command.h"

     9

#include "town.h"

    10

#include "vehicle.h"

    11

#include "news.h"

    12

#include "saveload.h"

    13

#include "economy.h"

    14

#include "player.h"

    15

#include "airport.h"

    16

#include "sprite.h"

    17

#include "table/directions.h"

    18

    19

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

    20

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

    21

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

    22

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

    23

    24

void ShowAircraftDepotWindow(uint tile);

    25

extern void UpdateAirplanesOnNewStation(Station *st);

    26

    27

static void MarkStationDirty(Station *st)

    28

{

    29

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

    30

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

    31

    32

		MarkAllViewportsDirty(

    33

			st->sign.left - 6,

    34

			st->sign.top,

    35

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

    36

			st->sign.top + 48);

    37

	}

    38

}

    39

    40

#define CHECK_STATIONS_ERR ((Station*)-1)

    41

    42

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

    43

{

    44

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

    45

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

    46

		if (IS_TILETYPE(tile_cur, MP_STATION)) {

    47

			int t;

    48

			t = _map2[tile_cur];

    49

			{

    50

				Station *st = DEREF_STATION(t);

    51

				// you cannot take control of an oilrig!!

    52

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

    53

					continue;

    54

			}

    55

    56

			if (closest_station == -1) {

    57

				closest_station = t;

    58

			} else if (closest_station != t) {

    59

				_error_message = STR_3006_ADJOINS_MORE_THAN_ONE_EXISTING;

    60

				return CHECK_STATIONS_ERR;

    61

			}

    62

		}

    63

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

    64

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

    65

}

    66

    67

TileIndex GetStationTileForVehicle(Vehicle *v, Station *st)

    68

{

    69

	switch (v->type) {

    70

		case VEH_Train: 		return st->train_tile;

    71

		case VEH_Aircraft:	return st->airport_tile;

    72

		case VEH_Ship:			return st->dock_tile;

    73

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

    74

		default:

    75

			assert(false);

    76

			return 0;

    77

	}

    78

}

    79

    80

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

    81

{

    82

	byte station_index = st->index;

    83

	uint i;

    84

	uint x1 = GET_TILE_X(tile);

    85

	uint y1 = GET_TILE_Y(tile);

    86

	uint x2 = x1 + w - 1;

    87

	uint y2 = y1 + h - 1;

    88

	uint t;

    89

    90

	for(i=0; i!=TILES_X*TILES_Y; i++) {

    91

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

    92

			t = GET_TILE_X(i);

    93

			if (t < x1) x1 = t;

    94

			if (t > x2) x2 = t;

    95

    96

			t = GET_TILE_Y(i);

    97

			if (t < y1) y1 = t;

    98

			if (t > y2) y2 = t;

    99

		}

   100

	}

   101

   102

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

   103

		_error_message = STR_306C_STATION_TOO_SPREAD_OUT;

   104

		return false;

   105

	}

   106

   107

	return true;

   108

}

   109

   110

static Station *AllocateStation()

   111

{

   112

	Station *st, *a_free = NULL;

   113

	int count;

   114

	int num_free = 0;

   115

	int i;

   116

   117

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

   118

		if (st->xy == 0) {

   119

			num_free++;

   120

			if (a_free==NULL)

   121

				a_free = st;

   122

		}

   123

	}

   124

   125

	if (a_free == NULL ||

   126

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

   127

		_error_message = STR_3008_TOO_MANY_STATIONS_LOADING;

   128

		return NULL;

   129

	}

   130

   131

	i = a_free->index;

   132

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

   133

	a_free->index = i;

   134

	return a_free;

   135

}

   136

   137

   138

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

   139

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

   140

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

   141

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

   142

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

   143

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

   144

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

   145

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

   146

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

   147

		0,

   148

	};

   149

	int j;

   150

	const TileIndexDiff *p = _count_square_table;

   151

	int num = 0;

   152

   153

	while ( (j=*p++) != 0 ) {

   154

		tile = TILE_MASK(tile + j);

   155

   156

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

   157

			num++;

   158

	}

   159

   160

	return num;

   161

}

   162

   163

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

   164

   165

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

   166

{

   167

	static const uint32 _gen_station_name_bits[] = {

   168

		0,																/* 0 */

   169

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

   170

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

   171

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

   172

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

   173

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

   174

	};

   175

   176

	Town *t = st->town;

   177

	uint32 free_names = (uint32)-1;

   178

	int found;

   179

	uint z,z2;

   180

	unsigned long tmp;

   181

   182

	{

   183

		Station *s;

   184

   185

		FOR_ALL_STATIONS(s) {

   186

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

   187

				uint str = M(s->string_id);

   188

				if (str <= 0x20) {

   189

					if (str == M(STR_SV_STNAME_FOREST))

   190

						str = M(STR_SV_STNAME_WOODS);

   191

					CLRBIT(free_names, str);

   192

				}

   193

			}

   194

		}

   195

	}

   196

   197

	/* check default names */

   198

	tmp = free_names & _gen_station_name_bits[flag];

   199

	if (tmp != 0) {

   200

		found = FindFirstBit(tmp);

   201

		goto done;

   202

	}

   203

   204

	/* check mine? */

   205

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

   206

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

   207

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

   208

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

   209

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

   210

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

   211

					found = M(STR_SV_STNAME_MINES);

   212

					goto done;

   213

				}

   214

	}

   215

   216

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

   217

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

   218

		found = M(STR_SV_STNAME);

   219

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

   220

   221

		found = M(STR_SV_STNAME_CENTRAL);

   222

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

   223

	}

   224

   225

	/* Check lakeside */

   226

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

   227

			!CheckDistanceFromEdge(tile, 20) &&

   228

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

   229

				found = M(STR_SV_STNAME_LAKESIDE);

   230

				goto done;

   231

			}

   232

   233

	/* Check woods */

   234

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

   235

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

   236

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

   237

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

   238

				goto done;

   239

	}

   240

   241

	/* check elevation compared to town */

   242

	z = GetTileZ(tile);

   243

	z2 = GetTileZ(t->xy);

   244

	if (z < z2) {

   245

		found = M(STR_SV_STNAME_VALLEY);

   246

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

   247

	} else if (z > z2) {

   248

		found = M(STR_SV_STNAME_HEIGHTS);

   249

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

   250

	}

   251

   252

	/* check direction compared to town */

   253

	{

   254

		static const int8 _direction_and_table[] = {

   255

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

   256

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

   257

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

   258

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

   259

		};

   260

   261

		free_names &= _direction_and_table[

   262

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

   263

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

   264

	}

   265

   266

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

   267

	if (tmp == 0) {

   268

		_error_message = STR_3007_TOO_MANY_STATIONS_LOADING;

   269

		return false;

   270

	}

   271

	found = FindFirstBit(tmp);

   272

   273

done:

   274

	st->string_id = found + STR_SV_STNAME;

   275

	return true;

   276

}

   277

#undef M

   278

   279

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

   280

{

   281

	Station *st, *best_station = NULL;

   282

	uint cur_dist;

   283

   284

	FOR_ALL_STATIONS(st) {

   285

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

   286

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

   287

			threshold = cur_dist;

   288

			best_station = st;

   289

		}

   290

	}

   291

   292

	return best_station;

   293

}

   294

   295

static void StationInitialize(Station *st, TileIndex tile)

   296

{

   297

	int i;

   298

	GoodsEntry *ge;

   299

   300

	st->xy = tile;

   301

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

   302

	st->had_vehicle_of_type = 0;

   303

	st->time_since_load = 255;

   304

	st->time_since_unload = 255;

   305

	st->delete_ctr = 0;

   306

	st->facilities = 0;

   307

   308

	st->last_vehicle = INVALID_VEHICLE;

   309

   310

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

   311

		ge->waiting_acceptance = 0;

   312

		ge->days_since_pickup = 0;

   313

		ge->enroute_from = 0xFF;

   314

		ge->rating = 175;

   315

		ge->last_speed = 0;

   316

		ge->last_age = 0xFF;

   317

	}

   318

   319

	_global_station_sort_dirty = true; // build a new station

   320

}

   321

   322

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

   323

// st = Station to update for.

   324

static void UpdateStationVirtCoord(Station *st)

   325

{

   326

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

   327

	pt.y -= 32;

   328

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

   329

   332

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

   333

}

   334

   335

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

   336

void UpdateAllStationVirtCoord()

   337

{

   338

	Station *st;

   339

	FOR_ALL_STATIONS(st) {

   340

		if (st->xy != 0)

   341

			UpdateStationVirtCoord(st);

   342

	}

   343

}

   344

   345

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

   346

static void UpdateStationVirtCoordDirty(Station *st)

   347

{

   348

	MarkStationDirty(st);

   349

	UpdateStationVirtCoord(st);

   350

	MarkStationDirty(st);

   351

}

   352

   353

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

   354

static uint GetAcceptanceMask(Station *st)

   355

{

   356

	uint mask = 0;

   357

	uint cur_mask = 1;

   358

	int i;

   359

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

   360

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

   361

			mask |= cur_mask;

   362

	}

   363

	return mask;

   364

}

   365

   366

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

   367

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

   368

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

   369

{

   370

	if (items) {

   374

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

   375

	}

   376

}

   377

   378

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

   379

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

   380

{

   381

	int x,y;

   382

	int x1,y1,x2,y2;

   383

	int xc,yc;

   384

	byte cargos[2];

   385

   386

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

   387

   388

	x = GET_TILE_X(tile);

   389

	y = GET_TILE_Y(tile);

   390

   391

	// expand the region by 4 tiles on each side

   392

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

   393

	x2 = min(x + w+4, TILE_X_MAX+1);

   394

	x1 = max(x-4, 0);

   395

   396

	y2 = min(y + h+4, TILE_Y_MAX+1);

   397

	y1 = max(y-4, 0);

   398

   399

	assert(x1 < x2);

   400

	assert(y1 < y2);

   401

	assert(w > 0);

   402

	assert(h > 0);

   403

   404

	yc = y1;

   405

	do {

   406

		xc = x1;

   407

		do {

   408

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

   409

				GetProducedCargoProc *gpc;

   410

				uint tile = TILE_XY(xc, yc);

   411

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

   412

				if (gpc != NULL) {

   413

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

   414

					gpc(tile, cargos);

   415

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

   416

						produced[cargos[0]]++;

   417

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

   418

							produced[cargos[1]]++;

   419

						}

   420

					}

   421

				}

   422

			}

   423

		} while (++xc != x2);

   424

	} while (++yc != y2);

   425

}

   426

   427

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

   428

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

   429

{

   430

	int x,y;

   431

	int x1,y1,x2,y2;

   432

	int xc,yc;

   433

   434

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

   435

   436

	x = GET_TILE_X(tile);

   437

	y = GET_TILE_Y(tile);

   438

   439

	// expand the region by 4 tiles on each side

   440

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

   441

	x2 = min(x + w + 4, TILE_X_MAX+1);

   442

	y2 = min(y + h + 4, TILE_Y_MAX+1);

   443

	x1 = max(x-4, 0);

   444

	y1 = max(y-4, 0);

   445

   446

	assert(x1 < x2);

   447

	assert(y1 < y2);

   448

	assert(w > 0);

   449

	assert(h > 0);

   450

   451

	yc = y1;

   452

	do {

   453

		xc = x1;

   454

		do {

   455

			uint tile = TILE_XY(xc, yc);

   456

			if (!IS_TILETYPE(tile, MP_STATION)) {

   457

				AcceptedCargo ac;

   458

				int i;

   459

   460

				GetAcceptedCargo(tile, ac);

   461

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

   462

					accepts[i] += ac[i];

   463

			}

   464

		} while (++xc != x2);

   465

	} while (++yc != y2);

   466

}

   467

   468

// Update the acceptance for a station.

   469

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

   470

static void UpdateStationAcceptance(Station *st, bool show_msg)

   471

{

   472

	uint old_acc, new_acc;

   473

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

   474

	int i;

   475

	int min_x, min_y, max_x, max_y;

   476

	uint accepts[NUM_CARGO];

   477

   478

	// Don't update acceptance for a buoy

   479

	if (st->had_vehicle_of_type & HVOT_BUOY)

   480

		return;

   481

   482

	/* old accepted goods types */

   483

	old_acc = GetAcceptanceMask(st);

   484

   485

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

   486

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

   487

	span[0] = st->bus_tile;

   488

	span[1] = st->lorry_tile;

   489

	span[2] = st->train_tile;

   490

	if (st->train_tile != 0) {

   491

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

   492

	}

   493

	span[4] = st->airport_tile;

   494

	if (st->airport_tile != 0) {

   495

		span[5] = st->airport_tile + TILE_XY(_airport_size_x[st->airport_type]-1, _airport_size_y[st->airport_type]-1);

   496

	}

   497

	span[6] = st->dock_tile;

   498

   499

	// Construct a rectangle from those points

   500

	min_x = min_y = 0x7FFFFFFF;

   501

	max_x = max_y = 0;

   502

   503

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

   504

		uint tile = span[i];

   505

		if (tile) {

   506

			min_x = min(min_x,GET_TILE_X(tile));

   507

			max_x = max(max_x,GET_TILE_X(tile));

   508

			min_y = min(min_y,GET_TILE_Y(tile));

   509

			max_y = max(max_y,GET_TILE_Y(tile));

   510

		}

   511

	}

   512

   513

	// And retrieve the acceptance.

   514

	if (max_x != 0) {

   515

		GetAcceptanceAroundTiles(accepts, TILE_XY(min_x, min_y), max_x - min_x + 1, max_y-min_y+1);

   516

	} else {

   517

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

   518

	}

   519

   520

	// Adjust in case our station only accepts fewer kinds of goods

   521

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

   522

		uint amt = min(accepts[i], 15);

   523

   524

		// Make sure the station can accept the goods type.