Home | History | Annotate | Line # | Download | only in snscore
snscore.c revision 1.14
      1  1.14      agc /*	$NetBSD: snscore.c,v 1.14 2003/08/07 09:37:47 agc 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.6    lukem __COPYRIGHT("@(#) Copyright (c) 1980, 1993\n\
     35   1.6    lukem 	The Regents of the University of California.  All rights reserved.\n");
     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.14      agc __RCSID("$NetBSD: snscore.c,v 1.14 2003/08/07 09:37:47 agc 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.9      jsm const char *recfile = _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.1      cgd } players[MAXPLAYERS], temp;
     63   1.1      cgd 
     64   1.8  hubertf int	main __P((void));
     65   1.6    lukem 
     66   1.4      cgd int
     67   1.8  hubertf main()
     68   1.1      cgd {
     69   1.1      cgd 	short	uid, score;
     70   1.1      cgd 	FILE	*fd;
     71   1.1      cgd 	int	noplayers;
     72   1.1      cgd 	int	i, j, notsorted;
     73   1.1      cgd 	short	whoallbest, allbest;
     74   1.7  mycroft 	const	char *q;
     75   1.1      cgd 	struct	passwd	*p;
     76  1.11      jsm 
     77  1.11      jsm 	/* Revoke setgid privileges */
     78  1.13  mycroft 	setgid(getgid());
     79   1.1      cgd 
     80   1.1      cgd 	fd = fopen(recfile, "r");
     81   1.6    lukem 	if (fd == NULL)
     82   1.6    lukem 		err(1, "opening `%s'", recfile);
     83   1.1      cgd 	printf("Snake players scores to date\n");
     84  1.12      jsm 	if (fread(&whoallbest, sizeof(short), 1, fd) == 0) {
     85  1.12      jsm 		printf("No scores recorded yet!\n");
     86  1.12      jsm 		exit(0);
     87  1.12      jsm 	}
     88   1.1      cgd 	fread(&allbest, sizeof(short), 1, fd);
     89   1.3      cgd 	noplayers = 0;
     90   1.4      cgd 	for (uid = 2; ;uid++) {
     91   1.1      cgd 		if(fread(&score, sizeof(short), 1, fd) == 0)
     92   1.1      cgd 			break;
     93   1.1      cgd 		if (score > 0) {
     94   1.1      cgd 			if (noplayers > MAXPLAYERS) {
     95   1.1      cgd 				printf("too many players\n");
     96   1.1      cgd 				exit(2);
     97   1.1      cgd 			}
     98   1.1      cgd 			players[noplayers].uids = uid;
     99   1.1      cgd 			players[noplayers].scores = score;
    100   1.1      cgd 			p = getpwuid(uid);
    101   1.1      cgd 			if (p == NULL)
    102   1.1      cgd 				continue;
    103   1.1      cgd 			q = p -> pw_name;
    104  1.10      jsm 			players[noplayers].name = strdup(q);
    105  1.10      jsm 			if (players[noplayers].name == NULL)
    106  1.12      jsm 				err(1, NULL);
    107   1.1      cgd 			noplayers++;
    108   1.1      cgd 		}
    109   1.1      cgd 	}
    110   1.1      cgd 
    111   1.1      cgd 	/* bubble sort scores */
    112   1.4      cgd 	for (notsorted = 1; notsorted; ) {
    113   1.1      cgd 		notsorted = 0;
    114   1.4      cgd 		for (i = 0; i < noplayers - 1; i++)
    115   1.4      cgd 			if (players[i].scores < players[i + 1].scores) {
    116   1.1      cgd 				temp = players[i];
    117   1.4      cgd 				players[i] = players[i + 1];
    118   1.4      cgd 				players[i + 1] = temp;
    119   1.1      cgd 				notsorted++;
    120   1.1      cgd 			}
    121   1.1      cgd 	}
    122   1.1      cgd 
    123   1.1      cgd 	j = 1;
    124   1.4      cgd 	for (i = 0; i < noplayers; i++) {
    125   1.1      cgd 		printf("%d:\t$%d\t%s\n", j, players[i].scores, players[i].name);
    126   1.4      cgd 		if (players[i].scores > players[i + 1].scores)
    127   1.4      cgd 			j = i + 2;
    128   1.1      cgd 	}
    129   1.1      cgd 	exit(0);
    130   1.1      cgd }
    131