2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2006, 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 * maps.c: Map routines
30 * Known contributors to this file:
50 #include "prototypes.h"
55 static int bmnxtsct(struct nstr_sect *);
56 static char map_char(unsigned char type, natid own, int owner_or_god);
59 do_map(int bmap, int unit_type, char *arg, char *map_flags_arg)
66 if (!snxtsct(&ns, arg)) {
67 if (unit_map(unit_type, atoi(arg), &ns, &origin))
70 for (b = map_flags_arg; b && *b; b++) {
74 map_flags |= MAP_SHIP;
78 map_flags |= MAP_LAND;
82 map_flags |= MAP_PLANE;
86 map_flags |= MAP_NUKE;
90 map_flags |= MAP_HIGH;
109 pr("Bad flag %c!\n", *b);
113 return draw_map(bmap, origin, map_flags, &ns);
117 draw_map(int bmap, char origin, int map_flags, struct nstr_sect *nsp)
128 /* Note this is not re-entrant anyway, so we keep the buffers
130 static unsigned char *bitmap = NULL;
131 static char *wmapbuf = NULL;
132 static char **wmap = NULL;
135 wmapbuf = malloc(WORLD_Y * MAPWIDTH(1));
137 wmap = malloc(WORLD_Y * sizeof(char *));
138 if (wmap && wmapbuf) {
139 for (i = 0; i < WORLD_Y; i++)
140 wmap[i] = &wmapbuf[MAPWIDTH(1) * i];
147 bitmap = malloc((WORLD_X * WORLD_Y) / 8);
148 if (!wmapbuf || !wmap || !bitmap) {
149 pr("Memory error, tell the deity.\n");
150 logerror("malloc failed in draw_map\n");
155 if (!confirm("Are you sure you want to revert your bmap? "))
158 if (!(player->command->c_flags & C_MOD)) {
159 logerror("%s command needs C_MOD flag set",
160 player->command->c_form);
161 player->command->c_flags |= C_MOD;
163 np = getnatp(player->cnum);
164 /* zap any conditionals */
166 xyrelrange(np, &nsp->range, &range);
167 border(&range, " ", "");
168 blankfill(wmapbuf, &nsp->range, 1);
177 while (bmnxtsct(nsp) && !player->aborted) {
178 if (0 != (c = player->bmap[sctoff(nsp->x, nsp->y)]))
179 wmap[nsp->dy][nsp->dx] = c;
183 while (bmnxtsct(nsp) && !player->aborted) {
184 if (0 != (c = player->map[sctoff(nsp->x, nsp->y)]))
185 wmap[nsp->dy][nsp->dx] = c;
189 while (bmnxtsct(nsp) && !player->aborted) {
190 player->bmap[sctoff(nsp->x, nsp->y)] =
191 player->map[sctoff(nsp->x, nsp->y)];
192 if (0 != (c = player->bmap[sctoff(nsp->x, nsp->y)]))
193 wmap[nsp->dy][nsp->dx] = c;
195 ef_write(EF_BMAP, player->cnum, player->bmap);
202 memset(bitmap, 0, (WORLD_X * WORLD_Y) / 8);
203 bitinit2(nsp, bitmap, player->cnum);
205 while (nxtsct(nsp, §) && !player->aborted) {
206 if (!player->god && !emp_getbit(nsp->x, nsp->y, bitmap))
208 wmap[nsp->dy][nsp->dx]
209 = map_char(sect.sct_newtype, sect.sct_own,
221 memset(bitmap, 0, (WORLD_X * WORLD_Y) / 8);
222 bitinit2(nsp, bitmap, player->cnum);
224 while (nxtsct(nsp, §) && !player->aborted) {
225 if (!player->god && !emp_getbit(nsp->x, nsp->y, bitmap))
227 mapch = map_char(sect.sct_type, sect.sct_own, player->owner);
228 wmap[nsp->dy][nsp->dx] = mapch;
229 changed |= map_set(player->cnum, nsp->x, nsp->y, mapch, 0);
232 writemap(player->cnum);
236 if (map_flags & MAP_PLANE) {
237 snxtitem_all(&ni, EF_PLANE);
238 while (nxtitem(&ni, &plane)) {
239 if (plane.pln_own == 0)
241 if (plane.pln_own != player->cnum && !player->god)
243 if (!xyinrange(plane.pln_x, plane.pln_y, &nsp->range))
246 x = xnorm(plane.pln_x - nsp->range.lx);
247 y = ynorm(plane.pln_y - nsp->range.ly);
248 wmap[y][x] = (*plchr[(int)plane.pln_type].pl_name) & ~0x20;
251 if (map_flags & MAP_SHIP) {
252 snxtitem_all(&ni, EF_SHIP);
253 while (nxtitem(&ni, &ship)) {
254 if (ship.shp_own == 0)
256 if (ship.shp_own != player->cnum && !player->god)
258 if (!xyinrange(ship.shp_x, ship.shp_y, &nsp->range))
261 x = xnorm(ship.shp_x - nsp->range.lx);
262 y = ynorm(ship.shp_y - nsp->range.ly);
263 wmap[y][x] = (*mchr[(int)ship.shp_type].m_name) & ~0x20;
266 if (map_flags & MAP_LAND) {
267 snxtitem_all(&ni, EF_LAND);
268 while (nxtitem(&ni, &land)) {
269 if (land.lnd_own == 0)
271 if (land.lnd_own != player->cnum && !player->god)
273 if (!xyinrange(land.lnd_x, land.lnd_y, &nsp->range))
276 x = xnorm(land.lnd_x - nsp->range.lx);
277 y = ynorm(land.lnd_y - nsp->range.ly);
278 wmap[y][x] = (*lchr[(int)land.lnd_type].l_name) & ~0x20;
281 if (map_flags & MAP_NUKE) {
282 snxtitem_all(&ni, EF_NUKE);
283 while (nxtitem(&ni, &nuke)) {
284 if (nuke.nuk_own == 0)
286 if (nuke.nuk_own != player->cnum && !player->god)
288 if (!xyinrange(nuke.nuk_x, nuke.nuk_y, &nsp->range))
291 x = xnorm(nuke.nuk_x - nsp->range.lx);
292 y = ynorm(nuke.nuk_y - nsp->range.ly);
296 if (map_flags & MAP_HIGH) {
301 memset(bitmap, 0, (WORLD_X * WORLD_Y) / 8);
302 bitinit2(nsp, bitmap, player->cnum);
304 while (nxtsct(nsp, §) && !player->aborted) {
305 if (!player->god && !emp_getbit(nsp->x, nsp->y, bitmap))
307 if (sect.sct_own == player->cnum)
308 wmap[nsp->dy][nsp->dx] |= 0x80;
312 wmap[5][10] = origin & ~0x20;
313 for (y = nsp->range.ly, i = 0; i < nsp->range.height; y++, i++) {
317 wmap[i][nsp->range.width] = '\0';
318 pr("%4d %s %-4d\n", yval, wmap[i], yval);
322 border(&range, " ", "");
327 * get the next sector in the range
330 bmnxtsct(struct nstr_sect *np)
335 if (np->x >= WORLD_X)
337 if (np->dx >= np->range.width) {
339 np->x = np->range.lx;
341 if (np->dy >= np->range.height)
344 if (np->y >= WORLD_Y)
347 if ((np->y + np->x) & 01)
349 if (np->type == NS_DIST) {
350 np->curdist = mapdist(np->x, np->y, np->cx, np->cy);
351 if (np->curdist > np->dist)
354 np->id = sctoff(np->x, np->y);
361 * Return character to use in maps for sector type TYPE owned by OWN.
362 * If OWNER_OR_GOD, the map is for the sector's owner or a deity.
365 map_char(unsigned char type, natid own, int owner_or_god)
367 if (CANT_HAPPEN(type > SCT_TYPE_MAX || !dchr[type].d_mnem))
370 || type == SCT_WATER || type == SCT_MOUNT || type == SCT_WASTE
371 || (!own && (type == SCT_RURAL || type == SCT_PLAINS)))
372 return dchr[type].d_mnem;
377 unit_map(int unit_type, int uid, struct nstr_sect *nsp, char *originp)
383 gp = get_empobjp(unit_type, uid);
384 if (!gp || !player->owner || gp->own == 0)
387 if (unit_type == EF_NUKE)
390 if ((name = emp_obj_chr_name(gp)) == NULL)
395 range.lx = xnorm(gp->x - 10);
396 range.hx = xnorm(gp->x + 11);
397 range.ly = ynorm(gp->y - 5);
398 range.hy = ynorm(gp->y + 6);
399 xysize_range(&range);
400 snxtsct_area(nsp, &range);
405 display_region_map(int bmap, int unit_type, coord curx, coord cury,
408 char coordinates[80];
414 np = getnatp(player->cnum);
415 sprintf(coordinates, "%d:%d,%d:%d",
416 xrel(np, curx - 10), xrel(np, curx + 11),
417 yrel(np, cury - 5), yrel(np, cury + 6));
421 map_flag_arg = strchr(arg, ' ');
422 if (map_flag_arg != NULL) {
423 *map_flag_arg++ = '\0';
424 while (isspace(*map_flag_arg)) map_flag_arg++;
427 player->condarg = NULL;
428 return do_map(bmap, unit_type, arg, map_flag_arg);
432 bmaps_intersect(natid a, natid b)
434 char *mapa = ef_ptr(EF_MAP, a);
435 char *mapb = ef_ptr(EF_MAP, b);
438 for (i = 0; i < WORLD_X * WORLD_Y / 2; ++i, ++mapa, ++mapb)
439 if (*mapa && *mapa != ' ' && *mapb && *mapb != ' ')
444 /* Note that this requires that the BMAP is mapped into memory */
447 share_bmap(natid from, natid to, struct nstr_sect *ns, char des,
450 char *from_bmap = ef_ptr(EF_BMAP, from);
451 char *to_bmap = ef_ptr(EF_BMAP, to);
456 char from_des = *from_name;
458 if (isalpha(from_des))
461 while (nxtsct(ns, §)) {
462 if (!(fromdes = from_bmap[sctoff(ns->x, ns->y)]))
464 todes = to_bmap[sctoff(ns->x, ns->y)];
467 todes != '.' && todes != ' ' && todes != from_des)
469 if (sect.sct_own == from) {
470 if (fromdes != '=' && fromdes != 'h' && fromdes != des)
473 if (todes == fromdes)
475 n += map_set(to, ns->x, ns->y, fromdes, 1);