Home | History | Annotate | Line # | Download | only in snscore
snscore.c revision 1.5
      1  1.5  cgd /*	$NetBSD: snscore.c,v 1.5 1995/04/24 12:25:43 cgd 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.1  cgd  * 3. All advertising materials mentioning features or use of this software
     16  1.1  cgd  *    must display the following acknowledgement:
     17  1.1  cgd  *	This product includes software developed by the University of
     18  1.1  cgd  *	California, Berkeley and its contributors.
     19  1.1  cgd  * 4. Neither the name of the University nor the names of its contributors
     20  1.1  cgd  *    may be used to endorse or promote products derived from this software
     21  1.1  cgd  *    without specific prior written permission.
     22  1.1  cgd  *
     23  1.1  cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     24  1.1  cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     25  1.1  cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     26  1.1  cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     27  1.1  cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     28  1.1  cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     29  1.1  cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     30  1.1  cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     31  1.1  cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     32  1.1  cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     33  1.1  cgd  * SUCH DAMAGE.
     34  1.1  cgd  */
     35  1.1  cgd 
     36  1.1  cgd #ifndef lint
     37  1.4  cgd static char copyright[] =
     38  1.4  cgd "@(#) Copyright (c) 1980, 1993\n\
     39  1.4  cgd 	The Regents of the University of California.  All rights reserved.\n";
     40  1.1  cgd #endif /* not lint */
     41  1.1  cgd 
     42  1.1  cgd #ifndef lint
     43  1.4  cgd #if 0
     44  1.4  cgd static char sccsid[] = "@(#)snscore.c	8.1 (Berkeley) 7/19/93";
     45  1.4  cgd #else
     46  1.5  cgd static char rcsid[] = "$NetBSD: snscore.c,v 1.5 1995/04/24 12:25:43 cgd Exp $";
     47  1.4  cgd #endif
     48  1.1  cgd #endif /* not lint */
     49  1.1  cgd 
     50  1.1  cgd #include <sys/types.h>
     51  1.1  cgd #include <pwd.h>
     52  1.1  cgd #include <stdio.h>
     53  1.1  cgd #include <stdlib.h>
     54  1.5  cgd #include <string.h>
     55  1.1  cgd #include "pathnames.h"
     56  1.1  cgd 
     57  1.1  cgd char *recfile = _PATH_RAWSCORES;
     58  1.1  cgd #define MAXPLAYERS 256
     59  1.1  cgd 
     60  1.1  cgd struct	player	{
     61  1.1  cgd 	short	uids;
     62  1.1  cgd 	short	scores;
     63  1.1  cgd 	char	*name;
     64  1.1  cgd } players[MAXPLAYERS], temp;
     65  1.1  cgd 
     66  1.4  cgd int
     67  1.1  cgd 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.1  cgd 	char	*q;
     75  1.1  cgd 	struct	passwd	*p;
     76  1.1  cgd 
     77  1.1  cgd 	fd = fopen(recfile, "r");
     78  1.1  cgd 	if (fd == NULL) {
     79  1.1  cgd 		perror(recfile);
     80  1.1  cgd 		exit(1);
     81  1.1  cgd 	}
     82  1.1  cgd 	printf("Snake players scores to date\n");
     83  1.1  cgd 	fread(&whoallbest, sizeof(short), 1, fd);
     84  1.1  cgd 	fread(&allbest, sizeof(short), 1, fd);
     85  1.3  cgd 	noplayers = 0;
     86  1.4  cgd 	for (uid = 2; ;uid++) {
     87  1.1  cgd 		if(fread(&score, sizeof(short), 1, fd) == 0)
     88  1.1  cgd 			break;
     89  1.1  cgd 		if (score > 0) {
     90  1.1  cgd 			if (noplayers > MAXPLAYERS) {
     91  1.1  cgd 				printf("too many players\n");
     92  1.1  cgd 				exit(2);
     93  1.1  cgd 			}
     94  1.1  cgd 			players[noplayers].uids = uid;
     95  1.1  cgd 			players[noplayers].scores = score;
     96  1.1  cgd 			p = getpwuid(uid);
     97  1.1  cgd 			if (p == NULL)
     98  1.1  cgd 				continue;
     99  1.1  cgd 			q = p -> pw_name;
    100  1.4  cgd 			players[noplayers].name = malloc(strlen(q) + 1);
    101  1.1  cgd 			strcpy(players[noplayers].name, q);
    102  1.1  cgd 			noplayers++;
    103  1.1  cgd 		}
    104  1.1  cgd 	}
    105  1.1  cgd 
    106  1.1  cgd 	/* bubble sort scores */
    107  1.4  cgd 	for (notsorted = 1; notsorted; ) {
    108  1.1  cgd 		notsorted = 0;
    109  1.4  cgd 		for (i = 0; i < noplayers - 1; i++)
    110  1.4  cgd 			if (players[i].scores < players[i + 1].scores) {
    111  1.1  cgd 				temp = players[i];
    112  1.4  cgd 				players[i] = players[i + 1];
    113  1.4  cgd 				players[i + 1] = temp;
    114  1.1  cgd 				notsorted++;
    115  1.1  cgd 			}
    116  1.1  cgd 	}
    117  1.1  cgd 
    118  1.1  cgd 	j = 1;
    119  1.4  cgd 	for (i = 0; i < noplayers; i++) {
    120  1.1  cgd 		printf("%d:\t$%d\t%s\n", j, players[i].scores, players[i].name);
    121  1.4  cgd 		if (players[i].scores > players[i + 1].scores)
    122  1.4  cgd 			j = i + 2;
    123  1.1  cgd 	}
    124  1.1  cgd 	exit(0);
    125  1.1  cgd }
    126