1

#include "stdafx.h"

     2

#include "ttd.h"

     3

#include "table/strings.h"

     4

#include "vehicle.h"

     5

#include "window.h"

     6

#include "engine.h"

     7

#include "gui.h"

     8

#include "command.h"

     9

#include "gfx.h"

    10

    11

VehicleSortListingTypeFunctions * const _vehicle_sorter[] = {

    12

	&VehicleUnsortedSorter,

    13

	&VehicleNumberSorter,

    14

	&VehicleNameSorter,

    15

	&VehicleAgeSorter,

    16

	&VehicleProfitThisYearSorter,

    17

	&VehicleProfitLastYearSorter,

    18

	&VehicleCargoSorter,

    19

	&VehicleReliabilitySorter,

    20

	&VehicleMaxSpeedSorter

    21

};

    22

    23

const StringID _vehicle_sort_listing[] = {

    24

	STR_SORT_BY_UNSORTED,

    25

	STR_SORT_BY_NUMBER,

    26

	STR_SORT_BY_DROPDOWN_NAME,

    27

	STR_SORT_BY_AGE,

    28

	STR_SORT_BY_PROFIT_THIS_YEAR,

    29

	STR_SORT_BY_PROFIT_LAST_YEAR,

    30

	STR_SORT_BY_TOTAL_CAPACITY_PER_CARGOTYPE,

    31

	STR_SORT_BY_RELIABILITY,

    32

	STR_SORT_BY_MAX_SPEED,

    33

	INVALID_STRING_ID

    34

};

    35

    36

const StringID _rail_types_list[] = {

    37

	STR_RAIL_VEHICLES,

    38

	STR_MONORAIL_VEHICLES,

    39

	STR_MAGLEV_VEHICLES,

    40

	INVALID_STRING_ID

    41

};

    42

    43

void RebuildVehicleLists(void)

    44

{

    45

	Window *w;

    46

    47

	for (w = _windows; w != _last_window; ++w)

    48

		switch (w->window_class) {

    49

			case WC_TRAINS_LIST:

    50

			case WC_ROADVEH_LIST:

    51

			case WC_SHIPS_LIST:

    52

			case WC_AIRCRAFT_LIST:

    53

				WP(w, vehiclelist_d).flags |= VL_REBUILD;

    54

				SetWindowDirty(w);

    55

				break;

    56

    57

			default:

    58

				break;

    59

		}

    60

}

    61

    62

void ResortVehicleLists(void)

    63

{

    64

	Window *w;

    65

    66

	for (w = _windows; w != _last_window; ++w)

    67

		switch (w->window_class) {

    68

			case WC_TRAINS_LIST:

    69

			case WC_ROADVEH_LIST:

    70

			case WC_SHIPS_LIST:

    71

			case WC_AIRCRAFT_LIST:

    72

				WP(w, vehiclelist_d).flags |= VL_RESORT;

    73

				SetWindowDirty(w);

    74

				break;

    75

    76

			default:

    77

				break;

    78

		}

    79

}

    80

    81

void BuildVehicleList(vehiclelist_d *vl, int type, int owner, int station)

    82

{

    83

	SortStruct sort_list[NUM_NORMAL_VEHICLES];

    84

	int subtype = (type != VEH_Aircraft) ? 0 : 2;

    85

	int n = 0;

    86

	int i;

    87

    88

	if (!(vl->flags & VL_REBUILD)) return;

    89

    90

	DEBUG(misc, 1) ("Building vehicle list for player %d station %d...",

    91

		owner, station);

    92

    93

	if (station != -1) {

    94

		const Vehicle *v;

    95

		FOR_ALL_VEHICLES(v) {

    96

			if (v->type == type && v->subtype <= subtype) {

    97

				const Order *ord;

    98

				for (ord = v->schedule_ptr; ord->type != OT_NOTHING; ++ord)

    99

					if (ord->type == OT_GOTO_STATION && ord->station == station) {

   100

						sort_list[n].index = v - _vehicles;

   101

						sort_list[n].owner = v->owner;

   102

						++n;

   103

						break;

   104

					}

   105

			}

   106

		}

   107

	} else {

   108

		const Vehicle *v;

   109

		FOR_ALL_VEHICLES(v) {

   110

			if (v->type == type && v->subtype <= subtype && v->owner == owner) {

   111

				sort_list[n].index = v - _vehicles;

   112

				sort_list[n].owner = v->owner;

   113

				++n;

   114

			}

   115

		}

   116

	}

   117

   118

	vl->sort_list = realloc(vl->sort_list, n * sizeof(vl->sort_list[0])); /* XXX unchecked malloc */

   119

	vl->list_length = n;

   120

   121

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

   122

		vl->sort_list[i] = sort_list[i];

   123

   124

	vl->flags &= ~VL_REBUILD;

   125

	vl->flags |= VL_RESORT;

   126

}

   127

   128

void SortVehicleList(vehiclelist_d *vl)

   129

{

   130

	if (!(vl->flags & VL_RESORT)) return;

   131

   132

	_internal_sort_order = vl->flags & VL_DESC;

   133

	_internal_name_sorter_id = STR_SV_TRAIN_NAME;

   134

	_last_vehicle_idx = 0; // used for "cache" in namesorting

   135

	qsort(vl->sort_list, vl->list_length, sizeof(vl->sort_list[0]),

   136

		_vehicle_sorter[vl->sort_type]);

   137

   138

	vl->resort_timer = DAY_TICKS * PERIODIC_RESORT_DAYS;

   139

	vl->flags &= ~VL_RESORT;

   140

}

   141

   142

   143

/* General Vehicle GUI based procedures that are independent of vehicle types */

   144

void InitializeVehiclesGuiList()

   145

{

   146

}

   147

   148

// draw the vehicle profit button in the vehicle list window.

   149

void DrawVehicleProfitButton(Vehicle *v, int x, int y)

   150

{

   151

	uint32 ormod;

   152

   153

	// draw profit-based colored icons

   154

	if(v->age <= 365 * 2)

   155

		ormod = 0x3158000; // grey

   156

	else if(v->profit_last_year < 0)

   157

		ormod = 0x30b8000; //red

   158

	else if(v->profit_last_year < 10000)

   159

		ormod = 0x30a8000; // yellow

   160

	else

   161

		ormod = 0x30d8000; // green

   162

	DrawSprite((SPR_BLOT) | ormod, x, y);

   163

}

   164

   165

/************ Sorter functions *****************/

   166

int CDECL GeneralOwnerSorter(const void *a, const void *b)

   167

{

   168

	return (*(const SortStruct*)a).owner - (*(const SortStruct*)b).owner;

   169

}

   170

   171

/* Variables you need to set before calling this function!

   172

* 1. (byte)_internal_sort_type:					sorting criteria to sort on

   173

* 2. (bool)_internal_sort_order:				sorting order, descending/ascending

   174

* 3. (uint32)_internal_name_sorter_id:	default StringID of the vehicle when no name is set. eg

   175

*    STR_SV_TRAIN_NAME for trains or STR_SV_AIRCRAFT_NAME for aircraft

   176

*/

   177

int CDECL VehicleUnsortedSorter(const void *a, const void *b)

   178

{

   179

	return DEREF_VEHICLE((*(const SortStruct*)a).index)->index - DEREF_VEHICLE((*(const SortStruct*)b).index)->index;

   180

}

   181

   182

// if the sorting criteria had the same value, sort vehicle by unitnumber

   183

#define VEHICLEUNITNUMBERSORTER(r, a, b) {if (r == 0) {r = a->unitnumber - b->unitnumber;}}

   184

   185

int CDECL VehicleNumberSorter(const void *a, const void *b)

   186

{

   187

	const Vehicle *va = DEREF_VEHICLE((*(const SortStruct*)a).index);

   188

	const Vehicle *vb = DEREF_VEHICLE((*(const SortStruct*)b).index);

   189

	int r = va->unitnumber - vb->unitnumber;

   190

   191

	return (_internal_sort_order & 1) ? -r : r;

   192

}

   193

   194

static char _bufcache[64];	// used together with _last_vehicle_idx to hopefully speed up stringsorting

   195

int CDECL VehicleNameSorter(const void *a, const void *b)

   196

{

   197

	const SortStruct *cmp1 = (const SortStruct*)a;

   198

	const SortStruct *cmp2 = (const SortStruct*)b;

   199

	const Vehicle *va = DEREF_VEHICLE(cmp1->index);

   200

	const Vehicle *vb = DEREF_VEHICLE(cmp2->index);

   201

	char buf1[64] = "\0";

   202

	int r;

   203

   204

	if (va->string_id != _internal_name_sorter_id) {

   205

		SetDParam(0, va->string_id);

   206

		GetString(buf1, STR_0315);

   207

	}

   208

   209

	if ( cmp2->index != _last_vehicle_idx) {

   210

		_last_vehicle_idx = cmp2->index;

   211

		_bufcache[0] = '\0';

   212

		if (vb->string_id != _internal_name_sorter_id) {

   213

			SetDParam(0, vb->string_id);

   214

			GetString(_bufcache, STR_0315);

   215

		}

   216

	}

   217

   218

	r =  strcmp(buf1, _bufcache);	// sort by name

   219

   220

	VEHICLEUNITNUMBERSORTER(r, va, vb);

   221

   222

	return (_internal_sort_order & 1) ? -r : r;

   223

}

   224

   225

int CDECL VehicleAgeSorter(const void *a, const void *b)

   226

{

   227

	const Vehicle *va = DEREF_VEHICLE((*(const SortStruct*)a).index);

   228

	const Vehicle *vb = DEREF_VEHICLE((*(const SortStruct*)b).index);

   229

	int r = va->age - vb->age;

   230

   231

	VEHICLEUNITNUMBERSORTER(r, va, vb);

   232

   233

	return (_internal_sort_order & 1) ? -r : r;

   234

}

   235

   236

int CDECL VehicleProfitThisYearSorter(const void *a, const void *b)

   237

{

   238

	const Vehicle *va = DEREF_VEHICLE((*(const SortStruct*)a).index);

   239

	const Vehicle *vb = DEREF_VEHICLE((*(const SortStruct*)b).index);

   240

	int r = va->profit_this_year - vb->profit_this_year;

   241

   242

	VEHICLEUNITNUMBERSORTER(r, va, vb);

   243

   244

	return (_internal_sort_order & 1) ? -r : r;

   245

}

   246

   247

int CDECL VehicleProfitLastYearSorter(const void *a, const void *b)

   248

{

   249

	const Vehicle *va = DEREF_VEHICLE((*(const SortStruct*)a).index);

   250

	const Vehicle *vb = DEREF_VEHICLE((*(const SortStruct*)b).index);

   251

	int r = va->profit_last_year - vb->profit_last_year;

   252

   253

	VEHICLEUNITNUMBERSORTER(r, va, vb);

   254

   255

	return (_internal_sort_order & 1) ? -r : r;

   256

}

   257

   258

int CDECL VehicleCargoSorter(const void *a, const void *b)

   259

{

   260

	const Vehicle *va = DEREF_VEHICLE((*(const SortStruct*)a).index);

   261

	const Vehicle *vb = DEREF_VEHICLE((*(const SortStruct*)b).index);

   262

	const Vehicle *v;

   263

	int r = 0;

   264

	int i;

   265

	uint _cargo_counta[NUM_CARGO];

   266

	uint _cargo_countb[NUM_CARGO];

   267

	memset(_cargo_counta, 0, sizeof(_cargo_counta));

   268

	memset(_cargo_countb, 0, sizeof(_cargo_countb));

   269

   270

	for (v = va; v != NULL; v = v->next)

   271

		_cargo_counta[v->cargo_type] += v->cargo_cap;

   272

   273

	for (v = vb; v != NULL; v = v->next)

   274

		_cargo_countb[v->cargo_type] += v->cargo_cap;

   275

   276

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

   277

		r = _cargo_counta[i] - _cargo_countb[i];

   278

		if (r != 0)

   279

			break;

   280

	}

   281

   282

	VEHICLEUNITNUMBERSORTER(r, va, vb);

   283

   284

	return (_internal_sort_order & 1) ? -r : r;

   285

}

   286

   287

int CDECL VehicleReliabilitySorter(const void *a, const void *b)

   288

{

   289

	const Vehicle *va = DEREF_VEHICLE((*(const SortStruct*)a).index);

   290

	const Vehicle *vb = DEREF_VEHICLE((*(const SortStruct*)b).index);

   291

	int r = va->reliability - vb->reliability;

   292

   293

	VEHICLEUNITNUMBERSORTER(r, va, vb);

   294

   295

	return (_internal_sort_order & 1) ? -r : r;

   296

}

   297

   298

int CDECL VehicleMaxSpeedSorter(const void *a, const void *b)

   299

{

   300

	const Vehicle *va = DEREF_VEHICLE((*(const SortStruct*)a).index);

   301

	const Vehicle *vb = DEREF_VEHICLE((*(const SortStruct*)b).index);

   302

	int r = va->max_speed - vb->max_speed;

   303

   304

	VEHICLEUNITNUMBERSORTER(r, va, vb);

   305

   306

	return (_internal_sort_order & 1) ? -r : r;

   307

}

   308

   309

// this define is to match engine.c, but engine.c keeps it to itself

   310

// ENGINE_AVAILABLE is used in ReplaceVehicleWndProc

   311

#define ENGINE_AVAILABLE ((e->flags & 1 && HASBIT(info->railtype_climates, _opt.landscape)) || HASBIT(e->player_avail, _local_player))

   312

   313

/*  if show_outdated is selected, it do not sort psudo engines properly but it draws all engines

   314

 *	if used compined with show_cars set to false, it will work as intended. Replace window do it like that

   315

 *  this was a big hack even before show_outdated was added. Stupid newgrf :p										*/

   316

static void train_engine_drawing_loop(int *x, int *y, int *pos, int *sel, int *selected_id, byte railtype,

   317

	uint8 lines_drawn, bool is_engine, bool show_cars, bool show_outdated)

   318

{

   319

	int i;

   320

	byte colour;

   321

   322

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

   323

		const Engine *e = DEREF_ENGINE(i);

   324

		const RailVehicleInfo *rvi = RailVehInfo(i);

   325

		const EngineInfo *info = &_engine_info[i];

   326

   327

		if ( rvi->power == 0 && !(show_cars) )   // disables display of cars (works since they do not have power)

   328

			continue;

   329

   330

		if (*sel == 0) *selected_id = i;

   331

   332

   333

		colour = *sel == 0 ? 0xC : 0x10;

   334

		if (!(ENGINE_AVAILABLE && show_outdated && RailVehInfo(i)->power && e->railtype == railtype)) {

   335

			if (e->railtype != railtype || !(rvi->flags & RVI_WAGON) != is_engine ||

   336

				!HASBIT(e->player_avail, _local_player))

   337

				continue;

   338

		} /*else {

   339

		// TODO find a nice red colour for vehicles being replaced

   340

			if ( _autoreplace_array[i] != i )

   341

				colour = *sel == 0 ? 0x44 : 0x45;

   342

		} */

   343

   344

		if (IS_INT_INSIDE(--*pos, -lines_drawn, 0)) {

   345

			DrawString(*x + 59, *y + 2, GetCustomEngineName(i),

   346

				colour);

   347

			DrawTrainEngine(*x + 29, *y + 6, i,

   348

				SPRITE_PALETTE(PLAYER_SPRITE_COLOR(_local_player)));

   349

			*y += 14;

   350

		}

   351

		--*sel;

   352

	}

   353

}

   354

   355

   356

static void SetupScrollStuffForReplaceWindow(Window *w)

   357

{

   358

	byte railtype;

   359

	int selected_id[2] = {-1,-1};

   360

	int sel[2] = { WP(w,replaceveh_d).sel_index[0], WP(w,replaceveh_d).sel_index[1]};

   361

	int count = 0;

   362

	int count2 = 0;

   363

	int engine_id;

   364

   365

	switch (WP(w,replaceveh_d).vehicletype) {

   366

		case VEH_Train: {

   367

			railtype = WP(w,replaceveh_d).railtype;

   368

			w->widget[13].color = _player_colors[_local_player];	// sets the colour of that art thing

   369

			w->widget[16].color = _player_colors[_local_player];	// sets the colour of that art thing

   370

			for (engine_id = 0; engine_id < NUM_TRAIN_ENGINES; engine_id++) {

   371

				const Engine *e = DEREF_ENGINE(engine_id);

   372

				const EngineInfo *info = &_engine_info[engine_id];

   373

   374

				if (ENGINE_AVAILABLE && RailVehInfo(engine_id)->power && e->railtype == railtype) {

   375

					count++;

   376

					if (sel[0]==0)  selected_id[0] = engine_id;

   377

					sel[0]--;

   378

					if (HASBIT(e->player_avail, _local_player)) {

   379

						if (sel[1]==0)  selected_id[1] = engine_id;

   380

							count2++;

   381

							sel[1]--;

   382

						}

   383

					}

   384

				}

   385

			break;

   386

			}

   387

		case VEH_Road: {

   388

			int num = NUM_ROAD_ENGINES;

   389

			Engine *e = &_engines[ROAD_ENGINES_INDEX];

   390

			byte cargo;

   391

			EngineInfo *info;

   392

			engine_id = ROAD_ENGINES_INDEX;

   393

   394

			do {

   395

				info = &_engine_info[engine_id];

   396

				if (ENGINE_AVAILABLE) {

   397

					if (sel[0]==0)  selected_id[0] = engine_id;

   398

					count++;

   399

					sel[0]--;

   400

				}

   401

			} while (++engine_id,++e,--num);

   402

   403

			if ( selected_id[0] != -1 ) {   // only draw right array if we have anything in the left one

   404

				num = NUM_ROAD_ENGINES;

   405

				engine_id = ROAD_ENGINES_INDEX;

   406

				e = &_engines[ROAD_ENGINES_INDEX];

   407

				cargo = RoadVehInfo(selected_id[0])->cargo_type;

   408

   409

				do {

   410

					if ( cargo == RoadVehInfo(engine_id)->cargo_type && HASBIT(e->player_avail, _local_player)) {

   411

						count2++;

   412

						if (sel[1]==0)  selected_id[1] = engine_id;

   413

						sel[1]--;

   414

					}

   415

				} while (++engine_id,++e,--num);

   416

			}

   417

			break;

   418

		}

   419

   420

		case VEH_Ship: {

   421

			int num = NUM_SHIP_ENGINES;

   422

			Engine *e = &_engines[SHIP_ENGINES_INDEX];

   423

			byte cargo, refittable;

   424

			EngineInfo *info;

   425

			engine_id = SHIP_ENGINES_INDEX;

   426

   427

			do {

   428

				info = &_engine_info[engine_id];

   429

				if (ENGINE_AVAILABLE) {

   430

					if ( sel[0] == 0 )  selected_id[0] = engine_id;

   431

					count++;

   432

					sel[0]--;

   433

				}

   434

			} while (++engine_id,++e,--num);

   435

   436

			if ( selected_id[0] != -1 ) {

   437

				num = NUM_SHIP_ENGINES;

   438

				e = &_engines[SHIP_ENGINES_INDEX];

   439

				engine_id = SHIP_ENGINES_INDEX;

   440

				cargo = ShipVehInfo(selected_id[0])->cargo_type;

   441

				refittable = ShipVehInfo(selected_id[0])->refittable;

   442

   443

				do {

   444

					if (HASBIT(e->player_avail, _local_player)

   445

					&& ( cargo == ShipVehInfo(engine_id)->cargo_type || refittable & ShipVehInfo(engine_id)->refittable)) {

   446

   447

						if ( sel[1]==0)  selected_id[1] = engine_id;

   448

						sel[1]--;

   449

						count2++;

   450

					}

   451

				} while (++engine_id,++e,--num);

   452

			}

   453

			break;

   454

		}   //end of ship

   455

   456

		case VEH_Aircraft:{

   457

			int num = NUM_AIRCRAFT_ENGINES;

   458

			byte subtype;

   459

			Engine *e = &_engines[AIRCRAFT_ENGINES_INDEX];

   460

			EngineInfo *info;

   461

			engine_id = AIRCRAFT_ENGINES_INDEX;

   462

   463

			do {

   464

				info = &_engine_info[engine_id];

   465

				if (ENGINE_AVAILABLE) {

   466

					count++;

   467

					if (sel[0]==0)  selected_id[0] = engine_id;

   468

					sel[0]--;

   469

				}

   470

			} while (++engine_id,++e,--num);

   471

   472

			if ( selected_id[0] != -1 ) {

   473

				num = NUM_AIRCRAFT_ENGINES;

   474

				e = &_engines[AIRCRAFT_ENGINES_INDEX];

   475

				subtype = AircraftVehInfo(selected_id[0])->subtype;

   476

				engine_id = AIRCRAFT_ENGINES_INDEX;

   477

				do {

   478

					if (HASBIT(e->player_avail, _local_player)) {

   479

						if ( (subtype && AircraftVehInfo(engine_id)->subtype) || (!(subtype) && !AircraftVehInfo(engine_id)->subtype) ) {

   480

							count2++;

   481

							if (sel[1]==0)  selected_id[1] = engine_id;

   482

							sel[1]--;

   483

						}

   484

					}

   485

				} while (++engine_id,++e,--num);

   486

			}

   487

			break;

   488

		}

   489

	}

   490

	// sets up the number of items in each list

   491

	SetVScrollCount(w, count);

   492

	SetVScroll2Count(w, count2);

   493

	WP(w,replaceveh_d).sel_engine[0] = selected_id[0];