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

byte _name_array[512][32];

    12

    13

static INLINE uint32 ROR(uint32 x, int n)

    14

{

    15

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

    16

}

    17

    18

// For multiplayer, we introduced this new way of random-seeds

    19

//  It is player-based, so 2 clients can do 2 commands at the same time

    20

//  without the game desyncing.

    21

// It is not used for non-multiplayer games

    22

#ifdef ENABLE_NETWORK

    23

	#define PLAYER_SEED_RANDOM

    24

#else

    25

	#undef PLAYER_SEED_RANDOM

    26

#endif

    27

    28

// its for now not used at all because it is still desyncing :(

    29

#undef PLAYER_SEED_RANDOM

    30

    31

uint32 Random()

    32

{

    33

#ifdef PLAYER_SEED_RANDOM

    34

	if (_current_player>=MAX_PLAYERS || !_networking) {

    35

		uint32 s = _random_seeds[0][0];

    36

		uint32 t = _random_seeds[0][1];

    37

		_random_seeds[0][0] = s + ROR(t ^ 0x1234567F, 7);

    38

		return _random_seeds[0][1] = ROR(s, 3);

    39

	} else {

    40

		uint32 s = _player_seeds[_current_player][0];

    41

		uint32 t = _player_seeds[_current_player][1];

    42

		_player_seeds[_current_player][0] = s + ROR(t ^ 0x1234567F, 7);

    43

		return _player_seeds[_current_player][1] = ROR(s, 3);

    44

	}

    45

#else

    46

	uint32 s = _random_seeds[0][0];

    47

	uint32 t = _random_seeds[0][1];

    48

	_random_seeds[0][0] = s + ROR(t ^ 0x1234567F, 7);

    49

	return _random_seeds[0][1] = ROR(s, 3);

    50

#endif

    51

}

    52

    53

uint RandomRange(uint max)

    54

{

    55

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

    56

}

    57

    58

uint32 InteractiveRandom()

    59

{

    60

	uint32 t = _random_seeds[1][1];

    61

	uint32 s = _random_seeds[1][0];

    62

	_random_seeds[1][0] = s + ROR(t ^ 0x1234567F, 7);

    63

	return _random_seeds[1][1] = ROR(s, 3);

    64

}

    65

    66

uint InteractiveRandomRange(uint max)

    67

{

    68

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

    69

}

    70

    71

void InitPlayerRandoms()

    72

{

    73

	int i;

    74

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

    75

		_player_seeds[i][0]=InteractiveRandom();

    76

		_player_seeds[i][1]=InteractiveRandom();

    77

		}

    78

}

    79

    80

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

    81

	void *c = alloca(size);

    82

	memcpy(c, a, size);

    83

	memcpy(a, b, size);

    84

	memcpy(b, c, size);

    85

}

    86

    87

void SetDate(uint date)

    88

{

    89

	YearMonthDay ymd;

    90

	ConvertDayToYMD(&ymd, _date = date);

    91

	_cur_year = ymd.year;

    92

	_cur_month = ymd.month;

    93

}

    94

    95

void InitializeClearLand();

    96

void InitializeRail();

    97

void InitializeRailGui();

    98

void InitializeRoad();

    99

void InitializeRoadGui();

   100

void InitializeAirportGui();

   101

void InitializeDock();

   102

void InitializeDockGui();

   103

void InitializeIndustries();

   104

void InitializeLandscape();

   105

void InitializeTowns();

   106

void InitializeTrees();

   107

void InitializeStations();

   108

void InitializeNameMgr();

   109

void InitializePlayers();

   110

void InitializeCheats();

   111

   112

void GenerateLandscape();

   113

void GenerateClearTile();

   114

   115

void GenerateIndustries();

   116

void GenerateUnmovables();

   117

void GenerateTowns();

   118

   119

void StartupPlayers();

   120

void StartupEngines();

   121

void StartupDisasters();

   122

void GenerateTrees();

   123

   124

void ConvertGroundTilesIntoWaterTiles();

   125

   126

void InitializeGame()

   127

{

   128

	SetObjectToPlace(1, 0, 0, 0);

   129

   130

	_pause = 0;

   131

	_fast_forward = 0;

   132

	_tick_counter = 0;

   133

	_date_fract = 0;

   134

	_cur_tileloop_tile = 0;

   135

	_vehicle_id_ctr_day = 0;

   136

   137

	{

   138

		uint starting = ConvertIntDate(_patches.starting_date);

   139

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

   140

		SetDate(starting);

   141

	}

   142

   143

	InitializeVehicles();

   144

	_backup_orders_tile = 0;

   145

   146

	InitNewsItemStructs();

   147

	InitializeLandscape();

   148

	InitializeClearLand();

   149

	InitializeRail();

   150

	InitializeRailGui();

   151

	InitializeRoad();

   152

	InitializeRoadGui();

   153

	InitializeAirportGui();

   154

	InitializeDock();

   155

	InitializeDockGui();

   156

	InitializeTowns();

   157

	InitializeTrees();

   158

	InitializeStations();

   159

	InitializeIndustries();

   160

   161

	InitializeNameMgr();

   162

	InitializeVehiclesGuiList();

   163

	InitializeTrains();

   164

   165

	InitializePlayers();

   166

	InitializeCheats();

   167

   168

	InitTextEffects();

   169

	InitializeAnimatedTiles();

   170

   171

	InitializeLandscapeVariables(false);

   172

   173

	ResetObjectToPlace();

   174

}

   175

   176

void GenerateWorld(int mode)

   177

{

   178

	int i;

   179

   180

	_generating_world = true;

   181

	InitializeGame();

   182

	SetObjectToPlace(1, 0, 0, 0);

   183

   184

	// Must start economy early because of the costs.

   185

	StartupEconomy();

   186

   187

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

   188

	if (mode == 1) {

   189

		// empty world in scenario editor

   190

		ConvertGroundTilesIntoWaterTiles();

   191

	} else {

   192

		GenerateLandscape();

   193

		GenerateClearTile();

   194

   195

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

   196

		if (mode == 0) {

   197

			GenerateTowns();

   198

			GenerateTrees();

   199

			GenerateIndustries();

   200

			GenerateUnmovables();

   201

		}

   202

	}

   203

   204

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

   205

	StartupPlayers();

   206

	StartupEngines();

   207

	StartupDisasters();

   208

	_generating_world = false;

   209

   210

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

   211

	if (mode != 1) {

   212

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

   213

			RunTileLoop();

   214

	}

   215

   216

	ResetObjectToPlace();

   217

}

   218

   219

void DeleteName(StringID id)

   220

{

   221

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

   222

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

   223

	}

   224

}

   225

   226

byte *GetName(int id, byte *buff)

   227

{

   228

	byte *b;

   229

   230

	if (id & 0x600) {

   231

		if (id & 0x200) {

   232

			if (id & 0x400) {

   233

				GetParamInt32();

   234

				GetParamUint16();

   235

			} else {

   236

				GetParamUint16();

   237

			}

   238

		} else {

   239

			GetParamInt32();

   240

		}

   241

	}

   242

   243

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

   244

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

   245

   246

	return buff - 1;

   247

}

   248

   249

   250

void InitializeCheats()

   251

{

   252

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

   253

}

   254

   255

   256

void InitializeNameMgr()

   257

{

   258

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

   259

}

   260

   261

StringID AllocateName(const byte *name, byte skip)

   262

{

   263

	int free_item = -1;

   264

	const byte *names;

   265

	byte *dst;

   266

	int i;

   267

   268

	names = &_name_array[0][0];

   269

   270

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

   271

		if (names[0] == 0) {

   272

			if (free_item == -1)

   273

				free_item = i;

   274

		} else {

   275

			if (str_eq(names, name)) {

   276

				_error_message = STR_0132_CHOSEN_NAME_IN_USE_ALREADY;

   277

				return 0;

   278

			}

   279

		}

   280

	}

   281

   282

	if (free_item < 0) {

   283

		_error_message = STR_0131_TOO_MANY_NAMES_DEFINED;

   284

		return 0;

   285

	}

   286

   287

	dst=_name_array[free_item];

   288

   289

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

   290

	dst[31] = 0;

   291

   292

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

   293

}

   294

   295

const TileIndexDiff _tileoffs_by_dir[4] = {

   296

	TILE_XY(-1, 0),

   297

	TILE_XY(0, 1),

   298

	TILE_XY(1, 0),

   299

	TILE_XY(0, -1),

   300

};

   301

   302

   303

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

   304

static const uint16 _month_date_from_year_day[] = {

   305

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),

   306

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),

   307

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),

   308

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),

   309

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),

   310

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),

   311

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),

   312

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),

   313

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),

   314

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),

   315

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),

   316

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),

   317

};

   318

#undef M

   319

   320

enum {

   321

	ACCUM_JAN = 0,

   322

	ACCUM_FEB = ACCUM_JAN + 31,

   323

	ACCUM_MAR = ACCUM_FEB + 29,

   324

	ACCUM_APR = ACCUM_MAR + 31,

   325

	ACCUM_MAY = ACCUM_APR + 30,

   326

	ACCUM_JUN = ACCUM_MAY + 31,

   327

	ACCUM_JUL = ACCUM_JUN + 30,

   328

	ACCUM_AUG = ACCUM_JUL + 31,

   329

	ACCUM_SEP = ACCUM_AUG + 31,

   330

	ACCUM_OCT = ACCUM_SEP + 30,

   331

	ACCUM_NOV = ACCUM_OCT + 31,

   332

	ACCUM_DEC = ACCUM_NOV + 30,

   333

};

   334

   335

static const uint16 _accum_days_for_month[] = {

   336

	ACCUM_JAN,ACCUM_FEB,ACCUM_MAR,ACCUM_APR,

   337

	ACCUM_MAY,ACCUM_JUN,ACCUM_JUL,ACCUM_AUG,

   338

	ACCUM_SEP,ACCUM_OCT,ACCUM_NOV,ACCUM_DEC,

   339

};

   340

   341

   342

void ConvertDayToYMD(YearMonthDay *ymd, uint16 date)

   343

{

   344

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

   345

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

   346

	uint x;

   347

   348

	yr *= 4;

   349

   350

	if (rem >= 366) {

   351

		rem--;

   352

		do {

   353

			rem -= 365;

   354

			yr++;

   355

		} while (rem >= 365);

   356

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

   357

	}

   358

   359

	ymd->year = yr;

   360

   361

	x = _month_date_from_year_day[rem];

   362

	ymd->month = x >> 5;

   363

	ymd->day = x & 0x1F;

   364

}

   365

   366

// year is a number between 0..?

   367

// month is a number between 0..11

   368

// day is a number between 1..31

   369

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

   370

{

   371

	uint rem;

   372

   373

	// day in the year

   374

	rem = _accum_days_for_month[month] + day - 1;

   375

   376

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

   377

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

   378

   379

	// base date.

   380

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

   381

}

   382

   383

// convert a date on the form

   384

// 1920 - 2090

   385

// 192001 - 209012

   386

// 19200101 - 20901231

   387

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

   388

// returns -1 if no conversion was possible

   389

uint ConvertIntDate(uint date)

   390

{

   391

	uint year, month = 0, day = 1;

   392

   393

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

   394

		year = date - 1920;

   395

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

   396

		month = date % 100 - 1;

   397

		year = date / 100 - 1920;

   398

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

   399

		day = date % 100; date /= 100;

   400

		month = date % 100 - 1;

   401

		year = date / 100 - 1920;

   402

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

   403

		return date;

   404

	else

   405

		return (uint)-1;

   406

   407

	// invalid ranges?

   408

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

   409

   410

	return ConvertYMDToDay(year, month, day);

   411

}

   412

   413

typedef struct LandscapePredefVar {

   414

	StringID names[NUM_CARGO];

   415

	byte weights[NUM_CARGO];

   416

	StringID sprites[NUM_CARGO];

   417

   418

	uint16 initial_cargo_payment[NUM_CARGO];

   419

	byte transit_days_table_1[NUM_CARGO];

   420

	byte transit_days_table_2[NUM_CARGO];

   421

   422

	byte railwagon_by_cargo[3][NUM_CARGO];

   423

   424

	byte road_veh_by_cargo_start[NUM_CARGO];

   425

	byte road_veh_by_cargo_count[NUM_CARGO];

   426

} LandscapePredefVar;

   427

   428

#include "table/landscape_const.h"

   429

   430

   431

// Calculate constants that depend on the landscape type.

   432

void InitializeLandscapeVariables(bool only_constants)

   433

{

   434

	const LandscapePredefVar *lpd;

   435

	int i;

   436

	StringID str;

   437

   438

	lpd = &_landscape_predef_var[_opt.landscape];

   439

   440

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

   441

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

   442

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

   443

   444

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

   445

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

   446

   447

		str = lpd->names[i];

   448

		_cargoc.names_s[i] = str;

   449

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

   450

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

   451

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

   452

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

   453

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

   454

   455

		if (!only_constants) {

   456

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

   457

			_cargo_payment_rates_frac[i] = 0;

   458

		}

   459

   460

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

   461

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

   462

	}

   463

}

   464

   465

// distance in Manhattan metric

   466

uint GetTileDist(TileIndex xy1, TileIndex xy2)

   467

{

   468

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

   469

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

   470

}

   471

   472

// maximum distance in x _or_ y

   473

uint GetTileDist1D(TileIndex xy1, TileIndex xy2)

   474

{

   475

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

   476

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

   477

}

   478

   479

uint GetTileDist1Db(TileIndex xy1, TileIndex xy2)

   480

{

   481

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

   482

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

   483

   484

	if (a > b)

   485

		return a*2+b;

   486

	else

   487

		return b*2+a;

   488

}

   489

   490

uint GetTileDistAdv(TileIndex xy1, TileIndex xy2)

   491

{

   492

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

   493

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

   494

	return a*a+b*b;

   495

}

   496

   497

bool CheckDistanceFromEdge(TileIndex tile, uint distance)

   498

{

   499

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

   500

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

   501

}

   502

   503

void OnNewDay_Train(Vehicle *v);

   504

void OnNewDay_RoadVeh(Vehicle *v);

   505

void OnNewDay_Aircraft(Vehicle *v);

   506

void OnNewDay_Ship(Vehicle *v);

   507

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

   508

void OnNewDay_DisasterVehicle(Vehicle *v);

   509

   510

typedef void OnNewVehicleDayProc(Vehicle *v);

   511

   512

static OnNewVehicleDayProc * _on_new_vehicle_day_proc[] = {

   513

	OnNewDay_Train,

   514

	OnNewDay_RoadVeh,

   515

	OnNewDay_Ship,

   516

	OnNewDay_Aircraft,

   517

	OnNewDay_EffectVehicle,

   518

	OnNewDay_DisasterVehicle,

   519

};

   520

   521

void EnginesDailyLoop();

   522

void DisasterDailyLoop();

   523

void PlayersMonthlyLoop();