2 * Copyright (c) 1988, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
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.
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
39 static char sccsid[] = "@(#)message.c 8.1 (Berkeley) 5/31/93";
41 static const char rcsid[] =
48 * This source herein may be modified and/or distributed by anybody who
49 * so desires, with the following restrictions:
50 * 1.) No portion of this notice shall be removed.
51 * 2.) Credit shall not be taken for the creation of this source.
52 * 3.) This code is not to be traded, sold, or used for personal
60 char msgs[NMESSAGES][DCOLS] = {"", "", "", "", ""};
61 short msg_col = 0, imsg = -1;
62 boolean msg_cleared = 1, rmsg = 0;
63 char hunger_str[8] = "";
64 const char *more = "-more-";
66 extern boolean cant_int, did_int, interrupted, save_is_interactive, flush;
67 extern short add_strength;
68 extern short cur_level;
76 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);
118 message(msgs[((imsg - c) % NMESSAGES)], 0);
120 move(rogue.row, rogue.col);
136 get_input_line(prompt, insert, buf, if_cancelled, add_blank, do_echo)
137 const char *prompt, *insert;
139 const char *if_cancelled;
150 mvaddstr(0, n + 1, insert);
151 (void) strcpy(buf, insert);
153 move(0, (n + i + 1));
157 while (((ch = rgetchar()) != '\r') && (ch != '\n') && (ch != CANCEL)) {
158 if ((ch >= ' ') && (ch <= '~') && (i < MAX_TITLE_LENGTH-2)) {
159 if ((ch != ' ') || (i > 0)) {
166 if ((ch == '\b') && (i > 0)) {
168 mvaddch(0, i + n, ' ');
169 move(MIN_ROW-1, i+n);
179 while ((i > 0) && (buf[i-1] == ' ')) {
186 if ((ch == CANCEL) || (i == 0) || ((i == 1) && add_blank)) {
188 message(if_cancelled, 0);
222 Level: 99 Gold: 999999 Hp: 999(999) Str: 99(99) Arm: 99 Exp: 21/10000000 Hungry
223 0 5 1 5 2 5 3 5 4 5 5 5 6 5 7 5
226 print_stats(stat_mask)
233 label = (stat_mask & STAT_LABEL) ? 1 : 0;
235 if (stat_mask & STAT_LEVEL) {
237 mvaddstr(row, 0, "Level: ");
239 /* max level taken care of in make_level() */
240 sprintf(buf, "%d", cur_level);
241 mvaddstr(row, 7, buf);
244 if (stat_mask & STAT_GOLD) {
246 mvaddstr(row, 10, "Gold: ");
248 if (rogue.gold > MAX_GOLD) {
249 rogue.gold = MAX_GOLD;
251 sprintf(buf, "%ld", rogue.gold);
252 mvaddstr(row, 16, buf);
255 if (stat_mask & STAT_HP) {
257 mvaddstr(row, 23, "Hp: ");
259 if (rogue.hp_max > MAX_HP) {
260 rogue.hp_current -= (rogue.hp_max - MAX_HP);
261 rogue.hp_max = MAX_HP;
263 sprintf(buf, "%d(%d)", rogue.hp_current, rogue.hp_max);
264 mvaddstr(row, 27, buf);
267 if (stat_mask & STAT_STRENGTH) {
269 mvaddstr(row, 36, "Str: ");
271 if (rogue.str_max > MAX_STRENGTH) {
272 rogue.str_current -= (rogue.str_max - MAX_STRENGTH);
273 rogue.str_max = MAX_STRENGTH;
275 sprintf(buf, "%d(%d)", (rogue.str_current + add_strength),
277 mvaddstr(row, 41, buf);
280 if (stat_mask & STAT_ARMOR) {
282 mvaddstr(row, 48, "Arm: ");
284 if (rogue.armor && (rogue.armor->d_enchant > MAX_ARMOR)) {
285 rogue.armor->d_enchant = MAX_ARMOR;
287 sprintf(buf, "%d", get_armor_class(rogue.armor));
288 mvaddstr(row, 53, buf);
291 if (stat_mask & STAT_EXP) {
293 mvaddstr(row, 56, "Exp: ");
295 if (rogue.exp_points > MAX_EXP) {
296 rogue.exp_points = MAX_EXP;
298 if (rogue.exp > MAX_EXP_LEVEL) {
299 rogue.exp = MAX_EXP_LEVEL;
301 sprintf(buf, "%d/%ld", rogue.exp, rogue.exp_points);
302 mvaddstr(row, 61, buf);
305 if (stat_mask & STAT_HUNGER) {
306 mvaddstr(row, 73, hunger_str);
318 for (i = strlen(s); i < n; i++) {
328 boolean found_non_blank;
330 if ((fp = fopen("rogue.screen", "w")) != NULL) {
331 for (i = 0; i < DROWS; i++) {
333 for (j = (DCOLS - 1); j >= 0; j--) {
334 buf[j] = mvinch(i, j);
335 if (!found_non_blank) {
336 if ((buf[j] != ' ') || (j == 0)) {
337 buf[j + ((j == 0) ? 0 : 1)] = 0;
361 return((ch >= '0') && (ch <= '9'));
364 r_index(str, ch, last)
372 for (i = strlen(str) - 1; i >= 0; i--) {
378 for (i = 0; str[i]; i++) {