1

/* $Id$ */

     2

     3

#include "stdafx.h"

     4

#include "openttd.h"

     5

#include "debug.h"

     6

#include "namegen.h"

     7

#include "table/namegen.h"

     8

     9

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

    10

{

    11

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

    12

}

    13

    14

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

    15

{

    16

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

    17

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

    18

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

    19

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

    20

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

    21

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

    22

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

    23

	 * --pasky */

    24

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

    25

	return (seed >> shift_by) % max;

    26

}

    27

    28

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

    29

{

    30

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

    31

}

    32

    33

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

    34

{

    35

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

    36

}

    37

    38

static byte MakeEnglishOriginalTownName(char *buf, uint32 seed)

    39

{

    40

	int i;

    41

    42

	//null terminates the string for strcat

    43

	strcpy(buf, "");

    44

    45

	// optional first segment

    46

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

    47

	if (i >= 0)

    48

		strcat(buf,name_original_english_1[i]);

    49

    50

	//mandatory middle segments

    51

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

    52

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

    53

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

    54

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

    55

    56

	//optional last segment

    57

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

    58

	if (i >= 0)

    59

		strcat(buf, name_original_english_6[i]);

    60

    61

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

    62

		buf[0] = 'K';

    63

    64

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

    65

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

    66

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

    67

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

    68

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

    69

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

    70

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

    71

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

    72

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

    73

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

    74

    75

	return 0;

    76

}

    77

    78

    79

static byte MakeEnglishAdditionalTownName(char *buf, uint32 seed)

    80

{

    81

	int i;

    82

    83

	//null terminates the string for strcat

    84

	strcpy(buf, "");

    85

    86

	// optional first segment

    87

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

    88

	if (i >= 0)

    89

		strcat(buf,name_additional_english_prefix[i]);

    90

    91

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

    92

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

    93

	} else {

    94

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

    95

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

    96

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

    97

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

    98

		} else {

    99

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

   100

		}

   101

	}

   102

   103

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

   104

   105

	//optional last segment

   106

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

   107

	if (i >= 0)

   108

		strcat(buf, name_additional_english_3[i]);

   109

   110

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

   111

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

   112

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

   113

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

   114

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

   115

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

   116

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

   117

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

   118

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

   119

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

   120

   121

	return 0;

   122

}

   123

   124

static byte MakeAustrianTownName(char *buf, uint32 seed)

   125

{

   126

	int i, j = 0;

   127

	strcpy(buf, "");

   128

   129

	// Bad, Maria, Gross, ...

   130

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

   131

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

   132

   133

	i = SeedChance(4, 6, seed);

   134

	if (i >= 4) {

   135

		// Kaisers-kirchen

   136

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

   137

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

   138

	} else if (i >= 2) {

   139

		// St. Johann

   140

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

   141

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

   142

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

   143

	} else {

   144

		// Zell

   145

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

   146

	}

   147

   148

	i = SeedChance(1, 6, seed);

   149

	if (i >= 4 - j) {

   150

		// an der Donau (rivers)

   151

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

   152

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

   153

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

   154

		// am Dachstein (mountains)

   155

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

   156

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

   157

	}

   158

   159

	return 0;

   160

}

   161

   162

static byte MakeGermanTownName(char *buf, uint32 seed)

   163

{

   164

	uint i;

   165

	uint seed_derivative;

   166

   167

	//null terminates the string for strcat

   168

	strcpy(buf, "");

   169

   170

	seed_derivative = SeedChance(7, 28, seed);

   171

   172

	//optional prefix

   173

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

   174

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

   175

		strcat(buf,name_german_pre[i]);

   176

	}

   177

   178

	// mandatory middle segments including option of hardcoded name

   179

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

   180

	if (i < lengthof(name_german_real)) {

   181

		strcat(buf,name_german_real[i]);

   182

	} else {

   183

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

   184

   185

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

   186

		strcat(buf, name_german_2[i]);

   187

	}

   188

   189

	// optional suffix

   190

	if (seed_derivative == 24) {

   191

		i = SeedChance(9,

   192

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

   193

		if (i < lengthof(name_german_4_an_der)) {

   194

			strcat(buf, name_german_3_an_der[0]);

   195

			strcat(buf, name_german_4_an_der[i]);

   196

		} else {

   197

			strcat(buf, name_german_3_am[0]);

   198

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

   199

		}

   200

	}

   201

	return 0;

   202

}

   203

   204

static byte MakeSpanishTownName(char *buf, uint32 seed)

   205

{

   206

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

   207

	return 0;

   208

}

   209

   210

static byte MakeFrenchTownName(char *buf, uint32 seed)

   211

{

   212

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

   213

	return 0;

   214

}

   215

   216

static byte MakeSillyTownName(char *buf, uint32 seed)

   217

{

   218

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

   219

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

   220

	return 0;

   221

}

   222

   223

static byte MakeSwedishTownName(char *buf, uint32 seed)

   224

{

   225

	int i;

   226

   227

	//null terminates the string for strcat

   228

	strcpy(buf, "");

   229

   230

	// optional first segment

   231

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

   232

	if (i >= 0)

   233

		strcat(buf, name_swedish_1[i]);

   234

   235

	// mandatory middle segments including option of hardcoded name

   236

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

   237

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

   238

	} else {

   239

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

   240

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

   241

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

   242

	}

   243

   244

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

   245

   246

	return 0;

   247

}

   248

   249

static byte MakeDutchTownName(char *buf, uint32 seed)

   250

{

   251

	int i;

   252

   253

	//null terminates the string for strcat

   254

	strcpy(buf, "");

   255

   256

	// optional first segment

   257

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

   258

	if (i >= 0)

   259

		strcat(buf, name_dutch_1[i]);

   260

   261

	// mandatory middle segments including option of hardcoded name

   262

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

   263

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

   264

	} else {

   265

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

   266

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

   267

	}

   268

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

   269

   270

	return 0;

   271

}

   272

   273

static byte MakeFinnishTownName(char *buf, uint32 seed)

   274

{

   275

	//null terminates the string for strcat

   276

	strcpy(buf, "");

   277

   278

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

   279

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

   280

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

   281

	} else {

   282

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

   283

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

   284

	}

   285

   286

	return 0;

   287

}

   288

   289

static byte MakePolishTownName(char *buf, uint32 seed)

   290

{

   291

	uint i;

   292

	uint j;

   293

   294

	//null terminates the string for strcat

   295

	strcpy(buf, "");

   296

   297

	// optional first segment

   298

	i = SeedChance(0,

   299

		lengthof(name_polish_2_o) + lengthof(name_polish_2_m) +

   300

		lengthof(name_polish_2_f) + lengthof(name_polish_2_n),

   301

		seed);

   302

	j = SeedChance(2, 20, seed);

   303

   304

   305

	if (i < lengthof(name_polish_2_o)) {

   306

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

   307

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

   308

		if (j < 4)

   309

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

   310

   311

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

   312

   313

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

   314

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

   315

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

   316

		if (j < 4)

   317

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

   318

   319

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

   320

   321

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

   322

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

   323

	} else {

   324

		if (j < 4)

   325

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

   326

   327

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

   328

   329

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

   330

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

   331

	}

   332

	return 0;

   333

}

   334

   335

static byte MakeCzechTownName(char *buf, uint32 seed)

   336

{

   337

	/* Probability of prefixes/suffixes */

   338

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

   339

	int prob_tails;

   340

	bool do_prefix, do_suffix, dynamic_subst;

   341

	/* IDs of the respective parts */

   342

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

   343

	uint postfix = 0;

   344

	uint stem;

   345

	/* The select criteria. */

   346

	CzechGender gender;

   347

	CzechChoose choose;

   348

	CzechAllow allow;

   349

   350

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

   351

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

   352

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

   353

		return 0;

   354

	}

   355

   356

	// NUL terminates the string for strcat()

   357

	strcpy(buf, "");

   358

   359

	prob_tails = SeedModChance(2, 32, seed);

   360

	do_prefix = prob_tails < 12;

   361

	do_suffix = prob_tails > 11 && prob_tails < 17;

   362

   363

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

   364

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

   365

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

   366

	stem = SeedModChance(9,

   367

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

   368

		seed);

   369

	if (stem < lengthof(name_czech_subst_full)) {

   370

		// That was easy!

   371

		dynamic_subst = false;

   372

		gender = name_czech_subst_full[stem].gender;

   373

		choose = name_czech_subst_full[stem].choose;

   374

		allow = name_czech_subst_full[stem].allow;

   375

	} else {

   376

		unsigned int map[lengthof(name_czech_subst_ending)];

   377

		int ending_start = -1, ending_stop = -1;

   378

		int i;

   379

   380

		// Load the substantive

   381

		dynamic_subst = true;

   382

		stem -= lengthof(name_czech_subst_full);

   383

		stem %= lengthof(name_czech_subst_stem);

   384

		gender = name_czech_subst_stem[stem].gender;

   385

		choose = name_czech_subst_stem[stem].choose;

   386

		allow = name_czech_subst_stem[stem].allow;

   387

   388

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

   389

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

   390

   391

		if (choose & CZC_POSTFIX) {

   392

			// Always get a real postfix.

   393

			postfix %= lengthof(name_czech_subst_postfix);

   394

		}

   395

		if (choose & CZC_NOPOSTFIX) {

   396

			// Always drop a postfix.

   397

			postfix += lengthof(name_czech_subst_postfix);

   398

		}

   399

		if (postfix < lengthof(name_czech_subst_postfix))

   400

			choose |= CZC_POSTFIX;

   401

		else

   402

			choose |= CZC_NOPOSTFIX;

   403

   404

		// Localize the array segment containing a good gender

   405

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

   406

			const CzechNameSubst *e = &name_czech_subst_ending[ending];

   407

   408

			if (gender == CZG_FREE ||

   409

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

   410

					gender == e->gender) {

   411

				if (ending_start < 0)

   412

					ending_start = ending;

   413

   414

			} else if (ending_start >= 0) {

   415

				ending_stop = ending - 1;

   416

				break;

   417

			}

   418

		}

   419

		if (ending_stop < 0) {

   420

			// Whoa. All the endings matched.

   421

			ending_stop = ending - 1;

   422

		}

   423

   424

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

   425

		i = 0;

   426

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

   427

			const CzechNameSubst *e = &name_czech_subst_ending[ending];

   428

   429

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

   430

				map[i++] = ending;

   431

		}

   432

		assert(i > 0);

   433

   434

		// Load the ending

   435

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

   436

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

   437

		// otherwise we get overflow when modifying the adjectivum.

   438

		gender = name_czech_subst_ending[ending].gender;

   439

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

   440

	}

   441

   442

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

   443

		// Throw away non-matching prefix.

   444

		do_prefix = false;

   445

	}

   446

   447

	// Now finally construct the name

   448

   449

	if (do_prefix) {

   450

		CzechPattern pattern = name_czech_adj[prefix].pattern;

   451

		int endpos;

   452

   453

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

   454

		endpos = strlen(buf) - 1;

   455

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

   456

			/* -ovX -> -uv */

   457

			buf[endpos - 2] = 'u';

   458

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

   459

			buf[endpos] = '\0';

   460

		} else {

   461

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

   462

		}

   463

   464

		strcat(buf, " ");

   465

	}

   466

   467

	if (dynamic_subst) {

   468

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

   469

		if (postfix < lengthof(name_czech_subst_postfix)) {

   470

			const char *poststr = name_czech_subst_postfix[postfix];

   471

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

   472

			int postlen, endlen;

   473

   474

			postlen = strlen(poststr);

   475

			endlen = strlen(endstr);

   476

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

   477

   478

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

   479

			if (postlen < 2 || postlen > endlen || (

   480

						(poststr[1] != 'v' || poststr[1] != endstr[1]) &&

   481

						poststr[2] != endstr[1])

   482

					) {

   483

				uint buflen;

   484

				strcat(buf, poststr);

   485

				buflen = strlen(buf);