| 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. Neither the name of the University nor the names of its contributors |
| 14 | * may be used to endorse or promote products derived from this software |
| 15 | * without specific prior written permission. |
| 16 | * |
| 17 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
| 18 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 19 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 20 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
| 21 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 22 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 23 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 24 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 25 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 26 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 27 | * SUCH DAMAGE. |
| 28 | * |
| 29 | * @(#)end.c 8.1 (Berkeley) 5/31/93 |
| 30 | * $FreeBSD: src/games/mille/end.c,v 1.5 1999/12/12 06:17:24 billf Exp $ |
| 31 | * $DragonFly: src/games/mille/end.c,v 1.4 2006/08/27 17:17:23 pavalos Exp $ |
| 32 | */ |
| 33 | |
| 34 | #include "mille.h" |
| 35 | |
| 36 | /* |
| 37 | * @(#)end.c 1.1 (Berkeley) 4/1/82 |
| 38 | */ |
| 39 | |
| 40 | /* |
| 41 | * print out the score as if it was final, and add the totals for |
| 42 | * the end-of-games points to the user who deserves it (if any). |
| 43 | */ |
| 44 | void |
| 45 | finalscore(PLAY *pp) |
| 46 | { |
| 47 | int temp, tot, num; |
| 48 | |
| 49 | if (pp->was_finished == Finished) |
| 50 | return; |
| 51 | |
| 52 | pp->was_finished = Finished; |
| 53 | num = pp - Player; |
| 54 | temp = num * 6 + 21 + 1; |
| 55 | for (tot = 5; tot <= 9; tot++) |
| 56 | mvaddstr(tot, temp, " 0"); |
| 57 | if (pp->mileage == End) { |
| 58 | mvaddstr(5, temp, "40"); |
| 59 | tot = SC_TRIP; |
| 60 | if (pp->nummiles[C_200] == 0) { |
| 61 | mvaddstr(6, temp, "30"); |
| 62 | tot = SC_TRIP + SC_SAFE; |
| 63 | } |
| 64 | if (Topcard <= Deck) { |
| 65 | mvaddstr(7, temp, "30"); |
| 66 | tot += SC_DELAY; |
| 67 | } |
| 68 | if (End == 1000) { |
| 69 | mvaddstr(8, temp, "20"); |
| 70 | tot += SC_EXTENSION; |
| 71 | } |
| 72 | if (Player[other(num)].mileage == 0) { |
| 73 | mvaddstr(9, temp, "50"); |
| 74 | tot += SC_SHUT_OUT; |
| 75 | } |
| 76 | pp->total += tot; |
| 77 | pp->hand_tot += tot; |
| 78 | } |
| 79 | } |
| 80 | |
| 81 | #ifdef EXTRAP |
| 82 | static int Last_tot[2]; /* last tot used for extrapolate */ |
| 83 | |
| 84 | /* |
| 85 | * print out the score as if it was final, and add the totals for |
| 86 | * the end-of-games points to the user who deserves it (if any). |
| 87 | */ |
| 88 | void |
| 89 | extrapolate(PLAY *pp) |
| 90 | { |
| 91 | |
| 92 | int x, num, tot, count; |
| 93 | |
| 94 | num = pp - Player; |
| 95 | tot += SC_TRIP + SC_DELAY + SC_EXT; |
| 96 | x = num * 6 + 21 + 3; |
| 97 | for (tot = 5; tot <= 9; tot++) |
| 98 | mvaddch(tot, x, '0'); |
| 99 | x -= 2; |
| 100 | pp = &Player[other(num)]; |
| 101 | for (count = 0, tot = 0; tot < NUM_SAFE; tot++) |
| 102 | if (pp->safety[tot] != S_PLAYED) |
| 103 | count += SC_SAFE; |
| 104 | mvprintw(3, x, "%3d", count); |
| 105 | tot += count; |
| 106 | if (count == 400) { |
| 107 | mvaddstr(4, x, "30"); |
| 108 | tot += SC_ALL_SAFE; |
| 109 | } |
| 110 | pp = &Player[num]; |
| 111 | for (count = 0, tot = 0; tot < NUM_SAFE; tot++) |
| 112 | if (pp->safety[tot] != S_PLAYED) |
| 113 | count += SC_COUP / 10; |
| 114 | mvprintw(4, x - 1, "%3d", count); |
| 115 | tot += count; |
| 116 | tot += 1000 - pp->mileage; |
| 117 | mvaddstr(5, x, "40"); |
| 118 | mvaddstr(7, x, "30"); |
| 119 | mvaddstr(8, x, "20"); |
| 120 | if (pp->nummiles[C_200] == 0) { |
| 121 | mvaddstr(6, x, "30"); |
| 122 | tot = SC_TRIP + SC_SAFE; |
| 123 | } |
| 124 | if (Player[other(num)].mileage == 0) { |
| 125 | mvaddstr(9, x, "50"); |
| 126 | tot += SC_SHUT_OUT; |
| 127 | } |
| 128 | pp->total += tot; |
| 129 | pp->hand_tot += tot; |
| 130 | Last_tot[num] = tot; |
| 131 | } |
| 132 | |
| 133 | void |
| 134 | undoex(void) |
| 135 | { |
| 136 | |
| 137 | reg PLAY *pp; |
| 138 | reg int i; |
| 139 | |
| 140 | i = 0; |
| 141 | for (pp = Player; pp < &Player[2]; pp++) { |
| 142 | pp->total -= Last_tot[i]; |
| 143 | pp->hand_tot -= Last_tot[i++]; |
| 144 | } |
| 145 | } |
| 146 | #endif /* EXTRAP */ |