2 * Copyright (c) 1988, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 static char sccsid[] = "@(#)room.c 8.1 (Berkeley) 5/31/93";
44 * This source herein may be modified and/or distributed by anybody who
45 * so desires, with the following restrictions:
46 * 1.) No portion of this notice shall be removed.
47 * 2.) Credit shall not be taken for the creation of this source.
48 * 3.) This code is not to be traded, sold, or used for personal
56 boolean rooms_visited[MAXROOMS];
59 extern boolean detect_monster, jump, passgo, no_skull, ask_quit, flush;
60 extern char *nick_name, *fruit, *save_file, *press_space;
71 "Flush typeahead during battle (\"flush\"): ",
72 1, (char **) 0, &flush
75 "Show position only at end of run (\"jump\"): ",
79 "Follow turnings in passageways (\"passgo\"): ",
80 1, (char **) 0, &passgo
83 "Don't print skull when killed (\"noskull\" or \"notombstone\"): ",
84 1, (char **) 0, &no_skull
87 "Ask player before saying 'Okay, bye-bye!' (\"askquit\"): ",
88 1, (char **) 0, &ask_quit
95 "Fruit (\"fruit\"): ",
99 "Save file (\"file\"): ",
110 for (i = rooms[rn].top_row;
111 i <= rooms[rn].bottom_row; i++) {
112 for (j = rooms[rn].left_col;
113 j <= rooms[rn].right_col; j++) {
114 if (dungeon[i][j] & MONSTER) {
117 if (monster = object_at(&level_monsters, i, j)) {
118 dungeon[monster->row][monster->col] &= (~MONSTER);
119 monster->trail_char =
120 get_dungeon_char(monster->row, monster->col);
121 dungeon[monster->row][monster->col] |= MONSTER;
124 mvaddch(i, j, get_dungeon_char(i, j));
127 mvaddch(rogue.row, rogue.col, rogue.fchar);
131 light_passage(row, col)
133 short i, j, i_end, j_end;
138 i_end = (row < (DROWS-2)) ? 1 : 0;
139 j_end = (col < (DCOLS-1)) ? 1 : 0;
141 for (i = ((row > MIN_ROW) ? -1 : 0); i <= i_end; i++) {
142 for (j = ((col > 0) ? -1 : 0); j <= j_end; j++) {
143 if (can_move(row, col, row+i, col+j)) {
144 mvaddch(row+i, col+j, get_dungeon_char(row+i, col+j));
155 for (i = rooms[rn].top_row + 1; i < rooms[rn].bottom_row; i++) {
156 for (j = rooms[rn].left_col + 1; j < rooms[rn].right_col; j++) {
160 if (!(dungeon[i][j] & (OBJECT | STAIRS)) &&
161 !(detect_monster && (dungeon[i][j] & MONSTER))) {
162 if (!imitating(i, j)) {
165 if ((dungeon[i][j] & TRAP) && (!(dungeon[i][j] & HIDDEN))) {
174 get_dungeon_char(row, col)
177 register unsigned short mask = dungeon[row][col];
179 if (mask & MONSTER) {
180 return(gmc_row_col(row, col));
185 obj = object_at(&level_objects, row, col);
186 return(get_mask_char(obj->what_is));
188 if (mask & (TUNNEL | STAIRS | HORWALL | VERTWALL | FLOOR | DOOR)) {
189 if ((mask & (TUNNEL| STAIRS)) && (!(mask & HIDDEN))) {
190 return(((mask & STAIRS) ? '%' : '#'));
192 if (mask & HORWALL) {
195 if (mask & VERTWALL) {
200 if (!(dungeon[row][col] & HIDDEN)) {
208 if (((col > 0) && (dungeon[row][col-1] & HORWALL)) ||
209 ((col < (DCOLS-1)) && (dungeon[row][col+1] & HORWALL))) {
223 register unsigned short mask;
245 return('~'); /* unknown, something is wrong */
249 gr_row_col(row, col, mask)
257 r = get_rand(MIN_ROW, DROWS-2);
258 c = get_rand(0, DCOLS-1);
259 rn = get_room_number(r, c);
260 } while ((rn == NO_ROOM) ||
261 (!(dungeon[r][c] & mask)) ||
262 (dungeon[r][c] & (~mask)) ||
263 (!(rooms[rn].is_room & (R_ROOM | R_MAZE))) ||
264 ((r == rogue.row) && (c == rogue.col)));
275 i = get_rand(0, MAXROOMS-1);
276 } while (!(rooms[i].is_room & (R_ROOM | R_MAZE)));
285 short n, N, row, col;
288 N = ((rooms[rn].bottom_row - rooms[rn].top_row) - 1) *
289 ((rooms[rn].right_col - rooms[rn].left_col) - 1);
294 for (i = 0; i < n; i++) {
295 for (j = found = 0; ((!found) && (j < 250)); j++) {
296 row = get_rand(rooms[rn].top_row+1,
297 rooms[rn].bottom_row-1);
298 col = get_rand(rooms[rn].left_col+1,
299 rooms[rn].right_col-1);
300 if ((dungeon[row][col] == FLOOR) || (dungeon[row][col] == TUNNEL)) {
306 place_at(obj, row, col);
313 get_room_number(row, col)
318 for (i = 0; i < MAXROOMS; i++) {
319 if ((row >= rooms[i].top_row) && (row <= rooms[i].bottom_row) &&
320 (col >= rooms[i].left_col) && (col <= rooms[i].right_col)) {
329 short i, starting_room;
331 for (i = 0; i < MAXROOMS; i++) {
332 rooms_visited[i] = 0;
333 if (rooms[i].is_room & (R_ROOM | R_MAZE)) {
338 visit_rooms(starting_room);
340 for (i = 0; i < MAXROOMS; i++) {
341 if ((rooms[i].is_room & (R_ROOM | R_MAZE)) && (!rooms_visited[i])) {
354 rooms_visited[rn] = 1;
356 for (i = 0; i < 4; i++) {
357 oth_rn = rooms[rn].doors[i].oth_room;
358 if ((oth_rn >= 0) && (!rooms_visited[oth_rn])) {
367 unsigned short mask = (HORWALL | VERTWALL | DOOR | TUNNEL | TRAP | STAIRS |
371 for (i = 0; i < DROWS; i++) {
372 for (j = 0; j < DCOLS; j++) {
375 if (((ch = mvinch(i, j)) == ' ') ||
376 ((ch >= 'A') && (ch <= 'Z')) || (s & (TRAP | HIDDEN))) {
378 dungeon[i][j] &= (~HIDDEN);
381 } else if (s & VERTWALL) {
383 } else if (s & DOOR) {
385 } else if (s & TRAP) {
387 } else if (s & STAIRS) {
389 } else if (s & TUNNEL) {
394 if ((!(s & MONSTER)) || (och == ' ')) {
400 if (monster = object_at(&level_monsters, i, j)) {
401 monster->trail_char = ch;
410 dr_course(monster, entering, row, col)
421 if (mon_sees(monster, rogue.row, rogue.col)) {
422 monster->trow = NO_ROOM;
425 rn = get_room_number(row, col);
427 if (entering) { /* entering room */
428 /* look for door to some other room */
429 r = get_rand(0, MAXROOMS-1);
430 for (i = 0; i < MAXROOMS; i++) {
431 rr = (r + i) % MAXROOMS;
432 if ((!(rooms[rr].is_room & (R_ROOM | R_MAZE))) || (rr == rn)) {
435 for (k = 0; k < 4; k++) {
436 if (rooms[rr].doors[k].oth_room == rn) {
437 monster->trow = rooms[rr].doors[k].oth_row;
438 monster->tcol = rooms[rr].doors[k].oth_col;
439 if ((monster->trow == row) &&
440 (monster->tcol == col)) {
447 /* look for door to dead end */
448 for (i = rooms[rn].top_row; i <= rooms[rn].bottom_row; i++) {
449 for (j = rooms[rn].left_col; j <= rooms[rn].right_col; j++) {
450 if ((i != monster->row) && (j != monster->col) &&
451 (dungeon[i][j] & DOOR)) {
458 /* return monster to room that he came from */
459 for (i = 0; i < MAXROOMS; i++) {
460 for (j = 0; j < 4; j++) {
461 if (rooms[i].doors[j].oth_room == rn) {
462 for (k = 0; k < 4; k++) {
463 if (rooms[rn].doors[k].oth_room == i) {
464 monster->trow = rooms[rn].doors[k].oth_row;
465 monster->tcol = rooms[rn].doors[k].oth_col;
472 /* no place to send monster */
473 monster->trow = NO_ROOM;
474 } else { /* exiting room */
475 if (!get_oth_room(rn, &row, &col)) {
476 monster->trow = NO_ROOM;
484 get_oth_room(rn, row, col)
485 short rn, *row, *col;
489 if (*row == rooms[rn].top_row) {
491 } else if (*row == rooms[rn].bottom_row) {
493 } else if (*col == rooms[rn].left_col) {
495 } else if (*col == rooms[rn].right_col) {
498 if ((d != -1) && (rooms[rn].doors[d].oth_room >= 0)) {
499 *row = rooms[rn].doors[d].oth_row;
500 *col = rooms[rn].doors[d].oth_col;
508 char save[NOPTS+1][DCOLS];
512 char buf[MAX_OPT_LEN + 2];
514 for (i = 0; i < NOPTS+1; i++) {
515 for (j = 0; j < DCOLS; j++) {
516 save[i][j] = mvinch(i, j);
535 if (i == (NOPTS - 1)) {
536 mvaddstr(NOPTS, 0, press_space);
556 if (options[i].is_bool) {
557 *(options[i].bval) = (((ch == 't') || (ch == 'T')) ? 1 : 0);
563 if (options[i].is_bool) {
568 if ((ch == '\010') || ((ch >= ' ') && (ch <= '~'))) {
571 if ((ch >= ' ') && (ch <= '~') && (j < MAX_OPT_LEN)) {
575 } else if ((ch == '\010') && (j > 0)) {
577 move(i, j + strlen(options[i].prompt));
579 move(i, j + strlen(options[i].prompt));
583 } while ((ch != '\012') && (ch != '\015') && (ch != '\033'));
585 (void) strcpy(*(options[i].strval), buf);
596 for (i = 0; i < NOPTS+1; i++) {
598 for (j = 0; j < DCOLS; j++) {
608 struct option *opt = &options[i];
613 s = *(opt->bval) ? "True" : "False";
623 struct option *opt = &options[i];
625 mvaddstr(i, 0, opt->prompt);
632 move(i, strlen(options[i].prompt));
641 if (!(sh = md_getenv("SHELL"))) {
647 printf("\nCreating new shell...\n");