trek/win.c

   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[] = "from: @(#)win.c       5.5 (Berkeley) 6/26/90";*/
  36 static char rcsid[] = "$Id: win.c,v 1.2 1993/08/01 18:49:50 mycroft Exp $";
  37 #endif /* not lint */
  38
  39 # include       "trek.h"
  40 # include       "getpar.h"
  41 # include       <setjmp.h>
  42
  43 /*
  44 **  Signal game won
  45 **
  46 **      This routine prints out the win message, arranges to print out
  47 **      your score, tells you if you have a promotion coming to you,
  48 **      cleans up the current input line, and arranges to have you
  49 **      asked whether or not you want another game (via the longjmp()
  50 **      call).
  51 **
  52 **      Pretty straightforward, although the promotion algorithm is
  53 **      pretty off the wall.
  54 */
  55
  56 win()
  57 {
  58         long                    s;
  59         extern jmp_buf          env;
  60         extern long             score();
  61         extern struct cvntab    Skitab[];
  62         register struct cvntab  *p;
  63
  64         sleep(1);
  65         printf("\nCongratulations, you have saved the Federation\n");
  66         Move.endgame = 1;
  67
  68         /* print and return the score */
  69         s = score();
  70
  71         /* decide if she gets a promotion */
  72         if (Game.helps == 0 && Game.killb == 0 && Game.killinhab == 0 && 5 * Game.kills + Game.deaths < 100 &&
  73                         s >= 1000 && Ship.ship == ENTERPRISE)
  74         {
  75                 printf("In fact, you are promoted one step in rank,\n");
  76                 if (Game.skill >= 6)
  77                         printf("to the exalted rank of Commodore Emeritus\n");
  78                 else
  79                 {
  80                         p = &Skitab[Game.skill - 1];
  81                         printf("from %s%s ", p->abrev, p->full);
  82                         p++;
  83                         printf("to %s%s\n", p->abrev, p->full);
  84                 }
  85         }
  86
  87         /* clean out input, and request new game */
  88         skiptonl(0);
  89         longjmp(env, 1);
  90 }