Home | History | Annotate | Line # | Download | only in mille 
      1 /*	$NetBSD: print.c,v 1.18 2011/08/21 08:50:08 christos 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. Neither the name of the University nor the names of its contributors
     16  *    may be used to endorse or promote products derived from this software
     17  *    without specific prior written permission.
     18  *
     19  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     20  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     21  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     22  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     23  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     24  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     25  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     26  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     27  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     28  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     29  * SUCH DAMAGE.
     30  */
     31 
     32 #include <sys/cdefs.h>
     33 #ifndef lint
     34 #if 0
     35 static char sccsid[] = "@(#)print.c	8.1 (Berkeley) 5/31/93";
     36 #else
     37 __RCSID("$NetBSD: print.c,v 1.18 2011/08/21 08:50:08 christos Exp $");
     38 #endif
     39 #endif /* not lint */
     40 
     41 #include "mille.h"
     42 
     43 /*
     44  * @(#)print.c	1.1 (Berkeley) 4/1/82
     45  */
     46 
     47 #define COMP_STRT	20
     48 #define CARD_STRT	2
     49 
     50 static void show_card(int, int, CARD, CARD *);
     51 static void show_score(int, int, int, int *);
     52 
     53 void
     54 prboard(void)
     55 {
     56 	PLAY	*pp;
     57 	int	i, j, k, temp;
     58 
     59 	for (k = 0; k < 2; k++) {
     60 		pp = &Player[k];
     61 		temp = k * COMP_STRT + CARD_STRT;
     62 		for (i = 0; i < NUM_SAFE; i++)
     63 			if (pp->safety[i] == S_PLAYED && !pp->sh_safety[i]) {
     64 				mvaddstr(i, temp, C_name[i + S_CONV]);
     65 				if (pp->coups[i])
     66 					mvaddch(i, temp - CARD_STRT, '*');
     67 				pp->sh_safety[i] = TRUE;
     68 			}
     69 		show_card(14, temp, pp->battle, &pp->sh_battle);
     70 		show_card(16, temp, pp->speed, &pp->sh_speed);
     71 		for (i = C_25; i <= C_200; i++) {
     72 			const char	*name;
     73 			int	end;
     74 
     75 			if (pp->nummiles[i] == pp->sh_nummiles[i])
     76 				continue;
     77 
     78 			name = C_name[i];
     79 			temp = k * 40;
     80 			end = pp->nummiles[i];
     81 			for (j = pp->sh_nummiles[i]; j < end; j++)
     82 				mvwaddstr(Miles, i + 1, (j << 2) + temp, name);
     83 			pp->sh_nummiles[i] = end;
     84 		}
     85 	}
     86 	prscore(TRUE);
     87 	temp = CARD_STRT;
     88 	pp = &Player[PLAYER];
     89 	for (i = 0; i < HAND_SZ; i++)
     90 		show_card(i + 6, temp, pp->hand[i], &pp->sh_hand[i]);
     91 	mvprintw(6, COMP_STRT + CARD_STRT, "%2ld", (long)(Topcard - Deck));
     92 	show_card(8, COMP_STRT + CARD_STRT, Discard, &Sh_discard);
     93 	if (End == 1000) {
     94 		move(EXT_Y, EXT_X);
     95 		standout();
     96 		addstr("Extension");
     97 		standend();
     98 	}
     99 	wrefresh(Board);
    100 	wrefresh(Miles);
    101 	wrefresh(Score);
    102 }
    103 
    104 /*
    105  * show_card:
    106  *	Show the given card if it is different from the last one shown
    107  */
    108 static void
    109 show_card(int y, int x, CARD c, CARD *lc)
    110 {
    111 	if (c == *lc)
    112 		return;
    113 
    114 	mvprintw(y, x, C_fmt, C_name[c]);
    115 	*lc = c;
    116 }
    117 
    118 static const char Score_fmt[] = "%4d";
    119 
    120 void
    121 prscore(bool for_real)
    122 {
    123 	PLAY	*pp;
    124 	int	x;
    125 
    126 	stdscr = Score;
    127 	for (pp = Player; pp < &Player[2]; pp++) {
    128 		x = (pp - Player) * 6 + 21;
    129 		show_score(1, x, pp->mileage, &pp->sh_mileage);
    130 		if (pp->safescore != pp->sh_safescore) {
    131 			mvprintw(2, x, Score_fmt, pp->safescore);
    132 			if (pp->safescore == 400)
    133 				mvaddstr(3, x + 1, "300");
    134 			else
    135 				mvaddstr(3, x + 1, "  0");
    136 			mvprintw(4, x, Score_fmt, pp->coupscore);
    137 			pp->sh_safescore = pp->safescore;
    138 		}
    139 		if (Window == W_FULL || Finished) {
    140 #ifdef EXTRAP
    141 			if (for_real)
    142 				finalscore(pp);
    143 			else
    144 				extrapolate(pp);
    145 #else
    146 			finalscore(pp);
    147 #endif
    148 			show_score(11, x, pp->hand_tot, &pp->sh_hand_tot);
    149 			show_score(13, x, pp->total, &pp->sh_total);
    150 			show_score(14, x, pp->games, &pp->sh_games);
    151 		}
    152 		else {
    153 			show_score(6, x, pp->hand_tot, &pp->sh_hand_tot);
    154 			show_score(8, x, pp->total, &pp->sh_total);
    155 			show_score(9, x, pp->games, &pp->sh_games);
    156 		}
    157 	}
    158 	stdscr = Board;
    159 }
    160 
    161 /*
    162  * show_score:
    163  *	Show a score value if it is different from the last time we
    164  *	showed it.
    165  */
    166 static void
    167 show_score(int y, int x, int s, int *ls)
    168 {
    169 	if (s == *ls)
    170 		return;
    171 
    172 	mvprintw(y, x, Score_fmt, s);
    173 	*ls = s;
    174 }
    175