1 1.10 dholland /* $NetBSD: make_level.c,v 1.10 2009/07/20 06:39:06 dholland Exp $ */ 2 1.3 cgd 3 1.1 cgd /* 4 1.3 cgd * Copyright (c) 1980, 1993 5 1.3 cgd * The Regents of the University of California. All rights reserved. 6 1.1 cgd * 7 1.1 cgd * Redistribution and use in source and binary forms, with or without 8 1.1 cgd * modification, are permitted provided that the following conditions 9 1.1 cgd * are met: 10 1.1 cgd * 1. Redistributions of source code must retain the above copyright 11 1.1 cgd * notice, this list of conditions and the following disclaimer. 12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright 13 1.1 cgd * notice, this list of conditions and the following disclaimer in the 14 1.1 cgd * documentation and/or other materials provided with the distribution. 15 1.7 agc * 3. Neither the name of the University nor the names of its contributors 16 1.1 cgd * may be used to endorse or promote products derived from this software 17 1.1 cgd * without specific prior written permission. 18 1.1 cgd * 19 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 20 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 23 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29 1.1 cgd * SUCH DAMAGE. 30 1.1 cgd */ 31 1.1 cgd 32 1.4 lukem #include <sys/cdefs.h> 33 1.1 cgd #ifndef lint 34 1.3 cgd #if 0 35 1.3 cgd static char sccsid[] = "@(#)make_level.c 8.1 (Berkeley) 5/31/93"; 36 1.3 cgd #else 37 1.10 dholland __RCSID("$NetBSD: make_level.c,v 1.10 2009/07/20 06:39:06 dholland Exp $"); 38 1.3 cgd #endif 39 1.1 cgd #endif /* not lint */ 40 1.1 cgd 41 1.10 dholland #include <curses.h> 42 1.10 dholland #include <string.h> 43 1.9 dholland #include "robots.h" 44 1.1 cgd 45 1.1 cgd /* 46 1.1 cgd * make_level: 47 1.1 cgd * Make the current level 48 1.1 cgd */ 49 1.4 lukem void 50 1.8 dholland make_level(void) 51 1.1 cgd { 52 1.9 dholland int i; 53 1.9 dholland COORD *cp; 54 1.9 dholland int x; 55 1.1 cgd 56 1.1 cgd reset_count(); 57 1.1 cgd for (i = 1; i < Y_FIELDSIZE; i++) 58 1.1 cgd for (x = 1; x < X_FIELDSIZE; x++) 59 1.1 cgd if (Field[i][x] != 0) 60 1.1 cgd mvaddch(i, x, ' '); 61 1.1 cgd if (My_pos.y > 0) 62 1.1 cgd mvaddch(My_pos.y, My_pos.x, ' '); 63 1.1 cgd 64 1.10 dholland Waiting = false; 65 1.1 cgd Wait_bonus = 0; 66 1.1 cgd leaveok(stdscr, FALSE); 67 1.1 cgd for (cp = Robots; cp < &Robots[MAXROBOTS]; cp++) 68 1.1 cgd cp->y = -1; 69 1.1 cgd My_pos.y = -1; 70 1.1 cgd 71 1.5 lukem memset(Field, 0, sizeof Field); 72 1.1 cgd Min.y = Y_FIELDSIZE; 73 1.1 cgd Min.x = X_FIELDSIZE; 74 1.1 cgd Max.y = 0; 75 1.1 cgd Max.x = 0; 76 1.1 cgd if ((i = Level * 10) > MAXROBOTS) 77 1.1 cgd i = MAXROBOTS; 78 1.1 cgd Num_robots = i; 79 1.6 christos memset(Scrap, 0, sizeof(Scrap[0]) * MAXROBOTS); 80 1.6 christos Num_scrap = 0; 81 1.1 cgd while (i-- > 0) { 82 1.1 cgd cp = rnd_pos(); 83 1.1 cgd Robots[i] = *cp; 84 1.1 cgd Field[cp->y][cp->x]++; 85 1.1 cgd if (cp->y < Min.y) 86 1.1 cgd Min.y = cp->y; 87 1.1 cgd if (cp->x < Min.x) 88 1.1 cgd Min.x = cp->x; 89 1.1 cgd if (cp->y > Max.y) 90 1.1 cgd Max.y = cp->y; 91 1.1 cgd if (cp->x > Max.x) 92 1.1 cgd Max.x = cp->x; 93 1.1 cgd } 94 1.1 cgd My_pos = *rnd_pos(); 95 1.1 cgd refresh(); 96 1.1 cgd } 97