2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2010, 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 * radmap.c: Do a radar map given an x,y location, effic, and other
30 * Known contributors to this file:
45 #include "prototypes.h"
50 static int rad_range(int, double, int);
52 /* More dynamic world sized buffers. We create 'em once, and then
53 * never again. No need to keep creating/tearing apart. We may
54 * want to do this in other places too where it doesn't matter. */
57 static signed char **vis;
58 static signed char *visbuf;
61 * Draw a radar map for radar at CX,CY.
62 * EFF is the radar's efficiency, TLEV its tech level, SPY its power.
63 * Submarines are detected at fraction SEESUB of the range.
66 radmap(int cx, int cy, int eff, double tlev, int spy, double seesub)
77 int range = rad_range(eff, tlev, spy);
81 radbuf = malloc(WORLD_Y * MAPWIDTH(1));
83 visbuf = malloc(WORLD_Y * MAPWIDTH(1));
85 rad = malloc(WORLD_Y * sizeof(char *));
87 for (x = 0; x < WORLD_Y; x++)
88 rad[x] = &radbuf[(WORLD_X + 1) * x];
92 vis = malloc(WORLD_Y * sizeof(signed char *));
94 for (x = 0; x < WORLD_Y; x++)
95 vis[x] = &visbuf[(WORLD_X + 1) * x];
98 if (!radbuf || !visbuf || !rad || !vis) {
99 pr("Memory error in radmap2, tell the deity.\n");
103 memset(visbuf, 0, (WORLD_Y * (WORLD_X + 1)));
104 pr("%s efficiency %d%%, max range %d\n",
105 xyas(cx, cy, player->cnum), eff, range);
106 snxtsct_dist(&ns, cx, cy, range);
107 blankfill(radbuf, &ns.range, 1);
108 while (nxtsct(&ns, §)) {
109 if (sect.sct_own == player->cnum
110 || sect.sct_type == SCT_WATER
111 || sect.sct_type == SCT_MOUNT
112 || sect.sct_type == SCT_WASTE
113 || ns.curdist <= range / 3)
114 rad[ns.dy][ns.dx] = dchr[sect.sct_type].d_mnem;
116 rad[ns.dy][ns.dx] = '?';
117 changed += map_set(player->cnum, ns.x, ns.y, rad[ns.dy][ns.dx], 0);
120 writemap(player->cnum);
121 snxtitem_dist(&ni, EF_PLANE, cx, cy, range);
122 while (nxtitem(&ni, &plane)) {
123 if (plane.pln_own == 0)
125 /* Used to have 'ghosts' when scanning whole world --ts */
126 x = deltx(&ns.range, (int)plane.pln_x);
127 y = delty(&ns.range, (int)plane.pln_y);
129 if (pln_is_in_orbit(&plane) && plane.pln_own != player->cnum) {
134 snxtitem_dist(&ni, EF_SHIP, cx, cy, range);
135 while (nxtitem(&ni, &ship)) {
136 if (ship.shp_own == 0)
138 /* Used to have 'ghosts' when scanning whole world --ts */
139 x = deltx(&ns.range, (int)ship.shp_x);
140 y = delty(&ns.range, (int)ship.shp_y);
142 visib = shp_visib(&ship);
143 rng = (int)(range * visib / 20.0);
144 if (ni.curdist > rng)
146 if ((mchr[(int)ship.shp_type].m_flags & M_SUB) &&
147 ni.curdist > rng * seesub)
149 if (visib > vis[y][x]) {
151 /* &~0x20 makes it a cap letter */
152 rad[y][x] = (*mchr[(int)ship.shp_type].m_name) & ~0x20;
156 * make the center of the display 0
157 * so ve et al can find it.
159 rad[delty(&ns.range, cy)][deltx(&ns.range, cx)] = '0';
162 for (row = 0; row < n; row++)
163 pr("%s\n", rad[row]);
168 * Return distance from left edge of R to X.
169 * Value is between 0 (inclusive) and WORLD_X (exclusive).
170 * X must be normalized.
173 deltx(struct range *r, coord x)
177 return x + WORLD_X - r->lx;
181 * Return distance from top edge of R to Y.
182 * Value is between 0 (inclusive) and WORLD_Y (exclusive).
183 * Y must be normalized.
186 delty(struct range *r, coord y)
190 return y + WORLD_Y - r->ly;
194 * Update OWNER's bmap for radar at CX,CY.
195 * EFF is the radar's efficiency, TLEV its tech level, SPY its power.
198 rad_map_set(natid owner, int cx, int cy, int eff, double tlev, int spy)
202 int range = rad_range(eff, tlev, spy);
206 snxtsct_dist(&ns, cx, cy, range);
207 while (nxtsct(&ns, §)) {
208 if (sect.sct_own == owner
209 || sect.sct_type == SCT_WATER
210 || sect.sct_type == SCT_MOUNT
211 || sect.sct_type == SCT_WASTE
212 || ns.curdist <= range / 3)
213 ch = dchr[sect.sct_type].d_mnem;
216 changed += map_set(owner, ns.x, ns.y, ch, 0);
223 * Range of a radar with EFF efficiency, TLEV tech, and SPY power.
226 rad_range(int eff, double tlev, int spy)
230 range = (int)techfact(tlev, spy);
231 range = (int)(range * (eff / 100.0));