1

/* $Id$ */

     2

     3

#include "stdafx.h"

     4

#include "openttd.h"

     5

#include "spritecache.h"

     6

#include "table/sprites.h"

     7

#include "table/strings.h"

     8

#include "functions.h"

     9

#include "map.h"

    10

#include "tile.h"

    11

#include "vehicle.h"

    12

#include "gfx.h"

    13

#include "viewport.h"

    14

#include "news.h"

    15

#include "command.h"

    16

#include "saveload.h"

    17

#include "player.h"

    18

#include "engine.h"

    19

#include "sound.h"

    20

#include "debug.h"

    21

#include "vehicle_gui.h"

    22

#include "depot.h"

    23

#include "station.h"

    24

#include "rail.h"

    25

#include "train.h"

    26

    27

#define INVALID_COORD (-0x8000)

    28

#define GEN_HASH(x,y) (((x & 0x1F80)>>7) + ((y & 0xFC0)))

    29

    30

/*

    31

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

    32

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

    33

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

    34

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

    35

 */

    36

    37

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

    38

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

    39

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

    40

    41

static const uint32 _veh_build_proc_table[] = {

    42

	CMD_BUILD_RAIL_VEHICLE,

    43

	CMD_BUILD_ROAD_VEH,

    44

	CMD_BUILD_SHIP,

    45

	CMD_BUILD_AIRCRAFT,

    46

};

    47

static const uint32 _veh_sell_proc_table[] = {

    48

	CMD_SELL_RAIL_WAGON,

    49

	CMD_SELL_ROAD_VEH,

    50

	CMD_SELL_SHIP,

    51

	CMD_SELL_AIRCRAFT,

    52

};

    53

    54

static const uint32 _veh_refit_proc_table[] = {

    55

	CMD_REFIT_RAIL_VEHICLE,

    56

	0,	// road vehicles can't be refitted

    57

	CMD_REFIT_SHIP,

    58

	CMD_REFIT_AIRCRAFT,

    59

};

    60

    61

    62

enum {

    63

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

    64

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

    65

	VEHICLES_POOL_MAX_BLOCKS      = 125,

    66

    67

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

    68

};

    69

    70

/**

    71

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

    72

 */

    73

static void VehiclePoolNewBlock(uint start_item)

    74

{

    75

	Vehicle *v;

    76

    77

	FOR_ALL_VEHICLES_FROM(v, start_item) v->index = start_item++;

    78

}

    79

    80

/* Initialize the vehicle-pool */

    81

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

    82

    83

void VehicleServiceInDepot(Vehicle *v)

    84

{

    85

	v->date_of_last_service = _date;

    86

	v->breakdowns_since_last_service = 0;

    87

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

    88

}

    89

    90

bool VehicleNeedsService(const Vehicle *v)

    91

{

    92

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

    93

		return false;

    94

    95

	if (v->vehstatus & VS_CRASHED)

    96

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

    97

    98

	return _patches.servint_ispercent ?

    99

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

   100

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

   101

}

   102

   103

void VehicleInTheWayErrMsg(const Vehicle* v)

   104

{

   105

	switch (v->type) {

   106

		case VEH_Train:    _error_message = STR_8803_TRAIN_IN_THE_WAY;        break;

   107

		case VEH_Road:     _error_message = STR_9000_ROAD_VEHICLE_IN_THE_WAY; break;

   108

		case VEH_Aircraft: _error_message = STR_A015_AIRCRAFT_IN_THE_WAY;     break;

   109

		default:           _error_message = STR_980E_SHIP_IN_THE_WAY;         break;

   110

	}

   111

}

   112

   113

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

   114

{

   115

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

   116

		return NULL;

   117

   118

	VehicleInTheWayErrMsg(v);

   119

	return v;

   120

}

   121

   122

bool EnsureNoVehicle(TileIndex tile)

   123

{

   124

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

   125

}

   126

   127

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

   128

{

   129

	const TileInfo *ti = data;

   130

   131

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

   132

	if (!IS_INT_INSIDE(ti->z - v->z_pos, 0, 8 + 1)) return NULL;

   133

   134

	VehicleInTheWayErrMsg(v);

   135

	return v;

   136

}

   137

   138

static inline uint Correct_Z(uint tileh)

   139

{

   140

	// needs z correction for slope-type graphics that have the NORTHERN tile lowered

   141

	// 1, 2, 3, 4, 5, 6 and 7

   142

	return CorrectZ(tileh) ? 8 : 0;

   143

}

   144

   145

uint GetCorrectTileHeight(TileIndex tile)

   146

{

   147

	return Correct_Z(GetTileSlope(tile, NULL));

   148

}

   149

   150

bool EnsureNoVehicleZ(TileIndex tile, byte z)

   151

{

   152

	TileInfo ti;

   153

   154

	ti.tile = tile;

   155

	ti.z = z + GetCorrectTileHeight(tile);

   156

   157

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

   158

}

   159

   160

Vehicle *FindVehicleOnTileZ(TileIndex tile, byte z)

   161

{

   162

	TileInfo ti;

   163

   164

	ti.tile = tile;

   165

	ti.z = z;

   166

   167

	return VehicleFromPos(tile, &ti, EnsureNoVehicleProcZ);

   168

}

   169

   170

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

   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

		intswap(x1,x2);

   181

		intswap(y1,y2);

   182

	}

   183

	FOR_ALL_VEHICLES(veh) {

   184

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

   185

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

   186

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

   187

				return veh;

   188

			}

   189

		}

   190

	}

   191

	return NULL;

   192

}

   193

   194

   195

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

   196

   197

void VehiclePositionChanged(Vehicle *v)

   198

{

   199

	int img = v->cur_image;

   200

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

   201

	const Sprite* spr = GetSprite(img);

   202

   203

	pt.x += spr->x_offs;

   204

	pt.y += spr->y_offs;

   205

   206

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

   207

   208

	v->left_coord = pt.x;

   209

	v->top_coord = pt.y;

   210

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

   211

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

   212

}

   213

   214

// Called after load to update coordinates

   215

void AfterLoadVehicles(void)

   216

{

   217

	Vehicle *v;

   218

   219

	FOR_ALL_VEHICLES(v) {

   220

		v->first = NULL;

   221

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

   222

			TrainConsistChanged(v);

   223

	}

   224

   225

	FOR_ALL_VEHICLES(v) {

   226

		if (v->type != 0) {

   227

			switch (v->type) {

   228

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

   229

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

   230

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

   231

				case VEH_Aircraft:

   232

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

   233

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

   234

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

   235

					}

   236

					break;

   237

				default: break;

   238

			}

   239

   240

			v->left_coord = INVALID_COORD;

   241

			VehiclePositionChanged(v);

   242

		}

   243

	}

   244

}

   245

   246

static Vehicle *InitializeVehicle(Vehicle *v)

   247

{

   248

	VehicleID index = v->index;

   249

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

   250

	v->index = index;

   251

   252

	assert(v->orders == NULL);

   253

   254

	v->left_coord = INVALID_COORD;

   255

	v->first = NULL;

   256

	v->next = NULL;

   257

	v->next_hash = INVALID_VEHICLE;

   258

	v->string_id = 0;

   259

	v->next_shared = NULL;

   260

	v->prev_shared = NULL;

   261

	v->depot_list  = NULL;

   262

	v->random_bits = 0;

   263

	return v;

   264

}

   265

   266

/**

   267

 * Get a value for a vehicle's random_bits.

   268

 * @return A random value from 0 to 255.

   269

 */

   270

byte VehicleRandomBits(void)

   271

{

   272

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

   273

}

   274

   275

Vehicle *ForceAllocateSpecialVehicle(void)

   276

{

   277

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

   278

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

   279

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

   280

	 * BLOCKS_FOR_SPECIAL_VEHICLES times block_size vehicles that may only

   281

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

   282

   283

	Vehicle *v;

   284

   285

	FOR_ALL_VEHICLES(v) {

   286

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

   287

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

   288

			return NULL;

   289

   290

		if (v->type == 0)

   291

			return InitializeVehicle(v);

   292

	}

   293

   294

	return NULL;

   295

}

   296

   297

/*

   298

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

   299

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

   300

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

   301

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

   302

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

   303

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

   304

 */

   305

static Vehicle *AllocateSingleVehicle(VehicleID *skip_vehicles)

   306

{

   307

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

   308

	 * first blocks */

   309

	Vehicle *v;

   310

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

   311

   312

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

   313

		FOR_ALL_VEHICLES_FROM(v, offset + *skip_vehicles) {

   314

			(*skip_vehicles)++;

   315

			if (v->type == 0)

   316

				return InitializeVehicle(v);

   317

		}

   318

	}

   319

   320

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

   321

	if (AddBlockToPool(&_vehicle_pool))

   322

		return AllocateSingleVehicle(skip_vehicles);

   323

   324

	return NULL;

   325

}

   326

   327

   328

Vehicle *AllocateVehicle(void)

   329

{

   330

	VehicleID counter = 0;

   331

	return AllocateSingleVehicle(&counter);

   332

}

   333

   334

   335

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

   336

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

   337

* @param num number of vehicles to allocate room for

   338

*	returns true if there is room to allocate all the vehicles

   339

*/

   340

bool AllocateVehicles(Vehicle **vl, int num)

   341

{

   342

	int i;

   343

	Vehicle *v;

   344

	VehicleID counter = 0;

   345

   346

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

   347

		v = AllocateSingleVehicle(&counter);

   348

		if (v == NULL) {

   349

			return false;

   350

		}

   351

		if (vl != NULL) {

   352

			vl[i] = v;

   353

		}

   354

	}

   355

   356

	return true;

   357

}

   358

   359

   360

static VehicleID _vehicle_position_hash[0x1000];

   361

   362

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

   363

{

   364

	int x,y,x2,y2;

   365

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

   366

   367

	x2 = ((pt.x + 104) & 0x1F80) >> 7;

   368

	x  = ((pt.x - 174) & 0x1F80) >> 7;

   369

   370

	y2 = ((pt.y + 56) & 0xFC0);

   371

	y  = ((pt.y - 294) & 0xFC0);

   372

   373

	for (;;) {

   374

		int xb = x;

   375

		for (;;) {

   376

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

   377

			while (veh != INVALID_VEHICLE) {

   378

				Vehicle *v = GetVehicle(veh);

   379

				void *a;

   380

   381

				a = proc(v, data);

   382

				if (a != NULL) return a;

   383

				veh = v->next_hash;

   384

			}

   385

   386

			if (x == x2)

   387

				break;

   388

   389

			x = (x + 1) & 0x3F;

   390

		}

   391

		x = xb;

   392

   393

		if (y == y2)

   394

			break;

   395

   396

		y = (y + 0x40) & ((0x3F) << 6);

   397

	}

   398

	return NULL;

   399

}

   400

   401

   402

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

   403

{

   404

	VehicleID *old_hash, *new_hash;

   405

	int old_x = v->left_coord;

   406

	int old_y = v->top_coord;

   407

	Vehicle *u;

   408

   409

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

   410

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

   411

   412

	if (old_hash == new_hash) return;

   413

   414

	/* remove from hash table? */

   415

	if (old_hash != NULL) {

   416

		Vehicle *last = NULL;

   417

		VehicleID idx = *old_hash;

   418

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

   419

			idx = u->next_hash;

   420

			assert(idx != INVALID_VEHICLE);

   421

			last = u;

   422

		}

   423

   424

		if (last == NULL) {

   425

			*old_hash = v->next_hash;

   426

		} else {

   427

			last->next_hash = v->next_hash;

   428

		}

   429

	}

   430

   431

	/* insert into hash table? */

   432

	if (new_hash != NULL) {

   433

		v->next_hash = *new_hash;

   434

		*new_hash = v->index;

   435

	}

   436

}

   437

   438

void InitializeVehicles(void)

   439

{

   440

	int i;

   441

   442

	/* Clean the vehicle pool, and reserve enough blocks

   443

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

   444

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

   445

	CleanPool(&_vehicle_pool);

   446

	AddBlockToPool(&_vehicle_pool);

   447

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

   448

		AddBlockToPool(&_vehicle_pool);

   449

   450

	// clear it...

   451

	memset(_vehicle_position_hash, -1, sizeof(_vehicle_position_hash));

   452

}

   453

   454

Vehicle *GetLastVehicleInChain(Vehicle *v)

   455

{

   456

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

   457

	return v;

   458

}

   459

   460

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

   461

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

   462

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

   463

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

   464

 * called by anything but GetFirstVehicleInChain

   465

 */

   466

static Vehicle *GetPrevVehicleInChain_bruteforce(const Vehicle *v)

   467

{

   468

	Vehicle *u;

   469

   470

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

   471

   472

	return NULL;

   473

}

   474

   475

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

   476

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

   477

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

   478

 */

   479

Vehicle *GetPrevVehicleInChain(const Vehicle *v)

   480

{

   481

	Vehicle *u;

   482

	assert(v != NULL);

   483

   484

	u = GetFirstVehicleInChain(v);

   485

   486

 	// Check to see if this is the first

   487

	if (v == u) return NULL;

   488

   489

	do {

   490

		if (u->next == v) return u;

   491

	} while ( ( u = u->next) != NULL);

   492

   493

	return NULL;

   494

}

   495

   496

/** Finds the first vehicle in a chain.