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 uint32 SeedModChance(int shift_by, int max, uint32 seed)

    13

{

    14

	/* This actually gives *MUCH* more even distribution of the values

    15

	 * than SeedChance(), which is absolutely horrible in that. If

    16

	 * you do not believe me, try with i.e. the Czech town names,

    17

	 * compare the words (nicely visible on prefixes) generated by

    18

	 * SeedChance() and SeedModChance(). Do not get dicouraged by the

    19

	 * never-use-modulo myths, which hold true only for the linear

    20

	 * congruential generators (and Random() isn't such a generator).

    21

	 * --pasky */

    22

	// TODO: Perhaps we should use it for all the name generators? --pasky

    23

	return (seed >> shift_by) % max;

    24

}

    25

    26

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

    27

{

    28

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

    29

}

    30

    31

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

    32

{

    33

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

    34

}

    35

    36

static byte MakeEnglishOriginalTownName(char *buf, uint32 seed)

    37

{

    38

	int i;

    39

    40

	//null terminates the string for strcat

    41

	strcpy(buf, "");

    42

    43

	// optional first segment

    44

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

    45

	if (i >= 0)

    46

		strcat(buf,name_original_english_1[i]);

    47

    48

	//mandatory middle segments

    49

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

    50

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

    51

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

    52

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

    53

    54

	//optional last segment

    55

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

    56

	if (i >= 0)

    57

		strcat(buf, name_original_english_6[i]);

    58

    59

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

    60

		buf[0] = 'K';

    61

    62

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

    63

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

    64

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

    65

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

    66

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

    67

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

    68

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

    69

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

    70

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

    71

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

    72

    73

	return 0;

    74

}

    75

    76

    77

static byte MakeEnglishAdditionalTownName(char *buf, uint32 seed)

    78

{

    79

	int i;

    80

    81

	//null terminates the string for strcat

    82

	strcpy(buf, "");

    83

    84

	// optional first segment

    85

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

    86

	if (i >= 0)

    87

		strcat(buf,name_additional_english_prefix[i]);

    88

    89

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

    90

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

    91

	} else {

    92

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

    93

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

    94

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

    95

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

    96

		} else {

    97

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

    98

		}

    99

	}

   100

   101

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

   102

   103

	//optional last segment

   104

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

   105

	if (i >= 0)

   106

		strcat(buf, name_additional_english_3[i]);

   107

   108

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

   109

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

   110

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

   111

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

   112

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

   113

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

   114

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

   115

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

   116

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

   117

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

   118

   119

	return 0;

   120

}

   121

   122

static byte MakeAustrianTownName(char *buf, uint32 seed)

   123

{

   124

	int i, j = 0;

   125

	strcpy(buf, "");

   126

   127

	// Bad, Maria, Gross, ...

   128

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

   129

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

   130

   131

	i = SeedChance(4, 6, seed);

   132

	if (i >= 4) {

   133

		// Kaisers-kirchen

   134

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

   135

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

   136

	} else if (i >= 2) {

   137

		// St. Johann

   138

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

   139

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

   140

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

   141

	} else {

   142

		// Zell

   143

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

   144

	}

   145

   146

	i = SeedChance(1, 6, seed);

   147

	if (i >= 4 - j) {

   148

		// an der Donau (rivers)

   149

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

   150

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

   151

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

   152

		// am Dachstein (mountains)

   153

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

   154

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

   155

	}

   156

   157

	return 0;

   158

}

   159

   160

static byte MakeGermanTownName(char *buf, uint32 seed)

   161

{

   162

	uint i;

   163

	uint seed_derivative;

   164

   165

	//null terminates the string for strcat

   166

	strcpy(buf, "");

   167

   168

	seed_derivative = SeedChance(7, 28, seed);

   169

   170

	//optional prefix

   171

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

   172

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

   173

		strcat(buf,name_german_pre[i]);

   174

	}

   175

   176

	// mandatory middle segments including option of hardcoded name

   177

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

   178

	if (i < lengthof(name_german_real)) {

   179

		strcat(buf,name_german_real[i]);

   180

	} else {

   181

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

   182

   183

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

   184

		strcat(buf, name_german_2[i]);

   185

	}

   186

   187

	// optional suffix

   188

	if (seed_derivative == 24) {

   189

		i = SeedChance(9,

   190

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

   191

		if (i < lengthof(name_german_4_an_der)) {

   192

			strcat(buf, name_german_3_an_der[0]);

   193

			strcat(buf, name_german_4_an_der[i]);

   194

		} else {

   195

			strcat(buf, name_german_3_am[0]);

   196

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

   197

		}

   198

	}

   199

	return 0;

   200

}

   201

   202

static byte MakeSpanishTownName(char *buf, uint32 seed)

   203

{

   204

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

   205

	return 0;

   206

}

   207

   208

static byte MakeFrenchTownName(char *buf, uint32 seed)

   209

{

   210

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

   211

	return 0;

   212

}

   213

   214

static byte MakeSillyTownName(char *buf, uint32 seed)

   215

{

   216

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

   217

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

   218

	return 0;

   219

}

   220

   221

static byte MakeSwedishTownName(char *buf, uint32 seed)

   222

{

   223

	int i;

   224

   225

	//null terminates the string for strcat

   226

	strcpy(buf, "");

   227

   228

	// optional first segment

   229

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

   230

	if (i >= 0)

   231

		strcat(buf, name_swedish_1[i]);

   232

   233

	// mandatory middle segments including option of hardcoded name

   234

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

   235

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

   236

	} else {

   237

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

   238

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

   239

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

   240

	}

   241

   242

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

   243

   244

	return 0;

   245

}

   246

   247

static byte MakeDutchTownName(char *buf, uint32 seed)

   248

{

   249

	int i;

   250

   251

	//null terminates the string for strcat

   252

	strcpy(buf, "");

   253

   254

	// optional first segment

   255

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

   256

	if (i >= 0)

   257

		strcat(buf, name_dutch_1[i]);

   258

   259

	// mandatory middle segments including option of hardcoded name

   260

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

   261

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

   262

	} else {

   263

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

   264

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

   265

	}

   266

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

   267

   268

	return 0;

   269

}

   270

   271

static byte MakeFinnishTownName(char *buf, uint32 seed)

   272

{

   273

	//null terminates the string for strcat

   274

	strcpy(buf, "");

   275

   276

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

   277

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

   278

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

   279

	} else {

   280

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

   281

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

   282

	}

   283

   284

	return 0;

   285

}

   286

   287

static byte MakePolishTownName(char *buf, uint32 seed)

   288

{

   289

	uint i;

   290

	uint j;

   291

   292

	//null terminates the string for strcat

   293

	strcpy(buf, "");

   294

   295

	// optional first segment

   296

	i = SeedChance(0,

   297

		lengthof(name_polish_2_o) + lengthof(name_polish_2_m) +

   298

		lengthof(name_polish_2_f) + lengthof(name_polish_2_n),

   299

		seed);

   300

	j = SeedChance(2, 20, seed);

   301

   302

   303

	if (i < lengthof(name_polish_2_o)) {

   304

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

   305

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

   306

		if (j < 4)

   307

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

   308

   309

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

   310

   311

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

   312

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

   313

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

   314

		if (j < 4)

   315

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

   316

   317

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

   318

   319

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

   320

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

   321

	} else {

   322

		if (j < 4)

   323

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

   324

   325

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

   326

   327

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

   328

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

   329

	}

   330

	return 0;

   331

}

   332

   333

static byte MakeCzechTownName(char *buf, uint32 seed)

   334

{

   335

	/* Probability of prefixes/suffixes */

   336

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

   337

	int prob_tails;

   338

	bool do_prefix, do_suffix, dynamic_subst;

   339

	/* IDs of the respective parts */

   343

	/* The select criteria. */

   347

   348

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

   349

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

   350

		strcpy(buf, name_czech_real[SeedModChance(4, lengthof(name_czech_real), seed)]);

   351

		return 0;

   352

	}

   353

   354

	// NUL terminates the string for strcat()

   355

	strcpy(buf, "");

   356

   357

	prob_tails = SeedModChance(2, 32, seed);

   358

	do_prefix = prob_tails < 12;

   359

	do_suffix = prob_tails > 11 && prob_tails < 17;

   360

   361

	if (do_prefix) prefix = SeedModChance(5, lengthof(name_czech_adj) * 12, seed) / 12;

   362

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

   363

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

   368

		// That was easy!

   369

		dynamic_subst = false;

   370

		gender = name_czech_subst_full[stem].gender;

   371

		choose = name_czech_subst_full[stem].choose;

   372

		allow = name_czech_subst_full[stem].allow;

   373

	} else {

   374

		unsigned int map[lengthof(name_czech_subst_ending)];

   375

		int ending_start = -1, ending_stop = -1;

   376

		int i;

   377

   378

		// Load the substantive

   379

		dynamic_subst = true;

   380

		stem -= lengthof(name_czech_subst_full);

   381

		stem %= lengthof(name_czech_subst_stem);

   382

		gender = name_czech_subst_stem[stem].gender;

   383

		choose = name_czech_subst_stem[stem].choose;

   384

		allow = name_czech_subst_stem[stem].allow;

   385

   386

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

   387

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

   388

   389

		if (choose & CZC_POSTFIX) {

   390

			// Always get a real postfix.

   391

			postfix %= lengthof(name_czech_subst_postfix);

   392

		}

   393

		if (choose & CZC_NOPOSTFIX) {

   394

			// Always drop a postfix.

   395

			postfix += lengthof(name_czech_subst_postfix);

   396

		}

   398

			choose |= CZC_POSTFIX;

   399

		else

   400

			choose |= CZC_NOPOSTFIX;

   401

   402

		// Localize the array segment containing a good gender

   403

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

   405

   409

				if (ending_start < 0)

   410

					ending_start = ending;

   411

   412

			} else if (ending_start >= 0) {

   413

				ending_stop = ending - 1;

   414

				break;

   415

			}

   416

		}

   417

		if (ending_stop < 0) {

   418

			// Whoa. All the endings matched.

   419

			ending_stop = ending - 1;

   420

		}

   421

   422

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

   423

		i = 0;

   424

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

   426

   427

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

   428

				map[i++] = ending;

   429

		}

   430

		assert(i > 0);

   431

   432

		// Load the ending

   433

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

   434

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

   435

		// otherwise we get overflow when modifying the adjectivum.

   436

		gender = name_czech_subst_ending[ending].gender;

   437

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

   438

	}

   439

   440

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

   441

		// Throw away non-matching prefix.

   442

		do_prefix = false;

   443

	}

   444

   445

	// Now finally construct the name

   446

   447

	if (do_prefix) {

   449

		int endpos;

   450

   451

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

   452

		endpos = strlen(buf) - 1;

   453

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

   454

			/* -ovX -> -uv */

   455

			buf[endpos - 2] = 'u';

   456

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

   457

			buf[endpos] = '\0';

   458

		} else {

   459

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

   460

		}

   461

   462

		strcat(buf, " ");

   463

	}

   464

   465

	if (dynamic_subst) {

   466

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

   468

			const char *poststr = name_czech_subst_postfix[postfix];

   469

			const char *endstr = name_czech_subst_ending[ending].name;

   470

			int postlen, endlen;

   471

   472

			postlen = strlen(poststr);

   473

			endlen = strlen(endstr);

   474

			assert(postlen > 0 && endlen > 0);

   475

   476

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

   482

				strcat(buf, poststr);

   483

				buflen = strlen(buf);

   484

   485

				// k-i -> c-i, h-i -> z-i