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. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * @(#)message.c 8.1 (Berkeley) 5/31/93
33 * $FreeBSD: src/games/rogue/message.c,v 1.7.2.1 2000/07/20 10:35:07 kris Exp $
39 * This source herein may be modified and/or distributed by anybody who
40 * so desires, with the following restrictions:
41 * 1.) No portion of this notice shall be removed.
42 * 2.) Credit shall not be taken for the creation of this source.
43 * 3.) This code is not to be traded, sold, or used for personal
50 #include "pathnames.h"
52 static char msgs[NMESSAGES][DCOLS] = {"", "", "", "", ""};
53 static short msg_col = 0, imsg = -1;
54 static boolean rmsg = 0;
56 boolean msg_cleared = 1;
57 char hunger_str[HUNGER_STR_LEN] = "";
58 const char *more = "-more-";
60 static void pad(const char *, short);
61 static void save_screen(void);
64 message(const char *msg, boolean intrpt)
68 if (!save_is_interactive) {
78 mvaddstr(MIN_ROW-1, msg_col, more);
84 imsg = (imsg + 1) % NMESSAGES;
85 strcpy(msgs[imsg], msg);
87 mvaddstr(MIN_ROW-1, 0, msg);
91 msg_col = strlen(msg);
110 message(msgs[((imsg - c) % NMESSAGES)], 0);
112 move(rogue.row, rogue.col);
130 get_input_line(const char *prompt, const char *insert, char *buf,
131 const char *if_cancelled, boolean add_blank, boolean do_echo)
140 mvaddstr(0, n + 1, insert);
143 move(0, (n + i + 1));
147 while (((ch = rgetchar()) != '\r') && (ch != '\n') && (ch != CANCEL)) {
148 if ((ch >= ' ') && (ch <= '~') && (i < MAX_TITLE_LENGTH-2)) {
149 if ((ch != ' ') || (i > 0)) {
156 if ((ch == '\b') && (i > 0)) {
158 mvaddch(0, i + n, ' ');
159 move(MIN_ROW-1, i+n);
169 while ((i > 0) && (buf[i-1] == ' ')) {
176 if ((ch == CANCEL) || (i == 0) || ((i == 1) && add_blank)) {
178 message(if_cancelled, 0);
214 Level: 99 Gold: 999999 Hp: 999(999) Str: 99(99) Arm: 99 Exp: 21/10000000 Hungry
215 0 5 1 5 2 5 3 5 4 5 5 5 6 5 7 5
219 print_stats(int stat_mask)
225 label = (stat_mask & STAT_LABEL) ? 1 : 0;
227 if (stat_mask & STAT_LEVEL) {
229 mvaddstr(row, 0, "Level: ");
231 /* max level taken care of in make_level() */
232 sprintf(buf, "%d", cur_level);
233 mvaddstr(row, 7, buf);
236 if (stat_mask & STAT_GOLD) {
238 mvaddstr(row, 10, "Gold: ");
240 if (rogue.gold > MAX_GOLD) {
241 rogue.gold = MAX_GOLD;
243 sprintf(buf, "%ld", rogue.gold);
244 mvaddstr(row, 16, buf);
247 if (stat_mask & STAT_HP) {
249 mvaddstr(row, 23, "Hp: ");
251 if (rogue.hp_max > MAX_HP) {
252 rogue.hp_current -= (rogue.hp_max - MAX_HP);
253 rogue.hp_max = MAX_HP;
255 sprintf(buf, "%d(%d)", rogue.hp_current, rogue.hp_max);
256 mvaddstr(row, 27, buf);
259 if (stat_mask & STAT_STRENGTH) {
261 mvaddstr(row, 36, "Str: ");
263 if (rogue.str_max > MAX_STRENGTH) {
264 rogue.str_current -= (rogue.str_max - MAX_STRENGTH);
265 rogue.str_max = MAX_STRENGTH;
267 sprintf(buf, "%d(%d)", (rogue.str_current + add_strength),
269 mvaddstr(row, 41, buf);
272 if (stat_mask & STAT_ARMOR) {
274 mvaddstr(row, 48, "Arm: ");
276 if (rogue.armor && (rogue.armor->d_enchant > MAX_ARMOR)) {
277 rogue.armor->d_enchant = MAX_ARMOR;
279 sprintf(buf, "%d", get_armor_class(rogue.armor));
280 mvaddstr(row, 53, buf);
283 if (stat_mask & STAT_EXP) {
285 mvaddstr(row, 56, "Exp: ");
287 if (rogue.exp_points > MAX_EXP) {
288 rogue.exp_points = MAX_EXP;
290 if (rogue.exp > MAX_EXP_LEVEL) {
291 rogue.exp = MAX_EXP_LEVEL;
293 sprintf(buf, "%d/%ld", rogue.exp, rogue.exp_points);
294 mvaddstr(row, 61, buf);
297 if (stat_mask & STAT_HUNGER) {
298 mvaddstr(row, 73, hunger_str);
305 pad(const char *s, short n)
309 for (i = strlen(s); i < n; i++) {
320 boolean found_non_blank;
322 if ((fp = fopen(_PATH_SCREENDUMP, "w")) != NULL) {
323 for (i = 0; i < DROWS; i++) {
325 for (j = (DCOLS - 1); j >= 0; j--) {
326 buf[j] = mvinch(i, j);
327 if (!found_non_blank) {
328 if ((buf[j] != ' ') || (j == 0)) {
329 buf[j + ((j == 0) ? 0 : 1)] = 0;
353 return((ch >= '0') && (ch <= '9'));
357 r_index(const char *str, int ch, boolean last)
362 for (i = strlen(str) - 1; i >= 0; i--) {
368 for (i = 0; str[i]; i++) {