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