1

/* $Id$ */

     2

     3

/** @file station_cmd.c */

     4

     5

#include "stdafx.h"

     6

#include "openttd.h"

     7

#include "debug.h"

     8

#include "functions.h"

     9

#include "station_map.h"

    10

#include "table/sprites.h"

    11

#include "table/strings.h"

    12

#include "map.h"

    13

#include "tile.h"

    14

#include "station.h"

    15

#include "gfx.h"

    16

#include "window.h"

    17

#include "viewport.h"

    18

#include "command.h"

    19

#include "town.h"

    20

#include "vehicle.h"

    21

#include "news.h"

    22

#include "saveload.h"

    23

#include "economy.h"

    24

#include "player.h"

    25

#include "airport.h"

    26

#include "sprite.h"

    27

#include "depot.h"

    28

#include "train.h"

    29

#include "water_map.h"

    30

#include "industry_map.h"

    31

#include "newgrf_callbacks.h"

    32

#include "newgrf_station.h"

    33

#include "yapf/yapf.h"

    34

#include "date.h"

    35

    36

/**

    37

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

    38

 */

    39

static void StationPoolNewBlock(uint start_item)

    40

{

    41

	Station *st;

    42

    43

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

    44

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

    45

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

    46

}

    47

    48

static void StationPoolCleanBlock(uint start_item, uint end_item)

    49

{

    50

	uint i;

    51

    52

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

    53

		Station *st = GetStation(i);

    54

		free(st->speclist);

    55

		st->speclist = NULL;

    56

	}

    57

}

    58

    59

/**

    60

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

    61

 */

    62

static void RoadStopPoolNewBlock(uint start_item)

    63

{

    64

	RoadStop *rs;

    65

    66

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

    67

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

    68

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

    69

}

    70

    71

DEFINE_POOL(Station, Station, StationPoolNewBlock, StationPoolCleanBlock)

    72

DEFINE_POOL(RoadStop, RoadStop, RoadStopPoolNewBlock, NULL)

    73

    74

    75

extern void UpdateAirplanesOnNewStation(Station *st);

    76

    77

static bool TileBelongsToRailStation(const Station *st, TileIndex tile)

    78

{

    79

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

    80

}

    81

    82

static void MarkStationTilesDirty(const Station *st)

    83

{

    84

	TileIndex tile = st->train_tile;

    85

	int w, h;

    86

    87

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

    88

	if (tile == 0) return;

    89

    90

	for (h = 0; h < st->trainst_h; h++) {

    91

		for (w = 0; w < st->trainst_w; w++) {

    92

			if (TileBelongsToRailStation(st, tile)) {

    93

				MarkTileDirtyByTile(tile);

    94

			}

    95

			tile += TileDiffXY(1, 0);

    96

		}

    97

		tile += TileDiffXY(-w, 1);

    98

	}

    99

}

   100

   101

static void MarkStationDirty(const Station* st)

   102

{

   103

	if (st->sign.width_1 != 0) {

   104

		InvalidateWindowWidget(WC_STATION_VIEW, st->index, 1);

   105

   106

		MarkAllViewportsDirty(

   107

			st->sign.left - 6,

   108

			st->sign.top,

   109

			st->sign.left + (st->sign.width_1 << 2) + 12,

   110

			st->sign.top + 48);

   111

	}

   112

}

   113

   114

static void InitializeRoadStop(RoadStop *road_stop, RoadStop *previous, TileIndex tile, StationID index)

   115

{

   116

	road_stop->xy = tile;

   117

	road_stop->used = true;

   118

	road_stop->status = 3; //stop is free

   119

	road_stop->next = NULL;

   120

	road_stop->prev = previous;

   121

	road_stop->station = index;

   122

	road_stop->num_vehicles = 0;

   123

}

   124

   125

RoadStop* GetPrimaryRoadStop(const Station* st, RoadStopType type)

   126

{

   127

	switch (type) {

   128

		case RS_BUS:   return st->bus_stops;

   129

		case RS_TRUCK: return st->truck_stops;

   130

		default: NOT_REACHED();

   131

	}

   132

   133

	return NULL;

   134

}

   135

   136

RoadStop* GetRoadStopByTile(TileIndex tile, RoadStopType type)

   137

{

   138

	const Station* st = GetStationByTile(tile);

   139

	RoadStop* rs;

   140

   141

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

   142

		assert(rs->next != NULL);

   143

	}

   144

   145

	return rs;

   146

}

   147

   148

uint GetNumRoadStopsInStation(const Station* st, RoadStopType type)

   149

{

   150

	uint num = 0;

   151

	const RoadStop *rs;

   152

   153

	assert(st != NULL);

   154

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

   155

   156

	return num;

   157

}

   158

   159

RoadStop *AllocateRoadStop(void)

   160

{

   161

	RoadStop *rs;

   162

   163

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

   164

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

   165

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

   166

		if (!IsValidRoadStop(rs)) {

   167

			RoadStopID index = rs->index;

   168

   169

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

   170

			rs->index = index;

   171

   172

			return rs;

   173

		}

   174

	}

   175

   176

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

   177

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

   178

   179

	return NULL;

   180

}

   181

   182

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

   183

 *  radius that is available within the station */

   184

static uint FindCatchmentRadius(const Station* st)

   185

{

   186

	uint ret = 0;

   187

   188

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

   189

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

   190

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

   191

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

   192

   193

	if (st->airport_tile) {

   194

		switch (st->airport_type) {

   195

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

   196

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

   197

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

   198

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

   199

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

   200

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

   201

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

   202

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

   203

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

   204

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

   205

		}

   206

	}

   207

   208

	return ret;

   209

}

   210

   211

#define CHECK_STATIONS_ERR ((Station*)-1)

   212

   213

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

   214

{

   215

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

   216

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

   217

		if (IsTileType(tile_cur, MP_STATION)) {

   218

			StationID t = GetStationIndex(tile_cur);

   219

			{

   220

				Station *st = GetStation(t);

   221

				// you cannot take control of an oilrig!!

   222

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

   223

					continue;

   224

			}

   225

   226

			if (closest_station == INVALID_STATION) {

   227

				closest_station = t;

   228

			} else if (closest_station != t) {

   229

				_error_message = STR_3006_ADJOINS_MORE_THAN_ONE_EXISTING;

   230

				return CHECK_STATIONS_ERR;

   231

			}

   232

		}

   233

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

   234

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

   235

}

   236

   237

   238

static bool CheckStationSpreadOut(Station *st, TileIndex tile, int w, int h)

   239

{

   240

	StationID station_index = st->index;

   241

	uint i;

   242

	uint x1 = TileX(tile);

   243

	uint y1 = TileY(tile);

   244

	uint x2 = x1 + w - 1;

   245

	uint y2 = y1 + h - 1;

   246

	uint t;

   247

   248

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

   249

		if (IsTileType(i, MP_STATION) && GetStationIndex(i) == station_index) {

   250

			t = TileX(i);

   251

			if (t < x1) x1 = t;

   252

			if (t > x2) x2 = t;

   253

   254

			t = TileY(i);

   255

			if (t < y1) y1 = t;

   256

			if (t > y2) y2 = t;

   257

		}

   258

	}

   259

   260

	if (y2 - y1 >= _patches.station_spread || x2 - x1 >= _patches.station_spread) {

   261

		_error_message = STR_306C_STATION_TOO_SPREAD_OUT;

   262

		return false;

   263

	}

   264

   265

	return true;

   266

}

   267

   268

static Station *AllocateStation(void)

   269

{

   270

	Station *st = NULL;

   271

   272

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

   273

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

   274

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

   275

		if (!IsValidStation(st)) {

   276

			StationID index = st->index;

   277

   278

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

   279

			st->index = index;

   280

   281

			return st;

   282

		}

   283

	}

   284

   285

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

   286

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

   287

   288

	_error_message = STR_3008_TOO_MANY_STATIONS_LOADING;

   289

	return NULL;

   290

}

   291

   292

   293

/**

   294

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

   295

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

   296

 * @param type the type of tile searched for

   297

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

   298

 *                 in all other cases this parameter is ignored

   299

 * @result the noumber of matching tiles around

   300

 */

   301

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

   302

{

   303

	TileIndex cur_tile;

   304

	int dx, dy;

   305

	int num = 0;

   306

   307

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

   308

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

   309

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

   310

   311

			if (IsTileType(cur_tile, type)) {

   312

				switch (type) {

   313

					case MP_INDUSTRY:

   314

						if (GetIndustryType(cur_tile) == industry)

   315

							num++;

   316

						break;

   317

   318

					case MP_WATER:

   319

						if (!IsWater(cur_tile))

   320

							break;

   321

						/* FALL THROUGH WHEN WATER TILE */

   322

					case MP_TREES:

   323

						num++;

   324

						break;

   325

   326

					default:

   327

						break;

   328

				}

   329

			}

   330

		}

   331

	}

   332

   333

	return num;

   334

}

   335

   336

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

   337

   338

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

   339

{

   340

	static const uint32 _gen_station_name_bits[] = {

   341

		0,                                      /* 0 */

   342

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

   343

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

   344

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

   345

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

   346

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

   347

	};

   348

   349

	Town *t = st->town;

   350

	uint32 free_names = (uint32)-1;

   351

	int found;

   352

	uint z,z2;

   353

	unsigned long tmp;

   354

   355

	{

   356

		Station *s;

   357

   358

		FOR_ALL_STATIONS(s) {

   359

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

   360

				uint str = M(s->string_id);

   361

				if (str <= 0x20) {

   362

					if (str == M(STR_SV_STNAME_FOREST))

   363

						str = M(STR_SV_STNAME_WOODS);

   364

					CLRBIT(free_names, str);

   365

				}

   366

			}

   367

		}

   368

	}

   369

   370

	/* check default names */

   371

	tmp = free_names & _gen_station_name_bits[flag];

   372

	if (tmp != 0) {

   373

		found = FindFirstBit(tmp);

   374

		goto done;

   375

	}

   376

   377

	/* check mine? */

   378

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

   379

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

   380

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

   381

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

   382

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

   383

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

   384

			found = M(STR_SV_STNAME_MINES);

   385

			goto done;

   386

		}

   387

	}

   388

   389

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

   390

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

   391

		found = M(STR_SV_STNAME);

   392

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

   393

   394

		found = M(STR_SV_STNAME_CENTRAL);

   395

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

   396

	}

   397

   398

	/* Check lakeside */

   399

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

   400

			DistanceFromEdge(tile) < 20 &&

   401

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

   402

		found = M(STR_SV_STNAME_LAKESIDE);

   403

		goto done;

   404

	}

   405

   406

	/* Check woods */

   407

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

   408

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

   409

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

   410

			) {

   411

		found = _opt.landscape == LT_DESERT ?

   412

			M(STR_SV_STNAME_FOREST) : M(STR_SV_STNAME_WOODS);

   413

		goto done;

   414

	}

   415

   416

	/* check elevation compared to town */

   417

	z = GetTileZ(tile);

   418

	z2 = GetTileZ(t->xy);

   419

	if (z < z2) {

   420

		found = M(STR_SV_STNAME_VALLEY);

   421

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

   422

	} else if (z > z2) {

   423

		found = M(STR_SV_STNAME_HEIGHTS);

   424

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

   425

	}

   426

   427

	/* check direction compared to town */

   428

	{

   429

		static const int8 _direction_and_table[] = {

   430

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

   431

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

   432

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

   433

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

   434

		};

   435

   436

		free_names &= _direction_and_table[

   437

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

   438

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

   439

	}

   440

   441

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

   442

	if (tmp == 0) {

   443

		_error_message = STR_3007_TOO_MANY_STATIONS_LOADING;

   444

		return false;

   445

	}

   446

	found = FindFirstBit(tmp);

   447

   448

done:

   449

	st->string_id = found + STR_SV_STNAME;

   450

	return true;

   451

}

   452

#undef M

   453

   454

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

   455

{

   456

	Station* best_station = NULL;

   457

	Station* st;

   458

   459

	FOR_ALL_STATIONS(st) {

   460

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

   461

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

   462

   463

			if (cur_dist < threshold) {

   464

				threshold = cur_dist;

   465

				best_station = st;

   466

			}

   467

		}

   468

	}

   469

   470

	return best_station;

   471

}

   472

   473

static void StationInitialize(Station *st, TileIndex tile)

   474

{

   475

	GoodsEntry *ge;

   476

   477

	st->xy = tile;

   478

	st->airport_tile = st->dock_tile = st->train_tile = 0;

   479

	st->bus_stops = st->truck_stops = NULL;

   480

	st->had_vehicle_of_type = 0;

   481

	st->time_since_load = 255;

   482

	st->time_since_unload = 255;

   483

	st->delete_ctr = 0;

   484

	st->facilities = 0;

   485

   486

	st->last_vehicle_type = VEH_Invalid;

   487

   488

	for (ge = st->goods; ge != endof(st->goods); ge++) {

   489

		ge->waiting_acceptance = 0;

   490

		ge->days_since_pickup = 0;

   491

		ge->enroute_from = INVALID_STATION;

   492

		ge->rating = 175;

   493

		ge->last_speed = 0;

   494

		ge->last_age = 0xFF;

   495

		ge->feeder_profit = 0;

   496

	}

   497