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