1

#include "stdafx.h"

     2

#include "ttd.h"

     3

#include "station.h"

     4

#include "gfx.h"

     5

#include "window.h"

     6

#include "viewport.h"

     7

#include "command.h"

     8

#include "town.h"

     9

#include "vehicle.h"

    10

#include "news.h"

    11

#include "saveload.h"

    12

#include "economy.h"

    13

#include "player.h"

    14

#include "airport.h"

    15

#include "table/directions.h"

    16

    17

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

    18

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

    19

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

    20

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

    21

    22

void ShowAircraftDepotWindow(uint tile);

    23

extern void UpdateAirplanesOnNewStation(Station *st);

    24

    25

static void MarkStationDirty(Station *st)

    26

{

    27

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

    28

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

    29

    30

		MarkAllViewportsDirty(

    31

			st->sign.left - 6,

    32

			st->sign.top,

    33

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

    34

			st->sign.top + 48);

    35

	}

    36

}

    37

    38

#define CHECK_STATIONS_ERR ((Station*)-1)

    39

    40

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

    41

{

    42

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

    43

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

    44

		if (IS_TILETYPE(tile_cur, MP_STATION)) {

    45

			int t;

    46

			t = _map2[tile_cur];

    47

			{

    48

				Station *st = DEREF_STATION(t);

    49

				// you cannot take control of an oilrig!!

    50

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

    51

					continue;

    52

			}

    53

    54

			if (closest_station == -1) {

    55

				closest_station = t;

    56

			} else if (closest_station != t) {

    57

				_error_message = STR_3006_ADJOINS_MORE_THAN_ONE_EXISTING;

    58

				return CHECK_STATIONS_ERR;

    59

			}

    60

		}

    61

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

    62

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

    63

}

    64

    65

TileIndex GetStationTileForVehicle(Vehicle *v, Station *st)

    66

{

    67

	switch (v->type) {

    68

		case VEH_Train: 		return st->train_tile;

    69

		case VEH_Aircraft:	return st->airport_tile;

    70

		case VEH_Ship:			return st->dock_tile;

    71

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

    72

		default:

    73

			assert(false);

    74

			return 0;

    75

	}

    76

}

    77

    78

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

    79

{

    80

	byte station_index = st->index;

    81

	uint i;

    82

	uint x1 = GET_TILE_X(tile);

    83

	uint y1 = GET_TILE_Y(tile);

    84

	uint x2 = x1 + w - 1;

    85

	uint y2 = y1 + h - 1;

    86

	uint t;

    87

    88

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

    89

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

    90

			t = GET_TILE_X(i);

    91

			if (t < x1) x1 = t;

    92

			if (t > x2) x2 = t;

    93

    94

			t = GET_TILE_Y(i);

    95

			if (t < y1) y1 = t;

    96

			if (t > y2) y2 = t;

    97

		}

    98

	}

    99

   100

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

   101

		_error_message = STR_306C_STATION_TOO_SPREAD_OUT;

   102

		return false;

   103

	}

   104

   105

	return true;

   106

}

   107

   108

static Station *AllocateStation()

   109

{

   110

	Station *st, *a_free = NULL;

   111

	int count;

   112

	int num_free = 0;

   113

	int i;

   114

   115

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

   116

		if (st->xy == 0) {

   117

			num_free++;

   118

			if (a_free==NULL)

   119

				a_free = st;

   120

		}

   121

	}

   122

   123

	if (a_free == NULL ||

   124

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

   125

		_error_message = STR_3008_TOO_MANY_STATIONS_LOADING;

   126

		return NULL;

   127

	}

   128

   129

	i = a_free->index;

   130

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

   131

	a_free->index = i;

   132

	return a_free;

   133

}

   134

   135

   136

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

   137

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

   138

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

   139

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

   140

		TILE_XY(-6,1),  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

		0,

   146

	};

   147

	int j;

   148

	const TileIndexDiff *p = _count_square_table;

   149

	int num = 0;

   150

   151

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

   152

		tile = TILE_MASK(tile + j);

   153

   154

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

   155

			num++;

   156

	}

   157

   158

	return num;

   159

}

   160

   161

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

   162

   163

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

   164

{

   165

	static const uint32 _gen_station_name_bits[] = {

   166

		0,																/* 0 */

   167

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

   168

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

   169

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

   170

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

   171

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

   172

	};

   173

   174

	Town *t = st->town;

   175

	uint32 free_names = (uint32)-1;

   176

	int found;

   177

	uint z,z2;

   178

	unsigned long tmp;

   179

   180

	{

   181

		Station *s;

   182

   183

		FOR_ALL_STATIONS(s) {

   184

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

   185

				uint str = M(s->string_id);

   186

				if (str <= 0x20) {

   187

					if (str == M(STR_SV_STNAME_FOREST))

   188

						str = M(STR_SV_STNAME_WOODS);

   189

					CLRBIT(free_names, str);

   190

				}

   191

			}

   192

		}

   193

	}

   194

   195

	/* check default names */

   196

	tmp = free_names & _gen_station_name_bits[flag];

   197

	if (tmp != 0) {

   198

		found = FindFirstBit(tmp);

   199

		goto done;

   200

	}

   201

   202

	/* check mine? */

   203

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

   204

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

   205

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

   206

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

   207

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

   208

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

   209

					found = M(STR_SV_STNAME_MINES);

   210

					goto done;

   211

				}

   212

	}

   213

   214

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

   215

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

   216

		found = M(STR_SV_STNAME);

   217

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

   218

   219

		found = M(STR_SV_STNAME_CENTRAL);

   220

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

   221

	}

   222

   223

	/* Check lakeside */

   224

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

   225

			!CheckDistanceFromEdge(tile, 20) &&

   226

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

   227

				found = M(STR_SV_STNAME_LAKESIDE);

   228

				goto done;

   229

			}

   230

   231

	/* Check woods */

   232

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

   233

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

   234

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

   235

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

   236

				goto done;

   237

	}

   238

   239

	/* check elevation compared to town */

   240

	z = GetTileZ(tile);

   241

	z2 = GetTileZ(t->xy);

   242

	if (z < z2) {

   243

		found = M(STR_SV_STNAME_VALLEY);

   244

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

   245

	} else if (z > z2) {

   246

		found = M(STR_SV_STNAME_HEIGHTS);

   247

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

   248

	}

   249

   250

	/* check direction compared to town */

   251

	{

   252

		static const int8 _direction_and_table[] = {

   253

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

   254

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

   255

			~( (1<<M(STR_SV_STNAME_SOUTH)) | (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_EAST)) ),

   257

		};

   258

   259

		free_names &= _direction_and_table[

   260

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

   261

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

   262

	}

   263

   264

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

   265

	if (tmp == 0) {

   266

		_error_message = STR_3007_TOO_MANY_STATIONS_LOADING;

   267

		return false;

   268

	}

   269

	found = FindFirstBit(tmp);

   270

   271

done:

   272

	st->string_id = found + STR_SV_STNAME;

   273

	return true;

   274

}

   275

#undef M

   276

   277

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

   278

{

   279

	Station *st, *best_station = NULL;

   280

	uint cur_dist;

   281

   282

	FOR_ALL_STATIONS(st) {

   283

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

   284

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

   285

			threshold = cur_dist;

   286

			best_station = st;

   287

		}

   288

	}

   289

   290

	return best_station;

   291

}

   292

   293

static void StationInitialize(Station *st, TileIndex tile)

   294

{

   295

	int i;

   296

	GoodsEntry *ge;

   297

   298

	st->xy = tile;

   299

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

   300

	st->had_vehicle_of_type = 0;

   301

	st->time_since_load = 255;

   302

	st->time_since_unload = 255;

   303

	st->delete_ctr = 0;

   304

	st->facilities = 0;

   305

   306

	st->last_vehicle = INVALID_VEHICLE;

   307

   308

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

   309

		ge->waiting_acceptance = 0;

   310

		ge->days_since_pickup = 0;

   311

		ge->enroute_from = 0xFF;

   312

		ge->rating = 175;

   313

		ge->last_speed = 0;

   314

		ge->last_age = 0xFF;

   315

	}

   318

}

   319

   320

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

   321

// st = Station to update for.

   322

static void UpdateStationVirtCoord(Station *st)

   323

{

   324

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

   325

	pt.y -= 32;

   326

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

   327

   328

	SET_DPARAM16(0, st->index);

   329

	SET_DPARAM8(1, st->facilities);

   330

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

   331

}

   332

   333

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

   334

void UpdateAllStationVirtCoord()

   335

{

   336

	Station *st;

   337

	FOR_ALL_STATIONS(st) {

   338

		if (st->xy != 0)

   339

			UpdateStationVirtCoord(st);

   340

	}

   341

}

   342

   343

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

   344

static void UpdateStationVirtCoordDirty(Station *st)

   345

{

   346

	MarkStationDirty(st);

   347

	UpdateStationVirtCoord(st);

   348

	MarkStationDirty(st);

   349

}

   350

   351

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

   352

static uint GetAcceptanceMask(Station *st)

   353

{

   354

	uint mask = 0;

   355

	uint cur_mask = 1;

   356

	int i;

   357

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

   358

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

   359

			mask |= cur_mask;

   360

	}

   361

	return mask;

   362

}

   363

   364

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

   365

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

   366

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

   367

{

   368

	if (items) {

   369

		SET_DPARAM32(2, items >> 16);

   370

		SET_DPARAM32(1, items & 0xFFFF);

   371

		SET_DPARAM16(0, st->index);

   372

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

   373

	}

   374

}

   375

   376

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

   377

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

   378

{

   379

	int x,y;

   380

	int x1,y1,x2,y2;

   381

	int xc,yc;

   382

	byte cargos[2];

   383

   384

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

   385

   386

	x = GET_TILE_X(tile);

   387

	y = GET_TILE_Y(tile);

   388

   389

	// expand the region by 4 tiles on each side

   390

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

   391

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

   392

	x1 = max(x-4, 0);

   393

   394

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

   395

	y1 = max(y-4, 0);

   396

   397

	assert(x1 < x2);

   398

	assert(y1 < y2);

   399

	assert(w > 0);

   400

	assert(h > 0);

   401

   402

	yc = y1;

   403

	do {

   404

		xc = x1;

   405

		do {

   406

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

   407

				GetProducedCargoProc *gpc;

   408

				uint tile = TILE_XY(xc, yc);

   409

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

   410

				if (gpc != NULL) {

   411

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

   412

					gpc(tile, cargos);

   413

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

   414

						produced[cargos[0]]++;

   415

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

   416

							produced[cargos[1]]++;

   417

						}

   418

					}

   419

				}

   420

			}

   421

		} while (++xc != x2);

   422

	} while (++yc != y2);

   423

}

   424

   425

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

   426

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

   427

{

   428

	int x,y;

   429

	int x1,y1,x2,y2;

   430

	int xc,yc;

   431

	AcceptedCargo ac;

   432

   433

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

   434

   435

	x = GET_TILE_X(tile);

   436

	y = GET_TILE_Y(tile);

   437

   438

	// expand the region by 4 tiles on each side

   439

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

   440

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

   441

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

   442

	x1 = max(x-4, 0);

   443

	y1 = max(y-4, 0);

   444

   445

	assert(x1 < x2);

   446

	assert(y1 < y2);

   447

	assert(w > 0);

   448

	assert(h > 0);

   449

   450

	yc = y1;

   451

	do {

   452

		xc = x1;

   453

		do {

   454

			uint tile = TILE_XY(xc, yc);

   455

			if (!IS_TILETYPE(tile, MP_STATION)) {

   456

				GetAcceptedCargo(tile, &ac);

   457

				accepts[ac.type_1] += ac.amount_1;

   458

				accepts[ac.type_2] += ac.amount_2;

   459

				accepts[ac.type_3] += ac.amount_3;

   460

			}

   461

		} while (++xc != x2);

   462

	} while (++yc != y2);

   463

}

   464

   465

// Update the acceptance for a station.

   466

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

   467

static void UpdateStationAcceptance(Station *st, bool show_msg)

   468

{

   469

	uint old_acc, new_acc;

   470

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

   471

	int i;

   472

	int min_x, min_y, max_x, max_y;

   473

	uint accepts[NUM_CARGO];

   474

   475

	// Don't update acceptance for a buoy

   476

	if (st->had_vehicle_of_type & HVOT_BUOY)

   477

		return;

   478

   479

	/* old accepted goods types */

   480

	old_acc = GetAcceptanceMask(st);

   481

   482

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

   483

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

   484

	span[0] = st->bus_tile;

   485

	span[1] = st->lorry_tile;

   486

	span[2] = st->train_tile;

   487

	if (st->train_tile != 0) {

   488

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

   489

	}

   490

	span[4] = st->airport_tile;

   491

	if (st->airport_tile != 0) {

   492

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

   493

	}

   494

	span[6] = st->dock_tile;

   495

   496

	// Construct a rectangle from those points

   497

	min_x = min_y = 0x7FFFFFFF;

   498

	max_x = max_y = 0;

   499

   500

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

   501

		uint tile = span[i];

   502

		if (tile) {

   503

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

   504

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

   505

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

   506

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

   507

		}

   508

	}

   509

   510

	// And retrieve the acceptance.

   511

	if (max_x != 0) {

   512

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

   513

	} else {

   514

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

   515

	}

   516

   517

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

   518

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

   519

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

   520

   521

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

   522

		if ((i != CT_PASSENGERS && !(st->facilities & (byte)~FACIL_BUS_STOP)) ||

   523

				(i == CT_PASSENGERS && !(st->facilities & (byte)~FACIL_TRUCK_STOP)))

   524

			amt = 0;

   525

   526

		st->goods[i].waiting_acceptance = (st->goods[i].waiting_acceptance & ~0xF000) + (amt << 12);