X-Git-Url: https://jxself.org/git/?a=blobdiff_plain;f=init.c;h=c5486cfcfa92b28bd2be7f5a96b7cbb04b1de12a;hb=6f17b31b850729a62046a8046f3647c7758ad594;hp=1e4ec5e837a39dbf3ae174465084bcca7e0c0cd8;hpb=5286f6b3bd5213d0da417580a892aafb0e0e2fcb;p=open-adventure.git diff --git a/init.c b/init.c index 1e4ec5e..c5486cf 100644 --- a/init.c +++ b/init.c @@ -1,10 +1,12 @@ -#include "misc.h" -#include "main.h" -#include "share.h" -#include "funcs.h" +#include +#include #include #include +#include "advent.h" +#include "funcs.h" +#include "database.h" + /* * Initialisation */ @@ -32,7 +34,7 @@ /* Description of the database format * * - * The data file contains several sections. each begins with a line containing + * The data file contains several sections. Each begins with a line containing * a number identifying the section, and ends with a line containing "-1". * * Section 1: Long form descriptions. Each line contains a location number, @@ -147,7 +149,7 @@ /* The various messages (sections 1, 2, 5, 6, etc.) may include certain * special character sequences to denote that the program must provide - * parameters to insert into a message when the message is printed. these + * parameters to insert into a message when the message is printed. These * sequences are: * %S = The letter 'S' or nothing (if a given value is exactly 1) * %W = A word (up to 10 characters) @@ -162,221 +164,20 @@ * %B = Variable number of blanks * %! = The entire message should be suppressed */ -static bool quick_init(void); -static int raw_init(void); -static void report(void); -static void quick_save(void); static int finish_init(void); -static void quick_io(void); void initialise(void) { - printf("Initialising...\n"); - if(!quick_init()){raw_init(); report(); quick_save();} + if (oldstyle) + printf("Initialising...\n"); finish_init(); } -static int raw_init(void) { - printf("Couldn't find adventure.data, using adventure.text...\n"); - -/* Clear out the various text-pointer arrays. All text is stored in array - * lines; each line is preceded by a word pointing to the next pointer (i.e. - * the word following the end of the line). The pointer is negative if this is - * first line of a message. The text-pointer arrays contain indices of - * pointer-words in lines. STEXT(N) is short description of location N. - * LTEXT(N) is long description. PTEXT(N) points to message for PROP(N)=0. - * Successive prop messages are found by chasing pointers. RTEXT contains - * section 6's stuff. CTEXT(N) points to a player-class message. TTEXT is for - * section 14. We also clear COND (see description of section 9 for details). */ - - /* 1001 */ for (I=1; I<=300; I++) { - if(I <= 100)PTEXT[I]=0; - if(I <= RTXSIZ)RTEXT[I]=0; - if(I <= CLSMAX)CTEXT[I]=0; - if(I <= 100)OBJSND[I]=0; - if(I <= 100)OBJTXT[I]=0; - if(I > LOCSIZ) goto L1001; - STEXT[I]=0; - LTEXT[I]=0; - COND[I]=0; - KEY[I]=0; - LOCSND[I]=0; -L1001: /*etc*/ ; - } /* end loop */ - - LINUSE=1; - TRVS=1; - CLSSES=0; - TRNVLS=0; - -/* Start new data section. sect is the section number. */ - -L1002: SECT=GETNUM(1); - OLDLOC= -1; - switch (SECT) { case 0: return(0); case 1: goto L1004; case 2: goto - L1004; case 3: goto L1030; case 4: goto L1040; case 5: goto L1004; - case 6: goto L1004; case 7: goto L1050; case 8: goto L1060; case - 9: goto L1070; case 10: goto L1004; case 11: goto L1080; case 12: - break; case 13: goto L1090; case 14: goto L1004; } -/* (0) (1) (2) (3) (4) (5) (6) (7) (8) (9) - * (10) (11) (12) (13) (14) */ - BUG(9); - -/* Sections 1, 2, 5, 6, 10, 14. Read messages and set up pointers. */ - -L1004: KK=LINUSE; -L1005: LINUSE=KK; - LOC=GETNUM(1); - if(LNLENG >= LNPOSN+70)BUG(0); - if(LOC == -1) goto L1002; - if(LNLENG < LNPOSN)BUG(1); -L1006: KK=KK+1; - if(KK >= LINSIZ)BUG(2); - LINES[KK]=GETTXT(false,false,false,KK); - if(LINES[KK] != -1) goto L1006; - LINES[LINUSE]=KK; - if(LOC == OLDLOC) goto L1005; - OLDLOC=LOC; - LINES[LINUSE]= -KK; - if(SECT == 14) goto L1014; - if(SECT == 10) goto L1012; - if(SECT == 6) goto L1011; - if(SECT == 5) goto L1010; - if(LOC > LOCSIZ)BUG(10); - if(SECT == 1) goto L1008; - - STEXT[LOC]=LINUSE; - goto L1005; - -L1008: LTEXT[LOC]=LINUSE; - goto L1005; - -L1010: if(LOC > 0 && LOC <= 100)PTEXT[LOC]=LINUSE; - goto L1005; - -L1011: if(LOC > RTXSIZ)BUG(6); - RTEXT[LOC]=LINUSE; - goto L1005; - -L1012: CLSSES=CLSSES+1; - if(CLSSES > CLSMAX)BUG(11); - CTEXT[CLSSES]=LINUSE; - CVAL[CLSSES]=LOC; - goto L1005; - -L1014: TRNVLS=TRNVLS+1; - if(TRNVLS > TRNSIZ)BUG(11); - TTEXT[TRNVLS]=LINUSE; - TRNVAL[TRNVLS]=LOC; - goto L1005; - -/* The stuff for section 3 is encoded here. Each "from-location" gets a - * contiguous section of the "TRAVEL" array. each entry in travel is - * NEWLOC*1000 + KEYWORD (from section 4, motion verbs), and is negated if - * this is the last entry for this location. KEY(N) is the index in travel - * of the first option at location N. */ - -L1030: LOC=GETNUM(1); - if(LOC == -1) goto L1002; - NEWLOC=GETNUM(0); - if(KEY[LOC] != 0) goto L1033; - KEY[LOC]=TRVS; - goto L1035; -L1033: TRVS--; TRAVEL[TRVS]= -TRAVEL[TRVS]; TRVS++; -L1035: L=GETNUM(0); - if(L == 0) goto L1039; - TRAVEL[TRVS]=NEWLOC*1000+L; - TRVS=TRVS+1; - if(TRVS == TRVSIZ)BUG(3); - goto L1035; -L1039: TRVS--; TRAVEL[TRVS]= -TRAVEL[TRVS]; TRVS++; - goto L1030; - -/* Here we read in the vocabulary. KTAB(N) is the word number, ATAB(N) is - * the corresponding word. The -1 at the end of section 4 is left in KTAB - * as an end-marker. The words are given a minimal hash to make deciphering - * the core-image harder. (We don't use gettxt's hash since that would force - * us to hash each input line to make comparisons work, and that in turn - * would make it harder to detect particular input words.) */ - -L1040: J=10000; - /* 1042 */ for (TABNDX=1; TABNDX<=TABSIZ; TABNDX++) { -L1043: KTAB[TABNDX]=GETNUM(1); - if(KTAB[TABNDX] == -1) goto L1002; - J=J+7; -L1042: ATAB[TABNDX]=GETTXT(true,true,true,0)+J*J; - } /* end loop */ - BUG(4); - -/* Read in the initial locations for each object. Also the immovability info. - * plac contains initial locations of objects. FIXD is -1 for immovable - * objects (including the snake), or = second loc for two-placed objects. */ - -L1050: OBJ=GETNUM(1); - if(OBJ == -1) goto L1002; - PLAC[OBJ]=GETNUM(0); - FIXD[OBJ]=GETNUM(0); - goto L1050; - -/* Read default message numbers for action verbs, store in ACTSPK. */ - -L1060: VERB=GETNUM(1); - if(VERB == -1) goto L1002; - ACTSPK[VERB]=GETNUM(0); - goto L1060; - -/* Read info about available liquids and other conditions, store in COND. */ - -L1070: K=GETNUM(1); - if(K == -1) goto L1002; -L1071: LOC=GETNUM(0); - if(LOC == 0) goto L1070; - if(CNDBIT(LOC,K)) BUG(8); - COND[LOC]=COND[LOC]+SETBIT(K); - goto L1071; - -/* Read data for hints. */ - -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); - } /* end loop */ - HNTMAX=(HNTMAX>K ? HNTMAX : K); - goto L1081; - -/* Read the sound/text info, store in OBJSND, OBJTXT, LOCSND. */ - -L1090: K=GETNUM(1); - if(K == -1) goto L1002; - KK=GETNUM(0); - I=GETNUM(0); - if(I == 0) goto L1092; - OBJSND[K]=(KK>0 ? KK : 0); - OBJTXT[K]=(I>0 ? I : 0); - goto L1090; - -L1092: LOCSND[K]=KK; - goto L1090; -} - -/* Finish constructing internal data format */ - -/* Having read in the database, certain things are now constructed. PROPS are - * set to zero. We finish setting up COND by checking for forced-motion travel - * entries. The PLAC and FIXD arrays are used to set up ATLOC(N) as the first - * object at location N, and LINK(OBJ) as the next object at the same location - * as OBJ. (OBJ>100 indicates that FIXED(OBJ-100)=LOC; LINK(OBJ) is still the - * correct link to use.) ABB is zeroed; it controls whether the abbreviated - * 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 +203,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,20 +216,20 @@ 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. */ +/* Define some handy mnemonics. These correspond to object numbers. */ AXE=VOCWRD(12405,1); BATTER=VOCWRD(201202005,1); @@ -524,8 +325,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 +370,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; @@ -592,116 +393,3 @@ L1800: {long x = 2*I+81; if(RTEXT[x] != 0)MAXDIE=I+1;} return(0); /* then we won't actually return from initialisation */ } - -/* Report on amount of arrays actually used, to permit reductions. */ - -static void report(void) { - /* 1998 */ for (K=1; K<=LOCSIZ; K++) { - KK=LOCSIZ+1-K; - if(LTEXT[KK] != 0) goto L1997; -L1998: /*etc*/ ; - } /* end loop */ - - OBJ=0; -L1997: /* 1996 */ for (K=1; K<=100; K++) { -L1996: 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; - } /* end loop */ - - /* 1994 */ for (K=1; K<=RTXSIZ; K++) { - J=RTXSIZ+1-K; - if(RTEXT[J] != 0) goto L1993; -L1994: /*etc*/ ; - } /* end loop */ - -L1993: SETPRM(1,LINUSE,LINSIZ); - SETPRM(3,TRVS,TRVSIZ); - SETPRM(5,TABNDX,TABSIZ); - SETPRM(7,KK,LOCSIZ); - SETPRM(9,OBJ,100); - SETPRM(11,VERB,VRBSIZ); - SETPRM(13,J,RTXSIZ); - SETPRM(15,CLSSES,CLSMAX); - SETPRM(17,HNTMAX,HNTSIZ); - SETPRM(19,TRNVLS,TRNSIZ); - RSPEAK(267); - TYPE0(); -} - -static long init_reading, init_cksum; -static FILE *f; - -static void quick_item(long*); -static void quick_array(long*, long); - -static bool quick_init(void) { - extern char *getenv(); - char *adv = getenv("ADVENTURE"); - f = NULL; - if(adv)f = fopen(adv,READ_MODE); - if(f == NULL)f = fopen("adventure.data",READ_MODE); - if(f == NULL)return(false); - init_reading = true; - init_cksum = 1; - quick_io(); - if(fread(&K,sizeof(long),1,f) == 1) init_cksum -= K; else init_cksum = 1; - fclose(f); - if(init_cksum != 0)printf("Checksum error!\n"); - return(init_cksum == 0); -} - -static void quick_save(void) { - printf("Writing adventure.data...\n"); - f = fopen("adventure.data",WRITE_MODE); - if(f == NULL){printf("Can't open file!\n"); return;} - init_reading = false; - init_cksum = 1; - quick_io(); - fwrite(&init_cksum,sizeof(long),1,f); - fclose(f); -} - -static void quick_io(void) { - quick_item(&LINUSE); - quick_item(&TRVS); - quick_item(&CLSSES); - quick_item(&TRNVLS); - quick_item(&TABNDX); - quick_item(&HNTMAX); - quick_array(PTEXT,100); - quick_array(RTEXT,RTXSIZ); - quick_array(CTEXT,CLSMAX); - quick_array(OBJSND,100); - quick_array(OBJTXT,100); - quick_array(STEXT,LOCSIZ); - quick_array(LTEXT,LOCSIZ); - quick_array(COND,LOCSIZ); - quick_array(KEY,LOCSIZ); - quick_array(LOCSND,LOCSIZ); - quick_array(LINES,LINSIZ); - quick_array(CVAL,CLSMAX); - quick_array(TTEXT,TRNSIZ); - quick_array(TRNVAL,TRNSIZ); - quick_array(TRAVEL,TRVSIZ); - quick_array(KTAB,TABSIZ); - quick_array(ATAB,TABSIZ); - quick_array(PLAC,100); - quick_array(FIXD,100); - quick_array(ACTSPK,VRBSIZ); - quick_array((long *)HINTS,(HNTMAX+1)*5-1); -} - -static void quick_item(W)long *W; { - 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); -} - -static void quick_array(A,N)long *A, N; { long I; - if(init_reading && fread(A,sizeof(long),N+1,f) != N+1)printf("Read error!\n"); - for(I=1;I<=N;I++)init_cksum = MOD(init_cksum*13+A[I],60000000); - if(!init_reading && fwrite(A,sizeof(long),N+1,f)!=N+1)printf("Write error!\n"); -}