1

/* $Id$ */

     2

     3

/** @file station_cmd.c */

     4

     5

#include "stdafx.h"

     6

#include "openttd.h"

     7

#include "bridge_map.h"

     8

#include "debug.h"

     9

#include "functions.h"

    10

#include "station_map.h"

    11

#include "table/sprites.h"

    12

#include "table/strings.h"

    13

#include "map.h"

    14

#include "tile.h"

    15

#include "station.h"

    16

#include "gfx.h"

    17

#include "window.h"

    18

#include "viewport.h"

    19

#include "command.h"

    20

#include "town.h"

    21

#include "vehicle.h"

    22

#include "news.h"

    23

#include "saveload.h"

    24

#include "economy.h"

    25

#include "player.h"

    26

#include "airport.h"

    27

#include "sprite.h"

    28

#include "depot.h"

    29

#include "train.h"

    30

#include "water_map.h"

    31

#include "industry_map.h"

    32

#include "newgrf_callbacks.h"

    33

#include "newgrf_station.h"

    34

#include "yapf/yapf.h"

    35

#include "date.h"

    36

#include "helpers.hpp"

    37

#include "misc/autoptr.hpp"

    38

    39

/**

    40

 * Called if a new block is added to the station-pool

    41

 */

    42

static void StationPoolNewBlock(uint start_item)

    43

{

    44

	Station *st;

    45

    46

	/* We don't use FOR_ALL here, because FOR_ALL skips invalid items.

    47

	 *  TODO - This is just a temporary stage, this will be removed. */

    48

	for (st = GetStation(start_item); st != NULL; st = (st->index + 1U < GetStationPoolSize()) ? GetStation(st->index + 1U) : NULL) st->index = start_item++;

    49

}

    50

    51

static void StationPoolCleanBlock(uint start_item, uint end_item)

    52

{

    53

	uint i;

    54

    55

	for (i = start_item; i <= end_item; i++) {

    56

		Station *st = GetStation(i);

    57

		if (IsValidStation(st)) st->~Station();

    58

	}

    59

}

    60

    61

/**

    62

 * Called if a new block is added to the roadstop-pool

    63

 */

    64

static void RoadStopPoolNewBlock(uint start_item)

    65

{

    66

	RoadStop *rs;

    67

    68

	/* We don't use FOR_ALL here, because FOR_ALL skips invalid items.

    69

	 * TODO - This is just a temporary stage, this will be removed. */

    70

	for (rs = GetRoadStop(start_item); rs != NULL; rs = (rs->index + 1U < GetRoadStopPoolSize()) ? GetRoadStop(rs->index + 1U) : NULL) {

    71

		rs->xy    = INVALID_TILE;

    72

		rs->index = start_item++;

    73

	}

    74

}

    75

    76

DEFINE_OLD_POOL(Station, Station, StationPoolNewBlock, StationPoolCleanBlock)

    77

DEFINE_OLD_POOL(RoadStop, RoadStop, RoadStopPoolNewBlock, NULL)

    78

    79

    80

extern void UpdateAirplanesOnNewStation(Station *st);

    81

    82

    83

RoadStop* GetRoadStopByTile(TileIndex tile, RoadStop::Type type)

    84

{

    85

	const Station* st = GetStationByTile(tile);

    86

	RoadStop* rs;

    87

    88

	for (rs = st->GetPrimaryRoadStop(type); rs->xy != tile; rs = rs->next) {

    89

		assert(rs->next != NULL);

    90

	}

    91

    92

	return rs;

    93

}

    94

    95

uint GetNumRoadStopsInStation(const Station* st, RoadStop::Type type)

    96

{

    97

	uint num = 0;

    98

	const RoadStop *rs;

    99

   100

	assert(st != NULL);

   101

	for (rs = st->GetPrimaryRoadStop(type); rs != NULL; rs = rs->next) num++;

   102

   103

	return num;

   104

}

   105

   106

   107

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

   108

 *  radius that is available within the station */

   109

static uint FindCatchmentRadius(const Station* st)

   110

{

   111

	CatchmentAera ret = CA_NONE;

   112

   113

	if (st->bus_stops != NULL)   ret = max(ret, CA_BUS);

   114

	if (st->truck_stops != NULL) ret = max(ret, CA_TRUCK);

   115

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

   116

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

   117

   118

	if (st->airport_tile) {

   119

		switch (st->airport_type) {

   120

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

   121

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

   122

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

   123

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

   124

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

   125

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

   126

			case AT_COMMUTER:      ret = max(ret, CA_AIR_COMMUTER); break;

   127

			case AT_HELIDEPOT:     ret = max(ret, CA_AIR_HELIDEPOT); break;

   128

			case AT_INTERCON:      ret = max(ret, CA_AIR_INTERCON); break;

   129

			case AT_HELISTATION:   ret = max(ret, CA_AIR_HELISTATION); break;

   130

		}

   131

	}

   132

   133

	return ret;

   134

}

   135

   136

#define CHECK_STATIONS_ERR ((Station*)-1)

   137

   138

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

   139

{

   140

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

   141

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

   142

		if (IsTileType(tile_cur, MP_STATION)) {

   143

			StationID t = GetStationIndex(tile_cur);

   144

			{

   145

				Station *st = GetStation(t);

   146

				// you cannot take control of an oilrig!!

   147

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

   148

					continue;

   149

			}

   150

   151

			if (closest_station == INVALID_STATION) {

   152

				closest_station = t;

   153

			} else if (closest_station != t) {

   154

				_error_message = STR_3006_ADJOINS_MORE_THAN_ONE_EXISTING;

   155

				return CHECK_STATIONS_ERR;

   156

			}

   157

		}

   158

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

   159

	return (closest_station == INVALID_STATION) ? NULL : GetStation(closest_station);

   160

}

   161

   162

static Station *AllocateStation(void)

   163

{

   164

	Station *st = NULL;

   165

   166

	/* We don't use FOR_ALL here, because FOR_ALL skips invalid items.

   167

	 * TODO - This is just a temporary stage, this will be removed. */

   168

	for (st = GetStation(0); st != NULL; st = (st->index + 1U < GetStationPoolSize()) ? GetStation(st->index + 1U) : NULL) {

   169

		if (!IsValidStation(st)) {

   170

			StationID index = st->index;

   171

   172

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

   173

			st->index = index;

   174

			return st;

   175

		}

   176

	}

   177

   178

	/* Check if we can add a block to the pool */

   179

	if (AddBlockToPool(&_Station_pool)) return AllocateStation();

   180

   181

	_error_message = STR_3008_TOO_MANY_STATIONS_LOADING;

   182

	return NULL;

   183

}

   184

   185

   186

/**

   187

 * Counts the numbers of tiles matching a specific type in the area around

   188

 * @param tile the center tile of the 'count area'

   189

 * @param type the type of tile searched for

   190

 * @param industry when type == MP_INDUSTRY, the type of the industry,

   191

 *                 in all other cases this parameter is ignored

   192

 * @result the noumber of matching tiles around

   193

 */

   194

static int CountMapSquareAround(TileIndex tile, TileType type, IndustryType industry)

   195

{

   196

	TileIndex cur_tile;

   197

	int dx, dy;

   198

	int num = 0;

   199

   200

	for (dx = -3; dx <= 3; dx++) {

   201

		for (dy = -3; dy <= 3; dy++) {

   202

			cur_tile = TILE_MASK(tile + TileDiffXY(dx, dy));

   203

   204

			if (IsTileType(cur_tile, type)) {

   205

				switch (type) {

   206

					case MP_INDUSTRY:

   207

						if (GetIndustryType(cur_tile) == industry)

   208

							num++;

   209

						break;

   210

   211

					case MP_WATER:

   212

						if (!IsWater(cur_tile))

   213

							break;

   214

						/* FALL THROUGH WHEN WATER TILE */

   215

					case MP_TREES:

   216

						num++;

   217

						break;

   218

   219

					default:

   220

						break;

   221

				}

   222

			}

   223

		}

   224

	}

   225

   226

	return num;

   227

}

   228

   229

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

   230

   231

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

   232

{

   233

	static const uint32 _gen_station_name_bits[] = {

   234

		0,                                      /* 0 */

   235

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

   236

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

   237

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

   238

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

   239

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

   240

	};

   241

   242

	Town *t = st->town;

   243

	uint32 free_names = (uint32)-1;

   244

	int found;

   245

	uint z,z2;

   246

	unsigned long tmp;

   247

   248

	{

   249

		Station *s;

   250

   251

		FOR_ALL_STATIONS(s) {

   252

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

   253

				uint str = M(s->string_id);

   254

				if (str <= 0x20) {

   255

					if (str == M(STR_SV_STNAME_FOREST))

   256

						str = M(STR_SV_STNAME_WOODS);

   257

					CLRBIT(free_names, str);

   258

				}

   259

			}

   260

		}

   261

	}

   262

   263

	/* check default names */

   264

	tmp = free_names & _gen_station_name_bits[flag];

   265

	if (tmp != 0) {

   266

		found = FindFirstBit(tmp);

   267

		goto done;

   268

	}

   269

   270

	/* check mine? */

   271

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

   272

		if (CountMapSquareAround(tile, MP_INDUSTRY, IT_COAL_MINE) >= 2 ||

   273

				CountMapSquareAround(tile, MP_INDUSTRY, IT_IRON_MINE) >= 2 ||

   274

				CountMapSquareAround(tile, MP_INDUSTRY, IT_COPPER_MINE) >= 2 ||

   275

				CountMapSquareAround(tile, MP_INDUSTRY, IT_GOLD_MINE) >= 2 ||

   276

				CountMapSquareAround(tile, MP_INDUSTRY, IT_DIAMOND_MINE) >= 2) {

   277

			found = M(STR_SV_STNAME_MINES);

   278

			goto done;

   279

		}

   280

	}

   281

   282

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

   283

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

   284

		found = M(STR_SV_STNAME);

   285

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

   286

   287

		found = M(STR_SV_STNAME_CENTRAL);

   288

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

   289

	}

   290

   291

	/* Check lakeside */

   292

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

   293

			DistanceFromEdge(tile) < 20 &&

   294

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

   295

		found = M(STR_SV_STNAME_LAKESIDE);

   296

		goto done;

   297

	}

   298

   299

	/* Check woods */

   300

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

   301

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

   302

				CountMapSquareAround(tile, MP_INDUSTRY, IT_FOREST) >= 2)

   303

			) {

   304

		found = _opt.landscape == LT_DESERT ?

   305

			M(STR_SV_STNAME_FOREST) : M(STR_SV_STNAME_WOODS);

   306

		goto done;

   307

	}

   308

   309

	/* check elevation compared to town */

   310

	z = GetTileZ(tile);

   311

	z2 = GetTileZ(t->xy);

   312

	if (z < z2) {

   313

		found = M(STR_SV_STNAME_VALLEY);

   314

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

   315

	} else if (z > z2) {

   316

		found = M(STR_SV_STNAME_HEIGHTS);

   317

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

   318

	}

   319

   320

	/* check direction compared to town */

   321

	{

   322

		static const int8 _direction_and_table[] = {

   323

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

   324

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

   325

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

   326

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

   327

		};

   328

   329

		free_names &= _direction_and_table[

   330

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

   331

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

   332

	}

   333

   334

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

   335

	if (tmp == 0) {

   336

		_error_message = STR_3007_TOO_MANY_STATIONS_LOADING;

   337

		return false;

   338

	}

   339

	found = FindFirstBit(tmp);

   340

   341

done:

   342

	st->string_id = found + STR_SV_STNAME;

   343

	return true;

   344

}

   345

#undef M

   346

   347

static Station* GetClosestStationFromTile(TileIndex tile, uint threshold, PlayerID owner)

   348

{

   349

	Station* best_station = NULL;

   350

	Station* st;

   351

   352

	FOR_ALL_STATIONS(st) {

   353

		if ((owner == PLAYER_SPECTATOR || st->owner == owner)) {

   354

			uint cur_dist = DistanceManhattan(tile, st->xy);

   355

   356

			if (cur_dist < threshold) {

   357

				threshold = cur_dist;

   358

				best_station = st;

   359

			}

   360

		}

   361

	}

   362

   363

	return best_station;

   364

}

   365

   366

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

   367

// st = Station to update for.

   368

static void UpdateStationVirtCoord(Station *st)

   369

{

   370

	Point pt = RemapCoords2(TileX(st->xy) * TILE_SIZE, TileY(st->xy) * TILE_SIZE);

   371

   372

	pt.y -= 32;

   373

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

   374

   375

	SetDParam(0, st->index);

   376

	SetDParam(1, st->facilities);

   377

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

   378

}

   379

   380

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

   381

void UpdateAllStationVirtCoord(void)

   382

{

   383

	Station* st;

   384

   385

	FOR_ALL_STATIONS(st) {

   386

		UpdateStationVirtCoord(st);

   387

	}

   388

}

   389

   390

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

   391

static void UpdateStationVirtCoordDirty(Station *st)

   392

{

   393

	st->MarkDirty();

   394

	UpdateStationVirtCoord(st);

   395

	st->MarkDirty();

   396

}

   397

   398

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

   399

static uint GetAcceptanceMask(const Station *st)

   400

{

   401

	uint mask = 0;

   402

	uint i;

   403

   404

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

   405

		if (st->goods[i].waiting_acceptance & 0x8000) mask |= 1 << i;

   406

	}

   407

	return mask;

   408

}

   409

   410

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

   411

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

   412

static void ShowRejectOrAcceptNews(const Station *st, uint num_items, CargoID *cargo, StringID msg)

   413

{

   414

	for (uint i = 0; i < num_items; i++) {

   415

		SetDParam(i + 1, _cargoc.names_s[cargo[i]]);

   416

	}

   417

   418

	SetDParam(0, st->index);

   419

	AddNewsItem(msg, NEWS_FLAGS(NM_SMALL, NF_VIEWPORT|NF_TILE, NT_ACCEPTANCE, 0), st->xy, 0);

   420

}

   421

   422

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

   423

void GetProductionAroundTiles(AcceptedCargo produced, TileIndex tile,

   424

	int w, int h, int rad)

   425

{

   426

	int x,y;

   427

	int x1,y1,x2,y2;

   428

	int xc,yc;

   429

   430

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

   431

   432

	x = TileX(tile);

   433

	y = TileY(tile);

   434

   435

	// expand the region by rad tiles on each side

   436

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

   437

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

   438

	x1 = max(x - rad, 0);

   439

   440

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

   441

	y1 = max(y - rad, 0);

   442

   443

	assert(x1 < x2);

   444

	assert(y1 < y2);

   445

	assert(w > 0);

   446

	assert(h > 0);

   447

   448

	for (yc = y1; yc != y2; yc++) {

   449

		for (xc = x1; xc != x2; xc++) {

   450

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

   451

				GetProducedCargoProc *gpc;

   452

				TileIndex tile = TileXY(xc, yc);

   453

   454

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

   455

				if (gpc != NULL) {

   456

					CargoID cargos[2] = { CT_INVALID, CT_INVALID };

   457

   458

					gpc(tile, cargos);

   459

					if (cargos[0] != CT_INVALID) {

   460

						produced[cargos[0]]++;

   461

						if (cargos[1] != CT_INVALID) {

   462

							produced[cargos[1]]++;

   463

						}

   464

					}

   465

				}

   466

			}

   467

		}

   468

	}

   469

}

   470

   471

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

   472

void GetAcceptanceAroundTiles(AcceptedCargo accepts, TileIndex tile,

   473

	int w, int h, int rad)

   474

{

   475

	int x,y;

   476

	int x1,y1,x2,y2;

   477

	int xc,yc;

   478

   479

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

   480

   481

	x = TileX(tile);

   482

	y = TileY(tile);

   483

   484

	// expand the region by rad tiles on each side

   485

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

   486

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

   487

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

   488

	x1 = max(x - rad, 0);

   489

	y1 = max(y - rad, 0);

   490

   491

	assert(x1 < x2);

   492

	assert(y1 < y2);

   493

	assert(w > 0);

   494

	assert(h > 0);

   495

   496

	for (yc = y1; yc != y2; yc++) {

   497

		for (xc = x1; xc != x2; xc++) {