2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2009, Dave Pare, Jeff Bailey, Thomas Ruschak,
4 * Ken Stevens, Steve McClure
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
22 * See files README, COPYING and CREDITS in the root of the source
23 * tree for related information and legal notices. It is expected
24 * that future projects/authors will amend these files as needed.
28 * coas.c: Look at all the ships in the world
30 * Known contributors to this file:
32 * Dave Pare, 1986 (rewrite)
50 static int showship(struct coast **cpp, int x, int y);
53 * format: coastwatch [<SECTS>]
59 struct nstr_sect nstr;
61 struct coast *list[TSIZE];
65 int mink, minj, maxk, maxj;
70 if (!snxtsct(&nstr, player->argp[1]))
72 for (i = 0; i < TSIZE; i++)
74 cp = malloc(sizeof(*cp));
75 snxtitem_all(&ni, EF_SHIP);
76 while (nxtitem(&ni, &cp->c_shp)) {
77 if (cp->c_shp.shp_own == 0 || cp->c_shp.shp_own == player->cnum)
80 * don't bother putting subs in the table...
81 * unless they're in a sector you own (harbor or such)
83 getsect(cp->c_shp.shp_x, cp->c_shp.shp_y, §);
84 if ((mchr[(int)cp->c_shp.shp_type].m_flags & M_SUB) &&
85 (sect.sct_own != player->cnum))
87 n = scthash(cp->c_shp.shp_x, cp->c_shp.shp_y, TSIZE);
92 cp = malloc(sizeof(*cp));
95 /* get that last one! */
97 pr("- = [ Coastwatch report for %s ] = -\n", cname(player->cnum));
98 pr(" Country Ship Location\n");
99 tech = tfact(player->cnum, 1.0);
100 while (nxtsct(&nstr, §) && nship) {
101 if (sect.sct_own != player->cnum)
103 see = sect.sct_type == SCT_RADAR ? 14 : 4;
104 vrange = (int)(sect.sct_effic / 100.0 * see * tech);
112 for (j = minj; j <= maxj && nship; j++) {
113 x = xnorm(sect.sct_x + j);
114 for (k = mink; k <= maxk && nship; k++) {
117 /* quick range check to save time... */
118 if (vrange < (j * j + 3 * k * k) / 4)
120 y = ynorm(sect.sct_y + k);
121 n = scthash(x, y, TSIZE);
124 nship -= showship(&list[n], x, y);
128 /* free up the coast structs calloc'ed above */
129 for (i = 0; i < TSIZE; i++) {
130 while (NULL != (cp = list[i])) {
131 list[i] = cp->c_next;
139 showship(struct coast **cpp, int x, int y)
142 struct coast *todelete = 0;
150 /* we delete it, we free it. */
155 if (cp->c_shp.shp_x != x || cp->c_shp.shp_y != y) {
156 prev = &(*prev)->c_next;
159 pr(" %12.12s (#%3d) %s @ %s\n",
160 cname(cp->c_shp.shp_own), cp->c_shp.shp_own,
161 prship(&cp->c_shp), xyas(x, y, player->cnum));
163 setcont(player->cnum, cp->c_shp.shp_own, FOUND_COAST);
168 } while (NULL != (cp = cp->c_next));
169 /* check that last one! */