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)
return 0;
}
+ if (opt_MARKET && ontradingblock(EF_SHIP, sp)) {
+ mpr(sp->shp_own, "%s is on the trading block%s\n",
+ prship(sp), suffix);
+ return 0;
+ }
+
if (sp->shp_item[I_MILIT] == 0 && sp->shp_item[I_CIVIL] == 0) {
mpr(sp->shp_own, "%s is crewless%s\n", prship(sp), suffix);
return 0;
void
shp_sel(struct nstr_item *ni, struct emp_qelem *list)
{
- struct shpstr ship;
+ struct shpstr ship, *flg = NULL;
+ struct ulist *mlp;
emp_initque(list);
while (nxtitem(ni, &ship)) {
*/
if (!ship.shp_own || ship.shp_own != player->cnum)
continue;
- if (opt_MARKET) {
- if (ontradingblock(EF_SHIP, &ship)) {
- pr("ship #%d inelligible - it's for sale.\n",
- ship.shp_uid);
- continue;
- }
- }
+ if (!shp_may_nav(&ship, flg, ""))
+ continue;
+
ship.shp_mission = 0;
ship.shp_rflags = 0;
memset(ship.shp_rpath, 0, sizeof(ship.shp_rpath));
putship(ship.shp_uid, &ship);
- shp_insque(&ship, list);
+ mlp = shp_insque(&ship, list);
+ if (!flg)
+ flg = &mlp->unit.ship;
}
}
return mlp;
}
-/* This function assumes that the list was created by shp_sel */
void
-shp_nav(struct emp_qelem *list, double *minmobp, double *maxmobp,
- natid actor)
+shp_nav_stay_behind(struct emp_qelem *list, natid actor)
{
struct emp_qelem *qp;
struct emp_qelem *next;
struct shpstr *sp, *flg = NULL;
char and_stays[32];
- *minmobp = 9876.0;
- *maxmobp = -9876.0;
for (qp = list->q_back; qp != list; qp = next) {
next = qp->q_back;
mlp = (struct ulist *)qp;
if (sp->shp_mobil + 1 < (int)mlp->mobil) {
mlp->mobil = sp->shp_mobil;
}
- if (mlp->mobil < *minmobp)
- *minmobp = mlp->mobil;
- if (mlp->mobil > *maxmobp)
- *maxmobp = mlp->mobil;
}
}
-static void
+void
shp_nav_put(struct emp_qelem *list, natid actor)
{
struct emp_qelem *qp, *next;
mlp->unit.ship.shp_item[I_SHELL] = shells;
putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
putsect(§);
- if (shp_check_one_mines(mlp)) {
- stopping = 1;
- emp_remque(qp);
- free(qp);
- }
+ stopping |= shp_check_one_mines(mlp);
}
if (changed)
writemap(actor);
writemap(actor);
putsect(§);
putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
- if (!mlp->unit.ship.shp_own)
- return 1;
+ if (!mlp->unit.ship.shp_own) {
+ emp_remque(&mlp->queue);
+ free(mlp);
+ }
+ return 1;
}
return 0;
}
{
struct emp_qelem *qp;
struct emp_qelem *next;
- struct ulist *mlp;
int stopping = 0;
for (qp = ship_list->q_back; qp != ship_list; qp = next) {
next = qp->q_back;
- mlp = (struct ulist *)qp;
- if (shp_check_one_mines(mlp)) {
- stopping = 1;
- emp_remque(qp);
- free(qp);
- }
+ stopping |= shp_check_one_mines((struct ulist *)qp);
}
return stopping;
}
-
-static void
-shp_stays(natid actor, char *str, struct ulist *mlp)
-{
- 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));
- shp_nav_put_one(mlp);
-}
-
/*
* Return whether and why SP would be stuck in SECTP.
*/
}
int
-shp_nav_one_sector(struct emp_qelem *list, int dir, natid actor)
+shp_nav_dir(struct emp_qelem *list, int dir, natid actor)
{
struct sctstr sect;
struct emp_qelem *qp;
coord newy;
int move;
enum shp_stuck stuck;
- int stopping = 0;
double mobcost;
- char dp[80];
if (CANT_HAPPEN(QEMPTY(list)))
return 1;
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);
+ mpr(actor,
+ "%s is too large to fit into the canal system at %s"
+ " & stays in %s\n",
+ prship(&mlp->unit.ship), xyas(newx, newy, actor),
+ xyas(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, actor));
+ shp_nav_put_one(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);
+ mpr(actor, "%s can't go to %s & stays in %s\n",
+ prship(&mlp->unit.ship), xyas(newx, newy, actor),
+ xyas(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, actor));
+ shp_nav_put_one(mlp);
continue;
}
if (mlp->mobil <= 0.0) {
- shp_stays(actor, "is out of mobility", mlp);
+ mpr(actor, "%s is out of mobility & stays in %s\n",
+ prship(&mlp->unit.ship),
+ xyas(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, actor));
+ shp_nav_put_one(mlp);
continue;
}
mobcost = shp_mobcost(&mlp->unit.ship);
}
mlp->unit.ship.shp_mobil = (int)mlp->mobil;
putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
-
- /* Now update the map for this ship */
- 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,
- mchr[mlp->unit.ship.shp_type].m_vrnge);
}
- if (QEMPTY(list))
- return stopping;
- stopping |= shp_sweep(list, 0, 0, actor);
+
+ return 0;
+}
+
+int
+shp_nav_gauntlet(struct emp_qelem *list, int interdict, natid actor)
+{
+ struct ulist *mlp = (struct ulist *)list->q_back;
+ coord newx = mlp->unit.ship.shp_x;
+ coord newy = mlp->unit.ship.shp_y;
+ int stopping;
+
+ stopping = shp_sweep(list, 0, 0, actor);
if (QEMPTY(list))
return stopping;
stopping |= shp_check_mines(list);
if (QEMPTY(list))
return stopping;
- stopping |= shp_interdict(list, newx, newy, actor);
+ if (interdict)
+ stopping |= shp_interdict(list, newx, newy, actor);
return stopping;
}