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