1 /* $NetBSD: move_robs.c,v 1.7 2003/08/07 09:37:37 agc 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.7 2003/08/07 09:37:37 agc 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(was_sig) 49 int was_sig; 50 { 51 COORD *rp; 52 53 if (Real_time) 54 signal(SIGALRM, move_robots); 55 # ifdef DEBUG 56 move(Min.y, Min.x); 57 addch(inch()); 58 move(Max.y, Max.x); 59 addch(inch()); 60 # endif /* DEBUG */ 61 for (rp = Robots; rp < &Robots[MAXROBOTS]; rp++) { 62 if (rp->y < 0) 63 continue; 64 mvaddch(rp->y, rp->x, ' '); 65 Field[rp->y][rp->x]--; 66 rp->y += sign(My_pos.y - rp->y); 67 rp->x += sign(My_pos.x - rp->x); 68 if (rp->y <= 0) 69 rp->y = 0; 70 else if (rp->y >= Y_FIELDSIZE) 71 rp->y = Y_FIELDSIZE - 1; 72 if (rp->x <= 0) 73 rp->x = 0; 74 else if (rp->x >= X_FIELDSIZE) 75 rp->x = X_FIELDSIZE - 1; 76 Field[rp->y][rp->x]++; 77 } 78 79 Min.y = Y_FIELDSIZE; 80 Min.x = X_FIELDSIZE; 81 Max.y = 0; 82 Max.x = 0; 83 for (rp = Robots; rp < &Robots[MAXROBOTS]; rp++) 84 if (rp->y < 0) 85 continue; 86 else if (rp->y == My_pos.y && rp->x == My_pos.x) 87 Dead = TRUE; 88 else if (Field[rp->y][rp->x] > 1) { 89 mvaddch(rp->y, rp->x, HEAP); 90 Scrap[Num_scrap++] = *rp; 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 void 132 add_score(add) 133 int add; 134 { 135 Score += add; 136 move(Y_SCORE, X_SCORE); 137 printw("%d", Score); 138 } 139 140 /* 141 * sign: 142 * Return the sign of the number 143 */ 144 int 145 sign(n) 146 int n; 147 { 148 if (n < 0) 149 return -1; 150 else if (n > 0) 151 return 1; 152 else 153 return 0; 154 } 155