rogue/ring.c

   1 /*
   2  * Copyright (c) 1988 The Regents of the University of California.
   3  * All rights reserved.
   4  *
   5  * This code is derived from software contributed to Berkeley by
   6  * Timothy C. Stoehr.
   7  *
   8  * Redistribution and use in source and binary forms, with or without
   9  * modification, are permitted provided that the following conditions
  10  * are met:
  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.
  23  *
  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
  34  * SUCH DAMAGE.
  35  */
  36
  37 #ifndef lint
  38 /*static char sccsid[] = "from: @(#)ring.c      5.3 (Berkeley) 6/1/90";*/
  39 static char rcsid[] = "$Id: ring.c,v 1.2 1993/08/01 18:52:17 mycroft Exp $";
  40 #endif /* not lint */
  41
  42 /*
  43  * ring.c
  44  *
  45  * This source herein may be modified and/or distributed by anybody who
  46  * so desires, with the following restrictions:
  47  *    1.)  No portion of this notice shall be removed.
  48  *    2.)  Credit shall not be taken for the creation of this source.
  49  *    3.)  This code is not to be traded, sold, or used for personal
  50  *         gain or profit.
  51  *
  52  */
  53
  54 #include "rogue.h"
  55
  56 char *left_or_right = "left or right hand?";
  57 char *no_ring = "there's no ring on that hand";
  58 short stealthy;
  59 short r_rings;
  60 short add_strength;
  61 short e_rings;
  62 short regeneration;
  63 short ring_exp;
  64 short auto_search;
  65 boolean r_teleport;
  66 boolean r_see_invisible;
  67 boolean sustain_strength;
  68 boolean maintain_armor;
  69
  70 extern char *curse_message;
  71 extern boolean wizard;
  72
  73 put_on_ring()
  74 {
  75         short ch;
  76         char desc[DCOLS];
  77         object *ring;
  78
  79         if (r_rings == 2) {
  80                 message("wearing two rings already", 0);
  81                 return;
  82         }
  83         if ((ch = pack_letter("put on what?", RING)) == CANCEL) {
  84                 return;
  85         }
  86         if (!(ring = get_letter_object(ch))) {
  87                 message("no such item.", 0);
  88                 return;
  89         }
  90         if (!(ring->what_is & RING)) {
  91                 message("that's not a ring", 0);
  92                 return;
  93         }
  94         if (ring->in_use_flags & (ON_LEFT_HAND | ON_RIGHT_HAND)) {
  95                 message("that ring is already being worn", 0);
  96                 return;
  97         }
  98         if (r_rings == 1) {
  99                 ch = (rogue.left_ring ? 'r' : 'l');
 100         } else {
 101                 message(left_or_right, 0);
 102                 do {
 103                         ch = rgetchar();
 104                 } while ((ch != CANCEL) && (ch != 'l') && (ch != 'r') && (ch != '\n') &&
 105                                 (ch != '\r'));
 106         }
 107         if ((ch != 'l') && (ch != 'r')) {
 108                 check_message();
 109                 return;
 110         }
 111         if (((ch == 'l') && rogue.left_ring)||((ch == 'r') && rogue.right_ring)) {
 112                 check_message();
 113                 message("there's already a ring on that hand", 0);
 114                 return;
 115         }
 116         if (ch == 'l') {
 117                 do_put_on(ring, 1);
 118         } else {
 119                 do_put_on(ring, 0);
 120         }
 121         ring_stats(1);
 122         check_message();
 123         get_desc(ring, desc);
 124         message(desc, 0);
 125         (void) reg_move();
 126 }
 127
 128 /*
 129  * Do not call ring_stats() from within do_put_on().  It will cause
 130  * serious problems when do_put_on() is called from read_pack() in restore().
 131  */
 132
 133 do_put_on(ring, on_left)
 134 object *ring;
 135 boolean on_left;
 136 {
 137         if (on_left) {
 138                 ring->in_use_flags |= ON_LEFT_HAND;
 139                 rogue.left_ring = ring;
 140         } else {
 141                 ring->in_use_flags |= ON_RIGHT_HAND;
 142                 rogue.right_ring = ring;
 143         }
 144 }
 145
 146 remove_ring()
 147 {
 148         boolean left = 0, right = 0;
 149         short ch;
 150         char buf[DCOLS];
 151         object *ring;
 152
 153         if (r_rings == 0) {
 154                 inv_rings();
 155         } else if (rogue.left_ring && !rogue.right_ring) {
 156                 left = 1;
 157         } else if (!rogue.left_ring && rogue.right_ring) {
 158                 right = 1;
 159         } else {
 160                 message(left_or_right, 0);
 161                 do {
 162                         ch = rgetchar();
 163                 } while ((ch != CANCEL) && (ch != 'l') && (ch != 'r') &&
 164                         (ch != '\n') && (ch != '\r'));
 165                 left = (ch == 'l');
 166                 right = (ch == 'r');
 167                 check_message();
 168         }
 169         if (left || right) {
 170                 if (left) {
 171                         if (rogue.left_ring) {
 172                                 ring = rogue.left_ring;
 173                         } else {
 174                                 message(no_ring, 0);
 175                         }
 176                 } else {
 177                         if (rogue.right_ring) {
 178                                 ring = rogue.right_ring;
 179                         } else {
 180                                 message(no_ring, 0);
 181                         }
 182                 }
 183                 if (ring->is_cursed) {
 184                         message(curse_message, 0);
 185                 } else {
 186                         un_put_on(ring);
 187                         (void) strcpy(buf, "removed ");
 188                         get_desc(ring, buf + 8);
 189                         message(buf, 0);
 190                         (void) reg_move();
 191                 }
 192         }
 193 }
 194
 195 un_put_on(ring)
 196 object *ring;
 197 {
 198         if (ring && (ring->in_use_flags & ON_LEFT_HAND)) {
 199                 ring->in_use_flags &= (~ON_LEFT_HAND);
 200                 rogue.left_ring = 0;
 201         } else if (ring && (ring->in_use_flags & ON_RIGHT_HAND)) {
 202                 ring->in_use_flags &= (~ON_RIGHT_HAND);
 203                 rogue.right_ring = 0;
 204         }
 205         ring_stats(1);
 206 }
 207
 208 gr_ring(ring, assign_wk)
 209 object *ring;
 210 boolean assign_wk;
 211 {
 212         ring->what_is = RING;
 213         if (assign_wk) {
 214                 ring->which_kind = get_rand(0, (RINGS - 1));
 215         }
 216         ring->class = 0;
 217
 218         switch(ring->which_kind) {
 219         /*
 220         case STEALTH:
 221                 break;
 222         case SLOW_DIGEST:
 223                 break;
 224         case REGENERATION:
 225                 break;
 226         case R_SEE_INVISIBLE:
 227                 break;
 228         case SUSTAIN_STRENGTH:
 229                 break;
 230         case R_MAINTAIN_ARMOR:
 231                 break;
 232         case SEARCHING:
 233                 break;
 234         */
 235         case R_TELEPORT:
 236                 ring->is_cursed = 1;
 237                 break;
 238         case ADD_STRENGTH:
 239         case DEXTERITY:
 240                 while ((ring->class = (get_rand(0, 4) - 2)) == 0) ;
 241                 ring->is_cursed = (ring->class < 0);
 242                 break;
 243         case ADORNMENT:
 244                 ring->is_cursed = coin_toss();
 245                 break;
 246         }
 247 }
 248
 249 inv_rings()
 250 {
 251         char buf[DCOLS];
 252
 253         if (r_rings == 0) {
 254                 message("not wearing any rings", 0);
 255         } else {
 256                 if (rogue.left_ring) {
 257                         get_desc(rogue.left_ring, buf);
 258                         message(buf, 0);
 259                 }
 260                 if (rogue.right_ring) {
 261                         get_desc(rogue.right_ring, buf);
 262                         message(buf, 0);
 263                 }
 264         }
 265         if (wizard) {
 266                 sprintf(buf, "ste %d, r_r %d, e_r %d, r_t %d, s_s %d, a_s %d, reg %d, r_e %d, s_i %d, m_a %d, aus %d",
 267                         stealthy, r_rings, e_rings, r_teleport, sustain_strength,
 268                         add_strength, regeneration, ring_exp, r_see_invisible,
 269                         maintain_armor, auto_search);
 270                 message(buf, 0);
 271         }
 272 }
 273
 274 ring_stats(pr)
 275 boolean pr;
 276 {
 277         short i;
 278         object *ring;
 279
 280         stealthy = 0;
 281         r_rings = 0;
 282         e_rings = 0;
 283         r_teleport = 0;
 284         sustain_strength = 0;
 285         add_strength = 0;
 286         regeneration = 0;
 287         ring_exp = 0;
 288         r_see_invisible = 0;
 289         maintain_armor = 0;
 290         auto_search = 0;
 291
 292         for (i = 0; i < 2; i++) {
 293                 if (!(ring = ((i == 0) ? rogue.left_ring : rogue.right_ring))) {
 294                         continue;
 295                 }
 296                 r_rings++;
 297                 e_rings++;
 298                 switch(ring->which_kind) {
 299                 case STEALTH:
 300                         stealthy++;
 301                         break;
 302                 case R_TELEPORT:
 303                         r_teleport = 1;
 304                         break;
 305                 case REGENERATION:
 306                         regeneration++;
 307                         break;
 308                 case SLOW_DIGEST:
 309                         e_rings -= 2;
 310                         break;
 311                 case ADD_STRENGTH:
 312                         add_strength += ring->class;
 313                         break;
 314                 case SUSTAIN_STRENGTH:
 315                         sustain_strength = 1;
 316                         break;
 317                 case DEXTERITY:
 318                         ring_exp += ring->class;
 319                         break;
 320                 case ADORNMENT:
 321                         break;
 322                 case R_SEE_INVISIBLE:
 323                         r_see_invisible = 1;
 324                         break;
 325                 case MAINTAIN_ARMOR:
 326                         maintain_armor = 1;
 327                         break;
 328                 case SEARCHING:
 329                         auto_search += 2;
 330                         break;
 331                 }
 332         }
 333         if (pr) {
 334                 print_stats(STAT_STRENGTH);
 335                 relight();
 336         }
 337 }