1

#include "stdafx.h"

     2

#include "ttd.h"

     3

#include "debug.h"

     4

#include "namegen.h"

     5

#include "table/namegen.h"

     6

     7

static inline uint32 SeedChance(int shift_by, int max, uint32 seed)

     8

{

     9

	return ((uint16)(seed >> shift_by) * max) >> 16;

    10

}

    11

    12

static inline int32 SeedChanceBias(int shift_by, int max, uint32 seed, int bias)

    13

{

    14

	return SeedChance(shift_by, max + bias, seed) - bias;

    15

}

    16

    17

static void ReplaceWords(const char *org, const char *rep, char *buf)

    18

{

    19

	if (strncmp(buf, org, 4) == 0) strncpy(buf, rep, 4);

    20

}

    21

    22

static byte MakeEnglishOriginalTownName(char *buf, uint32 seed)

    23

{

    24

	int i;

    25

    26

	//null terminates the string for strcat

    27

	strcpy(buf, "");

    28

    29

	// optional first segment

    30

	i = SeedChanceBias(0, lengthof(name_original_english_1), seed, 50);

    31

	if (i >= 0)

    32

		strcat(buf,name_original_english_1[i]);

    33

    34

	//mandatory middle segments

    35

	strcat(buf, name_original_english_2[SeedChance(4,  lengthof(name_original_english_2), seed)]);

    36

	strcat(buf, name_original_english_3[SeedChance(7,  lengthof(name_original_english_3), seed)]);

    37

	strcat(buf, name_original_english_4[SeedChance(10, lengthof(name_original_english_4), seed)]);

    38

	strcat(buf, name_original_english_5[SeedChance(13, lengthof(name_original_english_5), seed)]);

    39

    40

	//optional last segment

    41

	i = SeedChanceBias(15, lengthof(name_original_english_6), seed, 60);

    42

	if (i >= 0)

    43

		strcat(buf, name_original_english_6[i]);

    44

    45

	if (buf[0] == 'C' && (buf[1] == 'e' || buf[1] == 'i'))

    46

		buf[0] = 'K';

    47

    48

	ReplaceWords("Cunt", "East", buf);

    49

	ReplaceWords("Slag", "Pits", buf);

    50

	ReplaceWords("Slut", "Edin", buf);

    51

	//ReplaceWords("Fart", "Boot", buf);

    52

	ReplaceWords("Drar", "Quar", buf);

    53

	ReplaceWords("Dreh", "Bash", buf);

    54

	ReplaceWords("Frar", "Shor", buf);

    55

	ReplaceWords("Grar", "Aber", buf);

    56

	ReplaceWords("Brar", "Over", buf);

    57

	ReplaceWords("Wrar", "Inve", buf);

    58

    59

	return 0;

    60

}

    61

    62

    63

static byte MakeEnglishAdditionalTownName(char *buf, uint32 seed)

    64

{

    65

	int i;

    66

    67

	//null terminates the string for strcat

    68

	strcpy(buf, "");

    69

    70

	// optional first segment

    71

	i = SeedChanceBias(0, lengthof(name_additional_english_prefix), seed, 50);

    72

	if (i >= 0)

    73

		strcat(buf,name_additional_english_prefix[i]);

    74

    75

	if (SeedChance(3, 20, seed) >= 14) {

    76

		strcat(buf, name_additional_english_1a[SeedChance(6, lengthof(name_additional_english_1a), seed)]);

    77

	} else {

    78

		strcat(buf, name_additional_english_1b1[SeedChance(6, lengthof(name_additional_english_1b1), seed)]);

    79

		strcat(buf, name_additional_english_1b2[SeedChance(9, lengthof(name_additional_english_1b2), seed)]);

    80

		if (SeedChance(11, 20, seed) >= 4) {

    81

			strcat(buf, name_additional_english_1b3a[SeedChance(12, lengthof(name_additional_english_1b3a), seed)]);

    82

		} else {

    83

			strcat(buf, name_additional_english_1b3b[SeedChance(12, lengthof(name_additional_english_1b3b), seed)]);

    84

		}

    85

	}

    86

    87

	strcat(buf, name_additional_english_2[SeedChance(14, lengthof(name_additional_english_2), seed)]);

    88

    89

	//optional last segment

    90

	i = SeedChanceBias(15, lengthof(name_additional_english_3), seed, 60);

    91

	if (i >= 0)

    92

		strcat(buf, name_additional_english_3[i]);

    93

    94

	ReplaceWords("Cunt", "East", buf);

    95

	ReplaceWords("Slag", "Pits", buf);

    96

	ReplaceWords("Slut", "Edin", buf);

    97

	ReplaceWords("Fart", "Boot", buf);

    98

	ReplaceWords("Drar", "Quar", buf);

    99

	ReplaceWords("Dreh", "Bash", buf);

   100

	ReplaceWords("Frar", "Shor", buf);

   101

	ReplaceWords("Grar", "Aber", buf);

   102

	ReplaceWords("Brar", "Over", buf);

   103

	ReplaceWords("Wrar", "Stan", buf);

   104

   105

	return 0;

   106

}

   107

   108

static byte MakeAustrianTownName(char *buf, uint32 seed)

   109

{

   110

	int i, j = 0;

   111

	strcpy(buf, "");

   112

   113

	// Bad, Maria, Gross, ...

   114

	i = SeedChanceBias(0, lengthof(name_austrian_a1), seed, 15);

   115

	if (i >= 0) strcat(buf, name_austrian_a1[i]);

   116

   117

	i = SeedChance(4, 6, seed);

   118

	if (i >= 4) {

   119

		// Kaisers-kirchen

   120

		strcat(buf, name_austrian_a2[SeedChance( 7, lengthof(name_austrian_a2), seed)]);

   121

		strcat(buf, name_austrian_a3[SeedChance(13, lengthof(name_austrian_a3), seed)]);

   122

	} else if (i >= 2) {

   123

		// St. Johann

   124

		strcat(buf, name_austrian_a5[SeedChance( 7, lengthof(name_austrian_a5), seed)]);

   125

		strcat(buf, name_austrian_a6[SeedChance( 9, lengthof(name_austrian_a6), seed)]);

   126

		j = 1; // More likely to have a " an der " or " am "

   127

	} else {

   128

		// Zell

   129

		strcat(buf, name_austrian_a4[SeedChance( 7, lengthof(name_austrian_a4), seed)]);

   130

	}

   131

   132

	i = SeedChance(1, 6, seed);

   133

	if (i >= 4 - j) {

   134

		// an der Donau (rivers)

   135

		strcat(buf, name_austrian_f1[SeedChance(4, lengthof(name_austrian_f1), seed)]);

   136

		strcat(buf, name_austrian_f2[SeedChance(5, lengthof(name_austrian_f2), seed)]);

   137

	} else if (i >= 2 - j) {

   138

		// am Dachstein (mountains)

   139

		strcat(buf, name_austrian_b1[SeedChance(4, lengthof(name_austrian_b1), seed)]);

   140

		strcat(buf, name_austrian_b2[SeedChance(5, lengthof(name_austrian_b2), seed)]);

   141

	}

   142

   143

	return 0;

   144

}

   145

   146

static byte MakeGermanTownName(char *buf, uint32 seed)

   147

{

   148

	uint i;

   149

	uint seed_derivative;

   150

   151

	//null terminates the string for strcat

   152

	strcpy(buf, "");

   153

   154

	seed_derivative = SeedChance(7, 28, seed);

   155

   156

	//optional prefix

   157

	if (seed_derivative == 12 || seed_derivative == 19) {

   158

		i = SeedChance(2, lengthof(name_german_pre), seed);

   159

		strcat(buf,name_german_pre[i]);

   160

	}

   161

   162

	// mandatory middle segments including option of hardcoded name

   163

	i = SeedChance(3, lengthof(name_german_real) + lengthof(name_german_1), seed);

   164

	if (i < lengthof(name_german_real)) {

   165

		strcat(buf,name_german_real[i]);

   166

	} else {

   167

		strcat(buf, name_german_1[i - lengthof(name_german_real)]);

   168

   169

		i = SeedChance(5, lengthof(name_german_2), seed);

   170

		strcat(buf, name_german_2[i]);

   171

	}

   172

   173

	// optional suffix

   174

	if (seed_derivative == 24) {

   175

		i = SeedChance(9,

   176

			lengthof(name_german_4_an_der) + lengthof(name_german_4_am), seed);

   177

		if (i < lengthof(name_german_4_an_der)) {

   178

			strcat(buf, name_german_3_an_der[0]);

   179

			strcat(buf, name_german_4_an_der[i]);

   180

		} else {

   181

			strcat(buf, name_german_3_am[0]);

   182

			strcat(buf, name_german_4_am[i - lengthof(name_german_4_an_der)]);

   183

		}

   184

	}

   185

	return 0;

   186

}

   187

   188

static byte MakeSpanishTownName(char *buf, uint32 seed)

   189

{

   190

	strcpy(buf, name_spanish_real[SeedChance(0, lengthof(name_spanish_real), seed)]);

   191

	return 0;

   192

}

   193

   194

static byte MakeFrenchTownName(char *buf, uint32 seed)

   195

{

   196

	strcpy(buf, name_french_real[SeedChance(0, lengthof(name_french_real), seed)]);

   197

	return 0;

   198

}

   199

   200

static byte MakeSillyTownName(char *buf, uint32 seed)

   201

{

   202

	strcpy(buf, name_silly_1[SeedChance( 0, lengthof(name_silly_1), seed)]);

   203

	strcat(buf, name_silly_2[SeedChance(16, lengthof(name_silly_2), seed)]);

   204

	return 0;

   205

}

   206

   207

static byte MakeSwedishTownName(char *buf, uint32 seed)

   208

{

   209

	int i;

   210

   211

	//null terminates the string for strcat

   212

	strcpy(buf, "");

   213

   214

	// optional first segment

   215

	i = SeedChanceBias(0, lengthof(name_swedish_1), seed, 50);

   216

	if (i >= 0)

   217

		strcat(buf, name_swedish_1[i]);

   218

   219

	// mandatory middle segments including option of hardcoded name

   220

	if (SeedChance(4, 5, seed) >= 3) {

   221

		strcat(buf, name_swedish_2[SeedChance( 7, lengthof(name_swedish_2), seed)]);

   222

	} else {

   223

		strcat(buf, name_swedish_2a[SeedChance( 7, lengthof(name_swedish_2a), seed)]);

   224

		strcat(buf, name_swedish_2b[SeedChance(10, lengthof(name_swedish_2b), seed)]);

   225

		strcat(buf, name_swedish_2c[SeedChance(13, lengthof(name_swedish_2c), seed)]);

   226

	}

   227

   228

	strcat(buf, name_swedish_3[SeedChance(16, lengthof(name_swedish_3), seed)]);

   229

   230

	return 0;

   231

}

   232

   233

static byte MakeDutchTownName(char *buf, uint32 seed)

   234

{

   235

	int i;

   236

   237

	//null terminates the string for strcat

   238

	strcpy(buf, "");

   239

   240

	// optional first segment

   241

	i = SeedChanceBias(0, lengthof(name_dutch_1), seed, 50);

   242

	if (i >= 0)

   243

		strcat(buf, name_dutch_1[i]);

   244

   245

	// mandatory middle segments including option of hardcoded name

   246

	if (SeedChance(6, 9, seed) > 4) {

   247

		strcat(buf, name_dutch_2[SeedChance( 9, lengthof(name_dutch_2), seed)]);

   248

	} else {

   249

		strcat(buf, name_dutch_3[SeedChance( 9, lengthof(name_dutch_3), seed)]);

   250

		strcat(buf, name_dutch_4[SeedChance(12, lengthof(name_dutch_4), seed)]);

   251

	}

   252

	strcat(buf, name_dutch_5[SeedChance(15, lengthof(name_dutch_5), seed)]);

   253

   254

	return 0;

   255

}

   256

   257

static byte MakeFinnishTownName(char *buf, uint32 seed)

   258

{

   259

	//null terminates the string for strcat

   260

	strcpy(buf, "");

   261

   262

	// Select randomly if town name should consists of one or two parts.

   263

	if (SeedChance(0, 15, seed) >= 10) {

   264

		strcat(buf, name_finnish_real[SeedChance( 2, lengthof(name_finnish_real), seed)]);

   265

	} else {

   266

		strcat(buf, name_finnish_1[SeedChance( 2, lengthof(name_finnish_1), seed)]);

   267

		strcat(buf, name_finnish_2[SeedChance(10, lengthof(name_finnish_2), seed)]);

   268

	}

   269

   270

	return 0;

   271

}

   272

   273

static byte MakePolishTownName(char *buf, uint32 seed)

   274

{

   275

	uint i;

   276

	uint j;

   277

   278

	//null terminates the string for strcat

   279

	strcpy(buf, "");

   280

   281

	// optional first segment

   282

	i = SeedChance(0,

   283

		lengthof(name_polish_2_o) + lengthof(name_polish_2_m) +

   284

		lengthof(name_polish_2_f) + lengthof(name_polish_2_n),

   285

		seed);

   286

	j = SeedChance(2, 20, seed);

   287

   288

   289

	if (i < lengthof(name_polish_2_o)) {

   290

		strcat(buf, name_polish_2_o[SeedChance(3, lengthof(name_polish_2_o), seed)]);

   291

	} else if (i < lengthof(name_polish_2_m) + lengthof(name_polish_2_o)) {

   292

		if (j < 4)

   293

			strcat(buf, name_polish_1_m[SeedChance(5, lengthof(name_polish_1_m), seed)]);

   294

   295

		strcat(buf, name_polish_2_m[SeedChance(7, lengthof(name_polish_2_m), seed)]);

   296

   297

		if (j >= 4 && j < 16)

   298

			strcat(buf, name_polish_3_m[SeedChance(10, lengthof(name_polish_3_m), seed)]);

   299

	} else if (i < lengthof(name_polish_2_f) + lengthof(name_polish_2_m) + lengthof(name_polish_2_o)) {

   300

		if (j < 4)

   301

			strcat(buf, name_polish_1_f[SeedChance(5, lengthof(name_polish_1_f), seed)]);

   302

   303

		strcat(buf, name_polish_2_f[SeedChance(7, lengthof(name_polish_2_f), seed)]);

   304

   305

		if (j >= 4 && j < 16)

   306

			strcat(buf, name_polish_3_f[SeedChance(10, lengthof(name_polish_3_f), seed)]);

   307

	} else {

   308

		if (j < 4)

   309

			strcat(buf, name_polish_1_n[SeedChance(5, lengthof(name_polish_1_n), seed)]);

   310

   311

		strcat(buf, name_polish_2_n[SeedChance(7, lengthof(name_polish_2_n), seed)]);

   312

   313

		if (j >= 4 && j < 16)

   314

			strcat(buf, name_polish_3_n[SeedChance(10, lengthof(name_polish_3_n), seed)]);

   315

	}

   316

	return 0;

   317

}

   318

   319

static byte MakeCzechTownName(char *buf, uint32 seed)

   320

{

   321

	/* Probability of prefixes/suffixes */

   322

	/* 0..11 prefix, 12..13 prefix+suffix, 14..17 suffix, 18..31 nothing */

   323

	int prob_tails;

   324

	bool do_prefix, do_suffix, dynamic_subst;

   325

	/* IDs of the respective parts */

   326

	int prefix = 0, stem = 0, postfix = 0, ending = 0, suffix = 0;

   327

	/* The select criteria. */

   328

	enum CzechGender gender;

   329

	enum CzechChoose choose;

   330

	enum CzechAllow allow;

   331

   332

	// 1:3 chance to use a real name.

   333

	if (SeedChance(0, 4, seed) == 0) {

   334

		strcpy(buf, name_czech_real[SeedChance(1, lengthof(name_czech_real), seed)]);

   335

		return 0;

   336

	}

   337

   338

	// NUL terminates the string for strcat()

   339

	strcpy(buf, "");

   340

   341

	prob_tails = SeedChance(2, 32, seed);

   342

	do_prefix = prob_tails < 12;

   343

	do_suffix = prob_tails > 11 && prob_tails < 17;

   344

   345

	if (do_prefix) prefix = SeedChance(5, lengthof(name_czech_adj), seed);

   346

	if (do_suffix) suffix = SeedChance(7, lengthof(name_czech_suffix), seed);

   347

	// 3:1 chance 3:1 to use dynamic substantive

   348

	stem = SeedChance(9, lengthof(name_czech_subst_full)

   349

	                     + 3 * lengthof(name_czech_subst_stem),

   350

	                   seed);

   351

	if (stem < (int) lengthof(name_czech_subst_full)) {

   352

		// That was easy!

   353

		dynamic_subst = false;

   354

		gender = name_czech_subst_full[stem].gender;

   355

		choose = name_czech_subst_full[stem].choose;

   356

		allow = name_czech_subst_full[stem].allow;

   357

   358

	} else {

   359

		unsigned int map[lengthof(name_czech_subst_ending)];

   360

		int ending_start = -1, ending_stop = -1;

   361

		int i;

   362

   363

		// Load the substantive

   364

		dynamic_subst = true;

   365

		stem -= lengthof(name_czech_subst_full);

   366

		stem %= lengthof(name_czech_subst_stem);

   367

		gender = name_czech_subst_stem[stem].gender;

   368

		choose = name_czech_subst_stem[stem].choose;

   369

		allow = name_czech_subst_stem[stem].allow;

   370

   371

		// Load the postfix (1:1 chance that a postfix will be inserted)

   372

		postfix = SeedChance(14, lengthof(name_czech_subst_postfix) * 2, seed);

   373

   374

		if (choose & CZC_POSTFIX) {

   375

			// Always get a real postfix.

   376

			postfix %= lengthof(name_czech_subst_postfix);

   377

		}

   378

		if (choose & CZC_NOPOSTFIX) {

   379

			// Always drop a postfix.

   380

			postfix += lengthof(name_czech_subst_postfix);

   381

		}

   382

		if (postfix < (int) lengthof(name_czech_subst_postfix))

   383

			choose |= CZC_POSTFIX;

   384

		else

   385

			choose |= CZC_NOPOSTFIX;

   386

   387

		// Localize the array segment containing a good gender

   388

		for (ending = 0; ending < (int) lengthof(name_czech_subst_ending); ending++) {

   389

			const struct CzechNameSubst *e = &name_czech_subst_ending[ending];

   390

   391

			if (gender == CZG_FREE

   392

			    || (gender == CZG_NFREE && e->gender != CZG_SNEUT && e->gender != CZG_PNEUT)

   393

			    || (gender == e->gender)) {

   394

				if (ending_start < 0)

   395

					ending_start = ending;

   396

   397

			} else if (ending_start >= 0) {

   398

				ending_stop = ending - 1;

   399

				break;

   400

			}

   401

		}

   402

		if (ending_stop < 0) {

   403

			// Whoa. All the endings matched.

   404

			ending_stop = ending - 1;

   405

		}

   406

   407

		// Make a sequential map of the items with good mask

   408

		i = 0;

   409

		for (ending = ending_start; ending <= ending_stop; ending++) {

   410

			const struct CzechNameSubst *e = &name_czech_subst_ending[ending];

   411

   412

			if ((e->choose & choose) == choose && (e->allow & allow) != 0)

   413

				map[i++] = ending;

   414

		}

   415

		assert(i > 0);

   416

   417

		// Load the ending

   418

		ending = map[SeedChance(16, i, seed)];

   419

		// Override possible CZG_*FREE; this must be a real gender,

   420

		// otherwise we get overflow when modifying the adjectivum.

   421

		gender = name_czech_subst_ending[ending].gender;

   422

		assert(gender != CZG_FREE && gender != CZG_NFREE);

   423

	}

   424

   425

	if (do_prefix && (name_czech_adj[prefix].choose & choose) != choose) {

   426

		// Throw away non-matching prefix.

   427

		do_prefix = false;

   428

	}

   429

   430

	// Now finally construct the name

   431

   432

	if (do_prefix) {

   433

		enum CzechPattern pattern = name_czech_adj[prefix].pattern;

   434

		int endpos;

   435

   436

		strcat(buf, name_czech_adj[prefix].name);

   437

		endpos = strlen(buf) - 1;

   438

		if (gender == CZG_SMASC && pattern == CZP_PRIVL) {

   439

			/* -ovX -> -uv */

   440

			buf[endpos - 2] = 'u';

   441

			assert(buf[endpos - 1] == 'v');

   442

			buf[endpos] = '\0';

   443

		} else {

   444

			buf[endpos] = name_czech_patmod[gender][pattern];

   445

		}

   446

   447

		strcat(buf, " ");

   448

	}

   449

   450

	if (dynamic_subst) {

   451

		strcat(buf, name_czech_subst_stem[stem].name);

   452

		if (postfix < (int) lengthof(name_czech_subst_postfix)) {

   455

			int postlen, endlen;

   456

   461

			// Kill the "avava" and "Jananna"-like cases

   477

		}

   478

		strcat(buf, name_czech_subst_ending[ending].name);

   479

	} else {

   480

		strcat(buf, name_czech_subst_full[stem].name);

   481

	}

   482

   483

	if (do_suffix) {

   484

		strcat(buf, " ");

   485

		strcat(buf, name_czech_suffix[suffix]);

   486

	}

   487