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

#include "road.h"

    39

    40

/**

    41

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

    42

 */

    43

static void StationPoolNewBlock(uint start_item)

    44

{

    45

	Station *st;

    46

    47

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

    48

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

    49

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

    50

}

    51

    52

static void StationPoolCleanBlock(uint start_item, uint end_item)

    53

{

    54

	uint i;

    55

    56

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

    57

		Station *st = GetStation(i);

    58

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

    59

	}

    60

}

    61

    62

/**

    63

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

    64

 */

    65

static void RoadStopPoolNewBlock(uint start_item)

    66

{

    67

	RoadStop *rs;

    68

    69

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

    70

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

    71

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

    72

		rs->xy    = INVALID_TILE;

    73

		rs->index = start_item++;

    74

	}

    75

}

    76

    77

DEFINE_OLD_POOL(Station, Station, StationPoolNewBlock, StationPoolCleanBlock)

    78

DEFINE_OLD_POOL(RoadStop, RoadStop, RoadStopPoolNewBlock, NULL)

    79

    80

    81

extern void UpdateAirplanesOnNewStation(Station *st);

    82

    83

    84

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

    85

{

    86

	const Station* st = GetStationByTile(tile);

    87

	RoadStop* rs;

    88

    89

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

    90

		assert(rs->next != NULL);

    91

	}

    92

    93

	return rs;

    94

}

    95

    96

    97

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

    98

{

    99

	uint num = 0;

   100

	const RoadStop *rs;

   101

   102

	assert(st != NULL);

   103

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

   104

   105

	return num;

   106

}

   107

   108

   109

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

   110

 *  radius that is available within the station */

   111

static uint FindCatchmentRadius(const Station* st)

   112

{

   113

	CatchmentAera ret = CA_NONE;

   114

   115

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

   116

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

   117

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

   118

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

   119

   120

	if (st->airport_tile) {

   121

		switch (st->airport_type) {

   122

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

   123

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

   124

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

   125

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

   126

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

   127

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

   128

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

   129

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

   130

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

   131

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

   132

		}

   133

	}

   134

   135

	return ret;

   136

}

   137

   138

#define CHECK_STATIONS_ERR ((Station*)-1)

   139

   140

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

   141

{

   142

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

   143

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

   144

		if (IsTileType(tile_cur, MP_STATION)) {

   145

			StationID t = GetStationIndex(tile_cur);

   146

			{

   147

				Station *st = GetStation(t);

   148

				// you cannot take control of an oilrig!!

   149

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

   150

					continue;

   151

			}

   152

   153

			if (closest_station == INVALID_STATION) {

   154

				closest_station = t;

   155

			} else if (closest_station != t) {

   156

				_error_message = STR_3006_ADJOINS_MORE_THAN_ONE_EXISTING;

   157

				return CHECK_STATIONS_ERR;

   158

			}

   159

		}

   160

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

   161

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

   162

}

   163

   164

static Station *AllocateStation(void)

   165

{

   166

	Station *st = NULL;

   167

   168

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

   169

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

   170

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

   171

		if (!st->IsValid()) {

   172

			StationID index = st->index;

   173

   174

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

   175

			st->index = index;

   176

			return st;

   177

		}

   178

	}

   179

   180

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

   181

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

   182

   183

	_error_message = STR_3008_TOO_MANY_STATIONS_LOADING;

   184

	return NULL;

   185

}

   186

   187

   188

/**

   189

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

   190

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

   191

 * @param type the type of tile searched for

   192

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

   193

 *                 in all other cases this parameter is ignored

   194

 * @result the noumber of matching tiles around

   195

 */

   196

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

   197

{

   198

	TileIndex cur_tile;

   199

	int dx, dy;

   200

	int num = 0;

   201

   202

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

   203

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

   204

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

   205

   206

			if (IsTileType(cur_tile, type)) {

   207

				switch (type) {

   208

					case MP_INDUSTRY:

   209

						if (GetIndustryType(cur_tile) == industry)

   210

							num++;

   211

						break;

   212

   213

					case MP_WATER:

   214

						if (!IsWater(cur_tile))

   215

							break;

   216

						/* FALL THROUGH WHEN WATER TILE */

   217

					case MP_TREES:

   218

						num++;

   219

						break;

   220

   221

					default:

   222

						break;

   223

				}

   224

			}

   225

		}

   226

	}

   227

   228

	return num;

   229

}

   230

   231

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

   232

   233

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

   234

{

   235

	static const uint32 _gen_station_name_bits[] = {

   236

		0,                                      /* 0 */

   237

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

   238

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

   239

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

   240

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

   241

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

   242

	};

   243

   244

	Town *t = st->town;

   245

	uint32 free_names = (uint32)-1;

   246

	int found;

   247

	uint z,z2;

   248

	unsigned long tmp;

   249

   250

	{

   251

		Station *s;

   252

   253

		FOR_ALL_STATIONS(s) {

   254

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

   255

				uint str = M(s->string_id);

   256

				if (str <= 0x20) {

   257

					if (str == M(STR_SV_STNAME_FOREST))

   258

						str = M(STR_SV_STNAME_WOODS);

   259

					CLRBIT(free_names, str);

   260

				}

   261

			}

   262

		}

   263

	}

   264

   265

	/* check default names */

   266

	tmp = free_names & _gen_station_name_bits[flag];

   267

	if (tmp != 0) {

   268

		found = FindFirstBit(tmp);

   269

		goto done;

   270

	}

   271

   272

	/* check mine? */

   273

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

   274

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

   275

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

   276

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

   277

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

   278

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

   279

			found = M(STR_SV_STNAME_MINES);

   280

			goto done;

   281

		}

   282

	}

   283

   284

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

   285

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

   286

		found = M(STR_SV_STNAME);

   287

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

   288

   289

		found = M(STR_SV_STNAME_CENTRAL);

   290

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

   291

	}

   292

   293

	/* Check lakeside */

   294

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

   295

			DistanceFromEdge(tile) < 20 &&

   296

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

   297

		found = M(STR_SV_STNAME_LAKESIDE);

   298

		goto done;

   299

	}

   300

   301

	/* Check woods */

   302

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

   303

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

   304

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

   305

			) {

   306

		found = _opt.landscape == LT_DESERT ?

   307

			M(STR_SV_STNAME_FOREST) : M(STR_SV_STNAME_WOODS);

   308

		goto done;

   309

	}

   310

   311

	/* check elevation compared to town */

   312

	z = GetTileZ(tile);

   313

	z2 = GetTileZ(t->xy);

   314

	if (z < z2) {

   315

		found = M(STR_SV_STNAME_VALLEY);

   316

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

   317

	} else if (z > z2) {

   318

		found = M(STR_SV_STNAME_HEIGHTS);

   319

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

   320

	}

   321

   322

	/* check direction compared to town */

   323

	{

   324

		static const int8 _direction_and_table[] = {

   325

			~( (1<<M(STR_SV_STNAME_WEST)) | (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_NORTH)) ),

   327

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

   328

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

   329

		};

   330

   331

		free_names &= _direction_and_table[

   332

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

   333

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

   334

	}

   335

   336

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

   337

	if (tmp == 0) {

   338

		_error_message = STR_3007_TOO_MANY_STATIONS_LOADING;

   339

		return false;

   340

	}

   341

	found = FindFirstBit(tmp);

   342

   343

done:

   344

	st->string_id = found + STR_SV_STNAME;

   345

	return true;

   346

}

   347

#undef M

   348

   349

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

   350

{

   351

	Station* best_station = NULL;

   352

	Station* st;

   353

   354

	FOR_ALL_STATIONS(st) {

   355

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

   356

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

   357

   358

			if (cur_dist < threshold) {

   359

				threshold = cur_dist;

   360

				best_station = st;

   361

			}

   362

		}

   363

	}

   364

   365

	return best_station;

   366

}

   367

   368

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

   369

// st = Station to update for.

   370

static void UpdateStationVirtCoord(Station *st)

   371

{

   372

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

   373

   374

	pt.y -= 32;

   375

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

   376

   377

	SetDParam(0, st->index);

   378

	SetDParam(1, st->facilities);

   379

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

   380

}

   381

   382

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

   383

void UpdateAllStationVirtCoord(void)

   384

{

   385

	Station* st;

   386

   387

	FOR_ALL_STATIONS(st) {

   388

		UpdateStationVirtCoord(st);

   389

	}

   390

}

   391

   392

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

   393

static void UpdateStationVirtCoordDirty(Station *st)

   394

{

   395

	st->MarkDirty();

   396

	UpdateStationVirtCoord(st);

   397

	st->MarkDirty();

   398

}

   399

   400

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

   401

static uint GetAcceptanceMask(const Station *st)

   402

{

   403

	uint mask = 0;

   404

	uint i;

   405

   406

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

   407

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

   408

	}

   409

	return mask;

   410

}

   411

   412

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

   413

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

   414

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

   415

{

   416

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

   417

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

   418

	}

   419

   420

	SetDParam(0, st->index);

   421

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

   422

}

   423

   424

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

   425

void GetProductionAroundTiles(AcceptedCargo produced, TileIndex tile,

   426

	int w, int h, int rad)

   427

{

   428

	int x,y;

   429

	int x1,y1,x2,y2;

   430

	int xc,yc;

   431

   432

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

   433

   434

	x = TileX(tile);

   435

	y = TileY(tile);

   436

   437

	// expand the region by rad tiles on each side

   438

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

   439

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

   440

	x1 = max(x - rad, 0);

   441

   442

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

   443

	y1 = max(y - rad, 0);

   444

   445

	assert(x1 < x2);

   446

	assert(y1 < y2);

   447

	assert(w > 0);

   448

	assert(h > 0);

   449

   450

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

   451

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

   452

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

   453

				GetProducedCargoProc *gpc;

   454

				TileIndex tile = TileXY(xc, yc);

   455

   456

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

   457

				if (gpc != NULL) {

   458

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

   459

   460

					gpc(tile, cargos);

   461

					if (cargos[0] != CT_INVALID) {

   462

						produced[cargos[0]]++;

   463

						if (cargos[1] != CT_INVALID) {

   464

							produced[cargos[1]]++;

   465

						}

   466

					}

   467

				}

   468

			}

   469

		}

   470

	}

   471

}

   472

   473

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

   474

void GetAcceptanceAroundTiles(AcceptedCargo accepts, TileIndex tile,

   475

	int w, int h, int rad)

   476

{

   477

	int x,y;

   478

	int x1,y1,x2,y2;

   479

	int xc,yc;

   480

   481

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

   482

   483

	x = TileX(tile);

   484

	y = TileY(tile);

   485

   486

	// expand the region by rad tiles on each side

   487

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

   488

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

   489

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

   490

	x1 = max(x - rad, 0);

   491

	y1 = max(y - rad, 0);

   492

   493

	assert(x1 < x2);

   494

	assert(y1 < y2);

   495

	assert(w > 0);

   496

	assert(h > 0);

   497