xref: /openbsd/games/hack/hack.bones.c (revision 77f90040)
1 /*	$OpenBSD: hack.bones.c,v 1.12 2023/06/03 15:19:38 op Exp $	*/
2 
3 /*
4  * Copyright (c) 1985, Stichting Centrum voor Wiskunde en Informatica,
5  * Amsterdam
6  * All rights reserved.
7  *
8  * Redistribution and use in source and binary forms, with or without
9  * modification, are permitted provided that the following conditions are
10  * met:
11  *
12  * - Redistributions of source code must retain the above copyright notice,
13  * this list of conditions and the following disclaimer.
14  *
15  * - Redistributions in binary form must reproduce the above copyright
16  * notice, this list of conditions and the following disclaimer in the
17  * documentation and/or other materials provided with the distribution.
18  *
19  * - Neither the name of the Stichting Centrum voor Wiskunde en
20  * Informatica, nor the names of its contributors may be used to endorse or
21  * promote products derived from this software without specific prior
22  * written permission.
23  *
24  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
25  * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
26  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
27  * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
28  * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
29  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
30  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
31  * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
32  * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
33  * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
34  * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
35  */
36 
37 /*
38  * Copyright (c) 1982 Jay Fenlason <hack@gnu.org>
39  * All rights reserved.
40  *
41  * Redistribution and use in source and binary forms, with or without
42  * modification, are permitted provided that the following conditions
43  * are met:
44  * 1. Redistributions of source code must retain the above copyright
45  *    notice, this list of conditions and the following disclaimer.
46  * 2. Redistributions in binary form must reproduce the above copyright
47  *    notice, this list of conditions and the following disclaimer in the
48  *    documentation and/or other materials provided with the distribution.
49  * 3. The name of the author may not be used to endorse or promote products
50  *    derived from this software without specific prior written permission.
51  *
52  * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
53  * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
54  * AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL
55  * THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
56  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
57  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
58  * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
59  * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
60  * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
61  * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
62  */
63 
64 #include <unistd.h>
65 
66 #include "hack.h"
67 
68 extern char plname[PL_NSIZ];
69 extern struct permonst pm_ghost;
70 
71 char bones[] = "bones_xx";
72 
73 /* save bones and possessions of a deceased adventurer */
74 void
savebones(void)75 savebones(void)
76 {
77 	int fd;
78 	struct obj *otmp;
79 	struct trap *ttmp;
80 	struct monst *mtmp;
81 
82 	if(dlevel <= 0 || dlevel > MAXLEVEL) return;
83 	if(!rn2(1 + dlevel/2)) return;	/* not so many ghosts on low levels */
84 	bones[6] = '0' + (dlevel/10);
85 	bones[7] = '0' + (dlevel%10);
86 	if((fd = open(bones, O_RDONLY)) >= 0){
87 		(void) close(fd);
88 		return;
89 	}
90 	/* drop everything; the corpse's possessions are usually cursed */
91 	otmp = invent;
92 	while(otmp){
93 		otmp->ox = u.ux;
94 		otmp->oy = u.uy;
95 		otmp->age = 0;		/* very long ago */
96 		otmp->owornmask = 0;
97 		if(rn2(5)) otmp->cursed = 1;
98 		if(!otmp->nobj){
99 			otmp->nobj = fobj;
100 			fobj = invent;
101 			invent = 0;	/* superfluous */
102 			break;
103 		}
104 		otmp = otmp->nobj;
105 	}
106 	if(!(mtmp = makemon(PM_GHOST, u.ux, u.uy))) return;
107 	mtmp->mx = u.ux;
108 	mtmp->my = u.uy;
109 	mtmp->msleep = 1;
110 	(void) strlcpy((char *) mtmp->mextra, plname, mtmp->mxlth);
111 	mkgold(somegold() + d(dlevel,30), u.ux, u.uy);
112 	for(mtmp = fmon; mtmp; mtmp = mtmp->nmon){
113 		mtmp->m_id = 0;
114 		if(mtmp->mtame) {
115 			mtmp->mtame = 0;
116 			mtmp->mpeaceful = 0;
117 		}
118 		mtmp->mlstmv = 0;
119 		if(mtmp->mdispl) unpmon(mtmp);
120 	}
121 	for(ttmp = ftrap; ttmp; ttmp = ttmp->ntrap)
122 		ttmp->tseen = 0;
123 	for(otmp = fobj; otmp; otmp = otmp->nobj) {
124 		otmp->o_id = 0;
125 	     /* otmp->o_cnt_id = 0; - superfluous */
126 		otmp->onamelth = 0;
127 		otmp->known = 0;
128 		otmp->invlet = 0;
129 		if(otmp->olet == AMULET_SYM && !otmp->spe) {
130 			otmp->spe = -1;      /* no longer the actual amulet */
131 			otmp->cursed = 1;    /* flag as gotten from a ghost */
132 		}
133 	}
134 	if((fd = open(bones, O_CREAT | O_TRUNC | O_WRONLY, FMASK)) == -1) return;
135 	savelev(fd,dlevel);
136 	(void) close(fd);
137 }
138 
139 int
getbones(void)140 getbones(void)
141 {
142 	int fd,x,y;
143 
144 	if(rn2(3)) return(0);	/* only once in three times do we find bones */
145 	bones[6] = '0' + dlevel/10;
146 	bones[7] = '0' + dlevel%10;
147 	if((fd = open(bones, O_RDONLY)) == -1) return(0);
148 	getlev(fd, 0, dlevel);
149 	for(x = 0; x < COLNO; x++) for(y = 0; y < ROWNO; y++)
150 		levl[x][y].seen = levl[x][y].new = 0;
151 	(void) close(fd);
152 #ifdef WIZARD
153 	if(!wizard)	/* duvel!frans: don't remove bones while debugging */
154 #endif /* WiZARD */
155 	    if(unlink(bones) == -1){
156 		pline("Cannot unlink %s .", bones);
157 		return(0);
158 	}
159 	return(1);
160 }
161