]>
git.cameronkatri.com Git - bsdgames-darwin.git/blob - rogue/message.c
1 /* $NetBSD: message.c,v 1.7 1998/11/10 13:01:32 hubertf Exp $ */
4 * Copyright (c) 1988, 1993
5 * The Regents of the University of California. All rights reserved.
7 * This code is derived from software contributed to Berkeley by
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
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. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 #include <sys/cdefs.h>
42 static char sccsid
[] = "@(#)message.c 8.1 (Berkeley) 5/31/93";
44 __RCSID("$NetBSD: message.c,v 1.7 1998/11/10 13:01:32 hubertf Exp $");
51 * This source herein may be modified and/or distributed by anybody who
52 * so desires, with the following restrictions:
53 * 1.) No portion of this notice shall be removed.
54 * 2.) Credit shall not be taken for the creation of this source.
55 * 3.) This code is not to be traded, sold, or used for personal
64 char msgs
[NMESSAGES
][DCOLS
] = {"", "", "", "", ""};
65 short msg_col
= 0, imsg
= -1;
66 boolean msg_cleared
= 1, rmsg
= 0;
67 char hunger_str
[8] = "";
68 const char *more
= "-more-";
77 if (!save_is_interactive
) {
86 mvaddstr(MIN_ROW
-1, msg_col
, more
);
92 imsg
= (imsg
+ 1) % NMESSAGES
;
93 (void) strcpy(msgs
[imsg
], msg
);
95 mvaddstr(MIN_ROW
-1, 0, msg
);
99 msg_col
= strlen(msg
);
119 message(msgs
[((imsg
- c
) % NMESSAGES
)], 0);
121 move(rogue
.row
, rogue
.col
);
139 get_input_line(prompt
, insert
, buf
, if_cancelled
, add_blank
, do_echo
)
140 const char *prompt
, *insert
;
142 const char *if_cancelled
;
153 mvaddstr(0, n
+ 1, insert
);
154 (void) strcpy(buf
, insert
);
156 move(0, (n
+ i
+ 1));
160 while (((ch
= rgetchar()) != '\r') && (ch
!= '\n') && (ch
!= CANCEL
)) {
161 if ((ch
>= ' ') && (ch
<= '~') && (i
< MAX_TITLE_LENGTH
-2)) {
162 if ((ch
!= ' ') || (i
> 0)) {
169 if ((ch
== '\b') && (i
> 0)) {
171 mvaddch(0, i
+ n
, ' ');
172 move(MIN_ROW
-1, i
+n
);
182 while ((i
> 0) && (buf
[i
-1] == ' ')) {
189 if ((ch
== CANCEL
) || (i
== 0) || ((i
== 1) && add_blank
)) {
191 message(if_cancelled
, 0);
227 Level: 99 Gold: 999999 Hp: 999(999) Str: 99(99) Arm: 99 Exp: 21/10000000 Hungry
228 0 5 1 5 2 5 3 5 4 5 5 5 6 5 7 5
232 print_stats(stat_mask
)
239 label
= (stat_mask
& STAT_LABEL
) ? 1 : 0;
241 if (stat_mask
& STAT_LEVEL
) {
243 mvaddstr(row
, 0, "Level: ");
245 /* max level taken care of in make_level() */
246 sprintf(buf
, "%d", cur_level
);
247 mvaddstr(row
, 7, buf
);
250 if (stat_mask
& STAT_GOLD
) {
252 mvaddstr(row
, 10, "Gold: ");
254 if (rogue
.gold
> MAX_GOLD
) {
255 rogue
.gold
= MAX_GOLD
;
257 sprintf(buf
, "%ld", rogue
.gold
);
258 mvaddstr(row
, 16, buf
);
261 if (stat_mask
& STAT_HP
) {
263 mvaddstr(row
, 23, "Hp: ");
265 if (rogue
.hp_max
> MAX_HP
) {
266 rogue
.hp_current
-= (rogue
.hp_max
- MAX_HP
);
267 rogue
.hp_max
= MAX_HP
;
269 sprintf(buf
, "%d(%d)", rogue
.hp_current
, rogue
.hp_max
);
270 mvaddstr(row
, 27, buf
);
273 if (stat_mask
& STAT_STRENGTH
) {
275 mvaddstr(row
, 36, "Str: ");
277 if (rogue
.str_max
> MAX_STRENGTH
) {
278 rogue
.str_current
-= (rogue
.str_max
- MAX_STRENGTH
);
279 rogue
.str_max
= MAX_STRENGTH
;
281 sprintf(buf
, "%d(%d)", (rogue
.str_current
+ add_strength
),
283 mvaddstr(row
, 41, buf
);
286 if (stat_mask
& STAT_ARMOR
) {
288 mvaddstr(row
, 48, "Arm: ");
290 if (rogue
.armor
&& (rogue
.armor
->d_enchant
> MAX_ARMOR
)) {
291 rogue
.armor
->d_enchant
= MAX_ARMOR
;
293 sprintf(buf
, "%d", get_armor_class(rogue
.armor
));
294 mvaddstr(row
, 53, buf
);
297 if (stat_mask
& STAT_EXP
) {
299 mvaddstr(row
, 56, "Exp: ");
301 if (rogue
.exp_points
> MAX_EXP
) {
302 rogue
.exp_points
= MAX_EXP
;
304 if (rogue
.exp
> MAX_EXP_LEVEL
) {
305 rogue
.exp
= MAX_EXP_LEVEL
;
307 sprintf(buf
, "%d/%ld", rogue
.exp
, rogue
.exp_points
);
308 mvaddstr(row
, 61, buf
);
311 if (stat_mask
& STAT_HUNGER
) {
312 mvaddstr(row
, 73, hunger_str
);
325 for (i
= strlen(s
); i
< n
; i
++) {
336 boolean found_non_blank
;
338 if ((fp
= fopen("rogue.screen", "w")) != NULL
) {
339 for (i
= 0; i
< DROWS
; i
++) {
341 for (j
= (DCOLS
- 1); j
>= 0; j
--) {
342 buf
[j
] = mvinch(i
, j
);
343 if (!found_non_blank
) {
344 if ((buf
[j
] != ' ') || (j
== 0)) {
345 buf
[j
+ ((j
== 0) ? 0 : 1)] = 0;
370 return((ch
>= '0') && (ch
<= '9'));
374 r_index(str
, ch
, last
)
382 for (i
= strlen(str
) - 1; i
>= 0; i
--) {
388 for (i
= 0; str
[i
]; i
++) {