]> git.cameronkatri.com Git - bsdgames-darwin.git/blob - snake/snscore/snscore.c
BS was using obsolete 'bs' and 'bc' capabilities. Now tries 'le' first.
[bsdgames-darwin.git] / snake / snscore / snscore.c
1 /* $NetBSD: snscore.c,v 1.5 1995/04/24 12:25:43 cgd 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 #ifndef lint
37 static char copyright[] =
38 "@(#) 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 static char rcsid[] = "$NetBSD: snscore.c,v 1.5 1995/04/24 12:25:43 cgd Exp $";
47 #endif
48 #endif /* not lint */
49
50 #include <sys/types.h>
51 #include <pwd.h>
52 #include <stdio.h>
53 #include <stdlib.h>
54 #include <string.h>
55 #include "pathnames.h"
56
57 char *recfile = _PATH_RAWSCORES;
58 #define MAXPLAYERS 256
59
60 struct player {
61 short uids;
62 short scores;
63 char *name;
64 } players[MAXPLAYERS], temp;
65
66 int
67 main()
68 {
69 short uid, score;
70 FILE *fd;
71 int noplayers;
72 int i, j, notsorted;
73 short whoallbest, allbest;
74 char *q;
75 struct passwd *p;
76
77 fd = fopen(recfile, "r");
78 if (fd == NULL) {
79 perror(recfile);
80 exit(1);
81 }
82 printf("Snake players scores to date\n");
83 fread(&whoallbest, sizeof(short), 1, fd);
84 fread(&allbest, sizeof(short), 1, fd);
85 noplayers = 0;
86 for (uid = 2; ;uid++) {
87 if(fread(&score, sizeof(short), 1, fd) == 0)
88 break;
89 if (score > 0) {
90 if (noplayers > MAXPLAYERS) {
91 printf("too many players\n");
92 exit(2);
93 }
94 players[noplayers].uids = uid;
95 players[noplayers].scores = score;
96 p = getpwuid(uid);
97 if (p == NULL)
98 continue;
99 q = p -> pw_name;
100 players[noplayers].name = malloc(strlen(q) + 1);
101 strcpy(players[noplayers].name, q);
102 noplayers++;
103 }
104 }
105
106 /* bubble sort scores */
107 for (notsorted = 1; notsorted; ) {
108 notsorted = 0;
109 for (i = 0; i < noplayers - 1; i++)
110 if (players[i].scores < players[i + 1].scores) {
111 temp = players[i];
112 players[i] = players[i + 1];
113 players[i + 1] = temp;
114 notsorted++;
115 }
116 }
117
118 j = 1;
119 for (i = 0; i < noplayers; i++) {
120 printf("%d:\t$%d\t%s\n", j, players[i].scores, players[i].name);
121 if (players[i].scores > players[i + 1].scores)
122 j = i + 2;
123 }
124 exit(0);
125 }