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. 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.
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
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 $
36 * @(#)end.c 1.1 (Berkeley) 4/1/82
40 * print out the score as if it was final, and add the totals for
41 * the end-of-games points to the user who deserves it (if any).
48 if (pp
->was_finished
== Finished
)
51 pp
->was_finished
= Finished
;
53 temp
= num
* 6 + 21 + 1;
54 for (tot
= 5; tot
<= 9; tot
++)
55 mvaddstr(tot
, temp
, " 0");
56 if (pp
->mileage
== End
) {
57 mvaddstr(5, temp
, "40");
59 if (pp
->nummiles
[C_200
] == 0) {
60 mvaddstr(6, temp
, "30");
61 tot
= SC_TRIP
+ SC_SAFE
;
63 if (Topcard
<= Deck
) {
64 mvaddstr(7, temp
, "30");
68 mvaddstr(8, temp
, "20");
71 if (Player
[other(num
)].mileage
== 0) {
72 mvaddstr(9, temp
, "50");
81 static int Last_tot
[2]; /* last tot used for extrapolate */
84 * print out the score as if it was final, and add the totals for
85 * the end-of-games points to the user who deserves it (if any).
90 int x
, num
, tot
, count
;
93 tot
+= SC_TRIP
+ SC_DELAY
+ SC_EXTENSION
;
95 for (tot
= 5; tot
<= 9; tot
++)
98 pp
= &Player
[other(num
)];
99 for (count
= 0, tot
= 0; tot
< NUM_SAFE
; tot
++)
100 if (pp
->safety
[tot
] != S_PLAYED
)
102 mvprintw(3, x
, "%3d", count
);
105 mvaddstr(4, x
, "30");
109 for (count
= 0, tot
= 0; tot
< NUM_SAFE
; tot
++)
110 if (pp
->safety
[tot
] != S_PLAYED
)
111 count
+= SC_COUP
/ 10;
112 mvprintw(4, x
- 1, "%3d", count
);
114 tot
+= 1000 - pp
->mileage
;
115 mvaddstr(5, x
, "40");
116 mvaddstr(7, x
, "30");
117 mvaddstr(8, x
, "20");
118 if (pp
->nummiles
[C_200
] == 0) {
119 mvaddstr(6, x
, "30");
120 tot
= SC_TRIP
+ SC_SAFE
;
122 if (Player
[other(num
)].mileage
== 0) {
123 mvaddstr(9, x
, "50");
138 for (pp
= Player
; pp
< &Player
[2]; pp
++) {
139 pp
->total
-= Last_tot
[i
];
140 pp
->hand_tot
-= Last_tot
[i
++];