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. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * @(#)move_robs.c 8.1 (Berkeley) 5/31/93 34 * $FreeBSD: src/games/robots/move_robs.c,v 1.4 1999/11/30 03:49:19 billf Exp $ 35 * $DragonFly: src/games/robots/move_robs.c,v 1.4 2006/08/27 21:45:07 pavalos Exp $ 36 */ 37 38 # include "robots.h" 39 # include <signal.h> 40 41 static int sign(int); 42 43 /* 44 * move_robots: 45 * Move the robots around 46 */ 47 void 48 move_robots(bool was_sig) 49 { 50 COORD *rp; 51 52 if (Real_time) 53 signal(SIGALRM, (sig_t)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 rp->y = -1; 90 Num_robots--; 91 if (Waiting) 92 Wait_bonus++; 93 add_score(ROB_SCORE); 94 } 95 else { 96 mvaddch(rp->y, rp->x, ROBOT); 97 if (rp->y < Min.y) 98 Min.y = rp->y; 99 if (rp->x < Min.x) 100 Min.x = rp->x; 101 if (rp->y > Max.y) 102 Max.y = rp->y; 103 if (rp->x > Max.x) 104 Max.x = rp->x; 105 } 106 107 if (was_sig) { 108 refresh(); 109 if (Dead || Num_robots <= 0) 110 longjmp(End_move, 0); 111 } 112 113 # ifdef DEBUG 114 standout(); 115 move(Min.y, Min.x); 116 addch(inch()); 117 move(Max.y, Max.x); 118 addch(inch()); 119 standend(); 120 # endif /* DEBUG */ 121 if (Real_time) 122 alarm(3); 123 } 124 125 /* 126 * add_score: 127 * Add a score to the overall point total 128 */ 129 void 130 add_score(int add) 131 { 132 Score += add; 133 move(Y_SCORE, X_SCORE); 134 printw("%d", Score); 135 } 136 137 /* 138 * sign: 139 * Return the sign of the number 140 */ 141 static int 142 sign(int n) 143 { 144 if (n < 0) 145 return -1; 146 else if (n > 0) 147 return 1; 148 else 149 return 0; 150 } 151