2 * The dungeon compiler. Turns adventure.text into a set of C initializers
3 * defining invariant state.
7 * 12600 words of message text (LINES, LINSIZ).
8 * 885 travel options (TRAVEL, TRVSIZ).
9 * 330 vocabulary words (KTAB, ATAB, TABSIZ).
10 * 35 "action" verbs (ACTSPK, VRBSIZ).
11 * There are also limits which cannot be exceeded due to the structure of
12 * the database. (E.G., The vocabulary uses n/1000 to determine word type,
13 * so there can't be more than 1000 words.) These upper limits are:
14 * 1000 non-synonymous vocabulary words
19 /* Description of the database format
22 * The data file contains several sections. Each begins with a line containing
23 * a number identifying the section, and ends with a line containing "-1".
25 * Section 3: Travel table. Each line contains a location number (X), a second
26 * location number (Y), and a list of motion numbers (see section 4).
27 * each motion represents a verb which will go to Y if currently at X.
28 * Y, in turn, is interpreted as follows. Let M=Y/1000, N=Y mod 1000.
29 * If N<=300 it is the location to go to.
30 * If 300<N<=500 N-300 is used in a computed goto to
31 * a section of special code.
32 * If N>500 message N-500 from section 6 is printed,
33 * and he stays wherever he is.
34 * Meanwhile, M specifies the conditions on the motion.
35 * If M=0 it's unconditional.
36 * If 0<M<100 it is done with M% probability.
37 * If M=100 unconditional, but forbidden to dwarves.
38 * If 100<M<=200 he must be carrying object M-100.
39 * If 200<M<=300 must be carrying or in same room as M-200.
40 * If 300<M<=400 game.prop(M % 100) must *not* be 0.
41 * If 400<M<=500 game.prop(M % 100) must *not* be 1.
42 * If 500<M<=600 game.prop(M % 100) must *not* be 2, etc.
43 * If the condition (if any) is not met, then the next *different*
44 * "destination" value is used (unless it fails to meet *its* conditions,
45 * in which case the next is found, etc.). Typically, the next dest will
46 * be for one of the same verbs, so that its only use is as the alternate
47 * destination for those verbs. For instance:
48 * 15 110022 29 31 34 35 23 43
50 * This says that, from loc 15, any of the verbs 29, 31, etc., will take
51 * him to 22 if he's carrying object 10, and otherwise will go to 14.
54 * This says that, from 11, 49 takes him to 8 unless game.prop(3)=0, in which
55 * case he goes to 9. Verb 50 takes him to 9 regardless of game.prop(3).
56 * Section 4: Vocabulary. Each line contains a number (n), a tab, and a
57 * five-letter word. Call M=N/1000. If M=0, then the word is a motion
58 * verb for use in travelling (see section 3). Else, if M=1, the word is
59 * an object. Else, if M=2, the word is an action verb (such as "carry"
60 * or "attack"). Else, if M=3, the word is a special case verb (such as
61 * "dig") and N % 1000 is an index into section 6. Objects from 50 to
62 * (currently, anyway) 79 are considered treasures (for pirate, closeout).
63 * Section 7: Object locations. Each line contains an object number and its
64 * initial location (zero (or omitted) if none). If the object is
65 * immovable, the location is followed by a "-1". If it has two locations
66 * (e.g. the grate) the first location is followed with the second, and
67 * the object is assumed to be immovable.
68 * Section 8: Action defaults. Each line contains an "action-verb" number and
69 * the index (in section 6) of the default message for the verb.
70 * Section 0: End of database.
72 * Other sections are obsolete and ignored */
91 // Global variables for use in functions below that can gradually disappear as code is cleaned up
94 static char INLINE[LINESIZE + 1];
98 // Storage for what comes out of the database
102 long KEY[NLOCATIONS + 1];
103 long LINES[LINSIZ + 1];
104 long TRAVEL[TRVSIZ + 1];
105 long KTAB[TABSIZ + 1];
106 long ATAB[TABSIZ + 1];
107 long PLAC[NOBJECTS + 1];
108 long FIXD[NOBJECTS + 1];
109 long ACTSPK[VRBSIZ + 1];
111 static long GETTXT(long SKIP, long ONEWRD, long UPPER)
113 /* Take characters from an input line and pack them into 30-bit words.
114 * Skip says to skip leading blanks. ONEWRD says stop if we come to a
115 * blank. UPPER says to map all letters to uppercase. If we reach the
116 * end of the line, the word is filled up with blanks (which encode as 0's).
117 * If we're already at end of line when GETTXT is called, we return -1. */
120 static long SPLITTING = -1;
122 if (LNPOSN != SPLITTING)
128 if ((!SKIP) || INLINE[LNPOSN] != 0)
134 for (int I = 1; I <= TOKLEN; I++) {
136 if (LNPOSN > LNLENG || (ONEWRD && INLINE[LNPOSN] == 0))
138 char current = INLINE[LNPOSN];
141 if (UPPER && current >= 37)
142 current = current - 26;
143 TEXT = TEXT + current;
147 if (SPLITTING != LNPOSN) {
153 TEXT = TEXT + current - 63;
161 static void MAPLIN(FILE *OPENED)
163 /* Read a line of input, from the specified input source,
164 * translate the chars to integers in the range 0-126 and store
165 * them in the common array "INLINE". Integer values are as follows:
166 * 0 = space [ASCII CODE 40 octal, 32 decimal]
167 * 1-2 = !" [ASCII 41-42 octal, 33-34 decimal]
168 * 3-10 = '()*+,-. [ASCII 47-56 octal, 39-46 decimal]
169 * 11-36 = upper-case letters
170 * 37-62 = lower-case letters
171 * 63 = percent (%) [ASCII 45 octal, 37 decimal]
172 * 64-73 = digits, 0 through 9
173 * Remaining characters can be translated any way that is convenient;
174 * The "TYPE" routine below is used to map them back to characters when
175 * necessary. The above mappings are required so that certain special
176 * characters are known to fit in 6 bits and/or can be easily spotted.
177 * Array elements beyond the end of the line should be filled with 0,
178 * and LNLENG should be set to the index of the last character.
180 * If the data file uses a character other than space (e.g., tab) to
181 * separate numbers, that character should also translate to 0.
183 * This procedure may use the map1,map2 arrays to maintain static data for
184 * the mapping. MAP2(1) is set to 0 when the program starts
185 * and is not changed thereafter unless the routines on this page choose
189 if (NULL == fgets(INLINE + 1, sizeof(INLINE) - 1, OPENED)) {
190 printf("Failed fgets()\n");
192 } while (!feof(OPENED) && INLINE[1] == '#');
195 for (size_t i = 1; i < sizeof(INLINE) && INLINE[i] != 0; ++i) {
196 char val = INLINE[i];
197 INLINE[i] = ascii_to_advent[(unsigned)val];
204 static long GETNUM(FILE *source)
206 /* Obtain the next integer from an input line. If K>0, we first read a
207 * new input line from a file; if K<0, we read a line from the keyboard;
208 * if K=0 we use a line that has already been read (and perhaps partially
209 * scanned). If we're at the end of the line or encounter an illegal
210 * character (not a digit, hyphen, or blank), we return 0. */
212 long DIGIT, GETNUM, SIGN;
214 if (source != NULL) MAPLIN(source);
217 while (INLINE[LNPOSN] == 0) {
218 if (LNPOSN > LNLENG) return (GETNUM);
222 if (INLINE[LNPOSN] != 9) {
228 while (!(LNPOSN > LNLENG || INLINE[LNPOSN] == 0)) {
229 DIGIT = INLINE[LNPOSN] - 64;
230 if (DIGIT < 0 || DIGIT > 9) {
234 GETNUM = GETNUM * 10 + DIGIT;
238 GETNUM = GETNUM * SIGN;
243 /* Sections 1, 2, 5, 6, 10, 14. Skip these, they're all in YAML now. */
244 static void read_messages(FILE* database, long sect)
249 if (NULL == fgets(INLINE + 1, sizeof(INLINE) - 1, database)) {
250 printf("Failed fgets()\n");
252 } while (!feof(database) && INLINE[1] == '#');
253 if (strncmp(INLINE + 1, "-1\n", 3) == 0)
258 /* The stuff for section 3 is encoded here. Each "from-location" gets a
259 * contiguous section of the "TRAVEL" array. Each entry in travel is
260 * newloc*1000 + KEYWORD (from section 4, motion verbs), and is negated if
261 * this is the last entry for this location. KEY(N) is the index in travel
262 * of the first option at location N. */
263 static void read_section3_stuff(FILE* database)
266 while ((loc = GETNUM(database)) != -1) {
267 long newloc = GETNUM(NULL);
272 TRAVEL[TRVS - 1] = -TRAVEL[TRVS - 1];
274 while ((L = GETNUM(NULL)) != 0) {
275 TRAVEL[TRVS] = newloc * 1000 + L;
278 BUG(TOO_MANY_TRAVEL_OPTIONS);
280 TRAVEL[TRVS - 1] = -TRAVEL[TRVS - 1];
284 /* Here we read in the vocabulary. KTAB(N) is the word number, ATAB(N) is
285 * the corresponding word. The -1 at the end of section 4 is left in KTAB
286 * as an end-marker. */
287 static void read_vocabulary(FILE* database)
289 for (TABNDX = 1; TABNDX <= TABSIZ; TABNDX++) {
290 KTAB[TABNDX] = GETNUM(database);
291 if (KTAB[TABNDX] == -1) return;
292 ATAB[TABNDX] = GETTXT(true, true, true);
294 BUG(TOO_MANY_VOCABULARY_WORDS);
297 /* Read in the initial locations for each object. Also the immovability info.
298 * plac contains initial locations of objects. FIXD is -1 for immovable
299 * objects (including the snake), or = second loc for two-placed objects. */
300 static void read_initial_locations(FILE* database)
303 while ((OBJ = GETNUM(database)) != -1) {
304 PLAC[OBJ] = GETNUM(NULL);
305 FIXD[OBJ] = GETNUM(NULL);
309 /* Read default message numbers for action verbs, store in ACTSPK. */
310 static void read_action_verb_message_nr(FILE* database)
313 while ((verb = GETNUM(database)) != -1) {
314 ACTSPK[verb] = GETNUM(NULL);
318 /* Read info about available liquids and other conditions. */
319 static void read_conditions(FILE* database)
322 while ((K = GETNUM(database)) != -1) {
324 while ((loc = GETNUM(NULL)) != 0) {
325 continue; /* COND is no longer used */
331 /* Read data for hints. */
332 static void read_hints(FILE* database)
335 while ((K = GETNUM(database)) != -1) {
336 for (int I = 1; I <= 4; I++) {
337 /* consume - actual array-building now done in YAML. */
343 /* Read the sound/text info */
344 static void read_sound_text(FILE* database)
347 while ((K = GETNUM(database)) != -1) {
348 long KK = GETNUM(NULL);
349 long I = GETNUM(NULL);
350 /* this stuff is in YAML now */
355 static int read_database(FILE* database)
357 /* Clear out the various text-pointer arrays. All text is stored
358 * in array lines; each line is preceded by a word pointing to
359 * the next pointer (i.e. the word following the end of the
360 * line). The pointer is negative if this is first line of a
361 * message. The text-pointer arrays contain indices of
362 * pointer-words in lines. PTEXT(N) points to
363 * message for game.prop(N)=0. Successive prop messages are
364 * found by chasing pointers. */
365 for (int I = 1; I <= NLOCATIONS; I++) {
373 /* Start new data section. Sect is the section number. */
376 long sect = GETNUM(database);
382 read_messages(database, sect);
385 read_messages(database, sect);
388 read_section3_stuff(database);
391 read_vocabulary(database);
394 read_messages(database, sect);
397 read_messages(database, sect);
400 read_initial_locations(database);
403 read_action_verb_message_nr(database);
406 read_conditions(database);
409 read_messages(database, sect);
412 read_hints(database);
417 read_sound_text(database);
420 read_messages(database, sect);
423 BUG(INVALID_SECTION_NUMBER_IN_DATABASE);
428 /* Finish constructing internal data format */
430 /* Having read in the database, certain things are now constructed.
431 * game.propS are set to zero. The PLAC and FIXD arrays are used
432 * to set up game.atloc(N) as the first object at location N, and
433 * game.link(OBJ) as the next object at the same location as OBJ.
434 * (OBJ>NOBJECTS indicates that game.fixed(OBJ-NOBJECTS)=LOC; game.link(OBJ) is
435 * still the correct link to use.) game.abbrev is zeroed; it controls
436 * whether the abbreviated description is printed. Counts modulo 5
437 * unless "LOOK" is used. */
439 static void write_1d(FILE* header_file, long array[], long dim, const char* varname)
441 fprintf(header_file, "LOCATION long %s[] INITIALIZE(= {\n", varname);
442 for (int i = 0; i < dim; ++i) {
445 fprintf(header_file, "\n");
446 fprintf(header_file, " ");
448 fprintf(header_file, "%ld, ", array[i]);
450 fprintf(header_file, "\n});\n");
453 static void write_file(FILE* header_file)
455 fprintf(header_file, "#ifndef DATABASE_H\n");
456 fprintf(header_file, "#define DATABASE_H\n");
457 fprintf(header_file, "\n");
459 fprintf(header_file, "#include \"common.h\"\n");
460 fprintf(header_file, "#define TABSIZ 330\n");
461 fprintf(header_file, "#define TOKLEN %d\n", TOKLEN);
462 fprintf(header_file, "\n");
464 fprintf(header_file, "\n");
465 fprintf(header_file, "#ifdef DEFINE_GLOBALS_FROM_INCLUDES\n");
466 fprintf(header_file, "#define LOCATION\n");
467 fprintf(header_file, "#define INITIALIZE(...) __VA_ARGS__\n");
468 fprintf(header_file, "#else\n");
469 fprintf(header_file, "#define LOCATION extern\n");
470 fprintf(header_file, "#define INITIALIZE(...)\n");
471 fprintf(header_file, "#endif\n");
472 fprintf(header_file, "\n");
475 write_1d(header_file, KEY, NLOCATIONS + 1, "KEY");
476 write_1d(header_file, TRAVEL, TRVSIZ + 1, "TRAVEL");
477 write_1d(header_file, KTAB, TABSIZ + 1, "KTAB");
478 write_1d(header_file, ATAB, TABSIZ + 1, "ATAB");
479 write_1d(header_file, PLAC, NOBJECTS + 1, "PLAC");
480 write_1d(header_file, FIXD, NOBJECTS + 1, "FIXD");
481 write_1d(header_file, ACTSPK, VRBSIZ + 1, "ACTSPK");
483 fprintf(header_file, "#undef LOCATION\n");
484 fprintf(header_file, "#undef INITIALIZE\n");
485 fprintf(header_file, "#endif\n");
488 void bug(enum bugtype num, const char *error_string)
490 fprintf(stderr, "Fatal error %d, %s.\n", num, error_string);
496 FILE* database = fopen("adventure.text", "r");
497 read_database(database);
500 FILE* header_file = fopen("database.h", "w");
501 write_file(header_file);
504 return (EXIT_SUCCESS);