make_level.c revision 1.7 
1/*	$OpenBSD: make_level.c,v 1.7 2009/10/27 23:59:26 deraadt 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	"robots.h"
34
35/*
36 * make_level:
37 *	Make the current level
38 */
39void
40make_level(void)
41{
42	int	i;
43	COORD	*cp;
44	int	x;
45
46	reset_count();
47	for (i = 1; i < Y_FIELDSIZE; i++)
48		for (x = 1; x < X_FIELDSIZE; x++)
49			if (Field[i][x] != 0)
50				mvaddch(i, x, ' ');
51	if (My_pos.y > 0)
52		mvaddch(My_pos.y, My_pos.x, ' ');
53
54	Waiting = FALSE;
55	Wait_bonus = 0;
56	leaveok(stdscr, FALSE);
57	for (cp = Robots; cp < &Robots[MAXROBOTS]; cp++)
58		cp->y = -1;
59	My_pos.y = -1;
60
61	memset(Field, 0, sizeof Field);
62	Min.y = Y_FIELDSIZE;
63	Min.x = X_FIELDSIZE;
64	Max.y = 0;
65	Max.x = 0;
66	if ((i = Level * 10) > MAXROBOTS)
67		i = MAXROBOTS;
68	Num_robots = i;
69	while (i-- > 0) {
70		cp = rnd_pos();
71		Robots[i] = *cp;
72		Field[cp->y][cp->x]++;
73		if (cp->y < Min.y)
74			Min.y = cp->y;
75		if (cp->x < Min.x)
76			Min.x = cp->x;
77		if (cp->y > Max.y)
78			Max.y = cp->y;
79		if (cp->x > Max.x)
80			Max.x = cp->x;
81	}
82	My_pos = *rnd_pos();
83	refresh();
84}
85