Home | History | Annotate | Line # | Download | only in mille
end.c revision 1.1 
      1 /*
      2  * Copyright (c) 1982 Regents of the University of California.
      3  * All rights reserved.
      4  *
      5  * Redistribution and use in source and binary forms, with or without
      6  * modification, are permitted provided that the following conditions
      7  * are met:
      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.
     20  *
     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
     31  * SUCH DAMAGE.
     32  */
     33 
     34 #ifndef lint
     35 static char sccsid[] = "@(#)end.c	5.4 (Berkeley) 6/1/90";
     36 #endif /* not lint */
     37 
     38 # include	"mille.h"
     39 
     40 /*
     41  * @(#)end.c	1.1 (Berkeley) 4/1/82
     42  */
     43 
     44 /*
     45  *	print out the score as if it was final, and add the totals for
     46  * the end-of-games points to the user who deserves it (if any).
     47  */
     48 finalscore(pp)
     49 reg PLAY	*pp; {
     50 
     51 	reg int		temp, tot, num;
     52 
     53 	if (pp->was_finished == Finished)
     54 		return;
     55 
     56 	pp->was_finished = Finished;
     57 	num = pp - Player;
     58 	temp = num * 6 + 21 + 1;
     59 	for (tot = 5; tot <= 9; tot++)
     60 		mvaddstr(tot, temp, "  0");
     61 	if (pp->mileage == End) {
     62 		mvaddstr(5, temp, "40");
     63 		tot = SC_TRIP;
     64 		if (pp->nummiles[C_200] == 0) {
     65 			mvaddstr(6, temp, "30");
     66 			tot = SC_TRIP + SC_SAFE;
     67 		}
     68 		if (Topcard <= Deck) {
     69 			mvaddstr(7, temp, "30");
     70 			tot += SC_DELAY;
     71 		}
     72 		if (End == 1000) {
     73 			mvaddstr(8, temp, "20");
     74 			tot += SC_EXTENSION;
     75 		}
     76 		if (Player[other(num)].mileage == 0) {
     77 			mvaddstr(9, temp, "50");
     78 			tot += SC_SHUT_OUT;
     79 		}
     80 		pp->total += tot;
     81 		pp->hand_tot += tot;
     82 	}
     83 }
     84 
     85 # ifdef EXTRAP
     86 static int	Last_tot[2];	/* last tot used for extrapolate	*/
     87 
     88 /*
     89  *	print out the score as if it was final, and add the totals for
     90  * the end-of-games points to the user who deserves it (if any).
     91  */
     92 extrapolate(pp)
     93 reg PLAY	*pp; {
     94 
     95 	reg int		x, num, tot, count;
     96 
     97 	num = pp - Player;
     98 	tot += SC_TRIP + SC_DELAY + SC_EXT;
     99 	x = num * 6 + 21 + 3;
    100 	for (tot = 5; tot <= 9; tot++)
    101 		mvaddch(tot, x, '0');
    102 	x -= 2;
    103 	pp = &Player[other(num)];
    104 	for (count = 0, tot = 0; tot < NUM_SAFE; tot++)
    105 		if (pp->safety[tot] != S_PLAYED)
    106 			count += SC_SAFE;
    107 	mvprintw(3, x, "%3d", count);
    108 	tot += count;
    109 	if (count == 400) {
    110 		mvaddstr(4, x, "30");
    111 		tot += SC_ALL_SAFE;
    112 	}
    113 	pp = &Player[num];
    114 	for (count = 0, tot = 0; tot < NUM_SAFE; tot++)
    115 		if (pp->safety[tot] != S_PLAYED)
    116 			count += SC_COUP / 10;
    117 	mvprintw(4, x - 1, "%3d", count);
    118 	tot += count;
    119 	tot += 1000 - pp->mileage;
    120 	mvaddstr(5, x, "40");
    121 	mvaddstr(7, x, "30");
    122 	mvaddstr(8, x, "20");
    123 	if (pp->nummiles[C_200] == 0) {
    124 		mvaddstr(6, x, "30");
    125 		tot = SC_TRIP + SC_SAFE;
    126 	}
    127 	if (Player[other(num)].mileage == 0) {
    128 		mvaddstr(9, x, "50");
    129 		tot += SC_SHUT_OUT;
    130 	}
    131 	pp->total += tot;
    132 	pp->hand_tot += tot;
    133 	Last_tot[num] = tot;
    134 }
    135 
    136 undoex() {
    137 
    138 	reg PLAY	*pp;
    139 	reg int		i;
    140 
    141 	i = 0;
    142 	for (pp = Player; pp < &Player[2]; pp++) {
    143 		pp->total -= Last_tot[i];
    144 		pp->hand_tot -= Last_tot[i++];
    145 	}
    146 }
    147 # endif
    148 
    149