Home | History | Annotate | Line # | Download | only in rogue
ring.c revision 1.7
      1 /*	$NetBSD: ring.c,v 1.7 2007/12/27 23:53:00 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[] = "@(#)ring.c	8.1 (Berkeley) 5/31/93";
     39 #else
     40 __RCSID("$NetBSD: ring.c,v 1.7 2007/12/27 23:53:00 dholland Exp $");
     41 #endif
     42 #endif /* not lint */
     43 
     44 /*
     45  * ring.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 const char *left_or_right = "left or right hand?";
     59 const char *no_ring = "there's no ring on that hand";
     60 short stealthy;
     61 short r_rings;
     62 short add_strength;
     63 short e_rings;
     64 short regeneration;
     65 short ring_exp;
     66 short auto_search;
     67 boolean r_teleport;
     68 boolean r_see_invisible;
     69 boolean sustain_strength;
     70 boolean maintain_armor;
     71 
     72 void
     73 put_on_ring()
     74 {
     75 	short ch;
     76 	char desc[DCOLS];
     77 	object *ring;
     78 
     79 	if (r_rings == 2) {
     80 		messagef(0, "wearing two rings already");
     81 		return;
     82 	}
     83 	if ((ch = pack_letter("put on what?", RING)) == CANCEL) {
     84 		return;
     85 	}
     86 	if (!(ring = get_letter_object(ch))) {
     87 		messagef(0, "no such item.");
     88 		return;
     89 	}
     90 	if (!(ring->what_is & RING)) {
     91 		messagef(0, "that's not a ring");
     92 		return;
     93 	}
     94 	if (ring->in_use_flags & (ON_LEFT_HAND | ON_RIGHT_HAND)) {
     95 		messagef(0, "that ring is already being worn");
     96 		return;
     97 	}
     98 	if (r_rings == 1) {
     99 		ch = (rogue.left_ring ? 'r' : 'l');
    100 	} else {
    101 		messagef(0, "%s", left_or_right);
    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 		messagef(0, "there's already a ring on that hand");
    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, sizeof(desc));
    124 	messagef(0, "%s", desc);
    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 void
    134 do_put_on(ring, on_left)
    135 	object *ring;
    136 	boolean on_left;
    137 {
    138 	if (on_left) {
    139 		ring->in_use_flags |= ON_LEFT_HAND;
    140 		rogue.left_ring = ring;
    141 	} else {
    142 		ring->in_use_flags |= ON_RIGHT_HAND;
    143 		rogue.right_ring = ring;
    144 	}
    145 }
    146 
    147 void
    148 remove_ring()
    149 {
    150 	boolean left = 0, right = 0;
    151 	short ch;
    152 	char buf[DCOLS];
    153 	object *ring;
    154 
    155 	ring = NULL;
    156 	if (r_rings == 0) {
    157 		inv_rings();
    158 	} else if (rogue.left_ring && !rogue.right_ring) {
    159 		left = 1;
    160 	} else if (!rogue.left_ring && rogue.right_ring) {
    161 		right = 1;
    162 	} else {
    163 		messagef(0, "%s", left_or_right);
    164 		do {
    165 			ch = rgetchar();
    166 		} while ((ch != CANCEL) && (ch != 'l') && (ch != 'r') &&
    167 			(ch != '\n') && (ch != '\r'));
    168 		left = (ch == 'l');
    169 		right = (ch == 'r');
    170 		check_message();
    171 	}
    172 	if (left || right) {
    173 		if (left) {
    174 			if (rogue.left_ring) {
    175 				ring = rogue.left_ring;
    176 			} else {
    177 				messagef(0, "%s", no_ring);
    178 			}
    179 		} else {
    180 			if (rogue.right_ring) {
    181 				ring = rogue.right_ring;
    182 			} else {
    183 				messagef(0, "%s", no_ring);
    184 			}
    185 		}
    186 		if (ring->is_cursed) {
    187 			messagef(0, "%s", curse_message);
    188 		} else {
    189 			un_put_on(ring);
    190 			get_desc(ring, buf, sizeof(buf));
    191 			messagef(0, "removed %s", buf);
    192 			(void) reg_move();
    193 		}
    194 	}
    195 }
    196 
    197 void
    198 un_put_on(ring)
    199 	object *ring;
    200 {
    201 	if (ring && (ring->in_use_flags & ON_LEFT_HAND)) {
    202 		ring->in_use_flags &= (~ON_LEFT_HAND);
    203 		rogue.left_ring = 0;
    204 	} else if (ring && (ring->in_use_flags & ON_RIGHT_HAND)) {
    205 		ring->in_use_flags &= (~ON_RIGHT_HAND);
    206 		rogue.right_ring = 0;
    207 	}
    208 	ring_stats(1);
    209 }
    210 
    211 void
    212 gr_ring(ring, assign_wk)
    213 	object *ring;
    214 	boolean assign_wk;
    215 {
    216 	ring->what_is = RING;
    217 	if (assign_wk) {
    218 		ring->which_kind = get_rand(0, (RINGS - 1));
    219 	}
    220 	ring->class = 0;
    221 
    222 	switch(ring->which_kind) {
    223 	/*
    224 	case STEALTH:
    225 		break;
    226 	case SLOW_DIGEST:
    227 		break;
    228 	case REGENERATION:
    229 		break;
    230 	case R_SEE_INVISIBLE:
    231 		break;
    232 	case SUSTAIN_STRENGTH:
    233 		break;
    234 	case R_MAINTAIN_ARMOR:
    235 		break;
    236 	case SEARCHING:
    237 		break;
    238 	*/
    239 	case R_TELEPORT:
    240 		ring->is_cursed = 1;
    241 		break;
    242 	case ADD_STRENGTH:
    243 	case DEXTERITY:
    244 		while ((ring->class = (get_rand(0, 4) - 2)) == 0) ;
    245 		ring->is_cursed = (ring->class < 0);
    246 		break;
    247 	case ADORNMENT:
    248 		ring->is_cursed = coin_toss();
    249 		break;
    250 	}
    251 }
    252 
    253 void
    254 inv_rings()
    255 {
    256 	char buf[DCOLS];
    257 
    258 	if (r_rings == 0) {
    259 		messagef(0, "not wearing any rings");
    260 	} else {
    261 		if (rogue.left_ring) {
    262 			get_desc(rogue.left_ring, buf, sizeof(buf));
    263 			messagef(0, "%s", buf);
    264 		}
    265 		if (rogue.right_ring) {
    266 			get_desc(rogue.right_ring, buf, sizeof(buf));
    267 			messagef(0, "%s", buf);
    268 		}
    269 	}
    270 	if (wizard) {
    271 		messagef(0, "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",
    272 			stealthy, r_rings, e_rings, r_teleport, sustain_strength,
    273 			add_strength, regeneration, ring_exp, r_see_invisible,
    274 			maintain_armor, auto_search);
    275 	}
    276 }
    277 
    278 void
    279 ring_stats(pr)
    280 	boolean pr;
    281 {
    282 	short i;
    283 	object *ring;
    284 
    285 	stealthy = 0;
    286 	r_rings = 0;
    287 	e_rings = 0;
    288 	r_teleport = 0;
    289 	sustain_strength = 0;
    290 	add_strength = 0;
    291 	regeneration = 0;
    292 	ring_exp = 0;
    293 	r_see_invisible = 0;
    294 	maintain_armor = 0;
    295 	auto_search = 0;
    296 
    297 	for (i = 0; i < 2; i++) {
    298 		if (!(ring = ((i == 0) ? rogue.left_ring : rogue.right_ring))) {
    299 			continue;
    300 		}
    301 		r_rings++;
    302 		e_rings++;
    303 		switch(ring->which_kind) {
    304 		case STEALTH:
    305 			stealthy++;
    306 			break;
    307 		case R_TELEPORT:
    308 			r_teleport = 1;
    309 			break;
    310 		case REGENERATION:
    311 			regeneration++;
    312 			break;
    313 		case SLOW_DIGEST:
    314 			e_rings -= 2;
    315 			break;
    316 		case ADD_STRENGTH:
    317 			add_strength += ring->class;
    318 			break;
    319 		case SUSTAIN_STRENGTH:
    320 			sustain_strength = 1;
    321 			break;
    322 		case DEXTERITY:
    323 			ring_exp += ring->class;
    324 			break;
    325 		case ADORNMENT:
    326 			break;
    327 		case R_SEE_INVISIBLE:
    328 			r_see_invisible = 1;
    329 			break;
    330 		case MAINTAIN_ARMOR:
    331 			maintain_armor = 1;
    332 			break;
    333 		case SEARCHING:
    334 			auto_search += 2;
    335 			break;
    336 		}
    337 	}
    338 	if (pr) {
    339 		print_stats(STAT_STRENGTH);
    340 		relight();
    341 	}
    342 }
    343