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