log.c revision 1.16 1 1.15 rpaulo /* $NetBSD: log.c,v 1.16 2005/08/10 17:53:28 rpaulo Exp $ */
2 1.3 cgd
3 1.1 cgd /*-
4 1.3 cgd * Copyright (c) 1990, 1993
5 1.3 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * This code is derived from software contributed to Berkeley by
8 1.1 cgd * Ed James.
9 1.1 cgd *
10 1.1 cgd * Redistribution and use in source and binary forms, with or without
11 1.1 cgd * modification, are permitted provided that the following conditions
12 1.1 cgd * are met:
13 1.1 cgd * 1. Redistributions of source code must retain the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer.
15 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 cgd * notice, this list of conditions and the following disclaimer in the
17 1.1 cgd * documentation and/or other materials provided with the distribution.
18 1.12 agc * 3. Neither the name of the University nor the names of its contributors
19 1.1 cgd * may be used to endorse or promote products derived from this software
20 1.1 cgd * without specific prior written permission.
21 1.1 cgd *
22 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 1.1 cgd * SUCH DAMAGE.
33 1.1 cgd */
34 1.1 cgd
35 1.1 cgd /*
36 1.1 cgd * Copyright (c) 1987 by Ed James, UC Berkeley. All rights reserved.
37 1.1 cgd *
38 1.1 cgd * Copy permission is hereby granted provided that this notice is
39 1.1 cgd * retained on all partial or complete copies.
40 1.1 cgd *
41 1.1 cgd * For more info on this and all of my stuff, mail edjames (at) berkeley.edu.
42 1.1 cgd */
43 1.1 cgd
44 1.5 lukem #include <sys/cdefs.h>
45 1.1 cgd #ifndef lint
46 1.3 cgd #if 0
47 1.3 cgd static char sccsid[] = "@(#)log.c 8.1 (Berkeley) 5/31/93";
48 1.3 cgd #else
49 1.15 rpaulo __RCSID("$NetBSD: log.c,v 1.16 2005/08/10 17:53:28 rpaulo Exp $");
50 1.3 cgd #endif
51 1.11 cgd #endif /* not lint */
52 1.1 cgd
53 1.1 cgd #include "include.h"
54 1.1 cgd #include "pathnames.h"
55 1.1 cgd
56 1.9 hubertf static FILE *score_fp;
57 1.9 hubertf
58 1.5 lukem int
59 1.14 jmc compar(const void *va, const void *vb)
60 1.5 lukem {
61 1.8 hubertf const SCORE *a, *b;
62 1.5 lukem
63 1.8 hubertf a = (const SCORE *)va;
64 1.8 hubertf b = (const SCORE *)vb;
65 1.1 cgd if (b->planes == a->planes)
66 1.1 cgd return (b->time - a->time);
67 1.1 cgd else
68 1.1 cgd return (b->planes - a->planes);
69 1.1 cgd }
70 1.1 cgd
71 1.1 cgd #define SECAMIN 60
72 1.1 cgd #define MINAHOUR 60
73 1.1 cgd #define HOURADAY 24
74 1.1 cgd #define SECAHOUR (SECAMIN * MINAHOUR)
75 1.1 cgd #define SECADAY (SECAHOUR * HOURADAY)
76 1.1 cgd #define DAY(t) ((t) / SECADAY)
77 1.1 cgd #define HOUR(t) (((t) % SECADAY) / SECAHOUR)
78 1.1 cgd #define MIN(t) (((t) % SECAHOUR) / SECAMIN)
79 1.1 cgd #define SEC(t) ((t) % SECAMIN)
80 1.1 cgd
81 1.14 jmc const char *
82 1.14 jmc timestr(int t)
83 1.1 cgd {
84 1.1 cgd static char s[80];
85 1.1 cgd
86 1.1 cgd if (DAY(t) > 0)
87 1.1 cgd (void)sprintf(s, "%dd+%02dhrs", DAY(t), HOUR(t));
88 1.1 cgd else if (HOUR(t) > 0)
89 1.1 cgd (void)sprintf(s, "%d:%02d:%02d", HOUR(t), MIN(t), SEC(t));
90 1.1 cgd else if (MIN(t) > 0)
91 1.1 cgd (void)sprintf(s, "%d:%02d", MIN(t), SEC(t));
92 1.1 cgd else if (SEC(t) > 0)
93 1.1 cgd (void)sprintf(s, ":%02d", SEC(t));
94 1.1 cgd else
95 1.1 cgd *s = '\0';
96 1.1 cgd
97 1.1 cgd return (s);
98 1.1 cgd }
99 1.1 cgd
100 1.9 hubertf void
101 1.14 jmc open_score_file(void)
102 1.9 hubertf {
103 1.9 hubertf mode_t old_mask;
104 1.9 hubertf int score_fd;
105 1.9 hubertf int flags;
106 1.9 hubertf
107 1.9 hubertf old_mask = umask(0);
108 1.9 hubertf score_fd = open(_PATH_SCORE, O_CREAT|O_RDWR, 0664);
109 1.16 rpaulo (void)umask(old_mask);
110 1.9 hubertf if (score_fd < 0) {
111 1.9 hubertf warn("open %s", _PATH_SCORE);
112 1.9 hubertf return;
113 1.9 hubertf }
114 1.9 hubertf if (score_fd < 3)
115 1.9 hubertf exit(1);
116 1.9 hubertf /* Set the close-on-exec flag. If this fails for any reason, quit
117 1.9 hubertf * rather than leave the score file open to tampering. */
118 1.9 hubertf flags = fcntl(score_fd, F_GETFD);
119 1.9 hubertf if (flags < 0)
120 1.9 hubertf err(1, "fcntl F_GETFD");
121 1.9 hubertf flags |= FD_CLOEXEC;
122 1.9 hubertf if (fcntl(score_fd, F_SETFD, flags) == -1)
123 1.9 hubertf err(1, "fcntl F_SETFD");
124 1.9 hubertf /*
125 1.9 hubertf * This is done to take advantage of stdio, while still
126 1.9 hubertf * allowing a O_CREAT during the open(2) of the log file.
127 1.9 hubertf */
128 1.9 hubertf score_fp = fdopen(score_fd, "r+");
129 1.9 hubertf if (score_fp == NULL) {
130 1.9 hubertf warn("fdopen %s", _PATH_SCORE);
131 1.9 hubertf return;
132 1.9 hubertf }
133 1.9 hubertf }
134 1.9 hubertf
135 1.5 lukem int
136 1.14 jmc log_score(int list_em)
137 1.1 cgd {
138 1.9 hubertf int i, num_scores = 0, good, changed = 0, found = 0;
139 1.1 cgd struct passwd *pw;
140 1.5 lukem char *cp;
141 1.1 cgd SCORE score[100], thisscore;
142 1.14 jmc struct utsname lname;
143 1.9 hubertf long offset;
144 1.1 cgd
145 1.9 hubertf if (score_fp == NULL) {
146 1.9 hubertf warnx("no score file available");
147 1.1 cgd return (-1);
148 1.1 cgd }
149 1.9 hubertf
150 1.1 cgd #ifdef BSD
151 1.9 hubertf if (flock(fileno(score_fp), LOCK_EX) < 0)
152 1.1 cgd #endif
153 1.1 cgd #ifdef SYSV
154 1.9 hubertf while (lockf(fileno(score_fp), F_LOCK, 1) < 0)
155 1.1 cgd #endif
156 1.1 cgd {
157 1.6 lukem warn("flock %s", _PATH_SCORE);
158 1.1 cgd return (-1);
159 1.1 cgd }
160 1.1 cgd for (;;) {
161 1.9 hubertf good = fscanf(score_fp, SCORE_SCANF_FMT,
162 1.16 rpaulo score[num_scores].name,
163 1.16 rpaulo score[num_scores].host,
164 1.16 rpaulo score[num_scores].game,
165 1.16 rpaulo &score[num_scores].planes,
166 1.16 rpaulo &score[num_scores].time,
167 1.16 rpaulo &score[num_scores].real_time);
168 1.1 cgd if (good != 6 || ++num_scores >= NUM_SCORES)
169 1.1 cgd break;
170 1.1 cgd }
171 1.1 cgd if (!test_mode && !list_em) {
172 1.1 cgd if ((pw = (struct passwd *) getpwuid(getuid())) == NULL) {
173 1.16 rpaulo (void)fprintf(stderr,
174 1.1 cgd "getpwuid failed for uid %d. Who are you?\n",
175 1.9 hubertf (int)getuid());
176 1.1 cgd return (-1);
177 1.1 cgd }
178 1.16 rpaulo (void)strcpy(thisscore.name, pw->pw_name);
179 1.16 rpaulo (void)uname(&lname);
180 1.16 rpaulo (void)strlcpy(thisscore.host, lname.nodename,
181 1.16 rpaulo sizeof(thisscore.host));
182 1.1 cgd
183 1.14 jmc cp = strrchr(filename, '/');
184 1.1 cgd if (cp == NULL) {
185 1.16 rpaulo (void)fprintf(stderr, "log: where's the '/' in %s?\n",
186 1.14 jmc filename);
187 1.1 cgd return (-1);
188 1.1 cgd }
189 1.1 cgd cp++;
190 1.16 rpaulo (void)strcpy(thisscore.game, cp);
191 1.1 cgd
192 1.1 cgd thisscore.time = clck;
193 1.1 cgd thisscore.planes = safe_planes;
194 1.1 cgd thisscore.real_time = time(0) - start_time;
195 1.1 cgd
196 1.1 cgd for (i = 0; i < num_scores; i++) {
197 1.1 cgd if (strcmp(thisscore.name, score[i].name) == 0 &&
198 1.1 cgd strcmp(thisscore.host, score[i].host) == 0 &&
199 1.1 cgd strcmp(thisscore.game, score[i].game) == 0) {
200 1.1 cgd if (thisscore.time > score[i].time) {
201 1.1 cgd score[i].time = thisscore.time;
202 1.1 cgd score[i].planes = thisscore.planes;
203 1.1 cgd score[i].real_time =
204 1.16 rpaulo thisscore.real_time;
205 1.1 cgd changed++;
206 1.1 cgd }
207 1.1 cgd found++;
208 1.1 cgd break;
209 1.1 cgd }
210 1.1 cgd }
211 1.1 cgd if (!found) {
212 1.1 cgd for (i = 0; i < num_scores; i++) {
213 1.1 cgd if (thisscore.time > score[i].time) {
214 1.1 cgd if (num_scores < NUM_SCORES)
215 1.1 cgd num_scores++;
216 1.16 rpaulo (void)memcpy(&score[num_scores - 1],
217 1.16 rpaulo &score[i], sizeof (score[i]));
218 1.16 rpaulo (void)memcpy(&score[i], &thisscore,
219 1.16 rpaulo sizeof (score[i]));
220 1.1 cgd changed++;
221 1.1 cgd break;
222 1.1 cgd }
223 1.1 cgd }
224 1.1 cgd }
225 1.1 cgd if (!found && !changed && num_scores < NUM_SCORES) {
226 1.16 rpaulo (void)memcpy(&score[num_scores], &thisscore,
227 1.16 rpaulo sizeof (score[num_scores]));
228 1.1 cgd num_scores++;
229 1.1 cgd changed++;
230 1.1 cgd }
231 1.1 cgd
232 1.1 cgd if (changed) {
233 1.1 cgd if (found)
234 1.16 rpaulo (void)puts("You beat your previous score!");
235 1.1 cgd else
236 1.16 rpaulo (void)puts("You made the top players list!");
237 1.16 rpaulo qsort(score, (size_t)num_scores, sizeof (*score),
238 1.16 rpaulo compar);
239 1.9 hubertf rewind(score_fp);
240 1.1 cgd for (i = 0; i < num_scores; i++)
241 1.16 rpaulo (void)fprintf(score_fp, "%s %s %s %d %d %d\n",
242 1.16 rpaulo score[i].name, score[i].host,
243 1.16 rpaulo score[i].game, score[i].planes,
244 1.16 rpaulo score[i].time, score[i].real_time);
245 1.16 rpaulo (void)fflush(score_fp);
246 1.9 hubertf if (ferror(score_fp))
247 1.9 hubertf warn("error writing %s", _PATH_SCORE);
248 1.9 hubertf /* It is just possible that updating an entry could
249 1.9 hubertf * have reduced the length of the file, so we
250 1.9 hubertf * truncate it. The seeks are required for stream/fd
251 1.9 hubertf * synchronisation by POSIX.1. */
252 1.9 hubertf offset = ftell(score_fp);
253 1.16 rpaulo (void)lseek(fileno(score_fp), (off_t)0, SEEK_SET);
254 1.16 rpaulo (void)ftruncate(fileno(score_fp), (off_t)offset);
255 1.9 hubertf rewind(score_fp);
256 1.1 cgd } else {
257 1.1 cgd if (found)
258 1.16 rpaulo (void)puts(
259 1.16 rpaulo "You didn't beat your previous score.");
260 1.1 cgd else
261 1.16 rpaulo (void)puts(
262 1.16 rpaulo "You didn't make the top players list.");
263 1.1 cgd }
264 1.16 rpaulo (void)putchar('\n');
265 1.1 cgd }
266 1.1 cgd #ifdef BSD
267 1.16 rpaulo (void)flock(fileno(score_fp), LOCK_UN);
268 1.1 cgd #endif
269 1.1 cgd #ifdef SYSV
270 1.1 cgd /* lock will evaporate upon close */
271 1.1 cgd #endif
272 1.16 rpaulo (void)fclose(score_fp);
273 1.16 rpaulo (void)printf("%2s: %-8s %-8s %-18s %4s %9s %4s\n", "#", "name",
274 1.16 rpaulo "host", "game", "time", "real time", "planes safe");
275 1.15 rpaulo (void)printf("-------------------------------------------------------");
276 1.15 rpaulo (void)printf("------------------------\n");
277 1.1 cgd for (i = 0; i < num_scores; i++) {
278 1.5 lukem cp = strchr(score[i].host, '.');
279 1.1 cgd if (cp != NULL)
280 1.1 cgd *cp = '\0';
281 1.16 rpaulo (void)printf("%2d: %-8s %-8s %-18s %4d %9s %4d\n", i + 1,
282 1.16 rpaulo score[i].name, score[i].host, score[i].game,
283 1.16 rpaulo score[i].time, timestr(score[i].real_time),
284 1.16 rpaulo score[i].planes);
285 1.1 cgd }
286 1.16 rpaulo (void)putchar('\n');
287 1.1 cgd return (0);
288 1.5 lukem }
289 1.5 lukem
290 1.16 rpaulo /* ARGSUSED */
291 1.5 lukem void
292 1.14 jmc log_score_quit(int dummy __attribute__((__unused__)))
293 1.5 lukem {
294 1.5 lukem (void)log_score(0);
295 1.5 lukem exit(0);
296 1.1 cgd }
297