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"

    10

    11

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

    12

{

    13

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

    14

}

    15

    16

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

    17

{

    18

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

    19

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

    20

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

    21

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

    22

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

    23

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

    24

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

    25

	 * --pasky */

    26

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

    27

	return (seed >> shift_by) % max;

    28

}

    29

    30

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

    31

{

    32

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

    33

}

    34

    35

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

    36

{

    37

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

    38

}

    39

    41

{

    42

	int i;

    43

    44

	//null terminates the string for strcat

    46

    47

	// optional first segment

    48

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

    49

	if (i >= 0)

    51

    52

	//mandatory middle segments

    57

    58

	//optional last segment

    59

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

    60

	if (i >= 0)

    62

    63

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

    64

		buf[0] = 'K';

    65

    66

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

    67

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

    68

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

    69

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

    70

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

    71

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

    72

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

    73

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

    74

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

    75

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

    76

    77

	return 0;

    78

}

    79

    80

    82

{

    83

	int i;

    84

    85

	//null terminates the string for strcat

    87

    88

	// optional first segment

    89

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

    90

	if (i >= 0)

    92

    93

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

    95

	} else {

    98

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

   100

		} else {

   102

		}

   103

	}

   104

   106

   107

	//optional last segment

   108

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

   109

	if (i >= 0)

   111

   112

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

   113

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

   114

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

   115

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

   116

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

   117

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

   118

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

   119

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

   120

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

   121

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

   122

   123

	return 0;

   124

}

   125

   127

{

   128

	int i, j = 0;

   130

   131

	// Bad, Maria, Gross, ...

   132

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

   134

   135

	i = SeedChance(4, 6, seed);

   136

	if (i >= 4) {

   137

		// Kaisers-kirchen

   140

	} else if (i >= 2) {

   141

		// St. Johann

   144

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

   145

	} else {

   146

		// Zell

   148

	}

   149

   150

	i = SeedChance(1, 6, seed);

   151

	if (i >= 4 - j) {

   152

		// an der Donau (rivers)

   155

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

   156

		// am Dachstein (mountains)

   159

	}

   160

   161

	return 0;

   162

}

   163

   165

{

   166

	uint i;

   167

	uint seed_derivative;

   168

   169

	//null terminates the string for strcat

   171

   172

	seed_derivative = SeedChance(7, 28, seed);

   173

   174

	//optional prefix

   175

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

   176

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

   178

	}

   179

   180

	// mandatory middle segments including option of hardcoded name

   181

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

   182

	if (i < lengthof(name_german_real)) {

   184

	} else {

   186

   187

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

   189

	}

   190

   191

	// optional suffix

   192

	if (seed_derivative == 24) {

   193

		i = SeedChance(9,

   194

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

   195

		if (i < lengthof(name_german_4_an_der)) {

   198

		} else {

   201

		}

   202

	}

   203

	return 0;

   204

}

   205

   207

{

   209

	return 0;

   210

}

   211

   213

{

   215

	return 0;

   216

}

   217

   219

{

   222

	return 0;

   223

}

   224

   226

{

   227

	int i;

   228

   229

	//null terminates the string for strcat

   231

   232

	// optional first segment

   233

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

   234

	if (i >= 0)

   236

   237

	// mandatory middle segments including option of hardcoded name

   238

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

   240

	} else {

   244

	}

   245

   247

   248

	return 0;

   249

}

   250

   252

{

   253

	int i;

   254

   255

	//null terminates the string for strcat

   257

   258

	// optional first segment

   259

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

   260

	if (i >= 0)

   262

   263

	// mandatory middle segments including option of hardcoded name

   264

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

   266

	} else {

   269

	}

   271

   272

	return 0;

   273

}

   274

   276

{

   277

	//null terminates the string for strcat

   279

   280

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

   281

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

   283

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

   284

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

   285

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

   286

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

   287

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

   293

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

   294

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

   295

		{

   297

		} else {

   299

		}

   300

	} else {

   301

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

   302

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

   303

		uint sel = SeedChance(2,

   304

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

   305

		if (sel >= lengthof(name_finnish_1)) {

   307

		} else {

   309

		}

   311

	}

   312

   313

	return 0;

   314

}

   315

   317

{

   318

	uint i;

   319

	uint j;

   320

   321

	//null terminates the string for strcat

   323

   324

	// optional first segment

   325

	i = SeedChance(0,

   326

		lengthof(name_polish_2_o) + lengthof(name_polish_2_m) +

   327

		lengthof(name_polish_2_f) + lengthof(name_polish_2_n),

   328

		seed);

   329

	j = SeedChance(2, 20, seed);

   330

   331

   332

	if (i < lengthof(name_polish_2_o)) {

   334

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

   335

		if (j < 4)

   337

   339

   340

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

   342

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

   343

		if (j < 4)

   345

   347

   348

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

   350

	} else {

   351

		if (j < 4)

   353

   355

   356

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

   358

	}

   359

	return 0;

   360

}

   361

   363

{

   364

	/* Probability of prefixes/suffixes */

   365

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

   366

	int prob_tails;

   367

	bool do_prefix, do_suffix, dynamic_subst;

   368

	/* IDs of the respective parts */

   369

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

   370

	uint postfix = 0;

   371

	uint stem;

   372

	/* The select criteria. */

   373

	CzechGender gender;

   374

	CzechChoose choose;

   375

	CzechAllow allow;

   376

   377

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

   378

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

   380

		return 0;

   381

	}

   382

   383

	// NUL terminates the string for strcat()

   385

   386

	prob_tails = SeedModChance(2, 32, seed);

   387

	do_prefix = prob_tails < 12;

   388

	do_suffix = prob_tails > 11 && prob_tails < 17;

   389

   390

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

   391

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

   392

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

   393

	stem = SeedModChance(9,

   394

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

   395

		seed);

   396

	if (stem < lengthof(name_czech_subst_full)) {

   397

		// That was easy!

   398

		dynamic_subst = false;

   399

		gender = name_czech_subst_full[stem].gender;

   400

		choose = name_czech_subst_full[stem].choose;

   401

		allow = name_czech_subst_full[stem].allow;

   402

	} else {

   403

		unsigned int map[lengthof(name_czech_subst_ending)];

   404

		int ending_start = -1, ending_stop = -1;

   405

		int i;

   406

   407

		// Load the substantive

   408

		dynamic_subst = true;

   409

		stem -= lengthof(name_czech_subst_full);

   410

		stem %= lengthof(name_czech_subst_stem);

   411

		gender = name_czech_subst_stem[stem].gender;

   412

		choose = name_czech_subst_stem[stem].choose;

   413

		allow = name_czech_subst_stem[stem].allow;

   414

   415

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

   416

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

   417

   418

		if (choose & CZC_POSTFIX) {

   419

			// Always get a real postfix.

   420

			postfix %= lengthof(name_czech_subst_postfix);

   421

		}

   422

		if (choose & CZC_NOPOSTFIX) {

   423

			// Always drop a postfix.

   424

			postfix += lengthof(name_czech_subst_postfix);

   425

		}

   426

		if (postfix < lengthof(name_czech_subst_postfix)) {

   427

			choose |= CZC_POSTFIX;

   428

		} else {

   429

			choose |= CZC_NOPOSTFIX;

   430

		}

   431

   432

		// Localize the array segment containing a good gender

   433

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

   434

			const CzechNameSubst *e = &name_czech_subst_ending[ending];

   435

   436

			if (gender == CZG_FREE ||

   437

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

   438

					gender == e->gender) {

   439

				if (ending_start < 0)

   440

					ending_start = ending;

   441

   442

			} else if (ending_start >= 0) {

   443

				ending_stop = ending - 1;

   444

				break;

   445

			}

   446

		}

   447

		if (ending_stop < 0) {

   448

			// Whoa. All the endings matched.

   449

			ending_stop = ending - 1;

   450

		}

   451

   452

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

   453

		i = 0;

   454

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

   455

			const CzechNameSubst *e = &name_czech_subst_ending[ending];

   456

   457

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

   458

				map[i++] = ending;

   459

		}

   460

		assert(i > 0);

   461

   462

		// Load the ending

   463

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

   464

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

   465

		// otherwise we get overflow when modifying the adjectivum.

   466

		gender = name_czech_subst_ending[ending].gender;

   467

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

   468

	}

   469

   470

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

   471

		// Throw away non-matching prefix.

   472

		do_prefix = false;

   473

	}

   474

   475

	// Now finally construct the name

   476

   477

	if (do_prefix) {

   478

		CzechPattern pattern = name_czech_adj[prefix].pattern;

   479

		size_t endpos;

   480

   482

		endpos = strlen(buf) - 1;