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
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.
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
29 * @(#)score.c 8.1 (Berkeley) 5/31/93
30 * $FreeBSD: src/games/robots/score.c,v 1.5 1999/11/30 03:49:20 billf Exp $
31 * $DragonFly: src/games/robots/score.c,v 1.4 2008/08/23 23:23:37 swildner Exp $
36 #include <sys/types.h>
38 #include "pathnames.h"
46 const char *Scorefile = _PATH_SCORE;
48 int Max_per_uid = MAX_PER_UID;
50 static SCORE Top[MAXSCORES];
52 static int cmp_sc(const void *, const void *);
53 static void set_name(SCORE *);
57 * Post the player's score, if reasonable, and then print out the
66 bool done_show = false;
67 static int numscores, max_uid;
70 if ((inf = open(Scorefile, O_RDWR)) < 0) {
75 if (read(inf, &max_uid, sizeof max_uid) == sizeof max_uid)
76 read(inf, Top, sizeof Top);
78 for (scp = Top; scp < &Top[MAXSCORES]; scp++)
80 max_uid = Max_per_uid;
84 if (Top[MAXSCORES-1].s_score <= Score) {
86 for (scp = Top; scp < &Top[MAXSCORES]; scp++)
87 if (scp->s_score < 0 ||
88 (scp->s_uid == uid && ++numscores == max_uid)) {
89 if (scp->s_score > Score)
97 if (scp == &Top[MAXSCORES]) {
98 Top[MAXSCORES-1].s_score = Score;
99 Top[MAXSCORES-1].s_uid = uid;
100 set_name(&Top[MAXSCORES-1]);
104 qsort(Top, MAXSCORES, sizeof Top[0], cmp_sc);
115 for (scp = Top; scp < &Top[MAXSCORES]; scp++) {
116 if (scp->s_score < 0)
118 move((scp - Top) + 1, 15);
119 if (!done_show && scp->s_uid == uid && scp->s_score == Score)
121 printw(" %d\t%d\t%-8.8s ", (scp - Top) + 1, scp->s_score, scp->s_name);
122 if (!done_show && scp->s_uid == uid && scp->s_score == Score) {
127 Num_scores = scp - Top;
131 lseek(inf, 0L, SEEK_SET);
132 write(inf, &max_uid, sizeof max_uid);
133 write(inf, Top, sizeof Top);
143 if ((pp = getpwuid(scp->s_uid)) == NULL)
144 strncpy(scp->s_name, "???", MAXNAME);
146 strncpy(scp->s_name, pp->pw_name, MAXNAME);
151 * Compare two scores.
154 cmp_sc(const void *s1, const void *s2)
156 return (((const SCORE *)s2)->s_score - ((const SCORE *)s1)->s_score);
161 * Show the score list for the '-s' option.
168 static int max_score;
170 if ((inf = open(Scorefile, O_RDONLY)) < 0) {
175 for (scp = Top; scp < &Top[MAXSCORES]; scp++)
178 read(inf, &max_score, sizeof max_score);
179 read(inf, Top, sizeof Top);
182 for (scp = Top; scp < &Top[MAXSCORES]; scp++)
183 if (scp->s_score >= 0)
184 printf("%d\t%d\t%.*s\n", inf++, scp->s_score,
185 (int)sizeof(scp->s_name), scp->s_name);