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(void);

    15

extern void InitNewsItemStructs(void);

    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(int line, const char *file)

    33

#else

    34

uint32 Random(void)

    35

#endif

    36

{

    37

    38

uint32 s;

    39

uint32 t;

    40

    41

#ifdef RANDOM_DEBUG

    42

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

    43

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

    44

#endif

    45

    46

#ifdef PLAYER_SEED_RANDOM

    47

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

    48

		s = _random_seeds[0][0];

    49

		t = _random_seeds[0][1];

    50

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

    51

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

    52

	} else {

    53

		uint32 s = _player_seeds[_current_player][0];

    54

		uint32 t = _player_seeds[_current_player][1];

    55

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

    56

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

    57

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

    58

	}

    59

#else

    60

	s = _random_seeds[0][0];

    61

	t = _random_seeds[0][1];

    62

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

    63

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

    64

#endif

    65

}

    66

    67

#ifdef RANDOM_DEBUG

    68

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

    69

{

    70

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

    71

}

    72

#else

    73

uint RandomRange(uint max)

    74

{

    75

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

    76

}

    77

#endif

    78

    79

uint32 InteractiveRandom(void)

    80

{

    81

	uint32 t = _random_seeds[1][1];

    82

	uint32 s = _random_seeds[1][0];

    83

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

    84

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

    85

}

    86

    87

uint InteractiveRandomRange(uint max)

    88

{

    89

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

    90

}

    91

    92

void InitPlayerRandoms(void)

    93

{

    94

	int i;

    95

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

    96

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

    97

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

    98

	}

    99

}

   100

   101

void SetDate(uint date)

   102

{

   103

	YearMonthDay ymd;

   104

	ConvertDayToYMD(&ymd, _date = date);

   105

	_cur_year = ymd.year;

   106

	_cur_month = ymd.month;

   107

#ifdef ENABLE_NETWORK

   108

	_network_last_advertise_date = 0;

   109

#endif /* ENABLE_NETWORK */

   110

}

   111

   112

   113

// multi os compatible sleep function

   114

   115

#ifdef __AMIGA__

   116

// usleep() implementation

   117

#	include <devices/timer.h>

   118

#	include <dos/dos.h>

   119

   120

	extern struct Device      *TimerBase    = NULL;

   121

	extern struct MsgPort     *TimerPort    = NULL;

   122

	extern struct timerequest *TimerRequest = NULL;

   123

#endif // __AMIGA__

   124

   125

void CSleep(int milliseconds)

   126

{

   127

	#if defined(WIN32)

   128

		Sleep(milliseconds);

   129

	#endif

   130

	#if defined(UNIX)

   131

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

   132

			usleep(milliseconds * 1000);

   133

		#endif

   134

		#ifdef __BEOS__

   135

			snooze(milliseconds * 1000);

   136

		#endif

   137

		#if defined(__AMIGA__)

   138

		{

   139

			ULONG signals;

   140

			ULONG TimerSigBit = 1 << TimerPort->mp_SigBit;

   141

   142

			// send IORequest

   143

			TimerRequest->tr_node.io_Command = TR_ADDREQUEST;

   144

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

   145

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

   146

			SendIO((struct IORequest *)TimerRequest);

   147

   148

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

   149

				AbortIO((struct IORequest *)TimerRequest);

   150

			}

   151

			WaitIO((struct IORequest *)TimerRequest);

   152

		}

   153

		#endif // __AMIGA__

   154

	#endif

   155

}

   156

   157

void InitializeVehicles(void);

   158

void InitializeOrders(void);

   159

void InitializeClearLand(void);

   160

void InitializeRail(void);

   161

void InitializeRailGui(void);

   162

void InitializeRoad(void);

   163

void InitializeRoadGui(void);

   164

void InitializeAirportGui(void);

   165

void InitializeDock(void);

   166

void InitializeDockGui(void);

   167

void InitializeIndustries(void);

   168

void InitializeLandscape(void);

   169

void InitializeTowns(void);

   170

void InitializeTrees(void);

   171

void InitializeSigns(void);

   172

void InitializeStations(void);

   173

static void InitializeNameMgr(void);

   174

void InitializePlayers(void);

   175

static void InitializeCheats(void);

   176

   177

void GenerateLandscape(void);

   178

void GenerateClearTile(void);

   179

   180

void GenerateIndustries(void);

   181

void GenerateUnmovables(void);

   182

void GenerateTowns(void);

   183

   184

void StartupPlayers(void);

   185

void StartupDisasters(void);

   186

void GenerateTrees(void);

   187

   188

void ConvertGroundTilesIntoWaterTiles(void);

   189

   190

void InitializeGame(void)

   191

{

   192

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

   193

	uint i;

   194

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

   195

		_autoreplace_array[i] = i;

   196

   197

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

   198

   199

	SetObjectToPlace(1, 0, 0, 0);

   200

   201

	_pause = 0;

   202

	_fast_forward = 0;

   203

	_tick_counter = 0;

   204

	_date_fract = 0;

   205

	_cur_tileloop_tile = 0;

   206

	_vehicle_id_ctr_day = 0;

   207

   208

	{

   209

		uint starting = ConvertIntDate(_patches.starting_date);

   210

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

   211

		SetDate(starting);

   212

	}

   213

   214

	InitializeVehicles();

   215

	InitializeOrders();

   216

   217

	InitNewsItemStructs();

   218

	InitializeLandscape();

   219

	InitializeClearLand();

   220

	InitializeRail();

   221

	InitializeRailGui();

   222

	InitializeRoad();

   223

	InitializeRoadGui();

   224

	InitializeAirportGui();

   225

	InitializeDock();

   226

	InitializeDockGui();

   227

	InitializeTowns();

   228

	InitializeTrees();

   229

	InitializeSigns();

   230

	InitializeStations();

   231

	InitializeIndustries();

   232

   233

	InitializeNameMgr();

   234

	InitializeVehiclesGuiList();

   235

	InitializeTrains();

   236

   237

	InitializePlayers();

   238

	InitializeCheats();

   239

   240

	InitTextEffects();

   241

	InitTextMessage();

   242

	InitializeAnimatedTiles();

   243

   244

	InitializeLandscapeVariables(false);

   245

   246

	ResetObjectToPlace();

   247

}

   248

   249

void GenerateWorld(int mode)

   250

{

   251

	int i;

   252

   253

	// Make sure everything is done via OWNER_NONE

   254

	_current_player = OWNER_NONE;

   255

   256

	_generating_world = true;

   257

	InitializeGame();

   258

	SetObjectToPlace(1, 0, 0, 0);

   259

   260

	// Must start economy early because of the costs.

   261

	StartupEconomy();

   262

   263

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

   264

	if (mode == 1) {

   265

		// empty world in scenario editor

   266

		ConvertGroundTilesIntoWaterTiles();

   267

	} else {

   268

		GenerateLandscape();

   269

		GenerateClearTile();

   270

   271

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

   272

		if (mode == 0) {

   273

			GenerateTowns();

   274

			GenerateTrees();

   275

			GenerateIndustries();

   276

			GenerateUnmovables();

   277

		}

   278

	}

   279

   280

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

   281

	StartupPlayers();

   282

	StartupEngines();

   283

	StartupDisasters();

   284

	_generating_world = false;

   285

   286

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

   287

	if (mode != 1) {

   288

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

   289

			RunTileLoop();

   290

	}

   291

   292

	ResetObjectToPlace();

   293

}

   294

   295

void DeleteName(StringID id)

   296

{

   297

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

   298

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

   299

	}

   300

}

   301

   302

byte *GetName(int id, byte *buff)

   303

{

   304

	byte *b;

   305

   306

	if (id & 0x600) {

   307

		if (id & 0x200) {

   308

			if (id & 0x400) {

   309

				GetParamInt32();

   310

				GetParamUint16();

   311

			} else {

   312

				GetParamUint16();

   313

			}

   314

		} else {

   315

			GetParamInt32();

   316

		}

   317

	}

   318

   319

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

   320

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

   321

   322

	return buff - 1;

   323

}

   324

   325

   326

static void InitializeCheats(void)

   327

{

   328

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

   329

}

   330

   331

   332

static void InitializeNameMgr(void)

   333

{

   334

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

   335

}

   336

   337

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

   338

{

   339

	int free_item = -1;

   340

	const byte *names;

   341

	byte *dst;

   342

	int i;

   343

   344

	names = &_name_array[0][0];

   345

   346

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

   347

		if (names[0] == 0) {

   348

			if (free_item == -1)

   349

				free_item = i;

   350

		} else {

   351

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

   352

				_error_message = STR_0132_CHOSEN_NAME_IN_USE_ALREADY;

   353

				return 0;

   354

			}

   355

		}

   356

	}

   357

   358

	if (free_item < 0) {

   359

		_error_message = STR_0131_TOO_MANY_NAMES_DEFINED;

   360

		return 0;

   361

	}

   362

   363

	dst=_name_array[free_item];

   364

   365

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

   366

	dst[31] = 0;

   367

   368

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

   369

}

   370

   371

   372

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

   373

static const uint16 _month_date_from_year_day[] = {

   374

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

   375

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

   376

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

   377

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

   378

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

   379

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

   380

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

   381

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

   382

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

   383

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

   384

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

   385

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

   386

};

   387

#undef M

   388

   389

enum {

   390

	ACCUM_JAN = 0,

   391

	ACCUM_FEB = ACCUM_JAN + 31,

   392

	ACCUM_MAR = ACCUM_FEB + 29,

   393

	ACCUM_APR = ACCUM_MAR + 31,

   394

	ACCUM_MAY = ACCUM_APR + 30,

   395

	ACCUM_JUN = ACCUM_MAY + 31,

   396

	ACCUM_JUL = ACCUM_JUN + 30,

   397

	ACCUM_AUG = ACCUM_JUL + 31,

   398

	ACCUM_SEP = ACCUM_AUG + 31,

   399

	ACCUM_OCT = ACCUM_SEP + 30,

   400

	ACCUM_NOV = ACCUM_OCT + 31,

   401

	ACCUM_DEC = ACCUM_NOV + 30,

   402

};

   403

   404

static const uint16 _accum_days_for_month[] = {

   405

	ACCUM_JAN,ACCUM_FEB,ACCUM_MAR,ACCUM_APR,

   406

	ACCUM_MAY,ACCUM_JUN,ACCUM_JUL,ACCUM_AUG,

   407

	ACCUM_SEP,ACCUM_OCT,ACCUM_NOV,ACCUM_DEC,

   408

};

   409

   410

   411

void ConvertDayToYMD(YearMonthDay *ymd, uint16 date)

   412

{

   413

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

   414

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

   415

	uint x;

   416

   417

	yr *= 4;

   418

   419

	if (rem >= 366) {

   420

		rem--;

   421

		do {

   422

			rem -= 365;

   423

			yr++;

   424

		} while (rem >= 365);

   425

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

   426

	}

   427

   428

	ymd->year = yr;

   429

   430

	x = _month_date_from_year_day[rem];

   431

	ymd->month = x >> 5;

   432

	ymd->day = x & 0x1F;

   433

}

   434

   435

// year is a number between 0..?

   436

// month is a number between 0..11

   437

// day is a number between 1..31

   438

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

   439

{

   440

	uint rem;

   441

   442

	// day in the year

   443

	rem = _accum_days_for_month[month] + day - 1;

   444

   445

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

   446

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

   447

   448

	// base date.

   449

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

   450

}

   451

   452

// convert a date on the form

   453

// 1920 - 2090 (MAX_YEAR_END_REAL)

   454

// 192001 - 209012

   455

// 19200101 - 20901231

   456

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

   457

// returns -1 if no conversion was possible

   458

uint ConvertIntDate(uint date)

   459

{

   460

	uint year, month = 0, day = 1;

   461

   462

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

   463

		year = date - 1920;

   464

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

   465

		month = date % 100 - 1;

   466

		year = date / 100 - 1920;

   467

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

   468

		day = date % 100; date /= 100;

   469

		month = date % 100 - 1;

   470

		year = date / 100 - 1920;

   471

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

   472

		return date;

   473

	else

   474

		return (uint)-1;

   475

   476

	// invalid ranges?

   477

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

   478

   479

	return ConvertYMDToDay(year, month, day);

   480

}

   481

   482

typedef struct LandscapePredefVar {

   483

	StringID names[NUM_CARGO];

   484

	byte weights[NUM_CARGO];

   485

	StringID sprites[NUM_CARGO];

   486

   487

	uint16 initial_cargo_payment[NUM_CARGO];

   488

	byte transit_days_table_1[NUM_CARGO];

   489

	byte transit_days_table_2[NUM_CARGO];

   490

   491

	byte railwagon_by_cargo[3][NUM_CARGO];

   492

   493

	byte road_veh_by_cargo_start[NUM_CARGO];

   494

	byte road_veh_by_cargo_count[NUM_CARGO];

   495

} LandscapePredefVar;

   496

   497

#include "table/landscape_const.h"

   498

   499

   500

// Calculate constants that depend on the landscape type.

   501

void InitializeLandscapeVariables(bool only_constants)

   502

{

   503

	const LandscapePredefVar *lpd;

   504

	int i;

   505

	StringID str;

   506

   507

	lpd = &_landscape_predef_var[_opt.landscape];

   508

   509

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

   510