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