1

/* $Id$ */

     2

     3

/** @file vehicle.cpp Base implementations of all vehicles. */

     4

     5

#include "stdafx.h"

     6

#include "openttd.h"

     7

#include "road_map.h"

     8

#include "roadveh.h"

     9

#include "ship.h"

    10

#include "spritecache.h"

    11

#include "tile_cmd.h"

    12

#include "landscape.h"

    13

#include "timetable.h"

    14

#include "viewport_func.h"

    15

#include "gfx_func.h"

    16

#include "news_func.h"

    17

#include "command_func.h"

    18

#include "saveload.h"

    19

#include "player_func.h"

    20

#include "debug.h"

    21

#include "vehicle_gui.h"

    22

#include "rail_type.h"

    23

#include "train.h"

    24

#include "aircraft.h"

    25

#include "industry_map.h"

    26

#include "station_map.h"

    27

#include "water_map.h"

    28

#include "yapf/yapf.h"

    29

#include "newgrf_callbacks.h"

    30

#include "newgrf_engine.h"

    31

#include "newgrf_sound.h"

    32

#include "newgrf_station.h"

    33

#include "newgrf_text.h"

    34

#include "group.h"

    35

#include "order_func.h"

    36

#include "strings_func.h"

    37

#include "zoom_func.h"

    38

#include "functions.h"

    39

#include "date_func.h"

    40

#include "window_func.h"

    41

#include "vehicle_func.h"

    42

#include "signal_func.h"

    43

#include "sound_func.h"

    44

#include "variables.h"

    45

#include "autoreplace_func.h"

    46

#include "autoreplace_gui.h"

    47

#include "string_func.h"

    48

#include "settings_type.h"

    49

#include "oldpool_func.h"

    50

#include "depot_map.h"

    51

#include "animated_tile_func.h"

    52

#include "effectvehicle_base.h"

    53

#include "core/alloc_func.hpp"

    54

#include "vehiclelist.h"

    55

    56

#include "table/sprites.h"

    57

#include "table/strings.h"

    58

    59

#define INVALID_COORD (0x7fffffff)

    60

#define GEN_HASH(x, y) ((GB((y), 6, 6) << 6) + GB((x), 7, 6))

    61

    62

VehicleID _vehicle_id_ctr_day;

    63

const Vehicle *_place_clicked_vehicle;

    64

VehicleID _new_vehicle_id;

    65

uint16 _returned_refit_capacity;

    66

    67

    68

/* Tables used in vehicle.h to find the right command for a certain vehicle type */

    69

const uint32 _veh_build_proc_table[] = {

    70

	CMD_BUILD_RAIL_VEHICLE,

    71

	CMD_BUILD_ROAD_VEH,

    72

	CMD_BUILD_SHIP,

    73

	CMD_BUILD_AIRCRAFT,

    74

};

    75

const uint32 _veh_sell_proc_table[] = {

    76

	CMD_SELL_RAIL_WAGON,

    77

	CMD_SELL_ROAD_VEH,

    78

	CMD_SELL_SHIP,

    79

	CMD_SELL_AIRCRAFT,

    80

};

    81

    82

const uint32 _veh_refit_proc_table[] = {

    83

	CMD_REFIT_RAIL_VEHICLE,

    84

	CMD_REFIT_ROAD_VEH,

    85

	CMD_REFIT_SHIP,

    86

	CMD_REFIT_AIRCRAFT,

    87

};

    88

    89

const uint32 _send_to_depot_proc_table[] = {

    90

	CMD_SEND_TRAIN_TO_DEPOT,

    91

	CMD_SEND_ROADVEH_TO_DEPOT,

    92

	CMD_SEND_SHIP_TO_DEPOT,

    93

	CMD_SEND_AIRCRAFT_TO_HANGAR,

    94

};

    95

    96

    97

/* Initialize the vehicle-pool */

    98

DEFINE_OLD_POOL_GENERIC(Vehicle, Vehicle)

    99

   100

/** Function to tell if a vehicle needs to be autorenewed

   101

 * @param *p The vehicle owner

   102

 * @return true if the vehicle is old enough for replacement

   103

 */

   104

bool Vehicle::NeedsAutorenewing(const Player *p) const

   105

{

   106

	/* We can always generate the Player pointer when we have the vehicle.

   107

	 * However this takes time and since the Player pointer is often present

   108

	 * when this function is called then it's faster to pass the pointer as an

   109

	 * argument rather than finding it again. */

   110

	assert(p == GetPlayer(this->owner));

   111

   112

	if (!p->engine_renew) return false;

   113

	if (this->age - this->max_age < (p->engine_renew_months * 30)) return false;

   114

	if (this->age == 0) return false; // rail cars don't age and lacks a max age

   115

   116

	return true;

   117

}

   118

   119

void VehicleServiceInDepot(Vehicle *v)

   120

{

   121

	v->date_of_last_service = _date;

   122

	v->breakdowns_since_last_service = 0;

   123

	v->reliability = GetEngine(v->engine_type)->reliability;

   124

	InvalidateWindow(WC_VEHICLE_DETAILS, v->index); // ensure that last service date and reliability are updated

   125

}

   126

   127

bool Vehicle::NeedsServicing() const

   128

{

   129

	if (this->vehstatus & (VS_STOPPED | VS_CRASHED)) return false;

   130

   131

	if (_settings_game.order.no_servicing_if_no_breakdowns && _settings_game.difficulty.vehicle_breakdowns == 0) {

   132

		/* Vehicles set for autoreplacing needs to go to a depot even if breakdowns are turned off.

   133

		 * Note: If servicing is enabled, we postpone replacement till next service. */

   134

		return EngineHasReplacementForPlayer(GetPlayer(this->owner), this->engine_type, this->group_id);

   135

	}

   136

   137

	return _settings_game.vehicle.servint_ispercent ?

   138

		(this->reliability < GetEngine(this->engine_type)->reliability * (100 - this->service_interval) / 100) :

   139

		(this->date_of_last_service + this->service_interval < _date);

   140

}

   141

   142

bool Vehicle::NeedsAutomaticServicing() const

   143

{

   144

	if (_settings_game.order.gotodepot && VehicleHasDepotOrders(this)) return false;

   145

	if (this->current_order.IsType(OT_LOADING))            return false;

   146

	if (this->current_order.IsType(OT_GOTO_DEPOT) && this->current_order.GetDepotOrderType() != ODTFB_SERVICE) return false;

   147

	return NeedsServicing();

   148

}

   149

   150

StringID VehicleInTheWayErrMsg(const Vehicle* v)

   151

{

   152

	switch (v->type) {

   153

		case VEH_TRAIN:    return STR_8803_TRAIN_IN_THE_WAY;

   154

		case VEH_ROAD:     return STR_9000_ROAD_VEHICLE_IN_THE_WAY;

   155

		case VEH_AIRCRAFT: return STR_A015_AIRCRAFT_IN_THE_WAY;

   156

		default:           return STR_980E_SHIP_IN_THE_WAY;

   157

	}

   158

}

   159

   160

static Vehicle *EnsureNoVehicleProcZ(Vehicle *v, void *data)

   161

{

   162

	byte z = *(byte*)data;

   163

   164

	if (v->type == VEH_DISASTER || (v->type == VEH_AIRCRAFT && v->subtype == AIR_SHADOW)) return NULL;

   165

	if (v->z_pos > z) return NULL;

   166

   167

	_error_message = VehicleInTheWayErrMsg(v);

   168

	return v;

   169

}

   170

   171

bool EnsureNoVehicleOnGround(TileIndex tile)

   172

{

   173

	byte z = GetTileMaxZ(tile);

   174

	return !HasVehicleOnPos(tile, &z, &EnsureNoVehicleProcZ);

   175

}

   176

   177

/** Procedure called for every vehicle found in tunnel/bridge in the hash map */

   178

static Vehicle *GetVehicleTunnelBridgeProc(Vehicle *v, void *data)

   179

{

   180

	if (v->type != VEH_TRAIN && v->type != VEH_ROAD && v->type != VEH_SHIP) return NULL;

   181

	if (v == (const Vehicle *)data) return NULL;

   182

   183

	_error_message = VehicleInTheWayErrMsg(v);

   184

	return v;

   185

}

   186

   187

/**

   188

 * Finds vehicle in tunnel / bridge

   189

 * @param tile first end

   190

 * @param endtile second end

   191

 * @param ignore Ignore this vehicle when searching

   192

 * @return true if the bridge has a vehicle

   193

 */

   194

bool HasVehicleOnTunnelBridge(TileIndex tile, TileIndex endtile, const Vehicle *ignore)

   195

{

   196

	return HasVehicleOnPos(tile, (void *)ignore, &GetVehicleTunnelBridgeProc) ||

   197

			HasVehicleOnPos(endtile, (void *)ignore, &GetVehicleTunnelBridgeProc);

   198

}

   199

   200

   201

static void UpdateVehiclePosHash(Vehicle *v, int x, int y);

   202

   203

void VehiclePositionChanged(Vehicle *v)

   204

{

   205

	int img = v->cur_image;

   206

	Point pt = RemapCoords(v->x_pos + v->x_offs, v->y_pos + v->y_offs, v->z_pos);

   207

	const Sprite *spr = GetSprite(img, ST_NORMAL);

   208

   209

	pt.x += spr->x_offs;

   210

	pt.y += spr->y_offs;

   211

   212

	UpdateVehiclePosHash(v, pt.x, pt.y);

   213

   214

	v->left_coord = pt.x;

   215

	v->top_coord = pt.y;

   216

	v->right_coord = pt.x + spr->width + 2;

   217

	v->bottom_coord = pt.y + spr->height + 2;

   218

}

   219

   220

/** Called after load to update coordinates */

   221

void AfterLoadVehicles(bool clear_te_id)

   222

{

   223

	Vehicle *v;

   224

   225

	FOR_ALL_VEHICLES(v) {

   226

		/* Reinstate the previous pointer */

   227

		if (v->Next() != NULL) v->Next()->previous = v;

   228

		if (v->NextShared() != NULL) v->NextShared()->previous_shared = v;

   229

   230

		v->UpdateDeltaXY(v->direction);

   231

   232

		if (clear_te_id) v->fill_percent_te_id = INVALID_TE_ID;

   233

		v->first = NULL;

   234

		if (v->type == VEH_TRAIN) v->u.rail.first_engine = INVALID_ENGINE;

   235

		if (v->type == VEH_ROAD)  v->u.road.first_engine = INVALID_ENGINE;

   236

   237

		v->cargo.InvalidateCache();

   238

	}

   239

   240

	FOR_ALL_VEHICLES(v) {

   241

		/* Fill the first pointers */

   242

		if (v->Previous() == NULL) {

   243

			for (Vehicle *u = v; u != NULL; u = u->Next()) {

   244

				u->first = v;

   245

			}

   246

   247

			/* Shared orders are only valid for first vehicles in chains. */

   248

			if (v->previous_shared == NULL) {

   249

				for (Vehicle *u = v; u != NULL; u = u->NextShared()) {

   250

					u->first_shared = v;

   251

				}

   252

			}

   253

		}

   254

	}

   255

   256

	FOR_ALL_VEHICLES(v) {

   257

		assert(v->first != NULL);

   258

   259

		if (v->type == VEH_TRAIN && (IsFrontEngine(v) || IsFreeWagon(v))) {

   260

			if (IsFrontEngine(v)) v->u.rail.last_speed = v->cur_speed; // update displayed train speed

   261

			TrainConsistChanged(v, false);

   262

		} else if (v->type == VEH_ROAD && IsRoadVehFront(v)) {

   263

			RoadVehUpdateCache(v);

   264

		}

   265

	}

   266

   267

	FOR_ALL_VEHICLES(v) {

   268

		switch (v->type) {

   269

			case VEH_ROAD:

   270

				v->u.road.roadtype = HasBit(EngInfo(v->engine_type)->misc_flags, EF_ROAD_TRAM) ? ROADTYPE_TRAM : ROADTYPE_ROAD;

   271

				v->u.road.compatible_roadtypes = RoadTypeToRoadTypes(v->u.road.roadtype);

   272

				/* FALL THROUGH */

   273

			case VEH_TRAIN:

   274

			case VEH_SHIP:

   275

				v->cur_image = v->GetImage(v->direction);

   276

				break;

   277

   278

			case VEH_AIRCRAFT:

   279

				if (IsNormalAircraft(v)) {

   280

					v->cur_image = v->GetImage(v->direction);

   281

   282

					/* The plane's shadow will have the same image as the plane */

   283

					Vehicle *shadow = v->Next();

   284

					shadow->cur_image = v->cur_image;

   285

   286

					/* In the case of a helicopter we will update the rotor sprites */

   287

					if (v->subtype == AIR_HELICOPTER) {

   288

						Vehicle *rotor = shadow->Next();

   289

						rotor->cur_image = GetRotorImage(v);

   290

					}

   291

   292

					UpdateAircraftCache(v);

   293

				}

   294

				break;

   295

			default: break;

   296

		}

   297

   298

		v->left_coord = INVALID_COORD;

   299

		VehiclePositionChanged(v);

   300

	}

   301

}

   302

   303

Vehicle::Vehicle()

   304

{

   305

	this->type               = VEH_INVALID;

   306

	this->left_coord         = INVALID_COORD;

   307

	this->group_id           = DEFAULT_GROUP;

   308

	this->fill_percent_te_id = INVALID_TE_ID;

   309

	this->first              = this;

   310

	this->first_shared       = this;

   311

	this->colormap           = PAL_NONE;

   312

}

   313

   314

/**

   315

 * Get a value for a vehicle's random_bits.

   316

 * @return A random value from 0 to 255.

   317

 */

   318

byte VehicleRandomBits()

   319

{

   320

	return GB(Random(), 0, 8);

   321

}

   322

   323

   324

/* static */ bool Vehicle::AllocateList(Vehicle **vl, int num)

   325

{

   326

	uint counter = _Vehicle_pool.first_free_index;

   327

   328

	for (int i = 0; i != num; i++) {

   329

		Vehicle *v = AllocateRaw(counter);

   330

   331

		if (v == NULL) return false;

   332

		v = new (v) InvalidVehicle();

   333

   334

		if (vl != NULL) {

   335

			vl[i] = v;

   336

		}

   337

		counter++;

   338

	}

   339

   340

	return true;

   341

}

   342

   343

/* Size of the hash, 6 = 64 x 64, 7 = 128 x 128. Larger sizes will (in theory) reduce hash

   344

 * lookup times at the expense of memory usage. */

   345

const int HASH_BITS = 7;

   346

const int HASH_SIZE = 1 << HASH_BITS;

   347

const int HASH_MASK = HASH_SIZE - 1;

   348

const int TOTAL_HASH_SIZE = 1 << (HASH_BITS * 2);

   349

const int TOTAL_HASH_MASK = TOTAL_HASH_SIZE - 1;

   350

   351

/* Resolution of the hash, 0 = 1*1 tile, 1 = 2*2 tiles, 2 = 4*4 tiles, etc.

   352

 * Profiling results show that 0 is fastest. */

   353

const int HASH_RES = 0;

   354

   355

static Vehicle *_new_vehicle_position_hash[TOTAL_HASH_SIZE];

   356

   357

static Vehicle *VehicleFromHash(int xl, int yl, int xu, int yu, void *data, VehicleFromPosProc *proc, bool find_first)

   358

{

   359

	for (int y = yl; ; y = (y + (1 << HASH_BITS)) & (HASH_MASK << HASH_BITS)) {

   360

		for (int x = xl; ; x = (x + 1) & HASH_MASK) {

   361

			Vehicle *v = _new_vehicle_position_hash[(x + y) & TOTAL_HASH_MASK];

   362

			for (; v != NULL; v = v->next_new_hash) {

   363

				Vehicle *a = proc(v, data);

   364

				if (find_first && a != NULL) return a;

   365

			}

   366

			if (x == xu) break;

   367

		}

   368

		if (y == yu) break;

   369

	}

   370

   371

	return NULL;

   372

}

   373

   374

   375

/**

   376

 * Helper function for FindVehicleOnPos/HasVehicleOnPos.

   377

 * @note Do not call this function directly!

   378

 * @param x    The X location on the map

   379

 * @param y    The Y location on the map

   380

 * @param data Arbitrary data passed to proc

   381

 * @param proc The proc that determines whether a vehicle will be "found".

   382

 * @param find_first Whether to return on the first found or iterate over

   383

 *                   all vehicles

   384

 * @return the best matching or first vehicle (depending on find_first).

   385

 */

   386

static Vehicle *VehicleFromPosXY(int x, int y, void *data, VehicleFromPosProc *proc, bool find_first)

   387

{

   388

	const int COLL_DIST = 6;

   389

   390

	/* Hash area to scan is from xl,yl to xu,yu */

   391

	int xl = GB((x - COLL_DIST) / TILE_SIZE, HASH_RES, HASH_BITS);

   392

	int xu = GB((x + COLL_DIST) / TILE_SIZE, HASH_RES, HASH_BITS);

   393

	int yl = GB((y - COLL_DIST) / TILE_SIZE, HASH_RES, HASH_BITS) << HASH_BITS;

   394

	int yu = GB((y + COLL_DIST) / TILE_SIZE, HASH_RES, HASH_BITS) << HASH_BITS;

   395

   396

	return VehicleFromHash(xl, yl, xu, yu, data, proc, find_first);

   397

}

   398

   399

/**

   400

 * Find a vehicle from a specific location. It will call proc for ALL vehicles

   401

 * on the tile and YOU must make SURE that the "best one" is stored in the

   402

 * data value and is ALWAYS the same regardless of the order of the vehicles

   403

 * where proc was called on!

   404

 * When you fail to do this properly you create an almost untraceable DESYNC!

   405

 * @note The return value of proc will be ignored.

   406

 * @note Use this when you have the intention that all vehicles

   407

 *       should be iterated over.

   408

 * @param x    The X location on the map

   409

 * @param y    The Y location on the map

   410

 * @param data Arbitrary data passed to proc

   411

 * @param proc The proc that determines whether a vehicle will be "found".

   412

 */

   413

void FindVehicleOnPosXY(int x, int y, void *data, VehicleFromPosProc *proc)

   414

{

   415

	VehicleFromPosXY(x, y, data, proc, false);

   416

}

   417

   418

/**

   419

 * Checks whether a vehicle in on a specific location. It will call proc for

   420

 * vehicles until it returns non-NULL.

   421

 * @note Use FindVehicleOnPosXY when you have the intention that all vehicles

   422

 *       should be iterated over.

   423

 * @param x    The X location on the map

   424

 * @param y    The Y location on the map

   425

 * @param data Arbitrary data passed to proc

   426

 * @param proc The proc that determines whether a vehicle will be "found".

   427

 * @return True if proc returned non-NULL.

   428

 */

   429

bool HasVehicleOnPosXY(int x, int y, void *data, VehicleFromPosProc *proc)

   430

{

   431

	return VehicleFromPosXY(x, y, data, proc, true) != NULL;

   432

}

   433

   434

/**

   435

 * Helper function for FindVehicleOnPos/HasVehicleOnPos.

   436

 * @note Do not call this function directly!

   437

 * @param tile The location on the map

   438

 * @param data Arbitrary data passed to proc

   439

 * @param proc The proc that determines whether a vehicle will be "found".

   440

 * @param find_first Whether to return on the first found or iterate over

   441

 *                   all vehicles

   442

 * @return the best matching or first vehicle (depending on find_first).

   443

 */

   444

static Vehicle *VehicleFromPos(TileIndex tile, void *data, VehicleFromPosProc *proc, bool find_first)

   445

{

   446

	int x = GB(TileX(tile), HASH_RES, HASH_BITS);

   447

	int y = GB(TileY(tile), HASH_RES, HASH_BITS) << HASH_BITS;

   448

   449

	Vehicle *v = _new_vehicle_position_hash[(x + y) & TOTAL_HASH_MASK];

   450

	for (; v != NULL; v = v->next_new_hash) {

   451

		if (v->tile != tile) continue;

   452

   453

		Vehicle *a = proc(v, data);

   454

		if (find_first && a != NULL) return a;

   455

	}

   456

   457

	return NULL;

   458

}

   459

   460

/**

   461

 * Find a vehicle from a specific location. It will call proc for ALL vehicles

   462

 * on the tile and YOU must make SURE that the "best one" is stored in the

   463

 * data value and is ALWAYS the same regardless of the order of the vehicles

   464

 * where proc was called on!

   465

 * When you fail to do this properly you create an almost untraceable DESYNC!

   466

 * @note The return value of proc will be ignored.

   467

 * @note Use this when you have the intention that all vehicles

   468

 *       should be iterated over.

   469

 * @param tile The location on the map

   470

 * @param data Arbitrary data passed to proc

   471

 * @param proc The proc that determines whether a vehicle will be "found".

   472

 */

   473

void FindVehicleOnPos(TileIndex tile, void *data, VehicleFromPosProc *proc)

   474

{

   475

	VehicleFromPos(tile, data, proc, false);

   476

}

   477

   478

/**

   479

 * Checks whether a vehicle in on a specific location. It will call proc for

   480

 * vehicles until it returns non-NULL.

   481

 * @note Use FindVehicleOnPos when you have the intention that all vehicles

   482

 *       should be iterated over.

   483

 * @param tile The location on the map

   484

 * @param data Arbitrary data passed to proc

   485

 * @param proc The proc that determines whether a vehicle will be "found".

   486

 * @return True if proc returned non-NULL.