Home | History | Annotate | Line # | Download | only in robots
score.c revision 1.1
      1  1.1  cgd /*
      2  1.1  cgd  * Copyright (c) 1980 Regents of the University of California.
      3  1.1  cgd  * All rights reserved.
      4  1.1  cgd  *
      5  1.1  cgd  * Redistribution and use in source and binary forms, with or without
      6  1.1  cgd  * modification, are permitted provided that the following conditions
      7  1.1  cgd  * are met:
      8  1.1  cgd  * 1. Redistributions of source code must retain the above copyright
      9  1.1  cgd  *    notice, this list of conditions and the following disclaimer.
     10  1.1  cgd  * 2. Redistributions in binary form must reproduce the above copyright
     11  1.1  cgd  *    notice, this list of conditions and the following disclaimer in the
     12  1.1  cgd  *    documentation and/or other materials provided with the distribution.
     13  1.1  cgd  * 3. All advertising materials mentioning features or use of this software
     14  1.1  cgd  *    must display the following acknowledgement:
     15  1.1  cgd  *	This product includes software developed by the University of
     16  1.1  cgd  *	California, Berkeley and its contributors.
     17  1.1  cgd  * 4. Neither the name of the University nor the names of its contributors
     18  1.1  cgd  *    may be used to endorse or promote products derived from this software
     19  1.1  cgd  *    without specific prior written permission.
     20  1.1  cgd  *
     21  1.1  cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     22  1.1  cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     23  1.1  cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     24  1.1  cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     25  1.1  cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     26  1.1  cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     27  1.1  cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     28  1.1  cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     29  1.1  cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     30  1.1  cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     31  1.1  cgd  * SUCH DAMAGE.
     32  1.1  cgd  */
     33  1.1  cgd 
     34  1.1  cgd #ifndef lint
     35  1.1  cgd static char sccsid[] = "@(#)score.c	5.6 (Berkeley) 6/1/90";
     36  1.1  cgd #endif /* not lint */
     37  1.1  cgd 
     38  1.1  cgd # include	"robots.h"
     39  1.1  cgd # include	<sys/types.h>
     40  1.1  cgd # include	<pwd.h>
     41  1.1  cgd # include	"pathnames.h"
     42  1.1  cgd 
     43  1.1  cgd typedef struct {
     44  1.1  cgd 	int	s_uid;
     45  1.1  cgd 	int	s_score;
     46  1.1  cgd 	char	s_name[MAXNAME];
     47  1.1  cgd } SCORE;
     48  1.1  cgd 
     49  1.1  cgd typedef struct passwd	PASSWD;
     50  1.1  cgd 
     51  1.1  cgd char	*Scorefile = _PATH_SCORE;
     52  1.1  cgd 
     53  1.1  cgd int	Max_per_uid = MAX_PER_UID;
     54  1.1  cgd 
     55  1.1  cgd static SCORE	Top[MAXSCORES];
     56  1.1  cgd 
     57  1.1  cgd /*
     58  1.1  cgd  * score:
     59  1.1  cgd  *	Post the player's score, if reasonable, and then print out the
     60  1.1  cgd  *	top list.
     61  1.1  cgd  */
     62  1.1  cgd score()
     63  1.1  cgd {
     64  1.1  cgd 	register int	inf;
     65  1.1  cgd 	register SCORE	*scp;
     66  1.1  cgd 	register int	uid;
     67  1.1  cgd 	register bool	done_show = FALSE;
     68  1.1  cgd 	static int	numscores, max_uid;
     69  1.1  cgd 
     70  1.1  cgd 	Newscore = FALSE;
     71  1.1  cgd 	if ((inf = open(Scorefile, 2)) < 0) {
     72  1.1  cgd 		perror(Scorefile);
     73  1.1  cgd 		return;
     74  1.1  cgd 	}
     75  1.1  cgd 
     76  1.1  cgd 	if (read(inf, &max_uid, sizeof max_uid) == sizeof max_uid)
     77  1.1  cgd 		read(inf, Top, sizeof Top);
     78  1.1  cgd 	else {
     79  1.1  cgd 		for (scp = Top; scp < &Top[MAXSCORES]; scp++)
     80  1.1  cgd 			scp->s_score = -1;
     81  1.1  cgd 		max_uid = Max_per_uid;
     82  1.1  cgd 	}
     83  1.1  cgd 
     84  1.1  cgd 	uid = getuid();
     85  1.1  cgd 	if (Top[MAXSCORES-1].s_score <= Score) {
     86  1.1  cgd 		numscores = 0;
     87  1.1  cgd 		for (scp = Top; scp < &Top[MAXSCORES]; scp++)
     88  1.1  cgd 			if (scp->s_score < 0 ||
     89  1.1  cgd 			    (scp->s_uid == uid && ++numscores == max_uid)) {
     90  1.1  cgd 				if (scp->s_score > Score)
     91  1.1  cgd 					break;
     92  1.1  cgd 				scp->s_score = Score;
     93  1.1  cgd 				scp->s_uid = uid;
     94  1.1  cgd 				set_name(scp);
     95  1.1  cgd 				Newscore = TRUE;
     96  1.1  cgd 				break;
     97  1.1  cgd 			}
     98  1.1  cgd 		if (scp == &Top[MAXSCORES]) {
     99  1.1  cgd 			Top[MAXSCORES-1].s_score = Score;
    100  1.1  cgd 			Top[MAXSCORES-1].s_uid = uid;
    101  1.1  cgd 			set_name(&Top[MAXSCORES-1]);
    102  1.1  cgd 			Newscore = TRUE;
    103  1.1  cgd 		}
    104  1.1  cgd 		if (Newscore)
    105  1.1  cgd 			qsort(Top, MAXSCORES, sizeof Top[0], cmp_sc);
    106  1.1  cgd 	}
    107  1.1  cgd 
    108  1.1  cgd 	if (!Newscore) {
    109  1.1  cgd 		Full_clear = FALSE;
    110  1.1  cgd 		close(inf);
    111  1.1  cgd 		return;
    112  1.1  cgd 	}
    113  1.1  cgd 	else
    114  1.1  cgd 		Full_clear = TRUE;
    115  1.1  cgd 
    116  1.1  cgd 	for (scp = Top; scp < &Top[MAXSCORES]; scp++) {
    117  1.1  cgd 		if (scp->s_score < 0)
    118  1.1  cgd 			break;
    119  1.1  cgd 		move((scp - Top) + 1, 15);
    120  1.1  cgd 		if (!done_show && scp->s_uid == uid && scp->s_score == Score)
    121  1.1  cgd 			standout();
    122  1.1  cgd 		printw(" %d\t%d\t%-8.8s ", (scp - Top) + 1, scp->s_score, scp->s_name);
    123  1.1  cgd 		if (!done_show && scp->s_uid == uid && scp->s_score == Score) {
    124  1.1  cgd 			standend();
    125  1.1  cgd 			done_show = TRUE;
    126  1.1  cgd 		}
    127  1.1  cgd 	}
    128  1.1  cgd 	Num_scores = scp - Top;
    129  1.1  cgd 	refresh();
    130  1.1  cgd 
    131  1.1  cgd 	if (Newscore) {
    132  1.1  cgd 		lseek(inf, 0L, 0);
    133  1.1  cgd 		write(inf, &max_uid, sizeof max_uid);
    134  1.1  cgd 		write(inf, Top, sizeof Top);
    135  1.1  cgd 	}
    136  1.1  cgd 	close(inf);
    137  1.1  cgd }
    138  1.1  cgd 
    139  1.1  cgd set_name(scp)
    140  1.1  cgd register SCORE	*scp;
    141  1.1  cgd {
    142  1.1  cgd 	register PASSWD	*pp;
    143  1.1  cgd 
    144  1.1  cgd 	if ((pp = getpwuid(scp->s_uid)) == NULL)
    145  1.1  cgd 		pp->pw_name = "???";
    146  1.1  cgd 	strncpy(scp->s_name, pp->pw_name, MAXNAME);
    147  1.1  cgd }
    148  1.1  cgd 
    149  1.1  cgd /*
    150  1.1  cgd  * cmp_sc:
    151  1.1  cgd  *	Compare two scores.
    152  1.1  cgd  */
    153  1.1  cgd cmp_sc(s1, s2)
    154  1.1  cgd register SCORE	*s1, *s2;
    155  1.1  cgd {
    156  1.1  cgd 	return s2->s_score - s1->s_score;
    157  1.1  cgd }
    158  1.1  cgd 
    159  1.1  cgd /*
    160  1.1  cgd  * show_score:
    161  1.1  cgd  *	Show the score list for the '-s' option.
    162  1.1  cgd  */
    163  1.1  cgd show_score()
    164  1.1  cgd {
    165  1.1  cgd 	register SCORE	*scp;
    166  1.1  cgd 	register int	inf;
    167  1.1  cgd 	static int	max_score;
    168  1.1  cgd 
    169  1.1  cgd 	if ((inf = open(Scorefile, 0)) < 0) {
    170  1.1  cgd 		perror(Scorefile);
    171  1.1  cgd 		return;
    172  1.1  cgd 	}
    173  1.1  cgd 
    174  1.1  cgd 	for (scp = Top; scp < &Top[MAXSCORES]; scp++)
    175  1.1  cgd 		scp->s_score = -1;
    176  1.1  cgd 
    177  1.1  cgd 	read(inf, &max_score, sizeof max_score);
    178  1.1  cgd 	read(inf, Top, sizeof Top);
    179  1.1  cgd 	close(inf);
    180  1.1  cgd 	inf = 1;
    181  1.1  cgd 	for (scp = Top; scp < &Top[MAXSCORES]; scp++)
    182  1.1  cgd 		if (scp->s_score >= 0)
    183  1.1  cgd 			printf("%d\t%d\t%.*s\n", inf++, scp->s_score, sizeof scp->s_name, scp->s_name);
    184  1.1  cgd }
    185