X-Git-Url: https://jxself.org/git/?a=blobdiff_plain;f=newdungeon.py;h=60625997f907ddc4976fd39b1ce406f5d546637f;hb=f6267ff3eb635c3494b8a67e967bb2882a0f9875;hp=b4c85b28d4f59561fbd4d9935bbb63f189fc06fa;hpb=8560122f01f82bd508b93a0d27105bf415203803;p=open-adventure.git diff --git a/newdungeon.py b/newdungeon.py index b4c85b2..6062599 100755 --- a/newdungeon.py +++ b/newdungeon.py @@ -8,7 +8,7 @@ # 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 packs that data into the travel array. +# then a second stage unpacks that data into the travel array. # # Here are the rules of the intermediate form: # @@ -138,10 +138,22 @@ typedef struct {{ }} action_t; typedef struct {{ - const long opcode; + 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[]; @@ -608,8 +620,9 @@ def buildtravel(locs, objs, voc): # TRAVEL[TRVS - 1] = -TRAVEL[TRVS - 1]; # } # - # We're going to break the magic numbers up into a struct. - travel = [[0, False]] + # 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: @@ -620,21 +633,22 @@ def buildtravel(locs, objs, voc): tkey.append(len(travel)) oldloc = loc elif travel: - travel[-1][1] = not travel[-1][1] + travel[-1][2] = not travel[-1][2] while rule: - travel.append([rule.pop(0) + newloc * 1000, False]) - travel[-1][1] = True + travel.append([rule.pop(0), newloc, False]) + travel[-1][2] = True return (travel, tkey) def get_travel(travel): template = """ {{ - .opcode = {}, + .motion = {}, + .dest = {}, .stop = {}, }}, """ out = "" for entry in travel: - out += template.format(entry[0], entry[1]).lower() + out += template.format(entry[0], entry[1], entry[2]).lower() out = out[:-1] # trim trailing newline return out