rogue/throw.c

   1 /*      $NetBSD: throw.c,v 1.8 2007/12/27 23:53:01 dholland Exp $       */
   2
   3 /*
   4  * Copyright (c) 1988, 1993
   5  *      The Regents of the University of California.  All rights reserved.
   6  *
   7  * This code is derived from software contributed to Berkeley by
   8  * Timothy C. Stoehr.
   9  *
  10  * Redistribution and use in source and binary forms, with or without
  11  * modification, are permitted provided that the following conditions
  12  * are met:
  13  * 1. Redistributions of source code must retain the above copyright
  14  *    notice, this list of conditions and the following disclaimer.
  15  * 2. 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  * 3. Neither the name of the University nor the names of its contributors
  19  *    may be used to endorse or promote products derived from this software
  20  *    without specific prior written permission.
  21  *
  22  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  23  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  24  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  25  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  26  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  27  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  28  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  29  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  30  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  31  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  32  * SUCH DAMAGE.
  33  */
  34
  35 #include <sys/cdefs.h>
  36 #ifndef lint
  37 #if 0
  38 static char sccsid[] = "@(#)throw.c     8.1 (Berkeley) 5/31/93";
  39 #else
  40 __RCSID("$NetBSD: throw.c,v 1.8 2007/12/27 23:53:01 dholland Exp $");
  41 #endif
  42 #endif /* not lint */
  43
  44 /*
  45  * throw.c
  46  *
  47  * This source herein may be modified and/or distributed by anybody who
  48  * so desires, with the following restrictions:
  49  *    1.)  No portion of this notice shall be removed.
  50  *    2.)  Credit shall not be taken for the creation of this source.
  51  *    3.)  This code is not to be traded, sold, or used for personal
  52  *         gain or profit.
  53  *
  54  */
  55
  56 #include "rogue.h"
  57
  58 void
  59 throw()
  60 {
  61         short wch, d;
  62         boolean first_miss = 1;
  63         object *weapon;
  64         short dir, row, col;
  65         object *monster;
  66
  67         while (!is_direction(dir = rgetchar(), &d)) {
  68                 sound_bell();
  69                 if (first_miss) {
  70                         messagef(0, "direction? ");
  71                         first_miss = 0;
  72                 }
  73         }
  74         check_message();
  75         if (dir == CANCEL) {
  76                 return;
  77         }
  78         if ((wch = pack_letter("throw what?", WEAPON)) == CANCEL) {
  79                 return;
  80         }
  81         check_message();
  82
  83         if (!(weapon = get_letter_object(wch))) {
  84                 messagef(0, "no such item.");
  85                 return;
  86         }
  87         if ((weapon->in_use_flags & BEING_USED) && weapon->is_cursed) {
  88                 messagef(0, curse_message);
  89                 return;
  90         }
  91         row = rogue.row; col = rogue.col;
  92
  93         if ((weapon->in_use_flags & BEING_WIELDED) && (weapon->quantity <= 1)) {
  94                 unwield(rogue.weapon);
  95         } else if (weapon->in_use_flags & BEING_WORN) {
  96                 mv_aquatars();
  97                 unwear(rogue.armor);
  98                 print_stats(STAT_ARMOR);
  99         } else if (weapon->in_use_flags & ON_EITHER_HAND) {
 100                 un_put_on(weapon);
 101         }
 102         monster = get_thrown_at_monster(weapon, d, &row, &col);
 103         mvaddch(rogue.row, rogue.col, rogue.fchar);
 104         refresh();
 105
 106         if (rogue_can_see(row, col) && ((row != rogue.row) || (col != rogue.col))){
 107                 mvaddch(row, col, get_dungeon_char(row, col));
 108         }
 109         if (monster) {
 110                 wake_up(monster);
 111                 check_gold_seeker(monster);
 112
 113                 if (!throw_at_monster(monster, weapon)) {
 114                         flop_weapon(weapon, row, col);
 115                 }
 116         } else {
 117                 flop_weapon(weapon, row, col);
 118         }
 119         vanish(weapon, 1, &rogue.pack);
 120 }
 121
 122 boolean
 123 throw_at_monster(monster, weapon)
 124         object *monster, *weapon;
 125 {
 126         short damage, hit_chance;
 127         short t;
 128
 129         hit_chance = get_hit_chance(weapon);
 130         damage = get_weapon_damage(weapon);
 131         if ((weapon->which_kind == ARROW) &&
 132                 (rogue.weapon && (rogue.weapon->which_kind == BOW))) {
 133                 damage += get_weapon_damage(rogue.weapon);
 134                 damage = ((damage * 2) / 3);
 135                 hit_chance += (hit_chance / 3);
 136         } else if ((weapon->in_use_flags & BEING_WIELDED) &&
 137                 ((weapon->which_kind == DAGGER) ||
 138                 (weapon->which_kind == SHURIKEN) ||
 139                 (weapon->which_kind == DART))) {
 140                 damage = ((damage * 3) / 2);
 141                 hit_chance += (hit_chance / 3);
 142         }
 143         t = weapon->quantity;
 144         weapon->quantity = 1;
 145         snprintf(hit_message, HIT_MESSAGE_SIZE, "the %s", name_of(weapon));
 146         weapon->quantity = t;
 147
 148         if (!rand_percent(hit_chance)) {
 149                 (void) strlcat(hit_message, "misses  ", HIT_MESSAGE_SIZE);
 150                 return(0);
 151         }
 152         s_con_mon(monster);
 153         (void) strlcat(hit_message, "hit  ", HIT_MESSAGE_SIZE);
 154         (void) mon_damage(monster, damage);
 155         return(1);
 156 }
 157
 158 object *
 159 get_thrown_at_monster(obj, dir, row, col)
 160         object *obj;
 161         short dir;
 162         short *row, *col;
 163 {
 164         short orow, ocol;
 165         short i, ch;
 166
 167         orow = *row; ocol = *col;
 168
 169         ch = get_mask_char(obj->what_is);
 170
 171         for (i = 0; i < 24; i++) {
 172                 get_dir_rc(dir, row, col, 0);
 173                 if (    (((*col <= 0) || (*col >= DCOLS-1)) ||
 174                                 (dungeon[*row][*col] == NOTHING)) ||
 175                                 ((dungeon[*row][*col] & (HORWALL | VERTWALL | HIDDEN)) &&
 176                                         (!(dungeon[*row][*col] & TRAP)))) {
 177                         *row = orow;
 178                         *col = ocol;
 179                         return(0);
 180                 }
 181                 if ((i != 0) && rogue_can_see(orow, ocol)) {
 182                         mvaddch(orow, ocol, get_dungeon_char(orow, ocol));
 183                 }
 184                 if (rogue_can_see(*row, *col)) {
 185                         if (!(dungeon[*row][*col] & MONSTER)) {
 186                                 mvaddch(*row, *col, ch);
 187                         }
 188                         refresh();
 189                 }
 190                 orow = *row; ocol = *col;
 191                 if (dungeon[*row][*col] & MONSTER) {
 192                         if (!imitating(*row, *col)) {
 193                                 return(object_at(&level_monsters, *row, *col));
 194                         }
 195                 }
 196                 if (dungeon[*row][*col] & TUNNEL) {
 197                         i += 2;
 198                 }
 199         }
 200         return(0);
 201 }
 202
 203 void
 204 flop_weapon(weapon, row, col)
 205         object *weapon;
 206         short row, col;
 207 {
 208         object *new_weapon, *monster;
 209         short i = 0;
 210         boolean found = 0;
 211         short mch, dch;
 212         unsigned short mon;
 213
 214         if ((row < 0) || (row >= DROWS) || (col < 0) || (col >= DCOLS))
 215                 clean_up("flop_weapon:  weapon landed outside of dungeon");
 216
 217         while ((i < 9) && dungeon[row][col] & ~(FLOOR | TUNNEL | DOOR | MONSTER)) {
 218                 rand_around(i++, &row, &col);
 219                 if ((row > (DROWS-2)) || (row < MIN_ROW) ||
 220                         (col > (DCOLS-1)) || (col < 0) || (!dungeon[row][col]) ||
 221                         (dungeon[row][col] & ~(FLOOR | TUNNEL | DOOR | MONSTER))) {
 222                         continue;
 223                 }
 224                 found = 1;
 225                 break;
 226         }
 227
 228         if (found || (i == 0)) {
 229                 new_weapon = alloc_object();
 230                 *new_weapon = *weapon;
 231                 new_weapon->in_use_flags = NOT_USED;
 232                 new_weapon->quantity = 1;
 233                 new_weapon->ichar = 'L';
 234                 place_at(new_weapon, row, col);
 235                 if (rogue_can_see(row, col) &&
 236                                 ((row != rogue.row) || (col != rogue.col))) {
 237                         mon = dungeon[row][col] & MONSTER;
 238                         dungeon[row][col] &= (~MONSTER);
 239                         dch = get_dungeon_char(row, col);
 240                         if (mon) {
 241                                 mch = mvinch(row, col);
 242                                 if ((monster = object_at(&level_monsters,
 243                                     row, col)) != NULL) {
 244                                         monster->trail_char = dch;
 245                                 }
 246                                 if ((mch < 'A') || (mch > 'Z')) {
 247                                         mvaddch(row, col, dch);
 248                                 }
 249                         } else {
 250                                 mvaddch(row, col, dch);
 251                         }
 252                         dungeon[row][col] |= mon;
 253                 }
 254         } else {
 255                 short t;
 256
 257                 t = weapon->quantity;
 258                 weapon->quantity = 1;
 259                 messagef(0, "the %svanishes as it hits the ground",
 260                         name_of(weapon));
 261                 weapon->quantity = t;
 262         }
 263 }
 264
 265 void
 266 rand_around(i, r, c)
 267         short i, *r, *c;
 268 {
 269         static char pos[] = "\010\007\001\003\004\005\002\006\0";
 270         static short row, col;
 271         short j;
 272
 273         if (i == 0) {
 274                 short x, y, o, t;
 275
 276                 row = *r;
 277                 col = *c;
 278
 279                 o = get_rand(1, 8);
 280
 281                 for (j = 0; j < 5; j++) {
 282                         x = get_rand(0, 8);
 283                         y = (x + o) % 9;
 284                         t = pos[x];
 285                         pos[x] = pos[y];
 286                         pos[y] = t;
 287                 }
 288         }
 289         switch((short)pos[i]) {
 290         case 0:
 291                 *r = row + 1;
 292                 *c = col + 1;
 293                 break;
 294         case 1:
 295                 *r = row + 1;
 296                 *c = col - 1;
 297                 break;
 298         case 2:
 299                 *r = row - 1;
 300                 *c = col + 1;
 301                 break;
 302         case 3:
 303                 *r = row - 1;
 304                 *c = col - 1;
 305                 break;
 306         case 4:
 307                 *r = row;
 308                 *c = col + 1;
 309                 break;
 310         case 5:
 311                 *r = row + 1;
 312                 *c = col;
 313                 break;
 314         case 6:
 315                 *r = row;
 316                 *c = col;
 317                 break;
 318         case 7:
 319                 *r = row - 1;
 320                 *c = col;
 321                 break;
 322         case 8:
 323                 *r = row;
 324                 *c = col - 1;
 325                 break;
 326         }
 327 }