2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2008, 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 * spy.c: Spy on your neighbors
30 * Known contributors to this file:
32 * Steve McClure, 1998-2000
50 static int check(coord *table, int *len, coord x, coord y);
51 static void insert(coord *table, int *len, coord x, coord y);
52 static void spy_report(struct sctstr *sp);
53 static void prplanes(int, int);
54 static void prunits(int, int);
55 static char *player_relstr(natid);
67 coord *table; /* sectors already seen */
70 struct nstr_sect nstr;
80 * first arg should be the range of sectors
82 if (!snxtsct(&nstr, player->argp[1]))
84 nsects = (nstr.range.width + 1) * nstr.range.height / 2;
85 btucost = (nsects / 40) + 1;
86 natp = getnatp(player->cnum);
87 if (natp->nat_btu < btucost) {
88 pr("You don't have the BTU's for spying on that scale!\n");
92 * set up all the goodies we need later
93 * 6 = neighbors, 2 = x,y
95 table = malloc((nsects + 1) * 6 * 2 * sizeof(coord));
96 memset(table, 0, (nsects + 1) * 6 * 2 * sizeof(coord));
99 pr(" old sct rd rl def\n");
100 pr(" sect de own own eff eff eff eff civ mil shl gun pet food bars\n");
101 while (nxtsct(&nstr, &from)) {
102 if (!player->owner && !player->god)
104 military = from.sct_item[I_MILIT];
110 snxtitem_xy(&ni, EF_LAND, x, y);
111 while (nxtitem(&ni, &land)) {
112 if (lchr[(int)land.lnd_type].l_flags & L_RECON)
115 /* Print out the units/planes in this sector */
119 * check the neighboring sectors.
121 for (i = 1; i <= 6; i++) {
124 nx = x + diroff[i][0];
125 ny = y + diroff[i][1];
127 * if we've already seen the
128 * sector, don't bother checking it
131 if (check(table, &t_len, nx, ny)) {
134 getsect(nx, ny, &dsect);
135 if (player->owner || dsect.sct_type == SCT_WATER)
139 relat = getrel(getnatp(own), player->cnum);
141 && chance(dsect.sct_item[I_MILIT] / 200.0)) {
143 if (relat == NEUTRAL) {
145 pr("Spy deported from %s\n",
146 xyas(nx, ny, player->cnum));
148 wu(0, own, "%s (#%d) spy deported from %s\n",
149 cname(player->cnum), player->cnum,
153 pr("BANG!! A spy was shot in %s\n",
154 xyas(nx, ny, player->cnum));
157 wu(0, own, "%s (#%d) spy caught in %s\n",
158 cname(player->cnum), player->cnum,
162 setcont(own, player->cnum, FOUND_SPY);
163 if (!nrecon) /* unless you have a recon unit */
164 continue; /* no report from caught spy */
168 insert(table, &t_len, nx, ny);
170 changed += map_set(player->cnum, dsect.sct_x, dsect.sct_y,
171 dchr[dsect.sct_type].d_mnem, 0);
173 setcont(player->cnum, own, FOUND_SPY);
175 /* subtract any military if necessary */
176 if (from.sct_item[I_MILIT] != military) {
177 from.sct_item[I_MILIT] = military;
182 writemap(player->cnum);
183 player->btused += btucost;
189 spy_report(struct sctstr *sp)
191 prxy("%4d,%-4d", sp->sct_x, sp->sct_y, player->cnum);
192 pr(" %c%c %3d %3d %3d %3d %3d %3d %4d %4d %4d %3d %4d %4d %4d\n",
193 dchr[sp->sct_type].d_mnem,
194 sp->sct_newtype == sp->sct_type ? ' ' : dchr[sp->sct_newtype].d_mnem,
197 roundintby((int)sp->sct_effic, 10),
198 roundintby((int)sp->sct_road, 10),
199 roundintby((int)sp->sct_rail, 10),
200 roundintby((int)sp->sct_defense, 10),
201 roundintby(sp->sct_item[I_CIVIL], 10),
202 roundintby(sp->sct_item[I_MILIT], 10),
203 roundintby(sp->sct_item[I_SHELL], 10),
204 roundintby(sp->sct_item[I_GUN], 10),
205 roundintby(sp->sct_item[I_PETROL], 10),
206 roundintby(sp->sct_item[I_FOOD], 10),
207 roundintby(sp->sct_item[I_BAR], 10));
208 prunits(sp->sct_x, sp->sct_y);
209 prplanes(sp->sct_x, sp->sct_y);
213 * insert a key into the table.
216 insert(coord *table, int *len, coord x, coord y)
218 if (!check(table, len, x, y)) {
225 * see if a key is in the bitmask table
228 check(coord *table, int *len, coord x, coord y)
232 for (i = 0; i < *len; i += 2)
233 if (table[i] == x && table[i + 1] == y)
239 prunits(int x, int y)
245 snxtitem_xy(&ni, EF_LAND, x, y);
246 while (nxtitem(&ni, &land)) {
247 if (land.lnd_own == player->cnum || land.lnd_own == 0)
249 if (land.lnd_ship >= 0 || land.lnd_land >= 0)
251 /* Don't always see spies */
252 if (lchr[(int)land.lnd_type].l_flags & L_SPY) {
253 if (!(chance(LND_SPY_DETECT_CHANCE(land.lnd_effic))))
256 sprintf(report, "%s (%s) unit in %s: ",
257 player_relstr(land.lnd_own),
259 xyas(land.lnd_x, land.lnd_y, player->cnum));
260 intelligence_report(player->cnum, &land, 3, report);
265 prplanes(int x, int y)
270 snxtitem_xy(&ni, EF_PLANE, x, y);
271 while (nxtitem(&ni, &plane)) {
272 if (plane.pln_own == player->cnum || plane.pln_own == 0)
274 if (plane.pln_ship >= 0 || plane.pln_land >= 0)
276 if (plane.pln_flags & PLN_LAUNCHED)
278 pr("%s (%s) plane in %s: %s\n",
279 player_relstr(plane.pln_own),
280 cname(plane.pln_own),
281 xyas(plane.pln_x, plane.pln_y, player->cnum),
287 player_relstr(natid them)
289 int rel = getrel(getnatp(player->cnum), them);