1

/* $Id$ */

     2

     4

     5

#include "stdafx.h"

     6

#include "openttd.h"

     7

#include "currency.h"

     8

#include "landscape.h"

     9

#include "player_base.h"

    10

#include "player_func.h"

    11

#include "command_func.h"

    12

#include "saveload.h"

    13

#include "industry.h"

    14

#include "town.h"

    15

#include "news_func.h"

    16

#include "network/network.h"

    17

#include "network/network_data.h"

    18

#include "variables.h"

    19

#include "vehicle_gui.h"

    20

#include "ai/ai.h"

    21

#include "train.h"

    22

#include "roadveh.h"

    23

#include "aircraft.h"

    24

#include "newgrf_engine.h"

    25

#include "newgrf_sound.h"

    26

#include "newgrf_callbacks.h"

    27

#include "newgrf_industries.h"

    28

#include "newgrf_industrytiles.h"

    29

#include "newgrf_station.h"

    30

#include "unmovable.h"

    31

#include "cargotype.h"

    32

#include "player_face.h"

    33

#include "group.h"

    34

#include "strings_func.h"

    35

#include "tile_cmd.h"

    36

#include "functions.h"

    37

#include "window_func.h"

    38

#include "date_func.h"

    39

#include "vehicle_func.h"

    40

#include "sound_func.h"

    41

#include "track_type.h"

    42

#include "track_func.h"

    43

#include "road_func.h"

    44

#include "rail_map.h"

    45

#include "signal_func.h"

    46

#include "gfx_func.h"

    47

#include "autoreplace_func.h"

    48

    49

#include "table/strings.h"

    50

#include "table/sprites.h"

    51

    52

/**

    53

 * Multiply two integer values and shift the results to right.

    54

 *

    55

 * This function multiplies two integer values. The result is

    56

 * shifted by the amount of shift to right.

    57

 *

    58

 * @param a The first integer

    59

 * @param b The second integer

    60

 * @param shift The amount to shift the value to right.

    61

 * @return The shifted result

    62

 */

    63

static inline int32 BigMulS(const int32 a, const int32 b, const uint8 shift)

    64

{

    65

	return (int32)((int64)a * (int64)b >> shift);

    66

}

    67

    68

/**

    69

 * Multiply two unsigned integers and shift the results to right.

    70

 *

    71

 * This function multiplies two unsigned integers. The result is

    72

 * shifted by the amount of shift to right.

    73

 *

    74

 * @param a The first unsigned integer

    75

 * @param b The second unsigned integer

    76

 * @param shift The amount to shift the value to right.

    77

 * @return The shifted result

    78

 */

    79

static inline uint32 BigMulSU(const uint32 a, const uint32 b, const uint8 shift)

    80

{

    81

	return (uint32)((uint64)a * (uint64)b >> shift);

    82

}

    83

    84

/* Score info */

    85

const ScoreInfo _score_info[] = {

    86

	{ SCORE_VEHICLES,        120, 100 },

    87

	{ SCORE_STATIONS,         80, 100 },

    88

	{ SCORE_MIN_PROFIT,    10000, 100 },

    89

	{ SCORE_MIN_INCOME,    50000,  50 },

    90

	{ SCORE_MAX_INCOME,   100000, 100 },

    91

	{ SCORE_DELIVERED,     40000, 400 },

    92

	{ SCORE_CARGO,             8,  50 },

    93

	{ SCORE_MONEY,      10000000,  50 },

    94

	{ SCORE_LOAN,         250000,  50 },

    95

	{ SCORE_TOTAL,             0,   0 }

    96

};

    97

    98

int _score_part[MAX_PLAYERS][SCORE_END];

    99

Economy _economy;

   100

Subsidy _subsidies[MAX_PLAYERS];

   101

Prices _price;

   102

uint16 _price_frac[NUM_PRICES];

   103

Money  _cargo_payment_rates[NUM_CARGO];

   104

uint16 _cargo_payment_rates_frac[NUM_CARGO];

   105

Money _additional_cash_required;

   106

   107

Money CalculateCompanyValue(const Player* p)

   108

{

   109

	PlayerID owner = p->index;

   110

	Money value = 0;

   111

   112

	Station *st;

   113

	uint num = 0;

   114

   115

	FOR_ALL_STATIONS(st) {

   116

		if (st->owner == owner) num += CountBits(st->facilities);

   117

	}

   118

   119

	value += num * _price.station_value * 25;

   120

   121

	Vehicle *v;

   122

	FOR_ALL_VEHICLES(v) {

   123

		if (v->owner != owner) continue;

   124

   125

		if (v->type == VEH_TRAIN ||

   126

				v->type == VEH_ROAD ||

   127

				(v->type == VEH_AIRCRAFT && IsNormalAircraft(v)) ||

   128

				v->type == VEH_SHIP) {

   129

			value += v->value * 3 >> 1;

   130

		}

   131

	}

   132

   133

	/* Add real money value */

   134

	value -= p->current_loan;

   135

	value += p->player_money;

   136

   137

	return max(value, (Money)1);

   138

}

   139

   140

/** if update is set to true, the economy is updated with this score

   141

 *  (also the house is updated, should only be true in the on-tick event)

   142

 * @param update the economy with calculated score

   143

 * @param p player been evaluated

   144

 * @return actual score of this player

   145

 * */

   146

int UpdateCompanyRatingAndValue(Player *p, bool update)

   147

{

   148

	byte owner = p->index;

   149

	int score = 0;

   150

   151

	memset(_score_part[owner], 0, sizeof(_score_part[owner]));

   152

   153

/* Count vehicles */

   154

	{

   155

		Vehicle *v;

   156

		Money min_profit = 0;

   157

		bool min_profit_first = true;

   158

		uint num = 0;

   159

   160

		FOR_ALL_VEHICLES(v) {

   161

			if (v->owner != owner) continue;

   162

			if (IsPlayerBuildableVehicleType(v->type) && v->IsPrimaryVehicle()) {

   163

				num++;

   164

				if (v->age > 730) {

   165

					/* Find the vehicle with the lowest amount of profit */

   166

					if (min_profit_first || min_profit > v->profit_last_year) {

   167

						min_profit = v->profit_last_year;

   168

						min_profit_first = false;

   169

					}

   170

				}

   171

			}

   172

		}

   173

   174

		min_profit >>= 8; // remove the fract part

   175

   176

		_score_part[owner][SCORE_VEHICLES] = num;

   177

		/* Don't allow negative min_profit to show */

   178

		if (min_profit > 0)

   179

			_score_part[owner][SCORE_MIN_PROFIT] = ClampToI32(min_profit);

   180

	}

   181

   182

/* Count stations */

   183

	{

   184

		uint num = 0;

   185

		const Station* st;

   186

   187

		FOR_ALL_STATIONS(st) {

   188

			if (st->owner == owner) num += CountBits(st->facilities);

   189

		}

   190

		_score_part[owner][SCORE_STATIONS] = num;

   191

	}

   192

   193

/* Generate statistics depending on recent income statistics */

   194

	{

   195

		int numec = min(p->num_valid_stat_ent, 12);

   196

		if (numec != 0) {

   197

			const PlayerEconomyEntry *pee = p->old_economy;

   198

			Money min_income = pee->income + pee->expenses;

   199

			Money max_income = pee->income + pee->expenses;

   200

   201

			do {

   202

				min_income = min(min_income, pee->income + pee->expenses);

   203

				max_income = max(max_income, pee->income + pee->expenses);

   204

			} while (++pee,--numec);

   205

   206

			if (min_income > 0)

   207

				_score_part[owner][SCORE_MIN_INCOME] = ClampToI32(min_income);

   208

   209

			_score_part[owner][SCORE_MAX_INCOME] = ClampToI32(max_income);

   210

		}

   211

	}

   212

   213

/* Generate score depending on amount of transported cargo */

   214

	{

   215

		const PlayerEconomyEntry* pee;

   216

		int numec;

   217

		uint32 total_delivered;

   218

   219

		numec = min(p->num_valid_stat_ent, 4);

   220

		if (numec != 0) {

   221

			pee = p->old_economy;

   222

			total_delivered = 0;

   223

			do {

   224

				total_delivered += pee->delivered_cargo;

   225

			} while (++pee,--numec);

   226

   227

			_score_part[owner][SCORE_DELIVERED] = total_delivered;

   228

		}

   229

	}

   230

   231

/* Generate score for variety of cargo */

   232

	{

   233

		uint num = CountBits(p->cargo_types);

   234

		_score_part[owner][SCORE_CARGO] = num;

   235

		if (update) p->cargo_types = 0;

   236

	}

   237

   238

/* Generate score for player money */

   239

	{

   240

		if (p->player_money > 0) {

   241

			_score_part[owner][SCORE_MONEY] = ClampToI32(p->player_money);

   242

		}

   243

	}

   244

   245

/* Generate score for loan */

   246

	{

   247

		_score_part[owner][SCORE_LOAN] = ClampToI32(_score_info[SCORE_LOAN].needed - p->current_loan);

   248

	}

   249

   250

	/* Now we calculate the score for each item.. */

   251

	{

   252

		int total_score = 0;

   253

		int s;

   254

		score = 0;

   255

		for (ScoreID i = SCORE_BEGIN; i < SCORE_END; i++) {

   256

			/* Skip the total */

   257

			if (i == SCORE_TOTAL) continue;

   258

			/*  Check the score */

   259

			s = Clamp(_score_part[owner][i], 0, _score_info[i].needed) * _score_info[i].score / _score_info[i].needed;

   260

			score += s;

   261

			total_score += _score_info[i].score;

   262

		}

   263

   264

		_score_part[owner][SCORE_TOTAL] = score;

   265

   266

		/*  We always want the score scaled to SCORE_MAX (1000) */

   267

		if (total_score != SCORE_MAX) score = score * SCORE_MAX / total_score;

   268

	}

   269

   270

	if (update) {

   271

		p->old_economy[0].performance_history = score;

   272

		UpdateCompanyHQ(p, score);

   273

		p->old_economy[0].company_value = CalculateCompanyValue(p);

   274

	}

   275

   276

	InvalidateWindow(WC_PERFORMANCE_DETAIL, 0);

   277

	return score;

   278

}

   279

   280

/*  use PLAYER_SPECTATOR as new_player to delete the player. */

   281

void ChangeOwnershipOfPlayerItems(PlayerID old_player, PlayerID new_player)

   282

{

   283

	Town *t;

   284

	PlayerID old = _current_player;

   285

   286

	assert(old_player != new_player);

   287

   288

	{

   289

		Player *p;

   290

		uint i;

   291

   292

		/* See if the old_player had shares in other companies */

   293

		_current_player = old_player;

   294

		FOR_ALL_PLAYERS(p) {

   295

			if (!p->is_active) continue;

   296

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

   297

				if (p->share_owners[i] == old_player) {

   298

					/* Sell his shares */

   299

					CommandCost res = DoCommand(0, p->index, 0, DC_EXEC, CMD_SELL_SHARE_IN_COMPANY);

   300

					/* Because we are in a DoCommand, we can't just execute an other one and

   301

					 *  expect the money to be removed. We need to do it ourself! */

   302

					SubtractMoneyFromPlayer(res);

   303

				}

   304

			}

   305

		}

   306

   307

		/* Sell all the shares that people have on this company */

   308

		p = GetPlayer(old_player);

   309

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

   310

			_current_player = p->share_owners[i];

   311

			if (_current_player != PLAYER_SPECTATOR) {

   312

				/* Sell the shares */

   313

				CommandCost res = DoCommand(0, old_player, 0, DC_EXEC, CMD_SELL_SHARE_IN_COMPANY);

   314

				/* Because we are in a DoCommand, we can't just execute an other one and

   315

				 *  expect the money to be removed. We need to do it ourself! */

   316

				SubtractMoneyFromPlayer(res);

   317

			}

   318

		}

   319

	}

   320

   321

	_current_player = old_player;

   322

   323

	/* Temporarily increase the player's money, to be sure that

   324

	 * removing his/her property doesn't fail because of lack of money.

   325

	 * Not too drastically though, because it could overflow */

   326

	if (new_player == PLAYER_SPECTATOR) {

   327

		GetPlayer(old_player)->player_money = MAX_UVALUE(uint64) >> 2; // jackpot ;p

   328

	}

   329

   330

	if (new_player == PLAYER_SPECTATOR) {

   331

		Subsidy *s;

   332

   333

		for (s = _subsidies; s != endof(_subsidies); s++) {

   334

			if (s->cargo_type != CT_INVALID && s->age >= 12) {

   335

				if (GetStation(s->to)->owner == old_player) s->cargo_type = CT_INVALID;

   336

			}

   337

		}

   338

	}

   339

   340

	/* Take care of rating in towns */

   341

	FOR_ALL_TOWNS(t) {

   342

		/* If a player takes over, give the ratings to that player. */

   343

		if (new_player != PLAYER_SPECTATOR) {

   344

			if (HasBit(t->have_ratings, old_player)) {

   345

				if (HasBit(t->have_ratings, new_player)) {

   346

					// use max of the two ratings.

   347

					t->ratings[new_player] = max(t->ratings[new_player], t->ratings[old_player]);

   348

				} else {

   349

					SetBit(t->have_ratings, new_player);

   350

					t->ratings[new_player] = t->ratings[old_player];

   351

				}

   352

			}

   353

		}

   354

   355

		/* Reset the ratings for the old player */

   356

		t->ratings[old_player] = RATING_INITIAL;

   357

		ClrBit(t->have_ratings, old_player);

   358

	}

   359

   360

	{

   361

		int num_train = 0;

   362

		int num_road = 0;

   363

		int num_ship = 0;

   364

		int num_aircraft = 0;

   365

		Vehicle *v;

   366

   367

		/*  Determine Ids for the new vehicles */

   368

		FOR_ALL_VEHICLES(v) {

   369

			if (v->owner == new_player) {

   370

				switch (v->type) {

   371

					case VEH_TRAIN:    if (IsFrontEngine(v)) num_train++; break;

   372

					case VEH_ROAD:     if (IsRoadVehFront(v)) num_road++; break;

   373

					case VEH_SHIP:     num_ship++; break;

   374

					case VEH_AIRCRAFT: if (IsNormalAircraft(v)) num_aircraft++; break;

   375

					default: break;

   376

				}

   377

			}

   378

		}

   379

   380

		FOR_ALL_VEHICLES(v) {

   381

			if (v->owner == old_player && IsInsideMM(v->type, VEH_TRAIN, VEH_AIRCRAFT + 1)) {

   382

				if (new_player == PLAYER_SPECTATOR) {

   383

					DeleteWindowById(WC_VEHICLE_VIEW, v->index);

   384

					DeleteWindowById(WC_VEHICLE_DETAILS, v->index);

   385

					DeleteWindowById(WC_VEHICLE_ORDERS, v->index);

   386

   387

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

   388

						switch (v->type) {

   389

							default: NOT_REACHED();

   390

   391

							case VEH_TRAIN: {

   392

								Vehicle *u = v;

   393

								do {

   394

									Vehicle *next = GetNextVehicle(u);

   395

									delete u;

   396

									u = next;

   397

								} while (u != NULL);

   398

							} break;

   399

   400

							case VEH_ROAD:

   401

							case VEH_SHIP:

   402

								delete v;

   403

								break;

   404

   405

							case VEH_AIRCRAFT:

   406

								DeleteVehicleChain(v);

   407

								break;

   408

						}

   409

					}

   410

				} else {

   411

					v->owner = new_player;

   412

					v->colormap = PAL_NONE;

   413

					v->group_id = DEFAULT_GROUP;

   414

					if (IsEngineCountable(v)) GetPlayer(new_player)->num_engines[v->engine_type]++;

   415

					switch (v->type) {

   416

						case VEH_TRAIN:    if (IsFrontEngine(v)) v->unitnumber = ++num_train; break;

   417

						case VEH_ROAD:     if (IsRoadVehFront(v)) v->unitnumber = ++num_road; break;

   418

						case VEH_SHIP:     v->unitnumber = ++num_ship; break;

   419

						case VEH_AIRCRAFT: if (IsNormalAircraft(v)) v->unitnumber = ++num_aircraft; break;

   420

						default: NOT_REACHED();

   421

					}

   422

				}

   423

			}

   424

		}

   425

	}

   426

   427

	/*  Change ownership of tiles */

   428

	{

   429

		TileIndex tile = 0;

   430

		do {

   431

			ChangeTileOwner(tile, old_player, new_player);

   432

		} while (++tile != MapSize());

   433

   434

		if (new_player != PLAYER_SPECTATOR) {

   435

			/* Update all signals because there can be new segment that was owned by two players

   436

			 * and signals were not propagated

   437

			 * Similiar with crossings - it is needed to bar crossings that weren't before

   438

			 * because of different owner of crossing and approaching train */

   439

			tile = 0;

   440

   441

			do {

   442

				if (IsTileType(tile, MP_RAILWAY) && IsTileOwner(tile, new_player) && HasSignals(tile)) {

   443

					TrackBits tracks = GetTrackBits(tile);

   444

					do { // there may be two tracks with signals for TRACK_BIT_HORZ and TRACK_BIT_VERT

   445

						Track track = RemoveFirstTrack(&tracks);

   446

						if (HasSignalOnTrack(tile, track)) AddTrackToSignalBuffer(tile, track, new_player);

   447

					} while (tracks != TRACK_BIT_NONE);

   448

				} else if (IsLevelCrossingTile(tile) && IsTileOwner(tile, new_player)) {

   449

					UpdateLevelCrossing(tile);

   450

				}

   451

			} while (++tile != MapSize());

   452

		}

   453

   454

		/* update signals in buffer */

   455

		UpdateSignalsInBuffer();

   456

	}

   457

   458

	/* In all cases clear replace engine rules.

   459

	 * Even if it was copied, it could interfere with new owner's rules */

   460

	RemoveAllEngineReplacementForPlayer(GetPlayer(old_player));

   461

   462

	if (new_player == PLAYER_SPECTATOR) {

   463

		RemoveAllGroupsForPlayer(old_player);

   464

	} else {

   465

		Group *g;

   466

		FOR_ALL_GROUPS(g) {

   467

			if (g->owner == old_player) g->owner = new_player;

   468

		}

   469

	}

   470

   471

	/* Change color of existing windows */

   472

	if (new_player != PLAYER_SPECTATOR) ChangeWindowOwner(old_player, new_player);

   473

   474

	_current_player = old;

   475

   476

	MarkWholeScreenDirty();

   477

}

   478

   479

static void ChangeNetworkOwner(PlayerID current_player, PlayerID new_player)

   480

{

   481

#ifdef ENABLE_NETWORK

   482

	if (!_networking) return;

   483

   484

	if (current_player == _local_player) {

   485

		_network_playas = new_player;

   486

		SetLocalPlayer(new_player);

   487

	}

   488

   489

	if (!_network_server) return;

   490