Home | History | Annotate | Line # | Download | only in mille
misc.c revision 1.4
      1  1.4  cgd /*	$NetBSD: misc.c,v 1.4 1995/03/24 05:01:54 cgd Exp $	*/
      2  1.4  cgd 
      3  1.1  cgd /*
      4  1.3  jtc  * Copyright (c) 1983, 1993
      5  1.3  jtc  *	The Regents of the University of California.  All rights reserved.
      6  1.1  cgd  *
      7  1.1  cgd  * Redistribution and use in source and binary forms, with or without
      8  1.1  cgd  * modification, are permitted provided that the following conditions
      9  1.1  cgd  * are met:
     10  1.1  cgd  * 1. Redistributions of source code must retain the above copyright
     11  1.1  cgd  *    notice, this list of conditions and the following disclaimer.
     12  1.1  cgd  * 2. Redistributions in binary form must reproduce the above copyright
     13  1.1  cgd  *    notice, this list of conditions and the following disclaimer in the
     14  1.1  cgd  *    documentation and/or other materials provided with the distribution.
     15  1.1  cgd  * 3. All advertising materials mentioning features or use of this software
     16  1.1  cgd  *    must display the following acknowledgement:
     17  1.1  cgd  *	This product includes software developed by the University of
     18  1.1  cgd  *	California, Berkeley and its contributors.
     19  1.1  cgd  * 4. Neither the name of the University nor the names of its contributors
     20  1.1  cgd  *    may be used to endorse or promote products derived from this software
     21  1.1  cgd  *    without specific prior written permission.
     22  1.1  cgd  *
     23  1.1  cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     24  1.1  cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     25  1.1  cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     26  1.1  cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     27  1.1  cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     28  1.1  cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     29  1.1  cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     30  1.1  cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     31  1.1  cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     32  1.1  cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     33  1.1  cgd  * SUCH DAMAGE.
     34  1.1  cgd  */
     35  1.1  cgd 
     36  1.1  cgd #ifndef lint
     37  1.4  cgd #if 0
     38  1.4  cgd static char sccsid[] = "@(#)misc.c	8.1 (Berkeley) 5/31/93";
     39  1.4  cgd #else
     40  1.4  cgd static char rcsid[] = "$NetBSD: misc.c,v 1.4 1995/03/24 05:01:54 cgd Exp $";
     41  1.4  cgd #endif
     42  1.1  cgd #endif /* not lint */
     43  1.1  cgd 
     44  1.3  jtc #include <sys/file.h>
     45  1.3  jtc #include <termios.h>
     46  1.3  jtc 
     47  1.1  cgd #include	"mille.h"
     48  1.1  cgd #ifndef	unctrl
     49  1.1  cgd #include	"unctrl.h"
     50  1.1  cgd #endif
     51  1.1  cgd 
     52  1.1  cgd 
     53  1.1  cgd # ifdef	attron
     54  1.1  cgd #	include	<term.h>
     55  1.1  cgd #	define	_tty	cur_term->Nttyb
     56  1.1  cgd # endif	attron
     57  1.1  cgd 
     58  1.1  cgd /*
     59  1.1  cgd  * @(#)misc.c	1.2 (Berkeley) 3/28/83
     60  1.1  cgd  */
     61  1.1  cgd 
     62  1.1  cgd #define	NUMSAFE	4
     63  1.1  cgd 
     64  1.1  cgd /* VARARGS1 */
     65  1.1  cgd error(str, arg)
     66  1.1  cgd char	*str;
     67  1.1  cgd {
     68  1.1  cgd 	stdscr = Score;
     69  1.1  cgd 	mvprintw(ERR_Y, ERR_X, str, arg);
     70  1.1  cgd 	clrtoeol();
     71  1.1  cgd 	putchar('\07');
     72  1.1  cgd 	refresh();
     73  1.1  cgd 	stdscr = Board;
     74  1.1  cgd 	return FALSE;
     75  1.1  cgd }
     76  1.1  cgd 
     77  1.1  cgd CARD
     78  1.1  cgd getcard()
     79  1.1  cgd {
     80  1.1  cgd 	reg int		c, c1;
     81  1.1  cgd 
     82  1.1  cgd 	for (;;) {
     83  1.1  cgd 		while ((c = readch()) == '\n' || c == '\r' || c == ' ')
     84  1.1  cgd 			continue;
     85  1.1  cgd 		if (islower(c))
     86  1.1  cgd 			c = toupper(c);
     87  1.1  cgd 		if (c == killchar() || c == erasechar())
     88  1.1  cgd 			return -1;
     89  1.1  cgd 		addstr(unctrl(c));
     90  1.1  cgd 		clrtoeol();
     91  1.1  cgd 		switch (c) {
     92  1.1  cgd 		  case '1':	case '2':	case '3':
     93  1.1  cgd 		  case '4':	case '5':	case '6':
     94  1.1  cgd 			c -= '0';
     95  1.1  cgd 			break;
     96  1.1  cgd 		  case '0':	case 'P':	case 'p':
     97  1.1  cgd 			c = 0;
     98  1.1  cgd 			break;
     99  1.1  cgd 		  default:
    100  1.1  cgd 			putchar('\07');
    101  1.1  cgd 			addch('\b');
    102  1.1  cgd 			if (!isprint(c))
    103  1.1  cgd 				addch('\b');
    104  1.1  cgd 			c = -1;
    105  1.1  cgd 			break;
    106  1.1  cgd 		}
    107  1.1  cgd 		refresh();
    108  1.1  cgd 		if (c >= 0) {
    109  1.1  cgd 			while ((c1=readch()) != '\r' && c1 != '\n' && c1 != ' ')
    110  1.1  cgd 				if (c1 == killchar())
    111  1.1  cgd 					return -1;
    112  1.1  cgd 				else if (c1 == erasechar()) {
    113  1.1  cgd 					addch('\b');
    114  1.1  cgd 					clrtoeol();
    115  1.1  cgd 					refresh();
    116  1.1  cgd 					goto cont;
    117  1.1  cgd 				}
    118  1.1  cgd 				else
    119  1.1  cgd 					write(0, "\07", 1);
    120  1.1  cgd 			return c;
    121  1.1  cgd 		}
    122  1.1  cgd cont:		;
    123  1.1  cgd 	}
    124  1.1  cgd }
    125  1.1  cgd 
    126  1.1  cgd check_ext(forcomp)
    127  1.1  cgd reg bool	forcomp; {
    128  1.1  cgd 
    129  1.1  cgd 
    130  1.1  cgd 	if (End == 700)
    131  1.1  cgd 		if (Play == PLAYER) {
    132  1.1  cgd 			if (getyn(EXTENSIONPROMPT)) {
    133  1.1  cgd extend:
    134  1.1  cgd 				if (!forcomp)
    135  1.1  cgd 					End = 1000;
    136  1.1  cgd 				return TRUE;
    137  1.1  cgd 			}
    138  1.1  cgd 			else {
    139  1.1  cgd done:
    140  1.1  cgd 				if (!forcomp)
    141  1.1  cgd 					Finished = TRUE;
    142  1.1  cgd 				return FALSE;
    143  1.1  cgd 			}
    144  1.1  cgd 		}
    145  1.1  cgd 		else {
    146  1.1  cgd 			reg PLAY	*pp, *op;
    147  1.1  cgd 			reg int		i, safe, miles;
    148  1.1  cgd 
    149  1.1  cgd 			pp = &Player[COMP];
    150  1.1  cgd 			op = &Player[PLAYER];
    151  1.1  cgd 			for (safe = 0, i = 0; i < NUMSAFE; i++)
    152  1.1  cgd 				if (pp->safety[i] != S_UNKNOWN)
    153  1.1  cgd 					safe++;
    154  1.1  cgd 			if (safe < 2)
    155  1.1  cgd 				goto done;
    156  1.1  cgd 			if (op->mileage == 0 || onecard(op)
    157  1.1  cgd 			    || (op->can_go && op->mileage >= 500))
    158  1.1  cgd 				goto done;
    159  1.1  cgd 			for (miles = 0, i = 0; i < NUMSAFE; i++)
    160  1.1  cgd 				if (op->safety[i] != S_PLAYED
    161  1.1  cgd 				    && pp->safety[i] == S_UNKNOWN)
    162  1.1  cgd 					miles++;
    163  1.1  cgd 			if (miles + safe == NUMSAFE)
    164  1.1  cgd 				goto extend;
    165  1.1  cgd 			for (miles = 0, i = 0; i < HAND_SZ; i++)
    166  1.1  cgd 				if ((safe = pp->hand[i]) <= C_200)
    167  1.1  cgd 					miles += Value[safe];
    168  1.1  cgd 			if (miles + (Topcard - Deck) * 3 > 1000)
    169  1.1  cgd 				goto extend;
    170  1.1  cgd 			goto done;
    171  1.1  cgd 		}
    172  1.1  cgd 	else
    173  1.1  cgd 		goto done;
    174  1.1  cgd }
    175  1.1  cgd 
    176  1.1  cgd /*
    177  1.1  cgd  *	Get a yes or no answer to the given question.  Saves are
    178  1.1  cgd  * also allowed.  Return TRUE if the answer was yes, FALSE if no.
    179  1.1  cgd  */
    180  1.1  cgd getyn(promptno)
    181  1.1  cgd register int	promptno; {
    182  1.1  cgd 
    183  1.1  cgd 	reg char	c;
    184  1.1  cgd 
    185  1.1  cgd 	Saved = FALSE;
    186  1.1  cgd 	for (;;) {
    187  1.1  cgd 		leaveok(Board, FALSE);
    188  1.1  cgd 		prompt(promptno);
    189  1.1  cgd 		clrtoeol();
    190  1.1  cgd 		refresh();
    191  1.1  cgd 		switch (c = readch()) {
    192  1.1  cgd 		  case 'n':	case 'N':
    193  1.1  cgd 			addch('N');
    194  1.1  cgd 			refresh();
    195  1.1  cgd 			leaveok(Board, TRUE);
    196  1.1  cgd 			return FALSE;
    197  1.1  cgd 		  case 'y':	case 'Y':
    198  1.1  cgd 			addch('Y');
    199  1.1  cgd 			refresh();
    200  1.1  cgd 			leaveok(Board, TRUE);
    201  1.1  cgd 			return TRUE;
    202  1.1  cgd 		  case 's':	case 'S':
    203  1.1  cgd 			addch('S');
    204  1.1  cgd 			refresh();
    205  1.1  cgd 			Saved = save();
    206  1.1  cgd 			continue;
    207  1.3  jtc 		  case CTRL('L'):
    208  1.3  jtc 			wrefresh(curscr);
    209  1.3  jtc 			break;
    210  1.1  cgd 		  default:
    211  1.1  cgd 			addstr(unctrl(c));
    212  1.1  cgd 			refresh();
    213  1.1  cgd 			putchar('\07');
    214  1.1  cgd 			break;
    215  1.1  cgd 		}
    216  1.1  cgd 	}
    217  1.1  cgd }
    218  1.1  cgd 
    219  1.1  cgd /*
    220  1.1  cgd  *	Check to see if more games are desired.  If not, and game
    221  1.1  cgd  * came from a saved file, make sure that they don't want to restore
    222  1.1  cgd  * it.  Exit appropriately.
    223  1.1  cgd  */
    224  1.1  cgd check_more() {
    225  1.1  cgd 
    226  1.1  cgd 	On_exit = TRUE;
    227  1.1  cgd 	if (Player[PLAYER].total >= 5000 || Player[COMP].total >= 5000)
    228  1.1  cgd 		if (getyn(ANOTHERGAMEPROMPT))
    229  1.1  cgd 			return;
    230  1.1  cgd 		else {
    231  1.1  cgd 			/*
    232  1.1  cgd 			 * must do accounting normally done in main()
    233  1.1  cgd 			 */
    234  1.1  cgd 			if (Player[PLAYER].total > Player[COMP].total)
    235  1.1  cgd 				Player[PLAYER].games++;
    236  1.1  cgd 			else if (Player[PLAYER].total < Player[COMP].total)
    237  1.1  cgd 				Player[COMP].games++;
    238  1.1  cgd 			Player[COMP].total = 0;
    239  1.1  cgd 			Player[PLAYER].total = 0;
    240  1.1  cgd 		}
    241  1.1  cgd 	else
    242  1.1  cgd 		if (getyn(ANOTHERHANDPROMPT))
    243  1.1  cgd 			return;
    244  1.1  cgd 	if (!Saved && getyn(SAVEGAMEPROMPT))
    245  1.1  cgd 		if (!save())
    246  1.1  cgd 			return;
    247  1.3  jtc 	die(0);
    248  1.1  cgd }
    249  1.1  cgd 
    250  1.1  cgd readch()
    251  1.1  cgd {
    252  1.1  cgd 	reg int		cnt;
    253  1.1  cgd 	static char	c;
    254  1.1  cgd 
    255  1.1  cgd 	for (cnt = 0; read(0, &c, 1) <= 0; cnt++)
    256  1.1  cgd 		if (cnt > 100)
    257  1.1  cgd 			exit(1);
    258  1.1  cgd 	return c;
    259  1.1  cgd }
    260