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 "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

    48

#include "table/strings.h"

    49

#include "table/sprites.h"

    50

    51

/**

    52

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

    53

 *

    54

 * This function multiplies two integer values. The result is

    55

 * shifted by the amount of shift to right.

    56

 *

    57

 * @param a The first integer

    58

 * @param b The second integer

    59

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

    60

 * @return The shifted result

    61

 */

    62

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

    63

{

    64

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

    65

}

    66

    67

/**

    68

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

    69

 *

    70

 * This function multiplies two unsigned integers. The result is

    71

 * shifted by the amount of shift to right.

    72

 *

    73

 * @param a The first unsigned integer

    74

 * @param b The second unsigned integer

    75

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

    76

 * @return The shifted result

    77

 */

    78

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

    79

{

    80

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

    81

}

    82

    83

/* Score info */

    84

const ScoreInfo _score_info[] = {

    85

	{ SCORE_VEHICLES,        120, 100 },

    86

	{ SCORE_STATIONS,         80, 100 },

    87

	{ SCORE_MIN_PROFIT,    10000, 100 },

    88

	{ SCORE_MIN_INCOME,    50000,  50 },

    89

	{ SCORE_MAX_INCOME,   100000, 100 },

    90

	{ SCORE_DELIVERED,     40000, 400 },

    91

	{ SCORE_CARGO,             8,  50 },

    92

	{ SCORE_MONEY,      10000000,  50 },

    93

	{ SCORE_LOAN,         250000,  50 },

    94

	{ SCORE_TOTAL,             0,   0 }

    95

};

    96

    97

int _score_part[MAX_PLAYERS][SCORE_END];

    98

Economy _economy;

    99

Subsidy _subsidies[MAX_PLAYERS];

   100

Prices _price;

   101

uint16 _price_frac[NUM_PRICES];

   102

Money  _cargo_payment_rates[NUM_CARGO];

   103

uint16 _cargo_payment_rates_frac[NUM_CARGO];

   104

Money _additional_cash_required;

   105

   106

Money CalculateCompanyValue(const Player* p)

   107

{

   108

	PlayerID owner = p->index;

   109

	Money value = 0;

   110

   111

	Station *st;

   112

	uint num = 0;

   113

   114

	FOR_ALL_STATIONS(st) {

   115

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

   116

	}

   117

   118

	value += num * _price.station_value * 25;

   119

   120

	Vehicle *v;

   121

	FOR_ALL_VEHICLES(v) {

   122

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

   123

   124

		if (v->type == VEH_TRAIN ||

   125

				v->type == VEH_ROAD ||

   126

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

   127

				v->type == VEH_SHIP) {

   128

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

   129

		}

   130

	}

   131

   132

	/* Add real money value */

   133

	value -= p->current_loan;

   134

	value += p->player_money;

   135

   136

	return max(value, (Money)1);

   137

}

   138

   139

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

   140

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

   141

 * @param update the economy with calculated score

   142

 * @param p player been evaluated

   143

 * @return actual score of this player

   144

 * */

   145

int UpdateCompanyRatingAndValue(Player *p, bool update)

   146

{

   147

	byte owner = p->index;

   148

	int score = 0;

   149

   150

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

   151

   152

/* Count vehicles */

   153

	{

   154

		Vehicle *v;

   155

		Money min_profit = 0;

   156

		bool min_profit_first = true;

   157

		uint num = 0;

   158

   159

		FOR_ALL_VEHICLES(v) {

   160

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

   161

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

   162

				num++;

   163

				if (v->age > 730) {

   164

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

   165

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

   166

						min_profit = v->profit_last_year;

   167

						min_profit_first = false;

   168

					}

   169

				}

   170

			}

   171

		}

   172

   173

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

   174

   175

		_score_part[owner][SCORE_VEHICLES] = num;

   176

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

   177

		if (min_profit > 0)

   178

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

   179

	}

   180

   181

/* Count stations */

   182

	{

   183

		uint num = 0;

   184

		const Station* st;

   185

   186

		FOR_ALL_STATIONS(st) {

   187

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

   188

		}

   189

		_score_part[owner][SCORE_STATIONS] = num;

   190

	}

   191

   192

/* Generate statistics depending on recent income statistics */

   193

	{

   194

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

   195

		if (numec != 0) {

   196

			const PlayerEconomyEntry *pee = p->old_economy;

   197

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

   198

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

   199

   200

			do {

   201

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

   202

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

   203

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

   204

   205

			if (min_income > 0)

   206

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

   207

   208

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

   209

		}

   210

	}

   211

   212

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

   213

	{

   214

		const PlayerEconomyEntry* pee;

   215

		int numec;

   216

		uint32 total_delivered;

   217

   218

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

   219

		if (numec != 0) {

   220

			pee = p->old_economy;

   221

			total_delivered = 0;

   222

			do {

   223

				total_delivered += pee->delivered_cargo;

   224

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

   225

   226

			_score_part[owner][SCORE_DELIVERED] = total_delivered;

   227

		}

   228

	}

   229

   230

/* Generate score for variety of cargo */

   231

	{

   232

		uint num = CountBits(p->cargo_types);

   233

		_score_part[owner][SCORE_CARGO] = num;

   234

		if (update) p->cargo_types = 0;

   235

	}

   236

   237

/* Generate score for player money */

   238

	{

   239

		if (p->player_money > 0) {

   240

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

   241

		}

   242

	}

   243

   244

/* Generate score for loan */

   245

	{

   246

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

   247

	}

   248

   249

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

   250

	{

   251

		int total_score = 0;

   252

		int s;

   253

		score = 0;

   254

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

   255

			/* Skip the total */

   256

			if (i == SCORE_TOTAL) continue;

   257

			/*  Check the score */

   258

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

   259

			score += s;

   260

			total_score += _score_info[i].score;

   261

		}

   262

   263

		_score_part[owner][SCORE_TOTAL] = score;

   264

   265

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

   266

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

   267

	}

   268

   269

	if (update) {

   270

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

   271

		UpdateCompanyHQ(p, score);

   272

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

   273

	}

   274

   275

	InvalidateWindow(WC_PERFORMANCE_DETAIL, 0);

   276

	return score;

   277

}

   278

   279

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

   280

void ChangeOwnershipOfPlayerItems(PlayerID old_player, PlayerID new_player)

   281

{

   282

	Town *t;

   283

	PlayerID old = _current_player;

   284

   285

	assert(old_player != new_player);

   286

   287

	{

   288

		Player *p;

   289

		uint i;

   290

   291

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

   292

		_current_player = old_player;

   293

		FOR_ALL_PLAYERS(p) {

   294

			if (!p->is_active) continue;

   295

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

   296

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

   297

					/* Sell his shares */

   298

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

   299

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

   300

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

   301

					SubtractMoneyFromPlayer(res);

   302

				}

   303

			}

   304

		}

   305

   306

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

   307

		p = GetPlayer(old_player);

   308

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

   309

			_current_player = p->share_owners[i];

   310

			if (_current_player != PLAYER_SPECTATOR) {

   311

				/* Sell the shares */

   312

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

   313

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

   314

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

   315

				SubtractMoneyFromPlayer(res);

   316

			}

   317

		}

   318

	}

   319

   320

	_current_player = old_player;

   321

   322

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

   323

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

   324

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

   325

	if (new_player == PLAYER_SPECTATOR) {

   326

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

   327

	}

   328

   329

	if (new_player == PLAYER_SPECTATOR) {

   330

		Subsidy *s;

   331

   332

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

   333

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

   334

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

   335

			}

   336

		}

   337

	}

   338

   339

	/* Take care of rating in towns */

   340

	FOR_ALL_TOWNS(t) {

   341

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

   342

		if (new_player != PLAYER_SPECTATOR) {

   343

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

   344

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

   345

					// use max of the two ratings.

   346

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

   347

				} else {

   348

					SetBit(t->have_ratings, new_player);

   349

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

   350

				}

   351

			}

   352

		}

   353

   354

		/* Reset the ratings for the old player */

   355

		t->ratings[old_player] = RATING_INITIAL;

   356

		ClrBit(t->have_ratings, old_player);

   357

	}

   358

   359

	{

   360

		int num_train = 0;

   361

		int num_road = 0;

   362

		int num_ship = 0;

   363

		int num_aircraft = 0;

   364

		Vehicle *v;

   365

   366

		/*  Determine Ids for the new vehicles */

   367

		FOR_ALL_VEHICLES(v) {

   368

			if (v->owner == new_player) {

   369

				switch (v->type) {

   370

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

   371

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

   372

					case VEH_SHIP:     num_ship++; break;

   373

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

   374

					default: break;

   375

				}

   376

			}

   377

		}

   378

   379

		FOR_ALL_VEHICLES(v) {

   380

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

   381

				if (new_player == PLAYER_SPECTATOR) {

   382

					DeleteWindowById(WC_VEHICLE_VIEW, v->index);

   383

					DeleteWindowById(WC_VEHICLE_DETAILS, v->index);

   384

					DeleteWindowById(WC_VEHICLE_ORDERS, v->index);

   385

   386

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

   387

						switch (v->type) {

   388

							default: NOT_REACHED();

   389

   390

							case VEH_TRAIN: {

   391

								Vehicle *u = v;

   392

								do {

   393

									Vehicle *next = GetNextVehicle(u);

   394

									delete u;

   395

									u = next;

   396

								} while (u != NULL);

   397

							} break;

   398

   399

							case VEH_ROAD:

   400

							case VEH_SHIP:

   401

								delete v;

   402

								break;

   403

   404

							case VEH_AIRCRAFT:

   405

								DeleteVehicleChain(v);

   406

								break;

   407

						}

   408

					}

   409

				} else {

   410

					v->owner = new_player;

   411

					v->colormap = PAL_NONE;

   412

					v->group_id = DEFAULT_GROUP;

   413

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

   414

					switch (v->type) {

   415

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

   416

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

   417

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

   418

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

   419

						default: NOT_REACHED();

   420

					}

   421

				}

   422

			}

   423

		}

   424

	}

   425

   426

	/*  Change ownership of tiles */

   427

	{

   428

		TileIndex tile = 0;

   429

		do {

   430

			ChangeTileOwner(tile, old_player, new_player);

   431

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

   432

   433

		if (new_player != PLAYER_SPECTATOR) {

   434

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

   435

			 * and signals were not propagated

   436

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

   437

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

   438

			tile = 0;

   439

   440

			do {

   441

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

   442

					TrackBits tracks = GetTrackBits(tile);

   443

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

   444

						Track track = RemoveFirstTrack(&tracks);

   445

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

   446

					} while (tracks != TRACK_BIT_NONE);

   447

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

   448

					UpdateLevelCrossing(tile);

   449

				}

   450

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

   451

		}

   452

   453

		/* update signals in buffer */

   454

		UpdateSignalsInBuffer();

   455

	}

   456

   457

	/* Change color of existing windows */

   458

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

   459

   460

	_current_player = old;

   461

   462

	MarkWholeScreenDirty();

   463

}

   464

   465

static void ChangeNetworkOwner(PlayerID current_player, PlayerID new_player)

   466

{

   467

#ifdef ENABLE_NETWORK

   468

	if (!_networking) return;

   469

   470

	if (current_player == _local_player) {

   471

		_network_playas = new_player;

   472

		SetLocalPlayer(new_player);

   473

	}

   474

   475

	if (!_network_server) return;

   476

   477

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

   478

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

   479

	NetworkTCPSocketHandler *cs;

   480

	NetworkClientInfo *ci = NetworkFindClientInfoFromIndex(NETWORK_SERVER_INDEX);

   481

   482

	/* The server has just changed from player */

   483

	if (current_player == ci->client_playas) {

   484

		ci->client_playas = new_player;

   485

		NetworkUpdateClientInfo(NETWORK_SERVER_INDEX);

   486

	}

   487

   488

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

   489

	FOR_ALL_CLIENTS(cs) {

   490

		ci = DEREF_CLIENT_INFO(cs);