1

/* $Id$ */

     2

     3

#include "stdafx.h"

     4

#include "openttd.h"

     5

#include "road_map.h"

     6

#include "roadveh.h"

     7

#include "ship.h"

     8

#include "spritecache.h"

     9

#include "table/sprites.h"

    10

#include "table/strings.h"

    11

#include "functions.h"

    12

#include "map.h"

    13

#include "tile.h"

    14

#include "vehicle.h"

    15

#include "gfx.h"

    16

#include "viewport.h"

    17

#include "news.h"

    18

#include "command.h"

    19

#include "saveload.h"

    20

#include "player.h"

    21

#include "engine.h"

    22

#include "sound.h"

    23

#include "debug.h"

    24

#include "vehicle_gui.h"

    25

#include "depot.h"

    26

#include "station.h"

    27

#include "rail.h"

    28

#include "train.h"

    29

#include "aircraft.h"

    30

#include "industry_map.h"

    31

#include "station_map.h"

    32

#include "water_map.h"

    33

#include "network.h"

    34

#include "yapf/yapf.h"

    35

#include "date.h"

    36

#include "newgrf_engine.h"

    37

#include "newgrf_sound.h"

    38

    39

#define INVALID_COORD (-0x8000)

    40

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

    41

    42

/*

    43

 * These command macros are used to call vehicle type specific commands with non type specific commands

    44

 * it should be used like: DoCommandP(x, y, p1, p2, flags, CMD_STARTSTOP_VEH(v->type))

    45

 * that line will start/stop a vehicle nomatter what type it is

    46

 * VEH_Train is used as an offset because the vehicle type values doesn't start with 0

    47

 */

    48

    49

#define CMD_BUILD_VEH(x) _veh_build_proc_table[ x - VEH_Train]

    50

#define CMD_SELL_VEH(x)  _veh_sell_proc_table [ x - VEH_Train]

    51

#define CMD_REFIT_VEH(x) _veh_refit_proc_table[ x - VEH_Train]

    52

    53

static 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

static 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

static 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

enum {

    82

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

    83

};

    84

    85

/**

    86

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

    87

 */

    88

static void VehiclePoolNewBlock(uint start_item)

    89

{

    90

	Vehicle *v;

    91

    92

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

    93

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

    94

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

    95

}

    96

    97

/* Initialize the vehicle-pool */

    98

DEFINE_OLD_POOL(Vehicle, Vehicle, VehiclePoolNewBlock, NULL)

    99

   100

void VehicleServiceInDepot(Vehicle *v)

   101

{

   102

	v->date_of_last_service = _date;

   103

	v->breakdowns_since_last_service = 0;

   104

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

   105

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

   106

}

   107

   108

bool VehicleNeedsService(const Vehicle *v)

   109

{

   110

	if (v->vehstatus & VS_CRASHED)

   111

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

   112

   113

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

   114

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

   115

	}

   116

   117

	return _patches.servint_ispercent ?

   118

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

   119

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

   120

}

   121

   122

StringID VehicleInTheWayErrMsg(const Vehicle* v)

   123

{

   124

	switch (v->type) {

   125

		case VEH_Train:    return STR_8803_TRAIN_IN_THE_WAY;

   126

		case VEH_Road:     return STR_9000_ROAD_VEHICLE_IN_THE_WAY;

   127

		case VEH_Aircraft: return STR_A015_AIRCRAFT_IN_THE_WAY;

   128

		default:           return STR_980E_SHIP_IN_THE_WAY;

   129

	}

   130

}

   131

   132

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

   133

{

   134

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

   135

		return NULL;

   136

   137

	_error_message = VehicleInTheWayErrMsg(v);

   138

	return v;

   139

}

   140

   141

bool EnsureNoVehicle(TileIndex tile)

   142

{

   143

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

   144

}

   145

   146

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

   147

{

   148

	const TileInfo *ti = data;

   149

   150

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

   151

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

   152

   153

	_error_message = VehicleInTheWayErrMsg(v);

   154

	return v;

   155

}

   156

   157

   158

bool EnsureNoVehicleOnGround(TileIndex tile)

   159

{

   160

	TileInfo ti;

   161

   162

	ti.tile = tile;

   163

	ti.z = GetTileMaxZ(tile);

   164

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

   165

}

   166

   167

Vehicle *FindVehicleOnTileZ(TileIndex tile, byte z)

   168

{

   169

	TileInfo ti;

   170

   171

	ti.tile = tile;

   172

	ti.z = z;

   173

   174

	return VehicleFromPos(tile, &ti, EnsureNoVehicleProcZ);

   175

}

   176

   177

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

   178

{

   179

	int x1 = TileX(from);

   180

	int y1 = TileY(from);

   181

	int x2 = TileX(to);

   182

	int y2 = TileY(to);

   183

	Vehicle *veh;

   184

   185

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

   186

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

   187

		intswap(x1,x2);

   188

		intswap(y1,y2);

   189

	}

   190

	FOR_ALL_VEHICLES(veh) {

   191

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

   192

		if ((veh->type == VEH_Train || veh->type == VEH_Road) && (z==0xFF || veh->z_pos == z)) {

   193

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

   194

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

   195

				return veh;

   196

			}

   197

		}

   198

	}

   199

	return NULL;

   200

}

   201

   202

   203

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

   204

   205

void VehiclePositionChanged(Vehicle *v)

   206

{

   207

	int img = v->cur_image;

   208

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

   209

	const Sprite* spr = GetSprite(img);

   210

   211

	pt.x += spr->x_offs;

   212

	pt.y += spr->y_offs;

   213

   214

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

   215

   216

	v->left_coord = pt.x;

   217

	v->top_coord = pt.y;

   218

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

   219

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

   220

}

   221

   222

// Called after load to update coordinates

   223

void AfterLoadVehicles(void)

   224

{

   225

	Vehicle *v;

   226

   227

	FOR_ALL_VEHICLES(v) {

   228

		v->first = NULL;

   229

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

   230

	}

   231

   232

	FOR_ALL_VEHICLES(v) {

   233

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

   234

			TrainConsistChanged(v);

   235

	}

   236

   237

	FOR_ALL_VEHICLES(v) {

   238

		switch (v->type) {

   239

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

   240

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

   241

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

   242

			case VEH_Aircraft:

   243

				if (v->subtype == 0 || v->subtype == 2) {

   244

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

   245

					if (v->next != NULL) v->next->cur_image = v->cur_image;

   246

				}

   247

				break;

   248

			default: break;

   249

		}

   250

   251

		v->left_coord = INVALID_COORD;

   252

		VehiclePositionChanged(v);

   253

	}

   254

}

   255

   256

static Vehicle *InitializeVehicle(Vehicle *v)

   257

{

   258

	VehicleID index = v->index;

   259

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

   260

	v->index = index;

   261

   262

	assert(v->orders == NULL);

   263

   264

	v->left_coord = INVALID_COORD;

   265

	v->first = NULL;

   266

	v->next = NULL;

   267

	v->next_hash = INVALID_VEHICLE;

   268

	v->string_id = 0;

   269

	v->next_shared = NULL;

   270

	v->prev_shared = NULL;

   271

	v->depot_list  = NULL;

   272

	v->random_bits = 0;

   273

	return v;

   274

}

   275

   276

/**

   277

 * Get a value for a vehicle's random_bits.

   278

 * @return A random value from 0 to 255.

   279

 */

   280

byte VehicleRandomBits(void)

   281

{

   282

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

   283

}

   284

   285

Vehicle *ForceAllocateSpecialVehicle(void)

   286

{

   287

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

   288

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

   289

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

   290

	 * BLOCKS_FOR_SPECIAL_VEHICLES times block_size vehicles that may only

   291

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

   292

   293

	Vehicle *v;

   294

   295

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

   296

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

   297

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

   298

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

   299

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

   300

			return NULL;

   301

   302

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

   303

	}

   304

   305

	return NULL;

   306

}

   307

   308

/*

   309

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

   310

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

   311

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

   312

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

   313

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

   314

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

   315

 */

   316

static Vehicle *AllocateSingleVehicle(VehicleID *skip_vehicles)

   317

{

   318

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

   319

	 * first blocks */

   320

	Vehicle *v;

   321

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

   322

   323

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

   324

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

   325

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

   326

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

   327

			(*skip_vehicles)++;

   328

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

   329

		}

   330

	}

   331

   332

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

   333

	if (AddBlockToPool(&_Vehicle_pool))

   334

		return AllocateSingleVehicle(skip_vehicles);

   335

   336

	return NULL;

   337

}

   338

   339

   340

Vehicle *AllocateVehicle(void)

   341

{

   342

	VehicleID counter = 0;

   343

	return AllocateSingleVehicle(&counter);

   344

}

   345

   346

   347

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

   348

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

   349

 * @param num number of vehicles to allocate room for

   350

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

   351

 */

   352

bool AllocateVehicles(Vehicle **vl, int num)

   353

{

   354

	int i;

   355

	Vehicle *v;

   356

	VehicleID counter = 0;

   357

   358

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

   359

		v = AllocateSingleVehicle(&counter);

   360

		if (v == NULL) {

   361

			return false;

   362

		}

   363

		if (vl != NULL) {

   364

			vl[i] = v;

   365

		}

   366

	}

   367

   368

	return true;

   369

}

   370

   371

   372

static VehicleID _vehicle_position_hash[0x1000];

   373

   374

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

   375

{

   376

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

   377

   378

	// The hash area to scan

   379

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

   380

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

   381

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

   382

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

   383

   384

	int x;

   385

	int y;

   386

   387

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

   388

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

   389

			VehicleID veh = _vehicle_position_hash[(x + y) & 0xFFFF];

   390

   391

			while (veh != INVALID_VEHICLE) {

   392

				Vehicle *v = GetVehicle(veh);

   393

				void* a = proc(v, data);

   394

   395

				if (a != NULL) return a;

   396

				veh = v->next_hash;

   397

			}

   398

   399

			if (x == xu) break;

   400

		}

   401

   402

		if (y == yu) break;

   403

	}

   404

	return NULL;

   405

}

   406

   407

   408

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

   409

{

   410

	VehicleID *old_hash, *new_hash;

   411

	int old_x = v->left_coord;

   412

	int old_y = v->top_coord;

   413

	Vehicle *u;

   414

   415

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

   416

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

   417

   418

	if (old_hash == new_hash) return;

   419

   420

	/* remove from hash table? */

   421

	if (old_hash != NULL) {

   422

		Vehicle *last = NULL;

   423

		VehicleID idx = *old_hash;

   424

		while ((u = GetVehicle(idx)) != v) {

   425

			idx = u->next_hash;

   426

			assert(idx != INVALID_VEHICLE);

   427

			last = u;

   428

		}

   429

   430

		if (last == NULL) {

   431

			*old_hash = v->next_hash;

   432

		} else {

   433

			last->next_hash = v->next_hash;

   434

		}

   435

	}

   436

   437

	/* insert into hash table? */

   438

	if (new_hash != NULL) {

   439

		v->next_hash = *new_hash;

   440

		*new_hash = v->index;

   441

	}

   442

}

   443

   444

void ResetVehiclePosHash(void)

   445

{

   446

	uint i;

   447

	for (i = 0; i < lengthof(_vehicle_position_hash); i++) {

   448

		_vehicle_position_hash[i] = INVALID_VEHICLE;

   449

	}

   450

}

   451

   452

void InitializeVehicles(void)

   453

{

   454

	uint i;

   455

   456

	/* Clean the vehicle pool, and reserve enough blocks

   457

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

   458

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

   459

	CleanPool(&_Vehicle_pool);

   460

	AddBlockToPool(&_Vehicle_pool);

   461

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

   462

		AddBlockToPool(&_Vehicle_pool);

   463

	}

   464

   465

	ResetVehiclePosHash();

   466

}

   467

   468

Vehicle *GetLastVehicleInChain(Vehicle *v)

   469

{

   470

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

   471

	return v;

   472

}

   473

   474

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

   475

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

   476

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

   477

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

   478

 * called by anything but GetFirstVehicleInChain

   479

 */

   480

static Vehicle *GetPrevVehicleInChain_bruteforce(const Vehicle *v)

   481

{

   482

	Vehicle *u;

   483

   484

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

   485

   486

	return NULL;

   487

}

   488

   489

/** Find the previous vehicle in a chain, by using the v->first cache.

   490

 * While this function is fast, it cannot be used in the GetFirstVehicleInChain

   491

 * function, otherwise you'll end up in an infinite loop call