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

    15

#include "news_func.h"

    16

#include "network/network.h"

    17

#include "network/network_func.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 "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

#include "autoreplace_func.h"

    47

#include "company_gui.h"

    48

#include "signs_base.h"

    49

    50

#include "table/strings.h"

    51

#include "table/sprites.h"

    52

    53

/**

    54

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

    55

 *

    56

 * This function multiplies two integer values. The result is

    57

 * shifted by the amount of shift to right.

    58

 *

    59

 * @param a The first integer

    60

 * @param b The second integer

    61

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

    62

 * @return The shifted result

    63

 */

    64

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

    65

{

    66

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

    67

}

    68

    69

/**

    70

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

    71

 *

    72

 * This function multiplies two unsigned integers. The result is

    73

 * shifted by the amount of shift to right.

    74

 *

    75

 * @param a The first unsigned integer

    76

 * @param b The second unsigned integer

    77

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

    78

 * @return The shifted result

    79

 */

    80

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

    81

{

    82

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

    83

}

    84

    85

/* Score info */

    86

const ScoreInfo _score_info[] = {

    87

	{ SCORE_VEHICLES,        120, 100 },

    88

	{ SCORE_STATIONS,         80, 100 },

    89

	{ SCORE_MIN_PROFIT,    10000, 100 },

    90

	{ SCORE_MIN_INCOME,    50000,  50 },

    91

	{ SCORE_MAX_INCOME,   100000, 100 },

    92

	{ SCORE_DELIVERED,     40000, 400 },

    93

	{ SCORE_CARGO,             8,  50 },

    94

	{ SCORE_MONEY,      10000000,  50 },

    95

	{ SCORE_LOAN,         250000,  50 },

    96

	{ SCORE_TOTAL,             0,   0 }

    97

};

    98

    99

int _score_part[MAX_COMPANIES][SCORE_END];

   100

Economy _economy;

   101

Subsidy _subsidies[MAX_COMPANIES];

   102

Prices _price;

   103

uint16 _price_frac[NUM_PRICES];

   104

Money  _cargo_payment_rates[NUM_CARGO];

   105

uint16 _cargo_payment_rates_frac[NUM_CARGO];

   106

Money _additional_cash_required;

   107

   108

Money CalculateCompanyValue(const Company *c)

   109

{

   110

	Owner owner = c->index;

   111

	Money value = 0;

   112

   113

	Station *st;

   114

	uint num = 0;

   115

   116

	FOR_ALL_STATIONS(st) {

   117

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

   118

	}

   119

   120

	value += num * _price.station_value * 25;

   121

   122

	Vehicle *v;

   123

	FOR_ALL_VEHICLES(v) {

   124

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

   125

   126

		if (v->type == VEH_TRAIN ||

   127

				v->type == VEH_ROAD ||

   128

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

   129

				v->type == VEH_SHIP) {

   130

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

   131

		}

   132

	}

   133

   134

	/* Add real money value */

   135

	value -= c->current_loan;

   136

	value += c->money;

   137

   138

	return max(value, (Money)1);

   139

}

   140

   141

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

   142

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

   143

 * @param update the economy with calculated score

   144

 * @param c company been evaluated

   145

 * @return actual score of this company

   146

 * */

   147

int UpdateCompanyRatingAndValue(Company *c, bool update)

   148

{

   149

	Owner owner = c->index;

   150

	int score = 0;

   151

   152

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

   153

   154

	/* Count vehicles */

   155

	{

   156

		Vehicle *v;

   157

		Money min_profit = 0;

   158

		bool min_profit_first = true;

   159

		uint num = 0;

   160

   161

		FOR_ALL_VEHICLES(v) {

   162

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

   163

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

   164

				num++;

   165

				if (v->age > 730) {

   166

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

   167

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

   168

						min_profit = v->profit_last_year;

   169

						min_profit_first = false;

   170

					}

   171

				}

   172

			}

   173

		}

   174

   175

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

   176

   177

		_score_part[owner][SCORE_VEHICLES] = num;

   178

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

   179

		if (min_profit > 0)

   180

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

   181

	}

   182

   183

	/* Count stations */

   184

	{

   185

		uint num = 0;

   186

		const Station* st;

   187

   188

		FOR_ALL_STATIONS(st) {

   189

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

   190

		}

   191

		_score_part[owner][SCORE_STATIONS] = num;

   192

	}

   193

   194

	/* Generate statistics depending on recent income statistics */

   195

	{

   196

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

   197

		if (numec != 0) {

   198

			const CompanyEconomyEntry *cee = c->old_economy;

   199

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

   200

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

   201

   202

			do {

   203

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

   204

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

   205

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

   206

   207

			if (min_income > 0) {

   208

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

   209

			}

   210

   211

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

   212

		}

   213

	}

   214

   215

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

   216

	{

   217

		const CompanyEconomyEntry *cee;

   218

		int numec;

   219

		uint32 total_delivered;

   220

   221

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

   222

		if (numec != 0) {

   223

			cee = c->old_economy;

   224

			total_delivered = 0;

   225

			do {

   226

				total_delivered += cee->delivered_cargo;

   227

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

   228

   229

			_score_part[owner][SCORE_DELIVERED] = total_delivered;

   230

		}

   231

	}

   232

   233

	/* Generate score for variety of cargo */

   234

	{

   235

		uint num = CountBits(c->cargo_types);

   236

		_score_part[owner][SCORE_CARGO] = num;

   237

		if (update) c->cargo_types = 0;

   238

	}

   239

   240

	/* Generate score for company's money */

   241

	{

   242

		if (c->money > 0) {

   243

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

   244

		}

   245

	}

   246

   247

	/* Generate score for loan */

   248

	{

   249

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

   250

	}

   251

   252

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

   253

	{

   254

		int total_score = 0;

   255

		int s;

   256

		score = 0;

   257

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

   258

			/* Skip the total */

   259

			if (i == SCORE_TOTAL) continue;

   260

			/*  Check the score */

   261

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

   262

			score += s;

   263

			total_score += _score_info[i].score;

   264

		}

   265

   266

		_score_part[owner][SCORE_TOTAL] = score;

   267

   268

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

   269

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

   270

	}

   271

   272

	if (update) {

   273

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

   274

		UpdateCompanyHQ(c, score);

   275

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

   276

	}

   277

   278

	InvalidateWindow(WC_PERFORMANCE_DETAIL, 0);

   279

	return score;

   280

}

   281

   282

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

   283

void ChangeOwnershipOfCompanyItems(Owner old_owner, Owner new_owner)

   284

{

   285

	Town *t;

   286

	CompanyID old = _current_company;

   287

   288

	assert(old_owner != new_owner);

   289

   290

	{

   291

		Company *c;

   292

		uint i;

   293

   294

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

   295

		_current_company = old_owner;

   296

		FOR_ALL_COMPANIES(c) {

   297

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

   298

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

   299

					/* Sell his shares */

   300

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

   301

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

   302

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

   303

					SubtractMoneyFromCompany(res);

   304

				}

   305

			}

   306

		}

   307

   308

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

   309

		c = GetCompany(old_owner);

   310

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

   311

			_current_company = c->share_owners[i];

   312

			if (_current_company != INVALID_OWNER) {

   313

				/* Sell the shares */

   314

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

   315

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

   316

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

   317

				SubtractMoneyFromCompany(res);

   318

			}

   319

		}

   320

	}

   321

   322

	_current_company = old_owner;

   323

   324

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

   325

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

   326

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

   327

	if (new_owner == INVALID_OWNER) {

   328

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

   329

	}

   330

   331

	if (new_owner == INVALID_OWNER) {

   332

		Subsidy *s;

   333

   334

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

   335

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

   336

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

   337

			}

   338

		}

   339

	}

   340

   341

	/* Take care of rating in towns */

   342

	FOR_ALL_TOWNS(t) {

   343

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

   344

		if (new_owner != INVALID_OWNER) {

   345

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

   346

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

   347

					// use max of the two ratings.

   348

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

   349

				} else {

   350

					SetBit(t->have_ratings, new_owner);

   351

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

   352

				}

   353

			}

   354

		}

   355

   356

		/* Reset the ratings for the old owner */

   357

		t->ratings[old_owner] = RATING_INITIAL;

   358

		ClrBit(t->have_ratings, old_owner);

   359

	}

   360

   361

	{

   362

		int num_train = 0;

   363

		int num_road = 0;

   364

		int num_ship = 0;

   365

		int num_aircraft = 0;

   366

		Vehicle *v;

   367

   368

		/*  Determine Ids for the new vehicles */

   369

		FOR_ALL_VEHICLES(v) {

   370

			if (v->owner == new_owner) {

   371

				switch (v->type) {

   372

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

   373

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

   374

					case VEH_SHIP:     num_ship++; break;

   375

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

   376

					default: break;

   377

				}

   378

			}

   379

		}

   380

   381

		FOR_ALL_VEHICLES(v) {

   382

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

   383

				if (new_owner == INVALID_OWNER) {

   384

					DeleteWindowById(WC_VEHICLE_VIEW, v->index);

   385

					DeleteWindowById(WC_VEHICLE_DETAILS, v->index);

   386

					DeleteWindowById(WC_VEHICLE_ORDERS, v->index);

   387

   388

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

   389

						switch (v->type) {

   390

							default: NOT_REACHED();

   391

   392

							case VEH_TRAIN: {

   393

								Vehicle *u = v;

   394

								do {

   395

									Vehicle *next = GetNextVehicle(u);

   396

									delete u;

   397

									u = next;

   398

								} while (u != NULL);

   399

							} break;

   400

   401

							case VEH_ROAD:

   402

							case VEH_SHIP:

   403

								delete v;

   404

								break;

   405

   406

							case VEH_AIRCRAFT:

   407

								DeleteVehicleChain(v);

   408

								break;

   409

						}

   410

					}

   411

				} else {

   412

					v->owner = new_owner;

   413

					v->colormap = PAL_NONE;

   414

					v->group_id = DEFAULT_GROUP;

   415

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

   416

					switch (v->type) {

   417

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

   418

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

   419

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

   420

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

   421

						default: NOT_REACHED();

   422

					}

   423

				}

   424

			}

   425

		}

   426

	}

   427

   428

	/*  Change ownership of tiles */

   429

	{

   430

		TileIndex tile = 0;

   431

		do {

   432

			ChangeTileOwner(tile, old_owner, new_owner);

   433

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

   434

   435

		if (new_owner != INVALID_OWNER) {

   436

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

   437

			 * and signals were not propagated

   438

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

   439

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

   440

			tile = 0;

   441

   442

			do {

   443

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

   444

					TrackBits tracks = GetTrackBits(tile);

   445

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

   446

						Track track = RemoveFirstTrack(&tracks);

   447

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

   448

					} while (tracks != TRACK_BIT_NONE);

   449

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

   450

					UpdateLevelCrossing(tile);

   451

				}

   452

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

   453

		}

   454

   455

		/* update signals in buffer */

   456

		UpdateSignalsInBuffer();

   457

	}

   458

   459

	/* In all cases clear replace engine rules.

   460

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

   461

	RemoveAllEngineReplacementForCompany(GetCompany(old_owner));

   462

   463

	if (new_owner == INVALID_OWNER) {

   464

		RemoveAllGroupsForCompany(old_owner);

   465

	} else {

   466

		Group *g;

   467

		FOR_ALL_GROUPS(g) {

   468

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

   469

		}

   470

	}

   471

   472

	Sign *si;

   473

	FOR_ALL_SIGNS(si) {

   474

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

   475

	}

   476

   477

	/* Change color of existing windows */

   478

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

   479

   480

	_current_company = old;

   481

   482

	MarkWholeScreenDirty();

   483

}

   484

   485