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

	/* Max vehicles: 64000 (512 * 125) */

    83

	VEHICLES_POOL_BLOCK_SIZE_BITS = 9,       /* In bits, so (1 << 9) == 512 */

    84

	VEHICLES_POOL_MAX_BLOCKS      = 125,

    85

    86

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

    87

};

    88

    89

/**

    90

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

    91

 */

    92

static void VehiclePoolNewBlock(uint start_item)

    93

{

    94

	Vehicle *v;

    95

    96

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

    97

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

    98

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

    99

}

   100

   101

/* Initialize the vehicle-pool */

   102

MemoryPool _vehicle_pool = { "Vehicle", VEHICLES_POOL_MAX_BLOCKS, VEHICLES_POOL_BLOCK_SIZE_BITS, sizeof(Vehicle), &VehiclePoolNewBlock, NULL, 0, 0, NULL };

   103

   104

void VehicleServiceInDepot(Vehicle *v)

   105

{

   106

	v->date_of_last_service = _date;

   107

	v->breakdowns_since_last_service = 0;

   108

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

   109

}

   110

   111

bool VehicleNeedsService(const Vehicle *v)

   112

{

   113

	if (v->vehstatus & VS_CRASHED)

   114

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

   115

   116

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

   117

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

   118

	}

   119

   120

	return _patches.servint_ispercent ?

   121

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

   122

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

   123

}

   124

   125

StringID VehicleInTheWayErrMsg(const Vehicle* v)

   126

{

   127

	switch (v->type) {

   128

		case VEH_Train:    return STR_8803_TRAIN_IN_THE_WAY;

   129

		case VEH_Road:     return STR_9000_ROAD_VEHICLE_IN_THE_WAY;

   130

		case VEH_Aircraft: return STR_A015_AIRCRAFT_IN_THE_WAY;

   131

		default:           return STR_980E_SHIP_IN_THE_WAY;

   132

	}

   133

}

   134

   135

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

   136

{

   137

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

   138

		return NULL;

   139

   140

	_error_message = VehicleInTheWayErrMsg(v);

   141

	return v;

   142

}

   143

   144

bool EnsureNoVehicle(TileIndex tile)

   145

{

   146

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

   147

}

   148

   149

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

   150

{

   151

	const TileInfo *ti = data;

   152

   153

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

   154

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

   155

   156

	_error_message = VehicleInTheWayErrMsg(v);

   157

	return v;

   158

}

   159

   160

   161

bool EnsureNoVehicleOnGround(TileIndex tile)

   162

{

   163

	TileInfo ti;

   164

   165

	ti.tile = tile;

   166

	ti.z = GetTileMaxZ(tile);

   167

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

   168

}

   169

   170

Vehicle *FindVehicleOnTileZ(TileIndex tile, byte z)

   171

{

   172

	TileInfo ti;

   173

   174

	ti.tile = tile;

   175

	ti.z = z;

   176

   177

	return VehicleFromPos(tile, &ti, EnsureNoVehicleProcZ);

   178

}

   179

   180

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

   181

{

   182

	int x1 = TileX(from);

   183

	int y1 = TileY(from);

   184

	int x2 = TileX(to);

   185

	int y2 = TileY(to);

   186

	Vehicle *veh;

   187

   188

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

   189

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

   190

		intswap(x1,x2);

   191

		intswap(y1,y2);

   192

	}

   193

	FOR_ALL_VEHICLES(veh) {

   194

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

   195

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

   196

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

   197

				return veh;

   198

			}

   199

		}

   200

	}

   201

	return NULL;

   202

}

   203

   204

   205

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

   206

   207

void VehiclePositionChanged(Vehicle *v)

   208

{

   209

	int img = v->cur_image;

   210

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

   211

	const Sprite* spr = GetSprite(img);

   212

   213

	pt.x += spr->x_offs;

   214

	pt.y += spr->y_offs;

   215

   216

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

   217

   218

	v->left_coord = pt.x;

   219

	v->top_coord = pt.y;

   220

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

   221

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

   222

}

   223

   224

// Called after load to update coordinates

   225

void AfterLoadVehicles(void)

   226

{

   227

	Vehicle *v;

   228

   229

	FOR_ALL_VEHICLES(v) {

   230

		v->first = NULL;

   231

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

   232

	}

   233

   234

	FOR_ALL_VEHICLES(v) {

   235

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

   236

			TrainConsistChanged(v);

   237

	}

   238

   239

	FOR_ALL_VEHICLES(v) {

   240

		switch (v->type) {

   241

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

   242

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

   243

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

   244

			case VEH_Aircraft:

   245

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

   246

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

   247

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

   248

				}

   249

				break;

   250

			default: break;

   251

		}

   252

   253

		v->left_coord = INVALID_COORD;

   254

		VehiclePositionChanged(v);

   255

	}

   256

}

   257

   258

static Vehicle *InitializeVehicle(Vehicle *v)

   259

{

   260

	VehicleID index = v->index;

   261

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

   262

	v->index = index;

   263

   264

	assert(v->orders == NULL);

   265

   266

	v->left_coord = INVALID_COORD;

   267

	v->first = NULL;

   268

	v->next = NULL;

   269

	v->next_hash = INVALID_VEHICLE;

   270

	v->string_id = 0;

   271

	v->next_shared = NULL;

   272

	v->prev_shared = NULL;

   273

	v->depot_list  = NULL;

   274

	v->random_bits = 0;

   275

	return v;

   276

}

   277

   278

/**

   279

 * Get a value for a vehicle's random_bits.

   280

 * @return A random value from 0 to 255.

   281

 */

   282

byte VehicleRandomBits(void)

   283

{

   284

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

   285

}

   286

   287

Vehicle *ForceAllocateSpecialVehicle(void)

   288

{

   289

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

   290

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

   291

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

   292

	 * BLOCKS_FOR_SPECIAL_VEHICLES times block_size vehicles that may only

   293

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

   294

   295

	Vehicle *v;

   296

   297

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

   298

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

   299

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

   300

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

   301

		if (v->index >= (1 << _vehicle_pool.block_size_bits) * BLOCKS_FOR_SPECIAL_VEHICLES)

   302

			return NULL;

   303

   304

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

   305

	}

   306

   307

	return NULL;

   308

}

   309

   310

/*

   311

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

   312

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

   313

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

   314

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

   315

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

   316

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

   317

 */

   318

static Vehicle *AllocateSingleVehicle(VehicleID *skip_vehicles)

   319

{

   320

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

   321

	 * first blocks */

   322

	Vehicle *v;

   323

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

   324

   325

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

   326

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

   327

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

   328

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

   329

			(*skip_vehicles)++;

   330

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

   331

		}

   332

	}

   333

   334

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

   335

	if (AddBlockToPool(&_vehicle_pool))

   336

		return AllocateSingleVehicle(skip_vehicles);

   337

   338

	return NULL;

   339

}

   340

   341

   342

Vehicle *AllocateVehicle(void)

   343

{

   344

	VehicleID counter = 0;

   345

	return AllocateSingleVehicle(&counter);

   346

}

   347

   348

   349

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

   350

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

   351

 * @param num number of vehicles to allocate room for

   352

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

   353

 */

   354

bool AllocateVehicles(Vehicle **vl, int num)

   355

{

   356

	int i;

   357

	Vehicle *v;

   358

	VehicleID counter = 0;

   359

   360

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

   361

		v = AllocateSingleVehicle(&counter);

   362

		if (v == NULL) {

   363

			return false;

   364

		}

   365

		if (vl != NULL) {

   366

			vl[i] = v;

   367

		}

   368

	}

   369

   370

	return true;

   371

}

   372

   373

   374

static VehicleID _vehicle_position_hash[0x1000];

   375

   376

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

   377

{

   378

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

   379

   380

	// The hash area to scan

   381

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

   382

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

   383

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

   384

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

   385

   386

	int x;

   387

	int y;

   388

   389

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

   390

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

   391

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

   392

   393

			while (veh != INVALID_VEHICLE) {

   394

				Vehicle *v = GetVehicle(veh);

   395

				void* a = proc(v, data);

   396

   397

				if (a != NULL) return a;

   398

				veh = v->next_hash;

   399

			}

   400

   401

			if (x == xu) break;

   402

		}

   403

   404

		if (y == yu) break;

   405

	}

   406

	return NULL;

   407

}

   408

   409

   410

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

   411

{

   412

	VehicleID *old_hash, *new_hash;

   413

	int old_x = v->left_coord;

   414

	int old_y = v->top_coord;

   415

	Vehicle *u;

   416

   417

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

   418

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

   419

   420

	if (old_hash == new_hash) return;

   421

   422

	/* remove from hash table? */

   423

	if (old_hash != NULL) {

   424

		Vehicle *last = NULL;

   425

		VehicleID idx = *old_hash;

   426

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

   427

			idx = u->next_hash;

   428

			assert(idx != INVALID_VEHICLE);

   429

			last = u;

   430

		}

   431

   432

		if (last == NULL) {

   433

			*old_hash = v->next_hash;

   434

		} else {

   435

			last->next_hash = v->next_hash;

   436

		}

   437

	}

   438

   439

	/* insert into hash table? */

   440

	if (new_hash != NULL) {

   441

		v->next_hash = *new_hash;

   442

		*new_hash = v->index;

   443

	}

   444

}

   445

   446

void InitializeVehicles(void)

   447

{

   448

	uint i;

   449

   450

	/* Clean the vehicle pool, and reserve enough blocks

   451

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

   452

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

   453

	CleanPool(&_vehicle_pool);

   454

	AddBlockToPool(&_vehicle_pool);

   455

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

   456

		AddBlockToPool(&_vehicle_pool);

   457

   458

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

   459

		_vehicle_position_hash[i] = INVALID_VEHICLE;

   460

	}

   461

}

   462

   463

Vehicle *GetLastVehicleInChain(Vehicle *v)

   464

{

   465

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

   466

	return v;

   467

}

   468

   469

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

   470

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

   471

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

   472

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

   473

 * called by anything but GetFirstVehicleInChain

   474

 */

   475

static Vehicle *GetPrevVehicleInChain_bruteforce(const Vehicle *v)

   476

{

   477

	Vehicle *u;

   478

   479

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

   480

   481

	return NULL;

   482

}

   483

   484

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

   485

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

   486

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

   487

 */

   488

Vehicle *GetPrevVehicleInChain(const Vehicle *v)

   489

{

   490

	Vehicle *u;

   491

	assert(v != NULL);

   492