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