1

/* $Id$ */

     2

     3

/** @file station.cpp */

     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

    38

Station::Station(TileIndex tile)

    39

{

    40

	DEBUG(station, cDebugCtorLevel, "I+%3d", index);

    41

    42

	xy = tile;

    43

	airport_tile = dock_tile = train_tile = 0;

    44

	bus_stops = truck_stops = NULL;

    45

	had_vehicle_of_type = 0;

    46

	time_since_load = 255;

    47

	time_since_unload = 255;

    48

	delete_ctr = 0;

    49

	facilities = 0;

    50

    51

	last_vehicle_type = VEH_INVALID;

    52

    53

	random_bits = 0; // Random() must be called when station is really built (DC_EXEC)

    54

	waiting_triggers = 0;

    55

}

    56

    57

/**

    58

 * Clean up a station by clearing vehicle orders and invalidating windows.

    59

 * Aircraft-Hangar orders need special treatment here, as the hangars are

    60

 * actually part of a station (tiletype is STATION), but the order type

    61

 * is OT_GOTO_DEPOT.

    62

 */

    63

Station::~Station()

    64

{

    65

	DEBUG(station, cDebugCtorLevel, "I-%3d", index);

    66

    67

	DeleteName(string_id);

    68

	MarkDirty();

    69

	RebuildStationLists();

    70

	InvalidateWindowClasses(WC_STATION_LIST);

    71

    72

	DeleteWindowById(WC_STATION_VIEW, index);

    73

    74

	/* Now delete all orders that go to the station */

    75

	RemoveOrderFromAllVehicles(OT_GOTO_STATION, index);

    76

    77

	/* Subsidies need removal as well */

    78

	DeleteSubsidyWithStation(index);

    79

    80

	free(speclist);

    81

	xy = 0;

    82

}

    83

    84

void* Station::operator new(size_t size)

    85

{

    86

	Station *st = AllocateRaw();

    87

	return st;

    88

}

    89

    90

void* Station::operator new(size_t size, int st_idx)

    91

{

    92

	if (!AddBlockIfNeeded(&_Station_pool, st_idx))

    93

		error("Stations: failed loading savegame: too many stations");

    94

    95

	Station *st = GetStation(st_idx);

    96

	return st;

    97

}

    98

    99

void Station::operator delete(void *p)

   100

{

   101

}

   102

   103

void Station::operator delete(void *p, int st_idx)

   104

{

   105

}

   106

   107

/** Called when new facility is built on the station. If it is the first facility

   108

 * it initializes also 'xy' and 'random_bits' members */

   109

void Station::AddFacility(byte new_facility_bit, TileIndex facil_xy)

   110

{

   111

	if (facilities == 0) {

   112

		xy = facil_xy;

   113

		random_bits = Random();

   114

	}

   115

	facilities |= new_facility_bit;

   116

	owner = _current_player;

   117

	build_date = _date;

   118

}

   119

   120

void Station::MarkDirty() const

   121

{

   122

	if (sign.width_1 != 0) {

   123

		InvalidateWindowWidget(WC_STATION_VIEW, index, 1);

   124

   128

		MarkAllViewportsDirty(

   129

			sign.left - 6,

   130

			sign.top,

   133

	}

   134

}

   135

   136

void Station::MarkTilesDirty() const

   137

{

   138

	TileIndex tile = train_tile;

   139

	int w, h;

   140

   141

	/* XXX No station is recorded as 0, not INVALID_TILE... */

   142

	if (tile == 0) return;

   143

   144

	for (h = 0; h < trainst_h; h++) {

   145

		for (w = 0; w < trainst_w; w++) {

   146

			if (TileBelongsToRailStation(tile)) {

   147

				MarkTileDirtyByTile(tile);

   148

			}

   149

			tile += TileDiffXY(1, 0);

   150

		}

   151

		tile += TileDiffXY(-w, 1);

   152

	}

   153

}

   154

   155

bool Station::TileBelongsToRailStation(TileIndex tile) const

   156

{

   157

	return IsTileType(tile, MP_STATION) && GetStationIndex(tile) == index && IsRailwayStation(tile);

   158

}

   159

   160

/*static*/ Station *Station::AllocateRaw()

   161

{

   162

	Station *st = NULL;

   163

   164

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

   165

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

   166

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

   167

		if (!st->IsValid()) {

   168

			StationID index = st->index;

   169

   170

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

   171

			st->index = index;

   172

			return st;

   173

		}

   174

	}

   175

   176

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

   177

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

   178

   179

	_error_message = STR_3008_TOO_MANY_STATIONS_LOADING;

   180

	return NULL;

   181

}

   182

   183

   184

/** Obtain the length of a platform

   185

 * @pre tile must be a railway station tile

   186

 * @param tile A tile that contains the platform in question

   187

 * @return The length of the platform

   188

 */

   189

uint Station::GetPlatformLength(TileIndex tile) const

   190

{

   191

	TileIndex t;

   192

	TileIndexDiff delta;

   193

	uint len = 0;

   194

	assert(TileBelongsToRailStation(tile));

   195

   196

	delta = (GetRailStationAxis(tile) == AXIS_X ? TileDiffXY(1, 0) : TileDiffXY(0, 1));

   197

   198

	t = tile;

   199

	do {

   200

		t -= delta;

   201

		len++;

   202

	} while (IsCompatibleTrainStationTile(t, tile));

   203

   204

	t = tile;

   205

	do {

   206

		t += delta;

   207

		len++;

   208

	} while (IsCompatibleTrainStationTile(t, tile));

   209

   210

	return len - 1;

   211

}

   212

   213

/** Determines the REMAINING length of a platform, starting at (and including)

   214

 * the given tile.

   215

 * @param tile the tile from which to start searching. Must be a railway station tile

   216

 * @param dir The direction in which to search.

   217

 * @return The platform length

   218

 */

   219

uint Station::GetPlatformLength(TileIndex tile, DiagDirection dir) const

   220

{

   221

	TileIndex start_tile = tile;

   222

	uint length = 0;

   223

	assert(IsRailwayStationTile(tile));

   224

	assert(dir < DIAGDIR_END);

   225

   226

	do {

   227

		length ++;

   228

		tile += TileOffsByDiagDir(dir);

   229

	} while (IsCompatibleTrainStationTile(tile, start_tile));

   230

   231

	return length;

   232

}

   233

   234

/** Determines whether a station is a buoy only.

   235

 * @todo Ditch this encoding of buoys

   236

 */

   237

bool Station::IsBuoy() const

   238

{

   239

	return (had_vehicle_of_type & HVOT_BUOY) != 0;

   240

}

   241

   242

/** Determines whether a station exists

   243

 * @todo replace 0 by INVALID_TILE

   244

 */

   245

bool Station::IsValid() const

   246

{

   247

	return xy != 0;

   248

}

   249

   250

   251

/************************************************************************/

   252

/*                     StationRect implementation                       */

   253

/************************************************************************/

   254

   255

StationRect::StationRect()

   256

{

   257

	MakeEmpty();

   258

}

   259

   260

void StationRect::MakeEmpty()

   261

{

   262

	left = top = right = bottom = 0;

   263

}

   264

   265

/**

   266

 * Determines whether a given point (x, y) is within a certain distance of

   267

 * the station rectangle.

   268

 * @note x and y are in Tile coordinates

   269

 * @param x X coordinate

   270

 * @param y Y coordinate

   271

 * @param distance The maxmium distance a point may have (L1 norm)

   272

 * @return true if the point is within distance tiles of the station rectangle

   273

 */

   274

bool StationRect::PtInExtendedRect(int x, int y, int distance) const

   275

{

   276

	return (left - distance <= x && x <= right + distance && top - distance <= y && y <= bottom + distance);

   277

}

   278

   279

bool StationRect::IsEmpty() const

   280

{

   281

	return (left == 0 || left > right || top > bottom);

   282

}

   283

   284

bool StationRect::BeforeAddTile(TileIndex tile, StationRectMode mode)

   285

{

   286

	int x = TileX(tile);

   287

	int y = TileY(tile);

   288

	if (IsEmpty()) {

   289

		/* we are adding the first station tile */

   290

		left = right = x;

   291

		top = bottom = y;

   292

   293

	} else if (!PtInExtendedRect(x, y)) {

   294

		/* current rect is not empty and new point is outside this rect */

   295

		/* make new spread-out rectangle */

   296

		Rect new_rect = {min(x, left), min(y, top), max(x, right), max(y, bottom)};

   297

   298

		/* check new rect dimensions against preset max */

   299

		int w = new_rect.right - new_rect.left + 1;

   300

		int h = new_rect.bottom - new_rect.top + 1;

   301

		if (mode != ADD_FORCE && (w > _patches.station_spread || h > _patches.station_spread)) {

   302

			assert(mode != ADD_TRY);

   303

			_error_message = STR_306C_STATION_TOO_SPREAD_OUT;

   304

			return false;

   305

		}

   306

   307

		/* spread-out ok, return true */

   308

		if (mode != ADD_TEST) {

   309

			/* we should update the station rect */

   310

			*this = new_rect;

   311

		}

   312

	} else {

   313

		; // new point is inside the rect, we don't need to do anything

   314

	}

   315

	return true;

   316

}

   317

   318

bool StationRect::BeforeAddRect(TileIndex tile, int w, int h, StationRectMode mode)

   319

{

   320

	return BeforeAddTile(tile, mode) && BeforeAddTile(TILE_ADDXY(tile, w - 1, h - 1), mode);

   321

}

   322

   323

/*static*/ bool StationRect::ScanForStationTiles(StationID st_id, int left_a, int top_a, int right_a, int bottom_a)

   324

{

   325

	TileIndex top_left = TileXY(left_a, top_a);

   326

	int width = right_a - left_a + 1;

   327

	int height = bottom_a - top_a + 1;

   328

   329

	BEGIN_TILE_LOOP(tile, width, height, top_left)

   330

		if (IsTileType(tile, MP_STATION) && GetStationIndex(tile) == st_id) return true;

   331

	END_TILE_LOOP(tile, width, height, top_left);

   332

   333

	return false;

   334

}

   335

   336

bool StationRect::AfterRemoveTile(Station *st, TileIndex tile)

   337

{

   338

	int x = TileX(tile);

   339

	int y = TileY(tile);

   340

   341

	/* look if removed tile was on the bounding rect edge

   342

	 * and try to reduce the rect by this edge

   343

	 * do it until we have empty rect or nothing to do */

   344

	for (;;) {

   345

		/* check if removed tile is on rect edge */

   346

		bool left_edge = (x == left);

   347

		bool right_edge = (x == right);

   348

		bool top_edge = (y == top);

   349

		bool bottom_edge = (y == bottom);

   350

   351

		/* can we reduce the rect in either direction? */

   352

		bool reduce_x = ((left_edge || right_edge) && !ScanForStationTiles(st->index, x, top, x, bottom));

   353

		bool reduce_y = ((top_edge || bottom_edge) && !ScanForStationTiles(st->index, left, y, right, y));

   354

		if (!(reduce_x || reduce_y)) break; // nothing to do (can't reduce)

   355

   356

		if (reduce_x) {

   357

			/* reduce horizontally */

   358

			if (left_edge) {

   359

				/* move left edge right */

   360

				left = x = x + 1;

   361

			} else {

   362

				/* move right edge left */

   363

				right = x = x - 1;

   364

			}

   365

		}

   366

		if (reduce_y) {

   367

			/* reduce vertically */

   368

			if (top_edge) {

   369

				/* move top edge down */

   370

				top = y = y + 1;

   371

			} else {

   372

				/* move bottom edge up */

   373

				bottom = y = y - 1;

   374

			}

   375

		}

   376

   377

		if (left > right || top > bottom) {

   378

			/* can't continue, if the remaining rectangle is empty */

   379

			MakeEmpty();

   380

			return true; // empty remaining rect

   381

		}

   382

	}

   383

	return false; // non-empty remaining rect

   384

}

   385

   386

bool StationRect::AfterRemoveRect(Station *st, TileIndex tile, int w, int h)

   387

{

   388

	assert(PtInExtendedRect(TileX(tile), TileY(tile)));

   389

	assert(PtInExtendedRect(TileX(tile) + w - 1, TileY(tile) + h - 1));

   390

   391

	bool empty = AfterRemoveTile(st, tile);

   392

	if (w != 1 || h != 1) empty = empty || AfterRemoveTile(st, TILE_ADDXY(tile, w - 1, h - 1));

   393

	return empty;

   394

}

   395

   396

StationRect& StationRect::operator = (Rect src)

   397

{

   398

	left = src.left;

   399

	top = src.top;

   400

	right = src.right;

   401

	bottom = src.bottom;

   402

	return *this;

   403

}

   404

   405

   406

/************************************************************************/

   407

/*                     RoadStop implementation                          */

   408

/************************************************************************/

   409

   410

/** Allocates a new RoadStop onto the pool, or recycles an unsed one

   411

 *  @return a pointer to the new roadstop

   412

 */

   413

void *RoadStop::operator new(size_t size)

   414

{

   415

	RoadStop *rs = AllocateRaw();

   416

	return rs;

   417

}

   418

   419

/** Gets a RoadStop with a given index and allocates it when needed

   420

  * @return a pointer to the roadstop

   421

  */

   422

void *RoadStop::operator new(size_t size, int index)

   423

{

   424

	if (!AddBlockIfNeeded(&_RoadStop_pool, index)) {

   425

		error("RoadStops: failed loading savegame: too many RoadStops");

   426

	}

   427

   428

	RoadStop *rs = GetRoadStop(index);

   429

	return rs;

   430

}

   431

   432

void RoadStop::operator delete(void *p)

   433

{

   434

}

   435

   436

void RoadStop::operator delete(void *p, int index)

   437

{

   438

}

   439

   440

/** Initializes a RoadStop */

   441

RoadStop::RoadStop(TileIndex tile) :

   442

	xy(tile),

   443

	status(3), // stop is free

   444

	num_vehicles(0),

   445

	next(NULL)

   446

{

   447

	DEBUG(ms, cDebugCtorLevel,  "I+ at %d[0x%x]", tile, tile);

   448

}

   449

   450

/** De-Initializes a RoadStops. This includes clearing all slots that vehicles might

   451

  * have and unlinks it from the linked list of road stops at the given station

   452

  */

   453

RoadStop::~RoadStop()

   454

{

   455

	/* Clear the slot assignment of all vehicles heading for this road stop */

   456

	if (num_vehicles != 0) {

   457

		Vehicle *v;

   458

   459

		FOR_ALL_VEHICLES(v) {

   460

			if (v->type == VEH_ROAD && v->u.road.slot == this) ClearSlot(v);

   461

		}

   462

	}

   463

	assert(num_vehicles == 0);

   464

   465

	DEBUG(ms, cDebugCtorLevel , "I- at %d[0x%x]", xy, xy);

   466

   467

	xy = INVALID_TILE;

   468

}

   469

   470

   471

/** Low-level function for allocating a RoadStop on the pool */

   472

RoadStop *RoadStop::AllocateRaw()

   473

{

   474

	RoadStop *rs;

   475

   476

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

   477

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

   478

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

   479

		if (!rs->IsValid()) {

   480

			RoadStopID index = rs->index;

   481

   482

			memset(rs, 0, sizeof(*rs));

   483

			rs->index = index;

   484

   485

			return rs;

   486

		}

   487

	}

   488