#define DSTROY(OBJECT) fDSTROY(OBJECT)
#undef JUGGLE
-void fJUGGLE(OBJECT)long OBJECT; {
+void fJUGGLE(long OBJECT) {
long I, J;
/* Juggle an object by picking it up and putting it down again, the purpose
#define JUGGLE(OBJECT) fJUGGLE(OBJECT)
#undef MOVE
-void fMOVE(OBJECT,WHERE)long OBJECT, WHERE; {
+void fMOVE(long OBJECT, long WHERE) {
long FROM;
/* Place any object anywhere by picking it up and dropping it. May already be
#define MOVE(OBJECT,WHERE) fMOVE(OBJECT,WHERE)
#undef PUT
-long fPUT(OBJECT,WHERE,PVAL)long OBJECT, PVAL, WHERE; {
+long fPUT(long OBJECT, long WHERE, long PVAL) {
long PUT;
/* PUT is the same as MOVE, except it returns a value used to set up the
#define PUT(OBJECT,WHERE,PVAL) fPUT(OBJECT,WHERE,PVAL)
#undef CARRY
-void fCARRY(OBJECT,WHERE)long OBJECT, WHERE; {
+void fCARRY(long OBJECT, long WHERE) {
long TEMP;
/* Start toting an object, removing it from the list of things at its former
#define CARRY(OBJECT,WHERE) fCARRY(OBJECT,WHERE)
#undef DROP
-void fDROP(OBJECT,WHERE)long OBJECT, WHERE; {
+void fDROP(long OBJECT, long WHERE) {
;
/* Place an object at a given loc, prefixing it onto the ATLOC list. Decr
#define DROP(OBJECT,WHERE) fDROP(OBJECT,WHERE)
#undef ATDWRF
-long fATDWRF(WHERE)long WHERE; {
+long fATDWRF(long WHERE) {
long ATDWRF, I;
/* Return the index of first dwarf at the given location, zero if no dwarf is
/* Utility routines (SETBIT, TSTBIT, RAN, RNDVOC, BUG) */
#undef SETBIT
-long fSETBIT(BIT)long BIT; {
+long fSETBIT(long BIT) {
long I, SETBIT;
/* Returns 2**bit for use in constructing bit-masks. */
#define SETBIT(BIT) fSETBIT(BIT)
#undef TSTBIT
-long fTSTBIT(MASK,BIT)long BIT, MASK; {
+long fTSTBIT(long MASK, long BIT) {
long TSTBIT;
/* Returns true if the specified bit is set in the mask. */
#define TSTBIT(MASK,BIT) fTSTBIT(MASK,BIT)
#undef RAN
-long fRAN(RANGE)long RANGE; {
+long fRAN(long RANGE) {
static long D, R = 0, RAN, T;
/* Since the ran function in LIB40 seems to be a real lose, we'll use one of
#define RAN(RANGE) fRAN(RANGE)
#undef RNDVOC
-long fRNDVOC(CHAR,FORCE)long CHAR, FORCE; {
+long fRNDVOC(long CHAR, long FORCE) {
long DIV, I, J, RNDVOC;
/* Searches the vocabulary for a word whose second character is char, and
#define RNDVOC(CHAR,FORCE) fRNDVOC(CHAR,FORCE)
#undef BUG
-void fBUG(NUM)long NUM; {
+void fBUG(long NUM) {
/* The following conditions are currently considered fatal bugs. Numbers < 20
* are detected while reading the database; the others occur at "run time".
#define BUG(NUM) fBUG(NUM)
#undef MAPLIN
-void fMAPLIN(FIL)long FIL; {
+void fMAPLIN(long FIL) {
long I, VAL; static FILE *OPENED = NULL;
/* Read a line of input, either from a file (if FIL=true) or from the
#define MAPLIN(FIL) fMAPLIN(FIL)
#undef TYPE
-void fTYPE() {
+void fTYPE(void) {
long I, VAL;
/* Type the first "LNLENG" characters stored in inline, mapping them
#define TYPE() fTYPE()
#undef MPINIT
-void fMPINIT() {
+void fMPINIT(void) {
long FIRST, I, J, LAST, VAL;
static long RUNS[7][2] = {32,34, 39,46, 65,90, 97,122, 37,37, 48,57, 0,126};
#define MPINIT() fMPINIT()
#undef SAVEIO
-void fSAVEIO(OP,IN,ARR)long ARR[], IN, OP; {
+void fSAVEIO(long OP, long IN, long ARR[]) {
static FILE *F; char NAME[50];
/* If OP=0, ask for a file name and open a file. (If IN=true, the file is for