/*
* Empire - A multi-player, client/server Internet based war game.
- * Copyright (C) 1986-2014, Dave Pare, Jeff Bailey, Thomas Ruschak,
+ * Copyright (C) 1986-2015, Dave Pare, Jeff Bailey, Thomas Ruschak,
* Ken Stevens, Steve McClure, Markus Armbruster
*
* Empire is free software: you can redistribute it and/or modify
#include "unit.h"
#include "xy.h"
+static void shp_nav_put_one(struct ulist *);
static int shp_check_one_mines(struct ulist *);
static int shp_hit_mine(struct shpstr *);
static void shp_stays(natid, char *, struct ulist *);
+static struct ulist *
+shp_find_capable(struct emp_qelem *list, int flags)
+{
+ struct emp_qelem *qp;
+ struct ulist *mlp;
+
+ for (qp = list->q_back; qp != list; qp = qp->q_back) {
+ mlp = (struct ulist *)qp;
+ if (mchr[mlp->unit.ship.shp_type].m_flags & flags)
+ return mlp;
+ }
+ return NULL;
+}
+
void
shp_sel(struct nstr_item *ni, struct emp_qelem *list)
{
{
struct ulist *mlp = malloc(sizeof(struct ulist));
- mlp->chrp = (struct empobj_chr *)&mchr[sp->shp_type];
mlp->unit.ship = *sp;
mlp->mobil = sp->shp_mobil;
emp_insque(&mlp->queue, list);
/* This function assumes that the list was created by shp_sel */
void
shp_nav(struct emp_qelem *list, double *minmobp, double *maxmobp,
- int *togetherp, natid actor)
+ natid actor)
{
struct emp_qelem *qp;
struct emp_qelem *next;
struct ulist *mlp;
- struct shpstr *sp;
+ struct shpstr *sp, *flg = NULL;
struct sctstr sect;
- coord allx;
- coord ally;
- int first = 1;
*minmobp = 9876.0;
*maxmobp = -9876.0;
- *togetherp = 1;
for (qp = list->q_back; qp != list; qp = next) {
next = qp->q_back;
mlp = (struct ulist *)qp;
free(mlp);
continue;
}
- if (opt_SAIL) {
- if (*sp->shp_path && !update_running) {
- shp_stays(actor, "has a sail path", mlp);
- mpr(actor, "Use `sail <#> -' to reset\n");
- continue;
- }
- }
/* check crew - uws don't count */
if (sp->shp_item[I_MILIT] == 0 && sp->shp_item[I_CIVIL] == 0) {
shp_stays(actor, "is crewless", mlp);
continue;
}
switch (shp_check_nav(sp, §)) {
- case NAV_02:
- case NAV_60:
+ case SHP_STUCK_NOT:
+ break;
+ case SHP_STUCK_CONSTRUCTION:
shp_stays(actor, "is caught in a construction zone", mlp);
continue;
- case NAV_NONE:
- case NAV_CANAL:
- shp_stays(actor, "is landlocked", mlp);
- continue;
- case NAVOK:
- break;
default:
CANT_REACH();
- shp_stays(actor, "was just swallowed by a big green worm", mlp);
+ /* fall through */
+ case SHP_STUCK_CANAL:
+ case SHP_STUCK_IMPASSABLE:
+ shp_stays(actor, "is landlocked", mlp);
continue;
}
- if (first) {
- allx = sp->shp_x;
- ally = sp->shp_y;
- first = 0;
+ if (!flg)
+ flg = sp;
+ else if (sp->shp_x != flg->shp_x || sp->shp_y != flg->shp_y) {
+ shp_stays(actor, "is not with the flagship", mlp);
+ continue;
}
- if (sp->shp_x != allx || sp->shp_y != ally)
- *togetherp = 0;
if (sp->shp_mobil + 1 < (int)mlp->mobil) {
mlp->mobil = sp->shp_mobil;
}
}
}
-void
-shp_put(struct emp_qelem *list, natid actor)
+static void
+shp_nav_put(struct emp_qelem *list, natid actor)
{
struct emp_qelem *qp, *next;
struct ulist *mlp;
sp = &mlp->unit.ship;
mpr(actor, "%s stopped at %s\n",
prship(sp), xyas(sp->shp_x, sp->shp_y, actor));
- sp->shp_mobil = (int)mlp->mobil;
- putship(sp->shp_uid, sp);
- emp_remque(qp);
- free(qp);
+ shp_nav_put_one(mlp);
}
}
+static void
+shp_nav_put_one(struct ulist *mlp)
+{
+ mlp->unit.ship.shp_mobil = (int)mlp->mobil;
+ putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
+ emp_remque(&mlp->queue);
+ free(mlp);
+}
+
+/*
+ * Sweep seamines with engineers in SHIP_LIST for ACTOR.
+ * All ships in SHIP_LIST must be in the same sector.
+ * If EXPLICIT is non-zero, this is for an explicit sweep command from
+ * a player. Else it's an automatic "on the move" sweep.
+ * If TAKEMOB is non-zero, require and charge mobility.
+ * Return non-zero when the ships should stop.
+ */
int
-shp_sweep(struct emp_qelem *ship_list, int verbose, int takemob, natid actor)
+shp_sweep(struct emp_qelem *ship_list, int explicit, int takemob,
+ natid actor)
{
struct emp_qelem *qp;
struct emp_qelem *next;
struct sctstr sect;
int mines, m, max, shells;
int changed = 0;
- int stopping = 0;
+ int stopping = 0, first = 1;
+
+ mlp = shp_find_capable(ship_list, M_SWEEP);
+ if (!mlp) {
+ if (explicit)
+ mpr(actor, "No minesweepers!\n");
+ return 0;
+ }
+
+ getsect(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, §);
+ if (sect.sct_type != SCT_WATER) {
+ if (explicit)
+ mpr(actor, "%s is a %s. No seamines there!\n",
+ xyas(sect.sct_x, sect.sct_y, actor),
+ dchr[sect.sct_type].d_name);
+ return 0;
+ }
for (qp = ship_list->q_back; qp != ship_list; qp = next) {
next = qp->q_back;
mlp = (struct ulist *)qp;
- if (!(((struct mchrstr *)mlp->chrp)->m_flags & M_SWEEP)) {
- if (verbose)
- mpr(actor, "%s doesn't have minesweeping capability!\n",
- prship(&mlp->unit.ship));
- continue;
- }
- if (takemob && mlp->mobil <= 0.0) {
- if (verbose)
- mpr(actor, "%s is out of mobility!\n",
- prship(&mlp->unit.ship));
+ if (!(mchr[mlp->unit.ship.shp_type].m_flags & M_SWEEP))
continue;
- }
- getsect(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, §);
- if (sect.sct_type != SCT_WATER) {
- if (verbose)
- mpr(actor, "%s is not at sea. No mines there!\n",
- prship(&mlp->unit.ship));
- continue;
- }
if (takemob) {
+ if (mlp->mobil <= 0.0) {
+ if (explicit)
+ mpr(actor, "%s is out of mobility!\n",
+ prship(&mlp->unit.ship));
+ continue;
+ }
mlp->mobil -= shp_mobcost(&mlp->unit.ship);
mlp->unit.ship.shp_mobil = (int)mlp->mobil;
}
putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
+ getsect(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, §);
if (!(mines = sect.sct_mines))
continue;
- max = ((struct mchrstr *)mlp->chrp)->m_item[I_SHELL];
+ max = mchr[mlp->unit.ship.shp_type].m_item[I_SHELL];
shells = mlp->unit.ship.shp_item[I_SHELL];
for (m = 0; mines > 0 && m < 5; m++) {
if (chance(0.66)) {
+ if (first) {
+ mpr(actor, "Approaching minefield at %s...\n",
+ xyas(sect.sct_x, sect.sct_y, actor));
+ first = 0;
+ }
mpr(actor, "Sweep...\n");
mines--;
shells = MIN(max, shells + 1);
mpr(actor, "%s %s & stays in %s\n",
prship(&mlp->unit.ship), str,
xyas(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, actor));
- mlp->unit.ship.shp_mobil = (int)mlp->mobil;
- putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
- emp_remque(&mlp->queue);
- free(mlp);
+ shp_nav_put_one(mlp);
}
/*
- * Can SP navigate in SECTP?
- * Sector ownership is *not* considered!
- * Return NAVOK when yes.
- * Return NAV_02 when it could if the sector was at least 2% efficient.
- * Return NAV_60 when it could if the sector was at least 60% efficient.
- * Return NAV_CANAL when it lacks capability M_CANAL.
- * Return NAV_NONE when this sector type isn't navigable at all.
+ * Return whether and why SP would be stuck in SECTP.
*/
-enum d_navigation
+enum shp_stuck
shp_check_nav(struct shpstr *sp, struct sctstr *sectp)
{
switch (dchr[sectp->sct_type].d_nav) {
case NAVOK:
break;
case NAV_CANAL:
- if (mchr[sp->shp_type].m_flags & M_CANAL) {
- if (sectp->sct_effic < 2)
- return NAV_02;
- } else
- return NAV_CANAL;
- break;
+ if (!(mchr[sp->shp_type].m_flags & M_CANAL)) {
+ return SHP_STUCK_CANAL;
+ }
+ /* fall through */
case NAV_02:
if (sectp->sct_effic < 2)
- return NAV_02;
+ return SHP_STUCK_CONSTRUCTION;
break;
case NAV_60:
if (sectp->sct_effic < 60)
- return NAV_60;
+ return SHP_STUCK_CONSTRUCTION;
break;
default:
CANT_REACH();
+ /* fall through */
case NAV_NONE:
- return NAV_NONE;
+ return SHP_STUCK_IMPASSABLE;
}
- return NAVOK;
+ return SHP_STUCK_NOT;
}
int
if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
continue;
if (wantflags &&
- (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
+ (mchr[mlp->unit.ship.shp_type].m_flags & wantflags) != wantflags)
continue;
if (nowantflags &&
- ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
+ mchr[mlp->unit.ship.shp_type].m_flags & nowantflags)
continue;
++count;
}
if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
continue;
if (wantflags &&
- (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
+ (mchr[mlp->unit.ship.shp_type].m_flags & wantflags) != wantflags)
continue;
if (nowantflags &&
- ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
+ mchr[mlp->unit.ship.shp_type].m_flags & nowantflags)
continue;
shp_damage_one(mlp, dam);
}
if (newx != mlp->unit.ship.shp_x || newy != mlp->unit.ship.shp_y)
continue;
if (wantflags &&
- (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
+ (mchr[mlp->unit.ship.shp_type].m_flags & wantflags) != wantflags)
continue;
if (nowantflags &&
- ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
+ mchr[mlp->unit.ship.shp_type].m_flags & nowantflags)
continue;
return 1;
}
mlp = (struct ulist *)qp;
if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
continue;
- if (((struct mchrstr *)mlp->chrp)->m_flags & M_SUB)
+ if (mchr[mlp->unit.ship.shp_type].m_flags & M_SUB)
continue;
- if (!((struct mchrstr *)mlp->chrp)->m_nxlight &&
- !((struct mchrstr *)mlp->chrp)->m_nchoppers &&
- ((struct mchrstr *)mlp->chrp)->m_cost < 1000 &&
- !((struct mchrstr *)mlp->chrp)->m_nplanes &&
- !((struct mchrstr *)mlp->chrp)->m_nland)
+ if (!mchr[mlp->unit.ship.shp_type].m_nxlight &&
+ !mchr[mlp->unit.ship.shp_type].m_nchoppers &&
+ mchr[mlp->unit.ship.shp_type].m_cost < 1000 &&
+ !mchr[mlp->unit.ship.shp_type].m_nplanes &&
+ !mchr[mlp->unit.ship.shp_type].m_nland)
continue;
if (!mvs) {
mvs = mlp;
continue;
}
- if (((struct mchrstr *)mlp->chrp)->m_cost * mlp->unit.ship.shp_effic >
- ((struct mchrstr *)mvs->chrp)->m_cost * mvs->unit.ship.shp_effic)
+ if (mchr[mlp->unit.ship.shp_type].m_cost * mlp->unit.ship.shp_effic >
+ mchr[mvs->unit.ship.shp_type].m_cost * mvs->unit.ship.shp_effic)
mvs = mlp;
}
return mvs;
next = qp->q_back;
mlp = (struct ulist *)qp;
if (wantflags &&
- (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
+ (mchr[mlp->unit.ship.shp_type].m_flags & wantflags) != wantflags)
continue;
if (nowantflags &&
- ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
+ mchr[mlp->unit.ship.shp_type].m_flags & nowantflags)
continue;
hard = shp_hardtarget(&mlp->unit.ship);
if (hard < easiest)
for (qp = list->q_back; qp != list; qp = next) {
next = qp->q_back;
mlp = (struct ulist *)qp;
- if (((struct mchrstr *)mlp->chrp)->m_flags & M_SUB)
+ if (mchr[mlp->unit.ship.shp_type].m_flags & M_SUB)
continue;
if (natp->nat_flags & NF_COASTWATCH)
wu(0, sectp->sct_own,
}
int
-shp_nav_one_sector(struct emp_qelem *list, int dir, natid actor,
- int together)
+shp_nav_one_sector(struct emp_qelem *list, int dir, natid actor)
{
struct sctstr sect;
struct emp_qelem *qp;
struct emp_qelem *next;
struct ulist *mlp;
- struct emp_qelem done;
coord dx;
coord dy;
coord newx;
coord newy;
+ int move;
+ enum shp_stuck stuck;
int stopping = 0;
double mobcost;
char dp[80];
- int navigate;
+
+ if (CANT_HAPPEN(QEMPTY(list)))
+ return 1;
if (dir <= DIR_STOP || dir >= DIR_VIEW) {
- shp_put(list, actor);
+ shp_nav_put(list, actor);
return 1;
}
dx = diroff[dir][0];
dy = diroff[dir][1];
+
+ mlp = (struct ulist *)list->q_back;
+ newx = xnorm(mlp->unit.ship.shp_x + dx);
+ newy = ynorm(mlp->unit.ship.shp_y + dy);
+ getsect(newx, newy, §);
+
+ if (sect.sct_own && relations_with(sect.sct_own, actor) < FRIENDLY) {
+ mpr(actor, "can't go to %s\n", xyas(newx, newy, actor));
+ return 1;
+ }
+
+ move = 0;
for (qp = list->q_back; qp != list; qp = next) {
next = qp->q_back;
mlp = (struct ulist *)qp;
- newx = xnorm(mlp->unit.ship.shp_x + dx);
- newy = ynorm(mlp->unit.ship.shp_y + dy);
- getsect(newx, newy, §);
- navigate = shp_check_nav(&mlp->unit.ship, §);
- if (navigate != NAVOK ||
- (sect.sct_own
- && relations_with(sect.sct_own, actor) < FRIENDLY)) {
- if (navigate == NAV_CANAL)
- sprintf(dp,
- "is too large to fit into the canal system at %s",
- xyas(newx, newy, actor));
- else
- sprintf(dp, "can't go to %s", xyas(newx, newy, actor));
- if (together) {
- mpr(actor, "%s\n", dp);
- return 2;
- } else {
- shp_stays(actor, dp, mlp);
- continue;
- }
+ switch (shp_check_nav(&mlp->unit.ship, §)) {
+ case SHP_STUCK_NOT:
+ move = 1;
+ break;
+ case SHP_STUCK_CANAL:
+ break;
+ default:
+ CANT_REACH();
+ /* fall through */
+ case SHP_STUCK_CONSTRUCTION:
+ case SHP_STUCK_IMPASSABLE:
+ mpr(actor, "can't go to %s\n", xyas(newx, newy, actor));
+ return 1;
+ }
+ }
+ if (!move) {
+ mpr(actor, "is too large to fit into the canal system at %s\n",
+ xyas(newx, newy, actor));
+ return 1;
+ }
+
+ for (qp = list->q_back; qp != list; qp = next) {
+ next = qp->q_back;
+ mlp = (struct ulist *)qp;
+ stuck = shp_check_nav(&mlp->unit.ship, §);
+ if (stuck == SHP_STUCK_CANAL) {
+ sprintf(dp,
+ "is too large to fit into the canal system at %s",
+ xyas(newx, newy, actor));
+ shp_stays(actor, dp, mlp);
+ continue;
+ } else if (CANT_HAPPEN(stuck != SHP_STUCK_NOT)) {
+ sprintf(dp, "can't go to %s", xyas(newx, newy, actor));
+ shp_stays(actor, dp, mlp);
+ continue;
}
if (mlp->mobil <= 0.0) {
rad_map_set(mlp->unit.ship.shp_own,
mlp->unit.ship.shp_x, mlp->unit.ship.shp_y,
mlp->unit.ship.shp_effic, mlp->unit.ship.shp_tech,
- ((struct mchrstr *)mlp->chrp)->m_vrnge);
+ mchr[mlp->unit.ship.shp_type].m_vrnge);
}
if (QEMPTY(list))
return stopping;
stopping |= shp_check_mines(list);
if (QEMPTY(list))
return stopping;
-
- /* interdict ships sector by sector */
- emp_initque(&done);
- while (!QEMPTY(list)) {
- mlp = (struct ulist *)list->q_back;
- newx = mlp->unit.ship.shp_x;
- newy = mlp->unit.ship.shp_y;
- stopping |= shp_interdict(list, newx, newy, actor);
- /* move survivors in this sector to done */
- for (qp = list->q_back; qp != list; qp = next) {
- next = qp->q_back;
- mlp = (struct ulist *)qp;
- if (mlp->unit.ship.shp_x == newx &&
- mlp->unit.ship.shp_y == newy) {
- emp_remque(qp);
- emp_insque(qp, &done);
- }
- }
- }
- /* assign surviving ships back to list */
- emp_insque(list, &done);
- emp_remque(&done);
+ stopping |= shp_interdict(list, newx, newy, actor);
return stopping;
}
projects / empserver / blobdiff