1

/* $Id$ */

     2

     3

#include "stdafx.h"

     4

#include "openttd.h"

     5

#include "debug.h"

     6

#include "macros.h"

     7

#include "namegen.h"

     8

#include "table/namegen.h"

     9

    10

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

    11

{

    12

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

    13

}

    14

    15

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

    16

{

    17

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

    18

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

    19

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

    20

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

    21

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

    22

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

    23

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

    24

	 * --pasky */

    25

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

    26

	return (seed >> shift_by) % max;

    27

}

    28

    29

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

    30

{

    31

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

    32

}

    33

    34

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

    35

{

    36

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

    37

}

    38

    39

static byte MakeEnglishOriginalTownName(char *buf, uint32 seed)

    40

{

    41

	int i;

    42

    43

	//null terminates the string for strcat

    44

	strcpy(buf, "");

    45

    46

	// optional first segment

    47

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

    48

	if (i >= 0)

    49

		strcat(buf,name_original_english_1[i]);

    50

    51

	//mandatory middle segments

    52

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

    53

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

    54

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

    55

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

    56

    57

	//optional last segment

    58

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

    59

	if (i >= 0)

    60

		strcat(buf, name_original_english_6[i]);

    61

    62

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

    63

		buf[0] = 'K';

    64

    65

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

    66

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

    67

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

    68

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

    69

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

    70

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

    71

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

    72

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

    73

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

    74

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

    75

    76

	return 0;

    77

}

    78

    79

    80

static byte MakeEnglishAdditionalTownName(char *buf, uint32 seed)

    81

{

    82

	int i;

    83

    84

	//null terminates the string for strcat

    85

	strcpy(buf, "");

    86

    87

	// optional first segment

    88

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

    89

	if (i >= 0)

    90

		strcat(buf,name_additional_english_prefix[i]);

    91

    92

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

    93

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

    94

	} else {

    95

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

    96

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

    97

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

    98

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

    99

		} else {

   100

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

   101

		}

   102

	}

   103

   104

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

   105

   106

	//optional last segment

   107

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

   108

	if (i >= 0)

   109

		strcat(buf, name_additional_english_3[i]);

   110

   111

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

   112

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

   113

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

   114

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

   115

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

   116

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

   117

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

   118

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

   119

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

   120

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

   121

   122

	return 0;

   123

}

   124

   125

static byte MakeAustrianTownName(char *buf, uint32 seed)

   126

{

   127

	int i, j = 0;

   128

	strcpy(buf, "");

   129

   130

	// Bad, Maria, Gross, ...

   131

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

   132

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

   133

   134

	i = SeedChance(4, 6, seed);

   135

	if (i >= 4) {

   136

		// Kaisers-kirchen

   137

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

   138

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

   139

	} else if (i >= 2) {

   140

		// St. Johann

   141

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

   142

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

   143

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

   144

	} else {

   145

		// Zell

   146

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

   147

	}

   148

   149

	i = SeedChance(1, 6, seed);

   150

	if (i >= 4 - j) {

   151

		// an der Donau (rivers)

   152

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

   153

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

   154

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

   155

		// am Dachstein (mountains)

   156

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

   157

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

   158

	}

   159

   160

	return 0;

   161

}

   162

   163

static byte MakeGermanTownName(char *buf, uint32 seed)

   164

{

   165

	uint i;

   166

	uint seed_derivative;

   167

   168

	//null terminates the string for strcat

   169

	strcpy(buf, "");

   170

   171

	seed_derivative = SeedChance(7, 28, seed);

   172

   173

	//optional prefix

   174

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

   175

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

   176

		strcat(buf,name_german_pre[i]);

   177

	}

   178

   179

	// mandatory middle segments including option of hardcoded name

   180

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

   181

	if (i < lengthof(name_german_real)) {

   182

		strcat(buf,name_german_real[i]);

   183

	} else {

   184

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

   185

   186

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

   187

		strcat(buf, name_german_2[i]);

   188

	}

   189

   190

	// optional suffix

   191

	if (seed_derivative == 24) {

   192

		i = SeedChance(9,

   193

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

   194

		if (i < lengthof(name_german_4_an_der)) {

   195

			strcat(buf, name_german_3_an_der[0]);

   196

			strcat(buf, name_german_4_an_der[i]);

   197

		} else {

   198

			strcat(buf, name_german_3_am[0]);

   199

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

   200

		}

   201

	}

   202

	return 0;

   203

}

   204

   205

static byte MakeSpanishTownName(char *buf, uint32 seed)

   206

{

   207

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

   208

	return 0;

   209

}

   210

   211

static byte MakeFrenchTownName(char *buf, uint32 seed)

   212

{

   213

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

   214

	return 0;

   215

}

   216

   217

static byte MakeSillyTownName(char *buf, uint32 seed)

   218

{

   219

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

   220

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

   221

	return 0;

   222

}

   223

   224

static byte MakeSwedishTownName(char *buf, uint32 seed)

   225

{

   226

	int i;

   227

   228

	//null terminates the string for strcat

   229

	strcpy(buf, "");

   230

   231

	// optional first segment

   232

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

   233

	if (i >= 0)

   234

		strcat(buf, name_swedish_1[i]);

   235

   236

	// mandatory middle segments including option of hardcoded name

   237

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

   238

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

   239

	} else {

   240

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

   241

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

   242

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

   243

	}

   244

   245

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

   246

   247

	return 0;

   248

}

   249

   250

static byte MakeDutchTownName(char *buf, uint32 seed)

   251

{

   252

	int i;

   253

   254

	//null terminates the string for strcat

   255

	strcpy(buf, "");

   256

   257

	// optional first segment

   258

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

   259

	if (i >= 0)

   260

		strcat(buf, name_dutch_1[i]);

   261

   262

	// mandatory middle segments including option of hardcoded name

   263

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

   264

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

   265

	} else {

   266

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

   267

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

   268

	}

   269

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

   270

   271

	return 0;

   272

}

   273

   274

static byte MakeFinnishTownName(char *buf, uint32 seed)

   275

{

   276

	//null terminates the string for strcat

   277

	strcpy(buf, "");

   278

   279

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

   280

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

   281

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

   282

	} else {

   283

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

   284

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

   285

	}

   286

   287

	return 0;

   288

}

   289

   290

static byte MakePolishTownName(char *buf, uint32 seed)

   291

{

   292

	uint i;

   293

	uint j;

   294

   295

	//null terminates the string for strcat

   296

	strcpy(buf, "");

   297

   298

	// optional first segment

   299

	i = SeedChance(0,

   300

		lengthof(name_polish_2_o) + lengthof(name_polish_2_m) +

   301

		lengthof(name_polish_2_f) + lengthof(name_polish_2_n),

   302

		seed);

   303

	j = SeedChance(2, 20, seed);

   304

   305

   306

	if (i < lengthof(name_polish_2_o)) {

   307

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

   308

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

   309

		if (j < 4)

   310

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

   311

   312

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

   313

   314

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

   315

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

   316

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

   317

		if (j < 4)

   318

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

   319

   320

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

   321

   322

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

   323

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

   324

	} else {

   325

		if (j < 4)

   326

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

   327

   328

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

   329

   330

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

   331

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

   332

	}

   333

	return 0;

   334

}

   335

   336

static byte MakeCzechTownName(char *buf, uint32 seed)

   337

{

   338

	/* Probability of prefixes/suffixes */

   339

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

   340

	int prob_tails;

   341

	bool do_prefix, do_suffix, dynamic_subst;

   342

	/* IDs of the respective parts */

   343

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

   344

	uint postfix = 0;

   345

	uint stem;

   346

	/* The select criteria. */

   347

	CzechGender gender;

   348

	CzechChoose choose;

   349

	CzechAllow allow;

   350

   351

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

   352

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

   353

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

   354

		return 0;

   355

	}

   356

   357

	// NUL terminates the string for strcat()

   358

	strcpy(buf, "");

   359

   360

	prob_tails = SeedModChance(2, 32, seed);

   361

	do_prefix = prob_tails < 12;

   362

	do_suffix = prob_tails > 11 && prob_tails < 17;

   363

   364

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

   365

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

   366

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

   367

	stem = SeedModChance(9,

   368

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

   369

		seed);

   370

	if (stem < lengthof(name_czech_subst_full)) {

   371

		// That was easy!

   372

		dynamic_subst = false;

   373

		gender = name_czech_subst_full[stem].gender;

   374

		choose = name_czech_subst_full[stem].choose;

   375

		allow = name_czech_subst_full[stem].allow;

   376

	} else {

   377

		unsigned int map[lengthof(name_czech_subst_ending)];

   378

		int ending_start = -1, ending_stop = -1;

   379

		int i;

   380

   381

		// Load the substantive

   382

		dynamic_subst = true;

   383

		stem -= lengthof(name_czech_subst_full);

   384

		stem %= lengthof(name_czech_subst_stem);

   385

		gender = name_czech_subst_stem[stem].gender;

   386

		choose = name_czech_subst_stem[stem].choose;

   387

		allow = name_czech_subst_stem[stem].allow;

   388

   389

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

   390

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

   391

   392

		if (choose & CZC_POSTFIX) {

   393

			// Always get a real postfix.

   394

			postfix %= lengthof(name_czech_subst_postfix);

   395

		}

   396

		if (choose & CZC_NOPOSTFIX) {

   397

			// Always drop a postfix.

   398

			postfix += lengthof(name_czech_subst_postfix);

   399

		}

   400

		if (postfix < lengthof(name_czech_subst_postfix))

   401

			choose |= CZC_POSTFIX;

   402

		else

   403

			choose |= CZC_NOPOSTFIX;

   404

   405

		// Localize the array segment containing a good gender

   406

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

   407

			const CzechNameSubst *e = &name_czech_subst_ending[ending];

   408

   409

			if (gender == CZG_FREE ||

   410

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

   411

					gender == e->gender) {

   412

				if (ending_start < 0)

   413

					ending_start = ending;

   414

   415

			} else if (ending_start >= 0) {

   416

				ending_stop = ending - 1;

   417

				break;

   418

			}

   419

		}

   420

		if (ending_stop < 0) {

   421

			// Whoa. All the endings matched.

   422

			ending_stop = ending - 1;

   423

		}

   424

   425

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

   426

		i = 0;

   427

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

   428

			const CzechNameSubst *e = &name_czech_subst_ending[ending];

   429

   430

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

   431

				map[i++] = ending;

   432

		}

   433

		assert(i > 0);

   434

   435

		// Load the ending

   436

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

   437

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

   438

		// otherwise we get overflow when modifying the adjectivum.

   439

		gender = name_czech_subst_ending[ending].gender;

   440

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

   441

	}

   442

   443

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

   444

		// Throw away non-matching prefix.

   445

		do_prefix = false;

   446

	}

   447

   448

	// Now finally construct the name

   449

   450

	if (do_prefix) {

   451

		CzechPattern pattern = name_czech_adj[prefix].pattern;

   452

		int endpos;

   453

   454

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

   455

		endpos = strlen(buf) - 1;

   456

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

   457

			/* -ovX -> -uv */

   458

			buf[endpos - 2] = 'u';

   459

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

   460

			buf[endpos] = '\0';

   461

		} else {

   462

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

   463

		}

   464

   465

		strcat(buf, " ");

   466

	}

   467

   468

	if (dynamic_subst) {

   469

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

   470

		if (postfix < lengthof(name_czech_subst_postfix)) {

   471

			const char *poststr = name_czech_subst_postfix[postfix];

   472

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

   473

			int postlen, endlen;

   474

   475

			postlen = strlen(poststr);

   476

			endlen = strlen(endstr);

   477

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

   478

   479

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

   480

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

   481

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

   482

						poststr[2] != endstr[1])

   483

					) {

   484

				uint buflen;

   485