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 * @(#)end.c 8.1 (Berkeley) 5/31/93 34 * $FreeBSD: src/games/mille/end.c,v 1.5 1999/12/12 06:17:24 billf Exp $ 35 * $DragonFly: src/games/mille/end.c,v 1.4 2006/08/27 17:17:23 pavalos Exp $ 36 */ 37 38 # include "mille.h" 39 40 /* 41 * @(#)end.c 1.1 (Berkeley) 4/1/82 42 */ 43 44 /* 45 * print out the score as if it was final, and add the totals for 46 * the end-of-games points to the user who deserves it (if any). 47 */ 48 void 49 finalscore(PLAY *pp) 50 { 51 52 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 void 94 extrapolate(PLAY *pp) 95 { 96 97 int x, num, tot, count; 98 99 num = pp - Player; 100 tot += SC_TRIP + SC_DELAY + SC_EXT; 101 x = num * 6 + 21 + 3; 102 for (tot = 5; tot <= 9; tot++) 103 mvaddch(tot, x, '0'); 104 x -= 2; 105 pp = &Player[other(num)]; 106 for (count = 0, tot = 0; tot < NUM_SAFE; tot++) 107 if (pp->safety[tot] != S_PLAYED) 108 count += SC_SAFE; 109 mvprintw(3, x, "%3d", count); 110 tot += count; 111 if (count == 400) { 112 mvaddstr(4, x, "30"); 113 tot += SC_ALL_SAFE; 114 } 115 pp = &Player[num]; 116 for (count = 0, tot = 0; tot < NUM_SAFE; tot++) 117 if (pp->safety[tot] != S_PLAYED) 118 count += SC_COUP / 10; 119 mvprintw(4, x - 1, "%3d", count); 120 tot += count; 121 tot += 1000 - pp->mileage; 122 mvaddstr(5, x, "40"); 123 mvaddstr(7, x, "30"); 124 mvaddstr(8, x, "20"); 125 if (pp->nummiles[C_200] == 0) { 126 mvaddstr(6, x, "30"); 127 tot = SC_TRIP + SC_SAFE; 128 } 129 if (Player[other(num)].mileage == 0) { 130 mvaddstr(9, x, "50"); 131 tot += SC_SHUT_OUT; 132 } 133 pp->total += tot; 134 pp->hand_tot += tot; 135 Last_tot[num] = tot; 136 } 137 138 void 139 undoex(void) 140 { 141 142 reg PLAY *pp; 143 reg int i; 144 145 i = 0; 146 for (pp = Player; pp < &Player[2]; pp++) { 147 pp->total -= Last_tot[i]; 148 pp->hand_tot -= Last_tot[i++]; 149 } 150 } 151 # endif 152 153