-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathnamegen.h
483 lines (436 loc) · 9.46 KB
/
namegen.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
#define MAX_SYLLABLE 4
#define LEN_OVERFLOW 7
#define LEN_UNDRFLOW 3
#define FINAL_DIFF .75f
#define CONSONANTS \
ENTRY(B, 1) \
ENTRY(C, 1) \
ENTRY(CL, 2) \
ENTRY(CH, 2) \
ENTRY(CHD, 3) \
ENTRY(CN, 2) \
ENTRY(DD, 2) \
ENTRY(G, 1) \
ENTRY(F, 1) \
ENTRY(FH, 2) \
ENTRY(GN, 2) \
ENTRY(H, 1) \
ENTRY(LL, 2) \
ENTRY(NG, 2) \
ENTRY(NN, 2) \
ENTRY(RH, 2) \
ENTRY(RR, 2) \
ENTRY(STR, 3)
#define CONSONANTS_CODA \
ENTRY(BH, 2) \
ENTRY(D, 1) \
ENTRY(DH, 2) \
ENTRY(GH, 2) \
ENTRY(L, 1) \
ENTRY(M, 1) \
ENTRY(MH, 2) \
ENTRY(N, 1) \
ENTRY(R, 1) \
ENTRY(S, 1) \
ENTRY(T, 1) \
ENTRY(TH, 2)
#define VOWELS_BROAD \
ENTRY(A, 1) \
ENTRY(O, 1) \
ENTRY(AO, 2) \
ENTRY(U, 1) \
ENTRY(UA, 2)
#define VOWELS_BROAD_SLENDER \
ENTRY(AI, 2) \
ENTRY(AOI, 3) \
ENTRY(OI, 2) \
ENTRY(UAI, 3) \
ENTRY(UI, 2)
#define VOWELS_SLENDER \
ENTRY(E, 1) \
ENTRY(I, 1) \
ENTRY(Y, 1) \
ENTRY(EI, 2) \
ENTRY(EOI, 3)
#define VOWELS_SLENDER_BROAD \
ENTRY(EA, 2) \
ENTRY(EO, 2) \
ENTRY(EU, 2) \
ENTRY(IA, 2) \
ENTRY(IO, 2) \
ENTRY(IU, 2)
// P
// PH
// SR
// WY
#define ENTRY(_, ...) , #_
static const char *consonants[] = { "" CONSONANTS_CODA , "" CONSONANTS };
static const char *vowels[] = {
"" VOWELS_BROAD VOWELS_BROAD_SLENDER ,
"" VOWELS_SLENDER VOWELS_SLENDER_BROAD
};
#undef ENTRY
typedef struct {
#define ENTRY(_, ...) , CONS_ ## _
enum consonant {
CONS_NONE
CONSONANTS_CODA , CONS_COUNT_CODA
CONSONANTS , CONS_LAST
} onset, coda;
#undef ENTRY
#define ENTRY(_, ...) , VOWEL_ ## _
enum vowel {
VOWEL_NONE
VOWELS_BROAD VOWELS_BROAD_SLENDER , VOWEL_COUNT_BROAD
VOWELS_SLENDER VOWELS_SLENDER_BROAD , VOWEL_LAST
} vowel;
#undef ENTRY
} syllable;
#define CONS_COUNT (CONS_LAST - 1)
#define VOWEL_COUNT (VOWEL_LAST - 1)
#define VOWEL_COUNT_SLENDER (VOWEL_COUNT - VOWEL_COUNT_BROAD)
typedef struct {
u32 len;
enum {
CONSTR_NONE
, CONSTR_INITIAL
, CONSTR_FINAL
} type;
struct {
enum vowel_class {
PREV_NONE
, PREV_BROAD
, PREV_SLENDER
} class;
enum consonant cons;
} prev;
} constraint;
static const enum vowel_class vowel_class_tail(const enum vowel vowel)
{
switch (vowel) {
#define ENTRY(_, ...) case VOWEL_ ## _ :
VOWELS_SLENDER_BROAD
VOWELS_BROAD
return PREV_BROAD ;
VOWELS_BROAD_SLENDER
VOWELS_SLENDER
return PREV_SLENDER ;
default:
panic();
}
#undef ENTRY
}
#define ENTRY(_, N) , N
static const u32 consonant_len[] = { 0 CONSONANTS_CODA , 0 CONSONANTS };
static const u32 vowel_len[] = {
0 VOWELS_BROAD VOWELS_BROAD_SLENDER ,
0 VOWELS_SLENDER VOWELS_SLENDER_BROAD
};
#undef ENTRY
#define ENTRY(_, ...) CONS_ ## _ ,
#define LUT_N_CONS_CODA (sizeof(lut_consonant_coda) / sizeof(enum consonant))
static const enum consonant lut_consonant_coda[] = {
CONSONANTS_CODA
PASTE_8 (ENTRY(BH, 0))
PASTE_64(ENTRY(D, 0))
PASTE_64(ENTRY(L, 0))
PASTE_64(ENTRY(M, 0))
PASTE_32(ENTRY(N, 0))
PASTE_32(ENTRY(R, 0))
PASTE_16(ENTRY(S, 0))
PASTE_16(ENTRY(T, 0))
PASTE_8 (ENTRY(TH, 0))
};
#define LUT_N_CONS_ELSE (sizeof(lut_consonant_else) / sizeof(enum consonant))
static const enum consonant lut_consonant_else[] = {
CONSONANTS
PASTE_64(ENTRY(B, 0))
PASTE_64(ENTRY(C, 0))
PASTE_8 (ENTRY(CL, 0))
PASTE_8 (ENTRY(CH, 0))
PASTE_8 (ENTRY(DD, 0))
PASTE_8 (ENTRY(G, 0))
PASTE_32(ENTRY(F, 0))
PASTE_8 (ENTRY(H, 0))
PASTE_8 (ENTRY(RH, 0))
};
#undef ENTRY
#define ENTRY(_, ...) VOWEL_ ## _ ,
#define LUT_N_VOWEL_BROAD (sizeof(lut_vowel_broad) / sizeof(enum vowel))
static const enum vowel lut_vowel_broad[] = {
VOWELS_BROAD
VOWELS_BROAD_SLENDER
PASTE_64(ENTRY(A, 0))
PASTE_16(ENTRY(O, 0))
PASTE_8 (ENTRY(AI, 0))
};
#define LUT_N_VOWEL_SLENDER (sizeof(lut_vowel_slender) / sizeof(enum vowel))
static const enum vowel lut_vowel_slender[] = {
VOWELS_SLENDER
VOWELS_SLENDER_BROAD
PASTE_32(ENTRY(E, 0))
PASTE_16(ENTRY(I, 0))
PASTE_8 (ENTRY(Y, 0))
PASTE_8 (ENTRY(EA, 0))
PASTE_8 (ENTRY(IA, 0))
};
#undef ENTRY
static enum consonant rand_cons()
{
const u32 i = randu32(0, LUT_N_CONS_CODA + LUT_N_CONS_ELSE);
return i < LUT_N_CONS_CODA ?
lut_consonant_coda[i] : lut_consonant_else[i - LUT_N_CONS_CODA];
}
static enum consonant rand_cons_coda()
{
return lut_consonant_coda[randu32(0, LUT_N_CONS_CODA)];
}
static enum vowel rand_vowel_broad()
{
return lut_vowel_broad[randu32(0, LUT_N_VOWEL_BROAD)];
}
static enum vowel rand_vowel_slender()
{
return lut_vowel_slender[randu32(0, LUT_N_VOWEL_SLENDER)];
}
static enum vowel rand_vowel()
{
const u32 i = randu32(0, LUT_N_VOWEL_BROAD + LUT_N_VOWEL_SLENDER);
return i < LUT_N_VOWEL_BROAD ?
lut_vowel_broad[i] : lut_vowel_slender[i - LUT_N_VOWEL_BROAD];
}
static int cons_valid(const constraint constr, const enum consonant cons)
{
if (constr.type != CONSTR_INITIAL && constr.prev.cons) {
if (constr.prev.cons == cons)
return 0;
if (*consonants[constr.prev.cons] == *consonants[cons])
return 0;
if (consonant_len[constr.prev.cons] > 1 && consonant_len[cons] > 1)
return 0;
switch (cons) {
case CONS_F:
switch (*consonants[constr.prev.cons]) {
case 'D':
case 'L':
case 'M':
case 'N':
case 'R':
break;
default:
return 0;
}
break;
case CONS_H:
if (consonant_len[constr.prev.cons] > 1)
return 0;
break;
case CONS_CHD:
case CONS_NG:
case CONS_RR:
return 0;
default:
break;
}
switch (constr.prev.cons) {
case CONS_T:
case CONS_TH:
switch (*consonants[cons]) {
case 'R':
case 'S':
break;
default:
return 0;
}
break;
default:
break;
}
}
switch (cons) {
case CONS_CN:
case CONS_CL:
case CONS_FH:
case CONS_GN:
return constr.type == CONSTR_INITIAL;
case CONS_CHD:
return constr.type == CONSTR_FINAL;
case CONS_CH:
case CONS_DD:
case CONS_LL:
case CONS_MH:
case CONS_NG:
case CONS_NN:
case CONS_RR:
return constr.type != CONSTR_INITIAL;
case CONS_M:
return constr.type != CONSTR_NONE;
case CONS_H:
case CONS_RH:
case CONS_S:
case CONS_STR:
return constr.type != CONSTR_FINAL;
case CONS_B:
case CONS_C:
case CONS_F:
return constr.type != CONSTR_INITIAL ?
randb() : 1;
default:
return 1;
}
}
static syllable gen_syllable(const constraint constr)
{
syllable result = { 0 };
// Too conservative, but useful
if (constr.type == CONSTR_FINAL && constr.prev.cons)
return result;
// Somewhat conservative
const int has_cons = (constr.type == CONSTR_INITIAL && constr.len > 1) ?
randf() > .5f : 1;
if (has_cons) {
do {
result.onset = rand_cons();
} while(!cons_valid(constr, result.onset));
}
if (constr.type != CONSTR_FINAL) {
if (randf() > FINAL_DIFF)
result.coda = rand_cons_coda();
}
assert(result.onset != CONS_COUNT_CODA);
assert(result.coda != CONS_COUNT_CODA);
assert(result.onset < CONS_LAST);
assert(result.coda < CONS_LAST);
switch (result.onset) {
case CONS_CHD:
result.vowel = VOWEL_NONE;
break;
case CONS_NONE:
do {
result.vowel = rand_vowel();
} while (constr.len == 1 && vowel_len[result.vowel] == 1);
break;
default:
switch (constr.type) {
case CONSTR_INITIAL:
result.vowel = rand_vowel();
break;
case CONSTR_FINAL:
if (randf() > .5f) {
result.vowel = VOWEL_NONE;
break;
}
case CONSTR_NONE:
switch (constr.prev.class) {
case PREV_BROAD:
result.vowel = rand_vowel_broad();
break;
case PREV_SLENDER:
result.vowel = rand_vowel_slender();
break;
default:
panic();
}
break;
}
break;
}
return result;
}
static constraint constraint_prev(
const syllable prev,
const int final,
const u32 len
) {
const constraint result = {
.len = len,
.type = final ? CONSTR_FINAL : CONSTR_NONE,
.prev = {
.class = vowel_class_tail(prev.vowel),
.cons = prev.coda ? prev.coda : CONS_NONE,
},
};
return result;
}
static istr syllables_render(const syllable *in, const u32 n)
{
char swap[9 * n];
char *ptr = swap;
for (u32 i = 0; i < n; ++i) {
const syllable *s = in + i;
if (!(s->onset | s->vowel | s->coda))
break;
if (s->onset && s->coda)
assert(s->vowel);
if (s->onset) {
const u32 len = consonant_len[s->onset];
strncpy(ptr, consonants[s->onset], len);
ptr += len;
}
if (s->vowel) {
const u32 len = vowel_len[s->vowel];
strncpy(ptr, vowels[s->vowel], len);
ptr += len;
}
if (s->coda) {
const u32 len = consonant_len[s->coda];
strncpy(ptr, consonants[s->coda], len);
ptr += len;
}
}
*ptr = 0;
return intern_str(swap);
}
#ifdef GEN_TRACE
static void syllables_trace(const syllable *in, const u32 n)
{
for (u32 i = 0; i < n; ++i) {
const syllable *s = in + i;
if (s->onset)
printf("<%s>", consonants[s->onset]);
if (s->vowel)
printf("<%s>", vowels[s->vowel]);
if (s->coda)
printf("<%s>", consonants[s->coda]);
if (!(s->onset | s->vowel | s->coda))
printf("<...>");
printf(" ");
}
}
#endif
istr gen_name()
{
const u32 n = randu32(1, (MAX_SYLLABLE + 1));
syllable swap[n];
swap[0] = gen_syllable(
(constraint) {
.len = n,
.type = CONSTR_INITIAL
}
);
for (u32 i = 1; i < n - 1; ++i) {
swap[i] = gen_syllable(
constraint_prev(swap[i - 1], 0, n)
);
}
if (n > 1) {
// Generate single words; no finals allowed mid word
swap[n - 1] = gen_syllable(
constraint_prev(swap[n - 2], 1, n)
);
}
const istr result = syllables_render(swap, n);
if (strlen(result) > LEN_OVERFLOW)
return gen_name();
if (strlen(result) < LEN_UNDRFLOW)
return gen_name();
if (strlen(result) == LEN_OVERFLOW && randb())
return gen_name();
if (strlen(result) == LEN_UNDRFLOW && randb())
return gen_name();
#ifdef GEN_TRACE
syllables_trace(swap, n);
printf("\n");
#endif
return result;
}