archives/open-adventure
2
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Remove disused labels.

Browse source
This commit is contained in:
Jason S. Ninneman 2017-05-22 17:44:33 -07:00
parent 5286f6b3bd
commit 53b607d0c2
6 changed files with 76 additions and 76 deletions
Download patch file Download diff file Expand all files Collapse all files

6
actions1.c
View file

@ -30,7 +30,7 @@ L4000: VERB=K;
/* Analyse an intransitive verb (ie, no object given yet). */ /* 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; 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 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: 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. */ /* Read. Print stuff based on objtxt. Oyster (?) is special case. */
L8270: /* 8275 */ for (I=1; I<=100; I++) { L8270: for (I=1; I<=100; I++) {
L8275: if(HERE(I) && OBJTXT[I] != 0 && PROP[I] >= 0)OBJ=OBJ*100+I; if(HERE(I) && OBJTXT[I] != 0 && PROP[I] >= 0)OBJ=OBJ*100+I;
} /* end loop */ } /* end loop */
if(OBJ > 100 || OBJ == 0 || DARK(0)) return(8000); if(OBJ > 100 || OBJ == 0 || DARK(0)) return(8000);

4
actions2.c
View file

@ -187,9 +187,9 @@ L9126: if(OBJ == 0)SPK=44;
MOVE(DRAGON,K); MOVE(DRAGON,K);
MOVE(RUG,K); MOVE(RUG,K);
DROP(BLOOD,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); if(PLACE[OBJ] == PLAC[DRAGON] || PLACE[OBJ] == FIXD[DRAGON])MOVE(OBJ,K);
L9127: /*etc*/ ; /*etc*/ ;
} /* end loop */ } /* end loop */
LOC=K; LOC=K;
K=NUL; K=NUL;

50
init.c
View file

@ -299,11 +299,11 @@ L1039: TRVS--; TRAVEL[TRVS]= -TRAVEL[TRVS]; TRVS++;
* would make it harder to detect particular input words.) */ * would make it harder to detect particular input words.) */
L1040: J=10000; L1040: J=10000;
/* 1042 */ for (TABNDX=1; TABNDX<=TABSIZ; TABNDX++) { for (TABNDX=1; TABNDX<=TABSIZ; TABNDX++) {
L1043: KTAB[TABNDX]=GETNUM(1); KTAB[TABNDX]=GETNUM(1);
if(KTAB[TABNDX] == -1) goto L1002; if(KTAB[TABNDX] == -1) goto L1002;
J=J+7; J=J+7;
L1042: ATAB[TABNDX]=GETTXT(true,true,true,0)+J*J; ATAB[TABNDX]=GETTXT(true,true,true,0)+J*J;
} /* end loop */ } /* end loop */
BUG(4); BUG(4);
@ -340,8 +340,8 @@ L1080: HNTMAX=0;
L1081: K=GETNUM(1); L1081: K=GETNUM(1);
if(K == -1) goto L1002; if(K == -1) goto L1002;
if(K <= 0 || K > HNTSIZ)BUG(7); if(K <= 0 || K > HNTSIZ)BUG(7);
/* 1083 */ for (I=1; I<=4; I++) { for (I=1; I<=4; I++) {
L1083: HINTS[K][I] =GETNUM(0); HINTS[K][I] =GETNUM(0);
} /* end loop */ } /* end loop */
HNTMAX=(HNTMAX>K ? HNTMAX : K); HNTMAX=(HNTMAX>K ? HNTMAX : K);
goto L1081; goto L1081;
@ -372,11 +372,11 @@ L1092: LOCSND[K]=KK;
* description is printed. Counts modulo 5 unless "LOOK" is used. */ * description is printed. Counts modulo 5 unless "LOOK" is used. */
static int finish_init(void) { static int finish_init(void) {
/* 1101 */ for (I=1; I<=100; I++) { for (I=1; I<=100; I++) {
PLACE[I]=0; PLACE[I]=0;
PROP[I]=0; PROP[I]=0;
LINK[I]=0; LINK[I]=0;
L1101: {long x = I+100; LINK[x]=0;} {long x = I+100; LINK[x]=0;}
} /* end loop */ } /* end loop */
/* 1102 */ for (I=1; I<=LOCSIZ; I++) { /* 1102 */ for (I=1; I<=LOCSIZ; I++) {
@ -402,10 +402,10 @@ L1102: ATLOC[I]=0;
L1106: /*etc*/ ; L1106: /*etc*/ ;
} /* end loop */ } /* end loop */
/* 1107 */ for (I=1; I<=100; I++) { for (I=1; I<=100; I++) {
K=101-I; K=101-I;
FIXED[K]=FIXD[K]; 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 */ } /* end loop */
/* Treasures, as noted earlier, are objects 50 through MAXTRS (CURRENTLY 79). /* 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; MAXTRS=79;
TALLY=0; TALLY=0;
/* 1200 */ for (I=50; I<=MAXTRS; I++) { for (I=50; I<=MAXTRS; I++) {
if(PTEXT[I] != 0)PROP[I]= -1; if(PTEXT[I] != 0)PROP[I]= -1;
L1200: TALLY=TALLY-PROP[I]; TALLY=TALLY-PROP[I];
} /* end loop */ } /* end loop */
/* Clear the hint stuff. HINTLC(I) is how long he's been at LOC with cond bit /* 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. */ * 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; HINTED[I]=false;
L1300: HINTLC[I]=0; HINTLC[I]=0;
} /* end loop */ } /* end loop */
/* Define some handy mnemonics. these correspond to object numbers. */ /* Define some handy mnemonics. these correspond to object numbers. */
@ -524,8 +524,8 @@ L1300: HINTLC[I]=0;
CHLOC=114; CHLOC=114;
CHLOC2=140; CHLOC2=140;
/* 1700 */ for (I=1; I<=6; I++) { for (I=1; I<=6; I++) {
L1700: DSEEN[I]=false; DSEEN[I]=false;
} /* end loop */ } /* end loop */
DFLAG=0; DFLAG=0;
DLOC[1]=19; DLOC[1]=19;
@ -569,8 +569,8 @@ L1700: DSEEN[I]=false;
KNFLOC=0; KNFLOC=0;
DETAIL=0; DETAIL=0;
ABBNUM=5; ABBNUM=5;
/* 1800 */ for (I=0; I<=4; I++) { for (I=0; I<=4; I++) {
L1800: {long x = 2*I+81; if(RTEXT[x] != 0)MAXDIE=I+1;} {long x = 2*I+81; if(RTEXT[x] != 0)MAXDIE=I+1;}
} /* end loop */ } /* end loop */
NUMDIE=0; NUMDIE=0;
HOLDNG=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. */ /* Report on amount of arrays actually used, to permit reductions. */
static void report(void) { static void report(void) {
/* 1998 */ for (K=1; K<=LOCSIZ; K++) { for (K=1; K<=LOCSIZ; K++) {
KK=LOCSIZ+1-K; KK=LOCSIZ+1-K;
if(LTEXT[KK] != 0) goto L1997; if(LTEXT[KK] != 0) goto L1997;
L1998: /*etc*/ ; /*etc*/ ;
} /* end loop */ } /* end loop */
OBJ=0; OBJ=0;
L1997: /* 1996 */ for (K=1; K<=100; K++) { L1997: for (K=1; K<=100; K++) {
L1996: if(PTEXT[K] != 0)OBJ=OBJ+1; if(PTEXT[K] != 0)OBJ=OBJ+1;
} /* end loop */ } /* end loop */
/* 1995 */ for (K=1; K<=TABNDX; K++) { for (K=1; K<=TABNDX; K++) {
L1995: if(KTAB[K]/1000 == 2)VERB=KTAB[K]-2000; if(KTAB[K]/1000 == 2)VERB=KTAB[K]-2000;
} /* end loop */ } /* end loop */
/* 1994 */ for (K=1; K<=RTXSIZ; K++) { for (K=1; K<=RTXSIZ; K++) {
J=RTXSIZ+1-K; J=RTXSIZ+1-K;
if(RTEXT[J] != 0) goto L1993; if(RTEXT[J] != 0) goto L1993;
L1994: /*etc*/ ; /*etc*/ ;
} /* end loop */ } /* end loop */
L1993: SETPRM(1,LINUSE,LINSIZ); L1993: SETPRM(1,LINUSE,LINSIZ);

20
main.c
View file

@ -146,13 +146,13 @@ L74: LOC=NEWLOC;
L6000: if(DFLAG != 1) goto L6010; L6000: if(DFLAG != 1) goto L6010;
if(!INDEEP(LOC) || (PCT(95) && (!CNDBIT(LOC,4) || PCT(85)))) goto L2000; if(!INDEEP(LOC) || (PCT(95) && (!CNDBIT(LOC,4) || PCT(85)))) goto L2000;
DFLAG=2; DFLAG=2;
/* 6001 */ for (I=1; I<=2; I++) { for (I=1; I<=2; I++) {
J=1+RAN(5); J=1+RAN(5);
L6001: if(PCT(50))DLOC[J]=0; if(PCT(50))DLOC[J]=0;
} /* end loop */ } /* end loop */
/* 6002 */ for (I=1; I<=5; I++) { for (I=1; I<=5; I++) {
if(DLOC[I] == LOC)DLOC[I]=DALTLC; if(DLOC[I] == LOC)DLOC[I]=DALTLC;
L6002: ODLOC[I]=DLOC[I]; ODLOC[I]=DLOC[I];
} /* end loop */ } /* end loop */
RSPEAK(3); RSPEAK(3);
DROP(AXE,LOC); DROP(AXE,LOC);
@ -347,8 +347,8 @@ L2602: /*etc*/ ;
L2603: if(!CLOSED) goto L2605; L2603: if(!CLOSED) goto L2605;
if(PROP[OYSTER] < 0 && TOTING(OYSTER))PSPEAK(OYSTER,1); if(PROP[OYSTER] < 0 && TOTING(OYSTER))PSPEAK(OYSTER,1);
/* 2604 */ for (I=1; I<=100; I++) { for (I=1; I<=100; I++) {
L2604: if(TOTING(I) && PROP[I] < 0)PROP[I]= -1-PROP[I]; if(TOTING(I) && PROP[I] < 0)PROP[I]= -1-PROP[I];
} /* end loop */ } /* end loop */
L2605: WZDARK=DARK(0); L2605: WZDARK=DARK(0);
if(KNFLOC > 0 && KNFLOC != LOC)KNFLOC=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; L10000: PROP[GRATE]=0;
PROP[FISSUR]=0; PROP[FISSUR]=0;
/* 10010 */ for (I=1; I<=6; I++) { for (I=1; I<=6; I++) {
DSEEN[I]=false; DSEEN[I]=false;
L10010: DLOC[I]=0; DLOC[I]=0;
} /* end loop */ } /* end loop */
MOVE(TROLL,0); MOVE(TROLL,0);
MOVE(TROLL+100,0); MOVE(TROLL+100,0);
@ -822,8 +822,8 @@ L11000: PROP[BOTTLE]=PUT(BOTTLE,115,1);
PROP[MIRROR]=PUT(MIRROR,115,0); PROP[MIRROR]=PUT(MIRROR,115,0);
FIXED[MIRROR]=116; FIXED[MIRROR]=116;
/* 11010 */ for (I=1; I<=100; I++) { for (I=1; I<=100; I++) {
L11010: if(TOTING(I))DSTROY(I); if(TOTING(I))DSTROY(I);
} /* end loop */ } /* end loop */
RSPEAK(132); RSPEAK(132);

60
misc.c
View file

@ -26,8 +26,8 @@ L10: L=IABS(LINES[K])-1;
LNLENG=0; LNLENG=0;
LNPOSN=1; LNPOSN=1;
STATE=0; STATE=0;
/* 20 */ for (I=K; I<=L; I++) { for (I=K; I<=L; I++) {
L20: PUTTXT(LINES[I],STATE,2,I); PUTTXT(LINES[I],STATE,2,I);
} /* end loop */ } /* end loop */
LNPOSN=0; LNPOSN=0;
L30: LNPOSN=LNPOSN+1; L30: LNPOSN=LNPOSN+1;
@ -83,9 +83,9 @@ L345: if(PARMS[NPARMS] < 0) goto L395;
L360: PRMTYP=PARMS[NPARMS]; L360: PRMTYP=PARMS[NPARMS];
SHFTXT(LNPOSN+2,PRMTYP-2); SHFTXT(LNPOSN+2,PRMTYP-2);
if(PRMTYP == 0) goto L395; if(PRMTYP == 0) goto L395;
/* 365 */ for (I=1; I<=PRMTYP; I++) { for (I=1; I<=PRMTYP; I++) {
INLINE[LNPOSN]=0; INLINE[LNPOSN]=0;
L365: LNPOSN=LNPOSN+1; LNPOSN=LNPOSN+1;
} /* end loop */ } /* end loop */
goto L395; goto L395;
@ -123,10 +123,10 @@ long I, M;
M=PTEXT[MSG]; M=PTEXT[MSG];
if(SKIP < 0) goto L9; if(SKIP < 0) goto L9;
/* 3 */ for (I=0; I<=SKIP; I++) { for (I=0; I<=SKIP; I++) {
L1: M=IABS(LINES[M]); L1: M=IABS(LINES[M]);
if(LINES[M] >= 0) goto L1; if(LINES[M] >= 0) goto L1;
L3: /*etc*/ ; /*etc*/ ;
} /* end loop */ } /* end loop */
L9: SPEAK(M); L9: SPEAK(M);
return; return;
@ -408,11 +408,11 @@ long I, II, JJ;
if(LNLENG < FROM || DELTA == 0) goto L2; if(LNLENG < FROM || DELTA == 0) goto L2;
/* 1 */ for (I=FROM; I<=LNLENG; I++) { for (I=FROM; I<=LNLENG; I++) {
II=I; II=I;
if(DELTA > 0)II=FROM+LNLENG-I; if(DELTA > 0)II=FROM+LNLENG-I;
JJ=II+DELTA; JJ=II+DELTA;
L1: INLINE[JJ]=INLINE[II]; INLINE[JJ]=INLINE[II];
} /* end loop */ } /* end loop */
L2: LNLENG=LNLENG+DELTA; L2: LNLENG=LNLENG+DELTA;
return; return;
@ -468,8 +468,8 @@ long I;
/* Write or read an array of N words. See SAVWRD. */ /* Write or read an array of N words. See SAVWRD. */
/* 1 */ for (I=1; I<=N; I++) { for (I=1; I<=N; I++) {
L1: SAVWRD(0,ARR[I]); SAVWRD(0,ARR[I]);
} /* end loop */ } /* end loop */
return; return;
} }
@ -703,9 +703,9 @@ long ATDWRF, I;
ATDWRF=0; ATDWRF=0;
if(DFLAG < 2)return(ATDWRF); if(DFLAG < 2)return(ATDWRF);
ATDWRF= -1; ATDWRF= -1;
/* 1 */ for (I=1; I<=5; I++) { for (I=1; I<=5; I++) {
if(DLOC[I] == WHERE) goto L2; if(DLOC[I] == WHERE) goto L2;
L1: if(DLOC[I] != 0)ATDWRF=0; if(DLOC[I] != 0)ATDWRF=0;
} /* end loop */ } /* end loop */
return(ATDWRF); return(ATDWRF);
@ -731,8 +731,8 @@ long I, SETBIT;
SETBIT=1; SETBIT=1;
if(BIT <= 0)return(SETBIT); if(BIT <= 0)return(SETBIT);
/* 1 */ for (I=1; I<=BIT; I++) { for (I=1; I<=BIT; I++) {
L1: SETBIT=SETBIT+SETBIT; SETBIT=SETBIT+SETBIT;
} /* end loop */ } /* end loop */
return(SETBIT); return(SETBIT);
} }
@ -769,8 +769,8 @@ static long D, R = 0, RAN, T;
DATIME(D,T); DATIME(D,T);
R=MOD(T+5,1048576L); R=MOD(T+5,1048576L);
D=1000+MOD(D,1000); D=1000+MOD(D,1000);
L1: /* 2 */ for (T=1; T<=D; T++) { L1: for (T=1; T<=D; T++) {
L2: R=MOD(R*1093L+221587L,1048576L); R=MOD(R*1093L+221587L,1048576L);
} /* end loop */ } /* end loop */
RAN=(RANGE*R)/1048576; RAN=(RANGE*R)/1048576;
return(RAN); return(RAN);
@ -791,17 +791,17 @@ long DIV, I, J, RNDVOC;
RNDVOC=FORCE; RNDVOC=FORCE;
if(RNDVOC != 0) goto L3; if(RNDVOC != 0) goto L3;
/* 1 */ for (I=1; I<=5; I++) { for (I=1; I<=5; I++) {
J=11+RAN(26); J=11+RAN(26);
if(I == 2)J=CHAR; if(I == 2)J=CHAR;
L1: RNDVOC=RNDVOC*64+J; RNDVOC=RNDVOC*64+J;
} /* end loop */ } /* end loop */
L3: J=10000; L3: J=10000;
DIV=64L*64L*64L; DIV=64L*64L*64L;
/* 5 */ for (I=1; I<=TABSIZ; I++) { for (I=1; I<=TABSIZ; I++) {
J=J+7; J=J+7;
if(MOD((ATAB[I]-J*J)/DIV,64L) == CHAR) goto L8; if(MOD((ATAB[I]-J*J)/DIV,64L) == CHAR) goto L8;
L5: /*etc*/ ; /*etc*/ ;
} /* end loop */ } /* end loop */
BUG(5); BUG(5);
@ -900,10 +900,10 @@ L15: if(!OPENED){
IGNORE(fgets(INLINE+1,100,OPENED)); IGNORE(fgets(INLINE+1,100,OPENED));
L20: LNLENG=0; 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; VAL=INLINE[I]+1;
INLINE[I]=MAP1[VAL]; INLINE[I]=MAP1[VAL];
L25: if(INLINE[I] != 0)LNLENG=I; if(INLINE[I] != 0)LNLENG=I;
} /* end loop */ } /* end loop */
LNPOSN=1; LNPOSN=1;
if(FIL && LNLENG == 0) goto L15; if(FIL && LNLENG == 0) goto L15;
@ -929,9 +929,9 @@ long I, VAL;
return; return;
L10: if(MAP2[1] == 0)MPINIT(); L10: if(MAP2[1] == 0)MPINIT();
/* 20 */ for (I=1; I<=LNLENG; I++) { for (I=1; I<=LNLENG; I++) {
VAL=INLINE[I]; VAL=INLINE[I];
L20: {long x = VAL+1; INLINE[I]=MAP2[x];} {long x = VAL+1; INLINE[I]=MAP2[x];}
} /* end loop */ } /* end loop */
{long x = LNLENG+1; INLINE[x]=0;} {long x = LNLENG+1; INLINE[x]=0;}
printf("%s\n",INLINE+1); 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}; 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++) { for (I=1; I<=128; I++) {
L10: MAP1[I]= -1; MAP1[I]= -1;
} /* end loop */ } /* end loop */
VAL=0; VAL=0;
/* 20 */ for (I=0; I<7; I++) { for (I=0; I<7; I++) {
FIRST=RUNS[I][0]; FIRST=RUNS[I][0];
LAST=RUNS[I][1]; LAST=RUNS[I][1];
/* 22 */ for (J=FIRST; J<=LAST; J++) { /* 22 */ for (J=FIRST; J<=LAST; J++) {
@ -960,17 +960,17 @@ L10: MAP1[I]= -1;
VAL=VAL+1; VAL=VAL+1;
L22: J--; L22: J--;
} /* end loop */ } /* end loop */
L20: /*etc*/ ; /*etc*/ ;
} /* end loop */ } /* end loop */
MAP1[128]=MAP1[10]; MAP1[128]=MAP1[10];
/* For this version, tab (9) maps to space (32), so del (127) uses tab's value */ /* For this version, tab (9) maps to space (32), so del (127) uses tab's value */
MAP1[10]=MAP1[33]; MAP1[10]=MAP1[33];
MAP1[11]=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--; I++; VAL=MAP1[I]+1; I--;
MAP2[VAL]=I*('B'-'A'); 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 */ } /* end loop */
return; return;

10
score.c
View file

@ -29,7 +29,7 @@ void score(long MODE) {
* Points can also be deducted for using hints or too many turns, or for * Points can also be deducted for using hints or too many turns, or for
* saving intermediate positions. */ * saving intermediate positions. */
L20000: SCORE=0; SCORE=0;
MXSCOR=0; MXSCOR=0;
/* First tally up the treasures. must be in building and not broken. /* 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. */ /* Deduct for hints/turns/saves. Hints < 4 are special; see database desc. */
/* 20030 */ for (I=1; I<=HNTMAX; I++) { for (I=1; I<=HNTMAX; I++) {
L20030: if(HINTED[I])SCORE=SCORE-HINTS[I][2]; if(HINTED[I])SCORE=SCORE-HINTS[I][2];
} /* end loop */ } /* end loop */
if(NOVICE)SCORE=SCORE-5; if(NOVICE)SCORE=SCORE-5;
if(CLSHNT)SCORE=SCORE-10; if(CLSHNT)SCORE=SCORE-10;
@ -98,9 +98,9 @@ L20030: if(HINTED[I])SCORE=SCORE-HINTS[I][2];
SETPRM(1,SCORE,MXSCOR); SETPRM(1,SCORE,MXSCOR);
SETPRM(3,TURNS,TURNS); SETPRM(3,TURNS,TURNS);
RSPEAK(262); RSPEAK(262);
/* 20200 */ for (I=1; I<=CLSSES; I++) { for (I=1; I<=CLSSES; I++) {
if(CVAL[I] >= SCORE) goto L20210; if(CVAL[I] >= SCORE) goto L20210;
L20200: /*etc*/ ; /*etc*/ ;
} /* end loop */ } /* end loop */
SPK=265; SPK=265;
goto L25000; goto L25000;