2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2020, 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 * radmap.c: Do a radar map given an x,y location, effic, and other
29 * Known contributors to this file:
31 * Markus Armbruster, 2004-2010
44 #include "prototypes.h"
49 static int rad_range(int, double, int);
50 static char rad_char(struct sctstr *, int, int, natid);
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 rad[ns.dy][ns.dx] = rad_char(§, ns.curdist, range,
111 changed += map_set(player->cnum, ns.x, ns.y, rad[ns.dy][ns.dx], 0);
114 writemap(player->cnum);
115 snxtitem_dist(&ni, EF_PLANE, cx, cy, range);
116 while (nxtitem(&ni, &plane)) {
117 if (plane.pln_own == 0)
119 /* Used to have 'ghosts' when scanning whole world --ts */
120 x = deltx(&ns.range, (int)plane.pln_x);
121 y = delty(&ns.range, (int)plane.pln_y);
123 if (pln_is_in_orbit(&plane) && plane.pln_own != player->cnum) {
128 snxtitem_dist(&ni, EF_SHIP, cx, cy, range);
129 while (nxtitem(&ni, &ship)) {
130 if (ship.shp_own == 0)
132 /* Used to have 'ghosts' when scanning whole world --ts */
133 x = deltx(&ns.range, (int)ship.shp_x);
134 y = delty(&ns.range, (int)ship.shp_y);
136 visib = shp_visib(&ship);
137 rng = (int)(range * visib / 20.0);
138 if (ni.curdist > rng)
140 if ((mchr[(int)ship.shp_type].m_flags & M_SUB) &&
141 ni.curdist > rng * seesub)
143 if (visib > vis[y][x]) {
145 /* &~0x20 makes it a cap letter */
146 rad[y][x] = (*mchr[(int)ship.shp_type].m_name) & ~0x20;
150 * make the center of the display 0
151 * so ve et al can find it.
153 rad[delty(&ns.range, cy)][deltx(&ns.range, cx)] = '0';
156 for (row = 0; row < n; row++)
157 pr("%s\n", rad[row]);
162 * Return distance from left edge of @r to @x.
163 * Value is between 0 (inclusive) and WORLD_X (exclusive).
164 * @x must be normalized.
167 deltx(struct range *r, coord x)
171 return x + WORLD_X - r->lx;
175 * Return distance from top edge of @r to @y.
176 * Value is between 0 (inclusive) and WORLD_Y (exclusive).
177 * @y must be normalized.
180 delty(struct range *r, coord y)
184 return y + WORLD_Y - r->ly;
188 * Update @owner's bmap for radar at @cx,@cy.
189 * @eff is the radar's efficiency, @tlev its tech level, @spy its power.
192 rad_map_set(natid owner, int cx, int cy, int eff, double tlev, int spy)
196 int range = rad_range(eff, tlev, spy);
200 snxtsct_dist(&ns, cx, cy, range);
201 while (nxtsct(&ns, §)) {
202 ch = rad_char(§, ns.curdist, range, owner);
203 changed += map_set(owner, ns.x, ns.y, ch, 0);
210 * Range of a radar with @eff efficiency, @tlev tech, and @spy power.
213 rad_range(int eff, double tlev, int spy)
217 range = (int)techfact(tlev, spy);
218 range = (int)(range * (eff / 100.0));
225 * Return character to use in radar maps for sector @sp.
226 * @dist is the distance from the radar, @range its range.
227 * Country @cn is using the radar.
230 rad_char(struct sctstr *sp, int dist, int range, natid cn)
232 if (sp->sct_own == cn
233 || sp->sct_type == SCT_WATER
234 || sp->sct_type == SCT_MOUNT
235 || sp->sct_type == SCT_WASTE
236 || dist <= range / 3)
237 return dchr[sp->sct_type].d_mnem;