1

/* $Id$ */

     2

     3

/** @file economy.cpp Handling of the economy. */

     4

     5

#include "stdafx.h"

     6

#include "openttd.h"

     7

#include "currency.h"

     8

#include "landscape.h"

     9

#include "company_base.h"

    10

#include "company_func.h"

    11

#include "command_func.h"

    12

#include "saveload.h"

    13

#include "industry.h"

    14

#include "industry_map.h"

    15

#include "town.h"

    16

#include "news_func.h"

    17

#include "network/network.h"

    18

#include "network/network_func.h"

    19

#include "variables.h"

    20

#include "vehicle_gui.h"

    21

#include "ai/ai.h"

    22

#include "train.h"

    23

#include "roadveh.h"

    24

#include "aircraft.h"

    25

#include "newgrf_engine.h"

    26

#include "newgrf_sound.h"

    27

#include "newgrf_callbacks.h"

    28

#include "newgrf_industries.h"

    29

#include "newgrf_industrytiles.h"

    30

#include "newgrf_station.h"

    31

#include "unmovable.h"

    32

#include "cargotype.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

#include "company_gui.h"

    49

#include "signs_base.h"

    50

    51

#include "table/strings.h"

    52

#include "table/sprites.h"

    53

    54

/**

    55

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

    56

 *

    57

 * This function multiplies two integer values. The result is

    58

 * shifted by the amount of shift to right.

    59

 *

    60

 * @param a The first integer

    61

 * @param b The second integer

    62

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

    63

 * @return The shifted result

    64

 */

    65

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

    66

{

    67

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

    68

}

    69

    70

/**

    71

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

    72

 *

    73

 * This function multiplies two unsigned integers. The result is

    74

 * shifted by the amount of shift to right.

    75

 *

    76

 * @param a The first unsigned integer

    77

 * @param b The second unsigned integer

    78

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

    79

 * @return The shifted result

    80

 */

    81

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

    82

{

    83

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

    84

}

    85

    86

/* Score info */

    87

const ScoreInfo _score_info[] = {

    88

	{ SCORE_VEHICLES,        120, 100 },

    89

	{ SCORE_STATIONS,         80, 100 },

    90

	{ SCORE_MIN_PROFIT,    10000, 100 },

    91

	{ SCORE_MIN_INCOME,    50000,  50 },

    92

	{ SCORE_MAX_INCOME,   100000, 100 },

    93

	{ SCORE_DELIVERED,     40000, 400 },

    94

	{ SCORE_CARGO,             8,  50 },

    95

	{ SCORE_MONEY,      10000000,  50 },

    96

	{ SCORE_LOAN,         250000,  50 },

    97

	{ SCORE_TOTAL,             0,   0 }

    98

};

    99

   100

int _score_part[MAX_COMPANIES][SCORE_END];

   101

Economy _economy;

   102

Subsidy _subsidies[MAX_COMPANIES];

   103

Prices _price;

   104

uint16 _price_frac[NUM_PRICES];

   105

Money  _cargo_payment_rates[NUM_CARGO];

   106

uint16 _cargo_payment_rates_frac[NUM_CARGO];

   107

Money _additional_cash_required;

   108

   109

Money CalculateCompanyValue(const Company *c)

   110

{

   111

	Owner owner = c->index;

   112

	Money value = 0;

   113

   114

	Station *st;

   115

	uint num = 0;

   116

   117

	FOR_ALL_STATIONS(st) {

   118

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

   119

	}

   120

   121

	value += num * _price.station_value * 25;

   122

   123

	Vehicle *v;

   124

	FOR_ALL_VEHICLES(v) {

   125

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

   126

   127

		if (v->type == VEH_TRAIN ||

   128

				v->type == VEH_ROAD ||

   129

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

   130

				v->type == VEH_SHIP) {

   131

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

   132

		}

   133

	}

   134

   135

	/* Add real money value */

   136

	value -= c->current_loan;

   137

	value += c->money;

   138

   139

	return max(value, (Money)1);

   140

}

   141

   142

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

   143

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

   144

 * @param update the economy with calculated score

   145

 * @param c company been evaluated

   146

 * @return actual score of this company

   147

 * */

   148

int UpdateCompanyRatingAndValue(Company *c, bool update)

   149

{

   150

	Owner owner = c->index;

   151

	int score = 0;

   152

   153

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

   154

   155

	/* Count vehicles */

   156

	{

   157

		Vehicle *v;

   158

		Money min_profit = 0;

   159

		bool min_profit_first = true;

   160

		uint num = 0;

   161

   162

		FOR_ALL_VEHICLES(v) {

   163

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

   164

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

   165

				num++;

   166

				if (v->age > 730) {

   167

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

   168

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

   169

						min_profit = v->profit_last_year;

   170

						min_profit_first = false;

   171

					}

   172

				}

   173

			}

   174

		}

   175

   176

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

   177

   178

		_score_part[owner][SCORE_VEHICLES] = num;

   179

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

   180

		if (min_profit > 0)

   181

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

   182

	}

   183

   184

	/* Count stations */

   185

	{

   186

		uint num = 0;

   187

		const Station* st;

   188

   189

		FOR_ALL_STATIONS(st) {

   190

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

   191

		}

   192

		_score_part[owner][SCORE_STATIONS] = num;

   193

	}

   194

   195

	/* Generate statistics depending on recent income statistics */

   196

	{

   197

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

   198

		if (numec != 0) {

   199

			const CompanyEconomyEntry *cee = c->old_economy;

   200

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

   201

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

   202

   203

			do {

   204

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

   205

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

   206

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

   207

   208

			if (min_income > 0) {

   209

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

   210

			}

   211

   212

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

   213

		}

   214

	}

   215

   216

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

   217

	{

   218

		const CompanyEconomyEntry *cee;

   219

		int numec;

   220

		uint32 total_delivered;

   221

   222

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

   223

		if (numec != 0) {

   224

			cee = c->old_economy;

   225

			total_delivered = 0;

   226

			do {

   227

				total_delivered += cee->delivered_cargo;

   228

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

   229

   230

			_score_part[owner][SCORE_DELIVERED] = total_delivered;

   231

		}

   232

	}

   233

   234

	/* Generate score for variety of cargo */

   235

	{

   236

		uint num = CountBits(c->cargo_types);

   237

		_score_part[owner][SCORE_CARGO] = num;

   238

		if (update) c->cargo_types = 0;

   239

	}

   240

   241

	/* Generate score for company's money */

   242

	{

   243

		if (c->money > 0) {

   244

			_score_part[owner][SCORE_MONEY] = ClampToI32(c->money);

   245

		}

   246

	}

   247

   248

	/* Generate score for loan */

   249

	{

   250

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

   251

	}

   252

   253

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

   254

	{

   255

		int total_score = 0;

   256

		int s;

   257

		score = 0;

   258

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

   259

			/* Skip the total */

   260

			if (i == SCORE_TOTAL) continue;

   261

			/*  Check the score */

   262

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

   263

			score += s;

   264

			total_score += _score_info[i].score;

   265

		}

   266

   267

		_score_part[owner][SCORE_TOTAL] = score;

   268

   269

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

   270

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

   271

	}

   272

   273

	if (update) {

   274

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

   275

		UpdateCompanyHQ(c, score);

   276

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

   277

	}

   278

   279

	InvalidateWindow(WC_PERFORMANCE_DETAIL, 0);

   280

	return score;

   281

}

   282

   283

/*  use INVALID_OWNER as new_owner to delete the company. */

   284

void ChangeOwnershipOfCompanyItems(Owner old_owner, Owner new_owner)

   285

{

   286

	Town *t;

   287

	CompanyID old = _current_company;

   288

   289

	assert(old_owner != new_owner);

   290

   291

	{

   292

		Company *c;

   293

		uint i;

   294

   295

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

   296

		_current_company = old_owner;

   297

		FOR_ALL_COMPANIES(c) {

   298

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

   299

				if (c->share_owners[i] == old_owner) {

   300

					/* Sell his shares */

   301

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

   302

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

   303

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

   304

					SubtractMoneyFromCompany(res);

   305

				}

   306

			}

   307

		}

   308

   309

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

   310

		c = GetCompany(old_owner);

   311

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

   312

			_current_company = c->share_owners[i];

   313

			if (_current_company != INVALID_OWNER) {

   314

				/* Sell the shares */

   315

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

   316

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

   317

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

   318

				SubtractMoneyFromCompany(res);

   319

			}

   320

		}

   321

	}

   322

   323

	_current_company = old_owner;

   324

   325

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

   326

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

   327

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

   328

	if (new_owner == INVALID_OWNER) {

   329

		GetCompany(old_owner)->money = UINT64_MAX >> 2; // jackpot ;p

   330

	}

   331

   332

	if (new_owner == INVALID_OWNER) {

   333

		Subsidy *s;

   334

   335

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

   336

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

   337

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

   338

			}

   339

		}

   340

	}

   341

   342

	/* Take care of rating in towns */

   343

	FOR_ALL_TOWNS(t) {

   344

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

   345

		if (new_owner != INVALID_OWNER) {

   346

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

   347

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

   348

					// use max of the two ratings.

   349

					t->ratings[new_owner] = max(t->ratings[new_owner], t->ratings[old_owner]);

   350

				} else {

   351

					SetBit(t->have_ratings, new_owner);

   352

					t->ratings[new_owner] = t->ratings[old_owner];

   353

				}

   354

			}

   355

		}

   356

   357

		/* Reset the ratings for the old owner */

   358

		t->ratings[old_owner] = RATING_INITIAL;

   359

		ClrBit(t->have_ratings, old_owner);

   360

	}

   361

   362

	{

   363

		int num_train = 0;

   364

		int num_road = 0;

   365

		int num_ship = 0;

   366

		int num_aircraft = 0;

   367

		Vehicle *v;

   368

   369

		/*  Determine Ids for the new vehicles */

   370

		FOR_ALL_VEHICLES(v) {

   371

			if (v->owner == new_owner) {

   372

				switch (v->type) {

   373

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

   374

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

   375

					case VEH_SHIP:     num_ship++; break;

   376

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

   377

					default: break;

   378

				}

   379

			}

   380

		}

   381

   382

		FOR_ALL_VEHICLES(v) {

   383

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

   384

				if (new_owner == INVALID_OWNER) {

   385

					DeleteWindowById(WC_VEHICLE_VIEW, v->index);

   386

					DeleteWindowById(WC_VEHICLE_DETAILS, v->index);

   387

					DeleteWindowById(WC_VEHICLE_ORDERS, v->index);

   388

   389

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

   390

						switch (v->type) {

   391

							default: NOT_REACHED();

   392

   393

							case VEH_TRAIN: {

   394

								Vehicle *u = v;

   395

								do {

   396

									Vehicle *next = GetNextVehicle(u);

   397

									delete u;

   398

									u = next;

   399

								} while (u != NULL);

   400

							} break;

   401

   402

							case VEH_ROAD:

   403

							case VEH_SHIP:

   404

								delete v;

   405

								break;

   406

   407

							case VEH_AIRCRAFT:

   408

								DeleteVehicleChain(v);

   409

								break;

   410

						}

   411

					}

   412

				} else {

   413

					v->owner = new_owner;

   414

					v->colormap = PAL_NONE;

   415

					v->group_id = DEFAULT_GROUP;

   416

					if (IsEngineCountable(v)) GetCompany(new_owner)->num_engines[v->engine_type]++;

   417

					switch (v->type) {

   418

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

   419

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

   420

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

   421

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

   422

						default: NOT_REACHED();

   423

					}

   424

				}

   425

			}

   426

		}

   427

	}

   428

   429

	/*  Change ownership of tiles */

   430

	{

   431

		TileIndex tile = 0;

   432

		do {

   433

			ChangeTileOwner(tile, old_owner, new_owner);

   434

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

   435

   436

		if (new_owner != INVALID_OWNER) {

   437

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

   438

			 * and signals were not propagated

   439

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

   440

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

   441

			tile = 0;

   442

   443

			do {

   444

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

   445

					TrackBits tracks = GetTrackBits(tile);

   446

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

   447

						Track track = RemoveFirstTrack(&tracks);

   448

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

   449

					} while (tracks != TRACK_BIT_NONE);

   450

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

   451

					UpdateLevelCrossing(tile);

   452

				}

   453

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

   454

		}

   455

   456

		/* update signals in buffer */

   457

		UpdateSignalsInBuffer();

   458

	}

   459

   460

	/* In all cases clear replace engine rules.

   461

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

   462

	RemoveAllEngineReplacementForCompany(GetCompany(old_owner));

   463

   464

	if (new_owner == INVALID_OWNER) {

   465

		RemoveAllGroupsForCompany(old_owner);

   466

	} else {

   467

		Group *g;

   468

		FOR_ALL_GROUPS(g) {

   469

			if (g->owner == old_owner) g->owner = new_owner;

   470

		}

   471

	}

   472

   473

	Sign *si;

   474

	FOR_ALL_SIGNS(si) {

   475

		if (si->owner == old_owner) si->owner = new_owner == INVALID_OWNER ? OWNER_NONE : new_owner;

   476

	}

   477

   478

	/* Change color of existing windows */

   479

	if (new_owner != INVALID_OWNER) ChangeWindowOwner(old_owner, new_owner);

   480

   481

	_current_company = old;

   482

   483

	MarkWholeScreenDirty();

   484

}

   485