Revert "Hack-fix buildworld after the ncurses upgrade."
[dragonfly.git] / games / robots / make_level.c
blob6550ee7ad2cda49a1dfcf5acc1e93967cc5d1af1
1 /*-
2 * Copyright (c) 1980, 1993
3 * The Regents of the University of California. All rights reserved.
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. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
29 * @(#)make_level.c 8.1 (Berkeley) 5/31/93
30 * $FreeBSD: src/games/robots/make_level.c,v 1.4 1999/11/30 03:49:18 billf Exp $
31 * $DragonFly: src/games/robots/make_level.c,v 1.3 2006/08/27 21:45:07 pavalos Exp $
34 #include "robots.h"
37 * make_level:
38 * Make the current level
40 void
41 make_level(void)
43 int i;
44 COORD *cp;
45 int x;
47 reset_count();
48 for (i = 1; i < Y_FIELDSIZE; i++)
49 for (x = 1; x < X_FIELDSIZE; x++)
50 if (Field[i][x] != 0)
51 mvaddch(i, x, ' ');
52 if (My_pos.y > 0)
53 mvaddch(My_pos.y, My_pos.x, ' ');
55 Waiting = false;
56 Wait_bonus = 0;
57 leaveok(stdscr, false);
58 for (cp = Robots; cp < &Robots[MAXROBOTS]; cp++)
59 cp->y = -1;
60 My_pos.y = -1;
62 bzero(Field, sizeof Field);
63 Min.y = Y_FIELDSIZE;
64 Min.x = X_FIELDSIZE;
65 Max.y = 0;
66 Max.x = 0;
67 if ((i = Level * 10) > MAXROBOTS)
68 i = MAXROBOTS;
69 Num_robots = i;
70 while (i-- > 0) {
71 cp = rnd_pos();
72 Robots[i] = *cp;
73 Field[cp->y][cp->x]++;
74 if (cp->y < Min.y)
75 Min.y = cp->y;
76 if (cp->x < Min.x)
77 Min.x = cp->x;
78 if (cp->y > Max.y)
79 Max.y = cp->y;
80 if (cp->x > Max.x)
81 Max.x = cp->x;
83 My_pos = *rnd_pos();
84 refresh();