]> git.cameronkatri.com Git - bsdgames-darwin.git/blob - robots/move_robs.c
Use <dirent.h> instead of <sys/dir.h>.
[bsdgames-darwin.git] / robots / move_robs.c
1 /*
2 * Copyright (c) 1980 Regents of the University of California.
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 */
33
34 #ifndef lint
35 /*static char sccsid[] = "from: @(#)move_robs.c 5.5 (Berkeley) 2/28/91";*/
36 static char rcsid[] = "$Id: move_robs.c,v 1.2 1993/08/01 18:52:43 mycroft Exp $";
37 #endif /* not lint */
38
39 # include "robots.h"
40 # include <signal.h>
41
42 /*
43 * move_robots:
44 * Move the robots around
45 */
46 void
47 move_robots(was_sig)
48 bool was_sig;
49 {
50 register COORD *rp;
51 register int y, x;
52 register int mindist, d;
53 static COORD newpos;
54
55 if (Real_time)
56 signal(SIGALRM, move_robots);
57 # ifdef DEBUG
58 move(Min.y, Min.x);
59 addch(inch());
60 move(Max.y, Max.x);
61 addch(inch());
62 # endif DEBUG
63 for (rp = Robots; rp < &Robots[MAXROBOTS]; rp++) {
64 if (rp->y < 0)
65 continue;
66 mvaddch(rp->y, rp->x, ' ');
67 Field[rp->y][rp->x]--;
68 rp->y += sign(My_pos.y - rp->y);
69 rp->x += sign(My_pos.x - rp->x);
70 if (rp->y <= 0)
71 rp->y = 0;
72 else if (rp->y >= Y_FIELDSIZE)
73 rp->y = Y_FIELDSIZE - 1;
74 if (rp->x <= 0)
75 rp->x = 0;
76 else if (rp->x >= X_FIELDSIZE)
77 rp->x = X_FIELDSIZE - 1;
78 Field[rp->y][rp->x]++;
79 }
80
81 Min.y = Y_FIELDSIZE;
82 Min.x = X_FIELDSIZE;
83 Max.y = 0;
84 Max.x = 0;
85 for (rp = Robots; rp < &Robots[MAXROBOTS]; rp++)
86 if (rp->y < 0)
87 continue;
88 else if (rp->y == My_pos.y && rp->x == My_pos.x)
89 Dead = TRUE;
90 else if (Field[rp->y][rp->x] > 1) {
91 mvaddch(rp->y, rp->x, HEAP);
92 rp->y = -1;
93 Num_robots--;
94 if (Waiting)
95 Wait_bonus++;
96 add_score(ROB_SCORE);
97 }
98 else {
99 mvaddch(rp->y, rp->x, ROBOT);
100 if (rp->y < Min.y)
101 Min.y = rp->y;
102 if (rp->x < Min.x)
103 Min.x = rp->x;
104 if (rp->y > Max.y)
105 Max.y = rp->y;
106 if (rp->x > Max.x)
107 Max.x = rp->x;
108 }
109
110 if (was_sig) {
111 refresh();
112 if (Dead || Num_robots <= 0)
113 longjmp(End_move, 0);
114 }
115
116 # ifdef DEBUG
117 standout();
118 move(Min.y, Min.x);
119 addch(inch());
120 move(Max.y, Max.x);
121 addch(inch());
122 standend();
123 # endif DEBUG
124 if (Real_time)
125 alarm(3);
126 }
127
128 /*
129 * add_score:
130 * Add a score to the overall point total
131 */
132 add_score(add)
133 int add;
134 {
135 Score += add;
136 move(Y_SCORE, X_SCORE);
137 printw("%d", Score);
138 }
139
140 /*
141 * sign:
142 * Return the sign of the number
143 */
144 sign(n)
145 int n;
146 {
147 if (n < 0)
148 return -1;
149 else if (n > 0)
150 return 1;
151 else
152 return 0;
153 }