1

#include "stdafx.h"

     2

#include "ttd.h"

     3

#include "table/strings.h"

     4

#include "map.h"

     5

#include "vehicle.h"

     6

#include "gfx.h"

     7

#include "assert.h"

     8

#include "saveload.h"

     9

#include "network.h"

    10

#include "network_data.h"

    11

#include "network_server.h"

    12

#include "engine.h"

    13

    14

extern void StartupEconomy();

    15

extern void InitNewsItemStructs();

    16

    17

byte _name_array[512][32];

    18

    19

static inline uint32 ROR(uint32 x, int n)

    20

{

    21

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

    22

}

    23

    24

/* XXX - Player-seeds don't seem to be used anymore.. which is a good thing

    25

     so I just disabled them for now. If there are no problems, we can remove

    26

     it completely! -- TrueLight */

    27

#undef PLAYER_SEED_RANDOM

    28

    29

#ifdef RANDOM_DEBUG

    30

#include "network_data.h"

    31

    32

uint32 DoRandom(uint line, char *file)

    33

#else

    34

uint32 Random()

    35

#endif

    36

{

    37

#ifdef RANDOM_DEBUG

    38

	if (_networking && (DEREF_CLIENT(0)->status != STATUS_INACTIVE || !_network_server))

    39

		printf("Random [%d/%d] %s:%d\n",_frame_counter, _current_player, file, line);

    40

#endif

    41

    42

#ifdef PLAYER_SEED_RANDOM

    43

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

    44

		uint32 s = _random_seeds[0][0];

    45

		uint32 t = _random_seeds[0][1];

    46

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

    47

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

    48

	} else {

    49

		uint32 s = _player_seeds[_current_player][0];

    50

		uint32 t = _player_seeds[_current_player][1];

    51

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

    52

		DEBUG(net, 1)("[NET-Seeds] Player seed called!");

    53

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

    54

	}

    55

#else

    56

	uint32 s = _random_seeds[0][0];

    57

	uint32 t = _random_seeds[0][1];

    58

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

    59

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

    60

#endif

    61

}

    62

    63

#ifdef RANDOM_DEBUG

    64

uint DoRandomRange(uint max, uint line, char *file)

    65

{

    66

	return (uint16)DoRandom(line, file) * max >> 16;

    67

}

    68

#else

    69

uint RandomRange(uint max)

    70

{

    71

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

    72

}

    73

#endif

    74

    75

uint32 InteractiveRandom()

    76

{

    77

	uint32 t = _random_seeds[1][1];

    78

	uint32 s = _random_seeds[1][0];

    79

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

    80

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

    81

}

    82

    83

uint InteractiveRandomRange(uint max)

    84

{

    85

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

    86

}

    87

    88

void InitPlayerRandoms()

    89

{

    90

	int i;

    91

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

    92

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

    93

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

    94

	}

    95

}

    96

    97

void SetDate(uint date)

    98

{

    99

	YearMonthDay ymd;

   100

	ConvertDayToYMD(&ymd, _date = date);

   101

	_cur_year = ymd.year;

   102

	_cur_month = ymd.month;

   103

#ifdef ENABLE_NETWORK

   104

	_network_last_advertise_date = 0;

   105

#endif /* ENABLE_NETWORK */

   106

}

   107

   108

   109

// multi os compatible sleep function

   110

   111

#ifdef __AMIGA__

   112

// usleep() implementation

   113

#	include <devices/timer.h>

   114

#	include <dos/dos.h>

   115

   116

	extern struct Device      *TimerBase    = NULL;

   117

	extern struct MsgPort     *TimerPort    = NULL;

   118

	extern struct timerequest *TimerRequest = NULL;

   119

#endif // __AMIGA__

   120

   121

void CSleep(int milliseconds)

   122

{

   123

	#if defined(WIN32)

   124

		Sleep(milliseconds);

   125

	#endif

   126

	#if defined(UNIX)

   127

		#if !defined(__BEOS__) && !defined(__AMIGA__)

   128

			usleep(milliseconds * 1000);

   129

		#endif

   130

		#ifdef __BEOS__

   131

			snooze(milliseconds * 1000);

   132

		#endif

   133

		#if defined(__AMIGA__)

   134

		{

   135

			ULONG signals;

   136

			ULONG TimerSigBit = 1 << TimerPort->mp_SigBit;

   137

   138

			// send IORequest

   139

			TimerRequest->tr_node.io_Command = TR_ADDREQUEST;

   140

			TimerRequest->tr_time.tv_secs    = (milliseconds * 1000) / 1000000;

   141

			TimerRequest->tr_time.tv_micro   = (milliseconds * 1000) % 1000000;

   142

			SendIO((struct IORequest *)TimerRequest);

   143

   144

			if (!((signals = Wait(TimerSigBit | SIGBREAKF_CTRL_C)) & TimerSigBit) ) {

   145

				AbortIO((struct IORequest *)TimerRequest);

   146

			}

   147

			WaitIO((struct IORequest *)TimerRequest);

   148

		}

   149

		#endif // __AMIGA__

   150

	#endif

   151

}

   152

   153

void InitializeClearLand();

   154

void InitializeRail();

   155

void InitializeRailGui();

   156

void InitializeRoad();

   157

void InitializeRoadGui();

   158

void InitializeAirportGui();

   159

void InitializeDock();

   160

void InitializeDockGui();

   161

void InitializeIndustries();

   162

void InitializeLandscape();

   163

void InitializeTowns();

   164

void InitializeTrees();

   165

void InitializeSigns();

   166

void InitializeStations();

   167

static void InitializeNameMgr();

   168

void InitializePlayers();

   169

static void InitializeCheats();

   170

   171

void GenerateLandscape();

   172

void GenerateClearTile();

   173

   174

void GenerateIndustries();

   175

void GenerateUnmovables();

   176

void GenerateTowns();

   177

   178

void StartupPlayers();

   179

void StartupDisasters();

   180

void GenerateTrees();

   181

   182

void ConvertGroundTilesIntoWaterTiles();

   183

   184

void InitializeGame()

   185

{

   186

	// Initialize the autoreplace array. Needs to be cleared between each game

   187

	uint i;

   188

	for (i = 0; i < lengthof(_autoreplace_array); i++)

   189

		_autoreplace_array[i] = i;

   190

   191

	AddTypeToEngines(); // make sure all engines have a type

   192

   193

	SetObjectToPlace(1, 0, 0, 0);

   194

   195

	_pause = 0;

   196

	_fast_forward = 0;

   197

	_tick_counter = 0;

   198

	_date_fract = 0;

   199

	_cur_tileloop_tile = 0;

   200

	_vehicle_id_ctr_day = 0;

   201

   202

	{

   203

		uint starting = ConvertIntDate(_patches.starting_date);

   204

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

   205

		SetDate(starting);

   206

	}

   207

   208

	InitializeVehicles();

   209

	_backup_orders_tile = 0;

   210

   211

	InitNewsItemStructs();

   212

	InitializeLandscape();

   213

	InitializeClearLand();

   214

	InitializeRail();

   215

	InitializeRailGui();

   216

	InitializeRoad();

   217

	InitializeRoadGui();

   218

	InitializeAirportGui();

   219

	InitializeDock();

   220

	InitializeDockGui();

   221

	InitializeTowns();

   222

	InitializeTrees();

   223

	InitializeSigns();

   224

	InitializeStations();

   225

	InitializeIndustries();

   226

   227

	InitializeNameMgr();

   228

	InitializeVehiclesGuiList();

   229

	InitializeTrains();

   230

   231

	InitializePlayers();

   232

	InitializeCheats();

   233

   234

	InitTextEffects();

   235

	InitTextMessage();

   236

	InitializeAnimatedTiles();

   237

   238

	InitializeLandscapeVariables(false);

   239

   240

	ResetObjectToPlace();

   241

}

   242

   243

void GenerateWorld(int mode)

   244

{

   245

	int i;

   246

   247

	// Make sure everything is done via OWNER_NONE

   248

	_current_player = OWNER_NONE;

   249

   250

	_generating_world = true;

   251

	InitializeGame();

   252

	SetObjectToPlace(1, 0, 0, 0);

   253

   254

	// Must start economy early because of the costs.

   255

	StartupEconomy();

   256

   257

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

   258

	if (mode == 1) {

   259

		// empty world in scenario editor

   260

		ConvertGroundTilesIntoWaterTiles();

   261

	} else {

   262

		GenerateLandscape();

   263

		GenerateClearTile();

   264

   265

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

   266

		if (mode == 0) {

   267

			GenerateTowns();

   268

			GenerateTrees();

   269

			GenerateIndustries();

   270

			GenerateUnmovables();

   271

		}

   272

	}

   273

   274

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

   275

	StartupPlayers();

   276

	StartupEngines();

   277

	StartupDisasters();

   278

	_generating_world = false;

   279

   280

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

   281

	if (mode != 1) {

   282

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

   283

			RunTileLoop();

   284

	}

   285

   286

	ResetObjectToPlace();

   287

}

   288

   289

void DeleteName(StringID id)

   290

{

   291

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

   292

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

   293

	}

   294

}

   295

   296

byte *GetName(int id, byte *buff)

   297

{

   298

	byte *b;

   299

   300

	if (id & 0x600) {

   301

		if (id & 0x200) {

   302

			if (id & 0x400) {

   303

				GetParamInt32();

   304

				GetParamUint16();

   305

			} else {

   306

				GetParamUint16();

   307

			}

   308

		} else {

   309

			GetParamInt32();

   310

		}

   311

	}

   312

   313

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

   314

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

   315

   316

	return buff - 1;

   317

}

   318

   319

   320

static void InitializeCheats()

   321

{

   322

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

   323

}

   324

   325

   326

static void InitializeNameMgr()

   327

{

   328

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

   329

}

   330

   331

StringID RealAllocateName(const byte *name, byte skip, bool check_double)

   332

{

   333

	int free_item = -1;

   334

	const byte *names;

   335

	byte *dst;

   336

	int i;

   337

   338

	names = &_name_array[0][0];

   339

   340

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

   341

		if (names[0] == 0) {

   342

			if (free_item == -1)

   343

				free_item = i;

   344

		} else {

   345

			if (check_double && str_eq(names, name)) {

   346

				_error_message = STR_0132_CHOSEN_NAME_IN_USE_ALREADY;

   347

				return 0;

   348

			}

   349

		}

   350

	}

   351

   352

	if (free_item < 0) {

   353

		_error_message = STR_0131_TOO_MANY_NAMES_DEFINED;

   354

		return 0;

   355

	}

   356

   357

	dst=_name_array[free_item];

   358

   359

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

   360

	dst[31] = 0;

   361

   362

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

   363

}

   364

   365

   366

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

   367

static const uint16 _month_date_from_year_day[] = {

   368

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

   369

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

   370

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

   371

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

   372

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

   373

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

   374

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

   375

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

   376

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

   377

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

   378

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

   379

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

   380

};

   381

#undef M

   382

   383

enum {

   384

	ACCUM_JAN = 0,

   385

	ACCUM_FEB = ACCUM_JAN + 31,

   386

	ACCUM_MAR = ACCUM_FEB + 29,

   387

	ACCUM_APR = ACCUM_MAR + 31,

   388

	ACCUM_MAY = ACCUM_APR + 30,

   389

	ACCUM_JUN = ACCUM_MAY + 31,

   390

	ACCUM_JUL = ACCUM_JUN + 30,

   391

	ACCUM_AUG = ACCUM_JUL + 31,

   392

	ACCUM_SEP = ACCUM_AUG + 31,

   393

	ACCUM_OCT = ACCUM_SEP + 30,

   394

	ACCUM_NOV = ACCUM_OCT + 31,

   395

	ACCUM_DEC = ACCUM_NOV + 30,

   396

};

   397

   398

static const uint16 _accum_days_for_month[] = {

   399

	ACCUM_JAN,ACCUM_FEB,ACCUM_MAR,ACCUM_APR,

   400

	ACCUM_MAY,ACCUM_JUN,ACCUM_JUL,ACCUM_AUG,

   401

	ACCUM_SEP,ACCUM_OCT,ACCUM_NOV,ACCUM_DEC,

   402

};

   403

   404

   405

void ConvertDayToYMD(YearMonthDay *ymd, uint16 date)

   406

{

   407

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

   408

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

   409

	uint x;

   410

   411

	yr *= 4;

   412

   413

	if (rem >= 366) {

   414

		rem--;

   415

		do {

   416

			rem -= 365;

   417

			yr++;

   418

		} while (rem >= 365);

   419

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

   420

	}

   421

   422

	ymd->year = yr;

   423

   424

	x = _month_date_from_year_day[rem];

   425

	ymd->month = x >> 5;

   426

	ymd->day = x & 0x1F;

   427

}

   428

   429

// year is a number between 0..?

   430

// month is a number between 0..11

   431

// day is a number between 1..31

   432

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

   433

{

   434

	uint rem;

   435

   436

	// day in the year

   437

	rem = _accum_days_for_month[month] + day - 1;

   438

   439

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

   440

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

   441

   442

	// base date.

   443

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

   444

}

   445

   446

// convert a date on the form

   447

// 1920 - 2090 (MAX_YEAR_END_REAL)

   448

// 192001 - 209012

   449

// 19200101 - 20901231

   450

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

   451

// returns -1 if no conversion was possible

   452

uint ConvertIntDate(uint date)

   453

{

   454

	uint year, month = 0, day = 1;

   455

   456

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

   457

		year = date - 1920;

   458

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

   459

		month = date % 100 - 1;

   460

		year = date / 100 - 1920;

   461

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

   462

		day = date % 100; date /= 100;

   463

		month = date % 100 - 1;

   464

		year = date / 100 - 1920;

   465

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

   466

		return date;

   467

	else

   468

		return (uint)-1;

   469

   470

	// invalid ranges?

   471

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

   472

   473

	return ConvertYMDToDay(year, month, day);

   474

}

   475

   476

typedef struct LandscapePredefVar {

   477

	StringID names[NUM_CARGO];

   478

	byte weights[NUM_CARGO];

   479

	StringID sprites[NUM_CARGO];

   480

   481

	uint16 initial_cargo_payment[NUM_CARGO];

   482

	byte transit_days_table_1[NUM_CARGO];

   483

	byte transit_days_table_2[NUM_CARGO];

   484

   485

	byte railwagon_by_cargo[3][NUM_CARGO];

   486

   487

	byte road_veh_by_cargo_start[NUM_CARGO];

   488

	byte road_veh_by_cargo_count[NUM_CARGO];

   489

} LandscapePredefVar;

   490

   491

#include "table/landscape_const.h"

   492

   493

   494

// Calculate constants that depend on the landscape type.

   495

void InitializeLandscapeVariables(bool only_constants)

   496

{

   497

	const LandscapePredefVar *lpd;

   498

	int i;

   499

	StringID str;

   500

   501

	lpd = &_landscape_predef_var[_opt.landscape];

   502

   503

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

   504

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

   505

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

   506

   507

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

   508

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

   509

   510

		str = lpd->names[i];

   511

		_cargoc.names_s[i] = str;

   512

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

   513

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