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* GetPrimaryRoadStop(const Station* st, RoadStop::Type type)

    84

{

    85

	switch (type) {

    86

		case RoadStop::BUS:   return st->bus_stops;

    87

		case RoadStop::TRUCK: return st->truck_stops;

    88

		default: NOT_REACHED();

    89

	}

    90

    91

	return NULL;

    92

}

    93

    94

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

    95

{

    96

	const Station* st = GetStationByTile(tile);

    97

	RoadStop* rs;

    98

    99

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

   100

		assert(rs->next != NULL);

   101

	}

   102

   103

	return rs;

   104

}

   105

   106

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

   107

{

   108

	uint num = 0;

   109

	const RoadStop *rs;

   110

   111

	assert(st != NULL);

   112

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

   113

   114

	return num;

   115

}

   116

   117

   118

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

   119

 *  radius that is available within the station */

   120

static uint FindCatchmentRadius(const Station* st)

   121

{

   122

	CatchmentAera ret = CA_NONE;

   123

   124

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

   125

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

   126

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

   127

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

   128

   129

	if (st->airport_tile) {

   130

		switch (st->airport_type) {

   131

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

   132

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

   133

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

   134

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

   135

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

   136

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

   137

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

   138

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

   139

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

   140

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

   141

		}

   142

	}

   143

   144

	return ret;

   145

}

   146

   147

#define CHECK_STATIONS_ERR ((Station*)-1)

   148

   149

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

   150

{

   151

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

   152

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

   153

		if (IsTileType(tile_cur, MP_STATION)) {

   154

			StationID t = GetStationIndex(tile_cur);

   155

			{

   156

				Station *st = GetStation(t);

   157

				// you cannot take control of an oilrig!!

   158

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

   159

					continue;

   160

			}

   161

   162

			if (closest_station == INVALID_STATION) {

   163

				closest_station = t;

   164

			} else if (closest_station != t) {

   165

				_error_message = STR_3006_ADJOINS_MORE_THAN_ONE_EXISTING;

   166

				return CHECK_STATIONS_ERR;

   167

			}

   168

		}

   169

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

   170

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

   171

}

   172

   173

static Station *AllocateStation(void)

   174

{

   175

	Station *st = NULL;

   176

   177

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

   178

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

   179

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

   180

		if (!IsValidStation(st)) {

   181

			StationID index = st->index;

   182

   183

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

   184

			st->index = index;

   185

			return st;

   186

		}

   187

	}

   188

   189

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

   190

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

   191

   192

	_error_message = STR_3008_TOO_MANY_STATIONS_LOADING;

   193

	return NULL;

   194

}

   195

   196

   197

/**

   198

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

   199

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

   200

 * @param type the type of tile searched for

   201

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

   202

 *                 in all other cases this parameter is ignored

   203

 * @result the noumber of matching tiles around

   204

 */

   205

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

   206

{

   207

	TileIndex cur_tile;

   208

	int dx, dy;

   209

	int num = 0;

   210

   211

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

   212

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

   213

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

   214

   215

			if (IsTileType(cur_tile, type)) {

   216

				switch (type) {

   217

					case MP_INDUSTRY:

   218

						if (GetIndustryType(cur_tile) == industry)

   219

							num++;

   220

						break;

   221

   222

					case MP_WATER:

   223

						if (!IsWater(cur_tile))

   224

							break;

   225

						/* FALL THROUGH WHEN WATER TILE */

   226

					case MP_TREES:

   227

						num++;

   228

						break;

   229

   230

					default:

   231

						break;

   232

				}

   233

			}

   234

		}

   235

	}

   236

   237

	return num;

   238

}

   239

   240

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

   241

   242

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

   243

{

   244

	static const uint32 _gen_station_name_bits[] = {

   245

		0,                                      /* 0 */

   246

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

   247

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

   248

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

   249

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

   250

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

   251

	};

   252

   253

	Town *t = st->town;

   254

	uint32 free_names = (uint32)-1;

   255

	int found;

   256

	uint z,z2;

   257

	unsigned long tmp;

   258

   259

	{

   260

		Station *s;

   261

   262

		FOR_ALL_STATIONS(s) {

   263

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

   264

				uint str = M(s->string_id);

   265

				if (str <= 0x20) {

   266

					if (str == M(STR_SV_STNAME_FOREST))

   267

						str = M(STR_SV_STNAME_WOODS);

   268

					CLRBIT(free_names, str);

   269

				}

   270

			}

   271

		}

   272

	}

   273

   274

	/* check default names */

   275

	tmp = free_names & _gen_station_name_bits[flag];

   276

	if (tmp != 0) {

   277

		found = FindFirstBit(tmp);

   278

		goto done;

   279

	}

   280

   281

	/* check mine? */

   282

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

   283

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

   284

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

   285

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

   286

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

   287

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

   288

			found = M(STR_SV_STNAME_MINES);

   289

			goto done;

   290

		}

   291

	}

   292

   293

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

   294

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

   295

		found = M(STR_SV_STNAME);

   296

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

   297

   298

		found = M(STR_SV_STNAME_CENTRAL);

   299

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

   300

	}

   301

   302

	/* Check lakeside */

   303

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

   304

			DistanceFromEdge(tile) < 20 &&

   305

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

   306

		found = M(STR_SV_STNAME_LAKESIDE);

   307

		goto done;

   308

	}

   309

   310

	/* Check woods */

   311

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

   312

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

   313

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

   314

			) {

   315

		found = _opt.landscape == LT_DESERT ?

   316

			M(STR_SV_STNAME_FOREST) : M(STR_SV_STNAME_WOODS);

   317

		goto done;

   318

	}

   319

   320

	/* check elevation compared to town */

   321

	z = GetTileZ(tile);

   322

	z2 = GetTileZ(t->xy);

   323

	if (z < z2) {

   324

		found = M(STR_SV_STNAME_VALLEY);

   325

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

   326

	} else if (z > z2) {

   327

		found = M(STR_SV_STNAME_HEIGHTS);

   328

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

   329

	}

   330

   331

	/* check direction compared to town */

   332

	{

   333

		static const int8 _direction_and_table[] = {

   334

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

   335

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

   336

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

   337

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

   338

		};

   339

   340

		free_names &= _direction_and_table[

   341

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

   342

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

   343

	}

   344

   345

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

   346

	if (tmp == 0) {

   347

		_error_message = STR_3007_TOO_MANY_STATIONS_LOADING;

   348

		return false;

   349

	}

   350

	found = FindFirstBit(tmp);

   351

   352

done:

   353

	st->string_id = found + STR_SV_STNAME;

   354

	return true;

   355

}

   356

#undef M

   357

   358

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

   359

{

   360

	Station* best_station = NULL;

   361

	Station* st;

   362

   363

	FOR_ALL_STATIONS(st) {

   364

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

   365

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

   366

   367

			if (cur_dist < threshold) {

   368

				threshold = cur_dist;

   369

				best_station = st;

   370

			}

   371

		}

   372

	}

   373

   374

	return best_station;

   375

}

   376

   377

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

   378

// st = Station to update for.

   379

static void UpdateStationVirtCoord(Station *st)

   380

{

   381

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

   382

   383

	pt.y -= 32;

   384

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

   385

   386

	SetDParam(0, st->index);

   387

	SetDParam(1, st->facilities);

   388

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

   389

}

   390

   391

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

   392

void UpdateAllStationVirtCoord(void)

   393

{

   394

	Station* st;

   395

   396

	FOR_ALL_STATIONS(st) {

   397

		UpdateStationVirtCoord(st);

   398

	}

   399

}

   400

   401

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

   402

static void UpdateStationVirtCoordDirty(Station *st)

   403

{

   404

	st->MarkDirty();

   405

	UpdateStationVirtCoord(st);

   406

	st->MarkDirty();

   407

}

   408

   409

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

   410

static uint GetAcceptanceMask(const Station *st)

   411

{

   412

	uint mask = 0;

   413

	uint i;

   414

   415

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

   416

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

   417

	}

   418

	return mask;

   419

}

   420

   421

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

   422

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

   423

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

   424

{

   425

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

   426

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

   427

	}

   428

   429

	SetDParam(0, st->index);

   430

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

   431

}

   432

   433

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

   434

void GetProductionAroundTiles(AcceptedCargo produced, TileIndex tile,

   435

	int w, int h, int rad)

   436

{

   437

	int x,y;

   438

	int x1,y1,x2,y2;

   439

	int xc,yc;

   440

   441

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

   442

   443

	x = TileX(tile);

   444

	y = TileY(tile);

   445

   446

	// expand the region by rad tiles on each side

   447

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

   448

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

   449

	x1 = max(x - rad, 0);

   450

   451

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

   452

	y1 = max(y - rad, 0);

   453

   454

	assert(x1 < x2);

   455

	assert(y1 < y2);

   456

	assert(w > 0);

   457

	assert(h > 0);

   458

   459

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

   460

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

   461

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

   462

				GetProducedCargoProc *gpc;

   463

				TileIndex tile = TileXY(xc, yc);

   464

   465

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

   466

				if (gpc != NULL) {

   467

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

   468

   469

					gpc(tile, cargos);

   470

					if (cargos[0] != CT_INVALID) {

   471

						produced[cargos[0]]++;

   472

						if (cargos[1] != CT_INVALID) {

   473

							produced[cargos[1]]++;

   474

						}

   475

					}

   476

				}

   477

			}

   478

		}

   479

	}

   480

}

   481

   482

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

   483

void GetAcceptanceAroundTiles(AcceptedCargo accepts, TileIndex tile,

   484

	int w, int h, int rad)

   485

{

   486

	int x,y;

   487

	int x1,y1,x2,y2;

   488

	int xc,yc;

   489

   490

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

   491

   492

	x = TileX(tile);

   493

	y = TileY(tile);

   494

   495

	// expand the region by rad tiles on each side

   496

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