]> git.cameronkatri.com Git - bsdgames-darwin.git/blob - robots/make_level.c
clean up import
[bsdgames-darwin.git] / robots / make_level.c
1 /* $NetBSD: make_level.c,v 1.3 1995/04/22 10:08:56 cgd 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 #ifndef lint
37 #if 0
38 static char sccsid[] = "@(#)make_level.c 8.1 (Berkeley) 5/31/93";
39 #else
40 static char rcsid[] = "$NetBSD: make_level.c,v 1.3 1995/04/22 10:08:56 cgd Exp $";
41 #endif
42 #endif /* not lint */
43
44 # include "robots.h"
45
46 /*
47 * make_level:
48 * Make the current level
49 */
50 make_level()
51 {
52 register int i;
53 register COORD *cp;
54 register WINDOW *wp;
55 register int x, *endp;
56
57 reset_count();
58 for (i = 1; i < Y_FIELDSIZE; i++)
59 for (x = 1; x < X_FIELDSIZE; x++)
60 if (Field[i][x] != 0)
61 mvaddch(i, x, ' ');
62 if (My_pos.y > 0)
63 mvaddch(My_pos.y, My_pos.x, ' ');
64
65 Waiting = FALSE;
66 Wait_bonus = 0;
67 leaveok(stdscr, FALSE);
68 for (cp = Robots; cp < &Robots[MAXROBOTS]; cp++)
69 cp->y = -1;
70 My_pos.y = -1;
71
72 bzero(Field, sizeof Field);
73 Min.y = Y_FIELDSIZE;
74 Min.x = X_FIELDSIZE;
75 Max.y = 0;
76 Max.x = 0;
77 if ((i = Level * 10) > MAXROBOTS)
78 i = MAXROBOTS;
79 Num_robots = i;
80 while (i-- > 0) {
81 cp = rnd_pos();
82 Robots[i] = *cp;
83 Field[cp->y][cp->x]++;
84 if (cp->y < Min.y)
85 Min.y = cp->y;
86 if (cp->x < Min.x)
87 Min.x = cp->x;
88 if (cp->y > Max.y)
89 Max.y = cp->y;
90 if (cp->x > Max.x)
91 Max.x = cp->x;
92 }
93 My_pos = *rnd_pos();
94 refresh();
95 }