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

    13

extern void StartupEconomy();

    14

extern void InitNewsItemStructs();

    15

    16

byte _name_array[512][32];

    17

    18

static inline uint32 ROR(uint32 x, int n)

    19

{

    20

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

    21

}

    22

    23

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

    24

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

    25

     it completely! -- TrueLight */

    26

#undef PLAYER_SEED_RANDOM

    27

    28

#ifdef RANDOM_DEBUG

    29

#include "network_data.h"

    30

    31

uint32 DoRandom(uint line, char *file)

    32

#else

    33

uint32 Random()

    34

#endif

    35

{

    36

#ifdef RANDOM_DEBUG

    37

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

    38

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

    39

#endif

    40

    41

#ifdef PLAYER_SEED_RANDOM

    42

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

    43

		uint32 s = _random_seeds[0][0];

    44

		uint32 t = _random_seeds[0][1];

    45

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

    46

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

    47

	} else {

    48

		uint32 s = _player_seeds[_current_player][0];

    49

		uint32 t = _player_seeds[_current_player][1];

    50

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

    51

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

    52

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

    53

	}

    54

#else

    55

	uint32 s = _random_seeds[0][0];

    56

	uint32 t = _random_seeds[0][1];

    57

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

    58

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

    59

#endif

    60

}

    61

    62

#ifdef RANDOM_DEBUG

    63

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

    64

{

    65

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

    66

}

    67

#else

    68

uint RandomRange(uint max)

    69

{

    70

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

    71

}

    72

#endif

    73

    74

uint32 InteractiveRandom()

    75

{

    76

	uint32 t = _random_seeds[1][1];

    77

	uint32 s = _random_seeds[1][0];

    78

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

    79

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

    80

}

    81

    82

uint InteractiveRandomRange(uint max)

    83

{

    84

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

    85

}

    86

    87

void InitPlayerRandoms()

    88

{

    89

	int i;

    90

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

    91

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

    92

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

    93

	}

    94

}

    95

    96

void SetDate(uint date)

    97

{

    98

	YearMonthDay ymd;

    99

	ConvertDayToYMD(&ymd, _date = date);

   100

	_cur_year = ymd.year;

   101

	_cur_month = ymd.month;

   102

#ifdef ENABLE_NETWORK

   103

	_network_last_advertise_date = 0;

   104

#endif /* ENABLE_NETWORK */

   105

}

   106

   107

   108

// multi os compatible sleep function

   109

   110

#if defined(__AMIGA__)

   111

// usleep() implementation

   112

#	include <devices/timer.h>

   113

#	include <dos/dos.h>

   114

   115

	static struct Device      *TimerBase    = NULL;

   116

	static struct MsgPort     *TimerPort    = NULL;

   117

	static struct timerequest *TimerRequest = NULL;

   118

#endif // __AMIGA__

   119

   120

void CSleep(int milliseconds)

   121

{

   122

	#if defined(WIN32)

   123

		Sleep(milliseconds);

   124

	#endif

   125

	#if defined(UNIX)

   126

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

   127

			usleep(milliseconds * 1000);

   128

		#endif

   129

		#ifdef __BEOS__

   130

			snooze(milliseconds * 1000);

   131

		#endif

   132

		#if defined(__AMIGAOS__) && !defined(__MORPHOS__)

   133

		{

   134

			ULONG signals;

   135

			ULONG TimerSigBit = 1 << TimerPort->mp_SigBit;

   136

   137

			// send IORequest

   138

			TimerRequest->tr_node.io_Command = TR_ADDREQUEST;

   139

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

   140

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

   141

			SendIO((struct IORequest *)TimerRequest);

   142

   143

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

   144

				AbortIO((struct IORequest *)TimerRequest);

   145

			}

   146

			WaitIO((struct IORequest *)TimerRequest);

   147

		}

   148

		#endif // __AMIGAOS__ && !__MORPHOS__

   149

	#endif

   150

}

   151

   152

void InitializeClearLand();

   153

void InitializeRail();

   154

void InitializeRailGui();

   155

void InitializeRoad();

   156

void InitializeRoadGui();

   157

void InitializeAirportGui();

   158

void InitializeDock();

   159

void InitializeDockGui();

   160

void InitializeIndustries();

   161

void InitializeLandscape();

   162

void InitializeTowns();

   163

void InitializeTrees();

   164

void InitializeStations();

   165

static void InitializeNameMgr();

   166

void InitializePlayers();

   167

static void InitializeCheats();

   168

   169

void GenerateLandscape();

   170

void GenerateClearTile();

   171

   172

void GenerateIndustries();

   173

void GenerateUnmovables();

   174

void GenerateTowns();

   175

   176

void StartupPlayers();

   177

void StartupEngines();

   178

void StartupDisasters();

   179

void GenerateTrees();

   180

   181

void ConvertGroundTilesIntoWaterTiles();

   182

   183

void InitializeGame()

   184

{

   185

	SetObjectToPlace(1, 0, 0, 0);

   186

   187

	_pause = 0;

   188

	_fast_forward = 0;

   189

	_tick_counter = 0;

   190

	_date_fract = 0;

   191

	_cur_tileloop_tile = 0;

   192

	_vehicle_id_ctr_day = 0;

   193

   194

	{

   195

		uint starting = ConvertIntDate(_patches.starting_date);

   196

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

   197

		SetDate(starting);

   198

	}

   199

   200

	InitializeVehicles();

   201

	_backup_orders_tile = 0;

   202

   203

	InitNewsItemStructs();

   204

	InitializeLandscape();

   205

	InitializeClearLand();

   206

	InitializeRail();

   207

	InitializeRailGui();

   208

	InitializeRoad();

   209

	InitializeRoadGui();

   210

	InitializeAirportGui();

   211

	InitializeDock();

   212

	InitializeDockGui();

   213

	InitializeTowns();

   214

	InitializeTrees();

   215

	InitializeStations();

   216

	InitializeIndustries();

   217

   218

	InitializeNameMgr();

   219

	InitializeVehiclesGuiList();

   220

	InitializeTrains();

   221

   222

	InitializePlayers();

   223

	InitializeCheats();

   224

   225

	InitTextEffects();

   226

	InitTextMessage();

   227

	InitializeAnimatedTiles();

   228

   229

	InitializeLandscapeVariables(false);

   230

   231

	ResetObjectToPlace();

   232

}

   233

   234

void GenerateWorld(int mode)

   235

{

   236

	int i;

   237

   238

	// Make sure everything is done via OWNER_NONE

   239

	_current_player = OWNER_NONE;

   240

   241

	_generating_world = true;

   242

	InitializeGame();

   243

	SetObjectToPlace(1, 0, 0, 0);

   244

   245

	// Must start economy early because of the costs.

   246

	StartupEconomy();

   247

   248

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

   249

	if (mode == 1) {

   250

		// empty world in scenario editor

   251

		ConvertGroundTilesIntoWaterTiles();

   252

	} else {

   253

		GenerateLandscape();

   254

		GenerateClearTile();

   255

   256

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

   257

		if (mode == 0) {

   258

			GenerateTowns();

   259

			GenerateTrees();

   260

			GenerateIndustries();

   261

			GenerateUnmovables();

   262

		}

   263

	}

   264

   265

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

   266

	StartupPlayers();

   267

	StartupEngines();

   268

	StartupDisasters();

   269

	_generating_world = false;

   270

   271

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

   272

	if (mode != 1) {

   273

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

   274

			RunTileLoop();

   275

	}

   276

   277

	ResetObjectToPlace();

   278

}

   279

   280

void DeleteName(StringID id)

   281

{

   282

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

   283

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

   284

	}

   285

}

   286

   287

byte *GetName(int id, byte *buff)

   288

{

   289

	byte *b;

   290

   291

	if (id & 0x600) {

   292

		if (id & 0x200) {

   293

			if (id & 0x400) {

   294

				GetParamInt32();

   295

				GetParamUint16();

   296

			} else {

   297

				GetParamUint16();

   298

			}

   299

		} else {

   300

			GetParamInt32();

   301

		}

   302

	}

   303

   304

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

   305

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

   306

   307

	return buff - 1;

   308

}

   309

   310

   311

static void InitializeCheats()

   312

{

   313

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

   314

}

   315

   316

   317

static void InitializeNameMgr()

   318

{

   319

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

   320

}

   321

   322

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

   323

{

   324

	int free_item = -1;

   325

	const byte *names;

   326

	byte *dst;

   327

	int i;

   328

   329

	names = &_name_array[0][0];

   330

   331

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

   332

		if (names[0] == 0) {

   333

			if (free_item == -1)

   334

				free_item = i;

   335

		} else {

   336

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

   337

				_error_message = STR_0132_CHOSEN_NAME_IN_USE_ALREADY;

   338

				return 0;

   339

			}

   340

		}

   341

	}

   342

   343

	if (free_item < 0) {

   344

		_error_message = STR_0131_TOO_MANY_NAMES_DEFINED;

   345

		return 0;

   346

	}

   347

   348

	dst=_name_array[free_item];

   349

   350

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

   351

	dst[31] = 0;

   352

   353

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

   354

}

   355

   356

const TileIndexDiff _tileoffs_by_dir[4] = {

   357

	TILE_XY(-1, 0),

   358

	TILE_XY(0, 1),

   359

	TILE_XY(1, 0),

   360

	TILE_XY(0, -1),

   361

};

   362

   363

   364

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

   365

static const uint16 _month_date_from_year_day[] = {

   366

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

   367

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

   368

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

   369

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

   370

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

   371

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

   372

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

   373

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

   374

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

   375

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

   376

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

   377

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

   378

};

   379

#undef M

   380

   381

enum {

   382

	ACCUM_JAN = 0,

   383

	ACCUM_FEB = ACCUM_JAN + 31,

   384

	ACCUM_MAR = ACCUM_FEB + 29,

   385

	ACCUM_APR = ACCUM_MAR + 31,

   386

	ACCUM_MAY = ACCUM_APR + 30,

   387

	ACCUM_JUN = ACCUM_MAY + 31,

   388

	ACCUM_JUL = ACCUM_JUN + 30,

   389

	ACCUM_AUG = ACCUM_JUL + 31,

   390

	ACCUM_SEP = ACCUM_AUG + 31,

   391

	ACCUM_OCT = ACCUM_SEP + 30,

   392

	ACCUM_NOV = ACCUM_OCT + 31,

   393

	ACCUM_DEC = ACCUM_NOV + 30,

   394

};

   395

   396

static const uint16 _accum_days_for_month[] = {

   397

	ACCUM_JAN,ACCUM_FEB,ACCUM_MAR,ACCUM_APR,

   398

	ACCUM_MAY,ACCUM_JUN,ACCUM_JUL,ACCUM_AUG,

   399

	ACCUM_SEP,ACCUM_OCT,ACCUM_NOV,ACCUM_DEC,

   400

};

   401

   402

   403

void ConvertDayToYMD(YearMonthDay *ymd, uint16 date)

   404

{

   405

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

   406

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

   407

	uint x;

   408

   409

	yr *= 4;

   410

   411

	if (rem >= 366) {

   412

		rem--;

   413

		do {

   414

			rem -= 365;

   415

			yr++;

   416

		} while (rem >= 365);

   417

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

   418

	}

   419

   420

	ymd->year = yr;

   421

   422

	x = _month_date_from_year_day[rem];

   423

	ymd->month = x >> 5;

   424

	ymd->day = x & 0x1F;

   425

}

   426

   427

// year is a number between 0..?

   428

// month is a number between 0..11

   429

// day is a number between 1..31

   430

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

   431

{

   432

	uint rem;

   433

   434

	// day in the year

   435

	rem = _accum_days_for_month[month] + day - 1;

   436

   437

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

   438

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

   439

   440

	// base date.

   441

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

   442

}

   443

   444

// convert a date on the form

   445

// 1920 - 2090

   446

// 192001 - 209012

   447

// 19200101 - 20901231

   448

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

   449

// returns -1 if no conversion was possible

   450

uint ConvertIntDate(uint date)

   451

{

   452

	uint year, month = 0, day = 1;

   453

   454

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

   455

		year = date - 1920;

   456

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

   457

		month = date % 100 - 1;

   458

		year = date / 100 - 1920;

   459

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

   460

		day = date % 100; date /= 100;

   461

		month = date % 100 - 1;

   462

		year = date / 100 - 1920;

   463

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

   464

		return date;

   465

	else

   466

		return (uint)-1;

   467

   468

	// invalid ranges?

   469

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

   470

   471

	return ConvertYMDToDay(year, month, day);

   472

}

   473

   474

typedef struct LandscapePredefVar {

   475

	StringID names[NUM_CARGO];

   476

	byte weights[NUM_CARGO];

   477

	StringID sprites[NUM_CARGO];

   478

   479

	uint16 initial_cargo_payment[NUM_CARGO];

   480

	byte transit_days_table_1[NUM_CARGO];

   481

	byte transit_days_table_2[NUM_CARGO];

   482

   483

	byte railwagon_by_cargo[3][NUM_CARGO];

   484

   485

	byte road_veh_by_cargo_start[NUM_CARGO];

   486

	byte road_veh_by_cargo_count[NUM_CARGO];

   487

} LandscapePredefVar;

   488

   489

#include "table/landscape_const.h"

   490

   491

   492

// Calculate constants that depend on the landscape type.

   493

void InitializeLandscapeVariables(bool only_constants)

   494

{

   495

	const LandscapePredefVar *lpd;

   496

	int i;

   497

	StringID str;

   498

   499

	lpd = &_landscape_predef_var[_opt.landscape];

   500

   501

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

   502

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

   503

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

   504

   505

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

   506

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

   507

   508

		str = lpd->names[i];

   509

		_cargoc.names_s[i] = str;

   510

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

   511

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

   512

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

   513

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

   514

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

   515