projects / unix-history / blame
| Commit | Line | Data |
|---|---|---|
| acf3a32b WJ |
1 | /* |
| 2 | * Copyright (c) 1980 Regents of the University of California. | |
| 3 | * All rights reserved. | |
| 4 | * | |
| 5 | * Redistribution and use in source and binary forms, with or without | |
| 6 | * modification, are permitted provided that the following conditions | |
| 7 | * are met: | |
| 8 | * 1. Redistributions of source code must retain the above copyright | |
| 9 | * notice, this list of conditions and the following disclaimer. | |
| 10 | * 2. Redistributions in binary form must reproduce the above copyright | |
| 11 | * notice, this list of conditions and the following disclaimer in the | |
| 12 | * documentation and/or other materials provided with the distribution. | |
| 13 | * 3. All advertising materials mentioning features or use of this software | |
| 14 | * must display the following acknowledgement: | |
| 15 | * This product includes software developed by the University of | |
| 16 | * California, Berkeley and its contributors. | |
| 17 | * 4. Neither the name of the University nor the names of its contributors | |
| 18 | * may be used to endorse or promote products derived from this software | |
| 19 | * without specific prior written permission. | |
| 20 | * | |
| 21 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | |
| 22 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
| 23 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
| 24 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | |
| 25 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
| 26 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
| 27 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
| 28 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
| 29 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
| 30 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
| 31 | * SUCH DAMAGE. | |
| 32 | */ | |
| 33 | ||
| 34 | #ifndef lint | |
| 35 | static char sccsid[] = "@(#)play_level.c 5.5 (Berkeley) 6/1/90"; | |
| 36 | #endif /* not lint */ | |
| 37 | ||
| 38 | # include "robots.h" | |
| 39 | ||
| 40 | /* | |
| 41 | * play_level: | |
| 42 | * Let the player play the current level | |
| 43 | */ | |
| 44 | play_level() | |
| 45 | { | |
| 46 | register COORD *cp; | |
| 47 | register int y, x, bonus; | |
| 48 | ||
| 49 | move(My_pos.y, My_pos.x); | |
| 50 | addch(PLAYER); | |
| 51 | refresh(); | |
| 52 | for (cp = Robots; cp < &Robots[MAXROBOTS]; cp++) { | |
| 53 | if (cp->y < 0) | |
| 54 | continue; | |
| 55 | move(cp->y, cp->x); | |
| 56 | addch(ROBOT); | |
| 57 | } | |
| 58 | refresh(); | |
| 59 | # ifdef DEBUG | |
| 60 | standout(); | |
| 61 | move(Min.y, Min.x); | |
| 62 | addch(inch()); | |
| 63 | move(Max.y, Max.x); | |
| 64 | addch(inch()); | |
| 65 | standend(); | |
| 66 | # endif DEBUG | |
| 67 | setjmp(End_move); | |
| 68 | flush_in(); | |
| 69 | while (!Dead && Num_robots > 0) { | |
| 70 | move(My_pos.y, My_pos.x); | |
| 71 | if (!jumping()) | |
| 72 | refresh(); | |
| 73 | get_move(); | |
| 74 | if (Real_time) | |
| 75 | alarm(0); | |
| 76 | if (Field[My_pos.y][My_pos.x] != 0) | |
| 77 | Dead = TRUE; | |
| 78 | if (!Dead) | |
| 79 | move_robots(FALSE); | |
| 80 | if (Was_bonus) { | |
| 81 | move(Y_PROMPT, X_PROMPT); | |
| 82 | clrtoeol(); | |
| 83 | move(Y_PROMPT + 1, X_PROMPT); | |
| 84 | clrtoeol(); | |
| 85 | Was_bonus = FALSE; | |
| 86 | } | |
| 87 | } | |
| 88 | ||
| 89 | /* | |
| 90 | * if the player didn't die, add on the possible bonuses | |
| 91 | */ | |
| 92 | ||
| 93 | if (!Dead) { | |
| 94 | Was_bonus = FALSE; | |
| 95 | ||
| 96 | if (Level == Start_level && Start_level > 1) { | |
| 97 | move(Y_PROMPT, X_PROMPT); | |
| 98 | printw("Advance bonus: %d", S_BONUS); | |
| 99 | refresh(); | |
| 100 | add_score(S_BONUS); | |
| 101 | Was_bonus = TRUE; | |
| 102 | } | |
| 103 | ||
| 104 | if (Wait_bonus != 0) { | |
| 105 | if (!Was_bonus) | |
| 106 | move(Y_PROMPT, X_PROMPT); | |
| 107 | else | |
| 108 | move(Y_PROMPT + 1, X_PROMPT); | |
| 109 | printw("Wait bonus: %d", Wait_bonus); | |
| 110 | refresh(); | |
| 111 | add_score(Wait_bonus); | |
| 112 | Was_bonus = TRUE; | |
| 113 | } | |
| 114 | } | |
| 115 | } |