score.c revision 1.4 1 1.4 lukem /* $NetBSD: score.c,v 1.4 1997/10/12 14:10:05 lukem Exp $ */
2 1.3 cgd
3 1.1 cgd /*
4 1.3 cgd * Copyright (c) 1980, 1993
5 1.3 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by the University of
18 1.1 cgd * California, Berkeley and its contributors.
19 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
20 1.1 cgd * may be used to endorse or promote products derived from this software
21 1.1 cgd * without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 cgd * SUCH DAMAGE.
34 1.1 cgd */
35 1.1 cgd
36 1.4 lukem #include <sys/cdefs.h>
37 1.1 cgd #ifndef lint
38 1.3 cgd #if 0
39 1.3 cgd static char sccsid[] = "@(#)score.c 8.1 (Berkeley) 5/31/93";
40 1.3 cgd #else
41 1.4 lukem __RCSID("$NetBSD: score.c,v 1.4 1997/10/12 14:10:05 lukem Exp $");
42 1.3 cgd #endif
43 1.1 cgd #endif /* not lint */
44 1.1 cgd
45 1.1 cgd # include "robots.h"
46 1.1 cgd # include "pathnames.h"
47 1.1 cgd
48 1.1 cgd char *Scorefile = _PATH_SCORE;
49 1.1 cgd
50 1.1 cgd int Max_per_uid = MAX_PER_UID;
51 1.1 cgd
52 1.1 cgd static SCORE Top[MAXSCORES];
53 1.1 cgd
54 1.1 cgd /*
55 1.1 cgd * score:
56 1.1 cgd * Post the player's score, if reasonable, and then print out the
57 1.1 cgd * top list.
58 1.1 cgd */
59 1.4 lukem void
60 1.1 cgd score()
61 1.1 cgd {
62 1.4 lukem int inf;
63 1.4 lukem SCORE *scp;
64 1.4 lukem int uid;
65 1.4 lukem bool done_show = FALSE;
66 1.1 cgd static int numscores, max_uid;
67 1.1 cgd
68 1.1 cgd Newscore = FALSE;
69 1.1 cgd if ((inf = open(Scorefile, 2)) < 0) {
70 1.1 cgd perror(Scorefile);
71 1.1 cgd return;
72 1.1 cgd }
73 1.1 cgd
74 1.1 cgd if (read(inf, &max_uid, sizeof max_uid) == sizeof max_uid)
75 1.1 cgd read(inf, Top, sizeof Top);
76 1.1 cgd else {
77 1.1 cgd for (scp = Top; scp < &Top[MAXSCORES]; scp++)
78 1.1 cgd scp->s_score = -1;
79 1.1 cgd max_uid = Max_per_uid;
80 1.1 cgd }
81 1.1 cgd
82 1.1 cgd uid = getuid();
83 1.1 cgd if (Top[MAXSCORES-1].s_score <= Score) {
84 1.1 cgd numscores = 0;
85 1.1 cgd for (scp = Top; scp < &Top[MAXSCORES]; scp++)
86 1.1 cgd if (scp->s_score < 0 ||
87 1.1 cgd (scp->s_uid == uid && ++numscores == max_uid)) {
88 1.1 cgd if (scp->s_score > Score)
89 1.1 cgd break;
90 1.1 cgd scp->s_score = Score;
91 1.1 cgd scp->s_uid = uid;
92 1.1 cgd set_name(scp);
93 1.1 cgd Newscore = TRUE;
94 1.1 cgd break;
95 1.1 cgd }
96 1.1 cgd if (scp == &Top[MAXSCORES]) {
97 1.1 cgd Top[MAXSCORES-1].s_score = Score;
98 1.1 cgd Top[MAXSCORES-1].s_uid = uid;
99 1.1 cgd set_name(&Top[MAXSCORES-1]);
100 1.1 cgd Newscore = TRUE;
101 1.1 cgd }
102 1.1 cgd if (Newscore)
103 1.1 cgd qsort(Top, MAXSCORES, sizeof Top[0], cmp_sc);
104 1.1 cgd }
105 1.1 cgd
106 1.1 cgd if (!Newscore) {
107 1.1 cgd Full_clear = FALSE;
108 1.1 cgd close(inf);
109 1.1 cgd return;
110 1.1 cgd }
111 1.1 cgd else
112 1.1 cgd Full_clear = TRUE;
113 1.1 cgd
114 1.1 cgd for (scp = Top; scp < &Top[MAXSCORES]; scp++) {
115 1.1 cgd if (scp->s_score < 0)
116 1.1 cgd break;
117 1.1 cgd move((scp - Top) + 1, 15);
118 1.1 cgd if (!done_show && scp->s_uid == uid && scp->s_score == Score)
119 1.1 cgd standout();
120 1.1 cgd printw(" %d\t%d\t%-8.8s ", (scp - Top) + 1, scp->s_score, scp->s_name);
121 1.1 cgd if (!done_show && scp->s_uid == uid && scp->s_score == Score) {
122 1.1 cgd standend();
123 1.1 cgd done_show = TRUE;
124 1.1 cgd }
125 1.1 cgd }
126 1.1 cgd Num_scores = scp - Top;
127 1.1 cgd refresh();
128 1.1 cgd
129 1.1 cgd if (Newscore) {
130 1.1 cgd lseek(inf, 0L, 0);
131 1.1 cgd write(inf, &max_uid, sizeof max_uid);
132 1.1 cgd write(inf, Top, sizeof Top);
133 1.1 cgd }
134 1.1 cgd close(inf);
135 1.1 cgd }
136 1.1 cgd
137 1.4 lukem void
138 1.1 cgd set_name(scp)
139 1.4 lukem SCORE *scp;
140 1.1 cgd {
141 1.4 lukem PASSWD *pp;
142 1.1 cgd
143 1.1 cgd if ((pp = getpwuid(scp->s_uid)) == NULL)
144 1.1 cgd pp->pw_name = "???";
145 1.1 cgd strncpy(scp->s_name, pp->pw_name, MAXNAME);
146 1.1 cgd }
147 1.1 cgd
148 1.1 cgd /*
149 1.1 cgd * cmp_sc:
150 1.1 cgd * Compare two scores.
151 1.1 cgd */
152 1.4 lukem int
153 1.1 cgd cmp_sc(s1, s2)
154 1.4 lukem const void *s1, *s2;
155 1.1 cgd {
156 1.4 lukem return ((SCORE *)s2)->s_score - ((SCORE *)s1)->s_score;
157 1.1 cgd }
158 1.1 cgd
159 1.1 cgd /*
160 1.1 cgd * show_score:
161 1.1 cgd * Show the score list for the '-s' option.
162 1.1 cgd */
163 1.4 lukem void
164 1.1 cgd show_score()
165 1.1 cgd {
166 1.4 lukem SCORE *scp;
167 1.4 lukem int inf;
168 1.1 cgd static int max_score;
169 1.1 cgd
170 1.1 cgd if ((inf = open(Scorefile, 0)) < 0) {
171 1.1 cgd perror(Scorefile);
172 1.1 cgd return;
173 1.1 cgd }
174 1.1 cgd
175 1.1 cgd for (scp = Top; scp < &Top[MAXSCORES]; scp++)
176 1.1 cgd scp->s_score = -1;
177 1.1 cgd
178 1.1 cgd read(inf, &max_score, sizeof max_score);
179 1.1 cgd read(inf, Top, sizeof Top);
180 1.1 cgd close(inf);
181 1.1 cgd inf = 1;
182 1.1 cgd for (scp = Top; scp < &Top[MAXSCORES]; scp++)
183 1.1 cgd if (scp->s_score >= 0)
184 1.4 lukem printf("%d\t%d\t%.*s\n", inf++, scp->s_score,
185 1.4 lukem (int)(sizeof(scp->s_name)), scp->s_name);
186 1.1 cgd }
187