Home | History | Annotate | Line # | Download | only in snscore
      1  1.20       kre /*	$NetBSD: snscore.c,v 1.20 2021/05/12 15:26:44 kre Exp $	*/
      2   1.4       cgd 
      3   1.1       cgd /*
      4   1.4       cgd  * Copyright (c) 1980, 1993
      5   1.4       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.14       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.6     lukem #include <sys/cdefs.h>
     33   1.1       cgd #ifndef lint
     34  1.17     lukem __COPYRIGHT("@(#) Copyright (c) 1980, 1993\
     35  1.17     lukem  The Regents of the University of California.  All rights reserved.");
     36   1.1       cgd #endif /* not lint */
     37   1.1       cgd 
     38   1.1       cgd #ifndef lint
     39   1.4       cgd #if 0
     40   1.4       cgd static char sccsid[] = "@(#)snscore.c	8.1 (Berkeley) 7/19/93";
     41   1.4       cgd #else
     42  1.20       kre __RCSID("$NetBSD: snscore.c,v 1.20 2021/05/12 15:26:44 kre Exp $");
     43   1.4       cgd #endif
     44   1.1       cgd #endif /* not lint */
     45   1.1       cgd 
     46   1.1       cgd #include <sys/types.h>
     47   1.6     lukem #include <err.h>
     48   1.1       cgd #include <pwd.h>
     49   1.1       cgd #include <stdio.h>
     50   1.1       cgd #include <stdlib.h>
     51   1.5       cgd #include <string.h>
     52  1.11       jsm #include <unistd.h>
     53   1.1       cgd #include "pathnames.h"
     54   1.1       cgd 
     55  1.20       kre static const char *recfile = SNAKE_PATH_RAWSCORES;
     56   1.1       cgd #define MAXPLAYERS 256
     57   1.1       cgd 
     58   1.1       cgd struct	player	{
     59   1.1       cgd 	short	uids;
     60   1.1       cgd 	short	scores;
     61   1.1       cgd 	char	*name;
     62  1.18  dholland };
     63  1.18  dholland 
     64  1.18  dholland static struct player players[MAXPLAYERS], temp;
     65   1.1       cgd 
     66  1.15       jsm int	main(void);
     67   1.6     lukem 
     68   1.4       cgd int
     69  1.19  dholland main(void)
     70   1.1       cgd {
     71   1.1       cgd 	short	uid, score;
     72   1.1       cgd 	FILE	*fd;
     73   1.1       cgd 	int	noplayers;
     74   1.1       cgd 	int	i, j, notsorted;
     75   1.1       cgd 	short	whoallbest, allbest;
     76   1.7   mycroft 	const	char *q;
     77   1.1       cgd 	struct	passwd	*p;
     78  1.11       jsm 
     79  1.11       jsm 	/* Revoke setgid privileges */
     80  1.13   mycroft 	setgid(getgid());
     81   1.1       cgd 
     82   1.1       cgd 	fd = fopen(recfile, "r");
     83   1.6     lukem 	if (fd == NULL)
     84   1.6     lukem 		err(1, "opening `%s'", recfile);
     85   1.1       cgd 	printf("Snake players scores to date\n");
     86  1.12       jsm 	if (fread(&whoallbest, sizeof(short), 1, fd) == 0) {
     87  1.12       jsm 		printf("No scores recorded yet!\n");
     88  1.12       jsm 		exit(0);
     89  1.12       jsm 	}
     90   1.1       cgd 	fread(&allbest, sizeof(short), 1, fd);
     91   1.3       cgd 	noplayers = 0;
     92   1.4       cgd 	for (uid = 2; ;uid++) {
     93   1.1       cgd 		if(fread(&score, sizeof(short), 1, fd) == 0)
     94   1.1       cgd 			break;
     95   1.1       cgd 		if (score > 0) {
     96  1.16       abs 			if (noplayers >= MAXPLAYERS) {
     97   1.1       cgd 				printf("too many players\n");
     98   1.1       cgd 				exit(2);
     99   1.1       cgd 			}
    100   1.1       cgd 			players[noplayers].uids = uid;
    101   1.1       cgd 			players[noplayers].scores = score;
    102   1.1       cgd 			p = getpwuid(uid);
    103   1.1       cgd 			if (p == NULL)
    104   1.1       cgd 				continue;
    105   1.1       cgd 			q = p -> pw_name;
    106  1.10       jsm 			players[noplayers].name = strdup(q);
    107  1.10       jsm 			if (players[noplayers].name == NULL)
    108  1.12       jsm 				err(1, NULL);
    109   1.1       cgd 			noplayers++;
    110   1.1       cgd 		}
    111   1.1       cgd 	}
    112   1.1       cgd 
    113   1.1       cgd 	/* bubble sort scores */
    114   1.4       cgd 	for (notsorted = 1; notsorted; ) {
    115   1.1       cgd 		notsorted = 0;
    116   1.4       cgd 		for (i = 0; i < noplayers - 1; i++)
    117   1.4       cgd 			if (players[i].scores < players[i + 1].scores) {
    118   1.1       cgd 				temp = players[i];
    119   1.4       cgd 				players[i] = players[i + 1];
    120   1.4       cgd 				players[i + 1] = temp;
    121   1.1       cgd 				notsorted++;
    122   1.1       cgd 			}
    123   1.1       cgd 	}
    124   1.1       cgd 
    125   1.1       cgd 	j = 1;
    126   1.4       cgd 	for (i = 0; i < noplayers; i++) {
    127   1.1       cgd 		printf("%d:\t$%d\t%s\n", j, players[i].scores, players[i].name);
    128   1.4       cgd 		if (players[i].scores > players[i + 1].scores)
    129   1.4       cgd 			j = i + 2;
    130   1.1       cgd 	}
    131   1.1       cgd 	exit(0);
    132   1.1       cgd }
    133