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

			{

    47

				Station *st = DEREF_STATION(t);

    48

				// you cannot take control of an oilrig!!

    49

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

    50

					continue;

    51

			}

    52

    53

			if (closest_station == -1) {

    54

				closest_station = t;

    55

			} else if (closest_station != t) {

    56

				_error_message = STR_3006_ADJOINS_MORE_THAN_ONE_EXISTING;

    57

				return CHECK_STATIONS_ERR;

    58

			}

    59

		}

    60

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

    61

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

    62

}

    63

    64

TileIndex GetStationTileForVehicle(Vehicle *v, Station *st)

    65

{

    66

	switch (v->type) {

    67

		case VEH_Train: 		return st->train_tile;

    68

		case VEH_Aircraft:	return st->airport_tile;

    69

		case VEH_Ship:			return st->dock_tile;

    70

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

    71

		default:

    72

			assert(false);

    73

			return 0;

    74

	}

    75

}

    76

    77

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

    78

{

    79

	byte station_index = st->index;

    80

	uint i;

    81

	uint x1 = GET_TILE_X(tile);

    82

	uint y1 = GET_TILE_Y(tile);

    83

	uint x2 = x1 + w - 1;

    84

	uint y2 = y1 + h - 1;

    85

	uint t;

    86

    87

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

    88

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

    89

			t = GET_TILE_X(i);

    90

			if (t < x1) x1 = t;

    91

			if (t > x2) x2 = t;

    92

    93

			t = GET_TILE_Y(i);

    94

			if (t < y1) y1 = t;

    95

			if (t > y2) y2 = t;

    96

		}

    97

	}

    98

    99

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

   100

		_error_message = STR_306C_STATION_TOO_SPREAD_OUT;

   101

		return false;

   102

	}

   103

   104

	return true;

   105

}

   106

   107

static Station *AllocateStation()

   108

{

   109

	Station *st, *a_free = NULL;

   110

	int count;

   111

	int num_free = 0;

   112

	int i;

   113

   114

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

   115

		if (st->xy == 0) {

   116

			num_free++;

   117

			if (a_free==NULL)

   118

				a_free = st;

   119

		}

   120

	}

   121

   122

	if (a_free == NULL ||

   123

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

   124

		_error_message = STR_3008_TOO_MANY_STATIONS_LOADING;

   125

		return NULL;

   126

	}

   127

   128

	i = a_free->index;	

   129

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

   130

	a_free->index = i;

   131

	return a_free;

   132

}

   133

   134

   135

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

   136

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

   137

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

   138

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

		0,

   145

	};	

   146

	int j;

   147

	const TileIndexDiff *p = _count_square_table;

   148

	int num = 0;

   149

   150

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

   151

		tile = TILE_MASK(tile + j);

   152

   153

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

   154

			num++;

   155

	}

   156

   157

	return num;

   158

}

   159

   160

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

   161

   162

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

   163

{

   164

	static const uint32 _gen_station_name_bits[] = {

   165

		0,																/* 0 */

   166

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

   167

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

   168

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

   169

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

   170

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

   171

	};

   172

   173

	Town *t = st->town;

   174

	uint32 free_names = (uint32)-1;

   175

	int found;

   176

	uint z,z2;

   177

	unsigned long tmp;

   178

   179

	{

   180

		Station *s;

   181

   182

		FOR_ALL_STATIONS(s) {

   183

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

   184

				uint str = M(s->string_id);

   185

				if (str <= 0x20) {

   186

					if (str == M(STR_SV_STNAME_FOREST))

   187

						str = M(STR_SV_STNAME_WOODS);

   188

					CLRBIT(free_names, str);

   189

				}

   190

			}

   191

		}	

   192

	}

   193

   194

	/* check default names */

   195

	tmp = free_names & _gen_station_name_bits[flag];

   196

	if (tmp != 0) {

   197

		found = FindFirstBit(tmp);

   198

		goto done;

   199

	}

   200

   201

	/* check mine? */

   202

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

   203

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

   204

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

   205

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

   206

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

   207

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

   208

					found = M(STR_SV_STNAME_MINES);

   209

					goto done;

   210

				}

   211

	}

   212

   213

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

   214

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

   215

		found = M(STR_SV_STNAME);

   216

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

   217

   218

		found = M(STR_SV_STNAME_CENTRAL);

   219

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

   220

	}

   221

   222

	/* Check lakeside */

   223

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

   224

			!CheckDistanceFromEdge(tile, 20) &&

   225

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

   226

				found = M(STR_SV_STNAME_LAKESIDE);

   227

				goto done;

   228

			}

   229

   230

	/* Check woods */

   231

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

   232

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

   233

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

   234

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

   235

				goto done;

   236

	}

   237

   238

	/* check elevation compared to town */

   239

	z = GetTileZ(tile);

   240

	z2 = GetTileZ(t->xy);

   241

	if (z < z2) {

   242

		found = M(STR_SV_STNAME_VALLEY);

   243

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

   244

	} else if (z > z2) {

   245

		found = M(STR_SV_STNAME_HEIGHTS);

   246

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

   247

	}

   248

   249

	/* check direction compared to town */

   250

	{

   251

		static const int8 _direction_and_table[] = {

   252

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

   253

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

   254

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

   255

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

   256

		};

   257

   258

		free_names &= _direction_and_table[ 

   259

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

   260

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

   261

	}

   262

   263

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

   264

	if (tmp == 0) {

   265

		_error_message = STR_3007_TOO_MANY_STATIONS_LOADING;

   266

		return false;

   267

	}

   268

	found = FindFirstBit(tmp);

   269

   270

done:

   271

	st->string_id = found + STR_SV_STNAME;

   272

	return true;

   273

}

   274

#undef M

   275

   276

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

   277

{

   278

	Station *st, *best_station = NULL;

   279

	uint cur_dist;

   280

   281

	FOR_ALL_STATIONS(st) {

   282

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

   283

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

   284

			threshold = cur_dist;

   285

			best_station = st;

   286

		}

   287

	}

   288

   289

	return best_station;

   290

}

   291

   292

static void StationInitialize(Station *st, TileIndex tile)

   293

{

   294

	int i;

   295

	GoodsEntry *ge;

   296

   297

	st->xy = tile;

   298

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

   299

	st->had_vehicle_of_type = 0;

   300

	st->time_since_load = 255;

   301

	st->time_since_unload = 255;

   302

	st->delete_ctr = 0;

   303

	st->facilities = 0;

   304

   305

	st->last_vehicle = INVALID_VEHICLE;

   306

   307

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

   308

		ge->waiting_acceptance = 0;

   309

		ge->days_since_pickup = 0;

   310

		ge->enroute_from = 0xFF;

   311

		ge->rating = 175;

   312

		ge->last_speed = 0;

   313

		ge->last_age = 0xFF;

   314

	}

   315

	_station_sort_dirty = true;

   316

}

   317

   318

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

   319

// st = Station to update for.

   320

static void UpdateStationVirtCoord(Station *st)

   321

{

   322

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

   323

	pt.y -= 32;

   324

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

   325

   326

	SET_DPARAM16(0, st->index);

   327

	SET_DPARAM8(1, st->facilities);

   328

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

   329

}

   330

   331

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

   332

void UpdateAllStationVirtCoord()

   333

{

   334

	Station *st;

   335

	FOR_ALL_STATIONS(st) {

   336

		if (st->xy != 0)

   337

			UpdateStationVirtCoord(st);			

   338

	}

   339

}

   340

   341

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

   342

static void UpdateStationVirtCoordDirty(Station *st)

   343

{

   344

	MarkStationDirty(st);

   345

	UpdateStationVirtCoord(st);

   346

	MarkStationDirty(st);

   347

}

   348

   349

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

   350

static uint GetAcceptanceMask(Station *st)

   351

{

   352

	uint mask = 0;

   353

	uint cur_mask = 1;

   354

	int i;

   355

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

   356

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

   357

			mask |= cur_mask;

   358

	}

   359

	return mask;

   360

}

   361

   362

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

   363

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

   364

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

   365

{

   366

	if (items) {

   367

		SET_DPARAM32(2, items >> 16);

   368

		SET_DPARAM32(1, items & 0xFFFF);

   369

		SET_DPARAM16(0, st->index);

   370

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

   371

	}

   372

}

   373

   374

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

   375

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

   376

{

   377

	int x,y;

   378

	int x1,y1,x2,y2;

   379

	int xc,yc;

   380

	byte cargos[2];

   381

   382

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

   383

   384

	x = GET_TILE_X(tile);

   385

	y = GET_TILE_Y(tile);

   386

   387

	// expand the region by 4 tiles on each side

   388

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

   389

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

   390

	x1 = max(x-4, 0);

   391

   392

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

   393

	y1 = max(y-4, 0);

   394

   395

	assert(x1 < x2);

   396

	assert(y1 < y2);

   397

	assert(w > 0);

   398

	assert(h > 0);

   399

   400

	yc = y1;

   401

	do {

   402

		xc = x1;

   403

		do {

   404

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

   405

				GetProducedCargoProc *gpc;

   406

				uint tile = TILE_XY(xc, yc);

   407

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

   408

				if (gpc != NULL) {

   409

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

   410

					gpc(tile, cargos);

   411

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

   412

						produced[cargos[0]]++;

   413

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

   414

							produced[cargos[1]]++;

   415

						}

   416

					}

   417

				}

   418

			}

   419

		} while (++xc != x2);

   420

	} while (++yc != y2);

   421

}

   422

   423

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

   424

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

   425

{

   426

	int x,y;

   427

	int x1,y1,x2,y2;

   428

	int xc,yc;

   429

	AcceptedCargo ac;

   430

   431

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

   432

   433

	x = GET_TILE_X(tile);

   434

	y = GET_TILE_Y(tile);

   435

   436

	// expand the region by 4 tiles on each side

   437

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

   438

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

   439

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

   440

	x1 = max(x-4, 0);

   441

	y1 = max(y-4, 0);

   442

   443

	assert(x1 < x2);

   444

	assert(y1 < y2);

   445

	assert(w > 0);

   446

	assert(h > 0);

   447

   448

	yc = y1;

   449

	do {

   450

		xc = x1;

   451

		do {

   452

			uint tile = TILE_XY(xc, yc);

   453

			if (!IS_TILETYPE(tile, MP_STATION)) {

   454

				GetAcceptedCargo(tile, &ac);

   455

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

   456

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

   457

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

   458

			}

   459

		} while (++xc != x2);

   460

	} while (++yc != y2);

   461

}

   462

   463

// Update the acceptance for a station.

   464

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

   465

static void UpdateStationAcceptance(Station *st, bool show_msg)

   466

{

   467

	uint old_acc, new_acc;

   468

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

   469

	int i;

   470

	int min_x, min_y, max_x, max_y;

   471

	uint accepts[NUM_CARGO];

   472

   473

	// Don't update acceptance for a buoy

   474

	if (st->had_vehicle_of_type & HVOT_BUOY)

   475

		return;

   476

   477

	/* old accepted goods types */

   478

	old_acc = GetAcceptanceMask(st);

   479

   480

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

   481

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

   482

	span[0] = st->bus_tile;

   483

	span[1] = st->lorry_tile;

   484

	span[2] = st->train_tile;

   485

	if (st->train_tile != 0) {

   486

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

   487

	}

   488

	span[4] = st->airport_tile;

   489

	if (st->airport_tile != 0) {

   490

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

   491

	}

   492

	span[6] = st->dock_tile;

   493

   494

	// Construct a rectangle from those points

   495

	min_x = min_y = 0x7FFFFFFF;

   496

	max_x = max_y = 0;

   497

   498

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

   499

		uint tile = span[i];

   500

		if (tile) {

   501

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

   502

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

   503

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

   504

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

   505

		}

   506

	}

   507

   508

	// And retrieve the acceptance.

   509

	if (max_x != 0) {

   510

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

   511

	} else {

   512

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

   513

	}

   514

   515

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

   516

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

   517

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

   518

   519

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

   520

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

   521

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

   522

			amt = 0;

   523

   524

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

   525

	}

   526

   527

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

   528

	new_acc = GetAcceptanceMask(st);