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