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"

    15

#include "map.h"

    16

#include "tile.h"

    17

#include "vehicle.h"

    18

#include "gfx.h"

    19

#include "viewport.h"

    20

#include "news.h"

    21

#include "command.h"

    22

#include "saveload.h"

    23

#include "player.h"

    24

#include "engine.h"

    25

#include "sound.h"

    26

#include "debug.h"

    27

#include "vehicle_gui.h"

    28

#include "depot.h"

    29

#include "station.h"

    30

#include "rail.h"

    31

#include "train.h"

    32

#include "aircraft.h"

    33

#include "industry_map.h"

    34

#include "station_map.h"

    35

#include "water_map.h"

    36

#include "network/network.h"

    37

#include "yapf/yapf.h"

    38

#include "date.h"

    39

#include "newgrf_callbacks.h"

    40

#include "newgrf_engine.h"

    41

#include "newgrf_sound.h"

    42

#include "helpers.hpp"

    43

    44

#define INVALID_COORD (-0x8000)

    45

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

    46

    47

    48

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

    49

const uint32 _veh_build_proc_table[] = {

    50

	CMD_BUILD_RAIL_VEHICLE,

    51

	CMD_BUILD_ROAD_VEH,

    52

	CMD_BUILD_SHIP,

    53

	CMD_BUILD_AIRCRAFT,

    54

};

    55

const uint32 _veh_sell_proc_table[] = {

    56

	CMD_SELL_RAIL_WAGON,

    57

	CMD_SELL_ROAD_VEH,

    58

	CMD_SELL_SHIP,

    59

	CMD_SELL_AIRCRAFT,

    60

};

    61

    62

const uint32 _veh_refit_proc_table[] = {

    63

	CMD_REFIT_RAIL_VEHICLE,

    64

	CMD_REFIT_ROAD_VEH,

    65

	CMD_REFIT_SHIP,

    66

	CMD_REFIT_AIRCRAFT,

    67

};

    68

    69

const uint32 _send_to_depot_proc_table[] = {

    70

	CMD_SEND_TRAIN_TO_DEPOT,

    71

	CMD_SEND_ROADVEH_TO_DEPOT,

    72

	CMD_SEND_SHIP_TO_DEPOT,

    73

	CMD_SEND_AIRCRAFT_TO_HANGAR,

    74

};

    75

    76

    77

enum {

    78

	BLOCKS_FOR_SPECIAL_VEHICLES   = 2, ///< Blocks needed for special vehicles

    79

};

    80

    81

/**

    82

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

    83

 */

    84

static void VehiclePoolNewBlock(uint start_item)

    85

{

    86

	Vehicle *v;

    87

    88

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

    89

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

    90

	for (v = GetVehicle(start_item); v != NULL; v = (v->index + 1U < GetVehiclePoolSize()) ? GetVehicle(v->index + 1) : NULL) {

    91

		v->index = start_item++;

    92

		v->type  = VEH_INVALID;

    93

	}

    94

}

    95

    96

/* Initialize the vehicle-pool */

    97

DEFINE_OLD_POOL(Vehicle, Vehicle, VehiclePoolNewBlock, NULL)

    98

    99

void VehicleServiceInDepot(Vehicle *v)

   100

{

   101

	v->date_of_last_service = _date;

   102

	v->breakdowns_since_last_service = 0;

   103

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

   104

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

   105

}

   106

   107

bool VehicleNeedsService(const Vehicle *v)

   108

{

   109

	if (v->vehstatus & VS_CRASHED)

   110

		return false; // Crashed vehicles don't need service anymore

   111

   112

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

   113

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

   114

	}

   115

   116

	return _patches.servint_ispercent ?

   117

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

   118

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

   119

}

   120

   121

StringID VehicleInTheWayErrMsg(const Vehicle* v)

   122

{

   123

	switch (v->type) {

   124

		case VEH_TRAIN:    return STR_8803_TRAIN_IN_THE_WAY;

   125

		case VEH_ROAD:     return STR_9000_ROAD_VEHICLE_IN_THE_WAY;

   126

		case VEH_AIRCRAFT: return STR_A015_AIRCRAFT_IN_THE_WAY;

   127

		default:           return STR_980E_SHIP_IN_THE_WAY;

   128

	}

   129

}

   130

   131

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

   132

{

   133

	if (v->tile != *(const TileIndex*)data || v->type == VEH_DISASTER)

   134

		return NULL;

   135

   136

	_error_message = VehicleInTheWayErrMsg(v);

   137

	return v;

   138

}

   139

   140

bool EnsureNoVehicle(TileIndex tile)

   141

{

   142

	return VehicleFromPos(tile, &tile, EnsureNoVehicleProc) == NULL;

   143

}

   144

   145

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

   146

{

   147

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

   148

   149

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

   150

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

   151

   152

	_error_message = VehicleInTheWayErrMsg(v);

   153

	return v;

   154

}

   155

   156

   157

bool EnsureNoVehicleOnGround(TileIndex tile)

   158

{

   159

	TileInfo ti;

   160

   161

	ti.tile = tile;

   162

	ti.z = GetTileMaxZ(tile);

   163

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

   164

}

   165

   166

Vehicle *FindVehicleOnTileZ(TileIndex tile, byte z)

   167

{

   168

	TileInfo ti;

   169

   170

	ti.tile = tile;

   171

	ti.z = z;

   172

   173

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

   174

}

   175

   176

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

   177

{

   178

	int x1 = TileX(from);

   179

	int y1 = TileY(from);

   180

	int x2 = TileX(to);

   181

	int y2 = TileY(to);

   182

	Vehicle *veh;

   183

   184

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

   185

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

   186

		Swap(x1, x2);

   187

		Swap(y1, y2);

   188

	}

   189

	FOR_ALL_VEHICLES(veh) {

   190

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

   191

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

   192

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

   193

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

   194

				return veh;

   195

			}

   196

		}

   197

	}

   198

	return NULL;

   199

}

   200

   201

   202

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

   203

   204

void VehiclePositionChanged(Vehicle *v)

   205

{

   206

	int img = v->cur_image;

   207

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

   208

	const Sprite* spr = GetSprite(img);

   209

   210

	pt.x += spr->x_offs;

   211

	pt.y += spr->y_offs;

   212

   213

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

   214

   215

	v->left_coord = pt.x;

   216

	v->top_coord = pt.y;

   217

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

   218

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

   219

}

   220

   221

/** Called after load to update coordinates */

   222

void AfterLoadVehicles()

   223

{

   224

	Vehicle *v;

   225

   226

	FOR_ALL_VEHICLES(v) {

   227

		v->first = NULL;

   228

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

   229

	}

   230

   231

	FOR_ALL_VEHICLES(v) {

   232

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

   233

			TrainConsistChanged(v);

   234

	}

   235

   236

	FOR_ALL_VEHICLES(v) {

   237

		switch (v->type) {

   238

			case VEH_TRAIN: v->cur_image = GetTrainImage(v, v->direction); break;

   239

			case VEH_ROAD: v->cur_image = GetRoadVehImage(v, v->direction); break;

   240

			case VEH_SHIP: v->cur_image = GetShipImage(v, v->direction); break;

   241

			case VEH_AIRCRAFT:

   242

				if (IsNormalAircraft(v)) {

   243

					v->cur_image = GetAircraftImage(v, v->direction);

   244

   245

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

   246

					Vehicle *shadow = v->next;

   247

					shadow->cur_image = v->cur_image;

   248

   249

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

   250

					if (v->subtype == AIR_HELICOPTER) {

   251

						Vehicle *rotor = shadow->next;

   252

						rotor->cur_image = GetRotorImage(v);

   253

					}

   254

				}

   255

				break;

   256

			default: break;

   257

		}

   258

   259

		v->left_coord = INVALID_COORD;

   260

		VehiclePositionChanged(v);

   261

	}

   262

}

   263

   264

static Vehicle *InitializeVehicle(Vehicle *v)

   265

{

   266

	VehicleID index = v->index;

   267

	memset(v, 0, sizeof(Vehicle));

   268

	v->index = index;

   269

   270

	assert(v->orders == NULL);

   271

   272

	v->type = VEH_INVALID;

   273

	v->left_coord = INVALID_COORD;

   274

	v->first = NULL;

   275

	v->next = NULL;

   276

	v->next_hash = NULL;

   277

	v->string_id = 0;

   278

	v->next_shared = NULL;

   279

	v->prev_shared = NULL;

   280

	v->depot_list  = NULL;

   281

	v->random_bits = 0;

   282

	return v;

   283

}

   284

   285

/**

   286

 * Get a value for a vehicle's random_bits.

   287

 * @return A random value from 0 to 255.

   288

 */

   289

byte VehicleRandomBits()

   290

{

   291

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

   292

}

   293

   294

Vehicle *ForceAllocateSpecialVehicle()

   295

{

   296

	/* This stays a strange story.. there should always be room for special

   297

	 * vehicles (special effects all over the map), but with 65k of vehicles

   298

	 * is this realistic to double-check for that? For now we just reserve

   299

	 * BLOCKS_FOR_SPECIAL_VEHICLES times block_size vehicles that may only

   300

	 * be used for special vehicles.. should work nicely :) */

   301

   302

	Vehicle *v;

   303

   304

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

   305

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

   306

	for (v = GetVehicle(0); v != NULL; v = (v->index + 1U < GetVehiclePoolSize()) ? GetVehicle(v->index + 1) : NULL) {

   307

		/* No more room for the special vehicles, return NULL */

   308

		if (v->index >= (1 << Vehicle_POOL_BLOCK_SIZE_BITS) * BLOCKS_FOR_SPECIAL_VEHICLES)

   309

			return NULL;

   310

   311

		if (!IsValidVehicle(v)) return InitializeVehicle(v);

   312

	}

   313

   314

	return NULL;

   315

}

   316

   317

/**

   318

 * finds a free vehicle in the memory or allocates a new one

   319

 * returns a pointer to the first free vehicle or NULL if all vehicles are in use

   320

 * *skip_vehicles is an offset to where in the array we should begin looking

   321

 * this is to avoid looping though the same vehicles more than once after we learned that they are not free

   322

 * this feature is used by AllocateVehicles() since it need to allocate more than one and when

   323

 * another block is added to _Vehicle_pool, since we only do that when we know it's already full

   324

 */

   325

static Vehicle *AllocateSingleVehicle(VehicleID *skip_vehicles)

   326

{

   327

	/* See note by ForceAllocateSpecialVehicle() why we skip the

   328

	 * first blocks */

   329

	Vehicle *v;

   330

	const int offset = (1 << Vehicle_POOL_BLOCK_SIZE_BITS) * BLOCKS_FOR_SPECIAL_VEHICLES;

   331

   332

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

   333

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

   334

	if (*skip_vehicles < (_Vehicle_pool.total_items - offset)) { // make sure the offset in the array is not larger than the array itself

   335

		for (v = GetVehicle(offset + *skip_vehicles); v != NULL; v = (v->index + 1U < GetVehiclePoolSize()) ? GetVehicle(v->index + 1) : NULL) {

   336

			(*skip_vehicles)++;

   337

			if (!IsValidVehicle(v)) return InitializeVehicle(v);

   338

		}

   339

	}

   340

   341

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

   342

	if (AddBlockToPool(&_Vehicle_pool))

   343

		return AllocateSingleVehicle(skip_vehicles);

   344

   345

	return NULL;

   346

}

   347

   348

   349

Vehicle *AllocateVehicle()

   350

{

   351

	VehicleID counter = 0;

   352

	return AllocateSingleVehicle(&counter);

   353

}

   354

   355

   356

/** Allocates a lot of vehicles and frees them again

   357

 * @param vl pointer to an array of vehicles to get allocated. Can be NULL if the vehicles aren't needed (makes it test only)

   358

 * @param num number of vehicles to allocate room for

   359

 * @return true if there is room to allocate all the vehicles

   360

 */

   361

bool AllocateVehicles(Vehicle **vl, int num)

   362

{

   363

	int i;

   364

	Vehicle *v;

   365

	VehicleID counter = 0;

   366

   367

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

   368

		v = AllocateSingleVehicle(&counter);

   369

		if (v == NULL) {

   370

			return false;

   371

		}

   372

		if (vl != NULL) {

   373

			vl[i] = v;

   374

		}

   375

	}

   376

   377

	return true;

   378

}

   379

   380

   381

static Vehicle *_vehicle_position_hash[0x1000];

   382

   383

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

   384

{

   385

	Point pt = RemapCoords(TileX(tile) * TILE_SIZE, TileY(tile) * TILE_SIZE, 0);

   386

   387

	/* The hash area to scan */

   388

	const int xl = GB(pt.x - 174, 7, 6);

   389

	const int xu = GB(pt.x + 104, 7, 6);

   390

	const int yl = GB(pt.y - 294, 6, 6) << 6;

   391

	const int yu = GB(pt.y +  56, 6, 6) << 6;

   392

   393

	int x;

   394

	int y;

   395

   396

	for (y = yl;; y = (y + (1 << 6)) & (0x3F << 6)) {

   397

		for (x = xl;; x = (x + 1) & 0x3F) {

   398

			Vehicle *v = _vehicle_position_hash[(x + y) & 0xFFFF];

   399

   400

			while (v != NULL) {

   401

				void* a = proc(v, data);

   402

   403

				if (a != NULL) return a;

   404

				v = v->next_hash;

   405

			}

   406

   407

			if (x == xu) break;

   408

		}

   409

   410

		if (y == yu) break;

   411

	}

   412

	return NULL;

   413

}

   414

   415

   416

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

   417

{

   418

	Vehicle **old_hash, **new_hash;

   419

	int old_x = v->left_coord;

   420

	int old_y = v->top_coord;

   421

   422

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

   423

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

   424

   425

	if (old_hash == new_hash) return;

   426

   427

	/* remove from hash table? */

   428

	if (old_hash != NULL) {

   429

		Vehicle *last = NULL;

   430

		Vehicle *u = *old_hash;

   431

		while (u != v) {

   432

			last = u;

   433

			u = u->next_hash;

   434

			assert(u != NULL);

   435

		}

   436

   437

		if (last == NULL) {

   438

			*old_hash = v->next_hash;

   439

		} else {

   440

			last->next_hash = v->next_hash;

   441

		}

   442

	}

   443

   444

	/* insert into hash table? */

   445

	if (new_hash != NULL) {

   446

		v->next_hash = *new_hash;

   447

		*new_hash = v;

   448

	}

   449

}

   450

   451

void ResetVehiclePosHash()

   452

{

   453

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

   454

}

   455

   456

void InitializeVehicles()

   457

{

   458

	uint i;

   459

   460

	/* Clean the vehicle pool, and reserve enough blocks

   461

	 *  for the special vehicles, plus one for all the other

   462

	 *  vehicles (which is increased on-the-fly) */

   463

	CleanPool(&_Vehicle_pool);

   464

	AddBlockToPool(&_Vehicle_pool);

   465

	for (i = 0; i < BLOCKS_FOR_SPECIAL_VEHICLES; i++) {

   466

		AddBlockToPool(&_Vehicle_pool);

   467

	}

   468

   469

	ResetVehiclePosHash();

   470

}

   471

   472

Vehicle *GetLastVehicleInChain(Vehicle *v)

   473

{

   474

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

   475

	return v;

   476

}

   477

   478

/** Finds the previous vehicle in a chain, by a brute force search.

   479

 * This old function is REALLY slow because it searches through all vehicles to

   480

 * find the previous vehicle, but if v->first has not been set, then this function

   481

 * will need to be used to find the previous one. This function should never be

   482

 * called by anything but GetFirstVehicleInChain

   483

 */

   484

static Vehicle *GetPrevVehicleInChain_bruteforce(const Vehicle *v)

   485

{

   486

	Vehicle *u;

   487

   488

	FOR_ALL_VEHICLES(u) if (u->type == VEH_TRAIN && u->next == v) return u;