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 * @(#)move.c 8.1 (Berkeley) 5/31/93
37 * $FreeBSD: src/games/rogue/move.c,v 1.7 1999/11/30 03:49:24 billf Exp $
38 * $DragonFly: src/games/rogue/move.c,v 1.3 2003/08/26 23:52:50 drhodus 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
57 const char *you_can_move_again = "you can move again";
59 extern short cur_room, halluc, blind, levitate;
60 extern short cur_level, max_level;
61 extern short bear_trap, haste_self, confused;
62 extern short e_rings, regeneration, auto_search;
63 extern boolean being_held, interrupted, r_teleport, passgo;
65 one_move_rogue(dirch, pickup)
79 (void) is_direction(dirch, &d);
80 get_dir_rc(d, &row, &col, 1);
82 if (!can_move(rogue.row, rogue.col, row, col)) {
85 if (being_held || bear_trap) {
86 if (!(dungeon[row][col] & MONSTER)) {
88 message("you are being held", 1);
90 message("you are still stuck in the bear trap", 0);
97 if (rand_percent(R_TELE_PERCENT)) {
99 return(STOPPED_ON_SOMETHING);
102 if (dungeon[row][col] & MONSTER) {
103 rogue_hit(object_at(&level_monsters, row, col), 0);
107 if (dungeon[row][col] & DOOR) {
108 if (cur_room == PASSAGE) {
109 cur_room = get_room_number(row, col);
110 light_up_room(cur_room);
111 wake_room(cur_room, 1, row, col);
113 light_passage(row, col);
115 } else if ((dungeon[rogue.row][rogue.col] & DOOR) &&
116 (dungeon[row][col] & TUNNEL)) {
117 light_passage(row, col);
118 wake_room(cur_room, 0, rogue.row, rogue.col);
119 darken_room(cur_room);
121 } else if (dungeon[row][col] & TUNNEL) {
122 light_passage(row, col);
124 mvaddch(rogue.row, rogue.col, get_dungeon_char(rogue.row, rogue.col));
125 mvaddch(row, col, rogue.fchar);
132 if (dungeon[row][col] & OBJECT) {
133 if (levitate && pickup) {
134 return(STOPPED_ON_SOMETHING);
136 if (pickup && !levitate) {
137 if (obj = pick_up(row, col, &status)) {
139 if (obj->what_is == GOLD) {
143 } else if (!status) {
150 obj = object_at(&level_objects, row, col);
151 (void) strcpy(desc, "moved onto ");
152 get_desc(obj, desc+11);
157 desc[n+1] = obj->ichar;
163 return(STOPPED_ON_SOMETHING);
165 if (dungeon[row][col] & (DOOR | STAIRS | TRAP)) {
166 if ((!levitate) && (dungeon[row][col] & TRAP)) {
167 trap_player(row, col);
170 return(STOPPED_ON_SOMETHING);
172 MVED: if (reg_move()) { /* fainted from hunger */
173 return(STOPPED_ON_SOMETHING);
175 return((confused ? STOPPED_ON_SOMETHING : MOVED));
178 multiple_move_rogue(dirch)
196 if (((m = one_move_rogue((dirch + 96), 1)) == MOVE_FAILED) ||
197 (m == STOPPED_ON_SOMETHING) ||
201 } while (!next_to_something(row, col));
202 if ( (!interrupted) && passgo && (m == MOVE_FAILED) &&
203 (dungeon[rogue.row][rogue.col] & TUNNEL)) {
204 turn_passage(dirch + 96, 0);
215 while ((!interrupted) && (one_move_rogue((dirch + 32), 1) == MOVED)) ;
217 if ( (!interrupted) && passgo &&
218 (dungeon[rogue.row][rogue.col] & TUNNEL)) {
219 turn_passage(dirch + 32, 1);
225 is_passable(row, col)
228 if ((row < MIN_ROW) || (row > (DROWS - 2)) || (col < 0) ||
232 if (dungeon[row][col] & HIDDEN) {
233 return((dungeon[row][col] & TRAP) ? 1 : 0);
235 return(dungeon[row][col] & (FLOOR | TUNNEL | DOOR | STAIRS | TRAP));
238 next_to_something(drow, dcol)
241 short i, j, i_end, j_end, row, col;
242 short pass_count = 0;
251 i_end = (rogue.row < (DROWS-2)) ? 1 : 0;
252 j_end = (rogue.col < (DCOLS-1)) ? 1 : 0;
254 for (i = ((rogue.row > MIN_ROW) ? -1 : 0); i <= i_end; i++) {
255 for (j = ((rogue.col > 0) ? -1 : 0); j <= j_end; j++) {
256 if ((i == 0) && (j == 0)) {
259 if (((rogue.row+i) == drow) && ((rogue.col+j) == dcol)) {
264 s = dungeon[row][col];
268 /* If the rogue used to be right, up, left, down, or right of
269 * row,col, and now isn't, then don't stop */
270 if (s & (MONSTER | OBJECT | STAIRS)) {
271 if (((row == drow) || (col == dcol)) &&
272 (!((row == rogue.row) || (col == rogue.col)))) {
279 if (((row == drow) || (col == dcol)) &&
280 (!((row == rogue.row) || (col == rogue.col)))) {
286 if ((((i - j) == 1) || ((i - j) == -1)) && (s & TUNNEL)) {
287 if (++pass_count > 1) {
291 if ((s & DOOR) && ((i == 0) || (j == 0))) {
299 can_move(row1, col1, row2, col2)
301 if (!is_passable(row2, col2)) {
304 if ((row1 != row2) && (col1 != col2)) {
305 if ((dungeon[row1][col1] & DOOR) || (dungeon[row2][col2] & DOOR)) {
308 if ((!dungeon[row1][col2]) || (!dungeon[row2][col1])) {
318 boolean first_miss = 1;
320 while (!is_direction(ch = rgetchar(), &d)) {
323 message("direction? ", 0);
329 (void) one_move_rogue(ch, 0);
372 check_hunger(msg_only)
378 if (rogue.moves_left == HUNGRY) {
379 (void) strcpy(hunger_str, "hungry");
380 message(hunger_str, 0);
381 print_stats(STAT_HUNGER);
383 if (rogue.moves_left == WEAK) {
384 (void) strcpy(hunger_str, "weak");
385 message(hunger_str, 1);
386 print_stats(STAT_HUNGER);
388 if (rogue.moves_left <= FAINT) {
389 if (rogue.moves_left == FAINT) {
390 (void) strcpy(hunger_str, "faint");
391 message(hunger_str, 1);
392 print_stats(STAT_HUNGER);
394 n = get_rand(0, (FAINT - rogue.moves_left));
397 if (rand_percent(40)) {
400 message("you faint", 1);
401 for (i = 0; i < n; i++) {
406 message(you_can_move_again, 1);
412 if (rogue.moves_left <= STARVE) {
413 killed_by((object *) 0, STARVATION);
418 Subtract 0, i.e. do nothing.
421 rogue.moves_left -= (rogue.moves_left % 2);
428 (void) check_hunger(1);
429 rogue.moves_left -= (rogue.moves_left % 2);
433 (void) check_hunger(1);
445 if ((rogue.moves_left <= HUNGRY) || (cur_level >= max_level)) {
446 fainted = check_hunger(0);
453 if (++m_moves >= 120) {
479 message("you float gently to the ground", 1);
480 if (dungeon[rogue.row][rogue.col] & TRAP) {
481 trap_player(rogue.row, rogue.col);
486 if (!(--haste_self)) {
487 message("you feel yourself slowing down", 0);
491 if (auto_search > 0) {
492 search(auto_search, auto_search);
503 for (i = 0; i < count; i++) {
548 static short heal_exp = -1, n, c = 0;
551 if (rogue.hp_current == rogue.hp_max) {
555 if (rogue.exp != heal_exp) {
556 heal_exp = rogue.exp;
603 if ((rogue.hp_current += regeneration) > rogue.hp_max) {
604 rogue.hp_current = rogue.hp_max;
606 print_stats(STAT_HP);
614 if ((dungeon[nrow][ncol] & TUNNEL) && is_passable(nrow, ncol)) {
620 turn_passage(dir, fast)
624 short crow = rogue.row, ccol = rogue.col, turns = 0;
627 if ((dir != 'h') && can_turn(crow, ccol + 1)) {
631 if ((dir != 'l') && can_turn(crow, ccol - 1)) {
635 if ((dir != 'k') && can_turn(crow + 1, ccol)) {
639 if ((dir != 'j') && can_turn(crow - 1, ccol)) {
644 multiple_move_rogue(ndir - (fast ? 32 : 96));