]> git.cameronkatri.com Git - bsdgames-darwin.git/blob - robots/move_robs.c
initial import of 386bsd-0.1 sources
[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[] = "@(#)move_robs.c 5.5 (Berkeley) 2/28/91";
36 #endif /* not lint */
37
38 # include "robots.h"
39 # include <signal.h>
40
41 /*
42 * move_robots:
43 * Move the robots around
44 */
45 void
46 move_robots(was_sig)
47 bool was_sig;
48 {
49 register COORD *rp;
50 register int y, x;
51 register int mindist, d;
52 static COORD newpos;
53
54 if (Real_time)
55 signal(SIGALRM, move_robots);
56 # ifdef DEBUG
57 move(Min.y, Min.x);
58 addch(inch());
59 move(Max.y, Max.x);
60 addch(inch());
61 # endif DEBUG
62 for (rp = Robots; rp < &Robots[MAXROBOTS]; rp++) {
63 if (rp->y < 0)
64 continue;
65 mvaddch(rp->y, rp->x, ' ');
66 Field[rp->y][rp->x]--;
67 rp->y += sign(My_pos.y - rp->y);
68 rp->x += sign(My_pos.x - rp->x);
69 if (rp->y <= 0)
70 rp->y = 0;
71 else if (rp->y >= Y_FIELDSIZE)
72 rp->y = Y_FIELDSIZE - 1;
73 if (rp->x <= 0)
74 rp->x = 0;
75 else if (rp->x >= X_FIELDSIZE)
76 rp->x = X_FIELDSIZE - 1;
77 Field[rp->y][rp->x]++;
78 }
79
80 Min.y = Y_FIELDSIZE;
81 Min.x = X_FIELDSIZE;
82 Max.y = 0;
83 Max.x = 0;
84 for (rp = Robots; rp < &Robots[MAXROBOTS]; rp++)
85 if (rp->y < 0)
86 continue;
87 else if (rp->y == My_pos.y && rp->x == My_pos.x)
88 Dead = TRUE;
89 else if (Field[rp->y][rp->x] > 1) {
90 mvaddch(rp->y, rp->x, HEAP);
91 rp->y = -1;
92 Num_robots--;
93 if (Waiting)
94 Wait_bonus++;
95 add_score(ROB_SCORE);
96 }
97 else {
98 mvaddch(rp->y, rp->x, ROBOT);
99 if (rp->y < Min.y)
100 Min.y = rp->y;
101 if (rp->x < Min.x)
102 Min.x = rp->x;
103 if (rp->y > Max.y)
104 Max.y = rp->y;
105 if (rp->x > Max.x)
106 Max.x = rp->x;
107 }
108
109 if (was_sig) {
110 refresh();
111 if (Dead || Num_robots <= 0)
112 longjmp(End_move, 0);
113 }
114
115 # ifdef DEBUG
116 standout();
117 move(Min.y, Min.x);
118 addch(inch());
119 move(Max.y, Max.x);
120 addch(inch());
121 standend();
122 # endif DEBUG
123 if (Real_time)
124 alarm(3);
125 }
126
127 /*
128 * add_score:
129 * Add a score to the overall point total
130 */
131 add_score(add)
132 int add;
133 {
134 Score += add;
135 move(Y_SCORE, X_SCORE);
136 printw("%d", Score);
137 }
138
139 /*
140 * sign:
141 * Return the sign of the number
142 */
143 sign(n)
144 int n;
145 {
146 if (n < 0)
147 return -1;
148 else if (n > 0)
149 return 1;
150 else
151 return 0;
152 }