2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2011, 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 * maps.c: Map routines
29 * Known contributors to this file:
32 * Markus Armbruster, 2004-2011
33 * Ron Koenderink, 2006
51 #include "prototypes.h"
56 /* Flags for draw_map() */
57 /* whether to put ships, planes, land units or nukes on the map */
58 #define MAP_SHIP bit(0)
59 #define MAP_PLANE bit(1)
60 #define MAP_LAND bit(2)
61 #define MAP_NUKE bit(3)
62 #define MAP_ALL (MAP_SHIP | MAP_PLANE | MAP_LAND | MAP_NUKE)
63 /* whether to highlight own sectors */
64 #define MAP_HIGH bit(4)
66 static int draw_map(int, char, int, struct nstr_sect *);
67 static int bmnxtsct(struct nstr_sect *);
68 static char map_char(int, natid, int);
69 static int unit_map(int, int, struct nstr_sect *, char *);
72 do_map(int bmap, int unit_type, char *arg, char *map_flags_arg)
79 if (!snxtsct(&ns, arg)) {
80 if (unit_map(unit_type, atoi(arg), &ns, &origin))
83 for (b = map_flags_arg; b && *b; b++) {
87 map_flags |= MAP_SHIP;
91 map_flags |= MAP_LAND;
95 map_flags |= MAP_PLANE;
99 map_flags |= MAP_NUKE;
103 map_flags |= MAP_HIGH;
106 map_flags |= MAP_ALL;
122 pr("Bad flag %c!\n", *b);
126 return draw_map(bmap, origin, map_flags, &ns);
130 draw_map(int bmap, char origin, int map_flags, struct nstr_sect *nsp)
135 union empobj_storage unit;
138 /* Note this is not re-entrant anyway, so we keep the buffers
140 static unsigned char *bitmap = NULL;
141 static char *wmapbuf = NULL;
142 static char **wmap = NULL;
143 static int ef_mappable[] = { EF_PLANE, EF_SHIP, EF_LAND, EF_NUKE, EF_BAD };
144 static int ef_unit_map[] = { MAP_PLANE, MAP_SHIP, MAP_LAND, MAP_NUKE };
148 wmapbuf = malloc(WORLD_Y * MAPWIDTH(1));
150 wmap = malloc(WORLD_Y * sizeof(char *));
151 if (wmap && wmapbuf) {
152 for (i = 0; i < WORLD_Y; i++)
153 wmap[i] = &wmapbuf[MAPWIDTH(1) * i];
160 bitmap = malloc((WORLD_SZ() + 7) / 8);
161 if (!wmapbuf || !wmap || !bitmap) {
162 pr("Memory error, tell the deity.\n");
163 logerror("malloc failed in draw_map\n");
168 if (!confirm("Are you sure you want to revert your bmap? "))
171 if (!(player->command->c_flags & C_MOD)) {
172 logerror("%s command needs C_MOD flag set",
173 player->command->c_form);
174 player->command->c_flags |= C_MOD;
176 np = getnatp(player->cnum);
177 /* zap any conditionals */
179 xyrelrange(np, &nsp->range, &range);
180 border(&range, " ", "");
181 blankfill(wmapbuf, &nsp->range, 1);
189 while (bmnxtsct(nsp) && !player->aborted) {
190 if (0 != (c = player->bmap[nsp->id]))
191 wmap[nsp->dy][nsp->dx] = c;
195 while (bmnxtsct(nsp) && !player->aborted) {
196 if (0 != (c = player->map[nsp->id]))
197 wmap[nsp->dy][nsp->dx] = c;
201 while (bmnxtsct(nsp) && !player->aborted) {
202 player->bmap[nsp->id] =
203 player->map[nsp->id];
204 if (0 != (c = player->bmap[nsp->id]))
205 wmap[nsp->dy][nsp->dx] = c;
207 ef_write(EF_BMAP, player->cnum, player->bmap);
214 memset(bitmap, 0, (WORLD_SZ() + 7) / 8);
215 bitinit2(nsp, bitmap, player->cnum);
217 while (nxtsct(nsp, §) && !player->aborted) {
218 if (!player->god && !emp_getbit(nsp->x, nsp->y, bitmap))
220 wmap[nsp->dy][nsp->dx]
221 = map_char(sect.sct_newtype, sect.sct_own,
233 memset(bitmap, 0, (WORLD_SZ() + 7) / 8);
234 bitinit2(nsp, bitmap, player->cnum);
236 while (nxtsct(nsp, §) && !player->aborted) {
237 if (!player->god && !emp_getbit(nsp->x, nsp->y, bitmap))
239 mapch = map_char(sect.sct_type, sect.sct_own, player->owner);
240 wmap[nsp->dy][nsp->dx] = mapch;
241 changed |= map_set(player->cnum, nsp->x, nsp->y, mapch, 0);
244 writemap(player->cnum);
250 while (ef_mappable[i] != EF_BAD) {
251 if (map_flags & ef_unit_map[i]) {
252 snxtitem_area(&ni, ef_mappable[i], &nsp->range);
253 while (nxtitem(&ni, &unit)) {
254 if (unit.gen.own == 0)
256 if (unit.gen.own != player->cnum && !player->god)
259 x = deltx(&nsp->range, unit.gen.x);
260 y = delty(&nsp->range, unit.gen.y);
262 if (ef_mappable[i] == EF_NUKE)
265 name = empobj_chr_name(&unit.gen);
266 wmap[y][x] = *name & ~0x20;
272 if (map_flags & MAP_HIGH) {
276 while (nxtsct(nsp, §) && !player->aborted) {
277 if (sect.sct_own == player->cnum)
278 wmap[nsp->dy][nsp->dx] |= 0x80;
282 wmap[5][10] = origin & ~0x20;
283 for (y = nsp->range.ly, i = 0; i < nsp->range.height; y++, i++) {
287 wmap[i][nsp->range.width] = '\0';
288 pr("%4d %s %-4d\n", yval, wmap[i], yval);
292 border(&range, " ", "");
297 * get the next sector in the range
300 bmnxtsct(struct nstr_sect *np)
305 if (np->x >= WORLD_X)
307 if (np->dx >= np->range.width) {
309 np->x = np->range.lx;
311 if (np->dy >= np->range.height)
314 if (np->y >= WORLD_Y)
317 if ((np->y + np->x) & 01)
319 if (np->type == NS_DIST) {
320 np->curdist = mapdist(np->x, np->y, np->cx, np->cy);
321 if (np->curdist > np->dist)
324 np->id = sctoff(np->x, np->y);
331 * Return character to use in maps for sector type TYPE owned by OWN.
332 * If OWNER_OR_GOD, the map is for the sector's owner or a deity.
335 map_char(int type, natid own, int owner_or_god)
337 if (CANT_HAPPEN(type > SCT_TYPE_MAX || !dchr[type].d_mnem))
340 || type == SCT_WATER || type == SCT_MOUNT || type == SCT_WASTE
341 || (!own && (type == SCT_RURAL || type == SCT_PLAINS)))
342 return dchr[type].d_mnem;
347 unit_map(int unit_type, int uid, struct nstr_sect *nsp, char *originp)
349 union empobj_storage unit;
353 if (CANT_HAPPEN((ef_flags(unit_type) & (EFF_OWNER | EFF_XY))
354 != (EFF_OWNER | EFF_XY)))
357 if (!get_empobj(unit_type, uid, &unit))
359 if (!player->owner || unit.gen.own == 0)
362 if (unit_type == EF_NUKE)
365 name = empobj_chr_name(&unit.gen);
369 range.lx = xnorm(unit.gen.x - 10);
370 range.hx = xnorm(unit.gen.x + 10);
371 range.ly = ynorm(unit.gen.y - 5);
372 range.hy = ynorm(unit.gen.y + 5);
373 xysize_range(&range);
374 snxtsct_area(nsp, &range);
379 display_region_map(int bmap, int unit_type, coord curx, coord cury,
382 char coordinates[80];
388 np = getnatp(player->cnum);
389 sprintf(coordinates, "%d:%d,%d:%d",
390 xrel(np, curx - 10), xrel(np, curx + 10),
391 yrel(np, cury - 5), yrel(np, cury + 5));
395 map_flag_arg = strchr(arg, ' ');
396 if (map_flag_arg != NULL) {
397 *map_flag_arg++ = '\0';
398 while (isspace(*map_flag_arg)) map_flag_arg++;
401 player->condarg = NULL;
402 return do_map(bmap, unit_type, arg, map_flag_arg);
406 bmaps_intersect(natid a, natid b)
408 char *mapa = ef_ptr(EF_MAP, a);
409 char *mapb = ef_ptr(EF_MAP, b);
412 for (i = 0; i < WORLD_SZ(); i++)
413 if (mapa[i] && mapa[i] != ' ' && mapb[i] && mapb[i] != ' ')
418 /* Note that this requires that the BMAP is mapped into memory */
421 share_bmap(natid from, natid to, struct nstr_sect *ns, char des,
424 char *from_bmap = ef_ptr(EF_BMAP, from);
425 char *to_bmap = ef_ptr(EF_BMAP, to);
430 char from_des = *from_name;
435 if (isalpha(from_des))
438 while (nxtsct(ns, §)) {
439 if (!(fromdes = from_bmap[sect.sct_uid]))
441 todes = to_bmap[sect.sct_uid];
444 todes != '.' && todes != ' ' && todes != from_des)
446 if (sect.sct_own == from) {
447 if (fromdes != '=' && fromdes != 'h' && fromdes != des)
450 if (todes == fromdes)
452 n += map_set(to, ns->x, ns->y, fromdes, 1);