1

/* $Id$ */

     2

     3

/** @file economy.cpp */

     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 "unmovable.h"

    30

#include "cargotype.h"

    31

#include "player_face.h"

    32

#include "group.h"

    33

#include "strings_func.h"

    34

#include "tile_cmd.h"

    35

#include "functions.h"

    36

#include "window_func.h"

    37

#include "date_func.h"

    38

#include "vehicle_func.h"

    39

#include "sound_func.h"

    40

#include "track_type.h"

    41

#include "track_func.h"

    42

#include "road_func.h"

    43

#include "rail_map.h"

    44

#include "signal_func.h"

    45

#include "gfx_func.h"

    46

    47

#include "table/strings.h"

    48

#include "table/sprites.h"

    49

    50

/**

    51

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

    52

 *

    53

 * This function multiplies two integer values. The result is

    54

 * shifted by the amount of shift to right.

    55

 *

    56

 * @param a The first integer

    57

 * @param b The second integer

    58

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

    59

 * @return The shifted result

    60

 */

    61

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

    62

{

    63

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

    64

}

    65

    66

/**

    67

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

    68

 *

    69

 * This function multiplies two unsigned integers. The result is

    70

 * shifted by the amount of shift to right.

    71

 *

    72

 * @param a The first unsigned integer

    73

 * @param b The second unsigned integer

    74

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

    75

 * @return The shifted result

    76

 */

    77

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

    78

{

    79

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

    80

}

    81

    82

/* Score info */

    83

const ScoreInfo _score_info[] = {

    84

	{ SCORE_VEHICLES,        120, 100 },

    85

	{ SCORE_STATIONS,         80, 100 },

    86

	{ SCORE_MIN_PROFIT,    10000, 100 },

    87

	{ SCORE_MIN_INCOME,    50000,  50 },

    88

	{ SCORE_MAX_INCOME,   100000, 100 },

    89

	{ SCORE_DELIVERED,     40000, 400 },

    90

	{ SCORE_CARGO,             8,  50 },

    91

	{ SCORE_MONEY,      10000000,  50 },

    92

	{ SCORE_LOAN,         250000,  50 },

    93

	{ SCORE_TOTAL,             0,   0 }

    94

};

    95

    96

int _score_part[MAX_PLAYERS][SCORE_END];

    97

Economy _economy;

    98

Subsidy _subsidies[MAX_PLAYERS];

    99

Prices _price;

   100

uint16 _price_frac[NUM_PRICES];

   101

Money  _cargo_payment_rates[NUM_CARGO];

   102

uint16 _cargo_payment_rates_frac[NUM_CARGO];

   103

Money _additional_cash_required;

   104

   105

Money CalculateCompanyValue(const Player* p)

   106

{

   107

	PlayerID owner = p->index;

   108

	Money value = 0;

   109

   110

	Station *st;

   111

	uint num = 0;

   112

   113

	FOR_ALL_STATIONS(st) {

   114

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

   115

	}

   116

   117

	value += num * _price.station_value * 25;

   118

   119

	Vehicle *v;

   120

	FOR_ALL_VEHICLES(v) {

   121

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

   122

   123

		if (v->type == VEH_TRAIN ||

   124

				v->type == VEH_ROAD ||

   125

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

   126

				v->type == VEH_SHIP) {

   127

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

   128

		}

   129

	}

   130

   131

	/* Add real money value */

   132

	value -= p->current_loan;

   133

	value += p->player_money;

   134

   135

	return max(value, (Money)1);

   136

}

   137

   138

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

   139

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

   140

 * @param update the economy with calculated score

   141

 * @param p player been evaluated

   142

 * @return actual score of this player

   143

 * */

   144

int UpdateCompanyRatingAndValue(Player *p, bool update)

   145

{

   146

	byte owner = p->index;

   147

	int score = 0;

   148

   149

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

   150

   151

/* Count vehicles */

   152

	{

   153

		Vehicle *v;

   154

		Money min_profit = 0;

   155

		bool min_profit_first = true;

   156

		uint num = 0;

   157

   158

		FOR_ALL_VEHICLES(v) {

   159

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

   160

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

   161

				num++;

   162

				if (v->age > 730) {

   163

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

   164

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

   165

						min_profit = v->profit_last_year;

   166

						min_profit_first = false;

   167

					}

   168

				}

   169

			}

   170

		}

   171

   172

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

   173

   174

		_score_part[owner][SCORE_VEHICLES] = num;

   175

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

   176

		if (min_profit > 0)

   177

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

   178

	}

   179

   180

/* Count stations */

   181

	{

   182

		uint num = 0;

   183

		const Station* st;

   184

   185

		FOR_ALL_STATIONS(st) {

   186

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

   187

		}

   188

		_score_part[owner][SCORE_STATIONS] = num;

   189

	}

   190

   191

/* Generate statistics depending on recent income statistics */

   192

	{

   193

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

   194

		if (numec != 0) {

   195

			const PlayerEconomyEntry *pee = p->old_economy;

   196

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

   197

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

   198

   199

			do {

   200

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

   201

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

   202

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

   203

   204

			if (min_income > 0)

   205

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

   206

   207

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

   208

		}

   209

	}

   210

   211

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

   212

	{

   213

		const PlayerEconomyEntry* pee;

   214

		int numec;

   215

		uint32 total_delivered;

   216

   217

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

   218

		if (numec != 0) {

   219

			pee = p->old_economy;

   220

			total_delivered = 0;

   221

			do {

   222

				total_delivered += pee->delivered_cargo;

   223

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

   224

   225

			_score_part[owner][SCORE_DELIVERED] = total_delivered;

   226

		}

   227

	}

   228

   229

/* Generate score for variety of cargo */

   230

	{

   231

		uint num = CountBits(p->cargo_types);

   232

		_score_part[owner][SCORE_CARGO] = num;

   233

		if (update) p->cargo_types = 0;

   234

	}

   235

   236

/* Generate score for player money */

   237

	{

   238

		if (p->player_money > 0) {

   239

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

   240

		}

   241

	}

   242

   243

/* Generate score for loan */

   244

	{

   245

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

   246

	}

   247

   248

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

   249

	{

   250

		int total_score = 0;

   251

		int s;

   252

		score = 0;

   253

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

   254

			/* Skip the total */

   255

			if (i == SCORE_TOTAL) continue;

   256

			/*  Check the score */

   257

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

   258

			score += s;

   259

			total_score += _score_info[i].score;

   260

		}

   261

   262

		_score_part[owner][SCORE_TOTAL] = score;

   263

   264

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

   265

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

   266

	}

   267

   268

	if (update) {

   269

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

   270

		UpdateCompanyHQ(p, score);

   271

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

   272

	}

   273

   274

	InvalidateWindow(WC_PERFORMANCE_DETAIL, 0);

   275

	return score;

   276

}

   277

   278

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

   279

void ChangeOwnershipOfPlayerItems(PlayerID old_player, PlayerID new_player)

   280

{

   281

	Town *t;

   282

	PlayerID old = _current_player;

   283

   284

	assert(old_player != new_player);

   285

   286

	{

   287

		Player *p;

   288

		uint i;

   289

   290

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

   291

		_current_player = old_player;

   292

		FOR_ALL_PLAYERS(p) {

   293

			if (!p->is_active) continue;

   294

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

   295

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

   296

					/* Sell his shares */

   297

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

   298

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

   299

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

   300

					SubtractMoneyFromPlayer(res);

   301

				}

   302

			}

   303

		}

   304

   305

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

   306

		p = GetPlayer(old_player);

   307

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

   308

			_current_player = p->share_owners[i];

   309

			if (_current_player != PLAYER_SPECTATOR) {

   310

				/* Sell the shares */

   311

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

   312

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

   313

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

   314

				SubtractMoneyFromPlayer(res);

   315

			}

   316

		}

   317

	}

   318

   319

	_current_player = old_player;

   320

   321

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

   322

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

   323

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

   324

	if (new_player == PLAYER_SPECTATOR) {

   325

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

   326

	}

   327

   328

	if (new_player == PLAYER_SPECTATOR) {

   329

		Subsidy *s;

   330

   331

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

   332

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

   333

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

   334

			}

   335

		}

   336

	}

   337

   338

	/* Take care of rating in towns */

   339

	FOR_ALL_TOWNS(t) {

   340

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

   341

		if (new_player != PLAYER_SPECTATOR) {

   342

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

   343

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

   344

					// use max of the two ratings.

   345

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

   346

				} else {

   347

					SetBit(t->have_ratings, new_player);

   348

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

   349

				}

   350

			}

   351

		}

   352

   353

		/* Reset the ratings for the old player */

   354

		t->ratings[old_player] = RATING_INITIAL;

   355

		ClrBit(t->have_ratings, old_player);

   356

	}

   357

   358

	{

   359

		int num_train = 0;

   360

		int num_road = 0;

   361

		int num_ship = 0;

   362

		int num_aircraft = 0;

   363

		Vehicle *v;

   364

   365

		/*  Determine Ids for the new vehicles */

   366

		FOR_ALL_VEHICLES(v) {

   367

			if (v->owner == new_player) {

   368

				switch (v->type) {

   369

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

   370

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

   371

					case VEH_SHIP:     num_ship++; break;

   372

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

   373

					default: break;

   374

				}

   375

			}

   376

		}

   377

   378

		FOR_ALL_VEHICLES(v) {

   379

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

   380

				if (new_player == PLAYER_SPECTATOR) {

   381

					DeleteWindowById(WC_VEHICLE_VIEW, v->index);

   382

					DeleteWindowById(WC_VEHICLE_DETAILS, v->index);

   383

					DeleteWindowById(WC_VEHICLE_ORDERS, v->index);

   384

   385

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

   386

						switch (v->type) {

   387

							default: NOT_REACHED();

   388

   389

							case VEH_TRAIN: {

   390

								Vehicle *u = v;

   391

								do {

   392

									Vehicle *next = GetNextVehicle(u);

   393

									delete u;

   394

									u = next;

   395

								} while (u != NULL);

   396

							} break;

   397

   398

							case VEH_ROAD:

   399

							case VEH_SHIP:

   400

								delete v;

   401

								break;

   402

   403

							case VEH_AIRCRAFT:

   404

								DeleteVehicleChain(v);

   405

								break;

   406

						}

   407

					}

   408

				} else {

   409

					v->owner = new_player;

   410

					v->colormap = PAL_NONE;

   411

					v->group_id = DEFAULT_GROUP;

   412

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

   413

					switch (v->type) {

   414

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

   415

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

   416

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

   417

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

   418

						default: NOT_REACHED();

   419

					}

   420

				}

   421

			}

   422

		}

   423

	}

   424

   425

	/*  Change ownership of tiles */

   426

	{

   427

		TileIndex tile = 0;

   428

		do {

   429

			ChangeTileOwner(tile, old_player, new_player);

   430

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

   431

   432

		if (new_player != PLAYER_SPECTATOR) {

   433

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

   434

			 * and signals were not propagated

   435

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

   436

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

   437

			tile = 0;

   438

   439

			do {

   440

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

   441

					TrackBits tracks = GetTrackBits(tile);

   442

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

   443

						Track track = RemoveFirstTrack(&tracks);

   444

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

   445

					} while (tracks != TRACK_BIT_NONE);

   446

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

   447

					UpdateLevelCrossing(tile);

   448

				}

   449

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

   450

		}

   451

   452

		/* update signals in buffer */

   453

		UpdateSignalsInBuffer();

   454

	}

   455

   456

	/* Change color of existing windows */

   457

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

   458

   459

	_current_player = old;

   460

   461

	MarkWholeScreenDirty();

   462

}

   463

   464

static void ChangeNetworkOwner(PlayerID current_player, PlayerID new_player)

   465

{

   466

#ifdef ENABLE_NETWORK

   467

	if (!_networking) return;

   468

   469

	if (current_player == _local_player) {

   470

		_network_playas = new_player;

   471

		SetLocalPlayer(new_player);

   472

	}

   473

   474

	if (!_network_server) return;

   475

   476

	/* The server has to handle all administrative issues, for example

   477

	* updating and notifying all clients of what has happened */

   478

	NetworkTCPSocketHandler *cs;

   479

	NetworkClientInfo *ci = NetworkFindClientInfoFromIndex(NETWORK_SERVER_INDEX);

   480

   481

	/* The server has just changed from player */

   482

	if (current_player == ci->client_playas) {

   483

		ci->client_playas = new_player;

   484

		NetworkUpdateClientInfo(NETWORK_SERVER_INDEX);

   485

	}

   486

   487

	/* Find all clients that were in control of this company, and mark them as new_player */

   488

	FOR_ALL_CLIENTS(cs) {

   489

		ci = DEREF_CLIENT_INFO(cs);

   490

		if (current_player == ci->client_playas) {