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
36 * @(#)trap.c 8.1 (Berkeley) 5/31/93
37 * $FreeBSD: src/games/rogue/trap.c,v 1.6 1999/11/30 03:49:28 billf Exp $
38 * $DragonFly: src/games/rogue/trap.c,v 1.2 2003/06/17 04:25:25 dillon Exp $
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
55 trap traps[MAX_TRAPS];
56 boolean trap_door = 0;
59 const char *const trap_strings[TRAPS * 2] = {
61 "you fell down a trap",
63 "you are caught in a bear trap",
67 "a small dart just hit you in the shoulder",
69 "a strange white mist envelops you and you fall asleep",
71 "a gush of water hits you on the head"
74 extern short cur_level, party_room;
75 extern const char *new_level_message;
76 extern boolean interrupted;
77 extern short ring_exp;
78 extern boolean sustain_strength;
86 for (i = 0; ((i < MAX_TRAPS) && (traps[i].trap_type != NO_TRAP)); i++) {
87 if ((traps[i].trap_row == row) && (traps[i].trap_col == col)) {
88 return(traps[i].trap_type);
99 if ((t = trap_at(row, col)) == NO_TRAP) {
102 dungeon[row][col] &= (~HIDDEN);
103 if (rand_percent(rogue.exp + ring_exp)) {
104 message("the trap failed", 1);
110 new_level_message = trap_strings[(t*2)+1];
113 message(trap_strings[(t*2)+1], 1);
114 bear_trap = get_rand(4, 7);
117 mvaddch(rogue.row, rogue.col, '^');
121 message(trap_strings[(t*2)+1], 1);
122 rogue.hp_current -= get_damage("1d6", 1);
123 if (rogue.hp_current <= 0) {
124 rogue.hp_current = 0;
126 if ((!sustain_strength) && rand_percent(40) &&
127 (rogue.str_current >= 3)) {
130 print_stats(STAT_HP | STAT_STRENGTH);
131 if (rogue.hp_current <= 0) {
132 killed_by((object *) 0, POISON_DART);
135 case SLEEPING_GAS_TRAP:
136 message(trap_strings[(t*2)+1], 1);
140 message(trap_strings[(t*2)+1], 1);
148 short i, n, tries = 0;
151 if (cur_level <= 2) {
153 } else if (cur_level <= 7) {
155 } else if (cur_level <= 11) {
157 } else if (cur_level <= 16) {
159 } else if (cur_level <= 21) {
161 } else if (cur_level <= (AMULET_LEVEL + 2)) {
164 n = get_rand(5, MAX_TRAPS);
166 for (i = 0; i < n; i++) {
167 traps[i].trap_type = get_rand(0, (TRAPS - 1));
169 if ((i == 0) && (party_room != NO_ROOM)) {
171 row = get_rand((rooms[party_room].top_row+1),
172 (rooms[party_room].bottom_row-1));
173 col = get_rand((rooms[party_room].left_col+1),
174 (rooms[party_room].right_col-1));
176 } while (((dungeon[row][col] & (OBJECT|STAIRS|TRAP|TUNNEL)) ||
177 (dungeon[row][col] == NOTHING)) && (tries < 15));
179 gr_row_col(&row, &col, (FLOOR | MONSTER));
182 gr_row_col(&row, &col, (FLOOR | MONSTER));
184 traps[i].trap_row = row;
185 traps[i].trap_col = col;
186 dungeon[row][col] |= (TRAP | HIDDEN);
192 short dir, row, col, d, t;
194 message("direction? ", 0);
196 while (!is_direction(dir = rgetchar(), &d)) {
207 get_dir_rc(d, &row, &col, 0);
209 if ((dungeon[row][col] & TRAP) && (!(dungeon[row][col] & HIDDEN))) {
210 t = trap_at(row, col);
211 message(trap_strings[t*2], 0);
213 message("no trap there", 0);
221 for (i = 0; i < DROWS; i++) {
222 for (j = 0; j < DCOLS; j++) {
223 if (dungeon[i][j] & TRAP) {
234 short s, i, j, row, col, t;
235 short shown = 0, found = 0;
236 static boolean reg_search;
238 for (i = -1; i <= 1; i++) {
239 for (j = -1; j <= 1; j++) {
242 if ((row < MIN_ROW) || (row >= (DROWS-1)) ||
243 (col < 0) || (col >= DCOLS)) {
246 if (dungeon[row][col] & HIDDEN) {
251 for (s = 0; s < n; s++) {
252 for (i = -1; i <= 1; i++) {
253 for (j = -1; j <= 1; j++) {
255 col = rogue.col + j ;
256 if ((row < MIN_ROW) || (row >= (DROWS-1)) ||
257 (col < 0) || (col >= DCOLS)) {
260 if (dungeon[row][col] & HIDDEN) {
261 if (rand_percent(17 + (rogue.exp + ring_exp))) {
262 dungeon[row][col] &= (~HIDDEN);
263 if ((!blind) && ((row != rogue.row) ||
264 (col != rogue.col))) {
265 mvaddch(row, col, get_dungeon_char(row, col));
268 if (dungeon[row][col] & TRAP) {
269 t = trap_at(row, col);
270 message(trap_strings[t*2], 1);
274 if (((shown == found) && (found > 0)) || interrupted) {
279 if ((!is_auto) && (reg_search = !reg_search)) {