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