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