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

    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 = Random();

    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

	* @param st Station to be deleted

    63

	*/

    64

Station::~Station()

    65

{

    66

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

    67

    68

	DeleteName(string_id);

    69

	MarkDirty();

    70

	RebuildStationLists();

    71

	InvalidateWindowClasses(WC_STATION_LIST);

    72

    73

	DeleteWindowById(WC_STATION_VIEW, index);

    74

    75

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

    76

	RemoveOrderFromAllVehicles(OT_GOTO_STATION, index);

    77

    78

	/* Subsidies need removal as well */

    79

	DeleteSubsidyWithStation(index);

    80

    81

	free(speclist);

    82

	xy = 0;

    83

}

    84

    85

void* Station::operator new(size_t size)

    86

{

    87

	Station *st = AllocateRaw();

    88

	return st;

    89

}

    90

    91

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

    92

{

    93

	if (!AddBlockIfNeeded(&_Station_pool, st_idx))

    94

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

    95

    96

	Station *st = GetStation(st_idx);

    97

	return st;

    98

}

    99

   100

void Station::operator delete(void *p)

   101

{

   102

}

   103

   104

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

   105

{

   106

}

   107

   108

void Station::MarkDirty() const

   109

{

   110

	if (sign.width_1 != 0) {

   111

		InvalidateWindowWidget(WC_STATION_VIEW, index, 1);

   112

   113

		MarkAllViewportsDirty(

   114

			sign.left - 6,

   115

			sign.top,

   116

			sign.left + (sign.width_1 << 2) + 12,

   117

			sign.top + 48);

   118

	}

   119

}

   120

   121

void Station::MarkTilesDirty() const

   122

{

   123

	TileIndex tile = train_tile;

   124

	int w, h;

   125

   126

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

   127

	if (tile == 0) return;

   128

   129

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

   130

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

   131

			if (TileBelongsToRailStation(tile)) {

   132

				MarkTileDirtyByTile(tile);

   133

			}

   134

			tile += TileDiffXY(1, 0);

   135

		}

   136

		tile += TileDiffXY(-w, 1);

   137

	}

   138

}

   139

   140

bool Station::TileBelongsToRailStation(TileIndex tile) const

   141

{

   142

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

   143

}

   144

   145

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

   146

{

   147

	Station *st = NULL;

   148

   149

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

   150

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

   151

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

   152

		if (!IsValidStation(st)) {

   153

			StationID index = st->index;

   154

   155

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

   156

			st->index = index;

   157

			return st;

   158

		}

   159

	}

   160

   161

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

   162

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

   163

   164

	_error_message = STR_3008_TOO_MANY_STATIONS_LOADING;

   165

	return NULL;

   166

}

   167

   168

   169

   170

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

   171

/*                     StationRect implementation                       */

   172

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

   173

   174

StationRect::StationRect()

   175

{

   176

	MakeEmpty();

   177

}

   178

   179

void StationRect::MakeEmpty()

   180

{

   181

	left = top = right = bottom = 0;

   182

}

   183

   184

bool StationRect::PtInRectXY(int x, int y) const

   185

{

   186

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

   187

}

   188

   189

bool StationRect::IsEmpty() const

   190

{

   191

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

   192

}

   193

   194

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

   195

{

   196

	int x = TileX(tile);

   197

	int y = TileY(tile);

   198

	if (IsEmpty()) {

   199

		/* we are adding the first station tile */

   200

		left = right = x;

   201

		top = bottom = y;

   202

   203

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

   204

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

   205

		/* make new spread-out rectangle */

   206

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

   207

   208

		/* check new rect dimensions against preset max */

   209

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

   210

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

   211

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

   212

			assert(mode != ADD_TRY);

   213

			_error_message = STR_306C_STATION_TOO_SPREAD_OUT;

   214

			return false;

   215

		}

   216

   217

		/* spread-out ok, return true */

   218

		if (mode != ADD_TEST) {

   219

			/* we should update the station rect */

   220

			*this = new_rect;

   221

		}

   222

	} else {

   223

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

   224

	}

   225

	return true;

   226

}

   227

   228

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

   229

{

   230

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

   231

}

   232

   233

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

   234

{

   235

	TileIndex top_left = TileXY(left_a, top_a);

   236

	int width = right_a - left_a + 1;

   237

	int height = bottom_a - top_a + 1;

   238

   239

	BEGIN_TILE_LOOP(tile, width, height, top_left)

   240

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

   241

	END_TILE_LOOP(tile, width, height, top_left);

   242

   243

	return false;

   244

}

   245

   246

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

   247

{

   248

	int x = TileX(tile);

   249

	int y = TileY(tile);

   250

   251

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

   252

	 * and try to reduce the rect by this edge

   253

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

   254

	for (;;) {

   255

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

   256

		bool left_edge = (x == left);

   257

		bool right_edge = (x == right);

   258

		bool top_edge = (y == top);

   259

		bool bottom_edge = (y == bottom);

   260

   261

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

   262

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

   263

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

   264

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

   265

   266

		if (reduce_x) {

   267

			/* reduce horizontally */

   268

			if (left_edge) {

   269

				/* move left edge right */

   270

				left = x = x + 1;

   271

			} else {

   272

				/* move right edge left */

   273

				right = x = x - 1;

   274

			}

   275

		}

   276

		if (reduce_y) {

   277

			/* reduce vertically */

   278

			if (top_edge) {

   279

				/* move top edge down */

   280

				top = y = y + 1;

   281

			} else {

   282

				/* move bottom edge up */

   283

				bottom = y = y - 1;

   284

			}

   285

		}

   286

   287

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

   288

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

   289

			MakeEmpty();

   290

			return true; // empty remaining rect

   291

		}

   292

	}

   293

	return false; // non-empty remaining rect

   294

}

   295

   296

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

   297

{

   298

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

   299

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

   300

   301

	bool empty = AfterRemoveTile(st, tile);

   302

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

   303

	return empty;

   304

}

   305

   306

StationRect& StationRect::operator = (Rect src)

   307

{

   308

	left = src.left;

   309

	top = src.top;

   310

	right = src.right;

   311

	bottom = src.bottom;

   312

	return *this;

   313

}

   314

   315

   316

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

   317

/*                     RoadStop implementation                          */

   318

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

   319

   320

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

   321

 *  @return a pointer to the new roadstop

   322

 */

   323

void *RoadStop::operator new(size_t size)

   324

{

   325

	RoadStop *rs = AllocateRaw();

   326

	return rs;

   327

}

   328

   329

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

   330

  * @return a pointer to the roadstop

   331

  */

   332

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

   333

{

   334

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

   335

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

   336

	}

   337

   338

	RoadStop *rs = GetRoadStop(index);

   339

	return rs;

   340

}

   341

   342

void RoadStop::operator delete(void *p)

   343

{

   344

}

   345

   346

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

   347

{

   348

}

   349

   350

/** Initializes a RoadStop */

   351

RoadStop::RoadStop(TileIndex tile) :

   352

	xy(tile),

   353

	status(3), // stop is free

   354

	num_vehicles(0),

   355

	next(NULL),

   356

	prev(NULL)

   357

{

   358

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

   359

}

   360

   361

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

   362

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

   363

  */

   364

RoadStop::~RoadStop()

   365

{

   366

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

   367

	if (num_vehicles != 0) {

   368

		Vehicle *v;

   369

   370

		FOR_ALL_VEHICLES(v) {

   371

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

   372

		}

   373

	}

   374

	assert(num_vehicles == 0);

   375

   376

	if (prev != NULL) prev->next = next;

   377

	if (next != NULL) next->prev = prev;

   378

   379

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

   380

   381

	xy = INVALID_TILE;

   382

}

   383

   384

   385

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

   386

RoadStop *RoadStop::AllocateRaw( void )

   387

{

   388

	RoadStop *rs;

   389

   390

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

   391

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

   392

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

   393

		if (!IsValidRoadStop(rs)) {

   394

			RoadStopID index = rs->index;

   395

   396

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

   397

			rs->index = index;

   398

   399

			return rs;

   400

		}

   401

	}

   402

   403

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

   404

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

   405

   406

	return NULL;

   407

}