ring.c revision 1.3 1 1.3 cgd /* $NetBSD: ring.c,v 1.3 1995/04/22 10:28:09 cgd Exp $ */
2 1.3 cgd
3 1.1 cgd /*
4 1.3 cgd * Copyright (c) 1988, 1993
5 1.3 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * This code is derived from software contributed to Berkeley by
8 1.1 cgd * Timothy C. Stoehr.
9 1.1 cgd *
10 1.1 cgd * Redistribution and use in source and binary forms, with or without
11 1.1 cgd * modification, are permitted provided that the following conditions
12 1.1 cgd * are met:
13 1.1 cgd * 1. Redistributions of source code must retain the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer.
15 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 cgd * notice, this list of conditions and the following disclaimer in the
17 1.1 cgd * documentation and/or other materials provided with the distribution.
18 1.1 cgd * 3. All advertising materials mentioning features or use of this software
19 1.1 cgd * must display the following acknowledgement:
20 1.1 cgd * This product includes software developed by the University of
21 1.1 cgd * California, Berkeley and its contributors.
22 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
23 1.1 cgd * may be used to endorse or promote products derived from this software
24 1.1 cgd * without specific prior written permission.
25 1.1 cgd *
26 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 1.1 cgd * SUCH DAMAGE.
37 1.1 cgd */
38 1.1 cgd
39 1.1 cgd #ifndef lint
40 1.3 cgd #if 0
41 1.3 cgd static char sccsid[] = "@(#)ring.c 8.1 (Berkeley) 5/31/93";
42 1.3 cgd #else
43 1.3 cgd static char rcsid[] = "$NetBSD: ring.c,v 1.3 1995/04/22 10:28:09 cgd Exp $";
44 1.3 cgd #endif
45 1.1 cgd #endif /* not lint */
46 1.1 cgd
47 1.1 cgd /*
48 1.1 cgd * ring.c
49 1.1 cgd *
50 1.1 cgd * This source herein may be modified and/or distributed by anybody who
51 1.1 cgd * so desires, with the following restrictions:
52 1.1 cgd * 1.) No portion of this notice shall be removed.
53 1.1 cgd * 2.) Credit shall not be taken for the creation of this source.
54 1.1 cgd * 3.) This code is not to be traded, sold, or used for personal
55 1.1 cgd * gain or profit.
56 1.1 cgd *
57 1.1 cgd */
58 1.1 cgd
59 1.1 cgd #include "rogue.h"
60 1.1 cgd
61 1.1 cgd char *left_or_right = "left or right hand?";
62 1.1 cgd char *no_ring = "there's no ring on that hand";
63 1.1 cgd short stealthy;
64 1.1 cgd short r_rings;
65 1.1 cgd short add_strength;
66 1.1 cgd short e_rings;
67 1.1 cgd short regeneration;
68 1.1 cgd short ring_exp;
69 1.1 cgd short auto_search;
70 1.1 cgd boolean r_teleport;
71 1.1 cgd boolean r_see_invisible;
72 1.1 cgd boolean sustain_strength;
73 1.1 cgd boolean maintain_armor;
74 1.1 cgd
75 1.1 cgd extern char *curse_message;
76 1.1 cgd extern boolean wizard;
77 1.1 cgd
78 1.1 cgd put_on_ring()
79 1.1 cgd {
80 1.1 cgd short ch;
81 1.1 cgd char desc[DCOLS];
82 1.1 cgd object *ring;
83 1.1 cgd
84 1.1 cgd if (r_rings == 2) {
85 1.1 cgd message("wearing two rings already", 0);
86 1.1 cgd return;
87 1.1 cgd }
88 1.1 cgd if ((ch = pack_letter("put on what?", RING)) == CANCEL) {
89 1.1 cgd return;
90 1.1 cgd }
91 1.1 cgd if (!(ring = get_letter_object(ch))) {
92 1.1 cgd message("no such item.", 0);
93 1.1 cgd return;
94 1.1 cgd }
95 1.1 cgd if (!(ring->what_is & RING)) {
96 1.1 cgd message("that's not a ring", 0);
97 1.1 cgd return;
98 1.1 cgd }
99 1.1 cgd if (ring->in_use_flags & (ON_LEFT_HAND | ON_RIGHT_HAND)) {
100 1.1 cgd message("that ring is already being worn", 0);
101 1.1 cgd return;
102 1.1 cgd }
103 1.1 cgd if (r_rings == 1) {
104 1.1 cgd ch = (rogue.left_ring ? 'r' : 'l');
105 1.1 cgd } else {
106 1.1 cgd message(left_or_right, 0);
107 1.1 cgd do {
108 1.1 cgd ch = rgetchar();
109 1.1 cgd } while ((ch != CANCEL) && (ch != 'l') && (ch != 'r') && (ch != '\n') &&
110 1.1 cgd (ch != '\r'));
111 1.1 cgd }
112 1.1 cgd if ((ch != 'l') && (ch != 'r')) {
113 1.1 cgd check_message();
114 1.1 cgd return;
115 1.1 cgd }
116 1.1 cgd if (((ch == 'l') && rogue.left_ring)||((ch == 'r') && rogue.right_ring)) {
117 1.1 cgd check_message();
118 1.1 cgd message("there's already a ring on that hand", 0);
119 1.1 cgd return;
120 1.1 cgd }
121 1.1 cgd if (ch == 'l') {
122 1.1 cgd do_put_on(ring, 1);
123 1.1 cgd } else {
124 1.1 cgd do_put_on(ring, 0);
125 1.1 cgd }
126 1.1 cgd ring_stats(1);
127 1.1 cgd check_message();
128 1.1 cgd get_desc(ring, desc);
129 1.1 cgd message(desc, 0);
130 1.1 cgd (void) reg_move();
131 1.1 cgd }
132 1.1 cgd
133 1.1 cgd /*
134 1.1 cgd * Do not call ring_stats() from within do_put_on(). It will cause
135 1.1 cgd * serious problems when do_put_on() is called from read_pack() in restore().
136 1.1 cgd */
137 1.1 cgd
138 1.1 cgd do_put_on(ring, on_left)
139 1.1 cgd object *ring;
140 1.1 cgd boolean on_left;
141 1.1 cgd {
142 1.1 cgd if (on_left) {
143 1.1 cgd ring->in_use_flags |= ON_LEFT_HAND;
144 1.1 cgd rogue.left_ring = ring;
145 1.1 cgd } else {
146 1.1 cgd ring->in_use_flags |= ON_RIGHT_HAND;
147 1.1 cgd rogue.right_ring = ring;
148 1.1 cgd }
149 1.1 cgd }
150 1.1 cgd
151 1.1 cgd remove_ring()
152 1.1 cgd {
153 1.1 cgd boolean left = 0, right = 0;
154 1.1 cgd short ch;
155 1.1 cgd char buf[DCOLS];
156 1.1 cgd object *ring;
157 1.1 cgd
158 1.1 cgd if (r_rings == 0) {
159 1.1 cgd inv_rings();
160 1.1 cgd } else if (rogue.left_ring && !rogue.right_ring) {
161 1.1 cgd left = 1;
162 1.1 cgd } else if (!rogue.left_ring && rogue.right_ring) {
163 1.1 cgd right = 1;
164 1.1 cgd } else {
165 1.1 cgd message(left_or_right, 0);
166 1.1 cgd do {
167 1.1 cgd ch = rgetchar();
168 1.1 cgd } while ((ch != CANCEL) && (ch != 'l') && (ch != 'r') &&
169 1.1 cgd (ch != '\n') && (ch != '\r'));
170 1.1 cgd left = (ch == 'l');
171 1.1 cgd right = (ch == 'r');
172 1.1 cgd check_message();
173 1.1 cgd }
174 1.1 cgd if (left || right) {
175 1.1 cgd if (left) {
176 1.1 cgd if (rogue.left_ring) {
177 1.1 cgd ring = rogue.left_ring;
178 1.1 cgd } else {
179 1.1 cgd message(no_ring, 0);
180 1.1 cgd }
181 1.1 cgd } else {
182 1.1 cgd if (rogue.right_ring) {
183 1.1 cgd ring = rogue.right_ring;
184 1.1 cgd } else {
185 1.1 cgd message(no_ring, 0);
186 1.1 cgd }
187 1.1 cgd }
188 1.1 cgd if (ring->is_cursed) {
189 1.1 cgd message(curse_message, 0);
190 1.1 cgd } else {
191 1.1 cgd un_put_on(ring);
192 1.1 cgd (void) strcpy(buf, "removed ");
193 1.1 cgd get_desc(ring, buf + 8);
194 1.1 cgd message(buf, 0);
195 1.1 cgd (void) reg_move();
196 1.1 cgd }
197 1.1 cgd }
198 1.1 cgd }
199 1.1 cgd
200 1.1 cgd un_put_on(ring)
201 1.1 cgd object *ring;
202 1.1 cgd {
203 1.1 cgd if (ring && (ring->in_use_flags & ON_LEFT_HAND)) {
204 1.1 cgd ring->in_use_flags &= (~ON_LEFT_HAND);
205 1.1 cgd rogue.left_ring = 0;
206 1.1 cgd } else if (ring && (ring->in_use_flags & ON_RIGHT_HAND)) {
207 1.1 cgd ring->in_use_flags &= (~ON_RIGHT_HAND);
208 1.1 cgd rogue.right_ring = 0;
209 1.1 cgd }
210 1.1 cgd ring_stats(1);
211 1.1 cgd }
212 1.1 cgd
213 1.1 cgd gr_ring(ring, assign_wk)
214 1.1 cgd object *ring;
215 1.1 cgd boolean assign_wk;
216 1.1 cgd {
217 1.1 cgd ring->what_is = RING;
218 1.1 cgd if (assign_wk) {
219 1.1 cgd ring->which_kind = get_rand(0, (RINGS - 1));
220 1.1 cgd }
221 1.1 cgd ring->class = 0;
222 1.1 cgd
223 1.1 cgd switch(ring->which_kind) {
224 1.1 cgd /*
225 1.1 cgd case STEALTH:
226 1.1 cgd break;
227 1.1 cgd case SLOW_DIGEST:
228 1.1 cgd break;
229 1.1 cgd case REGENERATION:
230 1.1 cgd break;
231 1.1 cgd case R_SEE_INVISIBLE:
232 1.1 cgd break;
233 1.1 cgd case SUSTAIN_STRENGTH:
234 1.1 cgd break;
235 1.1 cgd case R_MAINTAIN_ARMOR:
236 1.1 cgd break;
237 1.1 cgd case SEARCHING:
238 1.1 cgd break;
239 1.1 cgd */
240 1.1 cgd case R_TELEPORT:
241 1.1 cgd ring->is_cursed = 1;
242 1.1 cgd break;
243 1.1 cgd case ADD_STRENGTH:
244 1.1 cgd case DEXTERITY:
245 1.1 cgd while ((ring->class = (get_rand(0, 4) - 2)) == 0) ;
246 1.1 cgd ring->is_cursed = (ring->class < 0);
247 1.1 cgd break;
248 1.1 cgd case ADORNMENT:
249 1.1 cgd ring->is_cursed = coin_toss();
250 1.1 cgd break;
251 1.1 cgd }
252 1.1 cgd }
253 1.1 cgd
254 1.1 cgd inv_rings()
255 1.1 cgd {
256 1.1 cgd char buf[DCOLS];
257 1.1 cgd
258 1.1 cgd if (r_rings == 0) {
259 1.1 cgd message("not wearing any rings", 0);
260 1.1 cgd } else {
261 1.1 cgd if (rogue.left_ring) {
262 1.1 cgd get_desc(rogue.left_ring, buf);
263 1.1 cgd message(buf, 0);
264 1.1 cgd }
265 1.1 cgd if (rogue.right_ring) {
266 1.1 cgd get_desc(rogue.right_ring, buf);
267 1.1 cgd message(buf, 0);
268 1.1 cgd }
269 1.1 cgd }
270 1.1 cgd if (wizard) {
271 1.1 cgd 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",
272 1.1 cgd stealthy, r_rings, e_rings, r_teleport, sustain_strength,
273 1.1 cgd add_strength, regeneration, ring_exp, r_see_invisible,
274 1.1 cgd maintain_armor, auto_search);
275 1.1 cgd message(buf, 0);
276 1.1 cgd }
277 1.1 cgd }
278 1.1 cgd
279 1.1 cgd ring_stats(pr)
280 1.1 cgd boolean pr;
281 1.1 cgd {
282 1.1 cgd short i;
283 1.1 cgd object *ring;
284 1.1 cgd
285 1.1 cgd stealthy = 0;
286 1.1 cgd r_rings = 0;
287 1.1 cgd e_rings = 0;
288 1.1 cgd r_teleport = 0;
289 1.1 cgd sustain_strength = 0;
290 1.1 cgd add_strength = 0;
291 1.1 cgd regeneration = 0;
292 1.1 cgd ring_exp = 0;
293 1.1 cgd r_see_invisible = 0;
294 1.1 cgd maintain_armor = 0;
295 1.1 cgd auto_search = 0;
296 1.1 cgd
297 1.1 cgd for (i = 0; i < 2; i++) {
298 1.1 cgd if (!(ring = ((i == 0) ? rogue.left_ring : rogue.right_ring))) {
299 1.1 cgd continue;
300 1.1 cgd }
301 1.1 cgd r_rings++;
302 1.1 cgd e_rings++;
303 1.1 cgd switch(ring->which_kind) {
304 1.1 cgd case STEALTH:
305 1.1 cgd stealthy++;
306 1.1 cgd break;
307 1.1 cgd case R_TELEPORT:
308 1.1 cgd r_teleport = 1;
309 1.1 cgd break;
310 1.1 cgd case REGENERATION:
311 1.1 cgd regeneration++;
312 1.1 cgd break;
313 1.1 cgd case SLOW_DIGEST:
314 1.1 cgd e_rings -= 2;
315 1.1 cgd break;
316 1.1 cgd case ADD_STRENGTH:
317 1.1 cgd add_strength += ring->class;
318 1.1 cgd break;
319 1.1 cgd case SUSTAIN_STRENGTH:
320 1.1 cgd sustain_strength = 1;
321 1.1 cgd break;
322 1.1 cgd case DEXTERITY:
323 1.1 cgd ring_exp += ring->class;
324 1.1 cgd break;
325 1.1 cgd case ADORNMENT:
326 1.1 cgd break;
327 1.1 cgd case R_SEE_INVISIBLE:
328 1.1 cgd r_see_invisible = 1;
329 1.1 cgd break;
330 1.1 cgd case MAINTAIN_ARMOR:
331 1.1 cgd maintain_armor = 1;
332 1.1 cgd break;
333 1.1 cgd case SEARCHING:
334 1.1 cgd auto_search += 2;
335 1.1 cgd break;
336 1.1 cgd }
337 1.1 cgd }
338 1.1 cgd if (pr) {
339 1.1 cgd print_stats(STAT_STRENGTH);
340 1.1 cgd relight();
341 1.1 cgd }
342 1.1 cgd }
343