1*aed906e4Smestre /* $OpenBSD: hack.lev.c,v 1.10 2016/01/09 18:33:15 mestre Exp $ */
2d0b779f3Sniklas
3df930be7Sderaadt /*
4d25013f2Scamield * Copyright (c) 1985, Stichting Centrum voor Wiskunde en Informatica,
5d25013f2Scamield * Amsterdam
6d25013f2Scamield * All rights reserved.
7d25013f2Scamield *
8d25013f2Scamield * Redistribution and use in source and binary forms, with or without
9d25013f2Scamield * modification, are permitted provided that the following conditions are
10d25013f2Scamield * met:
11d25013f2Scamield *
12d25013f2Scamield * - Redistributions of source code must retain the above copyright notice,
13d25013f2Scamield * this list of conditions and the following disclaimer.
14d25013f2Scamield *
15d25013f2Scamield * - Redistributions in binary form must reproduce the above copyright
16d25013f2Scamield * notice, this list of conditions and the following disclaimer in the
17d25013f2Scamield * documentation and/or other materials provided with the distribution.
18d25013f2Scamield *
19d25013f2Scamield * - Neither the name of the Stichting Centrum voor Wiskunde en
20d25013f2Scamield * Informatica, nor the names of its contributors may be used to endorse or
21d25013f2Scamield * promote products derived from this software without specific prior
22d25013f2Scamield * written permission.
23d25013f2Scamield *
24d25013f2Scamield * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
25d25013f2Scamield * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
26d25013f2Scamield * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
27d25013f2Scamield * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
28d25013f2Scamield * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
29d25013f2Scamield * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
30d25013f2Scamield * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
31d25013f2Scamield * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
32d25013f2Scamield * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
33d25013f2Scamield * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
34d25013f2Scamield * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
35d25013f2Scamield */
36d25013f2Scamield
37d25013f2Scamield /*
38d25013f2Scamield * Copyright (c) 1982 Jay Fenlason <hack@gnu.org>
39d25013f2Scamield * All rights reserved.
40d25013f2Scamield *
41d25013f2Scamield * Redistribution and use in source and binary forms, with or without
42d25013f2Scamield * modification, are permitted provided that the following conditions
43d25013f2Scamield * are met:
44d25013f2Scamield * 1. Redistributions of source code must retain the above copyright
45d25013f2Scamield * notice, this list of conditions and the following disclaimer.
46d25013f2Scamield * 2. Redistributions in binary form must reproduce the above copyright
47d25013f2Scamield * notice, this list of conditions and the following disclaimer in the
48d25013f2Scamield * documentation and/or other materials provided with the distribution.
49d25013f2Scamield * 3. The name of the author may not be used to endorse or promote products
50d25013f2Scamield * derived from this software without specific prior written permission.
51d25013f2Scamield *
52d25013f2Scamield * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
53d25013f2Scamield * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
54d25013f2Scamield * AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
55d25013f2Scamield * THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
56d25013f2Scamield * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
57d25013f2Scamield * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
58d25013f2Scamield * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
59d25013f2Scamield * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
60d25013f2Scamield * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
61d25013f2Scamield * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
62df930be7Sderaadt */
63df930be7Sderaadt
644a5fbbc4Spjanzen #include <stdlib.h>
654a5fbbc4Spjanzen #include <unistd.h>
66*aed906e4Smestre
674a5fbbc4Spjanzen #include "hack.h"
684a5fbbc4Spjanzen
69df930be7Sderaadt extern struct obj *billobjs;
70df930be7Sderaadt extern char SAVEF[];
71df930be7Sderaadt extern int hackpid;
72df930be7Sderaadt extern xchar dlevel;
73df930be7Sderaadt extern char nul[];
74df930be7Sderaadt
75df930be7Sderaadt #ifndef NOWORM
76df930be7Sderaadt extern struct wseg *wsegs[32], *wheads[32];
77df930be7Sderaadt extern long wgrowtime[32];
7854da88e4Spjanzen #endif /* NOWORM */
79df930be7Sderaadt
80df930be7Sderaadt boolean level_exists[MAXLEVEL+1];
81df930be7Sderaadt
824a5fbbc4Spjanzen void
savelev(int fd,xchar lev)834a5fbbc4Spjanzen savelev(int fd, xchar lev)
84df930be7Sderaadt {
85df930be7Sderaadt #ifndef NOWORM
864a5fbbc4Spjanzen struct wseg *wtmp, *wtmp2;
874a5fbbc4Spjanzen int tmp;
8854da88e4Spjanzen #endif /* NOWORM */
89df930be7Sderaadt
904a5fbbc4Spjanzen if (fd < 0)
914a5fbbc4Spjanzen panic("Save on bad file!"); /* impossible */
92df930be7Sderaadt if (lev >= 0 && lev <= MAXLEVEL)
934a5fbbc4Spjanzen level_exists[(int)lev] = TRUE;
94df930be7Sderaadt
95ebf3d589Sguenther bwrite(fd, &hackpid,sizeof(hackpid));
96ebf3d589Sguenther bwrite(fd, &lev,sizeof(lev));
97ebf3d589Sguenther bwrite(fd, levl,sizeof(levl));
98ebf3d589Sguenther bwrite(fd, &moves,sizeof(long));
99ebf3d589Sguenther bwrite(fd, &xupstair,sizeof(xupstair));
100ebf3d589Sguenther bwrite(fd, &yupstair,sizeof(yupstair));
101ebf3d589Sguenther bwrite(fd, &xdnstair,sizeof(xdnstair));
102ebf3d589Sguenther bwrite(fd, &ydnstair,sizeof(ydnstair));
103df930be7Sderaadt savemonchn(fd, fmon);
104df930be7Sderaadt savegoldchn(fd, fgold);
105df930be7Sderaadt savetrapchn(fd, ftrap);
106df930be7Sderaadt saveobjchn(fd, fobj);
107df930be7Sderaadt saveobjchn(fd, billobjs);
108df930be7Sderaadt billobjs = 0;
109df930be7Sderaadt save_engravings(fd);
110df930be7Sderaadt #ifndef QUEST
111ebf3d589Sguenther bwrite(fd, rooms,sizeof(rooms));
112ebf3d589Sguenther bwrite(fd, doors,sizeof(doors));
11354da88e4Spjanzen #endif /* QUEST */
114df930be7Sderaadt fgold = 0;
115df930be7Sderaadt ftrap = 0;
116df930be7Sderaadt fmon = 0;
117df930be7Sderaadt fobj = 0;
118df930be7Sderaadt #ifndef NOWORM
119ebf3d589Sguenther bwrite(fd, wsegs,sizeof(wsegs));
120df930be7Sderaadt for(tmp=1; tmp<32; tmp++){
121df930be7Sderaadt for(wtmp = wsegs[tmp]; wtmp; wtmp = wtmp2){
122df930be7Sderaadt wtmp2 = wtmp->nseg;
123ebf3d589Sguenther bwrite(fd, wtmp,sizeof(struct wseg));
124df930be7Sderaadt }
125df930be7Sderaadt wsegs[tmp] = 0;
126df930be7Sderaadt }
127ebf3d589Sguenther bwrite(fd, wgrowtime,sizeof(wgrowtime));
12854da88e4Spjanzen #endif /* NOWORM */
129df930be7Sderaadt }
130df930be7Sderaadt
1314a5fbbc4Spjanzen void
bwrite(int fd,const void * loc,ssize_t num)132ebf3d589Sguenther bwrite(int fd, const void *loc, ssize_t num)
133df930be7Sderaadt {
134ebf3d589Sguenther if(write(fd, loc, num) != num)
135911134d2Sguenther panic("cannot write %zd bytes to file #%d", num, fd);
136df930be7Sderaadt }
137df930be7Sderaadt
1384a5fbbc4Spjanzen void
saveobjchn(int fd,struct obj * otmp)1394a5fbbc4Spjanzen saveobjchn(int fd, struct obj *otmp)
140df930be7Sderaadt {
1414a5fbbc4Spjanzen struct obj *otmp2;
142df930be7Sderaadt unsigned xl;
143df930be7Sderaadt int minusone = -1;
144df930be7Sderaadt
145df930be7Sderaadt while(otmp) {
146df930be7Sderaadt otmp2 = otmp->nobj;
147df930be7Sderaadt xl = otmp->onamelth;
148ebf3d589Sguenther bwrite(fd, &xl, sizeof(int));
149ebf3d589Sguenther bwrite(fd, otmp, xl + sizeof(struct obj));
150ebf3d589Sguenther free(otmp);
151df930be7Sderaadt otmp = otmp2;
152df930be7Sderaadt }
153ebf3d589Sguenther bwrite(fd, &minusone, sizeof(int));
154df930be7Sderaadt }
155df930be7Sderaadt
1564a5fbbc4Spjanzen void
savemonchn(int fd,struct monst * mtmp)1574a5fbbc4Spjanzen savemonchn(int fd, struct monst *mtmp)
158df930be7Sderaadt {
1594a5fbbc4Spjanzen struct monst *mtmp2;
160df930be7Sderaadt unsigned xl;
161df930be7Sderaadt int minusone = -1;
162df930be7Sderaadt struct permonst *monbegin = &mons[0];
163df930be7Sderaadt
164ebf3d589Sguenther bwrite(fd, &monbegin, sizeof(monbegin));
165df930be7Sderaadt
166df930be7Sderaadt while(mtmp) {
167df930be7Sderaadt mtmp2 = mtmp->nmon;
168df930be7Sderaadt xl = mtmp->mxlth + mtmp->mnamelth;
169ebf3d589Sguenther bwrite(fd, &xl, sizeof(int));
170ebf3d589Sguenther bwrite(fd, mtmp, xl + sizeof(struct monst));
171df930be7Sderaadt if(mtmp->minvent) saveobjchn(fd,mtmp->minvent);
172ebf3d589Sguenther free(mtmp);
173df930be7Sderaadt mtmp = mtmp2;
174df930be7Sderaadt }
175ebf3d589Sguenther bwrite(fd, &minusone, sizeof(int));
176df930be7Sderaadt }
177df930be7Sderaadt
1784a5fbbc4Spjanzen void
savegoldchn(int fd,struct gold * gold)1794a5fbbc4Spjanzen savegoldchn(int fd, struct gold *gold)
180df930be7Sderaadt {
1814a5fbbc4Spjanzen struct gold *gold2;
182df930be7Sderaadt while(gold) {
183df930be7Sderaadt gold2 = gold->ngold;
184ebf3d589Sguenther bwrite(fd, gold, sizeof(struct gold));
185ebf3d589Sguenther free(gold);
186df930be7Sderaadt gold = gold2;
187df930be7Sderaadt }
188df930be7Sderaadt bwrite(fd, nul, sizeof(struct gold));
189df930be7Sderaadt }
190df930be7Sderaadt
1914a5fbbc4Spjanzen void
savetrapchn(int fd,struct trap * trap)1924a5fbbc4Spjanzen savetrapchn(int fd, struct trap *trap)
193df930be7Sderaadt {
1944a5fbbc4Spjanzen struct trap *trap2;
195df930be7Sderaadt while(trap) {
196df930be7Sderaadt trap2 = trap->ntrap;
197ebf3d589Sguenther bwrite(fd, trap, sizeof(struct trap));
198ebf3d589Sguenther free(trap);
199df930be7Sderaadt trap = trap2;
200df930be7Sderaadt }
201df930be7Sderaadt bwrite(fd, nul, sizeof(struct trap));
202df930be7Sderaadt }
203df930be7Sderaadt
2044a5fbbc4Spjanzen void
getlev(int fd,int pid,xchar lev)2054a5fbbc4Spjanzen getlev(int fd, int pid, xchar lev)
206df930be7Sderaadt {
2074a5fbbc4Spjanzen struct gold *gold;
2084a5fbbc4Spjanzen struct trap *trap;
209df930be7Sderaadt #ifndef NOWORM
2104a5fbbc4Spjanzen struct wseg *wtmp;
21154da88e4Spjanzen #endif /* NOWORM */
2124a5fbbc4Spjanzen int tmp;
213df930be7Sderaadt long omoves;
214df930be7Sderaadt int hpid;
215df930be7Sderaadt xchar dlvl;
216df930be7Sderaadt
217df930be7Sderaadt /* First some sanity checks */
218df930be7Sderaadt mread(fd, (char *) &hpid, sizeof(hpid));
219df930be7Sderaadt mread(fd, (char *) &dlvl, sizeof(dlvl));
220df930be7Sderaadt if((pid && pid != hpid) || (lev && dlvl != lev)) {
221df930be7Sderaadt pline("Strange, this map is not as I remember it.");
222df930be7Sderaadt pline("Somebody is trying some trickery here ...");
223df930be7Sderaadt pline("This game is void ...");
224df930be7Sderaadt done("tricked");
225df930be7Sderaadt }
226df930be7Sderaadt
227df930be7Sderaadt fgold = 0;
228df930be7Sderaadt ftrap = 0;
229df930be7Sderaadt mread(fd, (char *) levl, sizeof(levl));
230df930be7Sderaadt mread(fd, (char *)&omoves, sizeof(omoves));
231df930be7Sderaadt mread(fd, (char *)&xupstair, sizeof(xupstair));
232df930be7Sderaadt mread(fd, (char *)&yupstair, sizeof(yupstair));
233df930be7Sderaadt mread(fd, (char *)&xdnstair, sizeof(xdnstair));
234df930be7Sderaadt mread(fd, (char *)&ydnstair, sizeof(ydnstair));
235df930be7Sderaadt
236df930be7Sderaadt fmon = restmonchn(fd);
237df930be7Sderaadt
238df930be7Sderaadt /* regenerate animals while on another level */
239df930be7Sderaadt { long tmoves = (moves > omoves) ? moves-omoves : 0;
2404a5fbbc4Spjanzen struct monst *mtmp, *mtmp2;
241df930be7Sderaadt extern char genocided[];
242df930be7Sderaadt
243df930be7Sderaadt for(mtmp = fmon; mtmp; mtmp = mtmp2) {
244df930be7Sderaadt long newhp; /* tmoves may be very large */
245df930be7Sderaadt
246df930be7Sderaadt mtmp2 = mtmp->nmon;
247180acc8fSmillert if(strchr(genocided, mtmp->data->mlet)) {
248df930be7Sderaadt mondead(mtmp);
249df930be7Sderaadt continue;
250df930be7Sderaadt }
251df930be7Sderaadt
252df930be7Sderaadt if(mtmp->mtame && tmoves > 250) {
253df930be7Sderaadt mtmp->mtame = 0;
254df930be7Sderaadt mtmp->mpeaceful = 0;
255df930be7Sderaadt }
256df930be7Sderaadt
257df930be7Sderaadt newhp = mtmp->mhp +
258180acc8fSmillert (strchr(MREGEN, mtmp->data->mlet) ? tmoves : tmoves/20);
259df930be7Sderaadt if(newhp > mtmp->mhpmax)
260df930be7Sderaadt mtmp->mhp = mtmp->mhpmax;
261df930be7Sderaadt else
262df930be7Sderaadt mtmp->mhp = newhp;
263df930be7Sderaadt }
264df930be7Sderaadt }
265df930be7Sderaadt
266df930be7Sderaadt setgd();
267df930be7Sderaadt gold = newgold();
268df930be7Sderaadt mread(fd, (char *)gold, sizeof(struct gold));
269df930be7Sderaadt while(gold->gx) {
270df930be7Sderaadt gold->ngold = fgold;
271df930be7Sderaadt fgold = gold;
272df930be7Sderaadt gold = newgold();
273df930be7Sderaadt mread(fd, (char *)gold, sizeof(struct gold));
274df930be7Sderaadt }
275ebf3d589Sguenther free(gold);
276df930be7Sderaadt trap = newtrap();
277df930be7Sderaadt mread(fd, (char *)trap, sizeof(struct trap));
278df930be7Sderaadt while(trap->tx) {
279df930be7Sderaadt trap->ntrap = ftrap;
280df930be7Sderaadt ftrap = trap;
281df930be7Sderaadt trap = newtrap();
282df930be7Sderaadt mread(fd, (char *)trap, sizeof(struct trap));
283df930be7Sderaadt }
284ebf3d589Sguenther free(trap);
285df930be7Sderaadt fobj = restobjchn(fd);
286df930be7Sderaadt billobjs = restobjchn(fd);
287df930be7Sderaadt rest_engravings(fd);
288df930be7Sderaadt #ifndef QUEST
289df930be7Sderaadt mread(fd, (char *)rooms, sizeof(rooms));
290df930be7Sderaadt mread(fd, (char *)doors, sizeof(doors));
29154da88e4Spjanzen #endif /* QUEST */
292df930be7Sderaadt #ifndef NOWORM
293df930be7Sderaadt mread(fd, (char *)wsegs, sizeof(wsegs));
294df930be7Sderaadt for(tmp = 1; tmp < 32; tmp++) if(wsegs[tmp]){
295df930be7Sderaadt wheads[tmp] = wsegs[tmp] = wtmp = newseg();
296df930be7Sderaadt while(1) {
297df930be7Sderaadt mread(fd, (char *)wtmp, sizeof(struct wseg));
298df930be7Sderaadt if(!wtmp->nseg) break;
299df930be7Sderaadt wheads[tmp]->nseg = wtmp = newseg();
300df930be7Sderaadt wheads[tmp] = wtmp;
301df930be7Sderaadt }
302df930be7Sderaadt }
303df930be7Sderaadt mread(fd, (char *)wgrowtime, sizeof(wgrowtime));
30454da88e4Spjanzen #endif /* NOWORM */
305df930be7Sderaadt }
306df930be7Sderaadt
3074a5fbbc4Spjanzen void
mread(int fd,char * buf,unsigned len)3084a5fbbc4Spjanzen mread(int fd, char *buf, unsigned len)
309df930be7Sderaadt {
3104a5fbbc4Spjanzen int rlen;
311df930be7Sderaadt extern boolean restoring;
312df930be7Sderaadt
313df930be7Sderaadt rlen = read(fd, buf, (int) len);
314df930be7Sderaadt if(rlen != len){
315df930be7Sderaadt pline("Read %d instead of %u bytes.\n", rlen, len);
316df930be7Sderaadt if(restoring) {
317df930be7Sderaadt (void) unlink(SAVEF);
318df930be7Sderaadt error("Error restoring old game.");
319df930be7Sderaadt }
320df930be7Sderaadt panic("Error reading level file.");
321df930be7Sderaadt }
322df930be7Sderaadt }
323df930be7Sderaadt
3244a5fbbc4Spjanzen void
mklev(void)325*aed906e4Smestre mklev(void)
326df930be7Sderaadt {
327df930be7Sderaadt extern boolean in_mklev;
328df930be7Sderaadt
329df930be7Sderaadt if(getbones()) return;
330df930be7Sderaadt
331df930be7Sderaadt in_mklev = TRUE;
332df930be7Sderaadt makelevel();
333df930be7Sderaadt in_mklev = FALSE;
334df930be7Sderaadt }
335