1

/* $Id$ */

     2

     3

/** @file namegen.cpp */

     4

     5

#include "stdafx.h"

     6

#include "openttd.h"

     7

#include "debug.h"

     8

#include "macros.h"

     9

#include "namegen.h"

    10

#include "table/namegen.h"

    11

#include "string.h"

    12

    13

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

    14

{

    15

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

    16

}

    17

    18

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

    19

{

    20

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

    21

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

    22

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

    23

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

    24

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

    25

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

    26

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

    27

	 * --pasky */

    28

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

    29

	return (seed >> shift_by) % max;

    30

}

    31

    32

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

    33

{

    34

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

    35

}

    36

    37

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

    38

{

    39

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

    40

}

    41

    42

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

    43

{

    44

	int i;

    45

    46

	/* null terminates the string for strcat */

    47

	strecpy(buf, "", last);

    48

    49

	/* optional first segment */

    50

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

    51

	if (i >= 0)

    52

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

    53

    54

	/* mandatory middle segments */

    55

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

    56

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

    57

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

    58

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

    59

    60

	/* optional last segment */

    61

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

    62

	if (i >= 0)

    63

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

    64

    65

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

    66

		buf[0] = 'K';

    67

    68

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

    69

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

    70

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

    71

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

    72

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

    73

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

    74

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

    75

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

    76

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

    77

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

    78

    79

	return 0;

    80

}

    81

    82

    83

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

    84

{

    85

	int i;

    86

    87

	/* null terminates the string for strcat */

    88

	strecpy(buf, "", last);

    89

    90

	/* optional first segment */

    91

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

    92

	if (i >= 0)

    94

    95

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

    96

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

    97

	} else {

    98

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

    99

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

   100

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

   101

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

   102

		} else {

   103

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

   104

		}

   105

	}

   106

   107

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

   108

   109

	/* optional last segment */

   110

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

   111

	if (i >= 0)

   112

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

   113

   114

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

   115

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

   116

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

   117

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

   118

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

   119

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

   120

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

   121

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

   122

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

   123

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

   124

   125

	return 0;

   126

}

   127

   128

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

   129

{

   130

	int i, j = 0;

   131

	strecpy(buf, "", last);

   132

   133

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

   134

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

   135

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

   136

   137

	i = SeedChance(4, 6, seed);

   138

	if (i >= 4) {

   139

		/* Kaisers-kirchen */

   140

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

   141

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

   142

	} else if (i >= 2) {

   143

		/* St. Johann */

   144

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

   145

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

   146

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

   147

	} else {

   148

		/* Zell */

   149

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

   150

	}

   151

   152

	i = SeedChance(1, 6, seed);

   153

	if (i >= 4 - j) {

   154

		/* an der Donau (rivers) */

   155

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

   156

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

   157

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

   158

		/* am Dachstein (mountains) */

   159

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

   160

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

   161

	}

   162

   163

	return 0;

   164

}

   165

   166

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

   167

{

   168

	uint i;

   169

	uint seed_derivative;

   170

   171

	/* null terminates the string for strcat */

   172

	strecpy(buf, "", last);

   173

   174

	seed_derivative = SeedChance(7, 28, seed);

   175

   176

	/* optional prefix */

   177

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

   178

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

   180

	}

   181

   182

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

   183

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

   184

	if (i < lengthof(name_german_real)) {

   186

	} else {

   187

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

   188

   189

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

   190

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

   191

	}

   192

   193

	/* optional suffix */

   194

	if (seed_derivative == 24) {

   195

		i = SeedChance(9,

   196

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

   197

		if (i < lengthof(name_german_4_an_der)) {

   198

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

   199

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

   200

		} else {

   201

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

   202

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

   203

		}

   204

	}

   205

	return 0;

   206

}

   207

   208

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

   209

{

   210

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

   211

	return 0;

   212

}

   213

   214

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

   215

{

   216

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

   217

	return 0;

   218

}

   219

   220

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

   221

{

   222

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

   223

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

   224

	return 0;

   225

}

   226

   227

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

   228

{

   229

	int i;

   230

   231

	/* null terminates the string for strcat */

   232

	strecpy(buf, "", last);

   233

   234

	/* optional first segment */

   235

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

   236

	if (i >= 0)

   237

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

   238

   239

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

   240

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

   241

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

   242

	} else {

   243

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

   244

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

   245

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

   246

	}

   247

   248

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

   249

   250

	return 0;

   251

}

   252

   253

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

   254

{

   255

	int i;

   256

   257

	/* null terminates the string for strcat */

   258

	strecpy(buf, "", last);

   259

   260

	/* optional first segment */

   261

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

   262

	if (i >= 0)

   263

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

   264

   265

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

   266

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

   267

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

   268

	} else {

   269

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

   270

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

   271

	}

   272

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

   273

   274

	return 0;

   275

}

   276

   277

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

   278

{

   279

	/* null terminates the string for strcat */

   280

	strecpy(buf, "", last);

   281

   282

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

   283

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

   284

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

   285

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

   287

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

   288

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

   289

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

   290

		char *end;

   291

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

   292

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

   293

		if (*end == 'i')

   294

			*end = 'e';

   295

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

   296

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

   297

		{

   298

			strecat(buf, "la", last);

   299

		} else {

   301

		}

   302

	} else {

   303

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

   304

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

   305

		uint sel = SeedChance(2,

   306

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

   307

		if (sel >= lengthof(name_finnish_1)) {

   308

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

   309

		} else {

   310

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

   311

		}

   312

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

   313

	}

   314

   315

	return 0;

   316

}

   317

   318

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

   319

{

   320

	uint i;

   321

	uint j;

   322

   323

	/* null terminates the string for strcat */

   324

	strecpy(buf, "", last);

   325

   326

	/* optional first segment */

   327

	i = SeedChance(0,

   328

		lengthof(name_polish_2_o) + lengthof(name_polish_2_m) +

   329

		lengthof(name_polish_2_f) + lengthof(name_polish_2_n),

   330

		seed);

   331

	j = SeedChance(2, 20, seed);

   332

   333

   334

	if (i < lengthof(name_polish_2_o)) {

   335

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

   336

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

   337

		if (j < 4)

   338

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

   339

   340

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

   341

   342

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

   343

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

   344

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

   345

		if (j < 4)

   346

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

   347

   348

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

   349

   350

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

   351

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

   352

	} else {

   353

		if (j < 4)

   354

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

   355

   356

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

   357

   358

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

   359

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

   360

	}

   361

	return 0;

   362

}

   363

   364

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

   365

{

   366

	/* Probability of prefixes/suffixes */

   367

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

   368

	int prob_tails;

   369

	bool do_prefix, do_suffix, dynamic_subst;

   370

	/* IDs of the respective parts */

   371

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

   372

	uint postfix = 0;

   373

	uint stem;

   374

	/* The select criteria. */

   375

	CzechGender gender;

   376

	CzechChoose choose;

   377

	CzechAllow allow;

   378

   379

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

   380

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

   381

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

   382

		return 0;

   383

	}

   384

   385

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

   386

	strecpy(buf, "", last);

   387

   388

	prob_tails = SeedModChance(2, 32, seed);

   389

	do_prefix = prob_tails < 12;

   390

	do_suffix = prob_tails > 11 && prob_tails < 17;

   391

   392

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

   393

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

   394

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

   395

	stem = SeedModChance(9,

   396

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

   397

		seed);

   398

	if (stem < lengthof(name_czech_subst_full)) {

   399

		/* That was easy! */

   400

		dynamic_subst = false;

   401

		gender = name_czech_subst_full[stem].gender;

   402

		choose = name_czech_subst_full[stem].choose;

   403

		allow = name_czech_subst_full[stem].allow;

   404

	} else {

   405

		unsigned int map[lengthof(name_czech_subst_ending)];

   406

		int ending_start = -1, ending_stop = -1;

   407

		int i;

   408

   409

		/* Load the substantive */

   410

		dynamic_subst = true;

   411

		stem -= lengthof(name_czech_subst_full);

   412

		stem %= lengthof(name_czech_subst_stem);

   413

		gender = name_czech_subst_stem[stem].gender;

   414

		choose = name_czech_subst_stem[stem].choose;

   415

		allow = name_czech_subst_stem[stem].allow;

   416

   417

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

   418

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

   419

   420

		if (choose & CZC_POSTFIX) {

   421

			/* Always get a real postfix. */

   422

			postfix %= lengthof(name_czech_subst_postfix);

   423

		}

   424

		if (choose & CZC_NOPOSTFIX) {

   425

			/* Always drop a postfix. */

   426

			postfix += lengthof(name_czech_subst_postfix);

   427

		}

   428

		if (postfix < lengthof(name_czech_subst_postfix)) {

   429

			choose |= CZC_POSTFIX;

   430

		} else {

   431

			choose |= CZC_NOPOSTFIX;

   432

		}

   433

   434

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

   435

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

   436

			const CzechNameSubst *e = &name_czech_subst_ending[ending];

   437

   438

			if (gender == CZG_FREE ||

   439

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

   440

					gender == e->gender) {

   441

				if (ending_start < 0)

   442

					ending_start = ending;

   443

   444

			} else if (ending_start >= 0) {

   445

				ending_stop = ending - 1;

   446

				break;

   447

			}

   448

		}

   449

		if (ending_stop < 0) {

   450

			/* Whoa. All the endings matched. */

   451

			ending_stop = ending - 1;

   452

		}

   453

   454

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

   455

		i = 0;

   456

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

   457

			const CzechNameSubst *e = &name_czech_subst_ending[ending];

   458

   459

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

   460

				map[i++] = ending;

   461

		}

   462

		assert(i > 0);

   463

   464

		/* Load the ending */

   465

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

   466

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

   467

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

   468

		gender = name_czech_subst_ending[ending].gender;

   469

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

   470

	}

   471

   472

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

   473

		/* Throw away non-matching prefix. */

   474

		do_prefix = false;

   475

	}

   476

   477

	/* Now finally construct the name */

   478

   479

	if (do_prefix) {