Home | History | Annotate | Line # | Download | only in atc
log.c revision 1.3
      1  1.3  cgd /*	$NetBSD: log.c,v 1.3 1995/03/21 15:04:21 cgd 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.1  cgd  * 3. All advertising materials mentioning features or use of this software
     19  1.1  cgd  *    must display the following acknowledgement:
     20  1.1  cgd  *	This product includes software developed by the University of
     21  1.1  cgd  *	California, Berkeley and its contributors.
     22  1.1  cgd  * 4. Neither the name of the University nor the names of its contributors
     23  1.1  cgd  *    may be used to endorse or promote products derived from this software
     24  1.1  cgd  *    without specific prior written permission.
     25  1.1  cgd  *
     26  1.1  cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     27  1.1  cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     28  1.1  cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     29  1.1  cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     30  1.1  cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     31  1.1  cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     32  1.1  cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     33  1.1  cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     34  1.1  cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     35  1.1  cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     36  1.1  cgd  * SUCH DAMAGE.
     37  1.1  cgd  */
     38  1.1  cgd 
     39  1.1  cgd /*
     40  1.1  cgd  * Copyright (c) 1987 by Ed James, UC Berkeley.  All rights reserved.
     41  1.1  cgd  *
     42  1.1  cgd  * Copy permission is hereby granted provided that this notice is
     43  1.1  cgd  * retained on all partial or complete copies.
     44  1.1  cgd  *
     45  1.1  cgd  * For more info on this and all of my stuff, mail edjames (at) berkeley.edu.
     46  1.1  cgd  */
     47  1.1  cgd 
     48  1.1  cgd #ifndef lint
     49  1.3  cgd #if 0
     50  1.3  cgd static char sccsid[] = "@(#)log.c	8.1 (Berkeley) 5/31/93";
     51  1.3  cgd #else
     52  1.3  cgd static char rcsid[] = "$NetBSD: log.c,v 1.3 1995/03/21 15:04:21 cgd Exp $";
     53  1.3  cgd #endif
     54  1.1  cgd #endif not lint
     55  1.1  cgd 
     56  1.1  cgd #include "include.h"
     57  1.1  cgd #include "pathnames.h"
     58  1.1  cgd 
     59  1.1  cgd compar(a, b)
     60  1.1  cgd 	SCORE	*a, *b;
     61  1.1  cgd {
     62  1.1  cgd 	if (b->planes == a->planes)
     63  1.1  cgd 		return (b->time - a->time);
     64  1.1  cgd 	else
     65  1.1  cgd 		return (b->planes - a->planes);
     66  1.1  cgd }
     67  1.1  cgd 
     68  1.1  cgd #define SECAMIN		60
     69  1.1  cgd #define MINAHOUR	60
     70  1.1  cgd #define HOURADAY	24
     71  1.1  cgd #define SECAHOUR	(SECAMIN * MINAHOUR)
     72  1.1  cgd #define SECADAY		(SECAHOUR * HOURADAY)
     73  1.1  cgd #define DAY(t)		((t) / SECADAY)
     74  1.1  cgd #define HOUR(t)		(((t) % SECADAY) / SECAHOUR)
     75  1.1  cgd #define MIN(t)		(((t) % SECAHOUR) / SECAMIN)
     76  1.1  cgd #define SEC(t)		((t) % SECAMIN)
     77  1.1  cgd 
     78  1.1  cgd char	*
     79  1.1  cgd timestr(t)
     80  1.1  cgd {
     81  1.1  cgd 	static char	s[80];
     82  1.1  cgd 
     83  1.1  cgd 	if (DAY(t) > 0)
     84  1.1  cgd 		(void)sprintf(s, "%dd+%02dhrs", DAY(t), HOUR(t));
     85  1.1  cgd 	else if (HOUR(t) > 0)
     86  1.1  cgd 		(void)sprintf(s, "%d:%02d:%02d", HOUR(t), MIN(t), SEC(t));
     87  1.1  cgd 	else if (MIN(t) > 0)
     88  1.1  cgd 		(void)sprintf(s, "%d:%02d", MIN(t), SEC(t));
     89  1.1  cgd 	else if (SEC(t) > 0)
     90  1.1  cgd 		(void)sprintf(s, ":%02d", SEC(t));
     91  1.1  cgd 	else
     92  1.1  cgd 		*s = '\0';
     93  1.1  cgd 
     94  1.1  cgd 	return (s);
     95  1.1  cgd }
     96  1.1  cgd 
     97  1.1  cgd log_score(list_em)
     98  1.1  cgd {
     99  1.1  cgd 	register int	i, fd, num_scores = 0, good, changed = 0, found = 0;
    100  1.1  cgd 	struct passwd	*pw;
    101  1.1  cgd 	FILE		*fp;
    102  1.1  cgd 	char		*cp, *index(), *rindex();
    103  1.1  cgd 	SCORE		score[100], thisscore;
    104  1.1  cgd #ifdef SYSV
    105  1.1  cgd 	struct utsname	name;
    106  1.1  cgd #endif
    107  1.1  cgd 
    108  1.1  cgd 	umask(0);
    109  1.1  cgd 	fd = open(_PATH_SCORE, O_CREAT|O_RDWR, 0644);
    110  1.1  cgd 	if (fd < 0) {
    111  1.1  cgd 		perror(_PATH_SCORE);
    112  1.1  cgd 		return (-1);
    113  1.1  cgd 	}
    114  1.1  cgd 	/*
    115  1.1  cgd 	 * This is done to take advantage of stdio, while still
    116  1.1  cgd 	 * allowing a O_CREAT during the open(2) of the log file.
    117  1.1  cgd 	 */
    118  1.1  cgd 	fp = fdopen(fd, "r+");
    119  1.1  cgd 	if (fp == NULL) {
    120  1.1  cgd 		perror(_PATH_SCORE);
    121  1.1  cgd 		return (-1);
    122  1.1  cgd 	}
    123  1.1  cgd #ifdef BSD
    124  1.1  cgd 	if (flock(fileno(fp), LOCK_EX) < 0)
    125  1.1  cgd #endif
    126  1.1  cgd #ifdef SYSV
    127  1.1  cgd 	while (lockf(fileno(fp), F_LOCK, 1) < 0)
    128  1.1  cgd #endif
    129  1.1  cgd 	{
    130  1.1  cgd 		perror("flock");
    131  1.1  cgd 		return (-1);
    132  1.1  cgd 	}
    133  1.1  cgd 	for (;;) {
    134  1.1  cgd 		good = fscanf(fp, "%s %s %s %d %d %d",
    135  1.1  cgd 			score[num_scores].name,
    136  1.1  cgd 			score[num_scores].host,
    137  1.1  cgd 			score[num_scores].game,
    138  1.1  cgd 			&score[num_scores].planes,
    139  1.1  cgd 			&score[num_scores].time,
    140  1.1  cgd 			&score[num_scores].real_time);
    141  1.1  cgd 		if (good != 6 || ++num_scores >= NUM_SCORES)
    142  1.1  cgd 			break;
    143  1.1  cgd 	}
    144  1.1  cgd 	if (!test_mode && !list_em) {
    145  1.1  cgd 		if ((pw = (struct passwd *) getpwuid(getuid())) == NULL) {
    146  1.1  cgd 			fprintf(stderr,
    147  1.1  cgd 				"getpwuid failed for uid %d.  Who are you?\n",
    148  1.1  cgd 				getuid());
    149  1.1  cgd 			return (-1);
    150  1.1  cgd 		}
    151  1.1  cgd 		strcpy(thisscore.name, pw->pw_name);
    152  1.1  cgd #ifdef BSD
    153  1.1  cgd 		if (gethostname(thisscore.host, sizeof (thisscore.host)) < 0) {
    154  1.1  cgd 			perror("gethostname");
    155  1.1  cgd 			return (-1);
    156  1.1  cgd 		}
    157  1.1  cgd #endif
    158  1.1  cgd #ifdef SYSV
    159  1.1  cgd 		uname(&name);
    160  1.1  cgd 		strcpy(thisscore.host, name.sysname);
    161  1.1  cgd #endif
    162  1.1  cgd 
    163  1.1  cgd 		cp = rindex(file, '/');
    164  1.1  cgd 		if (cp == NULL) {
    165  1.1  cgd 			fprintf(stderr, "log: where's the '/' in %s?\n", file);
    166  1.1  cgd 			return (-1);
    167  1.1  cgd 		}
    168  1.1  cgd 		cp++;
    169  1.1  cgd 		strcpy(thisscore.game, cp);
    170  1.1  cgd 
    171  1.1  cgd 		thisscore.time = clck;
    172  1.1  cgd 		thisscore.planes = safe_planes;
    173  1.1  cgd 		thisscore.real_time = time(0) - start_time;
    174  1.1  cgd 
    175  1.1  cgd 		for (i = 0; i < num_scores; i++) {
    176  1.1  cgd 			if (strcmp(thisscore.name, score[i].name) == 0 &&
    177  1.1  cgd 			    strcmp(thisscore.host, score[i].host) == 0 &&
    178  1.1  cgd 			    strcmp(thisscore.game, score[i].game) == 0) {
    179  1.1  cgd 				if (thisscore.time > score[i].time) {
    180  1.1  cgd 					score[i].time = thisscore.time;
    181  1.1  cgd 					score[i].planes = thisscore.planes;
    182  1.1  cgd 					score[i].real_time =
    183  1.1  cgd 						thisscore.real_time;
    184  1.1  cgd 					changed++;
    185  1.1  cgd 				}
    186  1.1  cgd 				found++;
    187  1.1  cgd 				break;
    188  1.1  cgd 			}
    189  1.1  cgd 		}
    190  1.1  cgd 		if (!found) {
    191  1.1  cgd 			for (i = 0; i < num_scores; i++) {
    192  1.1  cgd 				if (thisscore.time > score[i].time) {
    193  1.1  cgd 					if (num_scores < NUM_SCORES)
    194  1.1  cgd 						num_scores++;
    195  1.1  cgd 					bcopy(&score[i],
    196  1.1  cgd 						&score[num_scores - 1],
    197  1.1  cgd 						sizeof (score[i]));
    198  1.1  cgd 					bcopy(&thisscore, &score[i],
    199  1.1  cgd 						sizeof (score[i]));
    200  1.1  cgd 					changed++;
    201  1.1  cgd 					break;
    202  1.1  cgd 				}
    203  1.1  cgd 			}
    204  1.1  cgd 		}
    205  1.1  cgd 		if (!found && !changed && num_scores < NUM_SCORES) {
    206  1.1  cgd 			bcopy(&thisscore, &score[num_scores],
    207  1.1  cgd 				sizeof (score[num_scores]));
    208  1.1  cgd 			num_scores++;
    209  1.1  cgd 			changed++;
    210  1.1  cgd 		}
    211  1.1  cgd 
    212  1.1  cgd 		if (changed) {
    213  1.1  cgd 			if (found)
    214  1.1  cgd 				puts("You beat your previous score!");
    215  1.1  cgd 			else
    216  1.1  cgd 				puts("You made the top players list!");
    217  1.1  cgd 			qsort(score, num_scores, sizeof (*score), compar);
    218  1.1  cgd 			rewind(fp);
    219  1.1  cgd 			for (i = 0; i < num_scores; i++)
    220  1.1  cgd 				fprintf(fp, "%s %s %s %d %d %d\n",
    221  1.1  cgd 					score[i].name, score[i].host,
    222  1.1  cgd 					score[i].game, score[i].planes,
    223  1.1  cgd 					score[i].time, score[i].real_time);
    224  1.1  cgd 		} else {
    225  1.1  cgd 			if (found)
    226  1.1  cgd 				puts("You didn't beat your previous score.");
    227  1.1  cgd 			else
    228  1.1  cgd 				puts("You didn't make the top players list.");
    229  1.1  cgd 		}
    230  1.1  cgd 		putchar('\n');
    231  1.1  cgd 	}
    232  1.1  cgd #ifdef BSD
    233  1.1  cgd 	flock(fileno(fp), LOCK_UN);
    234  1.1  cgd #endif
    235  1.1  cgd #ifdef SYSV
    236  1.1  cgd 	/* lock will evaporate upon close */
    237  1.1  cgd #endif
    238  1.1  cgd 	fclose(fp);
    239  1.1  cgd 	printf("%2s:  %-8s  %-8s  %-18s  %4s  %9s  %4s\n", "#", "name", "host",
    240  1.1  cgd 		"game", "time", "real time", "planes safe");
    241  1.1  cgd 	puts("-------------------------------------------------------------------------------");
    242  1.1  cgd 	for (i = 0; i < num_scores; i++) {
    243  1.1  cgd 		cp = index(score[i].host, '.');
    244  1.1  cgd 		if (cp != NULL)
    245  1.1  cgd 			*cp = '\0';
    246  1.1  cgd 		printf("%2d:  %-8s  %-8s  %-18s  %4d  %9s  %4d\n", i + 1,
    247  1.1  cgd 			score[i].name, score[i].host, score[i].game,
    248  1.1  cgd 			score[i].time, timestr(score[i].real_time),
    249  1.1  cgd 			score[i].planes);
    250  1.1  cgd 	}
    251  1.1  cgd 	putchar('\n');
    252  1.1  cgd 	return (0);
    253  1.1  cgd }
    254