win.c revision 1.11 1 1.11 dholland /* $NetBSD: win.c,v 1.11 2009/05/24 23:00:46 dholland Exp $ */
2 1.3 cgd
3 1.1 cgd /*
4 1.3 cgd * Copyright (c) 1980, 1993
5 1.3 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.7 agc * 3. Neither the name of the University nor the names of its contributors
16 1.1 cgd * may be used to endorse or promote products derived from this software
17 1.1 cgd * without specific prior written permission.
18 1.1 cgd *
19 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.1 cgd * SUCH DAMAGE.
30 1.1 cgd */
31 1.1 cgd
32 1.4 christos #include <sys/cdefs.h>
33 1.1 cgd #ifndef lint
34 1.3 cgd #if 0
35 1.3 cgd static char sccsid[] = "@(#)win.c 8.1 (Berkeley) 5/31/93";
36 1.3 cgd #else
37 1.11 dholland __RCSID("$NetBSD: win.c,v 1.11 2009/05/24 23:00:46 dholland Exp $");
38 1.3 cgd #endif
39 1.1 cgd #endif /* not lint */
40 1.1 cgd
41 1.4 christos #include <stdio.h>
42 1.4 christos #include <unistd.h>
43 1.4 christos #include <setjmp.h>
44 1.4 christos #include "trek.h"
45 1.4 christos #include "getpar.h"
46 1.1 cgd
47 1.1 cgd /*
48 1.1 cgd ** Signal game won
49 1.1 cgd **
50 1.1 cgd ** This routine prints out the win message, arranges to print out
51 1.1 cgd ** your score, tells you if you have a promotion coming to you,
52 1.1 cgd ** cleans up the current input line, and arranges to have you
53 1.1 cgd ** asked whether or not you want another game (via the longjmp()
54 1.1 cgd ** call).
55 1.1 cgd **
56 1.1 cgd ** Pretty straightforward, although the promotion algorithm is
57 1.1 cgd ** pretty off the wall.
58 1.1 cgd */
59 1.1 cgd
60 1.6 christos extern jmp_buf env;
61 1.6 christos
62 1.4 christos void
63 1.8 dholland win(void)
64 1.1 cgd {
65 1.4 christos long s;
66 1.11 dholland const struct cvntab *p;
67 1.1 cgd
68 1.1 cgd sleep(1);
69 1.1 cgd printf("\nCongratulations, you have saved the Federation\n");
70 1.1 cgd Move.endgame = 1;
71 1.1 cgd
72 1.1 cgd /* print and return the score */
73 1.1 cgd s = score();
74 1.1 cgd
75 1.1 cgd /* decide if she gets a promotion */
76 1.10 dholland if (Game.helps == 0 && Game.killb == 0 && Game.killinhab == 0 &&
77 1.10 dholland 5 * Game.kills + Game.deaths < 100 &&
78 1.10 dholland s >= 1000 && Ship.ship == ENTERPRISE) {
79 1.1 cgd printf("In fact, you are promoted one step in rank,\n");
80 1.9 dholland if (Game.skill >= 6) {
81 1.1 cgd printf("to the exalted rank of Commodore Emeritus\n");
82 1.9 dholland } else {
83 1.1 cgd p = &Skitab[Game.skill - 1];
84 1.1 cgd printf("from %s%s ", p->abrev, p->full);
85 1.1 cgd p++;
86 1.1 cgd printf("to %s%s\n", p->abrev, p->full);
87 1.1 cgd }
88 1.1 cgd }
89 1.1 cgd
90 1.1 cgd /* clean out input, and request new game */
91 1.1 cgd skiptonl(0);
92 1.1 cgd longjmp(env, 1);
93 1.1 cgd }
94