1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
|
/*
* Copyright (c) 1980, 1993
* The Regents of the University of California. All rights reserved.
*
* 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.
*/
#ifndef lint
static char sccsid[] = "@(#)play.c 8.1 (Berkeley) 5/31/93";
#endif /* not lint */
# include "trek.h"
# include "getpar.h"
# include <setjmp.h>
/*
** INSTRUCTION READ AND MAIN PLAY LOOP
**
** Well folks, this is it. Here we have the guts of the game.
** This routine executes moves. It sets up per-move variables,
** gets the command, and executes the command. After the command,
** it calls events() to use up time, attack() to have Klingons
** attack if the move was not free, and checkcond() to check up
** on how we are doing after the move.
*/
extern int abandon(), capture(), shield(), computer(), dcrept(),
destruct(), dock(), help(), impulse(), lrscan(),
warp(), dumpgame(), rest(), srscan(),
myreset(), torped(), visual(), setwarp(), undock(), phaser();
struct cvntab Comtab[] =
{
"abandon", "", abandon, 0,
"ca", "pture", capture, 0,
"cl", "oak", shield, -1,
"c", "omputer", computer, 0,
"da", "mages", dcrept, 0,
"destruct", "", destruct, 0,
"do", "ck", dock, 0,
"help", "", help, 0,
"i", "mpulse", impulse, 0,
"l", "rscan", lrscan, 0,
"m", "ove", warp, 0,
"p", "hasers", phaser, 0,
"ram", "", warp, 1,
"dump", "", dumpgame, 0,
"r", "est", rest, 0,
"sh", "ield", shield, 0,
"s", "rscan", srscan, 0,
"st", "atus", srscan, -1,
"terminate", "", myreset, 0,
"t", "orpedo", torped, 0,
"u", "ndock", undock, 0,
"v", "isual", visual, 0,
"w", "arp", setwarp, 0,
0
};
myreset()
{
extern jmp_buf env;
longjmp(env, 1);
}
play()
{
struct cvntab *r;
while (1)
{
Move.free = 1;
Move.time = 0.0;
Move.shldchg = 0;
Move.newquad = 0;
Move.resting = 0;
skiptonl(0);
r = getcodpar("\nCommand", Comtab);
(*r->value)(r->value2);
events(0);
attack(0);
checkcond();
}
}
|
