xref: /dragonfly/games/snake/snscore/snscore.c (revision ec21d9fb)
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. Neither the name of the University nor the names of its contributors
14  *    may be used to endorse or promote products derived from this software
15  *    without specific prior written permission.
16  *
17  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27  * SUCH DAMAGE.
28  *
29  * @(#) Copyright (c) 1980, 1993 The Regents of the University of California.  All rights reserved.
30  * @(#)snscore.c	8.1 (Berkeley) 7/19/93
31  * $FreeBSD: src/games/snake/snscore/snscore.c,v 1.5 1999/11/30 03:49:42 billf Exp $
32  * $DragonFly: src/games/snake/snscore/snscore.c,v 1.4 2006/09/03 23:47:56 pavalos Exp $
33  */
34 
35 #include <sys/types.h>
36 #include <err.h>
37 #include <pwd.h>
38 #include <stdio.h>
39 #include <stdlib.h>
40 #include <string.h>
41 #include <unistd.h>
42 #include "pathnames.h"
43 
44 const char *recfile = _PATH_RAWSCORES;
45 #define MAXPLAYERS 256
46 
47 struct	player	{
48 	short	uids;
49 	short	scores;
50 	char	*name;
51 };
52 
53 struct player players[MAXPLAYERS], temp;
54 
55 int
56 main(int argc __unused, char *argv[] __unused)
57 {
58 	short	uid, score;
59 	FILE	*fd;
60 	int	noplayers;
61 	int	i, j, notsorted;
62 	short	whoallbest, allbest;
63 	const	char *q;
64 	struct	passwd	*p;
65 
66 	/* Revoke setgid privileges */
67 	setgid(getgid());
68 
69 	fd = fopen(recfile, "r");
70 	if (fd == NULL)
71 		err(1, "opening `%s'", recfile);
72 	printf("Snake players scores to date\n");
73 	if (fread(&whoallbest, sizeof(short), 1, fd) == 0) {
74 		printf("No scores recorded yet!\n");
75 		exit(0);
76 	}
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 = strdup(q);
94 			if (players[noplayers].name == NULL)
95 				err(1, NULL);
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