mille/end.c

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