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

52
init.c
View file

@ -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 modulo 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);
@ -695,7 +695,7 @@ static void quick_io(void) {
}
static void quick_item(W)long *W; {
if(init_reading && fread(W,sizeof(long),1,f) != 1)return;
if(init_reading && fread(W,sizeof(long),1,f) != 1)return;
init_cksum = MOD(init_cksum*13+(*W),60000000);
if(!init_reading)fwrite(W,sizeof(long),1,f);
}