1

/* $Id$ */

     2

     3

/** @file namegen.cpp */

     4

     5

#include "stdafx.h"

     6

#include "openttd.h"

     7

#include "debug.h"

     8

#include "namegen.h"

     9

#include "table/namegen.h"

    10

#include "string.h"

    11

    12

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

    13

{

    14

	return (GB(seed, shift_by, 16) * max) >> 16;

    15

}

    16

    17

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

    18

{

    19

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

    20

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

    21

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

    22

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

    23

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

    24

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

    25

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

    26

	 * --pasky */

    27

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

    28

	return (seed >> shift_by) % max;

    29

}

    30

    31

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

    32

{

    33

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

    34

}

    35

    36

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

    37

{

    38

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

    39

}

    40

    41

static byte MakeEnglishOriginalTownName(char *buf, uint32 seed, const char *last)

    42

{

    43

	int i;

    44

    45

	/* null terminates the string for strcat */

    46

	strecpy(buf, "", last);

    47

    48

	/* optional first segment */

    49

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

    50

	if (i >= 0)

    51

		strecat(buf, name_original_english_1[i], last);

    52

    53

	/* mandatory middle segments */

    54

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

    55

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

    56

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

    57

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

    58

    59

	/* optional last segment */

    60

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

    61

	if (i >= 0)

    62

		strecat(buf, name_original_english_6[i], last);

    63

    64

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

    65

		buf[0] = 'K';

    66

    67

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

    68

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

    69

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

    70

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

    71

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

    72

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

    73

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

    74

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

    75

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

    76

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

    77

    78

	return 0;

    79

}

    80

    81

    82

static byte MakeEnglishAdditionalTownName(char *buf, uint32 seed, const char *last)

    83

{

    84

	int i;

    85

    86

	/* null terminates the string for strcat */

    87

	strecpy(buf, "", last);

    88

    89

	/* optional first segment */

    90

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

    91

	if (i >= 0)

    92

		strecat(buf, name_additional_english_prefix[i], last);

    93

    94

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

    95

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

    96

	} else {

    97

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

    98

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

    99

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

   100

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

   101

		} else {

   102

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

   103

		}

   104

	}

   105

   106

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

   107

   108

	/* optional last segment */

   109

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

   110

	if (i >= 0)

   111

		strecat(buf, name_additional_english_3[i], last);

   112

   113

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

   114

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

   115

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

   116

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

   117

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

   118

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

   119

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

   120

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

   121

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

   122

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

   123

   124

	return 0;

   125

}

   126

   127

static byte MakeAustrianTownName(char *buf, uint32 seed, const char *last)

   128

{

   129

	int i, j = 0;

   130

	strecpy(buf, "", last);

   131

   132

	/* Bad, Maria, Gross, ... */

   133

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

   134

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

   135

   136

	i = SeedChance(4, 6, seed);

   137

	if (i >= 4) {

   138

		/* Kaisers-kirchen */

   139

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

   140

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

   141

	} else if (i >= 2) {

   142

		/* St. Johann */

   143

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

   144

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

   145

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

   146

	} else {

   147

		/* Zell */

   148

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

   149

	}

   150

   151

	i = SeedChance(1, 6, seed);

   152

	if (i >= 4 - j) {

   153

		/* an der Donau (rivers) */

   154

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

   155

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

   156

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

   157

		/* am Dachstein (mountains) */

   158

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

   159

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

   160

	}

   161

   162

	return 0;

   163

}

   164

   165

static byte MakeGermanTownName(char *buf, uint32 seed, const char *last)

   166

{

   167

	uint i;

   168

	uint seed_derivative;

   169

   170

	/* null terminates the string for strcat */

   171

	strecpy(buf, "", last);

   172

   173

	seed_derivative = SeedChance(7, 28, seed);

   174

   175

	/* optional prefix */

   176

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

   177

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

   178

		strecat(buf, name_german_pre[i], last);

   179

	}

   180

   181

	/* mandatory middle segments including option of hardcoded name */

   182

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

   183

	if (i < lengthof(name_german_real)) {

   184

		strecat(buf, name_german_real[i], last);

   185

	} else {

   186

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

   187

   188

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

   189

		strecat(buf, name_german_2[i], last);

   190

	}

   191

   192

	/* optional suffix */

   193

	if (seed_derivative == 24) {

   194

		i = SeedChance(9,

   195

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

   196

		if (i < lengthof(name_german_4_an_der)) {

   197

			strecat(buf, name_german_3_an_der[0], last);

   198

			strecat(buf, name_german_4_an_der[i], last);

   199

		} else {

   200

			strecat(buf, name_german_3_am[0], last);

   201

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

   202

		}

   203

	}

   204

	return 0;

   205

}

   206

   207

static byte MakeSpanishTownName(char *buf, uint32 seed, const char *last)

   208

{

   209

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

   210

	return 0;

   211

}

   212

   213

static byte MakeFrenchTownName(char *buf, uint32 seed, const char *last)

   214

{

   215

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

   216

	return 0;

   217

}

   218

   219

static byte MakeSillyTownName(char *buf, uint32 seed, const char *last)

   220

{

   221

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

   222

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

   223

	return 0;

   224

}

   225

   226

static byte MakeSwedishTownName(char *buf, uint32 seed, const char *last)

   227

{

   228

	int i;

   229

   230

	/* null terminates the string for strcat */

   231

	strecpy(buf, "", last);

   232

   233

	/* optional first segment */

   234

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

   235

	if (i >= 0)

   236

		strecat(buf, name_swedish_1[i], last);

   237

   238

	/* mandatory middle segments including option of hardcoded name */

   239

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

   240

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

   241

	} else {

   242

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

   243

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

   244

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

   245

	}

   246

   247

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

   248

   249

	return 0;

   250

}

   251

   252

static byte MakeDutchTownName(char *buf, uint32 seed, const char *last)

   253

{

   254

	int i;

   255

   256

	/* null terminates the string for strcat */

   257

	strecpy(buf, "", last);

   258

   259

	/* optional first segment */

   260

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

   261

	if (i >= 0)

   262

		strecat(buf, name_dutch_1[i], last);

   263

   264

	/* mandatory middle segments including option of hardcoded name */

   265

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

   266

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

   267

	} else {

   268

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

   269

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

   270

	}

   271

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

   272

   273

	return 0;

   274

}

   275

   276

static byte MakeFinnishTownName(char *buf, uint32 seed, const char *last)

   277

{

   278

	/* null terminates the string for strcat */

   279

	strecpy(buf, "", last);

   280

   281

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

   282

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

   283

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

   284

	} else if (SeedChance(0, 15, seed) >= 5) {

   285

		/* A two-part name by combining one of name_finnish_1 + "la"/"lä"

   286

		 * The reason for not having the contents of name_finnish_{1,2} in the same table is

   287

		 * that the ones in name_finnish_2 are not good for this purpose. */

   288

		uint sel = SeedChance( 0, lengthof(name_finnish_1), seed);

   289

		char *end;

   290

		strecat(buf, name_finnish_1[sel], last);

   291

		end = &buf[strlen(buf)-1];

   292

		if (*end == 'i')

   293

			*end = 'e';

   294

		if (strstr(buf, "a") || strstr(buf, "o") || strstr(buf, "u") ||

   295

			strstr(buf, "A") || strstr(buf, "O") || strstr(buf, "U"))

   296

		{

   297

			strecat(buf, "la", last);

   298

		} else {

   299

			strecat(buf, "lä", last);

   300

		}

   301

	} else {

   302

		/* A two-part name by combining one of name_finnish_{1,2} + name_finnish_3.

   303

		 * Why aren't name_finnish_{1,2} just one table? See above. */

   304

		uint sel = SeedChance(2,

   305

			lengthof(name_finnish_1) + lengthof(name_finnish_2), seed);

   306

		if (sel >= lengthof(name_finnish_1)) {

   307

			strecat(buf, name_finnish_2[sel-lengthof(name_finnish_1)], last);

   308

		} else {

   309

			strecat(buf, name_finnish_1[sel], last);

   310

		}

   311

		strecat(buf, name_finnish_3[SeedChance(10, lengthof(name_finnish_3), seed)], last);

   312

	}

   313

   314

	return 0;

   315

}

   316

   317

static byte MakePolishTownName(char *buf, uint32 seed, const char *last)

   318

{

   319

	uint i;

   320

	uint j;

   321

   322

	/* null terminates the string for strcat */

   323

	strecpy(buf, "", last);

   324

   325

	/* optional first segment */

   326

	i = SeedChance(0,

   327

		lengthof(name_polish_2_o) + lengthof(name_polish_2_m) +

   328

		lengthof(name_polish_2_f) + lengthof(name_polish_2_n),

   329

		seed);

   330

	j = SeedChance(2, 20, seed);

   331

   332

   333

	if (i < lengthof(name_polish_2_o)) {

   334

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

   335

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

   336

		if (j < 4)

   337

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

   338

   339

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

   340

   341

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

   342

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

   343

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

   344

		if (j < 4)

   345

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

   346

   347

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

   348

   349

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

   350

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

   351

	} else {

   352

		if (j < 4)

   353

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

   354

   355

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

   356

   357

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

   358

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

   359

	}

   360

	return 0;

   361

}

   362

   363

static byte MakeCzechTownName(char *buf, uint32 seed, const char *last)

   364

{

   365

	/* Probability of prefixes/suffixes */

   366

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

   367

	int prob_tails;

   368

	bool do_prefix, do_suffix, dynamic_subst;

   369

	/* IDs of the respective parts */

   370

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

   371

	uint postfix = 0;

   372

	uint stem;

   373

	/* The select criteria. */

   374

	CzechGender gender;

   375

	CzechChoose choose;

   376

	CzechAllow allow;

   377

   378

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

   379

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

   380

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

   381

		return 0;

   382

	}

   383

   384

	/* NUL terminates the string for strcat() */

   385

	strecpy(buf, "", last);

   386

   387

	prob_tails = SeedModChance(2, 32, seed);

   388

	do_prefix = prob_tails < 12;

   389

	do_suffix = prob_tails > 11 && prob_tails < 17;

   390

   391

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

   392

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

   393

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

   394

	stem = SeedModChance(9,

   395

		lengthof(name_czech_subst_full) + 3 * lengthof(name_czech_subst_stem),

   396

		seed);

   397

	if (stem < lengthof(name_czech_subst_full)) {

   398

		/* That was easy! */

   399

		dynamic_subst = false;

   400

		gender = name_czech_subst_full[stem].gender;

   401

		choose = name_czech_subst_full[stem].choose;

   402

		allow = name_czech_subst_full[stem].allow;

   403

	} else {

   404

		unsigned int map[lengthof(name_czech_subst_ending)];

   405

		int ending_start = -1, ending_stop = -1;

   406

		int i;

   407

   408

		/* Load the substantive */

   409

		dynamic_subst = true;

   410

		stem -= lengthof(name_czech_subst_full);

   411

		stem %= lengthof(name_czech_subst_stem);

   412

		gender = name_czech_subst_stem[stem].gender;

   413

		choose = name_czech_subst_stem[stem].choose;

   414

		allow = name_czech_subst_stem[stem].allow;

   415

   416

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

   417

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

   418

   419

		if (choose & CZC_POSTFIX) {

   420

			/* Always get a real postfix. */

   421

			postfix %= lengthof(name_czech_subst_postfix);

   422

		}

   423

		if (choose & CZC_NOPOSTFIX) {

   424

			/* Always drop a postfix. */

   425

			postfix += lengthof(name_czech_subst_postfix);

   426

		}

   427

		if (postfix < lengthof(name_czech_subst_postfix)) {

   428

			choose |= CZC_POSTFIX;

   429

		} else {

   430

			choose |= CZC_NOPOSTFIX;

   431

		}

   432

   433

		/* Localize the array segment containing a good gender */

   434

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

   435

			const CzechNameSubst *e = &name_czech_subst_ending[ending];

   436

   437

			if (gender == CZG_FREE ||

   438

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

   439

					gender == e->gender) {

   440

				if (ending_start < 0)

   441

					ending_start = ending;

   442

   443

			} else if (ending_start >= 0) {

   444

				ending_stop = ending - 1;

   445

				break;

   446

			}

   447

		}

   448

		if (ending_stop < 0) {

   449

			/* Whoa. All the endings matched. */

   450

			ending_stop = ending - 1;

   451

		}

   452

   453

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

   454

		i = 0;

   455

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

   456

			const CzechNameSubst *e = &name_czech_subst_ending[ending];

   457

   458

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

   459

				map[i++] = ending;

   460

		}

   461

		assert(i > 0);

   462

   463

		/* Load the ending */

   464

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

   465

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

   466

		 * otherwise we get overflow when modifying the adjectivum. */

   467

		gender = name_czech_subst_ending[ending].gender;

   468

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

   469

	}

   470

   471

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

   472

		/* Throw away non-matching prefix. */

   473

		do_prefix = false;

   474

	}

   475

   476

	/* Now finally construct the name */

   477

   478

	if (do_prefix) {

   479

		CzechPattern pattern = name_czech_adj[prefix].pattern;

   480

		size_t endpos;