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