1

/* $Id$ */

     2

     3

/** @file vehicle.cpp */

     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 "depot.h"

    23

#include "rail_type.h"

    24

#include "train.h"

    25

#include "aircraft.h"

    26

#include "industry_map.h"

    27

#include "station_map.h"

    28

#include "water_map.h"

    29

#include "network/network.h"

    30

#include "yapf/yapf.h"

    31

#include "newgrf_callbacks.h"

    32

#include "newgrf_engine.h"

    33

#include "newgrf_sound.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

    51

#include "table/sprites.h"

    52

#include "table/strings.h"

    53

    54

#define INVALID_COORD (0x7fffffff)

    55

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

    56

    57

VehicleID _vehicle_id_ctr_day;

    58

Vehicle *_place_clicked_vehicle;

    59

VehicleID _new_vehicle_id;

    60

uint16 _returned_refit_capacity;

    61

    62

    63

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

    64

const uint32 _veh_build_proc_table[] = {

    65

	CMD_BUILD_RAIL_VEHICLE,

    66

	CMD_BUILD_ROAD_VEH,

    67

	CMD_BUILD_SHIP,

    68

	CMD_BUILD_AIRCRAFT,

    69

};

    70

const uint32 _veh_sell_proc_table[] = {

    71

	CMD_SELL_RAIL_WAGON,

    72

	CMD_SELL_ROAD_VEH,

    73

	CMD_SELL_SHIP,

    74

	CMD_SELL_AIRCRAFT,

    75

};

    76

    77

const uint32 _veh_refit_proc_table[] = {

    78

	CMD_REFIT_RAIL_VEHICLE,

    79

	CMD_REFIT_ROAD_VEH,

    80

	CMD_REFIT_SHIP,

    81

	CMD_REFIT_AIRCRAFT,

    82

};

    83

    84

const uint32 _send_to_depot_proc_table[] = {

    85

	CMD_SEND_TRAIN_TO_DEPOT,

    86

	CMD_SEND_ROADVEH_TO_DEPOT,

    87

	CMD_SEND_SHIP_TO_DEPOT,

    88

	CMD_SEND_AIRCRAFT_TO_HANGAR,

    89

};

    90

    91

    92

/* Initialize the vehicle-pool */

    93

DEFINE_OLD_POOL_GENERIC(Vehicle, Vehicle)

    94

    95

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

    96

 * @param *p The vehicle owner

    97

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

    98

 */

    99

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

   100

{

   101

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

   102

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

   103

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

   104

	 * argument rather than finding it again. */

   105

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

   106

   107

	if (!p->engine_renew) return false;

   108

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

   109

   110

	return true;

   111

}

   112

   113

void VehicleServiceInDepot(Vehicle *v)

   114

{

   115

	v->date_of_last_service = _date;

   116

	v->breakdowns_since_last_service = 0;

   117

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

   118

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

   119

}

   120

   121

bool VehicleNeedsService(const Vehicle *v)

   122

{

   123

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

   125

		if (_patches.gotodepot && VehicleHasDepotOrders(v)) return false;

   126

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

   128

	}

   129

   130

	if (_patches.no_servicing_if_no_breakdowns && _opt.diff.vehicle_breakdowns == 0) {

   131

		return EngineHasReplacementForPlayer(GetPlayer(v->owner), v->engine_type, v->group_id);  /* Vehicles set for autoreplacing needs to go to a depot even if breakdowns are turned off */

   132

	}

   133

   134

	return _patches.servint_ispercent ?

   135

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

   136

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

   137

}

   138

   139

StringID VehicleInTheWayErrMsg(const Vehicle* v)

   140

{

   141

	switch (v->type) {

   142

		case VEH_TRAIN:    return STR_8803_TRAIN_IN_THE_WAY;

   143

		case VEH_ROAD:     return STR_9000_ROAD_VEHICLE_IN_THE_WAY;

   144

		case VEH_AIRCRAFT: return STR_A015_AIRCRAFT_IN_THE_WAY;

   145

		default:           return STR_980E_SHIP_IN_THE_WAY;

   146

	}

   147

}

   148

   149

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

   150

{

   151

	byte z = *(byte*)data;

   152

   153

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

   154

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

   155

   156

	_error_message = VehicleInTheWayErrMsg(v);

   157

	return v;

   158

}

   159

   160

Vehicle *FindVehicleOnTileZ(TileIndex tile, byte z)

   161

{

   162

	return (Vehicle*)VehicleFromPos(tile, &z, &EnsureNoVehicleProcZ);

   163

}

   164

   165

bool EnsureNoVehicleOnGround(TileIndex tile)

   166

{

   167

	return FindVehicleOnTileZ(tile, GetTileMaxZ(tile)) == NULL;

   168

}

   169

   170

Vehicle *FindVehicleBetween(TileIndex from, TileIndex to, byte z, bool without_crashed)

   171

{

   172

	int x1 = TileX(from);

   173

	int y1 = TileY(from);

   174

	int x2 = TileX(to);

   175

	int y2 = TileY(to);

   176

	Vehicle *veh;

   177

   178

	/* Make sure x1 < x2 or y1 < y2 */

   179

	if (x1 > x2 || y1 > y2) {

   180

		Swap(x1, x2);

   181

		Swap(y1, y2);

   182

	}

   183

	FOR_ALL_VEHICLES(veh) {

   184

		if (without_crashed && (veh->vehstatus & VS_CRASHED) != 0) continue;

   185

		if ((veh->type == VEH_TRAIN || veh->type == VEH_ROAD) && (z == 0xFF || veh->z_pos == z)) {

   186

			if ((veh->x_pos >> 4) >= x1 && (veh->x_pos >> 4) <= x2 &&

   187

					(veh->y_pos >> 4) >= y1 && (veh->y_pos >> 4) <= y2) {

   188

				return veh;

   189

			}

   190

		}

   191

	}

   192

	return NULL;

   193

}

   194

   195

   196

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

   197

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

   198

{

   199

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

   200

   201

	_error_message = VehicleInTheWayErrMsg(v);

   202

	return v;

   203

}

   204

   205

/**

   206

 * Finds vehicle in tunnel / bridge

   207

 * @param tile first end

   208

 * @param endtile second end

   209

 * @return pointer to vehicle found

   210

 */

   211

Vehicle *GetVehicleTunnelBridge(TileIndex tile, TileIndex endtile)

   212

{

   213

	Vehicle *v = (Vehicle*)VehicleFromPos(tile, NULL, &GetVehicleTunnelBridgeProc);

   214

	if (v != NULL) return v;

   215

   216

	return (Vehicle*)VehicleFromPos(endtile, NULL, &GetVehicleTunnelBridgeProc);

   217

}

   218

   219

   220

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

   221

   222

void VehiclePositionChanged(Vehicle *v)

   223

{

   224

	int img = v->cur_image;

   225

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

   226

	const Sprite* spr = GetSprite(img);

   227

   228

	pt.x += spr->x_offs;

   229

	pt.y += spr->y_offs;

   230

   231

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

   232

   233

	v->left_coord = pt.x;

   234

	v->top_coord = pt.y;

   235

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

   236

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

   237

}

   238

   239

/** Called after load to update coordinates */

   240

void AfterLoadVehicles(bool clear_te_id)

   241

{

   242

	Vehicle *v;

   243

   244

	FOR_ALL_VEHICLES(v) {

   245

		/* Reinstate the previous pointer */

   246

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

   247

   248

		v->UpdateDeltaXY(v->direction);

   249

   250

		if (clear_te_id) v->fill_percent_te_id = INVALID_TE_ID;

   251

		v->first = NULL;

   252

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

   253

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

   254

   255

		v->cargo.InvalidateCache();

   256

	}

   257

   258

	FOR_ALL_VEHICLES(v) {

   259

		/* Fill the first pointers */

   260

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

   261

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

   262

				u->first = v;

   263

			}

   264

		}

   265

	}

   266

   267

	FOR_ALL_VEHICLES(v) {

   268

		assert(v->first != NULL);

   269

   270

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

   271

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

   272

			TrainConsistChanged(v);

   273

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

   274

			RoadVehUpdateCache(v);

   275

		}

   276

	}

   277

   278

	FOR_ALL_VEHICLES(v) {

   279

		switch (v->type) {

   280

			case VEH_ROAD:

   281

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

   282

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

   283

				/* FALL THROUGH */

   284

			case VEH_TRAIN:

   285

			case VEH_SHIP:

   286

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

   287

				break;

   288

   289

			case VEH_AIRCRAFT:

   290

				if (IsNormalAircraft(v)) {

   291

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

   292

   293

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

   294

					Vehicle *shadow = v->Next();

   295

					shadow->cur_image = v->cur_image;

   296

   297

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

   298

					if (v->subtype == AIR_HELICOPTER) {

   299

						Vehicle *rotor = shadow->Next();

   300

						rotor->cur_image = GetRotorImage(v);

   301

					}

   302

   303

					UpdateAircraftCache(v);

   304

				}

   305

				break;

   306

			default: break;

   307

		}

   308

   309

		v->left_coord = INVALID_COORD;

   310

		VehiclePositionChanged(v);

   311

	}

   312

}

   313

   314

Vehicle::Vehicle()

   315

{

   316

	this->type               = VEH_INVALID;

   317

	this->left_coord         = INVALID_COORD;

   318

	this->group_id           = DEFAULT_GROUP;

   319

	this->fill_percent_te_id = INVALID_TE_ID;

   320

	this->first              = this;

   321

	this->colormap           = PAL_NONE;

   322

}

   323

   324

/**

   325

 * Get a value for a vehicle's random_bits.

   326

 * @return A random value from 0 to 255.

   327

 */

   328

byte VehicleRandomBits()

   329

{

   330

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

   331

}

   332

   333

   334

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

   335

{

   336

	uint counter = _Vehicle_pool.first_free_index;

   337

   338

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

   339

		Vehicle *v = AllocateRaw(counter);

   340

   341

		if (v == NULL) return false;

   342

		v = new (v) InvalidVehicle();

   343

   344

		if (vl != NULL) {

   345

			vl[i] = v;

   346

		}

   347

		counter++;

   348

	}

   349

   350

	return true;

   351

}

   352

   353

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

   354

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

   355

const int HASH_BITS = 7;

   356

const int HASH_SIZE = 1 << HASH_BITS;

   357

const int HASH_MASK = HASH_SIZE - 1;

   358

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

   359

const int TOTAL_HASH_MASK = TOTAL_HASH_SIZE - 1;

   360

   361

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

   362

 * Profiling results show that 0 is fastest. */

   363

const int HASH_RES = 0;

   364

   365

static Vehicle *_new_vehicle_position_hash[TOTAL_HASH_SIZE];

   366

   367

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

   368

{

   369

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

   370

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

   371

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

   372

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

   373

				void *a = proc(v, data);

   374

				if (a != NULL) return a;

   375

			}

   376

			if (x == xu) break;

   377

		}

   378

		if (y == yu) break;

   379

	}

   380

   381

	return NULL;

   382

}

   383

   384

   385

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

   386

{

   387

	const int COLL_DIST = 6;

   388

   389

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

   390

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

   391

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

   392

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

   393

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

   394

   395

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

   396

}

   397

   398

   399

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

   400

{

   401

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

   402

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

   403

   404

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

   405

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

   406

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

   407

   408

		void *a = proc(v, data);

   409

		if (a != NULL) return a;

   410

	}

   411

   412

	return NULL;

   413

}

   414

   415

static void UpdateNewVehiclePosHash(Vehicle *v, bool remove)

   416

{

   417

	Vehicle **old_hash = v->old_new_hash;

   418

	Vehicle **new_hash;

   419

   420

	if (remove) {

   421

		new_hash = NULL;

   422

	} else {

   423

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

   424

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

   425

		new_hash = &_new_vehicle_position_hash[(x + y) & TOTAL_HASH_MASK];

   426

	}

   427

   428

	if (old_hash == new_hash) return;

   429

   430

	/* Remove from the old position in the hash table */

   431

	if (old_hash != NULL) {

   432

		Vehicle *last = NULL;

   433

		Vehicle *u = *old_hash;

   434

		while (u != v) {

   435

			last = u;

   436

			u = u->next_new_hash;

   437

			assert(u != NULL);

   438

		}

   439

   440

		if (last == NULL) {

   441

			*old_hash = v->next_new_hash;

   442

		} else {

   443

			last->next_new_hash = v->next_new_hash;

   444

		}

   445

	}

   446

   447

	/* Insert vehicle at beginning of the new position in the hash table */

   448

	if (new_hash != NULL) {

   449

		v->next_new_hash = *new_hash;

   450

		*new_hash = v;

   451

		assert(v != v->next_new_hash);

   452

	}

   453

   454

	/* Remember current hash position */

   455

	v->old_new_hash = new_hash;

   456

}

   457

   458

static Vehicle *_vehicle_position_hash[0x1000];

   459

   460

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

   461

{

   462

	UpdateNewVehiclePosHash(v, x == INVALID_COORD);

   463

   464

	Vehicle **old_hash, **new_hash;

   465

	int old_x = v->left_coord;

   466

	int old_y = v->top_coord;

   467

   468

	new_hash = (x == INVALID_COORD) ? NULL : &_vehicle_position_hash[GEN_HASH(x, y)];

   469

	old_hash = (old_x == INVALID_COORD) ? NULL : &_vehicle_position_hash[GEN_HASH(old_x, old_y)];

   470

   471

	if (old_hash == new_hash) return;

   472

   473

	/* remove from hash table? */

   474

	if (old_hash != NULL) {

   475

		Vehicle *last = NULL;

   476

		Vehicle *u = *old_hash;

   477

		while (u != v) {

   478

			last = u;

   479

			u = u->next_hash;

   480

			assert(u != NULL);

   481

		}

   482

   483

		if (last == NULL) {

   484

			*old_hash = v->next_hash;

   485

		} else {

   486

			last->next_hash = v->next_hash;

   487

		}