Home | History | Annotate | Line # | Download | only in robots
score.c revision 1.9
      1  1.9       jsm /*	$NetBSD: score.c,v 1.9 1999/09/08 21:57:20 jsm Exp $	*/
      2  1.3       cgd 
      3  1.1       cgd /*
      4  1.3       cgd  * Copyright (c) 1980, 1993
      5  1.3       cgd  *	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.1       cgd  * 3. All advertising materials mentioning features or use of this software
     16  1.1       cgd  *    must display the following acknowledgement:
     17  1.1       cgd  *	This product includes software developed by the University of
     18  1.1       cgd  *	California, Berkeley and its contributors.
     19  1.1       cgd  * 4. Neither the name of the University nor the names of its contributors
     20  1.1       cgd  *    may be used to endorse or promote products derived from this software
     21  1.1       cgd  *    without specific prior written permission.
     22  1.1       cgd  *
     23  1.1       cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     24  1.1       cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     25  1.1       cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     26  1.1       cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     27  1.1       cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     28  1.1       cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     29  1.1       cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     30  1.1       cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     31  1.1       cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     32  1.1       cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     33  1.1       cgd  * SUCH DAMAGE.
     34  1.1       cgd  */
     35  1.1       cgd 
     36  1.4     lukem #include <sys/cdefs.h>
     37  1.1       cgd #ifndef lint
     38  1.3       cgd #if 0
     39  1.3       cgd static char sccsid[] = "@(#)score.c	8.1 (Berkeley) 5/31/93";
     40  1.3       cgd #else
     41  1.9       jsm __RCSID("$NetBSD: score.c,v 1.9 1999/09/08 21:57:20 jsm Exp $");
     42  1.3       cgd #endif
     43  1.1       cgd #endif /* not lint */
     44  1.1       cgd 
     45  1.1       cgd # include	"robots.h"
     46  1.1       cgd # include	"pathnames.h"
     47  1.1       cgd 
     48  1.8       jsm const char	*Scorefile = _PATH_SCORE;
     49  1.1       cgd 
     50  1.1       cgd int	Max_per_uid = MAX_PER_UID;
     51  1.1       cgd 
     52  1.1       cgd static SCORE	Top[MAXSCORES];
     53  1.1       cgd 
     54  1.6  christos static u_int32_t	numscores, max_uid;
     55  1.7  christos 
     56  1.7  christos static void read_score __P((int));
     57  1.7  christos static void write_score __P((int));
     58  1.6  christos 
     59  1.6  christos /*
     60  1.6  christos  * read_score:
     61  1.6  christos  *	Read the score file in MI format
     62  1.6  christos  */
     63  1.6  christos static void
     64  1.6  christos read_score(inf)
     65  1.6  christos 	int inf;
     66  1.6  christos {
     67  1.6  christos 	SCORE	*scp;
     68  1.6  christos 
     69  1.6  christos 	if (read(inf, &max_uid, sizeof max_uid) == sizeof max_uid) {
     70  1.6  christos 		max_uid = ntohl(max_uid);
     71  1.6  christos 
     72  1.6  christos 		read(inf, Top, sizeof Top);
     73  1.6  christos 		for (scp = Top; scp < &Top[MAXSCORES]; scp++) {
     74  1.6  christos 			 scp->s_uid = ntohl(scp->s_uid);
     75  1.6  christos 			 scp->s_score = ntohl(scp->s_score);
     76  1.6  christos 			 scp->s_auto = ntohl(scp->s_auto);
     77  1.6  christos 			 scp->s_level = ntohl(scp->s_level);
     78  1.6  christos 		}
     79  1.6  christos 	}
     80  1.6  christos 	else {
     81  1.6  christos 		for (scp = Top; scp < &Top[MAXSCORES]; scp++)
     82  1.6  christos 			scp->s_score = 0;
     83  1.6  christos 		max_uid = Max_per_uid;
     84  1.6  christos 	}
     85  1.6  christos }
     86  1.6  christos 
     87  1.6  christos /*
     88  1.6  christos  * write_score:
     89  1.6  christos  *	Write the score file in MI format
     90  1.6  christos  */
     91  1.6  christos static void
     92  1.6  christos write_score(inf)
     93  1.6  christos 	int inf;
     94  1.6  christos {
     95  1.6  christos 	SCORE	*scp;
     96  1.6  christos 
     97  1.9       jsm 	lseek(inf, 0L, SEEK_SET);
     98  1.6  christos 
     99  1.6  christos 	max_uid = htonl(max_uid);
    100  1.6  christos 	write(inf, &max_uid, sizeof max_uid);
    101  1.6  christos 
    102  1.6  christos 	for (scp = Top; scp < &Top[MAXSCORES]; scp++) {
    103  1.6  christos 		 scp->s_uid = htonl(scp->s_uid);
    104  1.6  christos 		 scp->s_score = htonl(scp->s_score);
    105  1.6  christos 		 scp->s_auto = htonl(scp->s_auto);
    106  1.6  christos 		 scp->s_level = htonl(scp->s_level);
    107  1.6  christos 	}
    108  1.6  christos 
    109  1.6  christos 	write(inf, Top, sizeof Top);
    110  1.6  christos }
    111  1.6  christos 
    112  1.6  christos 
    113  1.1       cgd /*
    114  1.1       cgd  * score:
    115  1.1       cgd  *	Post the player's score, if reasonable, and then print out the
    116  1.1       cgd  *	top list.
    117  1.1       cgd  */
    118  1.4     lukem void
    119  1.1       cgd score()
    120  1.1       cgd {
    121  1.6  christos 	int			inf;
    122  1.6  christos 	SCORE			*scp;
    123  1.6  christos 	int			uid;
    124  1.6  christos 	bool			done_show = FALSE;
    125  1.1       cgd 
    126  1.1       cgd 	Newscore = FALSE;
    127  1.5     lukem 	if ((inf = open(Scorefile, O_RDWR)) < 0) {
    128  1.5     lukem 		warn("opening `%s'", Scorefile);
    129  1.1       cgd 		return;
    130  1.1       cgd 	}
    131  1.1       cgd 
    132  1.6  christos 	read_score(inf);
    133  1.1       cgd 
    134  1.1       cgd 	uid = getuid();
    135  1.1       cgd 	if (Top[MAXSCORES-1].s_score <= Score) {
    136  1.1       cgd 		numscores = 0;
    137  1.1       cgd 		for (scp = Top; scp < &Top[MAXSCORES]; scp++)
    138  1.1       cgd 			if (scp->s_score < 0 ||
    139  1.1       cgd 			    (scp->s_uid == uid && ++numscores == max_uid)) {
    140  1.1       cgd 				if (scp->s_score > Score)
    141  1.1       cgd 					break;
    142  1.1       cgd 				scp->s_score = Score;
    143  1.1       cgd 				scp->s_uid = uid;
    144  1.6  christos 				scp->s_auto = Auto_bot;
    145  1.6  christos 				scp->s_level = Level;
    146  1.1       cgd 				set_name(scp);
    147  1.1       cgd 				Newscore = TRUE;
    148  1.1       cgd 				break;
    149  1.1       cgd 			}
    150  1.1       cgd 		if (scp == &Top[MAXSCORES]) {
    151  1.1       cgd 			Top[MAXSCORES-1].s_score = Score;
    152  1.1       cgd 			Top[MAXSCORES-1].s_uid = uid;
    153  1.6  christos 			Top[MAXSCORES-1].s_auto = Auto_bot;
    154  1.6  christos 			Top[MAXSCORES-1].s_level = Level;
    155  1.1       cgd 			set_name(&Top[MAXSCORES-1]);
    156  1.1       cgd 			Newscore = TRUE;
    157  1.1       cgd 		}
    158  1.1       cgd 		if (Newscore)
    159  1.1       cgd 			qsort(Top, MAXSCORES, sizeof Top[0], cmp_sc);
    160  1.1       cgd 	}
    161  1.1       cgd 
    162  1.1       cgd 	if (!Newscore) {
    163  1.1       cgd 		Full_clear = FALSE;
    164  1.1       cgd 		close(inf);
    165  1.1       cgd 		return;
    166  1.1       cgd 	}
    167  1.1       cgd 	else
    168  1.1       cgd 		Full_clear = TRUE;
    169  1.1       cgd 
    170  1.6  christos 	move(1, 15);
    171  1.6  christos 	printw("%5.5s %5.5s %-9.9s %-8.8s %5.5s", "Rank", "Score", "User",
    172  1.6  christos 	    " ", "Level");
    173  1.6  christos 
    174  1.1       cgd 	for (scp = Top; scp < &Top[MAXSCORES]; scp++) {
    175  1.6  christos 		if (scp->s_score == 0)
    176  1.1       cgd 			break;
    177  1.6  christos 		move((scp - Top) + 2, 15);
    178  1.1       cgd 		if (!done_show && scp->s_uid == uid && scp->s_score == Score)
    179  1.1       cgd 			standout();
    180  1.6  christos 		printw("%5.5d %5.5d %-8.8s %-9.9s %5.5d",
    181  1.6  christos 		    (scp - Top) + 1, scp->s_score, scp->s_name,
    182  1.6  christos 		    Auto_bot ? "(autobot)" : "", scp->s_level);
    183  1.1       cgd 		if (!done_show && scp->s_uid == uid && scp->s_score == Score) {
    184  1.1       cgd 			standend();
    185  1.1       cgd 			done_show = TRUE;
    186  1.1       cgd 		}
    187  1.1       cgd 	}
    188  1.1       cgd 	Num_scores = scp - Top;
    189  1.1       cgd 	refresh();
    190  1.1       cgd 
    191  1.1       cgd 	if (Newscore) {
    192  1.6  christos 		write_score(inf);
    193  1.1       cgd 	}
    194  1.1       cgd 	close(inf);
    195  1.1       cgd }
    196  1.1       cgd 
    197  1.4     lukem void
    198  1.1       cgd set_name(scp)
    199  1.4     lukem 	SCORE	*scp;
    200  1.1       cgd {
    201  1.4     lukem 	PASSWD	*pp;
    202  1.8       jsm 	static char unknown[] = "???";
    203  1.1       cgd 
    204  1.1       cgd 	if ((pp = getpwuid(scp->s_uid)) == NULL)
    205  1.8       jsm 		pp->pw_name = unknown;
    206  1.1       cgd 	strncpy(scp->s_name, pp->pw_name, MAXNAME);
    207  1.1       cgd }
    208  1.1       cgd 
    209  1.1       cgd /*
    210  1.1       cgd  * cmp_sc:
    211  1.1       cgd  *	Compare two scores.
    212  1.1       cgd  */
    213  1.4     lukem int
    214  1.1       cgd cmp_sc(s1, s2)
    215  1.4     lukem 	const void *s1, *s2;
    216  1.1       cgd {
    217  1.8       jsm 	return ((const SCORE *)s2)->s_score - ((const SCORE *)s1)->s_score;
    218  1.1       cgd }
    219  1.1       cgd 
    220  1.1       cgd /*
    221  1.1       cgd  * show_score:
    222  1.1       cgd  *	Show the score list for the '-s' option.
    223  1.1       cgd  */
    224  1.4     lukem void
    225  1.1       cgd show_score()
    226  1.1       cgd {
    227  1.4     lukem 	SCORE		*scp;
    228  1.4     lukem 	int		inf;
    229  1.1       cgd 
    230  1.5     lukem 	if ((inf = open(Scorefile, O_RDONLY)) < 0) {
    231  1.5     lukem 		warn("opening `%s'", Scorefile);
    232  1.1       cgd 		return;
    233  1.1       cgd 	}
    234  1.1       cgd 
    235  1.6  christos 	read_score(inf);
    236  1.1       cgd 	close(inf);
    237  1.1       cgd 	inf = 1;
    238  1.6  christos 	printf("%5.5s %5.5s %-9.9s %-8.8s %5.5s\n", "Rank", "Score", "User",
    239  1.6  christos 	    " ", "Level");
    240  1.1       cgd 	for (scp = Top; scp < &Top[MAXSCORES]; scp++)
    241  1.6  christos 		if (scp->s_score > 0)
    242  1.6  christos 			printf("%5.5d %5.5d %-8.8s %-9.9s %5.5d\n",
    243  1.6  christos 			    inf++, scp->s_score, scp->s_name,
    244  1.6  christos 			    scp->s_auto ? "(autobot)" :  "", scp->s_level);
    245  1.1       cgd }
    246