diff --git a/actions1.c b/actions1.c index 2c7d336..11efd46 100644 --- a/actions1.c +++ b/actions1.c @@ -30,7 +30,7 @@ L4000: VERB=K; /* ANALYSE AN INTRANSITIVE VERB (IE, NO OBJECT GIVEN YET). */ -L4080: switch (VERB-1) { case 0: goto L8010; case 1: return(8000); case 2: + switch (VERB-1) { case 0: goto L8010; case 1: return(8000); case 2: return(8000); case 3: goto L8040; case 4: return(2009); case 5: goto L8040; case 6: goto L8070; case 7: goto L8080; case 8: return(8000); case 9: return(8000); case 10: return(2011); case 11: goto L9120; case 12: @@ -435,8 +435,8 @@ L8260: SPK=156; /* READ. PRINT STUFF BASED ON OBJTXT. OYSTER (?) IS SPECIAL CASE. */ -L8270: /* 8275 */ for (I=1; I<=100; I++) { -L8275: if(HERE(I) && OBJTXT[I] != 0 && PROP[I] >= 0)OBJ=OBJ*100+I; +L8270: for (I=1; I<=100; I++) { + if(HERE(I) && OBJTXT[I] != 0 && PROP[I] >= 0)OBJ=OBJ*100+I; } /* end loop */ if(OBJ > 100 || OBJ == 0 || DARK(0)) return(8000); diff --git a/actions2.c b/actions2.c index 75179dc..8ca8dd2 100644 --- a/actions2.c +++ b/actions2.c @@ -187,9 +187,9 @@ L9126: if(OBJ == 0)SPK=44; MOVE(DRAGON,K); MOVE(RUG,K); DROP(BLOOD,K); - /* 9127 */ for (OBJ=1; OBJ<=100; OBJ++) { + for (OBJ=1; OBJ<=100; OBJ++) { if(PLACE[OBJ] == PLAC[DRAGON] || PLACE[OBJ] == FIXD[DRAGON])MOVE(OBJ,K); -L9127: /*etc*/ ; + /*etc*/ ; } /* end loop */ LOC=K; K=NUL; diff --git a/init.c b/init.c index 96836e1..6097d3e 100644 --- a/init.c +++ b/init.c @@ -299,11 +299,11 @@ L1039: TRVS--; TRAVEL[TRVS]= -TRAVEL[TRVS]; TRVS++; * WOULD MAKE IT HARDER TO DETECT PARTICULAR INPUT WORDS.) */ L1040: J=10000; - /* 1042 */ for (TABNDX=1; TABNDX<=TABSIZ; TABNDX++) { -L1043: KTAB[TABNDX]=GETNUM(1); + for (TABNDX=1; TABNDX<=TABSIZ; TABNDX++) { + KTAB[TABNDX]=GETNUM(1); if(KTAB[TABNDX] == -1) goto L1002; J=J+7; -L1042: ATAB[TABNDX]=GETTXT(true,true,true,0)+J*J; + ATAB[TABNDX]=GETTXT(true,true,true,0)+J*J; } /* end loop */ BUG(4); @@ -340,8 +340,8 @@ L1080: HNTMAX=0; L1081: K=GETNUM(1); if(K == -1) goto L1002; if(K <= 0 || K > HNTSIZ)BUG(7); - /* 1083 */ for (I=1; I<=4; I++) { -L1083: HINTS[K][I] =GETNUM(0); + for (I=1; I<=4; I++) { + HINTS[K][I] =GETNUM(0); } /* end loop */ HNTMAX=(HNTMAX>K ? HNTMAX : K); goto L1081; @@ -372,11 +372,11 @@ L1092: LOCSND[K]=KK; * DESCRIPTION IS PRINTED. COUNTS MOD 5 UNLESS "LOOK" IS USED. */ static int finish_init(void) { - /* 1101 */ for (I=1; I<=100; I++) { + for (I=1; I<=100; I++) { PLACE[I]=0; PROP[I]=0; LINK[I]=0; -L1101: {long x = I+100; LINK[x]=0;} + {long x = I+100; LINK[x]=0;} } /* end loop */ /* 1102 */ for (I=1; I<=LOCSIZ; I++) { @@ -402,10 +402,10 @@ L1102: ATLOC[I]=0; L1106: /*etc*/ ; } /* end loop */ - /* 1107 */ for (I=1; I<=100; I++) { + for (I=1; I<=100; I++) { K=101-I; FIXED[K]=FIXD[K]; -L1107: if(PLAC[K] != 0 && FIXD[K] <= 0)DROP(K,PLAC[K]); + if(PLAC[K] != 0 && FIXD[K] <= 0)DROP(K,PLAC[K]); } /* end loop */ /* TREASURES, AS NOTED EARLIER, ARE OBJECTS 50 THROUGH MAXTRS (CURRENTLY 79). @@ -415,17 +415,17 @@ L1107: if(PLAC[K] != 0 && FIXD[K] <= 0)DROP(K,PLAC[K]); MAXTRS=79; TALLY=0; - /* 1200 */ for (I=50; I<=MAXTRS; I++) { + for (I=50; I<=MAXTRS; I++) { if(PTEXT[I] != 0)PROP[I]= -1; -L1200: TALLY=TALLY-PROP[I]; + TALLY=TALLY-PROP[I]; } /* end loop */ /* CLEAR THE HINT STUFF. HINTLC(I) IS HOW LONG HE'S BEEN AT LOC WITH COND BIT * I. HINTED(I) IS TRUE IFF HINT I HAS BEEN USED. */ - /* 1300 */ for (I=1; I<=HNTMAX; I++) { + for (I=1; I<=HNTMAX; I++) { HINTED[I]=false; -L1300: HINTLC[I]=0; + HINTLC[I]=0; } /* end loop */ /* DEFINE SOME HANDY MNEMONICS. THESE CORRESPOND TO OBJECT NUMBERS. */ @@ -524,8 +524,8 @@ L1300: HINTLC[I]=0; CHLOC=114; CHLOC2=140; - /* 1700 */ for (I=1; I<=6; I++) { -L1700: DSEEN[I]=false; + for (I=1; I<=6; I++) { + DSEEN[I]=false; } /* end loop */ DFLAG=0; DLOC[1]=19; @@ -569,8 +569,8 @@ L1700: DSEEN[I]=false; KNFLOC=0; DETAIL=0; ABBNUM=5; - /* 1800 */ for (I=0; I<=4; I++) { -L1800: {long x = 2*I+81; if(RTEXT[x] != 0)MAXDIE=I+1;} + for (I=0; I<=4; I++) { + {long x = 2*I+81; if(RTEXT[x] != 0)MAXDIE=I+1;} } /* end loop */ NUMDIE=0; HOLDNG=0; @@ -596,25 +596,25 @@ L1800: {long x = 2*I+81; if(RTEXT[x] != 0)MAXDIE=I+1;} /* REPORT ON AMOUNT OF ARRAYS ACTUALLY USED, TO PERMIT REDUCTIONS. */ static void report(void) { - /* 1998 */ for (K=1; K<=LOCSIZ; K++) { + for (K=1; K<=LOCSIZ; K++) { KK=LOCSIZ+1-K; if(LTEXT[KK] != 0) goto L1997; -L1998: /*etc*/ ; + /*etc*/ ; } /* end loop */ OBJ=0; -L1997: /* 1996 */ for (K=1; K<=100; K++) { -L1996: if(PTEXT[K] != 0)OBJ=OBJ+1; +L1997: for (K=1; K<=100; K++) { + if(PTEXT[K] != 0)OBJ=OBJ+1; } /* end loop */ - /* 1995 */ for (K=1; K<=TABNDX; K++) { -L1995: if(KTAB[K]/1000 == 2)VERB=KTAB[K]-2000; + for (K=1; K<=TABNDX; K++) { + if(KTAB[K]/1000 == 2)VERB=KTAB[K]-2000; } /* end loop */ - /* 1994 */ for (K=1; K<=RTXSIZ; K++) { + for (K=1; K<=RTXSIZ; K++) { J=RTXSIZ+1-K; if(RTEXT[J] != 0) goto L1993; -L1994: /*etc*/ ; + /*etc*/ ; } /* end loop */ L1993: SETPRM(1,LINUSE,LINSIZ); diff --git a/main.c b/main.c index 9730b7a..2b72630 100644 --- a/main.c +++ b/main.c @@ -146,13 +146,13 @@ L74: LOC=NEWLOC; L6000: if(DFLAG != 1) goto L6010; if(!INDEEP(LOC) || (PCT(95) && (!CNDBIT(LOC,4) || PCT(85)))) goto L2000; DFLAG=2; - /* 6001 */ for (I=1; I<=2; I++) { + for (I=1; I<=2; I++) { J=1+RAN(5); -L6001: if(PCT(50))DLOC[J]=0; + if(PCT(50))DLOC[J]=0; } /* end loop */ - /* 6002 */ for (I=1; I<=5; I++) { + for (I=1; I<=5; I++) { if(DLOC[I] == LOC)DLOC[I]=DALTLC; -L6002: ODLOC[I]=DLOC[I]; + ODLOC[I]=DLOC[I]; } /* end loop */ RSPEAK(3); DROP(AXE,LOC); @@ -347,8 +347,8 @@ L2602: /*etc*/ ; L2603: if(!CLOSED) goto L2605; if(PROP[OYSTER] < 0 && TOTING(OYSTER))PSPEAK(OYSTER,1); - /* 2604 */ for (I=1; I<=100; I++) { -L2604: if(TOTING(I) && PROP[I] < 0)PROP[I]= -1-PROP[I]; + for (I=1; I<=100; I++) { + if(TOTING(I) && PROP[I] < 0)PROP[I]= -1-PROP[I]; } /* end loop */ L2605: WZDARK=DARK(0); if(KNFLOC > 0 && KNFLOC != LOC)KNFLOC=0; @@ -766,9 +766,9 @@ L41000: if(TALLY == 1 && PROP[JADE] < 0) goto L40010; L10000: PROP[GRATE]=0; PROP[FISSUR]=0; - /* 10010 */ for (I=1; I<=6; I++) { + for (I=1; I<=6; I++) { DSEEN[I]=false; -L10010: DLOC[I]=0; + DLOC[I]=0; } /* end loop */ MOVE(TROLL,0); MOVE(TROLL+100,0); @@ -822,8 +822,8 @@ L11000: PROP[BOTTLE]=PUT(BOTTLE,115,1); PROP[MIRROR]=PUT(MIRROR,115,0); FIXED[MIRROR]=116; - /* 11010 */ for (I=1; I<=100; I++) { -L11010: if(TOTING(I))DSTROY(I); + for (I=1; I<=100; I++) { + if(TOTING(I))DSTROY(I); } /* end loop */ RSPEAK(132); diff --git a/misc.c b/misc.c index 15932ec..e92dae5 100644 --- a/misc.c +++ b/misc.c @@ -26,8 +26,8 @@ L10: L=IABS(LINES[K])-1; LNLENG=0; LNPOSN=1; STATE=0; - /* 20 */ for (I=K; I<=L; I++) { -L20: PUTTXT(LINES[I],STATE,2,I); + for (I=K; I<=L; I++) { + PUTTXT(LINES[I],STATE,2,I); } /* end loop */ LNPOSN=0; L30: LNPOSN=LNPOSN+1; @@ -83,9 +83,9 @@ L345: if(PARMS[NPARMS] < 0) goto L395; L360: PRMTYP=PARMS[NPARMS]; SHFTXT(LNPOSN+2,PRMTYP-2); if(PRMTYP == 0) goto L395; - /* 365 */ for (I=1; I<=PRMTYP; I++) { + for (I=1; I<=PRMTYP; I++) { INLINE[LNPOSN]=0; -L365: LNPOSN=LNPOSN+1; + LNPOSN=LNPOSN+1; } /* end loop */ goto L395; @@ -123,10 +123,10 @@ long I, M; M=PTEXT[MSG]; if(SKIP < 0) goto L9; - /* 3 */ for (I=0; I<=SKIP; I++) { + for (I=0; I<=SKIP; I++) { L1: M=IABS(LINES[M]); if(LINES[M] >= 0) goto L1; -L3: /*etc*/ ; + /*etc*/ ; } /* end loop */ L9: SPEAK(M); return; @@ -408,11 +408,11 @@ long I, II, JJ; if(LNLENG < FROM || DELTA == 0) goto L2; - /* 1 */ for (I=FROM; I<=LNLENG; I++) { + for (I=FROM; I<=LNLENG; I++) { II=I; if(DELTA > 0)II=FROM+LNLENG-I; JJ=II+DELTA; -L1: INLINE[JJ]=INLINE[II]; + INLINE[JJ]=INLINE[II]; } /* end loop */ L2: LNLENG=LNLENG+DELTA; return; @@ -468,8 +468,8 @@ long I; /* WRITE OR READ AN ARRAY OF N WORDS. SEE SAVWRD. */ - /* 1 */ for (I=1; I<=N; I++) { -L1: SAVWRD(0,ARR[I]); + for (I=1; I<=N; I++) { + SAVWRD(0,ARR[I]); } /* end loop */ return; } @@ -703,9 +703,9 @@ long ATDWRF, I; ATDWRF=0; if(DFLAG < 2)return(ATDWRF); ATDWRF= -1; - /* 1 */ for (I=1; I<=5; I++) { + for (I=1; I<=5; I++) { if(DLOC[I] == WHERE) goto L2; -L1: if(DLOC[I] != 0)ATDWRF=0; + if(DLOC[I] != 0)ATDWRF=0; } /* end loop */ return(ATDWRF); @@ -731,8 +731,8 @@ long I, SETBIT; SETBIT=1; if(BIT <= 0)return(SETBIT); - /* 1 */ for (I=1; I<=BIT; I++) { -L1: SETBIT=SETBIT+SETBIT; + for (I=1; I<=BIT; I++) { + SETBIT=SETBIT+SETBIT; } /* end loop */ return(SETBIT); } @@ -769,8 +769,8 @@ static long D, R = 0, RAN, T; DATIME(D,T); R=MOD(T+5,1048576L); D=1000+MOD(D,1000); -L1: /* 2 */ for (T=1; T<=D; T++) { -L2: R=MOD(R*1093L+221587L,1048576L); +L1: for (T=1; T<=D; T++) { + R=MOD(R*1093L+221587L,1048576L); } /* end loop */ RAN=(RANGE*R)/1048576; return(RAN); @@ -791,17 +791,17 @@ long DIV, I, J, RNDVOC; RNDVOC=FORCE; if(RNDVOC != 0) goto L3; - /* 1 */ for (I=1; I<=5; I++) { + for (I=1; I<=5; I++) { J=11+RAN(26); if(I == 2)J=CHAR; -L1: RNDVOC=RNDVOC*64+J; + RNDVOC=RNDVOC*64+J; } /* end loop */ L3: J=10000; DIV=64L*64L*64L; - /* 5 */ for (I=1; I<=TABSIZ; I++) { + for (I=1; I<=TABSIZ; I++) { J=J+7; if(MOD((ATAB[I]-J*J)/DIV,64L) == CHAR) goto L8; -L5: /*etc*/ ; + /*etc*/ ; } /* end loop */ BUG(5); @@ -900,10 +900,10 @@ L15: if(!OPENED){ IGNORE(fgets(INLINE+1,100,OPENED)); L20: LNLENG=0; - /* 25 */ for (I=1; I<=100 && INLINE[I]!=0; I++) { + for (I=1; I<=100 && INLINE[I]!=0; I++) { VAL=INLINE[I]+1; INLINE[I]=MAP1[VAL]; -L25: if(INLINE[I] != 0)LNLENG=I; + if(INLINE[I] != 0)LNLENG=I; } /* end loop */ LNPOSN=1; if(FIL && LNLENG == 0) goto L15; @@ -929,9 +929,9 @@ long I, VAL; return; L10: if(MAP2[1] == 0)MPINIT(); - /* 20 */ for (I=1; I<=LNLENG; I++) { + for (I=1; I<=LNLENG; I++) { VAL=INLINE[I]; -L20: {long x = VAL+1; INLINE[I]=MAP2[x];} + {long x = VAL+1; INLINE[I]=MAP2[x];} } /* end loop */ {long x = LNLENG+1; INLINE[x]=0;} printf("%s\n",INLINE+1); @@ -947,11 +947,11 @@ 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}; - /* 10 */ for (I=1; I<=128; I++) { -L10: MAP1[I]= -1; + for (I=1; I<=128; I++) { + MAP1[I]= -1; } /* end loop */ VAL=0; - /* 20 */ for (I=0; I<7; I++) { + for (I=0; I<7; I++) { FIRST=RUNS[I][0]; LAST=RUNS[I][1]; /* 22 */ for (J=FIRST; J<=LAST; J++) { @@ -960,17 +960,17 @@ L10: MAP1[I]= -1; VAL=VAL+1; L22: J--; } /* end loop */ -L20: /*etc*/ ; + /*etc*/ ; } /* end loop */ MAP1[128]=MAP1[10]; /* FOR THIS VERSION, TAB (9) MAPS TO SPACE (32), SO DEL (127) USES TAB'S VALUE */ MAP1[10]=MAP1[33]; MAP1[11]=MAP1[33]; - /* 30 */ for (I=0; I<=126; I++) { + for (I=0; I<=126; I++) { I++; VAL=MAP1[I]+1; I--; MAP2[VAL]=I*('B'-'A'); -L30: if(I >= 64)MAP2[VAL]=(I-64)*('B'-'A')+'@'; + if(I >= 64)MAP2[VAL]=(I-64)*('B'-'A')+'@'; } /* end loop */ return; diff --git a/score.c b/score.c index c8c1b96..6b4b142 100644 --- a/score.c +++ b/score.c @@ -29,7 +29,7 @@ void score(long MODE) { * POINTS CAN ALSO BE DEDUCTED FOR USING HINTS OR TOO MANY TURNS, OR FOR * SAVING INTERMEDIATE POSITIONS. */ -L20000: SCORE=0; + SCORE=0; MXSCOR=0; /* FIRST TALLY UP THE TREASURES. MUST BE IN BUILDING AND NOT BROKEN. @@ -80,8 +80,8 @@ L20020: MXSCOR=MXSCOR+45; /* DEDUCT FOR HINTS/TURNS/SAVES. HINTS < 4 ARE SPECIAL; SEE DATABASE DESC. */ - /* 20030 */ for (I=1; I<=HNTMAX; I++) { -L20030: if(HINTED[I])SCORE=SCORE-HINTS[I][2]; + for (I=1; I<=HNTMAX; I++) { + if(HINTED[I])SCORE=SCORE-HINTS[I][2]; } /* end loop */ if(NOVICE)SCORE=SCORE-5; if(CLSHNT)SCORE=SCORE-10; @@ -98,9 +98,9 @@ L20030: if(HINTED[I])SCORE=SCORE-HINTS[I][2]; SETPRM(1,SCORE,MXSCOR); SETPRM(3,TURNS,TURNS); RSPEAK(262); - /* 20200 */ for (I=1; I<=CLSSES; I++) { + for (I=1; I<=CLSSES; I++) { if(CVAL[I] >= SCORE) goto L20210; -L20200: /*etc*/ ; + /*etc*/ ; } /* end loop */ SPK=265; goto L25000;