dissertation/games/atc/log.c

266 lines
7.2 KiB
C

/* $OpenBSD: log.c,v 1.25 2019/06/28 13:32:52 deraadt Exp $ */
/* $NetBSD: log.c,v 1.3 1995/03/21 15:04:21 cgd Exp $ */
/*-
* Copyright (c) 1990, 1993
* The Regents of the University of California. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Ed James.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
/*
* Copyright (c) 1987 by Ed James, UC Berkeley. All rights reserved.
*
* Copy permission is hereby granted provided that this notice is
* retained on all partial or complete copies.
*
* For more info on this and all of my stuff, mail edjames@berkeley.edu.
*/
#include <sys/stat.h>
#include <sys/types.h>
#include <err.h>
#include <errno.h>
#include <fcntl.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <unistd.h>
#include "extern.h"
#include "pathnames.h"
static FILE *score_fp;
int
compar(const void *va, const void *vb)
{
const SCORE *a, *b;
a = (const SCORE *)va;
b = (const SCORE *)vb;
if (b->planes == a->planes)
return (b->time - a->time);
else
return (b->planes - a->planes);
}
#define SECAMIN 60
#define MINAHOUR 60
#define HOURADAY 24
#define SECAHOUR (SECAMIN * MINAHOUR)
#define SECADAY (SECAHOUR * HOURADAY)
#define DAY(t) ((t) / SECADAY)
#define HOUR(t) (((t) % SECADAY) / SECAHOUR)
#define MINUTES(t) (((t) % SECAHOUR) / SECAMIN)
#define SEC(t) ((t) % SECAMIN)
const char *
timestr(int t)
{
static char s[80];
if (DAY(t) > 0)
(void)snprintf(s, sizeof s, "%dd+%02dhrs", DAY(t), HOUR(t));
else if (HOUR(t) > 0)
(void)snprintf(s, sizeof s, "%d:%02d:%02d",
HOUR(t), MINUTES(t), SEC(t));
else if (MINUTES(t) > 0)
(void)snprintf(s, sizeof s, "%d:%02d", MINUTES(t), SEC(t));
else if (SEC(t) > 0)
(void)snprintf(s, sizeof s, ":%02d", SEC(t));
else
*s = '\0';
return (s);
}
int
open_score_file(void)
{
mode_t old_mode;
char *home;
char scorefile[PATH_MAX];
int ret;
int score_fd;
home = getenv("HOME");
if (home == NULL || *home == '\0')
err(1, "getenv");
ret = snprintf(scorefile, sizeof(scorefile), "%s/%s", home,
".atc.scores");
if (ret < 0 || ret >= PATH_MAX)
errc(1, ENAMETOOLONG, "%s/%s", home, ".atc.scores");
old_mode = umask(0);
score_fd = open(scorefile, O_CREAT|O_RDWR, 0644);
if (score_fd == -1)
err(1, "open");
/*
* This is done to take advantage of stdio, while still
* allowing a O_CREAT during the open(2) of the log file.
*/
score_fp = fdopen(score_fd, "r+");
if (score_fp == NULL)
err(1, "fdopen");
umask(old_mode);
return (0);
}
int
log_score(int list_em)
{
int i, num_scores = 0, good, changed = 0, found = 0;
const char *name;
char *cp;
char scanstr[50];
SCORE score[NUM_SCORES], thisscore;
if (score_fp == NULL)
return (-1);
if (flock(fileno(score_fp), LOCK_EX) == -1)
err(1, "flock");
snprintf(scanstr, 50, "%%%zus %%%zus %%d %%d %%d", sizeof(score[0].name)-1,
sizeof(score[0].game)-1);
for (;;) {
good = fscanf(score_fp, scanstr,
score[num_scores].name,
score[num_scores].game,
&score[num_scores].planes,
&score[num_scores].time,
&score[num_scores].real_time);
if (good != 5 || ++num_scores >= NUM_SCORES)
break;
}
if (!test_mode && !list_em) {
name = getenv("LOGNAME");
if (name == NULL || *name == '\0')
name = getenv("USER");
if (name == NULL || *name == '\0')
name = getlogin();
if (name == NULL || *name == '\0')
name = " ???";
strlcpy(thisscore.name, name, sizeof(thisscore.name));
cp = strrchr(file, '/');
if (cp == NULL) {
warnx("log: where's the '/' in %s?", file);
return (-1);
}
cp++;
strlcpy(thisscore.game, cp, sizeof(thisscore.game));
thisscore.time = clck;
thisscore.planes = safe_planes;
thisscore.real_time = time(0) - start_time;
for (i = 0; i < num_scores; i++) {
if (strcmp(thisscore.name, score[i].name) == 0 &&
strcmp(thisscore.game, score[i].game) == 0) {
if (thisscore.time > score[i].time) {
score[i].time = thisscore.time;
score[i].planes = thisscore.planes;
score[i].real_time =
thisscore.real_time;
changed++;
}
found++;
break;
}
}
if (!found) {
for (i = 0; i < num_scores; i++) {
if (thisscore.time > score[i].time) {
if (num_scores < NUM_SCORES)
num_scores++;
memcpy(&score[num_scores - 1],
&score[i],
sizeof (score[i]));
memcpy(&score[i], &thisscore,
sizeof (score[i]));
changed++;
break;
}
}
}
if (!found && !changed && num_scores < NUM_SCORES) {
memcpy(&score[num_scores], &thisscore,
sizeof (score[num_scores]));
num_scores++;
changed++;
}
if (seeded) {
puts("The high score list does not include '-r' seeded games.");
} else if (changed) {
if (found)
puts("You beat your previous score!");
else
puts("You made the top players list!");
qsort(score, num_scores, sizeof (*score), compar);
if (fseek(score_fp, 0L, SEEK_SET) == -1)
err(1, "fseek");
for (i = 0; i < num_scores; i++)
fprintf(score_fp, "%s %s %d %d %d\n",
score[i].name,
score[i].game, score[i].planes,
score[i].time, score[i].real_time);
} else {
if (found)
puts("You didn't beat your previous score.");
else
puts("You didn't make the top players list.");
}
putchar('\n');
}
flock(fileno(score_fp), LOCK_UN);
fflush(score_fp);
fsync(fileno(score_fp));
if (fseek(score_fp, 0L, SEEK_SET) == -1)
err(1, "fseek");
printf("%2s: %-31s %-18s %4s %9s %4s\n", "#", "name",
"game", "time", "real time", "safe");
puts("-------------------------------------------------------------------------------");
for (i = 0; i < num_scores; i++) {
printf("%2d: %-31s %-18s %4d %9s %4d\n", i + 1,
score[i].name, score[i].game,
score[i].time, timestr(score[i].real_time),
score[i].planes);
}
putchar('\n');
return (0);
}
void
log_score_quit(int dummy)
{
(void)log_score(0);
exit(0);
}