1

#include "stdafx.h"

     2

#include "ttd.h"

     3

#include "vehicle.h"

     4

#include "gfx.h"

     5

#include "assert.h"

     6

#include "saveload.h"

     7

     8

extern void StartupEconomy();

     9

extern void InitNewsItemStructs();

    10

    11

static uint32 _random_seed_3, _random_seed_4;

    12

    13

byte _name_array[512][32];

    14

    15

static INLINE uint32 ROR(uint32 x, int n)

    16

{

    17

	return (x >> n) + (x << ((sizeof(x)*8)-n));

    18

}

    19

    20

    21

uint32 Random()

    22

{

    23

	uint32 t = _random_seed_2;

    24

	uint32 s = _random_seed_1;

    25

	_random_seed_1 = s + ROR(t ^ 0x1234567F, 7);

    26

	return _random_seed_2 = ROR(s, 3);

    27

}

    28

    29

uint RandomRange(uint max)

    30

{

    31

	return (uint16)Random() * max >> 16;

    32

}

    33

    34

uint32 InteractiveRandom()

    35

{

    36

	uint32 t = _random_seed_4;

    37

	uint32 s = _random_seed_3;

    38

	_random_seed_3 = s + ROR(t ^ 0x1234567F, 7);

    39

	return _random_seed_4 = ROR(s, 3);

    40

}

    41

    42

void memswap(void *a, void *b, size_t size) {

    43

	void *c = alloca(size);

    44

	memcpy(c, a, size);

    45

	memcpy(a, b, size);

    46

	memcpy(b, c, size);

    47

}

    48

    49

void SetDate(uint date)

    50

{

    51

	YearMonthDay ymd;

    52

	ConvertDayToYMD(&ymd, _date = date);

    53

	_cur_year = ymd.year;

    54

	_cur_month = ymd.month;

    55

}

    56

    57

void InitializeClearLand();

    58

void InitializeRail();

    59

void InitializeRailGui();

    60

void InitializeRoad();

    61

void InitializeRoadGui();

    62

void InitializeAirportGui();

    63

void InitializeDock();

    64

void InitializeDockGui();

    65

void InitializeIndustries();

    66

void InitializeLandscape();

    67

void InitializeTowns();

    68

void InitializeTrees();

    69

void InitializeStations();

    70

void InitializeNameMgr();

    71

void InitializePlayers();

    72

void InitializeCheats();

    73

    74

void GenerateLandscape();

    75

void GenerateClearTile();

    76

    77

void GenerateIndustries();

    78

void GenerateUnmovables();

    79

void GenerateTowns();

    80

    81

void StartupPlayers();

    82

void StartupEngines();

    83

void StartupDisasters();

    84

void GenerateTrees();

    85

    86

void ConvertGroundTilesIntoWaterTiles();

    87

    88

void InitializeGame()

    89

{

    90

	SetObjectToPlace(1, 0, 0, 0);

    91

    92

	_pause = 0;

    93

	_fast_forward = 0;

    94

	_tick_counter = 0;

    95

	_date_fract = 0;

    96

	_cur_tileloop_tile = 0;

    97

	_vehicle_id_ctr_day = 0;

    98

    99

	{

   100

		uint starting = ConvertIntDate(_patches.starting_date);

   101

		if ( starting == (uint)-1) starting = 10958;

   102

		SetDate(starting);

   103

	}

   104

   105

	InitializeVehicles();

   106

	_backup_orders_tile = 0;

   107

   108

	InitNewsItemStructs();

   109

	InitializeLandscape();

   110

	InitializeClearLand();

   111

	InitializeRail();

   112

	InitializeRailGui();

   113

	InitializeRoad();

   114

	InitializeRoadGui();

   115

	InitializeAirportGui();

   116

	InitializeDock();

   117

	InitializeDockGui();

   118

	InitializeTowns();

   119

	InitializeTrees();

   120

	InitializeStations();

   121

	InitializeIndustries();

   122

   123

	InitializeNameMgr();

   124

	InitializeVehiclesGuiList();

   125

	InitializeTrains();

   126

   127

	InitializePlayers();

   128

	InitializeCheats();

   129

   130

	InitTextEffects();

   131

	InitializeAnimatedTiles();

   132

   133

	InitializeLandscapeVariables(false);

   134

   135

	ResetObjectToPlace();

   136

}

   137

   138

void GenerateWorld(int mode)

   139

{

   140

	int i;

   141

   142

	_generating_world = true;

   143

	InitializeGame();

   144

	SetObjectToPlace(1, 0, 0, 0);

   145

   146

	// Must start economy early because of the costs.

   147

	StartupEconomy();

   148

   149

	// Don't generate landscape items when in the scenario editor.

   150

	if (mode == 1) {

   151

		// empty world in scenario editor

   152

		ConvertGroundTilesIntoWaterTiles();

   153

	} else {

   154

		GenerateLandscape();

   155

		GenerateClearTile();

   156

   157

		// only generate towns, tree and industries in newgame mode.

   158

		if (mode == 0) {

   159

			GenerateTowns();

   160

			GenerateTrees();

   161

			GenerateIndustries();

   162

			GenerateUnmovables();

   163

		}

   164

	}

   165

   166

	// These are probably pointless when inside the scenario editor.	

   167

	StartupPlayers();

   168

	StartupEngines();

   169

	StartupDisasters();

   170

	_generating_world = false;

   171

   172

	// No need to run the tile loop in the scenario editor.

   173

	if (mode != 1) {

   174

		for(i=0x500; i!=0; i--)

   175

			RunTileLoop();

   176

	}

   177

   178

	ResetObjectToPlace();

   179

}

   180

   181

void DeleteName(StringID id)

   182

{

   183

	if ((id & 0xF800) == 0x7800) {

   184

		memset(_name_array[id & 0x1FF], 0, sizeof(_name_array[id & 0x1FF]));

   185

	}

   186

}

   187

   188

byte *GetName(int id, byte *buff)

   189

{

   190

	byte *b;

   191

   192

	if (id & 0x600) {

   193

		if (id & 0x200) {

   194

			if (id & 0x400) {

   195

				GetParamInt32();

   196

				GetParamUint16();

   197

			} else {

   198

				GetParamUint16();

   199

			}

   200

		} else {

   201

			GetParamInt32();

   202

		}

   203

	}

   204

   205

	b = _name_array[(id&~0x600)];

   206

	while ((*buff++ = *b++) != 0);

   207

   208

	return buff - 1;

   209

}

   210

   211

   212

void InitializeCheats()

   213

{

   214

	memset(&_cheats, 0, sizeof(Cheats)); 

   215

}

   216

   217

   218

void InitializeNameMgr()

   219

{

   220

	memset(_name_array, 0, sizeof(_name_array));

   221

}

   222

   223

StringID AllocateName(const byte *name, byte skip)

   224

{

   225

	int free_item = -1;

   226

	const byte *names;

   227

	byte *dst;

   228

	int i;

   229

   230

	names = &_name_array[0][0];

   231

   232

	for(i=0; i!=512; i++,names+=sizeof(_name_array[0])) {

   233

		if (names[0] == 0) {

   234

			if (free_item == -1)

   235

				free_item = i;

   236

		} else {

   237

			if (str_eq(names, name)) {

   238

				_error_message = STR_0132_CHOSEN_NAME_IN_USE_ALREADY;

   239

				return 0;

   240

			}

   241

		}

   242

	}

   243

   244

	if (free_item < 0) {

   245

		_error_message = STR_0131_TOO_MANY_NAMES_DEFINED;

   246

		return 0;

   247

	}

   248

   249

	dst=_name_array[free_item];

   250

   251

	for(i=0; (dst[i] = name[i]) != 0 && ++i != 32; ) {}

   252

	dst[31] = 0;

   253

   254

	return free_item | 0x7800 | (skip << 8);

   255

}

   256

   257

const TileIndexDiff _tileoffs_by_dir[4] = {

   258

	TILE_XY(-1, 0),

   259

	TILE_XY(0, 1),

   260

	TILE_XY(1, 0),

   261

	TILE_XY(0, -1),

   262

};

   263

   264

   265

#define M(a,b) ((a<<5)|b)

   266

static const uint16 _month_date_from_year_day[] = {

   267

M(0,1),M(0,2),M(0,3),M(0,4),M(0,5),M(0,6),M(0,7),M(0,8),M(0,9),M(0,10),M(0,11),M(0,12),M(0,13),M(0,14),M(0,15),M(0,16),M(0,17),M(0,18),M(0,19),M(0,20),M(0,21),M(0,22),M(0,23),M(0,24),M(0,25),M(0,26),M(0,27),M(0,28),M(0,29),M(0,30),M(0,31),

   268

M(1,1),M(1,2),M(1,3),M(1,4),M(1,5),M(1,6),M(1,7),M(1,8),M(1,9),M(1,10),M(1,11),M(1,12),M(1,13),M(1,14),M(1,15),M(1,16),M(1,17),M(1,18),M(1,19),M(1,20),M(1,21),M(1,22),M(1,23),M(1,24),M(1,25),M(1,26),M(1,27),M(1,28),M(1,29),

   269

M(2,1),M(2,2),M(2,3),M(2,4),M(2,5),M(2,6),M(2,7),M(2,8),M(2,9),M(2,10),M(2,11),M(2,12),M(2,13),M(2,14),M(2,15),M(2,16),M(2,17),M(2,18),M(2,19),M(2,20),M(2,21),M(2,22),M(2,23),M(2,24),M(2,25),M(2,26),M(2,27),M(2,28),M(2,29),M(2,30),M(2,31),

   270

M(3,1),M(3,2),M(3,3),M(3,4),M(3,5),M(3,6),M(3,7),M(3,8),M(3,9),M(3,10),M(3,11),M(3,12),M(3,13),M(3,14),M(3,15),M(3,16),M(3,17),M(3,18),M(3,19),M(3,20),M(3,21),M(3,22),M(3,23),M(3,24),M(3,25),M(3,26),M(3,27),M(3,28),M(3,29),M(3,30),

   271

M(4,1),M(4,2),M(4,3),M(4,4),M(4,5),M(4,6),M(4,7),M(4,8),M(4,9),M(4,10),M(4,11),M(4,12),M(4,13),M(4,14),M(4,15),M(4,16),M(4,17),M(4,18),M(4,19),M(4,20),M(4,21),M(4,22),M(4,23),M(4,24),M(4,25),M(4,26),M(4,27),M(4,28),M(4,29),M(4,30),M(4,31),

   272

M(5,1),M(5,2),M(5,3),M(5,4),M(5,5),M(5,6),M(5,7),M(5,8),M(5,9),M(5,10),M(5,11),M(5,12),M(5,13),M(5,14),M(5,15),M(5,16),M(5,17),M(5,18),M(5,19),M(5,20),M(5,21),M(5,22),M(5,23),M(5,24),M(5,25),M(5,26),M(5,27),M(5,28),M(5,29),M(5,30),

   273

M(6,1),M(6,2),M(6,3),M(6,4),M(6,5),M(6,6),M(6,7),M(6,8),M(6,9),M(6,10),M(6,11),M(6,12),M(6,13),M(6,14),M(6,15),M(6,16),M(6,17),M(6,18),M(6,19),M(6,20),M(6,21),M(6,22),M(6,23),M(6,24),M(6,25),M(6,26),M(6,27),M(6,28),M(6,29),M(6,30),M(6,31),

   274

M(7,1),M(7,2),M(7,3),M(7,4),M(7,5),M(7,6),M(7,7),M(7,8),M(7,9),M(7,10),M(7,11),M(7,12),M(7,13),M(7,14),M(7,15),M(7,16),M(7,17),M(7,18),M(7,19),M(7,20),M(7,21),M(7,22),M(7,23),M(7,24),M(7,25),M(7,26),M(7,27),M(7,28),M(7,29),M(7,30),M(7,31),

   275

M(8,1),M(8,2),M(8,3),M(8,4),M(8,5),M(8,6),M(8,7),M(8,8),M(8,9),M(8,10),M(8,11),M(8,12),M(8,13),M(8,14),M(8,15),M(8,16),M(8,17),M(8,18),M(8,19),M(8,20),M(8,21),M(8,22),M(8,23),M(8,24),M(8,25),M(8,26),M(8,27),M(8,28),M(8,29),M(8,30),

   276

M(9,1),M(9,2),M(9,3),M(9,4),M(9,5),M(9,6),M(9,7),M(9,8),M(9,9),M(9,10),M(9,11),M(9,12),M(9,13),M(9,14),M(9,15),M(9,16),M(9,17),M(9,18),M(9,19),M(9,20),M(9,21),M(9,22),M(9,23),M(9,24),M(9,25),M(9,26),M(9,27),M(9,28),M(9,29),M(9,30),M(9,31),

   277

M(10,1),M(10,2),M(10,3),M(10,4),M(10,5),M(10,6),M(10,7),M(10,8),M(10,9),M(10,10),M(10,11),M(10,12),M(10,13),M(10,14),M(10,15),M(10,16),M(10,17),M(10,18),M(10,19),M(10,20),M(10,21),M(10,22),M(10,23),M(10,24),M(10,25),M(10,26),M(10,27),M(10,28),M(10,29),M(10,30),

   278

M(11,1),M(11,2),M(11,3),M(11,4),M(11,5),M(11,6),M(11,7),M(11,8),M(11,9),M(11,10),M(11,11),M(11,12),M(11,13),M(11,14),M(11,15),M(11,16),M(11,17),M(11,18),M(11,19),M(11,20),M(11,21),M(11,22),M(11,23),M(11,24),M(11,25),M(11,26),M(11,27),M(11,28),M(11,29),M(11,30),M(11,31),

   279

};

   280

#undef M

   281

   282

enum {

   283

	ACCUM_JAN = 0,

   284

	ACCUM_FEB = ACCUM_JAN + 31,

   285

	ACCUM_MAR = ACCUM_FEB + 29,

   286

	ACCUM_APR = ACCUM_MAR + 31,

   287

	ACCUM_MAY = ACCUM_APR + 30,

   288

	ACCUM_JUN = ACCUM_MAY + 31,

   289

	ACCUM_JUL = ACCUM_JUN + 30,

   290

	ACCUM_AUG = ACCUM_JUL + 31,

   291

	ACCUM_SEP = ACCUM_AUG + 31,

   292

	ACCUM_OCT = ACCUM_SEP + 30,

   293

	ACCUM_NOV = ACCUM_OCT + 31,

   294

	ACCUM_DEC = ACCUM_NOV + 30,

   295

};

   296

   297

static const uint16 _accum_days_for_month[] = {

   298

	ACCUM_JAN,ACCUM_FEB,ACCUM_MAR,ACCUM_APR,

   299

	ACCUM_MAY,ACCUM_JUN,ACCUM_JUL,ACCUM_AUG,

   300

	ACCUM_SEP,ACCUM_OCT,ACCUM_NOV,ACCUM_DEC,

   301

};

   302

   303

   304

void ConvertDayToYMD(YearMonthDay *ymd, uint16 date)

   305

{

   306

	uint yr = date / (365+365+365+366);

   307

	uint rem = date % (365+365+365+366);

   308

	uint x;

   309

   310

	yr *= 4;

   311

   312

	if (rem >= 366) {

   313

		rem--;

   314

		do {

   315

			rem -= 365;

   316

			yr++;

   317

		} while (rem >= 365);

   318

		if (rem >= 31+28) rem++;

   319

	}

   320

   321

	ymd->year = yr;

   322

   323

	x = _month_date_from_year_day[rem];

   324

	ymd->month = x >> 5;

   325

	ymd->day = x & 0x1F;

   326

}

   327

   328

// year is a number between 0..?

   329

// month is a number between 0..11

   330

// day is a number between 1..31

   331

uint ConvertYMDToDay(uint year, uint month, uint day)

   332

{

   333

	uint rem;

   334

   335

	// day in the year

   336

	rem = _accum_days_for_month[month] + day - 1;

   337

   338

	// remove feb 29 from year 1,2,3

   339

	if (year & 3) rem += (year & 3) * 365 + (rem < 31+29);

   340

   341

	// base date.

   342

	return (year >> 2) * (365+365+365+366) + rem;

   343

}

   344

   345

// convert a date on the form

   346

// 1920 - 2090

   347

// 192001 - 209012

   348

// 19200101 - 20901231

   349

// or if > 2090 and below 65536, treat it as a daycount

   350

// returns -1 if no conversion was possible

   351

uint ConvertIntDate(uint date)

   352

{

   353

	uint year, month = 0, day = 1;

   354

   355

	if (IS_INT_INSIDE(date, 1920, 2090 + 1)) {

   356

		year = date - 1920;

   357

	} else if (IS_INT_INSIDE(date, 192001, 209012+1)) {

   358

		month = date % 100 - 1;	

   359

		year = date / 100 - 1920;

   360

	} else if (IS_INT_INSIDE(date, 19200101, 20901231+1)) {

   361

		day = date % 100; date /= 100;

   362

		month = date % 100 - 1;	

   363

		year = date / 100 - 1920;

   364

	} else if (IS_INT_INSIDE(date, 2091, 65536))

   365

		return date;

   366

	else

   367

		return (uint)-1;

   368

   369

	// invalid ranges?

   370

	if (month >= 12 || !IS_INT_INSIDE(day, 1, 31+1)) return (uint)-1;

   371

   372

	return ConvertYMDToDay(year, month, day);

   373

}

   374

   375

typedef struct LandscapePredefVar {

   376

	StringID names[NUM_CARGO];

   377

	byte weights[NUM_CARGO];

   378

	StringID sprites[NUM_CARGO];

   379

   380

	uint16 initial_cargo_payment[NUM_CARGO];

   381

	byte transit_days_table_1[NUM_CARGO];

   382

	byte transit_days_table_2[NUM_CARGO];

   383

   384

	byte railwagon_by_cargo[3][NUM_CARGO];

   385

   386

	byte road_veh_by_cargo_start[NUM_CARGO];

   387

	byte road_veh_by_cargo_count[NUM_CARGO];

   388

} LandscapePredefVar;

   389

   390

#include "table/landscape_const.h"

   391

   392

   393

// Calculate constants that depend on the landscape type.

   394

void InitializeLandscapeVariables(bool only_constants)

   395

{

   396

	const LandscapePredefVar *lpd;

   397

	int i;

   398

	StringID str;

   399

   400

	lpd = &_landscape_predef_var[_opt.landscape];

   401

   402

	memcpy(_cargoc.ai_railwagon, lpd->railwagon_by_cargo, sizeof(lpd->railwagon_by_cargo));

   403

	memcpy(_cargoc.ai_roadveh_start, lpd->road_veh_by_cargo_start,sizeof(lpd->road_veh_by_cargo_start));

   404

	memcpy(_cargoc.ai_roadveh_count, lpd->road_veh_by_cargo_count,sizeof(lpd->road_veh_by_cargo_count));

   405

   406

	for(i=0; i!=NUM_CARGO; i++) {

   407

		_cargoc.sprites[i] = lpd->sprites[i];

   408

   409

		str = lpd->names[i];

   410

		_cargoc.names_s[i] = str;

   411

		_cargoc.names_p[i] = (str += 0x20);

   412

		_cargoc.names_long_s[i] = (str += 0x20);

   413

		_cargoc.names_long_p[i] = (str += 0x20);

   414

		_cargoc.names_short[i] = (str += 0x20);

   415

		_cargoc.weights[i] = lpd->weights[i];

   416

   417

		if (!only_constants) {

   418

			_cargo_payment_rates[i] = lpd->initial_cargo_payment[i];

   419

			_cargo_payment_rates_frac[i] = 0;

   420

		}

   421

   422

		_cargoc.transit_days_1[i] = lpd->transit_days_table_1[i];

   423

		_cargoc.transit_days_2[i] = lpd->transit_days_table_2[i];

   424

	}

   425

}

   426

   427

// distance in Manhattan metric

   428

uint GetTileDist(TileIndex xy1, TileIndex xy2)

   429

{

   430

	return myabs(GET_TILE_X(xy1) - GET_TILE_X(xy2)) + 

   431

				myabs(GET_TILE_Y(xy1) - GET_TILE_Y(xy2));

   432

}

   433

   434

// maximum distance in x _or_ y

   435

uint GetTileDist1D(TileIndex xy1, TileIndex xy2)

   436

{

   437

	return max(myabs(GET_TILE_X(xy1) - GET_TILE_X(xy2)),

   438

						 myabs(GET_TILE_Y(xy1) - GET_TILE_Y(xy2)));

   439

}

   440

   441

uint GetTileDist1Db(TileIndex xy1, TileIndex xy2)

   442

{

   443

	int a = myabs(GET_TILE_X(xy1) - GET_TILE_X(xy2));

   444

	int b = myabs(GET_TILE_Y(xy1) - GET_TILE_Y(xy2));

   445

   446

	if (a > b)

   447

		return a*2+b;

   448

	else

   449

		return b*2+a;

   450

}

   451

   452

uint GetTileDistAdv(TileIndex xy1, TileIndex xy2)

   453

{

   454

	uint a = myabs(GET_TILE_X(xy1) - GET_TILE_X(xy2));

   455

	uint b = myabs(GET_TILE_Y(xy1) - GET_TILE_Y(xy2));

   456

	return a*a+b*b;

   457

}

   458

   459

bool CheckDistanceFromEdge(TileIndex tile, uint distance)

   460

{

   461

	return IS_INT_INSIDE(GET_TILE_X(tile), distance, TILE_X_MAX + 1 - distance) &&

   462

			IS_INT_INSIDE(GET_TILE_Y(tile), distance, TILE_Y_MAX + 1 - distance);

   463

}

   464

   465

void OnNewDay_Train(Vehicle *v);

   466

void OnNewDay_RoadVeh(Vehicle *v);

   467

void OnNewDay_Aircraft(Vehicle *v);

   468

void OnNewDay_Ship(Vehicle *v);

   469

void OnNewDay_EffectVehicle(Vehicle *v) { /* empty */ }

   470

void OnNewDay_DisasterVehicle(Vehicle *v);

   471

   472

typedef void OnNewVehicleDayProc(Vehicle *v);

   473

   474

static OnNewVehicleDayProc * _on_new_vehicle_day_proc[] = {

   475

	OnNewDay_Train,

   476

	OnNewDay_RoadVeh,

   477

	OnNewDay_Ship,

   478

	OnNewDay_Aircraft,

   479

	OnNewDay_EffectVehicle,

   480

	OnNewDay_DisasterVehicle,

   481

};

   482

   483

void EnginesDailyLoop();

   484

void DisasterDailyLoop();

   485

void PlayersMonthlyLoop();

   486

void EnginesMonthlyLoop();

   487

void TownsMonthlyLoop();

   488

void IndustryMonthlyLoop();

   489

void StationMonthlyLoop();

   490

   491

void PlayersYearlyLoop();

   492

void TrainsYearlyLoop();

   493

void RoadVehiclesYearlyLoop();

   494

void AircraftYearlyLoop();

   495

void ShipsYearlyLoop();

   496

   497

void CheckpointsDailyLoop();

   498

   499

   500

static const uint16 _autosave_months[] = {

   501

	0, // never

   502

	0xFFF, // every month

   503

	0x249, // every 3 months

   504

	0x041, // every 6 months

   505

	0x001, // every 12 months

   506

};

   507

   508

void IncreaseDate()

   509

{

   510

	int i,ctr,t;

   511

	YearMonthDay ymd;

   512

   513

	if (_game_mode == GM_MENU) {

   514

		_tick_counter++;

   515

		return;

   516

	}

   517

   518

	/*if the day changed, call the vehicle event but only update a part of the vehicles

   519

		old max was i!= 12. But with that and a bigger number of vehicles (2560), per day only

   520

		a part of it could be done, namely: function called max_size date_fract (uint16) / 885 x 12 ==>

   521

		65536 / 885 = 74; 74x12 = 888. So max 888. Any vehicles above that were not _on_new_vehicle_day_proc'd

   522

		eg. aged.

   523

		So new code updates it for max vehicles.

   524

		(NUM_VEHICLES / maximum number of times ctr is incremented before reset ) + 1 (to get last vehicles too)

   525

		max size of _date_fract / 885 (added each tick) is number of times before ctr is reset.

   526

		Calculation might look complicated, but compiler just replaces it with 35, so that's ok

   527

	*/

   528

   529

	ctr = _vehicle_id_ctr_day;