# This is the new open-adventure dungeon generator. It'll eventually
# replace the existing dungeon.c It currently outputs a .h and .c pair
# for C code.
+#
+# The nontrivial part of this is the compilation of the YAML for
+# movement rules to the travel array that's actually used by
+# playermove(). This program first compiles the YAML to a form
+# identical to the data in section 3 of the old adventure.text file,
+# then a second stage unpacks that data into the travel array.
+#
+# Here are the rules of the intermediate form:
+#
+# Each row of data contains a location number (X), a second
+# location number (Y), and a list of motion numbers (see section 4).
+# each motion represents a verb which will go to Y if currently at X.
+# Y, in turn, is interpreted as follows. Let M=Y/1000, N=Y mod 1000.
+# If N<=300 it is the location to go to.
+# If 300<N<=500 N-300 is used in a computed goto to
+# a section of special code.
+# If N>500 message N-500 from section 6 is printed,
+# and he stays wherever he is.
+# Meanwhile, M specifies the conditions on the motion.
+# If M=0 it's unconditional.
+# If 0<M<100 it is done with M% probability.
+# If M=100 unconditional, but forbidden to dwarves.
+# If 100<M<=200 he must be carrying object M-100.
+# If 200<M<=300 must be carrying or in same room as M-200.
+# If 300<M<=400 game.prop(M % 100) must *not* be 0.
+# If 400<M<=500 game.prop(M % 100) must *not* be 1.
+# If 500<M<=600 game.prop(M % 100) must *not* be 2, etc.
+# If the condition (if any) is not met, then the next *different*
+# "destination" value is used (unless it fails to meet *its* conditions,
+# in which case the next is found, etc.). Typically, the next dest will
+# be for one of the same verbs, so that its only use is as the alternate
+# destination for those verbs. For instance:
+# 15 110022 29 31 34 35 23 43
+# 15 14 29
+# This says that, from loc 15, any of the verbs 29, 31, etc., will take
+# him to 22 if he's carrying object 10, and otherwise will go to 14.
+# 11 303008 49
+# 11 9 50
+# This says that, from 11, 49 takes him to 8 unless game.prop(3)=0, in which
+# case he goes to 9. Verb 50 takes him to 9 regardless of game.prop(3).
import sys, yaml
const long message;
}} action_t;
+typedef struct {{
+ const long motion;
+ const long dest;
+ const bool stop;
+}} travelop_t;
+
+/* Abstract out the encoding of words in the travel array. Gives us
+ * some hope of getting to a less cryptic representation than we
+ * inherited from FORTRAN, someday. To understand these, read the
+ * encoding description for travel.
+ */
+#define T_DESTINATION(entry) MOD((entry).dest, 1000)
+#define T_NODWARVES(entry) ((entry).dest / 1000 == 100)
+#define T_HIGH(entry) ((entry).dest)
+#define T_TERMINATE(entry) ((entry).motion == 1)
+#define L_SPEAK(loc) ((loc) - 500)
+
extern const location_t locations[];
extern const object_t objects[];
extern const char* arbitrary_messages[];
extern const obituary_t obituaries[];
extern const hint_t hints[];
extern long conditions[];
-extern const long actspk[];
extern const motion_t motions[];
+extern const action_t actions[];
+extern const travelop_t travel[];
+extern const long tkey[];
#define NLOCATIONS {}
#define NOBJECTS {}
#define NTHRESHOLDS {}
#define NACTIONS {}
#define NTRAVEL {}
+#define NKEYS {}
enum arbitrary_messages_refs {{
{}
{}
}};
-const long actspk[] = {{
- NO_MESSAGE,
+const motion_t motions[] = {{
{}
}};
-const motion_t motions[] = {{
+const action_t actions[] = {{
{}
}};
-const action_t actions[] = {{
+{}
+
+const travelop_t travel[] = {{
{}
}};
sys.stderr.write("%s is not a known word classifier\n" % attrs["type"])
sys.exit(1)
-def get_actspk(actspk):
- res = ""
- for (i, word) in actspk.items():
- res += " %s,\n" % word
- return res
+def get_motions(motions):
+ template = """ {{
+ .words = {},
+ }},
+"""
+ mot_str = ""
+ for motion in motions:
+ contents = motion[1]
+ if contents["words"] == None:
+ mot_str += template.format("NULL")
+ continue
+ c_words = [make_c_string(s) for s in contents["words"]]
+ words_str = "(const char* []) {" + ", ".join(c_words) + "}"
+ mot_str += template.format(words_str)
+ return mot_str
+
+def get_actions(actions):
+ template = """ {{
+ .words = {},
+ .message = {},
+ }},
+"""
+ act_str = ""
+ for action in actions:
+ contents = action[1]
+
+ if contents["words"] == None:
+ words_str = "NULL"
+ else:
+ c_words = [make_c_string(s) for s in contents["words"]]
+ words_str = "(const char* []) {" + ", ".join(c_words) + "}"
+
+ if contents["message"] == None:
+ message = "NO_MESSAGE"
+ else:
+ message = contents["message"]
+
+ act_str += template.format(words_str, message)
+ act_str = act_str[:-1] # trim trailing newline
+ return act_str
+
+def bigdump(arr):
+ out = ""
+ for (i, entry) in enumerate(arr):
+ if i % 10 == 0:
+ if out and out[-1] == ' ':
+ out = out[:-1]
+ out += "\n "
+ out += str(arr[i]) + ", "
+ out = out[:-2] + "\n"
+ return out
def buildtravel(locs, objs, voc):
ltravel = []
- lkeys = []
verbmap = {}
for entry in db["vocabulary"]:
if entry["type"] == "motion" and entry["value"] not in verbmap:
elif cond[0] == "not":
# FIXME: Allow named as well as numbered states
try:
- return 300 + objnames.index(cond[1]) + 100 * cond[2]
+ obj = objnames.index(cond[1])
+ if type(cond[2]) == int:
+ state = cond[2]
+ else:
+ for (i, stateclause) in enumerate(objs[obj][1]["longs"]):
+ if type(stateclause) == list:
+ if stateclause[0] == cond[2]:
+ state = i
+ break
+ else:
+ sys.stderr.write("dungeon: unmatched state symbol %s in not clause of %s\n" % (cond[2], name))
+ sys.exit(0);
+ return 300 + obj + 100 * state
except ValueError:
sys.stderr.write("dungeon: unknown object name %s in not clause of %s\n" % (cond[1], name))
sys.exit(1)
else:
print(cond)
raise ValueError
- # Much more to be done here
+
for (i, (name, loc)) in enumerate(locs):
if "travel" in loc:
for rule in loc["travel"]:
if not rule["verbs"]:
tt.append(1)
ltravel.append(tuple(tt))
- return (tuple(ltravel), lkeys)
-
-def get_motions(motions):
- template = """ {{
- .words = {},
- }},
-"""
- mot_str = ""
- for motion in motions:
- contents = motion[1]
- if contents["words"] == None:
- mot_str += template.format("NULL")
- continue
- c_words = [make_c_string(s) for s in contents["words"]]
- words_str = "(const char* []) {" + ", ".join(c_words) + "}"
- mot_str += template.format(words_str)
- return mot_str
-def get_actions(actions):
+ # At this point the ltravel data is in the Section 3
+ # representation from the FORTRAN version. Next we perform the
+ # same mapping into the runtime format. This was the C translation
+ # of the FORTRAN code:
+ # long loc;
+ # while ((loc = GETNUM(database)) != -1) {
+ # long newloc = GETNUM(NULL);
+ # long L;
+ # if (TKEY[loc] == 0) {
+ # TKEY[loc] = TRVS;
+ # } else {
+ # TRAVEL[TRVS - 1] = -TRAVEL[TRVS - 1];
+ # }
+ # while ((L = GETNUM(NULL)) != 0) {
+ # TRAVEL[TRVS] = newloc * 1000 + L;
+ # TRVS = TRVS + 1;
+ # if (TRVS == TRVSIZ)
+ # BUG(TOO_MANY_TRAVEL_OPTIONS);
+ # }
+ # TRAVEL[TRVS - 1] = -TRAVEL[TRVS - 1];
+ # }
+ #
+ # In order to de-crypticize the runtime code, we're going to break these
+ # magic numbers up into a struct.
+ travel = [[0, 0, False]]
+ tkey = [0]
+ oldloc = 0
+ while ltravel:
+ rule = list(ltravel.pop(0))
+ loc = rule.pop(0)
+ newloc = rule.pop(0)
+ if loc != oldloc:
+ tkey.append(len(travel))
+ oldloc = loc
+ elif travel:
+ travel[-1][2] = not travel[-1][2]
+ while rule:
+ travel.append([rule.pop(0), newloc, False])
+ travel[-1][2] = True
+ return (travel, tkey)
+
+def get_travel(travel):
template = """ {{
- .words = {},
- .message = {},
+ .motion = {},
+ .dest = {},
+ .stop = {},
}},
"""
- act_str = ""
- for action in actions:
- contents = action[1]
-
- if contents["words"] == None:
- words_str = "NULL"
- else:
- c_words = [make_c_string(s) for s in contents["words"]]
- words_str = "(const char* []) {" + ", ".join(c_words) + "}"
-
- if contents["message"] == None:
- message = "NO_MESSAGE"
- else:
- message = contents["message"]
-
- act_str += template.format(words_str, message)
- act_str = act_str[:-1] # trim trailing newline
- return act_str
+ out = ""
+ for entry in travel:
+ out += template.format(entry[0], entry[1], entry[2]).lower()
+ out = out[:-1] # trim trailing newline
+ return out
if __name__ == "__main__":
with open(yaml_name, "r") as f:
locnames = [x[0] for x in db["locations"]]
msgnames = [el[0] for el in db["arbitrary_messages"]]
objnames = [el[0] for el in db["objects"]]
- (travel, key) = buildtravel(db["locations"], db["objects"], db["vocabulary"])
- # FIXME: pack the Section 3 representation into the runtime format.
+
+ (travel, tkey) = buildtravel(db["locations"],
+ db["objects"],
+ db["vocabulary"])
c = c_template.format(
h_name,
get_obituaries(db["obituaries"]),
get_hints(db["hints"], db["arbitrary_messages"]),
get_condbits(db["locations"]),
- get_actspk(db["actspk"]),
get_motions(db["motions"]),
get_actions(db["actions"]),
+ "const long tkey[] = {%s};" % bigdump(tkey),
+ get_travel(travel),
)
h = h_template.format(
len(db["classes"])-1,
len(db["obituaries"]),
len(db["turn_thresholds"]),
- len(db["actspk"]),
+ len(db["actions"]),
len(travel),
+ len(tkey),
get_refs(db["arbitrary_messages"]),
get_refs(db["locations"]),
get_refs(db["objects"]),