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
52 #include "prototypes.h"
57 /* Flags for draw_map() */
58 /* whether to put ships, planes, land units or nukes on the map */
59 #define MAP_SHIP bit(0)
60 #define MAP_PLANE bit(1)
61 #define MAP_LAND bit(2)
62 #define MAP_NUKE bit(3)
63 #define MAP_ALL (MAP_SHIP | MAP_PLANE | MAP_LAND | MAP_NUKE)
64 /* whether to highlight own sectors */
65 #define MAP_HIGH bit(4)
66 /* whether to draw a map or a bmap */
67 #define MAP_BMAP bit(5)
68 /* whether to draw an alternate map: newdes for map, true bmap for bmap */
69 #define MAP_ALT bit(6)
70 /* whether to revert bmap, internal to do_map() */
71 #define MAP_BMAP_REVERT bit(7)
73 static int parse_map_arg(int, char *, struct nstr_sect *, char *);
74 static int parse_map_flags(int, char *);
75 static int revert_bmap(struct nstr_sect *);
76 static int draw_map(char, int, struct nstr_sect *);
77 static int bmnxtsct(struct nstr_sect *);
78 static char map_char(int, natid, int);
79 static int unit_map(int, int, struct nstr_sect *, char *);
80 static void snxtsct_around(struct nstr_sect *, coord, coord);
83 do_map(int bmap, int unit_type, char *arg1, char *arg2)
89 res = parse_map_arg(unit_type, arg1, &ns, &origin);
93 map_flags = parse_map_flags(bmap, arg2);
97 if (map_flags & MAP_BMAP_REVERT)
98 return revert_bmap(&ns);
99 return draw_map(origin, map_flags, &ns);
103 parse_map_arg(int unit_type, char *arg,
104 struct nstr_sect *nsp, char *originp)
106 switch (sarg_type(arg)) {
110 if (!snxtsct(nsp, arg))
115 if (unit_map(unit_type, atoi(arg), nsp, originp) < 0) {
116 pr("No such %s\n", ef_nameof(unit_type));
124 warn_deprecated_arg(char *what, char *arg, char *use)
126 pr("%s '%s' is deprecated and will go away in a future release.\n"
132 parse_map_flags(int bmap, char *str)
140 default: CANT_REACH();
142 case 'b': map_flags = MAP_BMAP; break;
143 case 'n': map_flags = MAP_ALT; break;
144 case 0: map_flags = 0;
150 /* special case "revert" */
151 if (bmap == 'b' && mineq(str, "revert") != ME_MISMATCH)
152 return MAP_BMAP_REVERT;
154 for (p = str; *p; p++) {
158 map_flags |= MAP_SHIP;
162 map_flags |= MAP_LAND;
166 map_flags |= MAP_PLANE;
170 map_flags |= MAP_NUKE;
174 map_flags |= MAP_HIGH;
177 map_flags |= MAP_ALL;
182 map_flags |= MAP_ALT;
184 * Flags following 't' used to be ignored. That breaks
185 * perfectly sensible "ts". Try to continue, but save
186 * state for when a bad flag is found.
194 if (bmap != 'b' || tflags)
196 warn_deprecated_arg("Map flag", "r", "argument 'revert'");
197 return MAP_BMAP_REVERT;
201 /* ignore bad flags following 't' */
202 warn_deprecated_arg("Argument", tp, "map flag 't'");
205 pr("Bad flag %c!\n", *p);
214 revert_bmap(struct nstr_sect *nsp)
216 if (!confirm("Are you sure you want to revert your bmap? "))
218 while (bmnxtsct(nsp))
219 player->bmap[nsp->id] = player->map[nsp->id];
220 ef_write(EF_BMAP, player->cnum, player->bmap);
225 draw_map(char origin, int map_flags, struct nstr_sect *nsp)
230 union empobj_storage unit;
233 /* Note this is not re-entrant anyway, so we keep the buffers
235 static unsigned char *bitmap = NULL;
236 static char *wmapbuf = NULL;
237 static char **wmap = NULL;
238 static int ef_mappable[] = { EF_PLANE, EF_SHIP, EF_LAND, EF_NUKE, EF_BAD };
239 static int ef_unit_map[] = { MAP_PLANE, MAP_SHIP, MAP_LAND, MAP_NUKE };
243 wmapbuf = malloc(WORLD_Y * MAPWIDTH(1));
245 wmap = malloc(WORLD_Y * sizeof(char *));
246 if (wmap && wmapbuf) {
247 for (i = 0; i < WORLD_Y; i++)
248 wmap[i] = &wmapbuf[MAPWIDTH(1) * i];
255 bitmap = malloc((WORLD_SZ() + 7) / 8);
256 if (!wmapbuf || !wmap || !bitmap) {
257 pr("Memory error, tell the deity.\n");
258 logerror("malloc failed in draw_map\n");
262 if (!(player->command->c_flags & C_MOD)) {
263 logerror("%s command needs C_MOD flag set",
264 player->command->c_form);
265 player->command->c_flags |= C_MOD;
267 np = getnatp(player->cnum);
268 /* zap any conditionals */
270 xyrelrange(np, &nsp->range, &range);
271 border(&range, " ", "");
272 blankfill(wmapbuf, &nsp->range, 1);
274 if (map_flags & MAP_BMAP) {
275 char *map = map_flags & MAP_ALT ? player->map : player->bmap;
277 while (bmnxtsct(nsp)) {
279 wmap[nsp->dy][nsp->dx] = map[nsp->id];
287 memset(bitmap, 0, (WORLD_SZ() + 7) / 8);
288 bitinit2(nsp, bitmap, player->cnum);
291 while (nxtsct(nsp, §)) {
292 if (!player->god && !emp_getbit(nsp->x, nsp->y, bitmap))
294 mapch = map_char(map_flags & MAP_ALT
295 ? sect.sct_newtype : sect.sct_type,
296 sect.sct_own, player->owner);
297 wmap[nsp->dy][nsp->dx] = mapch;
298 if (!(map_flags & MAP_ALT))
299 changed |= map_set(player->cnum, nsp->x, nsp->y, mapch, 0);
302 writemap(player->cnum);
306 while (ef_mappable[i] != EF_BAD) {
307 if (map_flags & ef_unit_map[i]) {
308 snxtitem_area(&ni, ef_mappable[i], &nsp->range);
309 while (nxtitem(&ni, &unit)) {
310 if (unit.gen.own == 0)
312 if (unit.gen.own != player->cnum && !player->god)
315 x = deltx(&nsp->range, unit.gen.x);
316 y = delty(&nsp->range, unit.gen.y);
318 if (ef_mappable[i] == EF_NUKE)
321 name = empobj_chr_name(&unit.gen);
322 wmap[y][x] = *name & ~0x20;
328 if (map_flags & MAP_HIGH) {
332 while (nxtsct(nsp, §)) {
333 if (sect.sct_own == player->cnum)
334 wmap[nsp->dy][nsp->dx] |= 0x80;
338 wmap[5][10] = origin & ~0x20;
339 for (y = nsp->range.ly, i = 0; i < nsp->range.height; y++, i++) {
343 wmap[i][nsp->range.width] = '\0';
344 pr("%4d %s %-4d\n", yval, wmap[i], yval);
348 border(&range, " ", "");
353 * get the next sector in the range
356 bmnxtsct(struct nstr_sect *np)
361 if (np->x >= WORLD_X)
363 if (np->dx >= np->range.width) {
365 np->x = np->range.lx;
367 if (np->dy >= np->range.height)
370 if (np->y >= WORLD_Y)
373 if ((np->y + np->x) & 01)
375 if (np->type == NS_DIST) {
376 np->curdist = mapdist(np->x, np->y, np->cx, np->cy);
377 if (np->curdist > np->dist)
380 np->id = sctoff(np->x, np->y);
387 * Return character to use in maps for sector type TYPE owned by OWN.
388 * If OWNER_OR_GOD, the map is for the sector's owner or a deity.
391 map_char(int type, natid own, int owner_or_god)
393 if (CANT_HAPPEN(type > SCT_TYPE_MAX || !dchr[type].d_mnem))
396 || type == SCT_WATER || type == SCT_MOUNT || type == SCT_WASTE
397 || (!own && (type == SCT_RURAL || type == SCT_PLAINS)))
398 return dchr[type].d_mnem;
403 unit_map(int unit_type, int uid, struct nstr_sect *nsp, char *originp)
405 union empobj_storage unit;
408 if (CANT_HAPPEN((ef_flags(unit_type) & (EFF_OWNER | EFF_XY))
409 != (EFF_OWNER | EFF_XY)))
412 if (!get_empobj(unit_type, uid, &unit))
414 if (!player->owner || unit.gen.own == 0)
417 if (unit_type == EF_NUKE)
420 name = empobj_chr_name(&unit.gen);
424 snxtsct_around(nsp, unit.gen.x, unit.gen.y);
429 snxtsct_around(struct nstr_sect *nsp, coord x, coord y)
433 range.lx = xnorm(x - 10);
434 range.hx = xnorm(x + 10);
435 range.ly = ynorm(y - 5);
436 range.hy = ynorm(y + 5);
437 xysize_range(&range);
438 snxtsct_area(nsp, &range);
442 display_region_map(int bmap, int unit_type, coord curx, coord cury,
443 char *arg1, char *arg2)
450 res = parse_map_arg(unit_type, arg1, &ns, &origin);
454 map_flags = parse_map_flags(bmap, arg2);
458 snxtsct_around(&ns, curx, cury);
463 if (map_flags & MAP_BMAP_REVERT)
464 return revert_bmap(&ns);
465 return draw_map(origin, map_flags, &ns);
469 bmaps_intersect(natid a, natid b)
471 char *mapa = ef_ptr(EF_MAP, a);
472 char *mapb = ef_ptr(EF_MAP, b);
475 for (i = 0; i < WORLD_SZ(); i++)
476 if (mapa[i] && mapa[i] != ' ' && mapb[i] && mapb[i] != ' ')
481 /* Note that this requires that the BMAP is mapped into memory */
484 share_bmap(natid from, natid to, struct nstr_sect *ns, char des,
487 char *from_bmap = ef_ptr(EF_BMAP, from);
488 char *to_bmap = ef_ptr(EF_BMAP, to);
493 char from_des = *from_name;
498 if (isalpha(from_des))
501 while (nxtsct(ns, §)) {
502 if (!(fromdes = from_bmap[sect.sct_uid]))
504 todes = to_bmap[sect.sct_uid];
507 todes != '.' && todes != ' ' && todes != from_des)
509 if (sect.sct_own == from) {
510 if (fromdes != '=' && fromdes != 'h' && fromdes != des)
513 if (todes == fromdes)
515 n += map_set(to, ns->x, ns->y, fromdes, 1);