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