2 * Copyright (c) 1982, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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.
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
36 static char sccsid[] = "@(#)end.c 8.1 (Berkeley) 5/31/93";
38 static const char rcsid[] =
39 "$FreeBSD: src/games/mille/end.c,v 1.5 1999/12/12 06:17:24 billf Exp $";
45 * @(#)end.c 1.1 (Berkeley) 4/1/82
49 void extrapolate __P((PLAY *));
50 void undoex __P((void));
54 * print out the score as if it was final, and add the totals for
55 * the end-of-games points to the user who deserves it (if any).
63 if (pp->was_finished == Finished)
66 pp->was_finished = Finished;
68 temp = num * 6 + 21 + 1;
69 for (tot = 5; tot <= 9; tot++)
70 mvaddstr(tot, temp, " 0");
71 if (pp->mileage == End) {
72 mvaddstr(5, temp, "40");
74 if (pp->nummiles[C_200] == 0) {
75 mvaddstr(6, temp, "30");
76 tot = SC_TRIP + SC_SAFE;
78 if (Topcard <= Deck) {
79 mvaddstr(7, temp, "30");
83 mvaddstr(8, temp, "20");
86 if (Player[other(num)].mileage == 0) {
87 mvaddstr(9, temp, "50");
96 static int Last_tot[2]; /* last tot used for extrapolate */
99 * print out the score as if it was final, and add the totals for
100 * the end-of-games points to the user who deserves it (if any).
106 int x, num, tot, count;
109 tot += SC_TRIP + SC_DELAY + SC_EXT;
110 x = num * 6 + 21 + 3;
111 for (tot = 5; tot <= 9; tot++)
112 mvaddch(tot, x, '0');
114 pp = &Player[other(num)];
115 for (count = 0, tot = 0; tot < NUM_SAFE; tot++)
116 if (pp->safety[tot] != S_PLAYED)
118 mvprintw(3, x, "%3d", count);
121 mvaddstr(4, x, "30");
125 for (count = 0, tot = 0; tot < NUM_SAFE; tot++)
126 if (pp->safety[tot] != S_PLAYED)
127 count += SC_COUP / 10;
128 mvprintw(4, x - 1, "%3d", count);
130 tot += 1000 - pp->mileage;
131 mvaddstr(5, x, "40");
132 mvaddstr(7, x, "30");
133 mvaddstr(8, x, "20");
134 if (pp->nummiles[C_200] == 0) {
135 mvaddstr(6, x, "30");
136 tot = SC_TRIP + SC_SAFE;
138 if (Player[other(num)].mileage == 0) {
139 mvaddstr(9, x, "50");
154 for (pp = Player; pp < &Player[2]; pp++) {
155 pp->total -= Last_tot[i];
156 pp->hand_tot -= Last_tot[i++];