save.c revision 1.11 1 1.11 dholland /* $NetBSD: save.c,v 1.11 2007/12/27 23:53:01 dholland Exp $ */
2 1.3 cgd
3 1.1 cgd /*
4 1.3 cgd * Copyright (c) 1988, 1993
5 1.3 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * This code is derived from software contributed to Berkeley by
8 1.1 cgd * Timothy C. Stoehr.
9 1.1 cgd *
10 1.1 cgd * Redistribution and use in source and binary forms, with or without
11 1.1 cgd * modification, are permitted provided that the following conditions
12 1.1 cgd * are met:
13 1.1 cgd * 1. Redistributions of source code must retain the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer.
15 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 cgd * notice, this list of conditions and the following disclaimer in the
17 1.1 cgd * documentation and/or other materials provided with the distribution.
18 1.9 agc * 3. Neither the name of the University nor the names of its contributors
19 1.1 cgd * may be used to endorse or promote products derived from this software
20 1.1 cgd * without specific prior written permission.
21 1.1 cgd *
22 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 1.1 cgd * SUCH DAMAGE.
33 1.1 cgd */
34 1.1 cgd
35 1.4 lukem #include <sys/cdefs.h>
36 1.1 cgd #ifndef lint
37 1.3 cgd #if 0
38 1.3 cgd static char sccsid[] = "@(#)save.c 8.1 (Berkeley) 5/31/93";
39 1.3 cgd #else
40 1.11 dholland __RCSID("$NetBSD: save.c,v 1.11 2007/12/27 23:53:01 dholland Exp $");
41 1.3 cgd #endif
42 1.1 cgd #endif /* not lint */
43 1.1 cgd
44 1.1 cgd /*
45 1.1 cgd * save.c
46 1.1 cgd *
47 1.1 cgd * This source herein may be modified and/or distributed by anybody who
48 1.1 cgd * so desires, with the following restrictions:
49 1.1 cgd * 1.) No portion of this notice shall be removed.
50 1.1 cgd * 2.) Credit shall not be taken for the creation of this source.
51 1.1 cgd * 3.) This code is not to be traded, sold, or used for personal
52 1.1 cgd * gain or profit.
53 1.1 cgd *
54 1.1 cgd */
55 1.1 cgd
56 1.1 cgd #include <stdio.h>
57 1.1 cgd #include "rogue.h"
58 1.1 cgd
59 1.1 cgd short write_failed = 0;
60 1.1 cgd char *save_file = (char *) 0;
61 1.1 cgd
62 1.4 lukem void
63 1.1 cgd save_game()
64 1.1 cgd {
65 1.1 cgd char fname[64];
66 1.1 cgd
67 1.11 dholland if (!get_input_line("file name?", save_file, fname, sizeof(fname),
68 1.11 dholland "game not saved", 0, 1)) {
69 1.1 cgd return;
70 1.1 cgd }
71 1.1 cgd check_message();
72 1.11 dholland messagef(0, "%s", fname);
73 1.1 cgd save_into_file(fname);
74 1.1 cgd }
75 1.1 cgd
76 1.4 lukem void
77 1.1 cgd save_into_file(sfile)
78 1.5 hubertf const char *sfile;
79 1.1 cgd {
80 1.1 cgd FILE *fp;
81 1.1 cgd int file_id;
82 1.6 jsm char *name_buffer;
83 1.6 jsm size_t len;
84 1.1 cgd char *hptr;
85 1.1 cgd struct rogue_time rt_buf;
86 1.1 cgd
87 1.1 cgd if (sfile[0] == '~') {
88 1.4 lukem if ((hptr = md_getenv("HOME")) != NULL) {
89 1.6 jsm len = strlen(hptr) + strlen(sfile);
90 1.6 jsm name_buffer = md_malloc(len);
91 1.6 jsm if (name_buffer == NULL) {
92 1.11 dholland messagef(0,
93 1.11 dholland "out of memory for save file name");
94 1.6 jsm sfile = error_file;
95 1.6 jsm } else {
96 1.6 jsm (void) strcpy(name_buffer, hptr);
97 1.6 jsm (void) strcat(name_buffer, sfile+1);
98 1.6 jsm sfile = name_buffer;
99 1.6 jsm }
100 1.11 dholland /*
101 1.11 dholland * Note: name_buffer gets leaked. But it's small,
102 1.11 dholland * and in the common case we're about to exit.
103 1.11 dholland */
104 1.1 cgd }
105 1.1 cgd }
106 1.8 mrg if (((fp = fopen(sfile, "w")) == NULL) ||
107 1.8 mrg ((file_id = md_get_file_id(sfile)) == -1)) {
108 1.10 abs if (fp)
109 1.10 abs fclose(fp);
110 1.11 dholland messagef(0, "problem accessing the save file");
111 1.1 cgd return;
112 1.1 cgd }
113 1.1 cgd md_ignore_signals();
114 1.1 cgd write_failed = 0;
115 1.1 cgd (void) xxx(1);
116 1.1 cgd r_write(fp, (char *) &detect_monster, sizeof(detect_monster));
117 1.1 cgd r_write(fp, (char *) &cur_level, sizeof(cur_level));
118 1.1 cgd r_write(fp, (char *) &max_level, sizeof(max_level));
119 1.1 cgd write_string(hunger_str, fp);
120 1.1 cgd write_string(login_name, fp);
121 1.1 cgd r_write(fp, (char *) &party_room, sizeof(party_room));
122 1.1 cgd write_pack(&level_monsters, fp);
123 1.1 cgd write_pack(&level_objects, fp);
124 1.1 cgd r_write(fp, (char *) &file_id, sizeof(file_id));
125 1.1 cgd rw_dungeon(fp, 1);
126 1.1 cgd r_write(fp, (char *) &foods, sizeof(foods));
127 1.1 cgd r_write(fp, (char *) &rogue, sizeof(fighter));
128 1.1 cgd write_pack(&rogue.pack, fp);
129 1.1 cgd rw_id(id_potions, fp, POTIONS, 1);
130 1.1 cgd rw_id(id_scrolls, fp, SCROLS, 1);
131 1.1 cgd rw_id(id_wands, fp, WANDS, 1);
132 1.1 cgd rw_id(id_rings, fp, RINGS, 1);
133 1.1 cgd r_write(fp, (char *) traps, (MAX_TRAPS * sizeof(trap)));
134 1.1 cgd r_write(fp, (char *) is_wood, (WANDS * sizeof(boolean)));
135 1.1 cgd r_write(fp, (char *) &cur_room, sizeof(cur_room));
136 1.1 cgd rw_rooms(fp, 1);
137 1.1 cgd r_write(fp, (char *) &being_held, sizeof(being_held));
138 1.1 cgd r_write(fp, (char *) &bear_trap, sizeof(bear_trap));
139 1.1 cgd r_write(fp, (char *) &halluc, sizeof(halluc));
140 1.1 cgd r_write(fp, (char *) &blind, sizeof(blind));
141 1.1 cgd r_write(fp, (char *) &confused, sizeof(confused));
142 1.1 cgd r_write(fp, (char *) &levitate, sizeof(levitate));
143 1.1 cgd r_write(fp, (char *) &haste_self, sizeof(haste_self));
144 1.1 cgd r_write(fp, (char *) &see_invisible, sizeof(see_invisible));
145 1.1 cgd r_write(fp, (char *) &detect_monster, sizeof(detect_monster));
146 1.1 cgd r_write(fp, (char *) &wizard, sizeof(wizard));
147 1.1 cgd r_write(fp, (char *) &score_only, sizeof(score_only));
148 1.1 cgd r_write(fp, (char *) &m_moves, sizeof(m_moves));
149 1.1 cgd md_gct(&rt_buf);
150 1.1 cgd rt_buf.second += 10; /* allow for some processing time */
151 1.1 cgd r_write(fp, (char *) &rt_buf, sizeof(rt_buf));
152 1.1 cgd fclose(fp);
153 1.1 cgd
154 1.1 cgd if (write_failed) {
155 1.1 cgd (void) md_df(sfile); /* delete file */
156 1.1 cgd } else {
157 1.1 cgd clean_up("");
158 1.1 cgd }
159 1.1 cgd }
160 1.1 cgd
161 1.4 lukem void
162 1.1 cgd restore(fname)
163 1.5 hubertf const char *fname;
164 1.1 cgd {
165 1.1 cgd FILE *fp;
166 1.1 cgd struct rogue_time saved_time, mod_time;
167 1.1 cgd char buf[4];
168 1.11 dholland char tbuf[MAX_OPT_LEN];
169 1.1 cgd int new_file_id, saved_file_id;
170 1.1 cgd
171 1.4 lukem fp = NULL;
172 1.8 mrg if (((new_file_id = md_get_file_id(fname)) == -1) ||
173 1.8 mrg ((fp = fopen(fname, "r")) == NULL)) {
174 1.1 cgd clean_up("cannot open file");
175 1.1 cgd }
176 1.1 cgd if (md_link_count(fname) > 1) {
177 1.1 cgd clean_up("file has link");
178 1.1 cgd }
179 1.1 cgd (void) xxx(1);
180 1.1 cgd r_read(fp, (char *) &detect_monster, sizeof(detect_monster));
181 1.1 cgd r_read(fp, (char *) &cur_level, sizeof(cur_level));
182 1.1 cgd r_read(fp, (char *) &max_level, sizeof(max_level));
183 1.8 mrg read_string(hunger_str, fp, sizeof hunger_str);
184 1.1 cgd
185 1.8 mrg (void) strlcpy(tbuf, login_name, sizeof tbuf);
186 1.8 mrg read_string(login_name, fp, sizeof login_name);
187 1.1 cgd if (strcmp(tbuf, login_name)) {
188 1.1 cgd clean_up("you're not the original player");
189 1.1 cgd }
190 1.1 cgd
191 1.1 cgd r_read(fp, (char *) &party_room, sizeof(party_room));
192 1.1 cgd read_pack(&level_monsters, fp, 0);
193 1.1 cgd read_pack(&level_objects, fp, 0);
194 1.1 cgd r_read(fp, (char *) &saved_file_id, sizeof(saved_file_id));
195 1.1 cgd if (new_file_id != saved_file_id) {
196 1.1 cgd clean_up("sorry, saved game is not in the same file");
197 1.1 cgd }
198 1.1 cgd rw_dungeon(fp, 0);
199 1.1 cgd r_read(fp, (char *) &foods, sizeof(foods));
200 1.1 cgd r_read(fp, (char *) &rogue, sizeof(fighter));
201 1.1 cgd read_pack(&rogue.pack, fp, 1);
202 1.1 cgd rw_id(id_potions, fp, POTIONS, 0);
203 1.1 cgd rw_id(id_scrolls, fp, SCROLS, 0);
204 1.1 cgd rw_id(id_wands, fp, WANDS, 0);
205 1.1 cgd rw_id(id_rings, fp, RINGS, 0);
206 1.1 cgd r_read(fp, (char *) traps, (MAX_TRAPS * sizeof(trap)));
207 1.1 cgd r_read(fp, (char *) is_wood, (WANDS * sizeof(boolean)));
208 1.1 cgd r_read(fp, (char *) &cur_room, sizeof(cur_room));
209 1.1 cgd rw_rooms(fp, 0);
210 1.1 cgd r_read(fp, (char *) &being_held, sizeof(being_held));
211 1.1 cgd r_read(fp, (char *) &bear_trap, sizeof(bear_trap));
212 1.1 cgd r_read(fp, (char *) &halluc, sizeof(halluc));
213 1.1 cgd r_read(fp, (char *) &blind, sizeof(blind));
214 1.1 cgd r_read(fp, (char *) &confused, sizeof(confused));
215 1.1 cgd r_read(fp, (char *) &levitate, sizeof(levitate));
216 1.1 cgd r_read(fp, (char *) &haste_self, sizeof(haste_self));
217 1.1 cgd r_read(fp, (char *) &see_invisible, sizeof(see_invisible));
218 1.1 cgd r_read(fp, (char *) &detect_monster, sizeof(detect_monster));
219 1.1 cgd r_read(fp, (char *) &wizard, sizeof(wizard));
220 1.1 cgd r_read(fp, (char *) &score_only, sizeof(score_only));
221 1.1 cgd r_read(fp, (char *) &m_moves, sizeof(m_moves));
222 1.1 cgd r_read(fp, (char *) &saved_time, sizeof(saved_time));
223 1.1 cgd
224 1.1 cgd if (fread(buf, sizeof(char), 1, fp) > 0) {
225 1.1 cgd clear();
226 1.1 cgd clean_up("extra characters in file");
227 1.1 cgd }
228 1.1 cgd
229 1.1 cgd md_gfmt(fname, &mod_time); /* get file modification time */
230 1.1 cgd
231 1.1 cgd if (has_been_touched(&saved_time, &mod_time)) {
232 1.1 cgd clear();
233 1.1 cgd clean_up("sorry, file has been touched");
234 1.1 cgd }
235 1.1 cgd if ((!wizard) && !md_df(fname)) {
236 1.1 cgd clean_up("cannot delete file");
237 1.1 cgd }
238 1.1 cgd msg_cleared = 0;
239 1.1 cgd ring_stats(0);
240 1.1 cgd fclose(fp);
241 1.1 cgd }
242 1.1 cgd
243 1.4 lukem void
244 1.1 cgd write_pack(pack, fp)
245 1.5 hubertf const object *pack;
246 1.4 lukem FILE *fp;
247 1.1 cgd {
248 1.1 cgd object t;
249 1.1 cgd
250 1.4 lukem while ((pack = pack->next_object) != NULL) {
251 1.5 hubertf r_write(fp, (const char *) pack, sizeof(object));
252 1.1 cgd }
253 1.1 cgd t.ichar = t.what_is = 0;
254 1.5 hubertf r_write(fp, (const char *) &t, sizeof(object));
255 1.1 cgd }
256 1.1 cgd
257 1.4 lukem void
258 1.1 cgd read_pack(pack, fp, is_rogue)
259 1.4 lukem object *pack;
260 1.4 lukem FILE *fp;
261 1.4 lukem boolean is_rogue;
262 1.1 cgd {
263 1.1 cgd object read_obj, *new_obj;
264 1.1 cgd
265 1.1 cgd for (;;) {
266 1.1 cgd r_read(fp, (char *) &read_obj, sizeof(object));
267 1.1 cgd if (read_obj.ichar == 0) {
268 1.1 cgd pack->next_object = (object *) 0;
269 1.1 cgd break;
270 1.1 cgd }
271 1.1 cgd new_obj = alloc_object();
272 1.1 cgd *new_obj = read_obj;
273 1.1 cgd if (is_rogue) {
274 1.1 cgd if (new_obj->in_use_flags & BEING_WORN) {
275 1.8 mrg do_wear(new_obj);
276 1.1 cgd } else if (new_obj->in_use_flags & BEING_WIELDED) {
277 1.8 mrg do_wield(new_obj);
278 1.1 cgd } else if (new_obj->in_use_flags & (ON_EITHER_HAND)) {
279 1.1 cgd do_put_on(new_obj,
280 1.1 cgd ((new_obj->in_use_flags & ON_LEFT_HAND) ? 1 : 0));
281 1.1 cgd }
282 1.1 cgd }
283 1.1 cgd pack->next_object = new_obj;
284 1.1 cgd pack = new_obj;
285 1.1 cgd }
286 1.1 cgd }
287 1.1 cgd
288 1.4 lukem void
289 1.1 cgd rw_dungeon(fp, rw)
290 1.4 lukem FILE *fp;
291 1.4 lukem boolean rw;
292 1.1 cgd {
293 1.1 cgd short i, j;
294 1.1 cgd char buf[DCOLS];
295 1.1 cgd
296 1.1 cgd for (i = 0; i < DROWS; i++) {
297 1.1 cgd if (rw) {
298 1.1 cgd r_write(fp, (char *) dungeon[i], (DCOLS * sizeof(dungeon[0][0])));
299 1.1 cgd for (j = 0; j < DCOLS; j++) {
300 1.1 cgd buf[j] = mvinch(i, j);
301 1.1 cgd }
302 1.1 cgd r_write(fp, buf, DCOLS);
303 1.1 cgd } else {
304 1.1 cgd r_read(fp, (char *) dungeon[i], (DCOLS * sizeof(dungeon[0][0])));
305 1.1 cgd r_read(fp, buf, DCOLS);
306 1.1 cgd for (j = 0; j < DCOLS; j++) {
307 1.1 cgd mvaddch(i, j, buf[j]);
308 1.1 cgd }
309 1.1 cgd }
310 1.1 cgd }
311 1.1 cgd }
312 1.1 cgd
313 1.4 lukem void
314 1.1 cgd rw_id(id_table, fp, n, wr)
315 1.4 lukem struct id id_table[];
316 1.4 lukem FILE *fp;
317 1.4 lukem int n;
318 1.4 lukem boolean wr;
319 1.1 cgd {
320 1.1 cgd short i;
321 1.1 cgd
322 1.1 cgd for (i = 0; i < n; i++) {
323 1.1 cgd if (wr) {
324 1.5 hubertf r_write(fp, (const char *) &(id_table[i].value), sizeof(short));
325 1.5 hubertf r_write(fp, (const char *) &(id_table[i].id_status),
326 1.1 cgd sizeof(unsigned short));
327 1.1 cgd write_string(id_table[i].title, fp);
328 1.1 cgd } else {
329 1.1 cgd r_read(fp, (char *) &(id_table[i].value), sizeof(short));
330 1.1 cgd r_read(fp, (char *) &(id_table[i].id_status),
331 1.1 cgd sizeof(unsigned short));
332 1.8 mrg read_string(id_table[i].title, fp, MAX_ID_TITLE_LEN);
333 1.1 cgd }
334 1.1 cgd }
335 1.1 cgd }
336 1.1 cgd
337 1.4 lukem void
338 1.1 cgd write_string(s, fp)
339 1.4 lukem char *s;
340 1.4 lukem FILE *fp;
341 1.1 cgd {
342 1.1 cgd short n;
343 1.1 cgd
344 1.1 cgd n = strlen(s) + 1;
345 1.1 cgd xxxx(s, n);
346 1.1 cgd r_write(fp, (char *) &n, sizeof(short));
347 1.1 cgd r_write(fp, s, n);
348 1.1 cgd }
349 1.1 cgd
350 1.4 lukem void
351 1.8 mrg read_string(s, fp, len)
352 1.4 lukem char *s;
353 1.4 lukem FILE *fp;
354 1.8 mrg size_t len;
355 1.1 cgd {
356 1.1 cgd short n;
357 1.1 cgd
358 1.1 cgd r_read(fp, (char *) &n, sizeof(short));
359 1.11 dholland if (n<=0 || (size_t)(unsigned short)n > len) {
360 1.8 mrg clean_up("read_string: corrupt game file");
361 1.11 dholland }
362 1.1 cgd r_read(fp, s, n);
363 1.1 cgd xxxx(s, n);
364 1.11 dholland /* ensure null termination */
365 1.11 dholland s[n-1] = 0;
366 1.1 cgd }
367 1.1 cgd
368 1.4 lukem void
369 1.1 cgd rw_rooms(fp, rw)
370 1.4 lukem FILE *fp;
371 1.4 lukem boolean rw;
372 1.1 cgd {
373 1.1 cgd short i;
374 1.1 cgd
375 1.1 cgd for (i = 0; i < MAXROOMS; i++) {
376 1.1 cgd rw ? r_write(fp, (char *) (rooms + i), sizeof(room)) :
377 1.1 cgd r_read(fp, (char *) (rooms + i), sizeof(room));
378 1.1 cgd }
379 1.1 cgd }
380 1.1 cgd
381 1.4 lukem void
382 1.1 cgd r_read(fp, buf, n)
383 1.4 lukem FILE *fp;
384 1.4 lukem char *buf;
385 1.4 lukem int n;
386 1.1 cgd {
387 1.7 jsm if (fread(buf, sizeof(char), n, fp) != (size_t)n) {
388 1.1 cgd clean_up("read() failed, don't know why");
389 1.1 cgd }
390 1.1 cgd }
391 1.1 cgd
392 1.4 lukem void
393 1.1 cgd r_write(fp, buf, n)
394 1.4 lukem FILE *fp;
395 1.5 hubertf const char *buf;
396 1.4 lukem int n;
397 1.1 cgd {
398 1.1 cgd if (!write_failed) {
399 1.7 jsm if (fwrite(buf, sizeof(char), n, fp) != (size_t)n) {
400 1.11 dholland messagef(0, "write() failed, don't know why");
401 1.1 cgd sound_bell();
402 1.1 cgd write_failed = 1;
403 1.1 cgd }
404 1.1 cgd }
405 1.1 cgd }
406 1.1 cgd
407 1.1 cgd boolean
408 1.1 cgd has_been_touched(saved_time, mod_time)
409 1.5 hubertf const struct rogue_time *saved_time, *mod_time;
410 1.1 cgd {
411 1.1 cgd if (saved_time->year < mod_time->year) {
412 1.1 cgd return(1);
413 1.1 cgd } else if (saved_time->year > mod_time->year) {
414 1.1 cgd return(0);
415 1.1 cgd }
416 1.1 cgd if (saved_time->month < mod_time->month) {
417 1.1 cgd return(1);
418 1.1 cgd } else if (saved_time->month > mod_time->month) {
419 1.1 cgd return(0);
420 1.1 cgd }
421 1.1 cgd if (saved_time->day < mod_time->day) {
422 1.1 cgd return(1);
423 1.1 cgd } else if (saved_time->day > mod_time->day) {
424 1.1 cgd return(0);
425 1.1 cgd }
426 1.1 cgd if (saved_time->hour < mod_time->hour) {
427 1.1 cgd return(1);
428 1.1 cgd } else if (saved_time->hour > mod_time->hour) {
429 1.1 cgd return(0);
430 1.1 cgd }
431 1.1 cgd if (saved_time->minute < mod_time->minute) {
432 1.1 cgd return(1);
433 1.1 cgd } else if (saved_time->minute > mod_time->minute) {
434 1.1 cgd return(0);
435 1.1 cgd }
436 1.1 cgd if (saved_time->second < mod_time->second) {
437 1.1 cgd return(1);
438 1.1 cgd }
439 1.1 cgd return(0);
440 1.1 cgd }
441