Merge from vendor branch PKGSRC:
[netbsd-mini2440.git] / games / robots / play_level.c
blobaf37caeb6d6c9af947bbe2eacef89130144a7352
1 /* $NetBSD: play_level.c,v 1.8 2009/07/20 06:00:56 dholland Exp $ */
3 /*
4 * Copyright (c) 1980, 1993
5 * The Regents of the University of California. All rights reserved.
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. Neither the name of the University nor the names of its contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * SUCH DAMAGE.
32 #include <sys/cdefs.h>
33 #ifndef lint
34 #if 0
35 static char sccsid[] = "@(#)play_level.c 8.1 (Berkeley) 5/31/93";
36 #else
37 __RCSID("$NetBSD: play_level.c,v 1.8 2009/07/20 06:00:56 dholland Exp $");
38 #endif
39 #endif /* not lint */
41 #include <curses.h>
42 #include <unistd.h>
43 #include "robots.h"
46 * play_level:
47 * Let the player play the current level
49 void
50 play_level(void)
52 COORD *cp;
54 move(My_pos.y, My_pos.x);
55 addch(PLAYER);
56 refresh();
57 for (cp = Robots; cp < &Robots[MAXROBOTS]; cp++) {
58 if (cp->y < 0)
59 continue;
60 move(cp->y, cp->x);
61 addch(ROBOT);
63 refresh();
64 #ifdef DEBUG
65 standout();
66 move(Min.y, Min.x);
67 addch(inch());
68 move(Max.y, Max.x);
69 addch(inch());
70 standend();
71 #endif /* DEBUG */
72 setjmp(End_move);
73 flush_in();
74 while (!Dead && Num_robots > 0) {
75 move(My_pos.y, My_pos.x);
76 if (!jumping())
77 refresh();
78 get_move();
79 if (Real_time)
80 alarm(0);
81 if (Field[My_pos.y][My_pos.x] != 0)
82 Dead = true;
83 if (!Dead)
84 move_robots(false);
85 if (Was_bonus) {
86 move(Y_PROMPT, X_PROMPT);
87 clrtoeol();
88 move(Y_PROMPT + 1, X_PROMPT);
89 clrtoeol();
90 Was_bonus = false;
95 * if the player didn't die, add on the possible bonuses
98 if (!Dead) {
99 Was_bonus = false;
101 if (Level == Start_level && Start_level > 1) {
102 move(Y_PROMPT, X_PROMPT);
103 printw("Advance bonus: %d", S_BONUS);
104 refresh();
105 add_score(S_BONUS);
106 Was_bonus = true;
109 if (Wait_bonus != 0) {
110 if (!Was_bonus)
111 move(Y_PROMPT, X_PROMPT);
112 else
113 move(Y_PROMPT + 1, X_PROMPT);
114 printw("Wait bonus: %d", Wait_bonus);
115 refresh();
116 add_score(Wait_bonus);
117 Was_bonus = true;