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

    16

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

    17

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

    18

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

    19

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

    20

    21

void ShowAircraftDepotWindow(uint tile);

    22

extern void UpdateAirplanesOnNewStation(Station *st);

    23

    24

static void MarkStationDirty(Station *st)

    25

{

    26

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

    27

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

    28

    29

		MarkAllViewportsDirty(

    30

			st->sign.left - 6,

    31

			st->sign.top,

    32

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

    33

			st->sign.top + 48);

    34

	}

    35

}

    36

    37

#define CHECK_STATIONS_ERR ((Station*)-1)

    38

    39

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

    40

{

    41

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

    42

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

    43

		if (IS_TILETYPE(tile_cur, MP_STATION)) {

    44

			int t;

    45

			t = _map2[tile_cur];

    46

			if (closest_station == -1) {

    47

				closest_station = t;

    48

			} else if (closest_station != t) {

    49

				_error_message = STR_3006_ADJOINS_MORE_THAN_ONE_EXISTING;

    50

				return CHECK_STATIONS_ERR;

    51

			}

    52

		}

    53

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

    54

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

    55

}

    56

    57

    58

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

    59

{

    60

	byte station_index = st->index;

    61

	uint i;

    62

	uint x1 = GET_TILE_X(tile);

    63

	uint y1 = GET_TILE_Y(tile);

    64

	uint x2 = x1 + w - 1;

    65

	uint y2 = y1 + h - 1;

    66

	uint t;

    67

    68

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

    69

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

    70

			t = GET_TILE_X(i);

    71

			if (t < x1) x1 = t;

    72

			if (t > x2) x2 = t;

    73

    74

			t = GET_TILE_Y(i);

    75

			if (t < y1) y1 = t;

    76

			if (t > y2) y2 = t;

    77

		}

    78

	}

    79

    80

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

    81

		_error_message = STR_306C_STATION_TOO_SPREAD_OUT;

    82

		return false;

    83

	}

    84

    85

	return true;

    86

}

    87

    88

static Station *AllocateStation()

    89

{

    90

	Station *st, *a_free = NULL;

    91

	int count;

    92

	int num_free = 0;

    93

	int i;

    94

    95

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

    96

		if (st->xy == 0) {

    97

			num_free++;

    98

			if (a_free==NULL)

    99

				a_free = st;

   100

		}

   101

	}

   102

   103

	if (a_free == NULL ||

   104

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

   105

		_error_message = STR_3008_TOO_MANY_STATIONS_LOADING;

   106

		return NULL;

   107

	}

   108

   109

	i = a_free->index;	

   110

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

   111

	a_free->index = i;

   112

	return a_free;

   113

}

   114

   115

   116

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

   117

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

   118

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

   119

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

   120

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

   121

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

   122

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

   123

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

   124

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

   125

		0,

   126

	};	

   127

	int j;

   128

	const TileIndexDiff *p = _count_square_table;

   129

	int num = 0;

   130

   131

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

   132

		tile = TILE_MASK(tile + j);

   133

   134

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

   135

			num++;

   136

	}

   137

   138

	return num;

   139

}

   140

   141

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

   142

   143

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

   144

{

   145

	static const uint32 _gen_station_name_bits[] = {

   146

		0,																/* 0 */

   147

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

   148

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

   149

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

   150

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

   151

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

   152

	};

   153

   154

	Town *t = st->town;

   155

	uint32 free_names = (uint32)-1;

   156

	int found;

   157

	uint z,z2;

   158

	unsigned long tmp;

   159

   160

	{

   161

		Station *s;

   162

   163

		FOR_ALL_STATIONS(s) {

   164

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

   165

				uint str = M(s->string_id);

   166

				if (str <= 0x20) {

   167

					if (str == M(STR_SV_STNAME_FOREST))

   168

						str = M(STR_SV_STNAME_WOODS);

   169

					CLRBIT(free_names, str);

   170

				}

   171

			}

   172

		}	

   173

	}

   174

   175

	/* check default names */

   176

	tmp = free_names & _gen_station_name_bits[flag];

   177

	if (tmp != 0) {

   178

		found = FindFirstBit(tmp);

   179

		goto done;

   180

	}

   181

   182

	/* check mine? */

   183

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

   184

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

   185

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

   186

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

   187

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

   188

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

   189

					found = M(STR_SV_STNAME_MINES);

   190

					goto done;

   191

				}

   192

	}

   193

   194

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

   195

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

   196

		found = M(STR_SV_STNAME);

   197

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

   198

   199

		found = M(STR_SV_STNAME_CENTRAL);

   200

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

   201

	}

   202

   203

	/* Check lakeside */

   204

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

   205

			!CheckDistanceFromEdge(tile, 20) &&

   206

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

   207

				found = M(STR_SV_STNAME_LAKESIDE);

   208

				goto done;

   209

			}

   210

   211

	/* Check woods */

   212

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

   213

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

   214

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

   215

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

   216

				goto done;

   217

	}

   218

   219

	/* check elevation compared to town */

   220

	z = GetTileZ(tile);

   221

	z2 = GetTileZ(t->xy);

   222

	if (z < z2) {

   223

		found = M(STR_SV_STNAME_VALLEY);

   224

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

   225

	} else if (z > z2) {

   226

		found = M(STR_SV_STNAME_HEIGHTS);

   227

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

   228

	}

   229

   230

	/* check direction compared to town */

   231

	{

   232

		static const int8 _direction_and_table[] = {

   233

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

   234

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

   235

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

   236

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

   237

		};

   238

   239

		free_names &= _direction_and_table[ 

   240

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

   241

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

   242

	}

   243

   244

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

   245

	if (tmp == 0) {

   246

		_error_message = STR_3007_TOO_MANY_STATIONS_LOADING;

   247

		return false;

   248

	}

   249

	found = FindFirstBit(tmp);

   250

   251

done:

   252

	st->string_id = found + STR_SV_STNAME;

   253

	return true;

   254

}

   255

#undef M

   256

   257

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

   258

{

   259

	Station *st, *best_station = NULL;

   260

	uint cur_dist;

   261

   262

	FOR_ALL_STATIONS(st) {

   263

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

   264

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

   265

			threshold = cur_dist;

   266

			best_station = st;

   267

		}

   268

	}

   269

   270

	return best_station;

   271

}

   272

   273

static void StationInitialize(Station *st, TileIndex tile)

   274

{

   275

	int i;

   276

	GoodsEntry *ge;

   277

   278

	st->xy = tile;

   279

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

   280

	st->had_vehicle_of_type = 0;

   281

	st->time_since_load = 255;

   282

	st->time_since_unload = 255;

   283

	st->delete_ctr = 0;

   284

	st->facilities = 0;

   285

   286

	st->blocked_months = 0;

   287

	st->last_vehicle = INVALID_VEHICLE;

   288

   289

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

   290

		ge->waiting_acceptance = 0;

   291

		ge->days_since_pickup = 0;

   292

		ge->enroute_from = 0xFF;

   293

		ge->rating = 175;

   294

		ge->last_speed = 0;

   295

		ge->last_age = 0xFF;

   296

	}

   297

	_station_sort_dirty = true;

   298

}

   299

   300

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

   301

// st = Station to update for.

   302

static void UpdateStationVirtCoord(Station *st)

   303

{

   304

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

   305

	pt.y -= 32;

   306

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

   307

   308

	SET_DPARAM16(0, st->index);

   309

	SET_DPARAM8(1, st->facilities);

   310

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

   311

}

   312

   313

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

   314

void UpdateAllStationVirtCoord()

   315

{

   316

	Station *st;

   317

	FOR_ALL_STATIONS(st) {

   318

		if (st->xy != 0)

   319

			UpdateStationVirtCoord(st);			

   320

	}

   321

}

   322

   323

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

   324

static void UpdateStationVirtCoordDirty(Station *st)

   325

{

   326

	MarkStationDirty(st);

   327

	UpdateStationVirtCoord(st);

   328

	MarkStationDirty(st);

   329

}

   330

   331

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

   332

static uint GetAcceptanceMask(Station *st)

   333

{

   334

	uint mask = 0;

   335

	uint cur_mask = 1;

   336

	int i;

   337

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

   338

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

   339

			mask |= cur_mask;

   340

	}

   341

	return mask;

   342

}

   343

   344

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

   345

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

   346

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

   347

{

   348

	if (items) {

   349

		SET_DPARAM32(2, items >> 16);

   350

		SET_DPARAM32(1, items & 0xFFFF);

   351

		SET_DPARAM16(0, st->index);

   352

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

   353

	}

   354

}

   355

   356

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

   357

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

   358

{

   359

	int x,y;

   360

	int x1,y1,x2,y2;

   361

	int xc,yc;

   362

	byte cargos[2];

   363

   364

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

   365

   366

	x = GET_TILE_X(tile);

   367

	y = GET_TILE_Y(tile);

   368

   369

	// expand the region by 4 tiles on each side

   370

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

   371

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

   372

	x1 = max(x-4, 0);

   373

   374

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

   375

	y1 = max(y-4, 0);

   376

   377

	assert(x1 < x2);

   378

	assert(y1 < y2);

   379

	assert(w > 0);

   380

	assert(h > 0);

   381

   382

	yc = y1;

   383

	do {

   384

		xc = x1;

   385

		do {

   386

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

   387

				GetProducedCargoProc *gpc;

   388

				uint tile = TILE_XY(xc, yc);

   389

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

   390

				if (gpc != NULL) {

   391

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

   392

					gpc(tile, cargos);

   393

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

   394

						produced[cargos[0]]++;

   395

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

   396

							produced[cargos[1]]++;

   397

						}

   398

					}

   399

				}

   400

			}

   401

		} while (++xc != x2);

   402

	} while (++yc != y2);

   403

}

   404

   405

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

   406

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

   407

{

   408

	int x,y;

   409

	int x1,y1,x2,y2;

   410

	int xc,yc;

   411

	AcceptedCargo ac;

   412

   413

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

   414

   415

	x = GET_TILE_X(tile);

   416

	y = GET_TILE_Y(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 + 4, TILE_X_MAX+1);

   421

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

   422

	x1 = max(x-4, 0);

   423

	y1 = max(y-4, 0);

   424

   425

	assert(x1 < x2);

   426

	assert(y1 < y2);

   427

	assert(w > 0);

   428

	assert(h > 0);

   429

   430

	yc = y1;

   431

	do {

   432

		xc = x1;

   433

		do {

   434

			uint tile = TILE_XY(xc, yc);

   435

			if (!IS_TILETYPE(tile, MP_STATION)) {

   436

				GetAcceptedCargo(tile, &ac);

   437

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

   438

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

   439

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

   440

			}

   441

		} while (++xc != x2);

   442

	} while (++yc != y2);

   443

}

   444

   445

// Update the acceptance for a station.

   446

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

   447

static void UpdateStationAcceptance(Station *st, bool show_msg)

   448

{

   449

	uint old_acc, new_acc;

   450

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

   451

	int i;

   452

	int min_x, min_y, max_x, max_y;

   453

	uint accepts[NUM_CARGO];

   454

   455

	// Don't update acceptance for a buoy

   456

	if (st->had_vehicle_of_type & HVOT_BUOY)

   457

		return;

   458

   459

	/* old accepted goods types */

   460

	old_acc = GetAcceptanceMask(st);

   461

   462

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

   463

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

   464

	span[0] = st->bus_tile;

   465

	span[1] = st->lorry_tile;

   466

	span[2] = st->train_tile;

   467

	if (st->train_tile != 0) {

   468

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

   469

	}

   470

	span[4] = st->airport_tile;

   471

	if (st->airport_tile != 0) {

   472

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

   473

	}

   474

	span[6] = st->dock_tile;

   475

   476

	// Construct a rectangle from those points

   477

	min_x = min_y = 0x7FFFFFFF;

   478

	max_x = max_y = 0;

   479

   480

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

   481

		uint tile = span[i];

   482

		if (tile) {

   483

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

   484

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

   485

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

   486

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

   487

		}

   488

	}

   489

   490

	// And retrieve the acceptance.

   491

	if (max_x != 0) {

   492

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

   493

	} else {

   494

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

   495

	}

   496

   497

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

   498

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

   499

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

   500

   501

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

   502

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

   503

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

   504

			amt = 0;

   505

   506

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

   507

	}

   508

   509

	// Only show a message in case the acceptance was actually changed.

   510

	new_acc = GetAcceptanceMask(st);

   511

	if (old_acc == new_acc)

   512

		return;

   513

   514

	// show a message to report that the acceptance was changed?

   515

	if (show_msg && st->owner == _local_player && st->facilities) {

   516

		uint32 accept=0, reject=0; /* these contain two string ids each */

   517

		const StringID *str = _cargoc.names_s;

   518

   519

		do {

   520

			if (new_acc & 1) {

   521

				if (!(old_acc & 1)) accept = (accept << 16) | *str; 

   522

			} else {

   523

				if (old_acc & 1) reject = (reject << 16) | *str;

   524

			}

   525

		} while (str++,(new_acc>>=1) != (old_acc>>=1));

   526

   527

		ShowRejectOrAcceptNews(st, accept, STR_3040_NOW_ACCEPTS);

   528

		ShowRejectOrAcceptNews(st, reject, STR_303E_NO_LONGER_ACCEPTS);

   529

	}

   530