trek/win.c

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