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 "table/sprites.h"

    12

#include "table/strings.h"

    13

#include "functions.h"

    14

#include "landscape.h"

    15

#include "map.h"

    16

#include "tile.h"

    17

#include "vehicle.h"

    18

#include "timetable.h"

    19

#include "gfx.h"

    20

#include "viewport.h"

    21

#include "news.h"

    22

#include "command.h"

    23

#include "saveload.h"

    24

#include "player.h"

    25

#include "engine.h"

    26

#include "sound.h"

    27

#include "debug.h"

    28

#include "vehicle_gui.h"

    29

#include "depot.h"

    30

#include "station.h"

    31

#include "rail.h"

    32

#include "train.h"

    33

#include "aircraft.h"

    34

#include "industry_map.h"

    35

#include "station_map.h"

    36

#include "water_map.h"

    37

#include "network/network.h"

    38

#include "yapf/yapf.h"

    39

#include "date.h"

    40

#include "newgrf_callbacks.h"

    41

#include "newgrf_engine.h"

    42

#include "newgrf_sound.h"

    43

#include "helpers.hpp"

    44

#include "group.h"

    45

#include "economy.h"

    46

#include "strings.h"

    47

    48

#define INVALID_COORD (0x7fffffff)

    49

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

    50

    51

    52

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

    53

const uint32 _veh_build_proc_table[] = {

    54

	CMD_BUILD_RAIL_VEHICLE,

    55

	CMD_BUILD_ROAD_VEH,

    56

	CMD_BUILD_SHIP,

    57

	CMD_BUILD_AIRCRAFT,

    58

};

    59

const uint32 _veh_sell_proc_table[] = {

    60

	CMD_SELL_RAIL_WAGON,

    61

	CMD_SELL_ROAD_VEH,

    62

	CMD_SELL_SHIP,

    63

	CMD_SELL_AIRCRAFT,

    64

};

    65

    66

const uint32 _veh_refit_proc_table[] = {

    67

	CMD_REFIT_RAIL_VEHICLE,

    68

	CMD_REFIT_ROAD_VEH,

    69

	CMD_REFIT_SHIP,

    70

	CMD_REFIT_AIRCRAFT,

    71

};

    72

    73

const uint32 _send_to_depot_proc_table[] = {

    74

	CMD_SEND_TRAIN_TO_DEPOT,

    75

	CMD_SEND_ROADVEH_TO_DEPOT,

    76

	CMD_SEND_SHIP_TO_DEPOT,

    77

	CMD_SEND_AIRCRAFT_TO_HANGAR,

    78

};

    79

    80

    81

/* Initialize the vehicle-pool */

    82

DEFINE_OLD_POOL_GENERIC(Vehicle, Vehicle)

    83

    84

void VehicleServiceInDepot(Vehicle *v)

    85

{

    86

	v->date_of_last_service = _date;

    87

	v->breakdowns_since_last_service = 0;

    88

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

    89

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

    90

}

    91

    92

bool VehicleNeedsService(const Vehicle *v)

    93

{

    94

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

    95

	if (v->current_order.type != OT_GOTO_DEPOT || !(v->current_order.flags & OF_PART_OF_ORDERS)) { // Don't interfere with a depot visit by the order list

    96

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

    97

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

    98

		if (v->current_order.type == OT_GOTO_DEPOT && v->current_order.flags & OF_HALT_IN_DEPOT) return false;

    99

	}

   100

   101

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

   102

		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 */

   103

	}

   104

   105

	return _patches.servint_ispercent ?

   106

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

   107

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

   108

}

   109

   110

StringID VehicleInTheWayErrMsg(const Vehicle* v)

   111

{

   112

	switch (v->type) {

   113

		case VEH_TRAIN:    return STR_8803_TRAIN_IN_THE_WAY;

   114

		case VEH_ROAD:     return STR_9000_ROAD_VEHICLE_IN_THE_WAY;

   115

		case VEH_AIRCRAFT: return STR_A015_AIRCRAFT_IN_THE_WAY;

   116

		default:           return STR_980E_SHIP_IN_THE_WAY;

   117

	}

   118

}

   119

   120

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

   121

{

   122

	const TileInfo *ti = (const TileInfo*)data;

   123

   124

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

   125

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

   126

   127

	_error_message = VehicleInTheWayErrMsg(v);

   128

	return v;

   129

}

   130

   131

   132

bool EnsureNoVehicleOnGround(TileIndex tile)

   133

{

   134

	TileInfo ti;

   135

   136

	ti.tile = tile;

   137

	ti.z = GetTileMaxZ(tile);

   138

	return VehicleFromPos(tile, &ti, EnsureNoVehicleProcZ) == NULL;

   139

}

   140

   141

Vehicle *FindVehicleOnTileZ(TileIndex tile, byte z)

   142

{

   143

	TileInfo ti;

   144

   145

	ti.tile = tile;

   146

	ti.z = z;

   147

   148

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

   149

}

   150

   151

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

   152

{

   153

	int x1 = TileX(from);

   154

	int y1 = TileY(from);

   155

	int x2 = TileX(to);

   156

	int y2 = TileY(to);

   157

	Vehicle *veh;

   158

   159

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

   160

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

   161

		Swap(x1, x2);

   162

		Swap(y1, y2);

   163

	}

   164

	FOR_ALL_VEHICLES(veh) {

   165

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

   166

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

   167

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

   168

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

   169

				return veh;

   170

			}

   171

		}

   172

	}

   173

	return NULL;

   174

}

   175

   176

   177

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

   178

   179

void VehiclePositionChanged(Vehicle *v)

   180

{

   181

	int img = v->cur_image;

   182

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

   183

	const Sprite* spr = GetSprite(img);

   184

   185

	pt.x += spr->x_offs;

   186

	pt.y += spr->y_offs;

   187

   188

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

   189

   190

	v->left_coord = pt.x;

   191

	v->top_coord = pt.y;

   192

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

   193

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

   194

}

   195

   196

/** Called after load to update coordinates */

   197

void AfterLoadVehicles()

   198

{

   199

	Vehicle *v;

   200

   201

	FOR_ALL_VEHICLES(v) {

   202

		/* Reinstate the previous pointer */

   203

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

   204

   205

		v->UpdateDeltaXY(v->direction);

   206

   207

		v->fill_percent_te_id = INVALID_TE_ID;

   208

		v->first = NULL;

   209

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

   210

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

   211

   212

		v->cargo.InvalidateCache();

   213

	}

   214

   215

	FOR_ALL_VEHICLES(v) {

   216

		/* Fill the first pointers */

   217

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

   218

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

   219

				u->first = v;

   220

			}

   221

		}

   222

	}

   223

   224

	FOR_ALL_VEHICLES(v) {

   225

		assert(v->first != NULL);

   226

   227

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

   228

			TrainConsistChanged(v);

   229

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

   230

			RoadVehUpdateCache(v);

   231

		}

   232

	}

   233

   234

	FOR_ALL_VEHICLES(v) {

   235

		switch (v->type) {

   236

			case VEH_ROAD:

   238

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

   239

				/* FALL THROUGH */

   240

			case VEH_TRAIN:

   241

			case VEH_SHIP:

   242

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

   243

				break;

   244

   245

			case VEH_AIRCRAFT:

   246

				if (IsNormalAircraft(v)) {

   247

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

   248

   249

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

   250

					Vehicle *shadow = v->Next();

   251

					shadow->cur_image = v->cur_image;

   252

   253

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

   254

					if (v->subtype == AIR_HELICOPTER) {

   255

						Vehicle *rotor = shadow->Next();

   256

						rotor->cur_image = GetRotorImage(v);

   257

					}

   258

   259

					UpdateAircraftCache(v);

   260

				}

   261

				break;

   262

			default: break;

   263

		}

   264

   265

		v->left_coord = INVALID_COORD;

   266

		VehiclePositionChanged(v);

   267

	}

   268

}

   269

   270

Vehicle::Vehicle()

   271

{

   272

	this->type               = VEH_INVALID;

   273

	this->left_coord         = INVALID_COORD;

   274

	this->group_id           = DEFAULT_GROUP;

   275

	this->fill_percent_te_id = INVALID_TE_ID;

   276

	this->first              = this;

   278

}

   279

   280

/**

   281

 * Get a value for a vehicle's random_bits.

   282

 * @return A random value from 0 to 255.

   283

 */

   284

byte VehicleRandomBits()

   285

{

   286

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

   287

}

   288

   289

   290

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

   291

{

   292

	uint counter = _Vehicle_pool.first_free_index;

   293

   294

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

   295

		Vehicle *v = AllocateRaw(counter);

   296

   297

		if (v == NULL) return false;

   298

		v = new (v) InvalidVehicle();

   299

   300

		if (vl != NULL) {

   301

			vl[i] = v;

   302

		}

   303

		counter++;

   304

	}

   305

   306

	return true;

   307

}

   308

   309

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

   310

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

   311

const int HASH_BITS = 7;

   312

const int HASH_SIZE = 1 << HASH_BITS;

   313

const int HASH_MASK = HASH_SIZE - 1;

   314

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

   315

const int TOTAL_HASH_MASK = TOTAL_HASH_SIZE - 1;

   316

   317

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

   318

 * Profiling results show that 0 is fastest. */

   319

const int HASH_RES = 0;

   320

   321

static Vehicle *_new_vehicle_position_hash[TOTAL_HASH_SIZE];

   322

   323

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

   324

{

   325

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

   326

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

   327

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

   328

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

   329

				void *a = proc(v, data);

   330

				if (a != NULL) return a;

   331

			}

   332

			if (x == xu) break;

   333

		}

   334

		if (y == yu) break;

   335

	}

   336

   337

	return NULL;

   338

}

   339

   340

   341

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

   342

{

   343

	const int COLL_DIST = 6;

   344

   345

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

   346

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

   347

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

   348

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

   349

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

   350

   351

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

   352

}

   353

   354

   355

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

   356

{

   357

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

   358

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

   359

   360

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

   361

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

   362

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

   363

   364

		void *a = proc(v, data);

   365

		if (a != NULL) return a;

   366

	}

   367

   368

	return NULL;

   369

}

   370

   371

static void UpdateNewVehiclePosHash(Vehicle *v, bool remove)

   372

{

   373

	Vehicle **old_hash = v->old_new_hash;

   374

	Vehicle **new_hash;

   375

   376

	if (remove) {

   377

		new_hash = NULL;

   378

	} else {

   379

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

   380

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

   381

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

   382

	}

   383

   384

	if (old_hash == new_hash) return;

   385

   386

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

   387

	if (old_hash != NULL) {

   388

		Vehicle *last = NULL;

   389

		Vehicle *u = *old_hash;

   390

		while (u != v) {

   391

			last = u;

   392

			u = u->next_new_hash;

   393

			assert(u != NULL);

   394

		}

   395

   396

		if (last == NULL) {

   397

			*old_hash = v->next_new_hash;

   398

		} else {

   399

			last->next_new_hash = v->next_new_hash;

   400

		}

   401

	}

   402

   403

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

   404

	if (new_hash != NULL) {

   405

		v->next_new_hash = *new_hash;

   406

		*new_hash = v;

   407

		assert(v != v->next_new_hash);

   408

	}

   409

   410

	/* Remember current hash position */

   411

	v->old_new_hash = new_hash;

   412

}

   413

   414

static Vehicle *_vehicle_position_hash[0x1000];

   415

   416

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

   417

{

   418

	UpdateNewVehiclePosHash(v, x == INVALID_COORD);

   419

   420

	Vehicle **old_hash, **new_hash;

   421

	int old_x = v->left_coord;

   422

	int old_y = v->top_coord;

   423

   424

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

   425

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

   426

   427

	if (old_hash == new_hash) return;

   428

   429

	/* remove from hash table? */

   430

	if (old_hash != NULL) {

   431

		Vehicle *last = NULL;

   432

		Vehicle *u = *old_hash;

   433

		while (u != v) {

   434

			last = u;

   435

			u = u->next_hash;

   436

			assert(u != NULL);

   437

		}

   438

   439

		if (last == NULL) {

   440

			*old_hash = v->next_hash;

   441

		} else {

   442

			last->next_hash = v->next_hash;

   443

		}

   444

	}

   445

   446

	/* insert into hash table? */

   447

	if (new_hash != NULL) {

   448

		v->next_hash = *new_hash;

   449

		*new_hash = v;

   450

	}

   451

}

   452

   453

void ResetVehiclePosHash()

   454

{

   455

	Vehicle *v;

   456

	FOR_ALL_VEHICLES(v) { v->old_new_hash = NULL; }

   457

	memset(_vehicle_position_hash, 0, sizeof(_vehicle_position_hash));

   458

	memset(_new_vehicle_position_hash, 0, sizeof(_new_vehicle_position_hash));

   459

}

   460

   467

void InitializeVehicles()

   468

{

   469

	_Vehicle_pool.CleanPool();

   470

	_Vehicle_pool.AddBlockToPool();

   471

   472

	ResetVehiclePosHash();

   473

}

   474

   475

Vehicle *GetLastVehicleInChain(Vehicle *v)

   476

{

   477

	while (v->Next() != NULL) v = v->Next();

   478

	return v;

   479

}

   480

   481

uint CountVehiclesInChain(const Vehicle* v)

   482

{

   483

	uint count = 0;

   484

	do count++; while ((v = v->Next()) != NULL);

   485

	return count;

   486

}

   487

   488

/** Check if a vehicle is counted in num_engines in each player struct

   489