taskqueue - Major overhaul
[dragonfly.git] / games / snake / snscore / snscore.c
blob66fbf298b0ab5659d5f336cb47acc6c79fa99c1b
1 /*
2 * Copyright (c) 1980, 1993
3 * The Regents of the University of California. All rights reserved.
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.
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.
33 * @(#) Copyright (c) 1980, 1993 The Regents of the University of California. All rights reserved.
34 * @(#)snscore.c 8.1 (Berkeley) 7/19/93
35 * $FreeBSD: src/games/snake/snscore/snscore.c,v 1.5 1999/11/30 03:49:42 billf Exp $
36 * $DragonFly: src/games/snake/snscore/snscore.c,v 1.4 2006/09/03 23:47:56 pavalos Exp $
39 #include <sys/types.h>
40 #include <err.h>
41 #include <pwd.h>
42 #include <stdio.h>
43 #include <stdlib.h>
44 #include <string.h>
45 #include <unistd.h>
46 #include "pathnames.h"
48 const char *recfile = _PATH_RAWSCORES;
49 #define MAXPLAYERS 256
51 struct player {
52 short uids;
53 short scores;
54 char *name;
55 } players[MAXPLAYERS], temp;
57 int
58 main(void)
60 short uid, score;
61 FILE *fd;
62 int noplayers;
63 int i, j, notsorted;
64 short whoallbest, allbest;
65 const char *q;
66 struct passwd *p;
68 /* Revoke setgid privileges */
69 setgid(getgid());
71 fd = fopen(recfile, "r");
72 if (fd == NULL)
73 err(1, "opening `%s'", recfile);
74 printf("Snake players scores to date\n");
75 if (fread(&whoallbest, sizeof(short), 1, fd) == 0) {
76 printf("No scores recorded yet!\n");
77 exit(0);
79 fread(&allbest, sizeof(short), 1, fd);
80 noplayers = 0;
81 for (uid = 2; ;uid++) {
82 if(fread(&score, sizeof(short), 1, fd) == 0)
83 break;
84 if (score > 0) {
85 if (noplayers >= MAXPLAYERS) {
86 printf("too many players\n");
87 exit(2);
89 players[noplayers].uids = uid;
90 players[noplayers].scores = score;
91 p = getpwuid(uid);
92 if (p == NULL)
93 continue;
94 q = p -> pw_name;
95 players[noplayers].name = strdup(q);
96 if (players[noplayers].name == NULL)
97 err(1, NULL);
98 noplayers++;
102 /* bubble sort scores */
103 for (notsorted = 1; notsorted; ) {
104 notsorted = 0;
105 for (i = 0; i < noplayers - 1; i++)
106 if (players[i].scores < players[i + 1].scores) {
107 temp = players[i];
108 players[i] = players[i + 1];
109 players[i + 1] = temp;
110 notsorted++;
114 j = 1;
115 for (i = 0; i < noplayers; i++) {
116 printf("%d:\t$%d\t%s\n", j, players[i].scores, players[i].name);
117 if (players[i].scores > players[i + 1].scores)
118 j = i + 2;
120 exit(0);