2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2013, Dave Pare, Jeff Bailey, Thomas Ruschak,
4 * Ken Stevens, Steve McClure, Markus Armbruster
6 * Empire 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 3 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, see <http://www.gnu.org/licenses/>.
21 * See files README, COPYING and CREDITS in the root of the source
22 * tree for related information and legal notices. It is expected
23 * that future projects/authors will amend these files as needed.
27 * coas.c: Look at all the ships in the world
29 * Known contributors to this file:
31 * Dave Pare, 1986 (rewrite)
32 * Markus Armbruster, 2010
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];
64 int x, y, dx, dy, dxmax;
69 if (!snxtsct(&nstr, player->argp[1]))
71 for (i = 0; i < TSIZE; i++)
73 cp = malloc(sizeof(*cp));
74 snxtitem_all(&ni, EF_SHIP);
75 while (nxtitem(&ni, &cp->c_shp)) {
76 if (cp->c_shp.shp_own == 0 || cp->c_shp.shp_own == player->cnum)
79 * don't bother putting subs in the table...
80 * unless they're in a sector you own (harbor or such)
82 getsect(cp->c_shp.shp_x, cp->c_shp.shp_y, §);
83 if ((mchr[(int)cp->c_shp.shp_type].m_flags & M_SUB) &&
84 (sect.sct_own != player->cnum))
86 n = scthash(cp->c_shp.shp_x, cp->c_shp.shp_y, TSIZE);
91 cp = malloc(sizeof(*cp));
94 /* get that last one! */
96 pr("- = [ Coastwatch report for %s ] = -\n", cname(player->cnum));
97 pr(" Country Ship Location\n");
98 tech = tfact(player->cnum, 1.0);
99 while (nxtsct(&nstr, §) && nship) {
100 if (sect.sct_own != player->cnum)
102 see = sect.sct_type == SCT_RADAR ? 14 : 4;
103 vrange = (int)(sect.sct_effic / 100.0 * see * tech);
106 for (dy = -vrange; dy <= vrange; dy++) {
107 y = ynorm(sect.sct_y + dy);
108 dxmax = 2 * vrange - abs(dy);
109 for (dx = -dxmax; dx <= dxmax; dx += 2) {
110 x = xnorm(sect.sct_x + dx);
111 n = scthash(x, y, TSIZE);
114 nship -= showship(&list[n], x, y);
118 /* free up the coast structs calloc'ed above */
119 for (i = 0; i < TSIZE; i++) {
120 while (NULL != (cp = list[i])) {
121 list[i] = cp->c_next;
129 showship(struct coast **cpp, int x, int y)
132 struct coast *todelete = NULL;
140 /* we delete it, we free it. */
145 if (cp->c_shp.shp_x != x || cp->c_shp.shp_y != y) {
146 prev = &(*prev)->c_next;
149 pr(" %12.12s (#%3d) %s @ %s\n",
150 cname(cp->c_shp.shp_own), cp->c_shp.shp_own,
151 prship(&cp->c_shp), xyas(x, y, player->cnum));
153 setcont(player->cnum, cp->c_shp.shp_own, FOUND_COAST);
158 } while (NULL != (cp = cp->c_next));
159 /* check that last one! */