1 /* $OpenBSD: end.c,v 1.8 2016/01/08 18:09:59 mestre Exp $ */
2 /* $NetBSD: end.c,v 1.4 1995/03/24 05:01:30 cgd Exp $ */
3
4 /*
5 * Copyright (c) 1982, 1993
6 * The Regents of the University of California. All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
19 *
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 * SUCH DAMAGE.
31 */
32
33 #include "mille.h"
34
35 /*
36 * @(#)end.c 1.1 (Berkeley) 4/1/82
37 */
38
39 /*
40 * print out the score as if it were final, and add the totals for
41 * the end-of-games points to the user who deserves it (if any).
42 */
43 void
finalscore(PLAY * pp)44 finalscore(PLAY *pp)
45 {
46 int temp, tot, num;
47
48 if (pp->was_finished == Finished)
49 return;
50
51 pp->was_finished = Finished;
52 num = pp - Player;
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");
58 tot = SC_TRIP;
59 if (pp->nummiles[C_200] == 0) {
60 mvaddstr(6, temp, "30");
61 tot = SC_TRIP + SC_SAFE;
62 }
63 if (Topcard <= Deck) {
64 mvaddstr(7, temp, "30");
65 tot += SC_DELAY;
66 }
67 if (End == 1000) {
68 mvaddstr(8, temp, "20");
69 tot += SC_EXTENSION;
70 }
71 if (Player[other(num)].mileage == 0) {
72 mvaddstr(9, temp, "50");
73 tot += SC_SHUT_OUT;
74 }
75 pp->total += tot;
76 pp->hand_tot += tot;
77 }
78 }
79
80 # ifdef EXTRAP
81 static int Last_tot[2]; /* last tot used for extrapolate */
82
83 /*
84 * print out the score as if it were final, and add the totals for
85 * the end-of-games points to the user who deserves it (if any).
86 */
87 void
extrapolate(PLAY * pp)88 extrapolate(PLAY *pp)
89 {
90 int x, num, tot, count;
91
92 num = pp - Player;
93 tot += SC_TRIP + SC_DELAY + SC_EXTENSION;
94 x = num * 6 + 21 + 3;
95 for (tot = 5; tot <= 9; tot++)
96 mvaddch(tot, x, '0');
97 x -= 2;
98 pp = &Player[other(num)];
99 for (count = 0, tot = 0; tot < NUM_SAFE; tot++)
100 if (pp->safety[tot] != S_PLAYED)
101 count += SC_SAFE;
102 mvprintw(3, x, "%3d", count);
103 tot += count;
104 if (count == 400) {
105 mvaddstr(4, x, "30");
106 tot += SC_ALL_SAFE;
107 }
108 pp = &Player[num];
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);
113 tot += 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;
121 }
122 if (Player[other(num)].mileage == 0) {
123 mvaddstr(9, x, "50");
124 tot += SC_SHUT_OUT;
125 }
126 pp->total += tot;
127 pp->hand_tot += tot;
128 Last_tot[num] = tot;
129 }
130
131 void
undoex(void)132 undoex(void)
133 {
134 PLAY *pp;
135 int i;
136
137 i = 0;
138 for (pp = Player; pp < &Player[2]; pp++) {
139 pp->total -= Last_tot[i];
140 pp->hand_tot -= Last_tot[i++];
141 }
142 }
143 #endif
144