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