2 * Copyright (c) 1990, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * @(#)input.c 8.1 (Berkeley) 5/31/93
37 * $FreeBSD: src/games/atc/input.c,v 1.7 2000/02/27 23:02:47 mph Exp $
38 * $DragonFly: src/games/atc/input.c,v 1.4 2006/09/09 02:21:49 pavalos Exp $
42 * Copyright (c) 1987 by Ed James, UC Berkeley. All rights reserved.
44 * Copy permission is hereby granted provided that this notice is
45 * retained on all partial or complete copies.
47 * For more info on this and all of my stuff, mail edjames@berkeley.edu.
55 #include "pathnames.h"
61 #define REDRAWTOKEN '\014' /* CTRL(L) */
62 #define SHELLTOKEN '!'
64 #define ALPHATOKEN 256
71 const char *(*func)(int);
87 #define T_RULE stack[level].rule
88 #define T_STATE stack[level].state
89 #define T_STR stack[level].str
90 #define T_POS stack[level].pos
91 #define T_CH stack[level].ch
93 #define NUMELS(a) (sizeof (a) / sizeof (*(a)))
95 #define NUMSTATES NUMELS(st)
98 static void rezero(void);
99 static void push(int, int);
100 static void noise(void);
101 static int gettoken(void);
102 static const char *setplane(int);
103 static const char *turn(int);
104 static const char *circle(int);
105 static const char *left(int);
106 static const char *right(int);
107 static const char *Left(int);
108 static const char *Right(int);
109 static const char *delayb(int);
110 static const char *beacon(int);
111 static const char *ex_it(int);
112 static const char *airport(int);
113 static const char *climb(int);
114 static const char *descend(int);
115 static const char *setalt(int);
116 static const char *setrelalt(int);
117 static const char *benum(int);
118 static const char *to_dir(int);
119 static const char *rel_dir(int);
120 static const char *mark(int);
121 static const char *unmark(int);
122 static const char *ignore(int);
124 RULE state0[] = { { ALPHATOKEN, 1, "%c:", setplane},
125 { RETTOKEN, -1, "", NULL },
126 { HELPTOKEN, 12, " [a-z]<ret>", NULL }},
127 state1[] = { { 't', 2, " turn", turn },
128 { 'a', 3, " altitude:", NULL },
129 { 'c', 4, " circle", circle },
130 { 'm', 7, " mark", mark },
131 { 'u', 7, " unmark", unmark },
132 { 'i', 7, " ignore", ignore },
133 { HELPTOKEN, 12, " tacmui", NULL }},
134 state2[] = { { 'l', 6, " left", left },
135 { 'r', 6, " right", right },
136 { 'L', 4, " left 90", Left },
137 { 'R', 4, " right 90", Right },
138 { 't', 11, " towards", NULL },
139 { 'w', 4, " to 0", to_dir },
140 { 'e', 4, " to 45", to_dir },
141 { 'd', 4, " to 90", to_dir },
142 { 'c', 4, " to 135", to_dir },
143 { 'x', 4, " to 180", to_dir },
144 { 'z', 4, " to 225", to_dir },
145 { 'a', 4, " to 270", to_dir },
146 { 'q', 4, " to 315", to_dir },
147 { HELPTOKEN, 12, " lrLRt<dir>", NULL }},
148 state3[] = { { '+', 10, " climb", climb },
149 { 'c', 10, " climb", climb },
150 { '-', 10, " descend", descend },
151 { 'd', 10, " descend", descend },
152 { NUMTOKEN, 7, " %c000 feet", setalt },
153 { HELPTOKEN, 12, " +-cd[0-9]", NULL }},
154 state4[] = { { '@', 9, " at", NULL },
155 { 'a', 9, " at", NULL },
156 { RETTOKEN, -1, "", NULL },
157 { HELPTOKEN, 12, " @a<ret>", NULL }},
158 state5[] = { { NUMTOKEN, 7, "%c", delayb },
159 { HELPTOKEN, 12, " [0-9]", NULL }},
160 state6[] = { { '@', 9, " at", NULL },
161 { 'a', 9, " at", NULL },
162 { 'w', 4, " 0", rel_dir },
163 { 'e', 4, " 45", rel_dir },
164 { 'd', 4, " 90", rel_dir },
165 { 'c', 4, " 135", rel_dir },
166 { 'x', 4, " 180", rel_dir },
167 { 'z', 4, " 225", rel_dir },
168 { 'a', 4, " 270", rel_dir },
169 { 'q', 4, " 315", rel_dir },
170 { RETTOKEN, -1, "", NULL },
171 { HELPTOKEN, 12, " @a<dir><ret>",NULL }},
172 state7[] = { { RETTOKEN, -1, "", NULL },
173 { HELPTOKEN, 12, " <ret>", NULL }},
174 state8[] = { { NUMTOKEN, 4, "%c", benum },
175 { HELPTOKEN, 12, " [0-9]", NULL }},
176 state9[] = { { 'b', 5, " beacon #", NULL },
177 { '*', 5, " beacon #", NULL },
178 { HELPTOKEN, 12, " b*", NULL }},
179 state10[] = { { NUMTOKEN, 7, " %c000 ft", setrelalt},
180 { HELPTOKEN, 12, " [0-9]", NULL }},
181 state11[] = { { 'b', 8, " beacon #", beacon },
182 { '*', 8, " beacon #", beacon },
183 { 'e', 8, " exit #", ex_it },
184 { 'a', 8, " airport #", airport },
185 { HELPTOKEN, 12, " b*ea", NULL }},
186 state12[] = { { -1, -1, "", NULL }};
188 #define DEF_STATE(s) { NUMELS(s), (s) }
191 DEF_STATE(state0), DEF_STATE(state1), DEF_STATE(state2),
192 DEF_STATE(state3), DEF_STATE(state4), DEF_STATE(state5),
193 DEF_STATE(state6), DEF_STATE(state7), DEF_STATE(state8),
194 DEF_STATE(state9), DEF_STATE(state10), DEF_STATE(state11),
199 STACK stack[MAXDEPTH];
202 int dest_type, dest_no, dir;
234 push(int ruleno, int ch)
236 int newstate, newpos;
238 (void)sprintf(T_STR, st[T_STATE].rule[ruleno].str, tval);
241 newstate = st[T_STATE].rule[ruleno].to_state;
242 newpos = T_POS + strlen(T_STR);
244 ioaddstr(T_POS, T_STR);
259 const char *s, *(*func)(int);
266 if (c == tty_new.c_cc[VERASE]) {
269 } else if (c == tty_new.c_cc[VKILL]) {
274 for (i = 0; i < st[T_STATE].num_rules; i++) {
275 if (st[T_STATE].rule[i].token == c ||
276 st[T_STATE].rule[i].token == tval) {
277 push(i, (c >= ALPHATOKEN) ? tval : c);
285 } while (T_STATE != -1);
288 return (1); /* forced update */
290 dest_type = T_NODEST;
292 for (i = 0; i < level; i++) {
293 func = st[stack[i].state].rule[stack[i].rule].func;
295 if ((s = (*func)(stack[i].ch)) != NULL) {
296 ioerror(stack[i].pos, strlen(stack[i].str), s);
301 pp = findplane(p.plane_no);
302 if (pp->new_altitude != p.new_altitude)
303 pp->new_altitude = p.new_altitude;
304 else if (pp->status != p.status)
305 pp->status = p.status;
307 pp->new_dir = p.new_dir;
308 pp->delayd = p.delayd;
309 pp->delayd_no = p.delayd_no;
324 while ((tval = getAChar()) == REDRAWTOKEN || tval == SHELLTOKEN)
326 if (tval == SHELLTOKEN)
328 struct itimerval itv;
329 itv.it_value.tv_sec = 0;
330 itv.it_value.tv_usec = 0;
331 setitimer(ITIMER_REAL, &itv, NULL);
332 if (fork() == 0) /* child */
340 /* run user's favorite shell */
341 if ((shell = getenv("SHELL")) != NULL)
343 base = strrchr(shell, '/');
348 execl(shell, base, NULL);
351 execl(_PATH_BSHELL, "sh", NULL);
357 tcsetattr(fileno(stdin), TCSANOW, &tty_new);
358 itv.it_value.tv_sec = 0;
359 itv.it_value.tv_usec = 1;
360 itv.it_interval.tv_sec = sp->update_secs;
361 itv.it_interval.tv_usec = 0;
362 setitimer(ITIMER_REAL, &itv, NULL);
369 else if (isalpha(tval))
380 pp = findplane(number(c));
382 return ("Unknown Plane");
383 bcopy(pp, &p, sizeof (p));
392 return ("Planes at airports may not change direction");
397 circle(__unused int c)
400 return ("Planes cannot circle on the ground");
409 p.new_dir = p.dir - 1;
416 right(__unused int c)
419 p.new_dir = p.dir + 1;
420 if (p.new_dir >= MAXDIR)
428 p.new_dir = p.dir - 2;
435 Right(__unused int c)
437 p.new_dir = p.dir + 2;
438 if (p.new_dir >= MAXDIR)
450 if (c >= sp->num_beacons)
451 return ("Unknown beacon");
452 xdiff = sp->beacon[c].x - p.xpos;
454 ydiff = sp->beacon[c].y - p.ypos;
456 if (xdiff != displacement[p.dir].dx || ydiff != displacement[p.dir].dy)
457 return ("Beacon is not in flight path");
461 if (dest_type != T_NODEST) {
464 xdiff = sp->beacon[dest_no].x - sp->beacon[c].x;
465 ydiff = sp->beacon[dest_no].y - sp->beacon[c].y;
468 xdiff = sp->exit[dest_no].x - sp->beacon[c].x;
469 ydiff = sp->exit[dest_no].y - sp->beacon[c].y;
472 xdiff = sp->airport[dest_no].x - sp->beacon[c].x;
473 ydiff = sp->airport[dest_no].y - sp->beacon[c].y;
476 return ("Bad case in delayb! Get help!");
479 if (xdiff == 0 && ydiff == 0)
480 return ("Would already be there");
481 p.new_dir = DIR_FROM_DXDY(xdiff, ydiff);
482 if (p.new_dir == p.dir)
483 return ("Already going in that direction");
489 beacon(__unused int c)
491 dest_type = T_BEACON;
496 ex_it(__unused int c)
503 airport(__unused int c)
505 dest_type = T_AIRPORT;
510 climb(__unused int c)
517 descend(__unused int c)
526 if ((p.altitude == c - '0') && (p.new_altitude == p.altitude))
527 return ("Already at that altitude");
528 p.new_altitude = c - '0';
536 return ("altitude not changed");
540 p.new_altitude = p.altitude + c - '0';
543 p.new_altitude = p.altitude - (c - '0');
546 return ("Unknown case in setrelalt! Get help!");
549 if (p.new_altitude < 0)
550 return ("Altitude would be too low");
551 else if (p.new_altitude > 9)
552 return ("Altitude would be too high");
563 if (c >= sp->num_beacons)
564 return ("Unknown beacon");
565 p.new_dir = DIR_FROM_DXDY(sp->beacon[c].x - p.xpos,
566 sp->beacon[c].y - p.ypos);
569 if (c >= sp->num_exits)
570 return ("Unknown exit");
571 p.new_dir = DIR_FROM_DXDY(sp->exit[c].x - p.xpos,
572 sp->exit[c].y - p.ypos);
575 if (c >= sp->num_airports)
576 return ("Unknown airport");
577 p.new_dir = DIR_FROM_DXDY(sp->airport[c].x - p.xpos,
578 sp->airport[c].y - p.ypos);
581 return ("Unknown case in benum! Get help!");
590 p.new_dir = dir_no(c);
602 p.new_dir = p.dir - angle;
607 p.new_dir = p.dir + angle;
608 if (p.new_dir >= MAXDIR)
612 return ("Bizarre direction in rel_dir! Get help!");
622 return ("Cannot mark planes on the ground");
623 if (p.status == S_MARKED)
624 return ("Already marked");
630 unmark(__unused int c)
633 return ("Cannot unmark planes on the ground");
634 if (p.status == S_UNMARKED)
635 return ("Already unmarked");
636 p.status = S_UNMARKED;
641 ignore(__unused int c)
644 return ("Cannot ignore planes on the ground");
645 if (p.status == S_IGNORED)
646 return ("Already ignored");
647 p.status = S_IGNORED;
657 case 'w': dirno = 0; break;
658 case 'e': dirno = 1; break;
659 case 'd': dirno = 2; break;
660 case 'c': dirno = 3; break;
661 case 'x': dirno = 4; break;
662 case 'z': dirno = 5; break;
663 case 'a': dirno = 6; break;
664 case 'q': dirno = 7; break;
666 fprintf(stderr, "bad character in dir_no\n");