2 * Copyright (c) 1983, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * @(#)misc.c 8.1 (Berkeley) 5/31/93
30 * $FreeBSD: src/games/sail/misc.c,v 1.5 1999/11/30 03:49:34 billf Exp $
31 * $DragonFly: src/games/sail/misc.c,v 1.4 2006/09/03 17:33:13 pavalos Exp $
36 #include "pathnames.h"
38 #define distance(x,y) \
39 (abs(x) >= abs(y) ? abs(x) + abs(y)/2 : abs(y) + abs(x)/2)
41 static int angle(int, int);
45 range(struct ship *from, struct ship *to)
47 int bow1r, bow1c, bow2r, bow2c;
48 int stern1r, stern1c, stern2c, stern2r;
49 int bb, bs, sb, ss, result;
53 stern1r = bow1r = from->file->row;
54 stern1c = bow1c = from->file->col;
55 stern2r = bow2r = to->file->row;
56 stern2c = bow2c = to->file->col;
57 result = bb = distance(bow2r - bow1r, bow2c - bow1c);
59 stern2r += dr[to->file->dir];
60 stern2c += dc[to->file->dir];
61 stern1r += dr[from->file->dir];
62 stern1c += dc[from->file->dir];
63 bs = distance((bow2r - stern1r), (bow2c - stern1c));
64 sb = distance((bow1r - stern2r), (bow1c - stern2c));
65 ss = distance((stern2r - stern1r) ,(stern2c - stern1c));
66 result = min(bb, min(bs, min(sb, ss)));
72 closestenemy(struct ship *from, char side, char anyship)
76 int olddist = 30000, dist;
77 struct ship *closest = 0;
79 a = capship(from)->nationality;
83 if (sp->file->dir == 0)
85 if (a == capship(sp)->nationality && !anyship)
87 if (side && gunsbear(from, sp) != side)
89 dist = range(from, sp);
103 if (Dc >= 0 && Dr > 0)
105 else if (Dr <= 0 && Dc > 0)
107 else if (Dc <= 0 && Dr < 0)
113 if ((i == 0 || i == 4) && Dc * 2.4 > Dr) {
117 } else if ((i == 2 || i == 6) && Dr * 2.4 > Dc) {
125 /* checks for target bow or stern */
127 gunsbear(struct ship *from, struct ship *to)
132 Dr = from->file->row - to->file->row;
133 Dc = to->file->col - from->file->col;
134 for (i = 2; i; i--) {
135 if ((ang = angle(Dr, Dc) - from->file->dir + 1) < 1)
137 if (ang >= 2 && ang <= 4)
139 if (ang >= 6 && ang <= 7)
141 Dr += dr[to->file->dir];
142 Dc += dc[to->file->dir];
147 /* returns true if fromship is shooting at onship's starboard side */
149 portside(struct ship *from, struct ship *on, int quick)
154 Dr = from->file->row - on->file->row;
155 Dc = on->file->col - from->file->col;
157 Dr += dr[on->file->dir];
158 Dc += dc[on->file->dir];
163 ang = (ang + 4 - on->file->dir - 1) % 8 + 1;
168 colours(struct ship *sp)
172 if (sp->file->struck)
174 if (sp->file->explode)
178 if (sp->file->struck)
180 flag = *countryname[capship(sp)->nationality];
181 return sp->file->FS ? flag : tolower(flag);
185 write_log(struct ship *s)
190 struct logs log[NLOG];
194 if ((fp = fopen(_PATH_LOGFILE, "r+")) == NULL)
197 if (flock(fileno(fp), LOCK_EX) < 0)
200 net = (float)s->file->points / s->specs->pts;
202 n = fread((char *)log, sizeof(struct logs), NLOG, fp);
203 for (lp = &log[n]; lp < &log[NLOG]; lp++)
204 lp->l_name[0] = lp->l_uid = lp->l_shipnum
205 = lp->l_gamenum = lp->l_netpoints = 0;
210 putw(persons + 1, fp);
211 for (lp = log; lp < &log[NLOG]; lp++)
212 if (net > (float)lp->l_netpoints
213 / scene[lp->l_gamenum].ship[lp->l_shipnum].specs->pts) {
215 sizeof (struct logs), lp - log, fp);
216 strcpy(log[NLOG-1].l_name, s->file->captain);
217 log[NLOG-1].l_uid = getuid();
218 log[NLOG-1].l_shipnum = s->file->index;
219 log[NLOG-1].l_gamenum = game;
220 log[NLOG-1].l_netpoints = s->file->points;
221 fwrite((char *)&log[NLOG-1],
222 sizeof (struct logs), 1, fp);
224 sizeof (struct logs), &log[NLOG-1] - lp, fp);
228 flock(fileno(fp), LOCK_UN);