]> git.cameronkatri.com Git - bsdgames-darwin.git/blob - robots/move_robs.c
Whitespace.
[bsdgames-darwin.git] / robots / move_robs.c
1 /* $NetBSD: move_robs.c,v 1.9 2009/07/20 06:00:56 dholland 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. Neither the name of the University nor the names of its contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * SUCH DAMAGE.
30 */
31
32 #include <sys/cdefs.h>
33 #ifndef lint
34 #if 0
35 static char sccsid[] = "@(#)move_robs.c 8.1 (Berkeley) 5/31/93";
36 #else
37 __RCSID("$NetBSD: move_robs.c,v 1.9 2009/07/20 06:00:56 dholland Exp $");
38 #endif
39 #endif /* not lint */
40
41 #include "robots.h"
42
43 /*
44 * move_robots:
45 * Move the robots around
46 */
47 void
48 move_robots(int was_sig)
49 {
50 COORD *rp;
51
52 if (Real_time)
53 signal(SIGALRM, move_robots);
54 #ifdef DEBUG
55 move(Min.y, Min.x);
56 addch(inch());
57 move(Max.y, Max.x);
58 addch(inch());
59 #endif /* DEBUG */
60 for (rp = Robots; rp < &Robots[MAXROBOTS]; rp++) {
61 if (rp->y < 0)
62 continue;
63 mvaddch(rp->y, rp->x, ' ');
64 Field[rp->y][rp->x]--;
65 rp->y += sign(My_pos.y - rp->y);
66 rp->x += sign(My_pos.x - rp->x);
67 if (rp->y <= 0)
68 rp->y = 0;
69 else if (rp->y >= Y_FIELDSIZE)
70 rp->y = Y_FIELDSIZE - 1;
71 if (rp->x <= 0)
72 rp->x = 0;
73 else if (rp->x >= X_FIELDSIZE)
74 rp->x = X_FIELDSIZE - 1;
75 Field[rp->y][rp->x]++;
76 }
77
78 Min.y = Y_FIELDSIZE;
79 Min.x = X_FIELDSIZE;
80 Max.y = 0;
81 Max.x = 0;
82 for (rp = Robots; rp < &Robots[MAXROBOTS]; rp++)
83 if (rp->y < 0)
84 continue;
85 else if (rp->y == My_pos.y && rp->x == My_pos.x)
86 Dead = TRUE;
87 else if (Field[rp->y][rp->x] > 1) {
88 mvaddch(rp->y, rp->x, HEAP);
89 Scrap[Num_scrap++] = *rp;
90 rp->y = -1;
91 Num_robots--;
92 if (Waiting)
93 Wait_bonus++;
94 add_score(ROB_SCORE);
95 }
96 else {
97 mvaddch(rp->y, rp->x, ROBOT);
98 if (rp->y < Min.y)
99 Min.y = rp->y;
100 if (rp->x < Min.x)
101 Min.x = rp->x;
102 if (rp->y > Max.y)
103 Max.y = rp->y;
104 if (rp->x > Max.x)
105 Max.x = rp->x;
106 }
107
108 if (was_sig) {
109 refresh();
110 if (Dead || Num_robots <= 0)
111 longjmp(End_move, 0);
112 }
113
114 #ifdef DEBUG
115 standout();
116 move(Min.y, Min.x);
117 addch(inch());
118 move(Max.y, Max.x);
119 addch(inch());
120 standend();
121 #endif /* DEBUG */
122 if (Real_time)
123 alarm(3);
124 }
125
126 /*
127 * add_score:
128 * Add a score to the overall point total
129 */
130 void
131 add_score(int add)
132 {
133 Score += add;
134 move(Y_SCORE, X_SCORE);
135 printw("%d", Score);
136 }
137
138 /*
139 * sign:
140 * Return the sign of the number
141 */
142 int
143 sign(int n)
144 {
145 if (n < 0)
146 return -1;
147 else if (n > 0)
148 return 1;
149 else
150 return 0;
151 }