]> git.cameronkatri.com Git - bsdgames-darwin.git/blob - robots/make_level.c
Changed deprecated curses call to new equivalent.
[bsdgames-darwin.git] / robots / make_level.c
1 /* $NetBSD: make_level.c,v 1.6 1999/05/15 23:56:36 christos 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. All advertising materials mentioning features or use of this software
16 * must display the following acknowledgement:
17 * This product includes software developed by the University of
18 * California, Berkeley and its contributors.
19 * 4. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * SUCH DAMAGE.
34 */
35
36 #include <sys/cdefs.h>
37 #ifndef lint
38 #if 0
39 static char sccsid[] = "@(#)make_level.c 8.1 (Berkeley) 5/31/93";
40 #else
41 __RCSID("$NetBSD: make_level.c,v 1.6 1999/05/15 23:56:36 christos Exp $");
42 #endif
43 #endif /* not lint */
44
45 # include "robots.h"
46
47 /*
48 * make_level:
49 * Make the current level
50 */
51 void
52 make_level()
53 {
54 int i;
55 COORD *cp;
56 int x;
57
58 reset_count();
59 for (i = 1; i < Y_FIELDSIZE; i++)
60 for (x = 1; x < X_FIELDSIZE; x++)
61 if (Field[i][x] != 0)
62 mvaddch(i, x, ' ');
63 if (My_pos.y > 0)
64 mvaddch(My_pos.y, My_pos.x, ' ');
65
66 Waiting = FALSE;
67 Wait_bonus = 0;
68 leaveok(stdscr, FALSE);
69 for (cp = Robots; cp < &Robots[MAXROBOTS]; cp++)
70 cp->y = -1;
71 My_pos.y = -1;
72
73 memset(Field, 0, sizeof Field);
74 Min.y = Y_FIELDSIZE;
75 Min.x = X_FIELDSIZE;
76 Max.y = 0;
77 Max.x = 0;
78 if ((i = Level * 10) > MAXROBOTS)
79 i = MAXROBOTS;
80 Num_robots = i;
81 memset(Scrap, 0, sizeof(Scrap[0]) * MAXROBOTS);
82 Num_scrap = 0;
83 while (i-- > 0) {
84 cp = rnd_pos();
85 Robots[i] = *cp;
86 Field[cp->y][cp->x]++;
87 if (cp->y < Min.y)
88 Min.y = cp->y;
89 if (cp->x < Min.x)
90 Min.x = cp->x;
91 if (cp->y > Max.y)
92 Max.y = cp->y;
93 if (cp->x > Max.x)
94 Max.x = cp->x;
95 }
96 My_pos = *rnd_pos();
97 refresh();
98 }