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