]> git.cameronkatri.com Git - bsdgames-darwin.git/blob - trek/play.c
fix redundant decls and nested externs
[bsdgames-darwin.git] / trek / play.c
1 /* $NetBSD: play.c,v 1.7 2001/02/05 01:12:46 christos Exp $ */
2
3 /*
4 * Copyright (c) 1980, 1993
5 * The Regents of the University of California. All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. All advertising materials mentioning features or use of this software
16 * must display the following acknowledgement:
17 * This product includes software developed by the University of
18 * California, Berkeley and its contributors.
19 * 4. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * SUCH DAMAGE.
34 */
35
36 #include <sys/cdefs.h>
37 #ifndef lint
38 #if 0
39 static char sccsid[] = "@(#)play.c 8.1 (Berkeley) 5/31/93";
40 #else
41 __RCSID("$NetBSD: play.c,v 1.7 2001/02/05 01:12:46 christos Exp $");
42 #endif
43 #endif /* not lint */
44
45 #include <stdio.h>
46 #include <setjmp.h>
47 #include "trek.h"
48 #include "getpar.h"
49
50 /*
51 ** INSTRUCTION READ AND MAIN PLAY LOOP
52 **
53 ** Well folks, this is it. Here we have the guts of the game.
54 ** This routine executes moves. It sets up per-move variables,
55 ** gets the command, and executes the command. After the command,
56 ** it calls events() to use up time, attack() to have Klingons
57 ** attack if the move was not free, and checkcond() to check up
58 ** on how we are doing after the move.
59 */
60
61 extern jmp_buf env;
62
63 const struct cvntab Comtab[] =
64 {
65 { "abandon", "", abandon, 0 },
66 { "ca", "pture", capture, 0 },
67 { "cl", "oak", shield, -1 },
68 { "c", "omputer", computer, 0 },
69 { "da", "mages", dcrept, 0 },
70 { "destruct", "", destruct, 0 },
71 { "do", "ck", dock, 0 },
72 { "help", "", help, 0 },
73 { "i", "mpulse", impulse, 0 },
74 { "l", "rscan", lrscan, 0 },
75 { "m", "ove", dowarp, 0 },
76 { "p", "hasers", phaser, 0 },
77 { "ram", "", dowarp, 1 },
78 { "dump", "", dumpgame, 0 },
79 { "r", "est", rest, 0 },
80 { "sh", "ield", shield, 0 },
81 { "s", "rscan", srscan, 0 },
82 { "st", "atus", srscan, -1 },
83 { "terminate", "", myreset, 0 },
84 { "t", "orpedo", torped, 0 },
85 { "u", "ndock", undock, 0 },
86 { "v", "isual", visual, 0 },
87 { "w", "arp", setwarp, 0 },
88 { NULL, NULL, NULL, 0 }
89 };
90
91 /*ARGSUSED*/
92 void
93 myreset(v)
94 int v __attribute__((__unused__));
95 {
96
97 longjmp(env, 1);
98 }
99
100 void
101 play()
102 {
103 const struct cvntab *r;
104
105 while (1)
106 {
107 Move.free = 1;
108 Move.time = 0.0;
109 Move.shldchg = 0;
110 Move.newquad = 0;
111 Move.resting = 0;
112 skiptonl(0);
113 r = getcodpar("\nCommand", Comtab);
114 (*r->value)(r->value2);
115 events(0);
116 attack(0);
117 checkcond();
118 }
119 }