]> git.cameronkatri.com Git - bsdgames-darwin.git/blob - robots/move.c
curses needs termcap
[bsdgames-darwin.git] / robots / move.c
1 /* $NetBSD: move.c,v 1.5 1997/05/23 23:40:19 jtc 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 #ifndef lint
37 #if 0
38 static char sccsid[] = "@(#)move.c 8.1 (Berkeley) 5/31/93";
39 #else
40 static char rcsid[] = "$NetBSD: move.c,v 1.5 1997/05/23 23:40:19 jtc Exp $";
41 #endif
42 #endif /* not lint */
43
44 #include <sys/ttydefaults.h>
45 #include <ctype.h>
46 #include "robots.h"
47
48 # define ESC '\033'
49
50 /*
51 * get_move:
52 * Get and execute a move from the player
53 */
54 get_move()
55 {
56 register int c;
57 register int y, x, lastmove;
58 static COORD newpos;
59
60 if (Waiting)
61 return;
62
63 #ifdef FANCY
64 if (Pattern_roll) {
65 if (Next_move >= Move_list)
66 lastmove = *Next_move;
67 else
68 lastmove = -1; /* flag for "first time in" */
69 }
70 #endif
71 for (;;) {
72 if (Teleport && must_telep())
73 goto teleport;
74 if (Running)
75 c = Run_ch;
76 else if (Count != 0)
77 c = Cnt_move;
78 #ifdef FANCY
79 else if (Num_robots > 1 && Stand_still)
80 c = '>';
81 else if (Num_robots > 1 && Pattern_roll) {
82 if (*++Next_move == '\0') {
83 if (lastmove < 0)
84 goto over;
85 Next_move = Move_list;
86 }
87 c = *Next_move;
88 mvaddch(0, 0, c);
89 if (c == lastmove)
90 goto over;
91 }
92 #endif
93 else {
94 over:
95 c = getchar();
96 if (isdigit(c)) {
97 Count = (c - '0');
98 while (isdigit(c = getchar()))
99 Count = Count * 10 + (c - '0');
100 if (c == ESC)
101 goto over;
102 Cnt_move = c;
103 if (Count)
104 leaveok(stdscr, TRUE);
105 }
106 }
107
108 switch (c) {
109 case ' ':
110 case '.':
111 if (do_move(0, 0))
112 goto ret;
113 break;
114 case 'y':
115 if (do_move(-1, -1))
116 goto ret;
117 break;
118 case 'k':
119 if (do_move(-1, 0))
120 goto ret;
121 break;
122 case 'u':
123 if (do_move(-1, 1))
124 goto ret;
125 break;
126 case 'h':
127 if (do_move(0, -1))
128 goto ret;
129 break;
130 case 'l':
131 if (do_move(0, 1))
132 goto ret;
133 break;
134 case 'b':
135 if (do_move(1, -1))
136 goto ret;
137 break;
138 case 'j':
139 if (do_move(1, 0))
140 goto ret;
141 break;
142 case 'n':
143 if (do_move(1, 1))
144 goto ret;
145 break;
146 case 'Y': case 'U': case 'H': case 'J':
147 case 'K': case 'L': case 'B': case 'N':
148 case '>':
149 Running = TRUE;
150 if (c == '>')
151 Run_ch = ' ';
152 else
153 Run_ch = tolower(c);
154 leaveok(stdscr, TRUE);
155 break;
156 case 'q':
157 case 'Q':
158 if (query("Really quit?"))
159 quit();
160 refresh();
161 break;
162 case 'w':
163 case 'W':
164 Waiting = TRUE;
165 leaveok(stdscr, TRUE);
166 goto ret;
167 case 't':
168 case 'T':
169 teleport:
170 Running = FALSE;
171 mvaddch(My_pos.y, My_pos.x, ' ');
172 My_pos = *rnd_pos();
173 mvaddch(My_pos.y, My_pos.x, PLAYER);
174 leaveok(stdscr, FALSE);
175 refresh();
176 flush_in();
177 goto ret;
178 case CTRL('L'):
179 wrefresh(curscr);
180 break;
181 case EOF:
182 break;
183 default:
184 putchar(CTRL('G'));
185 reset_count();
186 fflush(stdout);
187 break;
188 }
189 }
190 ret:
191 if (Count > 0)
192 if (--Count == 0)
193 leaveok(stdscr, FALSE);
194 }
195
196 /*
197 * must_telep:
198 * Must I teleport; i.e., is there anywhere I can move without
199 * being eaten?
200 */
201 must_telep()
202 {
203 register int x, y;
204 static COORD newpos;
205
206 #ifdef FANCY
207 if (Stand_still && Num_robots > 1 && eaten(&My_pos))
208 return TRUE;
209 #endif
210
211 for (y = -1; y <= 1; y++) {
212 newpos.y = My_pos.y + y;
213 if (newpos.y <= 0 || newpos.y >= Y_FIELDSIZE)
214 continue;
215 for (x = -1; x <= 1; x++) {
216 newpos.x = My_pos.x + x;
217 if (newpos.x <= 0 || newpos.x >= X_FIELDSIZE)
218 continue;
219 if (Field[newpos.y][newpos.x] > 0)
220 continue;
221 if (!eaten(&newpos))
222 return FALSE;
223 }
224 }
225 return TRUE;
226 }
227
228 /*
229 * do_move:
230 * Execute a move
231 */
232 do_move(dy, dx)
233 int dy, dx;
234 {
235 static COORD newpos;
236
237 newpos.y = My_pos.y + dy;
238 newpos.x = My_pos.x + dx;
239 if (newpos.y <= 0 || newpos.y >= Y_FIELDSIZE ||
240 newpos.x <= 0 || newpos.x >= X_FIELDSIZE ||
241 Field[newpos.y][newpos.x] > 0 || eaten(&newpos)) {
242 if (Running) {
243 Running = FALSE;
244 leaveok(stdscr, FALSE);
245 move(My_pos.y, My_pos.x);
246 refresh();
247 }
248 else {
249 putchar(CTRL('G'));
250 reset_count();
251 }
252 return FALSE;
253 }
254 else if (dy == 0 && dx == 0)
255 return TRUE;
256 mvaddch(My_pos.y, My_pos.x, ' ');
257 My_pos = newpos;
258 mvaddch(My_pos.y, My_pos.x, PLAYER);
259 if (!jumping())
260 refresh();
261 return TRUE;
262 }
263
264 /*
265 * eaten:
266 * Player would get eaten at this place
267 */
268 eaten(pos)
269 register COORD *pos;
270 {
271 register int x, y;
272
273 for (y = pos->y - 1; y <= pos->y + 1; y++) {
274 if (y <= 0 || y >= Y_FIELDSIZE)
275 continue;
276 for (x = pos->x - 1; x <= pos->x + 1; x++) {
277 if (x <= 0 || x >= X_FIELDSIZE)
278 continue;
279 if (Field[y][x] == 1)
280 return TRUE;
281 }
282 }
283 return FALSE;
284 }
285
286 /*
287 * reset_count:
288 * Reset the count variables
289 */
290 reset_count()
291 {
292 Count = 0;
293 Running = FALSE;
294 leaveok(stdscr, FALSE);
295 refresh();
296 }
297
298 /*
299 * jumping:
300 * See if we are jumping, i.e., we should not refresh.
301 */
302 jumping()
303 {
304 return (Jump && (Count || Running || Waiting));
305 }