Home | History | Annotate | Line # | Download | only in snscore
snscore.c revision 1.1.1.2
      1      1.1  cgd /*
      2  1.1.1.2  cgd  * Copyright (c) 1980, 1993
      3  1.1.1.2  cgd  *	The Regents of the University of California.  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.1.2  cgd static char copyright[] =
     36  1.1.1.2  cgd "@(#) Copyright (c) 1980, 1993\n\
     37  1.1.1.2  cgd 	The Regents of the University of California.  All rights reserved.\n";
     38      1.1  cgd #endif /* not lint */
     39      1.1  cgd 
     40      1.1  cgd #ifndef lint
     41  1.1.1.2  cgd static char sccsid[] = "@(#)snscore.c	8.1 (Berkeley) 7/19/93";
     42      1.1  cgd #endif /* not lint */
     43      1.1  cgd 
     44      1.1  cgd #include <sys/types.h>
     45      1.1  cgd #include <pwd.h>
     46      1.1  cgd #include <stdio.h>
     47      1.1  cgd #include <stdlib.h>
     48      1.1  cgd #include "pathnames.h"
     49      1.1  cgd 
     50      1.1  cgd char *recfile = _PATH_RAWSCORES;
     51      1.1  cgd #define MAXPLAYERS 256
     52      1.1  cgd 
     53      1.1  cgd struct	player	{
     54      1.1  cgd 	short	uids;
     55      1.1  cgd 	short	scores;
     56      1.1  cgd 	char	*name;
     57      1.1  cgd } players[MAXPLAYERS], temp;
     58      1.1  cgd 
     59  1.1.1.2  cgd int
     60      1.1  cgd main()
     61      1.1  cgd {
     62      1.1  cgd 	short	uid, score;
     63      1.1  cgd 	FILE	*fd;
     64      1.1  cgd 	int	noplayers;
     65      1.1  cgd 	int	i, j, notsorted;
     66      1.1  cgd 	short	whoallbest, allbest;
     67      1.1  cgd 	char	*q;
     68      1.1  cgd 	struct	passwd	*p;
     69      1.1  cgd 
     70      1.1  cgd 	fd = fopen(recfile, "r");
     71      1.1  cgd 	if (fd == NULL) {
     72      1.1  cgd 		perror(recfile);
     73      1.1  cgd 		exit(1);
     74      1.1  cgd 	}
     75      1.1  cgd 	printf("Snake players scores to date\n");
     76      1.1  cgd 	fread(&whoallbest, sizeof(short), 1, fd);
     77      1.1  cgd 	fread(&allbest, sizeof(short), 1, fd);
     78  1.1.1.2  cgd 	noplayers = 0;
     79  1.1.1.2  cgd 	for (uid = 2; ;uid++) {
     80      1.1  cgd 		if(fread(&score, sizeof(short), 1, fd) == 0)
     81      1.1  cgd 			break;
     82      1.1  cgd 		if (score > 0) {
     83      1.1  cgd 			if (noplayers > MAXPLAYERS) {
     84      1.1  cgd 				printf("too many players\n");
     85      1.1  cgd 				exit(2);
     86      1.1  cgd 			}
     87      1.1  cgd 			players[noplayers].uids = uid;
     88      1.1  cgd 			players[noplayers].scores = score;
     89      1.1  cgd 			p = getpwuid(uid);
     90      1.1  cgd 			if (p == NULL)
     91      1.1  cgd 				continue;
     92      1.1  cgd 			q = p -> pw_name;
     93  1.1.1.2  cgd 			players[noplayers].name = malloc(strlen(q) + 1);
     94      1.1  cgd 			strcpy(players[noplayers].name, q);
     95      1.1  cgd 			noplayers++;
     96      1.1  cgd 		}
     97      1.1  cgd 	}
     98      1.1  cgd 
     99      1.1  cgd 	/* bubble sort scores */
    100  1.1.1.2  cgd 	for (notsorted = 1; notsorted; ) {
    101      1.1  cgd 		notsorted = 0;
    102  1.1.1.2  cgd 		for (i = 0; i < noplayers - 1; i++)
    103  1.1.1.2  cgd 			if (players[i].scores < players[i + 1].scores) {
    104      1.1  cgd 				temp = players[i];
    105  1.1.1.2  cgd 				players[i] = players[i + 1];
    106  1.1.1.2  cgd 				players[i + 1] = temp;
    107      1.1  cgd 				notsorted++;
    108      1.1  cgd 			}
    109      1.1  cgd 	}
    110      1.1  cgd 
    111      1.1  cgd 	j = 1;
    112  1.1.1.2  cgd 	for (i = 0; i < noplayers; i++) {
    113      1.1  cgd 		printf("%d:\t$%d\t%s\n", j, players[i].scores, players[i].name);
    114  1.1.1.2  cgd 		if (players[i].scores > players[i + 1].scores)
    115  1.1.1.2  cgd 			j = i + 2;
    116      1.1  cgd 	}
    117      1.1  cgd 	exit(0);
    118      1.1  cgd }
    119