mille/end.c

   1 /*      $NetBSD: end.c,v 1.6 1997/10/12 00:53:51 lukem Exp $    */
   2
   3 /*
   4  * Copyright (c) 1982, 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[] = "@(#)end.c       8.1 (Berkeley) 5/31/93";
  40 #else
  41 __RCSID("$NetBSD: end.c,v 1.6 1997/10/12 00:53:51 lukem Exp $");
  42 #endif
  43 #endif /* not lint */
  44
  45 # include       "mille.h"
  46
  47 /*
  48  * @(#)end.c    1.1 (Berkeley) 4/1/82
  49  */
  50
  51 /*
  52  *      print out the score as if it was final, and add the totals for
  53  * the end-of-games points to the user who deserves it (if any).
  54  */
  55 void
  56 finalscore(pp)
  57         PLAY    *pp;
  58 {
  59         int     temp, tot, num;
  60
  61         if (pp->was_finished == Finished)
  62                 return;
  63
  64         pp->was_finished = Finished;
  65         num = pp - Player;
  66         temp = num * 6 + 21 + 1;
  67         for (tot = 5; tot <= 9; tot++)
  68                 mvaddstr(tot, temp, "  0");
  69         if (pp->mileage == End) {
  70                 mvaddstr(5, temp, "40");
  71                 tot = SC_TRIP;
  72                 if (pp->nummiles[C_200] == 0) {
  73                         mvaddstr(6, temp, "30");
  74                         tot = SC_TRIP + SC_SAFE;
  75                 }
  76                 if (Topcard <= Deck) {
  77                         mvaddstr(7, temp, "30");
  78                         tot += SC_DELAY;
  79                 }
  80                 if (End == 1000) {
  81                         mvaddstr(8, temp, "20");
  82                         tot += SC_EXTENSION;
  83                 }
  84                 if (Player[other(num)].mileage == 0) {
  85                         mvaddstr(9, temp, "50");
  86                         tot += SC_SHUT_OUT;
  87                 }
  88                 pp->total += tot;
  89                 pp->hand_tot += tot;
  90         }
  91 }
  92
  93 # ifdef EXTRAP
  94 static int      Last_tot[2];    /* last tot used for extrapolate        */
  95
  96 /*
  97  *      print out the score as if it was final, and add the totals for
  98  * the end-of-games points to the user who deserves it (if any).
  99  */
 100 extrapolate(pp)
 101 reg PLAY        *pp; {
 102
 103         reg int         x, num, tot, count;
 104
 105         num = pp - Player;
 106         tot += SC_TRIP + SC_DELAY + SC_EXT;
 107         x = num * 6 + 21 + 3;
 108         for (tot = 5; tot <= 9; tot++)
 109                 mvaddch(tot, x, '0');
 110         x -= 2;
 111         pp = &Player[other(num)];
 112         for (count = 0, tot = 0; tot < NUM_SAFE; tot++)
 113                 if (pp->safety[tot] != S_PLAYED)
 114                         count += SC_SAFE;
 115         mvprintw(3, x, "%3d", count);
 116         tot += count;
 117         if (count == 400) {
 118                 mvaddstr(4, x, "30");
 119                 tot += SC_ALL_SAFE;
 120         }
 121         pp = &Player[num];
 122         for (count = 0, tot = 0; tot < NUM_SAFE; tot++)
 123                 if (pp->safety[tot] != S_PLAYED)
 124                         count += SC_COUP / 10;
 125         mvprintw(4, x - 1, "%3d", count);
 126         tot += count;
 127         tot += 1000 - pp->mileage;
 128         mvaddstr(5, x, "40");
 129         mvaddstr(7, x, "30");
 130         mvaddstr(8, x, "20");
 131         if (pp->nummiles[C_200] == 0) {
 132                 mvaddstr(6, x, "30");
 133                 tot = SC_TRIP + SC_SAFE;
 134         }
 135         if (Player[other(num)].mileage == 0) {
 136                 mvaddstr(9, x, "50");
 137                 tot += SC_SHUT_OUT;
 138         }
 139         pp->total += tot;
 140         pp->hand_tot += tot;
 141         Last_tot[num] = tot;
 142 }
 143
 144 undoex() {
 145
 146         reg PLAY        *pp;
 147         reg int         i;
 148
 149         i = 0;
 150         for (pp = Player; pp < &Player[2]; pp++) {
 151                 pp->total -= Last_tot[i];
 152                 pp->hand_tot -= Last_tot[i++];
 153         }
 154 }
 155 # endif