/*
* Empire - A multi-player, client/server Internet based war game.
- * Copyright (C) 1986-2006, Dave Pare, Jeff Bailey, Thomas Ruschak,
+ * Copyright (C) 1986-2007, Dave Pare, Jeff Bailey, Thomas Ruschak,
* Ken Stevens, Steve McClure
*
* This program is free software; you can redistribute it and/or modify
#include <config.h>
+#include <ctype.h>
+#include "com.h"
+#include "empobj.h"
+#include "file.h"
+#include "land.h"
+#include "map.h"
#include "misc.h"
+#include "nat.h"
+#include "nsc.h"
+#include "nuke.h"
+#include "optlist.h"
+#include "plane.h"
#include "player.h"
+#include "prototypes.h"
#include "sect.h"
-#include "xy.h"
-#include "nsc.h"
-#include "file.h"
-#include "nat.h"
-#include "map.h"
#include "ship.h"
-#include "land.h"
-#include "plane.h"
-#include "common.h"
-#include "gen.h"
-#include "subs.h"
-#include "optlist.h"
+#include "xy.h"
static int bmnxtsct(struct nstr_sect *);
-static s_char map_char(u_char type, natid own, int owner_or_god);
+static char map_char(unsigned char type, natid own, int owner_or_god);
int
-draw_map(int bmap, s_char origin, int map_flags, struct nstr_sect *nsp)
+do_map(int bmap, int unit_type, char *arg, char *map_flags_arg)
+{
+ struct nstr_sect ns;
+ char origin = '\0';
+ char *b;
+ int map_flags = 0;
+
+ if (!snxtsct(&ns, arg)) {
+ if (unit_map(unit_type, atoi(arg), &ns, &origin))
+ return RET_FAIL;
+ }
+ for (b = map_flags_arg; b && *b; b++) {
+ switch (*b) {
+ case 's':
+ case 'S':
+ map_flags |= MAP_SHIP;
+ break;
+ case 'l':
+ case 'L':
+ map_flags |= MAP_LAND;
+ break;
+ case 'p':
+ case 'P':
+ map_flags |= MAP_PLANE;
+ break;
+ case 'n':
+ case 'N':
+ map_flags |= MAP_NUKE;
+ break;
+ case 'h':
+ case 'H':
+ map_flags |= MAP_HIGH;
+ break;
+ case '*':
+ map_flags |= MAP_ALL;
+ break;
+ case 't':
+ if (bmap != 'b')
+ goto bad_flag;
+ bmap = 't';
+ *(b + 1) = 0;
+ break;
+ case 'r':
+ if (bmap != 'b')
+ goto bad_flag;
+ bmap = 'r';
+ *(b + 1) = 0;
+ break;
+ default:
+ bad_flag:
+ pr("Bad flag %c!\n", *b);
+ break;
+ }
+ }
+ return draw_map(bmap, origin, map_flags, &ns);
+}
+
+int
+draw_map(int bmap, char origin, int map_flags, struct nstr_sect *nsp)
{
struct natstr *np;
struct range range;
struct nstr_item ni;
- struct shpstr ship;
- struct lndstr land;
- struct plnstr plane;
+ union empobj_storage unit;
coord x, y;
int i;
/* Note this is not re-entrant anyway, so we keep the buffers
around */
- static u_char *bitmap = NULL;
- static s_char *wmapbuf = NULL;
- static s_char **wmap = NULL;
+ static unsigned char *bitmap = NULL;
+ static char *wmapbuf = NULL;
+ static char **wmap = NULL;
+ static int ef_mappable[] = { EF_PLANE, EF_SHIP, EF_LAND, EF_NUKE, EF_BAD };
+ static int ef_unit_map[] = { MAP_PLANE, MAP_SHIP, MAP_LAND, MAP_NUKE };
+ char *name;
if (!wmapbuf)
- wmapbuf = malloc((WORLD_Y * MAPWIDTH(1)) * sizeof(s_char));
+ wmapbuf = malloc(WORLD_Y * MAPWIDTH(1));
if (!wmap) {
- wmap = malloc(WORLD_Y * sizeof(s_char *));
+ wmap = malloc(WORLD_Y * sizeof(char *));
if (wmap && wmapbuf) {
for (i = 0; i < WORLD_Y; i++)
wmap[i] = &wmapbuf[MAPWIDTH(1) * i];
nsp->ncond = 0;
xyrelrange(np, &nsp->range, &range);
border(&range, " ", "");
- blankfill((s_char *)wmapbuf, &nsp->range, 1);
+ blankfill(wmapbuf, &nsp->range, 1);
if (bmap) {
int c;
switch (bmap) {
default:
- CANT_HAPPEN("bad BMAP");
+ CANT_REACH();
bmap = 'b';
/* fall through */
case 'b':
}
} else {
struct sctstr sect;
- s_char mapch;
+ char mapch;
int changed = 0;
if (!player->god) {
}
if (player->aborted)
return RET_OK;
- if (map_flags & MAP_PLANE) {
- snxtitem_all(&ni, EF_PLANE);
- while (nxtitem(&ni, &plane)) {
- if (plane.pln_own == 0)
- continue;
- if (plane.pln_own != player->cnum && !player->god)
- continue;
- if (!xyinrange(plane.pln_x, plane.pln_y, &nsp->range))
- continue;
- x = xnorm(plane.pln_x - nsp->range.lx);
- y = ynorm(plane.pln_y - nsp->range.ly);
- wmap[y][x] = (*plchr[(int)plane.pln_type].pl_name) & ~0x20;
- }
- }
- if (map_flags & MAP_SHIP) {
- snxtitem_all(&ni, EF_SHIP);
- while (nxtitem(&ni, &ship)) {
- if (ship.shp_own == 0)
- continue;
- if (ship.shp_own != player->cnum && !player->god)
- continue;
- if (!xyinrange(ship.shp_x, ship.shp_y, &nsp->range))
- continue;
+ i = 0;
+ while (ef_mappable[i] != EF_BAD) {
+ if (map_flags & ef_unit_map[i]) {
+ snxtitem_all(&ni, ef_mappable[i]);
+ while (nxtitem(&ni, &unit)) {
+ if (unit.gen.own == 0)
+ continue;
+ if (unit.gen.own != player->cnum && !player->god)
+ continue;
+ if (!xyinrange(unit.gen.x, unit.gen.y, &nsp->range))
+ continue;
- x = xnorm(ship.shp_x - nsp->range.lx);
- y = ynorm(ship.shp_y - nsp->range.ly);
- wmap[y][x] = (*mchr[(int)ship.shp_type].m_name) & ~0x20;
- }
- }
- if (map_flags & MAP_LAND) {
- snxtitem_all(&ni, EF_LAND);
- while (nxtitem(&ni, &land)) {
- if (land.lnd_own == 0)
- continue;
- if (land.lnd_own != player->cnum && !player->god)
- continue;
- if (!xyinrange(land.lnd_x, land.lnd_y, &nsp->range))
- continue;
+ x = xnorm(unit.gen.x - nsp->range.lx);
+ y = ynorm(unit.gen.y - nsp->range.ly);
- x = xnorm(land.lnd_x - nsp->range.lx);
- y = ynorm(land.lnd_y - nsp->range.ly);
- wmap[y][x] = (*lchr[(int)land.lnd_type].l_name) & ~0x20;
+ if (ef_mappable[i] == EF_NUKE)
+ wmap[y][x] = 'N';
+ else {
+ if ((name = emp_obj_chr_name(&unit.gen)) == NULL)
+ return RET_FAIL;
+ wmap[y][x] = *name & ~0x20;
+ }
+ }
}
+ i++;
}
if (map_flags & MAP_HIGH) {
- s_char *ptr;
struct sctstr sect;
snxtsct_rewind(nsp);
while (nxtsct(nsp, §) && !player->aborted) {
if (!player->god && !emp_getbit(nsp->x, nsp->y, bitmap))
continue;
- ptr = &wmap[nsp->dy][nsp->dx];
if (sect.sct_own == player->cnum)
- *ptr |= 0x80;
+ wmap[nsp->dy][nsp->dx] |= 0x80;
}
}
if (origin)
* Return character to use in maps for sector type TYPE owned by OWN.
* If OWNER_OR_GOD, the map is for the sector's owner or a deity.
*/
-static s_char
-map_char(u_char type, natid own, int owner_or_god)
+static char
+map_char(unsigned char type, natid own, int owner_or_god)
{
- if (type > SCT_MAXDEF) {
- logerror("bad sector type %d\n", type);
+ if (CANT_HAPPEN(type > SCT_TYPE_MAX || !dchr[type].d_mnem))
return '?';
- }
if (owner_or_god
|| type == SCT_WATER || type == SCT_MOUNT || type == SCT_WASTE
|| (!own && (type == SCT_RURAL || type == SCT_PLAINS)))
}
int
-unit_map(int unit_type, int i, struct nstr_sect *nsp, s_char *originp)
+unit_map(int unit_type, int uid, struct nstr_sect *nsp, char *originp)
{
- struct shpstr origs;
- struct lndstr origl;
- struct plnstr origp;
- s_char what[64];
- struct natstr *np;
+ struct empobj *gp;
+ struct range range;
+ char *name;
- np = getnatp(player->cnum);
- if (unit_type == EF_LAND) {
- if (!getland(i, &origl) ||
- (origl.lnd_own != player->cnum && !player->god) ||
- (origl.lnd_own == 0))
- return RET_FAIL;
- sprintf(what, "%d:%d,%d:%d", xrel(np, origl.lnd_x - 10),
- xrel(np, origl.lnd_x + 10),
- yrel(np, origl.lnd_y - 5), yrel(np, origl.lnd_y + 5));
- *originp = *lchr[(int)origl.lnd_type].l_name;
- } else if (unit_type == EF_PLANE) {
- if (!getplane(i, &origp) ||
- (origp.pln_own != player->cnum && !player->god) ||
- (origp.pln_own == 0))
- return RET_FAIL;
- sprintf(what, "%d:%d,%d:%d", xrel(np, origp.pln_x - 10),
- xrel(np, origp.pln_x + 10),
- yrel(np, origp.pln_y - 5), yrel(np, origp.pln_y + 5));
- *originp = *plchr[(int)origp.pln_type].pl_name;
- } else {
- if (!getship(i, &origs) ||
- (origs.shp_own != player->cnum && !player->god) ||
- (origs.shp_own == 0))
+ gp = get_empobjp(unit_type, uid);
+ if (!gp || (gp->own != player->cnum && !player->god) || gp->own == 0)
+ return RET_FAIL;
+
+ if (unit_type == EF_NUKE)
+ *originp = 'n';
+ else {
+ if ((name = emp_obj_chr_name(gp)) == NULL)
return RET_FAIL;
- sprintf(what, "%d:%d,%d:%d", xrel(np, origs.shp_x - 10),
- xrel(np, origs.shp_x + 10),
- yrel(np, origs.shp_y - 5), yrel(np, origs.shp_y + 5));
- unit_type = EF_SHIP;
- *originp = *mchr[(int)origs.shp_type].m_name;
+ *originp = *name;
}
- if (!snxtsct(nsp, what))
- return RET_FAIL;
+
+ range.lx = xnorm(gp->x - 10);
+ range.hx = xnorm(gp->x + 11);
+ range.ly = ynorm(gp->y - 5);
+ range.hy = ynorm(gp->y + 6);
+ xysize_range(&range);
+ snxtsct_area(nsp, &range);
return RET_OK;
}
+int
+display_region_map(int bmap, int unit_type, coord curx, coord cury,
+ char *arg)
+{
+ char coordinates[80];
+ char *map_flag_arg;
+
+ if (!arg || !*arg) {
+ struct natstr *np;
+
+ np = getnatp(player->cnum);
+ sprintf(coordinates, "%d:%d,%d:%d",
+ xrel(np, curx - 10), xrel(np, curx + 11),
+ yrel(np, cury - 5), yrel(np, cury + 6));
+ arg = coordinates;
+ map_flag_arg = NULL;
+ } else {
+ map_flag_arg = strchr(arg, ' ');
+ if (map_flag_arg != NULL) {
+ *map_flag_arg++ = '\0';
+ while (isspace(*map_flag_arg)) map_flag_arg++;
+ }
+ }
+ player->condarg = NULL;
+ return do_map(bmap, unit_type, arg, map_flag_arg);
+}
+
int
bmaps_intersect(natid a, natid b)
{
- s_char *mapa = ef_ptr(EF_MAP, a);
- s_char *mapb = ef_ptr(EF_MAP, b);
+ char *mapa = ef_ptr(EF_MAP, a);
+ char *mapb = ef_ptr(EF_MAP, b);
int i;
for (i = 0; i < WORLD_X * WORLD_Y / 2; ++i, ++mapa, ++mapb)
/* Note that this requires that the BMAP is mapped into memory */
int
-share_bmap(natid from, natid to, struct nstr_sect *ns, s_char des,
- s_char *from_name)
+share_bmap(natid from, natid to, struct nstr_sect *ns, char des,
+ char *from_name)
{
- s_char *from_bmap = ef_ptr(EF_BMAP, from);
- s_char *to_bmap = ef_ptr(EF_BMAP, to);
+ char *from_bmap = ef_ptr(EF_BMAP, from);
+ char *to_bmap = ef_ptr(EF_BMAP, to);
int n = 0;
struct sctstr sect;
- s_char fromdes;
- s_char todes;
- s_char from_des = *from_name;
+ char fromdes;
+ char todes;
+ char from_des = *from_name;
if (isalpha(from_des))
from_des &= ~0x20;