2001-08-29 22:23:44 +04:00
|
|
|
/* $NetBSD: execute.c,v 1.8 2001/08/29 18:23:44 jsm Exp $ */
|
1995-03-23 11:28:00 +03:00
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
/*
|
1995-03-23 11:28:00 +03:00
|
|
|
* Copyright (c) 1980, 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
1993-03-21 12:45:37 +03:00
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
|
|
* must display the following acknowledgement:
|
|
|
|
* This product includes software developed by the University of
|
|
|
|
* California, Berkeley and its contributors.
|
|
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
1997-10-12 21:45:06 +04:00
|
|
|
#include <sys/cdefs.h>
|
1993-03-21 12:45:37 +03:00
|
|
|
#ifndef lint
|
1995-03-23 11:28:00 +03:00
|
|
|
#if 0
|
|
|
|
static char sccsid[] = "@(#)execute.c 8.1 (Berkeley) 5/31/93";
|
|
|
|
#else
|
2001-08-29 22:23:44 +04:00
|
|
|
__RCSID("$NetBSD: execute.c,v 1.8 2001/08/29 18:23:44 jsm Exp $");
|
1995-03-23 11:28:00 +03:00
|
|
|
#endif
|
1993-03-21 12:45:37 +03:00
|
|
|
#endif /* not lint */
|
|
|
|
|
1997-10-12 21:45:06 +04:00
|
|
|
#include "monop.ext"
|
|
|
|
#include <fcntl.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <unistd.h>
|
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/stat.h>
|
|
|
|
#include <sys/time.h>
|
2001-08-29 22:23:44 +04:00
|
|
|
#include <time.h>
|
1993-03-21 12:45:37 +03:00
|
|
|
|
1999-08-21 14:40:03 +04:00
|
|
|
#define SEGSIZE 8192
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
typedef struct stat STAT;
|
|
|
|
typedef struct tm TIME;
|
|
|
|
|
1997-10-12 21:45:06 +04:00
|
|
|
static char buf[257];
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
static bool new_play; /* set if move on to new player */
|
|
|
|
|
1997-10-12 21:45:06 +04:00
|
|
|
static void show_move __P((void));
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
/*
|
|
|
|
* This routine executes the given command by index number
|
|
|
|
*/
|
1997-10-12 21:45:06 +04:00
|
|
|
void
|
1993-03-21 12:45:37 +03:00
|
|
|
execute(com_num)
|
1999-08-21 14:40:03 +04:00
|
|
|
int com_num;
|
1997-10-12 21:45:06 +04:00
|
|
|
{
|
1993-03-21 12:45:37 +03:00
|
|
|
new_play = FALSE; /* new_play is true if fixing */
|
|
|
|
(*func[com_num])();
|
|
|
|
notify();
|
|
|
|
force_morg();
|
|
|
|
if (new_play)
|
|
|
|
next_play();
|
|
|
|
else if (num_doub)
|
|
|
|
printf("%s rolled doubles. Goes again\n", cur_p->name);
|
|
|
|
}
|
1999-08-21 14:40:03 +04:00
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
/*
|
|
|
|
* This routine moves a piece around.
|
|
|
|
*/
|
1997-10-12 21:45:06 +04:00
|
|
|
void
|
|
|
|
do_move()
|
|
|
|
{
|
1999-08-21 14:40:03 +04:00
|
|
|
int r1, r2;
|
|
|
|
bool was_jail;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
new_play = was_jail = FALSE;
|
|
|
|
printf("roll is %d, %d\n", r1=roll(1, 6), r2=roll(1, 6));
|
|
|
|
if (cur_p->loc == JAIL) {
|
|
|
|
was_jail++;
|
|
|
|
if (!move_jail(r1, r2)) {
|
|
|
|
new_play++;
|
|
|
|
goto ret;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
if (r1 == r2 && ++num_doub == 3) {
|
|
|
|
printf("That's 3 doubles. You go to jail\n");
|
|
|
|
goto_jail();
|
|
|
|
new_play++;
|
|
|
|
goto ret;
|
|
|
|
}
|
|
|
|
move(r1+r2);
|
|
|
|
}
|
|
|
|
if (r1 != r2 || was_jail)
|
|
|
|
new_play++;
|
|
|
|
ret:
|
|
|
|
return;
|
|
|
|
}
|
1999-08-21 14:40:03 +04:00
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
/*
|
|
|
|
* This routine moves a normal move
|
|
|
|
*/
|
1997-10-12 21:45:06 +04:00
|
|
|
void
|
1993-03-21 12:45:37 +03:00
|
|
|
move(rl)
|
1999-08-21 14:40:03 +04:00
|
|
|
int rl;
|
1997-10-12 21:45:06 +04:00
|
|
|
{
|
1999-08-21 14:40:03 +04:00
|
|
|
int old_loc;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
old_loc = cur_p->loc;
|
|
|
|
cur_p->loc = (cur_p->loc + rl) % N_SQRS;
|
|
|
|
if (cur_p->loc < old_loc && rl > 0) {
|
|
|
|
cur_p->money += 200;
|
|
|
|
printf("You pass %s and get $200\n", board[0].name);
|
|
|
|
}
|
|
|
|
show_move();
|
|
|
|
}
|
1999-08-21 14:40:03 +04:00
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
/*
|
|
|
|
* This routine shows the results of a move
|
|
|
|
*/
|
1997-10-12 21:45:06 +04:00
|
|
|
static void
|
|
|
|
show_move()
|
|
|
|
{
|
1999-08-21 14:40:03 +04:00
|
|
|
SQUARE *sqp;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
sqp = &board[cur_p->loc];
|
|
|
|
printf("That puts you on %s\n", sqp->name);
|
|
|
|
switch (sqp->type) {
|
|
|
|
case SAFE:
|
|
|
|
printf("That is a safe place\n");
|
|
|
|
break;
|
|
|
|
case CC:
|
|
|
|
cc(); break;
|
|
|
|
case CHANCE:
|
|
|
|
chance(); break;
|
|
|
|
case INC_TAX:
|
|
|
|
inc_tax(); break;
|
|
|
|
case GOTO_J:
|
|
|
|
goto_jail(); break;
|
|
|
|
case LUX_TAX:
|
|
|
|
lux_tax(); break;
|
|
|
|
case PRPTY:
|
|
|
|
case RR:
|
|
|
|
case UTIL:
|
|
|
|
if (sqp->owner < 0) {
|
|
|
|
printf("That would cost $%d\n", sqp->cost);
|
|
|
|
if (getyn("Do you want to buy? ") == 0) {
|
|
|
|
buy(player, sqp);
|
|
|
|
cur_p->money -= sqp->cost;
|
|
|
|
}
|
|
|
|
else if (num_play > 2)
|
1997-10-12 21:45:06 +04:00
|
|
|
bid();
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
|
|
|
else if (sqp->owner == player)
|
|
|
|
printf("You own it.\n");
|
|
|
|
else
|
|
|
|
rent(sqp);
|
|
|
|
}
|
|
|
|
}
|
1999-08-21 14:40:03 +04:00
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
/*
|
|
|
|
* This routine saves the current game for use at a later date
|
|
|
|
*/
|
1997-10-12 21:45:06 +04:00
|
|
|
void
|
|
|
|
save()
|
|
|
|
{
|
1999-08-21 14:40:03 +04:00
|
|
|
char *sp;
|
|
|
|
int outf, num;
|
|
|
|
time_t t;
|
|
|
|
struct stat sb;
|
|
|
|
char *start, *end;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
printf("Which file do you wish to save it in? ");
|
|
|
|
sp = buf;
|
|
|
|
while ((*sp++=getchar()) != '\n')
|
|
|
|
continue;
|
|
|
|
*--sp = '\0';
|
|
|
|
|
|
|
|
/*
|
|
|
|
* check for existing files, and confirm overwrite if needed
|
|
|
|
*/
|
|
|
|
|
|
|
|
if (stat(buf, &sb) > -1
|
1997-10-12 21:45:06 +04:00
|
|
|
&& getyn("File exists. Do you wish to overwrite? ") > 0)
|
1993-03-21 12:45:37 +03:00
|
|
|
return;
|
|
|
|
|
|
|
|
if ((outf=creat(buf, 0644)) < 0) {
|
|
|
|
perror(buf);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
printf("\"%s\" ", buf);
|
|
|
|
time(&t); /* get current time */
|
|
|
|
strcpy(buf, ctime(&t));
|
|
|
|
for (sp = buf; *sp != '\n'; sp++)
|
|
|
|
continue;
|
|
|
|
*sp = '\0';
|
|
|
|
start = 0;
|
|
|
|
end = sbrk(0);
|
|
|
|
while (start < end) { /* write out entire data space */
|
|
|
|
num = start + 16 * 1024 > end ? end - start : 16 * 1024;
|
|
|
|
write(outf, start, num);
|
|
|
|
start += num;
|
|
|
|
}
|
|
|
|
close(outf);
|
|
|
|
printf("[%s]\n", buf);
|
|
|
|
}
|
1999-08-21 14:40:03 +04:00
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
/*
|
|
|
|
* This routine restores an old game from a file
|
|
|
|
*/
|
1997-10-12 21:45:06 +04:00
|
|
|
void
|
|
|
|
restore()
|
|
|
|
{
|
1999-08-21 14:40:03 +04:00
|
|
|
char *sp;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
printf("Which file do you wish to restore from? ");
|
|
|
|
for (sp = buf; (*sp=getchar()) != '\n'; sp++)
|
|
|
|
continue;
|
|
|
|
*sp = '\0';
|
|
|
|
rest_f(buf);
|
|
|
|
}
|
1999-08-21 14:40:03 +04:00
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
/*
|
|
|
|
* This does the actual restoring. It returns TRUE if the
|
|
|
|
* backup was successful, else false.
|
|
|
|
*/
|
1997-10-12 21:45:06 +04:00
|
|
|
int
|
1993-03-21 12:45:37 +03:00
|
|
|
rest_f(file)
|
Add use of `const' where appropriate to the games.
This merges in all such remaining changes from the Linux port of the
NetBSD games, except in hunt (where substantial changes from OpenBSD
need to be looked at).
Some such changes were previously covered in PRs bin/6041, bin/6146,
bin/6148, bin/6150, bin/6151, bin/6580, bin/6660, bin/7993, bin/7994,
bin/8039, bin/8057 and bin/8093.
1999-09-09 01:17:44 +04:00
|
|
|
const char *file;
|
1997-10-12 21:45:06 +04:00
|
|
|
{
|
1999-08-21 14:40:03 +04:00
|
|
|
char *sp;
|
|
|
|
int inf, num;
|
|
|
|
char buf[80];
|
|
|
|
char *start, *end;
|
|
|
|
STAT sbuf;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
1998-09-11 17:54:08 +04:00
|
|
|
if ((inf=open(file, O_RDONLY)) < 0) {
|
1993-03-21 12:45:37 +03:00
|
|
|
perror(file);
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
printf("\"%s\" ", file);
|
|
|
|
if (fstat(inf, &sbuf) < 0) { /* get file stats */
|
|
|
|
perror(file);
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
start = 0;
|
|
|
|
brk(end = start + sbuf.st_size);
|
|
|
|
while (start < end) { /* write out entire data space */
|
|
|
|
num = start + 16 * 1024 > end ? end - start : 16 * 1024;
|
|
|
|
read(inf, start, num);
|
|
|
|
start += num;
|
|
|
|
}
|
|
|
|
close(inf);
|
|
|
|
strcpy(buf, ctime(&sbuf.st_mtime));
|
|
|
|
for (sp = buf; *sp != '\n'; sp++)
|
|
|
|
continue;
|
|
|
|
*sp = '\0';
|
|
|
|
printf("[%s]\n", buf);
|
|
|
|
return TRUE;
|
|
|
|
}
|