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 * 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)
65 /* whether to draw a map or a bmap */
66 #define MAP_BMAP bit(5)
67 /* whether to draw an alternate map: newdes for map, true bmap for bmap */
68 #define MAP_ALT bit(6)
69 /* whether to revert bmap, internal to do_map() */
70 #define MAP_BMAP_REVERT bit(7)
72 static int parse_map_arg(int, char *, struct nstr_sect *, char *);
73 static int parse_map_flags(int, char *);
74 static int revert_bmap(struct nstr_sect *);
75 static int draw_map(char, int, struct nstr_sect *);
76 static int bmnxtsct(struct nstr_sect *);
77 static char map_char(int, natid, int);
78 static int unit_map(int, int, struct nstr_sect *, char *);
79 static void snxtsct_around(struct nstr_sect *, coord, coord);
82 do_map(int bmap, int unit_type, char *arg1, char *arg2)
88 res = parse_map_arg(unit_type, arg1, &ns, &origin);
92 map_flags = parse_map_flags(bmap, arg2);
96 if (map_flags & MAP_BMAP_REVERT)
97 return revert_bmap(&ns);
98 return draw_map(origin, map_flags, &ns);
102 parse_map_arg(int unit_type, char *arg,
103 struct nstr_sect *nsp, char *originp)
105 switch (sarg_type(arg)) {
109 if (!snxtsct(nsp, arg))
114 if (unit_map(unit_type, atoi(arg), nsp, originp) < 0) {
115 pr("No such %s\n", ef_nameof(unit_type));
123 warn_deprecated_arg(char *what, char *arg, char *use)
125 pr("%s '%s' is deprecated and will go away in a future release.\n"
131 parse_map_flags(int bmap, char *str)
139 default: CANT_REACH();
141 case 'b': map_flags = MAP_BMAP; break;
142 case 'n': map_flags = MAP_ALT; break;
143 case 0: map_flags = 0;
149 /* special case "revert" */
150 if (bmap == 'b' && mineq(str, "revert") != ME_MISMATCH)
151 return MAP_BMAP_REVERT;
153 for (p = str; *p; p++) {
157 map_flags |= MAP_SHIP;
161 map_flags |= MAP_LAND;
165 map_flags |= MAP_PLANE;
169 map_flags |= MAP_NUKE;
173 map_flags |= MAP_HIGH;
176 map_flags |= MAP_ALL;
181 map_flags |= MAP_ALT;
183 * Flags following 't' used to be ignored. That breaks
184 * perfectly sensible "ts". Try to continue, but save
185 * state for when a bad flag is found.
193 if (bmap != 'b' || tflags)
195 warn_deprecated_arg("Map flag", "r", "argument 'revert'");
196 return MAP_BMAP_REVERT;
200 /* ignore bad flags following 't' */
201 warn_deprecated_arg("Argument", tp, "map flag 't'");
204 pr("Bad flag %c!\n", *p);
213 revert_bmap(struct nstr_sect *nsp)
215 if (!confirm("Are you sure you want to revert your bmap? "))
217 while (bmnxtsct(nsp))
218 player->bmap[nsp->id] = player->map[nsp->id];
219 ef_write(EF_BMAP, player->cnum, player->bmap);
224 draw_map(char origin, int map_flags, struct nstr_sect *nsp)
229 union empobj_storage unit;
232 /* Note this is not re-entrant anyway, so we keep the buffers
234 static unsigned char *bitmap = NULL;
235 static char *wmapbuf = NULL;
236 static char **wmap = NULL;
237 static int ef_mappable[] = { EF_PLANE, EF_SHIP, EF_LAND, EF_NUKE, EF_BAD };
238 static int ef_unit_map[] = { MAP_PLANE, MAP_SHIP, MAP_LAND, MAP_NUKE };
242 wmapbuf = malloc(WORLD_Y * MAPWIDTH(1));
244 wmap = malloc(WORLD_Y * sizeof(char *));
245 if (wmap && wmapbuf) {
246 for (i = 0; i < WORLD_Y; i++)
247 wmap[i] = &wmapbuf[MAPWIDTH(1) * i];
254 bitmap = malloc((WORLD_SZ() + 7) / 8);
255 if (!wmapbuf || !wmap || !bitmap) {
256 pr("Memory error, tell the deity.\n");
257 logerror("malloc failed in draw_map\n");
261 if (!(player->command->c_flags & C_MOD)) {
262 logerror("%s command needs C_MOD flag set",
263 player->command->c_form);
264 player->command->c_flags |= C_MOD;
266 np = getnatp(player->cnum);
267 /* zap any conditionals */
269 xyrelrange(np, &nsp->range, &range);
270 border(&range, " ", "");
271 blankfill(wmapbuf, &nsp->range, 1);
273 if (map_flags & MAP_BMAP) {
274 char *map = map_flags & MAP_ALT ? player->map : player->bmap;
276 while (bmnxtsct(nsp)) {
278 wmap[nsp->dy][nsp->dx] = map[nsp->id];
286 memset(bitmap, 0, (WORLD_SZ() + 7) / 8);
287 bitinit2(nsp, bitmap, player->cnum);
290 while (nxtsct(nsp, §)) {
291 if (!player->god && !emp_getbit(nsp->x, nsp->y, bitmap))
293 mapch = map_char(map_flags & MAP_ALT
294 ? sect.sct_newtype : sect.sct_type,
295 sect.sct_own, player->owner);
296 wmap[nsp->dy][nsp->dx] = mapch;
297 if (!(map_flags & MAP_ALT))
298 changed |= map_set(player->cnum, nsp->x, nsp->y, mapch, 0);
301 writemap(player->cnum);
305 while (ef_mappable[i] != EF_BAD) {
306 if (map_flags & ef_unit_map[i]) {
307 snxtitem_area(&ni, ef_mappable[i], &nsp->range);
308 while (nxtitem(&ni, &unit)) {
309 if (unit.gen.own == 0)
311 if (unit.gen.own != player->cnum && !player->god)
314 x = deltx(&nsp->range, unit.gen.x);
315 y = delty(&nsp->range, unit.gen.y);
317 if (ef_mappable[i] == EF_NUKE)
320 name = empobj_chr_name(&unit.gen);
321 wmap[y][x] = *name & ~0x20;
327 if (map_flags & MAP_HIGH) {
331 while (nxtsct(nsp, §)) {
332 if (sect.sct_own == player->cnum)
333 wmap[nsp->dy][nsp->dx] |= 0x80;
337 wmap[5][10] = origin & ~0x20;
338 for (y = nsp->range.ly, i = 0; i < nsp->range.height; y++, i++) {
342 wmap[i][nsp->range.width] = '\0';
343 pr("%4d %s %-4d\n", yval, wmap[i], yval);
347 border(&range, " ", "");
352 * get the next sector in the range
355 bmnxtsct(struct nstr_sect *np)
360 if (np->x >= WORLD_X)
362 if (np->dx >= np->range.width) {
364 np->x = np->range.lx;
366 if (np->dy >= np->range.height)
369 if (np->y >= WORLD_Y)
372 if ((np->y + np->x) & 01)
374 if (np->type == NS_DIST) {
375 np->curdist = mapdist(np->x, np->y, np->cx, np->cy);
376 if (np->curdist > np->dist)
379 np->id = sctoff(np->x, np->y);
386 * Return character to use in maps for sector type TYPE owned by OWN.
387 * If OWNER_OR_GOD, the map is for the sector's owner or a deity.
390 map_char(int type, natid own, int owner_or_god)
392 if (CANT_HAPPEN(type > SCT_TYPE_MAX || !dchr[type].d_mnem))
395 || type == SCT_WATER || type == SCT_MOUNT || type == SCT_WASTE
396 || (!own && (type == SCT_RURAL || type == SCT_PLAINS)))
397 return dchr[type].d_mnem;
402 unit_map(int unit_type, int uid, struct nstr_sect *nsp, char *originp)
404 union empobj_storage unit;
407 if (CANT_HAPPEN((ef_flags(unit_type) & (EFF_OWNER | EFF_XY))
408 != (EFF_OWNER | EFF_XY)))
411 if (!get_empobj(unit_type, uid, &unit))
413 if (!player->owner || unit.gen.own == 0)
416 if (unit_type == EF_NUKE)
419 name = empobj_chr_name(&unit.gen);
423 snxtsct_around(nsp, unit.gen.x, unit.gen.y);
428 snxtsct_around(struct nstr_sect *nsp, coord x, coord y)
432 range.lx = xnorm(x - 10);
433 range.hx = xnorm(x + 10);
434 range.ly = ynorm(y - 5);
435 range.hy = ynorm(y + 5);
436 xysize_range(&range);
437 snxtsct_area(nsp, &range);
441 display_region_map(int bmap, int unit_type, coord curx, coord cury,
442 char *arg1, char *arg2)
449 res = parse_map_arg(unit_type, arg1, &ns, &origin);
453 map_flags = parse_map_flags(bmap, arg2);
457 snxtsct_around(&ns, curx, cury);
462 if (map_flags & MAP_BMAP_REVERT)
463 return revert_bmap(&ns);
464 return draw_map(origin, map_flags, &ns);
468 bmaps_intersect(natid a, natid b)
470 char *mapa = ef_ptr(EF_MAP, a);
471 char *mapb = ef_ptr(EF_MAP, b);
474 for (i = 0; i < WORLD_SZ(); i++)
475 if (mapa[i] && mapa[i] != ' ' && mapb[i] && mapb[i] != ' ')
480 /* Note that this requires that the BMAP is mapped into memory */
483 share_bmap(natid from, natid to, struct nstr_sect *ns, char des,
486 char *from_bmap = ef_ptr(EF_BMAP, from);
487 char *to_bmap = ef_ptr(EF_BMAP, to);
492 char from_des = *from_name;
497 if (isalpha(from_des))
500 while (nxtsct(ns, §)) {
501 if (!(fromdes = from_bmap[sect.sct_uid]))
503 todes = to_bmap[sect.sct_uid];
506 todes != '.' && todes != ' ' && todes != from_des)
508 if (sect.sct_own == from) {
509 if (fromdes != '=' && fromdes != 'h' && fromdes != des)
512 if (todes == fromdes)
514 n += map_set(to, ns->x, ns->y, fromdes, 1);