Home | History | Annotate | Line # | Download | only in rogue
message.c revision 1.10
      1  1.10      agc /*	$NetBSD: message.c,v 1.10 2003/08/07 09:37:38 agc Exp $	*/
      2   1.5      cgd 
      3   1.1      cgd /*
      4   1.5      cgd  * Copyright (c) 1988, 1993
      5   1.5      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.10      agc  * 3. Neither the name of the University nor the names of its contributors
     19   1.1      cgd  *    may be used to endorse or promote products derived from this software
     20   1.1      cgd  *    without specific prior written permission.
     21   1.1      cgd  *
     22   1.1      cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     23   1.1      cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     24   1.1      cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     25   1.1      cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     26   1.1      cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     27   1.1      cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     28   1.1      cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     29   1.1      cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     30   1.1      cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     31   1.1      cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     32   1.1      cgd  * SUCH DAMAGE.
     33   1.1      cgd  */
     34   1.1      cgd 
     35   1.6    lukem #include <sys/cdefs.h>
     36   1.1      cgd #ifndef lint
     37   1.5      cgd #if 0
     38   1.5      cgd static char sccsid[] = "@(#)message.c	8.1 (Berkeley) 5/31/93";
     39   1.5      cgd #else
     40  1.10      agc __RCSID("$NetBSD: message.c,v 1.10 2003/08/07 09:37:38 agc Exp $");
     41   1.5      cgd #endif
     42   1.1      cgd #endif /* not lint */
     43   1.1      cgd 
     44   1.1      cgd /*
     45   1.1      cgd  * message.c
     46   1.1      cgd  *
     47   1.1      cgd  * This source herein may be modified and/or distributed by anybody who
     48   1.1      cgd  * so desires, with the following restrictions:
     49   1.1      cgd  *    1.)  No portion of this notice shall be removed.
     50   1.1      cgd  *    2.)  Credit shall not be taken for the creation of this source.
     51   1.1      cgd  *    3.)  This code is not to be traded, sold, or used for personal
     52   1.1      cgd  *         gain or profit.
     53   1.1      cgd  *
     54   1.1      cgd  */
     55   1.1      cgd 
     56   1.6    lukem #include <signal.h>
     57   1.3  mycroft #include <termios.h>
     58   1.1      cgd #include "rogue.h"
     59   1.1      cgd 
     60   1.1      cgd char msgs[NMESSAGES][DCOLS] = {"", "", "", "", ""};
     61   1.1      cgd short msg_col = 0, imsg = -1;
     62   1.1      cgd boolean msg_cleared = 1, rmsg = 0;
     63   1.9      mrg char hunger_str[HUNGER_STR_LEN] = "";
     64   1.7  hubertf const char *more = "-more-";
     65   1.1      cgd 
     66   1.6    lukem void
     67   1.1      cgd message(msg, intrpt)
     68   1.7  hubertf 	const char *msg;
     69   1.6    lukem 	boolean intrpt;
     70   1.1      cgd {
     71   1.1      cgd 	cant_int = 1;
     72   1.1      cgd 
     73   1.1      cgd 	if (!save_is_interactive) {
     74   1.1      cgd 		return;
     75   1.1      cgd 	}
     76   1.1      cgd 	if (intrpt) {
     77   1.1      cgd 		interrupted = 1;
     78   1.1      cgd 		md_slurp();
     79   1.1      cgd 	}
     80   1.1      cgd 
     81   1.1      cgd 	if (!msg_cleared) {
     82   1.1      cgd 		mvaddstr(MIN_ROW-1, msg_col, more);
     83   1.1      cgd 		refresh();
     84   1.1      cgd 		wait_for_ack();
     85   1.1      cgd 		check_message();
     86   1.1      cgd 	}
     87   1.1      cgd 	if (!rmsg) {
     88   1.1      cgd 		imsg = (imsg + 1) % NMESSAGES;
     89   1.1      cgd 		(void) strcpy(msgs[imsg], msg);
     90   1.1      cgd 	}
     91   1.1      cgd 	mvaddstr(MIN_ROW-1, 0, msg);
     92   1.1      cgd 	addch(' ');
     93   1.1      cgd 	refresh();
     94   1.1      cgd 	msg_cleared = 0;
     95   1.1      cgd 	msg_col = strlen(msg);
     96   1.1      cgd 
     97   1.1      cgd 	cant_int = 0;
     98   1.1      cgd 
     99   1.1      cgd 	if (did_int) {
    100   1.1      cgd 		did_int = 0;
    101   1.6    lukem 		onintr(0);
    102   1.1      cgd 	}
    103   1.1      cgd }
    104   1.1      cgd 
    105   1.6    lukem void
    106   1.1      cgd remessage(c)
    107   1.6    lukem 	short c;
    108   1.1      cgd {
    109   1.1      cgd 	if (imsg != -1) {
    110   1.1      cgd 		check_message();
    111   1.1      cgd 		rmsg = 1;
    112   1.1      cgd 		while (c > imsg) {
    113   1.1      cgd 			c -= NMESSAGES;
    114   1.1      cgd 		}
    115   1.1      cgd 		message(msgs[((imsg - c) % NMESSAGES)], 0);
    116   1.1      cgd 		rmsg = 0;
    117   1.1      cgd 		move(rogue.row, rogue.col);
    118   1.1      cgd 		refresh();
    119   1.1      cgd 	}
    120   1.1      cgd }
    121   1.1      cgd 
    122   1.6    lukem void
    123   1.1      cgd check_message()
    124   1.1      cgd {
    125   1.1      cgd 	if (msg_cleared) {
    126   1.1      cgd 		return;
    127   1.1      cgd 	}
    128   1.1      cgd 	move(MIN_ROW-1, 0);
    129   1.1      cgd 	clrtoeol();
    130   1.1      cgd 	refresh();
    131   1.1      cgd 	msg_cleared = 1;
    132   1.1      cgd }
    133   1.1      cgd 
    134   1.6    lukem int
    135   1.1      cgd get_input_line(prompt, insert, buf, if_cancelled, add_blank, do_echo)
    136   1.7  hubertf 	const char *prompt, *insert;
    137   1.7  hubertf 	char *buf;
    138   1.7  hubertf 	const char *if_cancelled;
    139   1.6    lukem 	boolean add_blank;
    140   1.6    lukem 	boolean do_echo;
    141   1.1      cgd {
    142   1.1      cgd 	short ch;
    143   1.1      cgd 	short i = 0, n;
    144   1.1      cgd 
    145   1.1      cgd 	message(prompt, 0);
    146   1.1      cgd 	n = strlen(prompt);
    147   1.1      cgd 
    148   1.1      cgd 	if (insert[0]) {
    149   1.1      cgd 		mvaddstr(0, n + 1, insert);
    150   1.1      cgd 		(void) strcpy(buf, insert);
    151   1.1      cgd 		i = strlen(insert);
    152   1.1      cgd 		move(0, (n + i + 1));
    153   1.1      cgd 		refresh();
    154   1.1      cgd 	}
    155   1.1      cgd 
    156   1.1      cgd 	while (((ch = rgetchar()) != '\r') && (ch != '\n') && (ch != CANCEL)) {
    157   1.1      cgd 		if ((ch >= ' ') && (ch <= '~') && (i < MAX_TITLE_LENGTH-2)) {
    158   1.1      cgd 			if ((ch != ' ') || (i > 0)) {
    159   1.1      cgd 				buf[i++] = ch;
    160   1.1      cgd 				if (do_echo) {
    161   1.1      cgd 					addch(ch);
    162   1.1      cgd 				}
    163   1.1      cgd 			}
    164   1.1      cgd 		}
    165   1.1      cgd 		if ((ch == '\b') && (i > 0)) {
    166   1.1      cgd 			if (do_echo) {
    167   1.1      cgd 				mvaddch(0, i + n, ' ');
    168   1.1      cgd 				move(MIN_ROW-1, i+n);
    169   1.1      cgd 			}
    170   1.1      cgd 			i--;
    171   1.1      cgd 		}
    172   1.1      cgd 		refresh();
    173   1.1      cgd 	}
    174   1.1      cgd 	check_message();
    175   1.1      cgd 	if (add_blank) {
    176   1.1      cgd 		buf[i++] = ' ';
    177   1.1      cgd 	} else {
    178   1.1      cgd 		while ((i > 0) && (buf[i-1] == ' ')) {
    179   1.1      cgd 			i--;
    180   1.1      cgd 		}
    181   1.1      cgd 	}
    182   1.1      cgd 
    183   1.1      cgd 	buf[i] = 0;
    184   1.1      cgd 
    185   1.1      cgd 	if ((ch == CANCEL) || (i == 0) || ((i == 1) && add_blank)) {
    186   1.1      cgd 		if (if_cancelled) {
    187   1.1      cgd 			message(if_cancelled, 0);
    188   1.1      cgd 		}
    189   1.1      cgd 		return(0);
    190   1.1      cgd 	}
    191   1.1      cgd 	return(i);
    192   1.1      cgd }
    193   1.1      cgd 
    194   1.6    lukem int
    195   1.1      cgd rgetchar()
    196   1.1      cgd {
    197   1.6    lukem 	int ch;
    198   1.1      cgd 
    199   1.1      cgd 	for(;;) {
    200   1.1      cgd 		ch = getchar();
    201   1.1      cgd 
    202   1.4      cgd 		switch(ch) {
    203   1.4      cgd 		case '\022':
    204   1.1      cgd 			wrefresh(curscr);
    205   1.4      cgd 			break;
    206   1.4      cgd #ifdef UNIX_BSD4_2
    207   1.4      cgd 		case '\032':
    208   1.8   itojun 			printf("%s", CL);
    209   1.1      cgd 			fflush(stdout);
    210   1.4      cgd 			tstp();
    211   1.4      cgd 			break;
    212   1.1      cgd #endif
    213   1.4      cgd 		case '&':
    214   1.1      cgd 			save_screen();
    215   1.4      cgd 			break;
    216   1.4      cgd 		default:
    217   1.1      cgd 			return(ch);
    218   1.4      cgd 		}
    219   1.1      cgd 	}
    220   1.1      cgd }
    221   1.6    lukem 
    222   1.1      cgd /*
    223   1.1      cgd Level: 99 Gold: 999999 Hp: 999(999) Str: 99(99) Arm: 99 Exp: 21/10000000 Hungry
    224   1.1      cgd 0    5    1    5    2    5    3    5    4    5    5    5    6    5    7    5
    225   1.1      cgd */
    226   1.1      cgd 
    227   1.6    lukem void
    228   1.1      cgd print_stats(stat_mask)
    229   1.6    lukem 	int stat_mask;
    230   1.1      cgd {
    231   1.1      cgd 	char buf[16];
    232   1.1      cgd 	boolean label;
    233   1.1      cgd 	int row = DROWS - 1;
    234   1.1      cgd 
    235   1.1      cgd 	label = (stat_mask & STAT_LABEL) ? 1 : 0;
    236   1.1      cgd 
    237   1.1      cgd 	if (stat_mask & STAT_LEVEL) {
    238   1.1      cgd 		if (label) {
    239   1.1      cgd 			mvaddstr(row, 0, "Level: ");
    240   1.1      cgd 		}
    241   1.1      cgd 		/* max level taken care of in make_level() */
    242   1.1      cgd 		sprintf(buf, "%d", cur_level);
    243   1.1      cgd 		mvaddstr(row, 7, buf);
    244   1.1      cgd 		pad(buf, 2);
    245   1.1      cgd 	}
    246   1.1      cgd 	if (stat_mask & STAT_GOLD) {
    247   1.1      cgd 		if (label) {
    248   1.1      cgd 			mvaddstr(row, 10, "Gold: ");
    249   1.1      cgd 		}
    250   1.1      cgd 		if (rogue.gold > MAX_GOLD) {
    251   1.1      cgd 			rogue.gold = MAX_GOLD;
    252   1.1      cgd 		}
    253   1.1      cgd 		sprintf(buf, "%ld", rogue.gold);
    254   1.1      cgd 		mvaddstr(row, 16, buf);
    255   1.1      cgd 		pad(buf, 6);
    256   1.1      cgd 	}
    257   1.1      cgd 	if (stat_mask & STAT_HP) {
    258   1.1      cgd 		if (label) {
    259   1.1      cgd 			mvaddstr(row, 23, "Hp: ");
    260   1.1      cgd 		}
    261   1.1      cgd 		if (rogue.hp_max > MAX_HP) {
    262   1.1      cgd 			rogue.hp_current -= (rogue.hp_max - MAX_HP);
    263   1.1      cgd 			rogue.hp_max = MAX_HP;
    264   1.1      cgd 		}
    265   1.1      cgd 		sprintf(buf, "%d(%d)", rogue.hp_current, rogue.hp_max);
    266   1.1      cgd 		mvaddstr(row, 27, buf);
    267   1.1      cgd 		pad(buf, 8);
    268   1.1      cgd 	}
    269   1.1      cgd 	if (stat_mask & STAT_STRENGTH) {
    270   1.1      cgd 		if (label) {
    271   1.1      cgd 			mvaddstr(row, 36, "Str: ");
    272   1.1      cgd 		}
    273   1.1      cgd 		if (rogue.str_max > MAX_STRENGTH) {
    274   1.1      cgd 			rogue.str_current -= (rogue.str_max - MAX_STRENGTH);
    275   1.1      cgd 			rogue.str_max = MAX_STRENGTH;
    276   1.1      cgd 		}
    277   1.1      cgd 		sprintf(buf, "%d(%d)", (rogue.str_current + add_strength),
    278   1.1      cgd 			rogue.str_max);
    279   1.1      cgd 		mvaddstr(row, 41, buf);
    280   1.1      cgd 		pad(buf, 6);
    281   1.1      cgd 	}
    282   1.1      cgd 	if (stat_mask & STAT_ARMOR) {
    283   1.1      cgd 		if (label) {
    284   1.1      cgd 			mvaddstr(row, 48, "Arm: ");
    285   1.1      cgd 		}
    286   1.1      cgd 		if (rogue.armor && (rogue.armor->d_enchant > MAX_ARMOR)) {
    287   1.1      cgd 			rogue.armor->d_enchant = MAX_ARMOR;
    288   1.1      cgd 		}
    289   1.1      cgd 		sprintf(buf, "%d", get_armor_class(rogue.armor));
    290   1.1      cgd 		mvaddstr(row, 53, buf);
    291   1.1      cgd 		pad(buf, 2);
    292   1.1      cgd 	}
    293   1.1      cgd 	if (stat_mask & STAT_EXP) {
    294   1.1      cgd 		if (label) {
    295   1.1      cgd 			mvaddstr(row, 56, "Exp: ");
    296   1.1      cgd 		}
    297   1.1      cgd 		if (rogue.exp_points > MAX_EXP) {
    298   1.1      cgd 			rogue.exp_points = MAX_EXP;
    299   1.1      cgd 		}
    300   1.1      cgd 		if (rogue.exp > MAX_EXP_LEVEL) {
    301   1.1      cgd 			rogue.exp = MAX_EXP_LEVEL;
    302   1.1      cgd 		}
    303   1.1      cgd 		sprintf(buf, "%d/%ld", rogue.exp, rogue.exp_points);
    304   1.1      cgd 		mvaddstr(row, 61, buf);
    305   1.1      cgd 		pad(buf, 11);
    306   1.1      cgd 	}
    307   1.1      cgd 	if (stat_mask & STAT_HUNGER) {
    308   1.1      cgd 		mvaddstr(row, 73, hunger_str);
    309   1.1      cgd 		clrtoeol();
    310   1.1      cgd 	}
    311   1.1      cgd 	refresh();
    312   1.1      cgd }
    313   1.1      cgd 
    314   1.6    lukem void
    315   1.1      cgd pad(s, n)
    316   1.7  hubertf 	const char *s;
    317   1.6    lukem 	short n;
    318   1.1      cgd {
    319   1.1      cgd 	short i;
    320   1.1      cgd 
    321   1.1      cgd 	for (i = strlen(s); i < n; i++) {
    322   1.1      cgd 		addch(' ');
    323   1.1      cgd 	}
    324   1.1      cgd }
    325   1.1      cgd 
    326   1.6    lukem void
    327   1.1      cgd save_screen()
    328   1.1      cgd {
    329   1.1      cgd 	FILE *fp;
    330   1.1      cgd 	short i, j;
    331   1.1      cgd 	char buf[DCOLS+2];
    332   1.1      cgd 	boolean found_non_blank;
    333   1.1      cgd 
    334   1.1      cgd 	if ((fp = fopen("rogue.screen", "w")) != NULL) {
    335   1.1      cgd 		for (i = 0; i < DROWS; i++) {
    336   1.1      cgd 			found_non_blank = 0;
    337   1.1      cgd 			for (j = (DCOLS - 1); j >= 0; j--) {
    338   1.1      cgd 				buf[j] = mvinch(i, j);
    339   1.1      cgd 				if (!found_non_blank) {
    340   1.1      cgd 					if ((buf[j] != ' ') || (j == 0)) {
    341   1.1      cgd 						buf[j + ((j == 0) ? 0 : 1)] = 0;
    342   1.1      cgd 						found_non_blank = 1;
    343   1.1      cgd 					}
    344   1.1      cgd 				}
    345   1.1      cgd 			}
    346   1.1      cgd 			fputs(buf, fp);
    347   1.1      cgd 			putc('\n', fp);
    348   1.1      cgd 		}
    349   1.1      cgd 		fclose(fp);
    350   1.1      cgd 	} else {
    351   1.1      cgd 		sound_bell();
    352   1.1      cgd 	}
    353   1.1      cgd }
    354   1.1      cgd 
    355   1.6    lukem void
    356   1.1      cgd sound_bell()
    357   1.1      cgd {
    358   1.1      cgd 	putchar(7);
    359   1.1      cgd 	fflush(stdout);
    360   1.1      cgd }
    361   1.1      cgd 
    362   1.1      cgd boolean
    363   1.1      cgd is_digit(ch)
    364   1.6    lukem 	short ch;
    365   1.1      cgd {
    366   1.1      cgd 	return((ch >= '0') && (ch <= '9'));
    367   1.1      cgd }
    368   1.1      cgd 
    369   1.6    lukem int
    370   1.1      cgd r_index(str, ch, last)
    371   1.7  hubertf 	const char *str;
    372   1.6    lukem 	int ch;
    373   1.6    lukem 	boolean last;
    374   1.1      cgd {
    375   1.1      cgd 	int i = 0;
    376   1.1      cgd 
    377   1.1      cgd 	if (last) {
    378   1.1      cgd 		for (i = strlen(str) - 1; i >= 0; i--) {
    379   1.1      cgd 			if (str[i] == ch) {
    380   1.1      cgd 				return(i);
    381   1.1      cgd 			}
    382   1.1      cgd 		}
    383   1.1      cgd 	} else {
    384   1.1      cgd 		for (i = 0; str[i]; i++) {
    385   1.1      cgd 			if (str[i] == ch) {
    386   1.1      cgd 				return(i);
    387   1.1      cgd 			}
    388   1.1      cgd 		}
    389   1.1      cgd 	}
    390   1.1      cgd 	return(-1);
    391   1.1      cgd }
    392