1/* $NetBSD: move_robs.c,v 1.9 2009/07/20 06:00:56 dholland 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 35static char sccsid[] = "@(#)move_robs.c 8.1 (Berkeley) 5/31/93"; 36#else 37__RCSID("$NetBSD: move_robs.c,v 1.9 2009/07/20 06:00:56 dholland Exp $"); 38#endif 39#endif /* not lint */ 40 41#include <curses.h> 42#include <signal.h> 43#include <unistd.h> 44#include "robots.h" 45 46/* 47 * move_robots: 48 * Move the robots around 49 */ 50void 51move_robots(int was_sig) 52{ 53 COORD *rp; 54 55 if (Real_time) 56 signal(SIGALRM, move_robots); 57#ifdef DEBUG 58 move(Min.y, Min.x); 59 addch(inch()); 60 move(Max.y, Max.x); 61 addch(inch()); 62#endif /* DEBUG */ 63 for (rp = Robots; rp < &Robots[MAXROBOTS]; rp++) { 64 if (rp->y < 0) 65 continue; 66 mvaddch(rp->y, rp->x, ' '); 67 Field[rp->y][rp->x]--; 68 rp->y += sign(My_pos.y - rp->y); 69 rp->x += sign(My_pos.x - rp->x); 70 if (rp->y <= 0) 71 rp->y = 0; 72 else if (rp->y >= Y_FIELDSIZE) 73 rp->y = Y_FIELDSIZE - 1; 74 if (rp->x <= 0) 75 rp->x = 0; 76 else if (rp->x >= X_FIELDSIZE) 77 rp->x = X_FIELDSIZE - 1; 78 Field[rp->y][rp->x]++; 79 } 80 81 Min.y = Y_FIELDSIZE; 82 Min.x = X_FIELDSIZE; 83 Max.y = 0; 84 Max.x = 0; 85 for (rp = Robots; rp < &Robots[MAXROBOTS]; rp++) 86 if (rp->y < 0) 87 continue; 88 else if (rp->y == My_pos.y && rp->x == My_pos.x) 89 Dead = true; 90 else if (Field[rp->y][rp->x] > 1) { 91 mvaddch(rp->y, rp->x, HEAP); 92 Scrap[Num_scrap++] = *rp; 93 rp->y = -1; 94 Num_robots--; 95 if (Waiting) 96 Wait_bonus++; 97 add_score(ROB_SCORE); 98 } 99 else { 100 mvaddch(rp->y, rp->x, ROBOT); 101 if (rp->y < Min.y) 102 Min.y = rp->y; 103 if (rp->x < Min.x) 104 Min.x = rp->x; 105 if (rp->y > Max.y) 106 Max.y = rp->y; 107 if (rp->x > Max.x) 108 Max.x = rp->x; 109 } 110 111 if (was_sig) { 112 refresh(); 113 if (Dead || Num_robots <= 0) 114 longjmp(End_move, 0); 115 } 116 117#ifdef DEBUG 118 standout(); 119 move(Min.y, Min.x); 120 addch(inch()); 121 move(Max.y, Max.x); 122 addch(inch()); 123 standend(); 124#endif /* DEBUG */ 125 if (Real_time) 126 alarm(3); 127} 128 129/* 130 * add_score: 131 * Add a score to the overall point total 132 */ 133void 134add_score(int add) 135{ 136 Score += add; 137 move(Y_SCORE, X_SCORE); 138 printw("%d", Score); 139} 140 141/* 142 * sign: 143 * Return the sign of the number 144 */ 145int 146sign(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