Home | History | Annotate | Line # | Download | only in sail
misc.c revision 1.4
      1  1.4  tls /*	$NetBSD: misc.c,v 1.4 1997/01/07 12:42:23 tls Exp $	*/
      2  1.3  cgd 
      3  1.1  cgd /*
      4  1.3  cgd  * Copyright (c) 1983, 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.1  cgd #ifndef lint
     37  1.3  cgd #if 0
     38  1.4  tls static char sccsid[] = "@(#)misc.c	8.2 (Berkeley) 4/28/95";
     39  1.3  cgd #else
     40  1.4  tls static char rcsid[] = "$NetBSD: misc.c,v 1.4 1997/01/07 12:42:23 tls Exp $";
     41  1.3  cgd #endif
     42  1.1  cgd #endif /* not lint */
     43  1.1  cgd 
     44  1.4  tls #include "extern.h"
     45  1.1  cgd #include "pathnames.h"
     46  1.1  cgd 
     47  1.1  cgd #define distance(x,y) (abs(x) >= abs(y) ? abs(x) + abs(y)/2 : abs(y) + abs(x)/2)
     48  1.1  cgd 
     49  1.1  cgd /* XXX */
     50  1.1  cgd range(from, to)
     51  1.1  cgd struct ship *from, *to;
     52  1.1  cgd {
     53  1.1  cgd 	register bow1r, bow1c, bow2r, bow2c;
     54  1.1  cgd 	int stern1r, stern1c, stern2c, stern2r;
     55  1.1  cgd 	register int bb, bs, sb, ss, result;
     56  1.1  cgd 
     57  1.1  cgd 	if (!to->file->dir)
     58  1.1  cgd 		return -1;
     59  1.1  cgd 	stern1r = bow1r = from->file->row;
     60  1.1  cgd 	stern1c = bow1c = from->file->col;
     61  1.1  cgd 	stern2r = bow2r = to->file->row;
     62  1.1  cgd 	stern2c = bow2c = to->file->col;
     63  1.1  cgd 	result = bb = distance(bow2r - bow1r, bow2c - bow1c);
     64  1.1  cgd 	if (bb < 5) {
     65  1.1  cgd 		stern2r += dr[to->file->dir];
     66  1.1  cgd 		stern2c += dc[to->file->dir];
     67  1.1  cgd 		stern1r += dr[from->file->dir];
     68  1.1  cgd 		stern1c += dc[from->file->dir];
     69  1.1  cgd 		bs = distance((bow2r - stern1r), (bow2c - stern1c));
     70  1.1  cgd 		sb = distance((bow1r - stern2r), (bow1c - stern2c));
     71  1.1  cgd 		ss = distance((stern2r - stern1r) ,(stern2c - stern1c));
     72  1.1  cgd 		result = min(bb, min(bs, min(sb, ss)));
     73  1.1  cgd 	}
     74  1.1  cgd 	return result;
     75  1.1  cgd }
     76  1.1  cgd 
     77  1.1  cgd struct ship *
     78  1.1  cgd closestenemy(from, side, anyship)
     79  1.1  cgd register struct ship *from;
     80  1.1  cgd char side, anyship;
     81  1.1  cgd {
     82  1.1  cgd 	register struct ship *sp;
     83  1.1  cgd 	register char a;
     84  1.1  cgd 	int olddist = 30000, dist;
     85  1.1  cgd 	struct ship *closest = 0;
     86  1.1  cgd 
     87  1.1  cgd 	a = capship(from)->nationality;
     88  1.1  cgd 	foreachship(sp) {
     89  1.1  cgd 		if (sp == from)
     90  1.1  cgd 			continue;
     91  1.1  cgd 		if (sp->file->dir == 0)
     92  1.1  cgd 			continue;
     93  1.1  cgd 		if (a == capship(sp)->nationality && !anyship)
     94  1.1  cgd 			continue;
     95  1.1  cgd 		if (side && gunsbear(from, sp) != side)
     96  1.1  cgd 			continue;
     97  1.1  cgd 		dist = range(from, sp);
     98  1.1  cgd 		if (dist < olddist) {
     99  1.1  cgd 			closest = sp;
    100  1.1  cgd 			olddist = dist;
    101  1.1  cgd 		}
    102  1.1  cgd 	}
    103  1.1  cgd 	return closest;
    104  1.1  cgd }
    105  1.1  cgd 
    106  1.1  cgd angle(dr, dc)
    107  1.1  cgd register dr, dc;
    108  1.1  cgd {
    109  1.1  cgd 	register i;
    110  1.1  cgd 
    111  1.1  cgd 	if (dc >= 0 && dr > 0)
    112  1.1  cgd 		i = 0;
    113  1.1  cgd 	else if (dr <= 0 && dc > 0)
    114  1.1  cgd 		i = 2;
    115  1.1  cgd 	else if (dc <= 0 && dr < 0)
    116  1.1  cgd 		i = 4;
    117  1.1  cgd 	else
    118  1.1  cgd 		i = 6;
    119  1.1  cgd 	dr = abs(dr);
    120  1.1  cgd 	dc = abs(dc);
    121  1.1  cgd 	if ((i == 0 || i == 4) && dc * 2.4 > dr) {
    122  1.1  cgd 		i++;
    123  1.1  cgd 		if (dc > dr * 2.4)
    124  1.1  cgd 			i++;
    125  1.1  cgd 	} else if ((i == 2 || i == 6) && dr * 2.4 > dc) {
    126  1.1  cgd 		i++;
    127  1.1  cgd 		if (dr > dc * 2.4)
    128  1.1  cgd 			i++;
    129  1.1  cgd 	}
    130  1.1  cgd 	return i % 8 + 1;
    131  1.1  cgd }
    132  1.1  cgd 
    133  1.1  cgd gunsbear(from, to)		/* checks for target bow or stern */
    134  1.1  cgd register struct ship *from, *to;
    135  1.1  cgd {
    136  1.1  cgd 	int Dr, Dc, i;
    137  1.1  cgd 	register ang;
    138  1.1  cgd 
    139  1.1  cgd 	Dr = from->file->row - to->file->row;
    140  1.1  cgd 	Dc = to->file->col - from->file->col;
    141  1.1  cgd 	for (i = 2; i; i--) {
    142  1.1  cgd 		if ((ang = angle(Dr, Dc) - from->file->dir + 1) < 1)
    143  1.1  cgd 			ang += 8;
    144  1.1  cgd 		if (ang >= 2 && ang <= 4)
    145  1.1  cgd 			return 'r';
    146  1.1  cgd 		if (ang >= 6 && ang <= 7)
    147  1.1  cgd 			return 'l';
    148  1.1  cgd 		Dr += dr[to->file->dir];
    149  1.1  cgd 		Dc += dc[to->file->dir];
    150  1.1  cgd 	}
    151  1.1  cgd 	return 0;
    152  1.1  cgd }
    153  1.1  cgd 
    154  1.1  cgd portside(from, on, quick)
    155  1.1  cgd register struct ship *from, *on;
    156  1.1  cgd int quick;			/* returns true if fromship is */
    157  1.1  cgd {				/* shooting at onship's starboard side */
    158  1.1  cgd 	register ang;
    159  1.1  cgd 	register Dr, Dc;
    160  1.1  cgd 
    161  1.1  cgd 	Dr = from->file->row - on->file->row;
    162  1.1  cgd 	Dc = on->file->col - from->file->col;
    163  1.1  cgd 	if (quick == -1) {
    164  1.1  cgd 		Dr += dr[on->file->dir];
    165  1.1  cgd 		Dc += dc[on->file->dir];
    166  1.1  cgd 	}
    167  1.1  cgd 	ang = angle(Dr, Dc);
    168  1.1  cgd 	if (quick != 0)
    169  1.1  cgd 		return ang;
    170  1.1  cgd 	ang = (ang + 4 - on->file->dir - 1) % 8 + 1;
    171  1.1  cgd 	return ang < 5;
    172  1.1  cgd }
    173  1.1  cgd 
    174  1.1  cgd colours(sp)
    175  1.1  cgd register struct ship *sp;
    176  1.1  cgd {
    177  1.1  cgd 	register char flag;
    178  1.1  cgd 
    179  1.1  cgd 	if (sp->file->struck)
    180  1.1  cgd 		flag = '!';
    181  1.1  cgd 	if (sp->file->explode)
    182  1.1  cgd 		flag = '#';
    183  1.1  cgd 	if (sp->file->sink)
    184  1.1  cgd 		flag = '~';
    185  1.1  cgd 	if (sp->file->struck)
    186  1.1  cgd 		return flag;
    187  1.1  cgd 	flag = *countryname[capship(sp)->nationality];
    188  1.1  cgd 	return sp->file->FS ? flag : tolower(flag);
    189  1.1  cgd }
    190  1.1  cgd 
    191  1.1  cgd #include <sys/file.h>
    192  1.1  cgd log(s)
    193  1.1  cgd register struct ship *s;
    194  1.1  cgd {
    195  1.1  cgd 	FILE *fp;
    196  1.1  cgd 	int persons;
    197  1.1  cgd 	int n;
    198  1.1  cgd 	struct logs log[NLOG];
    199  1.1  cgd 	float net;
    200  1.1  cgd 	register struct logs *lp;
    201  1.1  cgd 
    202  1.1  cgd 	if ((fp = fopen(_PATH_LOGFILE, "r+")) == NULL)
    203  1.1  cgd 		return;
    204  1.1  cgd #ifdef LOCK_EX
    205  1.1  cgd 	if (flock(fileno(fp), LOCK_EX) < 0)
    206  1.1  cgd 		return;
    207  1.1  cgd #endif
    208  1.1  cgd 	net = (float)s->file->points / s->specs->pts;
    209  1.1  cgd 	persons = getw(fp);
    210  1.1  cgd 	n = fread((char *)log, sizeof(struct logs), NLOG, fp);
    211  1.1  cgd 	for (lp = &log[n]; lp < &log[NLOG]; lp++)
    212  1.1  cgd 		lp->l_name[0] = lp->l_uid = lp->l_shipnum
    213  1.1  cgd 			= lp->l_gamenum = lp->l_netpoints = 0;
    214  1.1  cgd 	rewind(fp);
    215  1.1  cgd 	if (persons < 0)
    216  1.1  cgd 		(void) putw(1, fp);
    217  1.1  cgd 	else
    218  1.1  cgd 		(void) putw(persons + 1, fp);
    219  1.1  cgd 	for (lp = log; lp < &log[NLOG]; lp++)
    220  1.1  cgd 		if (net > (float)lp->l_netpoints
    221  1.1  cgd 		    / scene[lp->l_gamenum].ship[lp->l_shipnum].specs->pts) {
    222  1.1  cgd 			(void) fwrite((char *)log,
    223  1.1  cgd 				sizeof (struct logs), lp - log, fp);
    224  1.1  cgd 			(void) strcpy(log[NLOG-1].l_name, s->file->captain);
    225  1.1  cgd 			log[NLOG-1].l_uid = getuid();
    226  1.1  cgd 			log[NLOG-1].l_shipnum = s->file->index;
    227  1.1  cgd 			log[NLOG-1].l_gamenum = game;
    228  1.1  cgd 			log[NLOG-1].l_netpoints = s->file->points;
    229  1.1  cgd 			(void) fwrite((char *)&log[NLOG-1],
    230  1.1  cgd 				sizeof (struct logs), 1, fp);
    231  1.1  cgd 			(void) fwrite((char *)lp,
    232  1.1  cgd 				sizeof (struct logs), &log[NLOG-1] - lp, fp);
    233  1.1  cgd 			break;
    234  1.1  cgd 		}
    235  1.1  cgd #ifdef LOCK_EX
    236  1.1  cgd 	(void) flock(fileno(fp), LOCK_UN);
    237  1.1  cgd #endif
    238  1.1  cgd 	(void) fclose(fp);
    239  1.1  cgd }
    240