Home | History | Annotate | Line # | Download | only in robots
      1  1.24       mrg /*	$NetBSD: score.c,v 1.24 2021/04/13 01:50:46 mrg 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.24       mrg __RCSID("$NetBSD: score.c,v 1.24 2021/04/13 01:50:46 mrg Exp $");
     38   1.3       cgd #endif
     39   1.1       cgd #endif /* not lint */
     40   1.1       cgd 
     41  1.21  dholland #include <curses.h>
     42  1.21  dholland #include <err.h>
     43  1.21  dholland #include <fcntl.h>
     44  1.21  dholland #include <pwd.h>
     45  1.21  dholland #include <stdio.h>
     46  1.21  dholland #include <stdlib.h>
     47  1.21  dholland #include <string.h>
     48  1.21  dholland #include <unistd.h>
     49  1.20  dholland #include "robots.h"
     50  1.20  dholland #include "pathnames.h"
     51   1.1       cgd 
     52  1.20  dholland const char *Scorefile = _PATH_SCORE;
     53   1.1       cgd 
     54  1.20  dholland int Max_per_uid = MAX_PER_UID;
     55   1.1       cgd 
     56  1.20  dholland static SCORE Top[MAXSCORES];
     57   1.1       cgd 
     58  1.21  dholland static uint32_t numscores, max_uid;
     59   1.6  christos 
     60  1.23  dholland static int cmp_sc(const void *, const void *);
     61  1.23  dholland static void set_name(SCORE *);
     62  1.23  dholland 
     63   1.6  christos /*
     64   1.6  christos  * read_score:
     65   1.6  christos  *	Read the score file in MI format
     66   1.6  christos  */
     67   1.6  christos static void
     68  1.19  dholland read_score(int inf)
     69   1.6  christos {
     70  1.20  dholland 	SCORE *scp;
     71   1.6  christos 
     72  1.22  dholland 	if (read(inf, &max_uid, sizeof max_uid) == sizeof max_uid &&
     73  1.22  dholland 	    read(inf, Top, sizeof Top) == sizeof Top) {
     74   1.6  christos 		max_uid = ntohl(max_uid);
     75   1.6  christos 		for (scp = Top; scp < &Top[MAXSCORES]; scp++) {
     76   1.6  christos 			 scp->s_uid = ntohl(scp->s_uid);
     77   1.6  christos 			 scp->s_score = ntohl(scp->s_score);
     78   1.6  christos 			 scp->s_auto = ntohl(scp->s_auto);
     79   1.6  christos 			 scp->s_level = ntohl(scp->s_level);
     80   1.6  christos 		}
     81   1.6  christos 	}
     82   1.6  christos 	else {
     83   1.6  christos 		for (scp = Top; scp < &Top[MAXSCORES]; scp++)
     84   1.6  christos 			scp->s_score = 0;
     85   1.6  christos 		max_uid = Max_per_uid;
     86   1.6  christos 	}
     87   1.6  christos }
     88   1.6  christos 
     89   1.6  christos /*
     90   1.6  christos  * write_score:
     91   1.6  christos  *	Write the score file in MI format
     92   1.6  christos  */
     93   1.6  christos static void
     94  1.19  dholland write_score(int inf)
     95   1.6  christos {
     96  1.20  dholland 	SCORE *scp;
     97   1.6  christos 
     98   1.9       jsm 	lseek(inf, 0L, SEEK_SET);
     99   1.6  christos 
    100   1.6  christos 	max_uid = htonl(max_uid);
    101   1.6  christos 	write(inf, &max_uid, sizeof max_uid);
    102   1.6  christos 
    103   1.6  christos 	for (scp = Top; scp < &Top[MAXSCORES]; scp++) {
    104   1.6  christos 		 scp->s_uid = htonl(scp->s_uid);
    105   1.6  christos 		 scp->s_score = htonl(scp->s_score);
    106   1.6  christos 		 scp->s_auto = htonl(scp->s_auto);
    107   1.6  christos 		 scp->s_level = htonl(scp->s_level);
    108   1.6  christos 	}
    109   1.6  christos 
    110   1.6  christos 	write(inf, Top, sizeof Top);
    111   1.6  christos }
    112   1.6  christos 
    113   1.6  christos 
    114   1.1       cgd /*
    115   1.1       cgd  * score:
    116   1.1       cgd  *	Post the player's score, if reasonable, and then print out the
    117   1.1       cgd  *	top list.
    118   1.1       cgd  */
    119   1.4     lukem void
    120  1.19  dholland score(int score_wfd)
    121   1.1       cgd {
    122  1.20  dholland 	int inf = score_wfd;
    123  1.20  dholland 	SCORE *scp;
    124  1.21  dholland 	uint32_t uid;
    125  1.21  dholland 	bool done_show = false;
    126   1.1       cgd 
    127  1.21  dholland 	Newscore = false;
    128  1.10       jsm 	if (inf < 0)
    129   1.1       cgd 		return;
    130   1.1       cgd 
    131   1.6  christos 	read_score(inf);
    132   1.1       cgd 
    133   1.1       cgd 	uid = getuid();
    134   1.1       cgd 	if (Top[MAXSCORES-1].s_score <= Score) {
    135   1.1       cgd 		numscores = 0;
    136   1.1       cgd 		for (scp = Top; scp < &Top[MAXSCORES]; scp++)
    137  1.11       jsm 			if ((scp->s_uid == uid && ++numscores == max_uid)) {
    138   1.1       cgd 				if (scp->s_score > Score)
    139   1.1       cgd 					break;
    140   1.1       cgd 				scp->s_score = Score;
    141   1.1       cgd 				scp->s_uid = uid;
    142   1.6  christos 				scp->s_auto = Auto_bot;
    143   1.6  christos 				scp->s_level = Level;
    144   1.1       cgd 				set_name(scp);
    145  1.21  dholland 				Newscore = true;
    146   1.1       cgd 				break;
    147   1.1       cgd 			}
    148   1.1       cgd 		if (scp == &Top[MAXSCORES]) {
    149   1.1       cgd 			Top[MAXSCORES-1].s_score = Score;
    150   1.1       cgd 			Top[MAXSCORES-1].s_uid = uid;
    151   1.6  christos 			Top[MAXSCORES-1].s_auto = Auto_bot;
    152   1.6  christos 			Top[MAXSCORES-1].s_level = Level;
    153   1.1       cgd 			set_name(&Top[MAXSCORES-1]);
    154  1.21  dholland 			Newscore = true;
    155   1.1       cgd 		}
    156   1.1       cgd 		if (Newscore)
    157   1.1       cgd 			qsort(Top, MAXSCORES, sizeof Top[0], cmp_sc);
    158   1.1       cgd 	}
    159   1.1       cgd 
    160   1.1       cgd 	if (!Newscore) {
    161  1.21  dholland 		Full_clear = false;
    162  1.10       jsm 		lseek(inf, 0, SEEK_SET);
    163   1.1       cgd 		return;
    164   1.1       cgd 	}
    165   1.1       cgd 	else
    166  1.21  dholland 		Full_clear = true;
    167   1.1       cgd 
    168   1.6  christos 	move(1, 15);
    169   1.6  christos 	printw("%5.5s %5.5s %-9.9s %-8.8s %5.5s", "Rank", "Score", "User",
    170   1.6  christos 	    " ", "Level");
    171   1.6  christos 
    172   1.1       cgd 	for (scp = Top; scp < &Top[MAXSCORES]; scp++) {
    173   1.6  christos 		if (scp->s_score == 0)
    174   1.1       cgd 			break;
    175   1.6  christos 		move((scp - Top) + 2, 15);
    176   1.1       cgd 		if (!done_show && scp->s_uid == uid && scp->s_score == Score)
    177   1.1       cgd 			standout();
    178  1.14       jdc 		printw("%5ld %5d %-8.8s %-9.9s %5d",
    179  1.15   thorpej 		    (long)(scp - Top) + 1, scp->s_score, scp->s_name,
    180  1.12       jsm 		    scp->s_auto ? "(autobot)" : "", scp->s_level);
    181   1.1       cgd 		if (!done_show && scp->s_uid == uid && scp->s_score == Score) {
    182   1.1       cgd 			standend();
    183  1.21  dholland 			done_show = true;
    184   1.1       cgd 		}
    185   1.1       cgd 	}
    186   1.1       cgd 	Num_scores = scp - Top;
    187   1.1       cgd 	refresh();
    188   1.1       cgd 
    189   1.1       cgd 	if (Newscore) {
    190   1.6  christos 		write_score(inf);
    191   1.1       cgd 	}
    192  1.10       jsm 	lseek(inf, 0, SEEK_SET);
    193   1.1       cgd }
    194   1.1       cgd 
    195  1.23  dholland static void
    196  1.19  dholland set_name(SCORE *scp)
    197   1.1       cgd {
    198  1.21  dholland 	struct passwd *pp;
    199   1.1       cgd 
    200   1.1       cgd 	if ((pp = getpwuid(scp->s_uid)) == NULL)
    201  1.24       mrg 		strncpy(scp->s_name, "???", MAXNAME - 1);
    202  1.18       abs 	else
    203  1.24       mrg 		strncpy(scp->s_name, pp->pw_name, MAXNAME - 1);
    204  1.24       mrg 	scp->s_name[MAXNAME - 1] = '\0';
    205   1.1       cgd }
    206   1.1       cgd 
    207   1.1       cgd /*
    208   1.1       cgd  * cmp_sc:
    209   1.1       cgd  *	Compare two scores.
    210   1.1       cgd  */
    211  1.23  dholland static int
    212  1.19  dholland cmp_sc(const void *s1, const void *s2)
    213   1.1       cgd {
    214   1.8       jsm 	return ((const SCORE *)s2)->s_score - ((const SCORE *)s1)->s_score;
    215   1.1       cgd }
    216   1.1       cgd 
    217   1.1       cgd /*
    218   1.1       cgd  * show_score:
    219   1.1       cgd  *	Show the score list for the '-s' option.
    220   1.1       cgd  */
    221   1.4     lukem void
    222  1.19  dholland show_score(void)
    223   1.1       cgd {
    224  1.20  dholland 	SCORE *scp;
    225  1.20  dholland 	int inf;
    226   1.1       cgd 
    227   1.5     lukem 	if ((inf = open(Scorefile, O_RDONLY)) < 0) {
    228   1.5     lukem 		warn("opening `%s'", Scorefile);
    229   1.1       cgd 		return;
    230   1.1       cgd 	}
    231   1.1       cgd 
    232   1.6  christos 	read_score(inf);
    233   1.1       cgd 	close(inf);
    234   1.1       cgd 	inf = 1;
    235   1.6  christos 	printf("%5.5s %5.5s %-9.9s %-8.8s %5.5s\n", "Rank", "Score", "User",
    236   1.6  christos 	    " ", "Level");
    237   1.1       cgd 	for (scp = Top; scp < &Top[MAXSCORES]; scp++)
    238   1.6  christos 		if (scp->s_score > 0)
    239  1.13   mycroft 			printf("%5d %5d %-8.8s %-9.9s %5d\n",
    240   1.6  christos 			    inf++, scp->s_score, scp->s_name,
    241   1.6  christos 			    scp->s_auto ? "(autobot)" :  "", scp->s_level);
    242   1.1       cgd }
    243