This reverts commit df8a1ffc1b
.
Because it breaks group retreat. Trivial conflicts due to the removal
of option SAIL.
Signed-off-by: Markus Armbruster <armbru@pond.sub.org>
Conflicts:
src/lib/subs/retreat.c
tests/retreat/journal.log
431 lines
11 KiB
C
431 lines
11 KiB
C
/*
|
|
* Empire - A multi-player, client/server Internet based war game.
|
|
* 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
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*
|
|
* ---
|
|
*
|
|
* See files README, COPYING and CREDITS in the root of the source
|
|
* tree for related information and legal notices. It is expected
|
|
* that future projects/authors will amend these files as needed.
|
|
*
|
|
* ---
|
|
*
|
|
* retreat.c: Retreat subroutines
|
|
*
|
|
* Known contributors to this file:
|
|
* Steve McClure, 2000
|
|
* Ron Koenderink, 2005-2006
|
|
* Markus Armbruster, 2006-2014
|
|
*/
|
|
|
|
#include <config.h>
|
|
|
|
#include "chance.h"
|
|
#include "damage.h"
|
|
#include "file.h"
|
|
#include "land.h"
|
|
#include "map.h"
|
|
#include "misc.h"
|
|
#include "nat.h"
|
|
#include "news.h"
|
|
#include "nsc.h"
|
|
#include "optlist.h"
|
|
#include "path.h"
|
|
#include "player.h"
|
|
#include "prototypes.h"
|
|
#include "retreat.h"
|
|
#include "sect.h"
|
|
#include "ship.h"
|
|
#include "xy.h"
|
|
|
|
static int findcondition(char);
|
|
static int retreat_land1(struct lndstr *, char, int);
|
|
static int retreat_ship1(struct shpstr *, char, int);
|
|
|
|
struct ccode {
|
|
char code;
|
|
char *desc[2];
|
|
};
|
|
|
|
static struct ccode conditions[] = {
|
|
{ 'i', { "retreated with a damaged friend",
|
|
"was damaged" } },
|
|
{ 't', { "retreated with a torpedoed ship",
|
|
"was hit by a torpedo" } },
|
|
{ 's', { "retreated with a ship scared by sonar",
|
|
"detected a sonar ping" } },
|
|
{ 'h', { "retreated with a helpless ship",
|
|
"was fired upon with no one able to defend it" } },
|
|
{ 'b', { "retreated with a bombed friend",
|
|
"was bombed" } },
|
|
{ 'd', { "retreated with a depth-charged ship",
|
|
"was depth-charged" } },
|
|
{ 'u', { "retreated with a boarded ship", "was boarded" } },
|
|
{ 0, { "panicked", "panicked"} }
|
|
};
|
|
|
|
void
|
|
retreat_ship(struct shpstr *sp, char code)
|
|
{
|
|
struct nstr_item ni;
|
|
struct shpstr ship;
|
|
|
|
if (CANT_HAPPEN(!sp->shp_own))
|
|
return;
|
|
if (sp->shp_own == player->cnum)
|
|
return;
|
|
|
|
retreat_ship1(sp, code, 1);
|
|
|
|
if (sp->shp_rflags & RET_GROUP) {
|
|
snxtitem_group(&ni, EF_SHIP, sp->shp_fleet);
|
|
while (nxtitem(&ni, &ship)) {
|
|
if (ship.shp_own != sp->shp_own || ship.shp_uid == sp->shp_uid)
|
|
continue;
|
|
if (retreat_ship1(&ship, code, 0))
|
|
putship(ship.shp_uid, &ship);
|
|
}
|
|
}
|
|
}
|
|
|
|
static int
|
|
retreat_ship1(struct shpstr *sp, char code, int orig)
|
|
|
|
|
|
/* Is this the originally scared ship, or a follower */
|
|
{
|
|
struct sctstr sect;
|
|
int i;
|
|
int m;
|
|
int max;
|
|
int dir;
|
|
coord newx;
|
|
coord newy;
|
|
coord dx;
|
|
coord dy;
|
|
int mines;
|
|
int shells;
|
|
double mobcost;
|
|
struct mchrstr *mcp;
|
|
int changed;
|
|
|
|
if (sp->shp_effic < SHIP_MINEFF) {
|
|
wu(0, sp->shp_own,
|
|
"%s %s,\nbut it died in the attack, and so couldn't retreat!\n",
|
|
prship(sp), conditions[findcondition(code)].desc[orig]);
|
|
if (!orig)
|
|
putship(sp->shp_uid, sp);
|
|
return 0;
|
|
}
|
|
|
|
/* check crew - uws don't count */
|
|
if (sp->shp_item[I_MILIT] == 0 && sp->shp_item[I_CIVIL] == 0) {
|
|
wu(0, sp->shp_own,
|
|
"%s %s,\nbut had no crew, and couldn't retreat!\n", prship(sp),
|
|
conditions[findcondition(code)].desc[orig]);
|
|
return 0;
|
|
}
|
|
|
|
getsect(sp->shp_x, sp->shp_y, §);
|
|
switch (shp_check_nav(sp, §)) {
|
|
case SHP_STUCK_NOT:
|
|
break;
|
|
case SHP_STUCK_CONSTRUCTION:
|
|
wu(0, sp->shp_own,
|
|
"%s %s,\nbut was caught in a construction zone, and couldn't retreat!\n",
|
|
prship(sp), conditions[findcondition(code)].desc[orig]);
|
|
return 0;
|
|
default:
|
|
CANT_REACH();
|
|
/* fall through */
|
|
case SHP_STUCK_CANAL:
|
|
case SHP_STUCK_IMPASSABLE:
|
|
wu(0, sp->shp_own,
|
|
"%s %s,\nbut was landlocked, and couldn't retreat!\n",
|
|
prship(sp), conditions[findcondition(code)].desc[orig]);
|
|
return 0;
|
|
}
|
|
|
|
if (sp->shp_mobil <= 0.0) {
|
|
wu(0, sp->shp_own,
|
|
"%s %s,\nbut had no mobility, and couldn't retreat!\n",
|
|
prship(sp), conditions[findcondition(code)].desc[orig]);
|
|
return 0;
|
|
}
|
|
|
|
for (i = 0; i < MAX_RETREAT && sp->shp_rpath[0]; i++) {
|
|
if (sp->shp_mobil <= 0.0) {
|
|
wu(0, sp->shp_own,
|
|
"%s %s,\nbut ran out of mobility, and couldn't retreat fully!\n",
|
|
prship(sp), conditions[findcondition(code)].desc[orig]);
|
|
return 1;
|
|
}
|
|
dir = chkdir(sp->shp_rpath[0], DIR_STOP, DIR_LAST);
|
|
if (dir == DIR_STOP || CANT_HAPPEN(dir < 0)) {
|
|
memmove(sp->shp_rpath, sp->shp_rpath + 1,
|
|
sizeof(sp->shp_rpath) - 1);
|
|
if (sp->shp_rpath[0] == 0)
|
|
sp->shp_rflags = 0;
|
|
break;
|
|
}
|
|
dx = diroff[dir][0];
|
|
dy = diroff[dir][1];
|
|
|
|
mcp = &mchr[(int)sp->shp_type];
|
|
newx = xnorm(sp->shp_x + dx);
|
|
newy = ynorm(sp->shp_y + dy);
|
|
mobcost = shp_mobcost(sp);
|
|
|
|
getsect(newx, newy, §);
|
|
if (shp_check_nav(sp, §) != SHP_STUCK_NOT ||
|
|
(sect.sct_own
|
|
&& relations_with(sect.sct_own, sp->shp_own) < FRIENDLY)) {
|
|
wu(0, sp->shp_own, "%s %s,\nbut could not retreat to %s!\n",
|
|
prship(sp), conditions[findcondition(code)].desc[orig],
|
|
xyas(newx, newy, sp->shp_own));
|
|
return 1;
|
|
}
|
|
sp->shp_x = newx;
|
|
sp->shp_y = newy;
|
|
sp->shp_mobil -= mobcost;
|
|
sp->shp_mission = 0;
|
|
memmove(sp->shp_rpath, sp->shp_rpath + 1,
|
|
sizeof(sp->shp_rpath) - 1);
|
|
if (sp->shp_rpath[0] == 0)
|
|
sp->shp_rflags = 0;
|
|
|
|
mines = sect.sct_mines;
|
|
changed = 0;
|
|
if (sect.sct_type != SCT_WATER || mines <= 0)
|
|
continue;
|
|
if (mcp->m_flags & M_SWEEP) {
|
|
max = mcp->m_item[I_SHELL];
|
|
shells = sp->shp_item[I_SHELL];
|
|
for (m = 0; mines > 0 && m < 5; m++) {
|
|
if (chance(0.66)) {
|
|
mines--;
|
|
shells = MIN(max, shells + 1);
|
|
changed |= map_set(sp->shp_own, sp->shp_x, sp->shp_y,
|
|
'X', 0);
|
|
}
|
|
}
|
|
if (sect.sct_mines != mines) {
|
|
wu(0, sp->shp_own,
|
|
"%s cleared %d mine%s in %s while retreating\n",
|
|
prship(sp), sect.sct_mines - mines,
|
|
splur(sect.sct_mines - mines),
|
|
xyas(newx, newy, sp->shp_own));
|
|
sect.sct_mines = mines;
|
|
sp->shp_item[I_SHELL] = shells;
|
|
putsect(§);
|
|
}
|
|
if (changed)
|
|
writemap(sp->shp_own);
|
|
}
|
|
if (chance(DMINE_HITCHANCE(mines))) {
|
|
wu(0, sp->shp_own,
|
|
"%s %s,\nand hit a mine in %s while retreating!\n",
|
|
prship(sp), conditions[findcondition(code)].desc[orig],
|
|
xyas(newx, newy, sp->shp_own));
|
|
nreport(sp->shp_own, N_HIT_MINE, 0, 1);
|
|
m = MINE_DAMAGE();
|
|
shipdamage(sp, m);
|
|
mines--;
|
|
if (map_set(sp->shp_own, sp->shp_x, sp->shp_y, 'X', 0))
|
|
writemap(sp->shp_own);
|
|
sect.sct_mines = mines;
|
|
putsect(§);
|
|
return 1;
|
|
}
|
|
}
|
|
|
|
if (orig) {
|
|
wu(0, sp->shp_own, "%s %s, and retreated to %s\n",
|
|
prship(sp), conditions[findcondition(code)].desc[orig],
|
|
xyas(sp->shp_x, sp->shp_y, sp->shp_own));
|
|
} else {
|
|
wu(0, sp->shp_own, "%s %s, and ended up at %s\n",
|
|
prship(sp),
|
|
conditions[findcondition(code)].desc[orig],
|
|
xyas(sp->shp_x, sp->shp_y, sp->shp_own));
|
|
}
|
|
|
|
return 1;
|
|
}
|
|
|
|
static int
|
|
findcondition(char code)
|
|
{
|
|
int i;
|
|
|
|
for (i = 0; conditions[i].code && conditions[i].code != code; i++) ;
|
|
CANT_HAPPEN(!conditions[i].code);
|
|
return i;
|
|
}
|
|
|
|
void
|
|
retreat_land(struct lndstr *lp, char code)
|
|
{
|
|
struct nstr_item ni;
|
|
struct lndstr land;
|
|
|
|
if (CANT_HAPPEN(!lp->lnd_own))
|
|
return;
|
|
if (lp->lnd_own == player->cnum)
|
|
return;
|
|
|
|
retreat_land1(lp, code, 1);
|
|
|
|
if (lp->lnd_rflags & RET_GROUP) {
|
|
snxtitem_group(&ni, EF_LAND, lp->lnd_army);
|
|
while (nxtitem(&ni, &land)) {
|
|
if (land.lnd_own != lp->lnd_own || land.lnd_uid == lp->lnd_uid)
|
|
continue;
|
|
if (retreat_land1(&land, code, 0))
|
|
putland(land.lnd_uid, &land);
|
|
}
|
|
}
|
|
}
|
|
|
|
static int
|
|
retreat_land1(struct lndstr *lp, char code, int orig)
|
|
|
|
|
|
/* Is this the originally scared unit, or a follower */
|
|
{
|
|
struct sctstr sect;
|
|
int i;
|
|
int m;
|
|
int max;
|
|
int dir;
|
|
coord newx;
|
|
coord newy;
|
|
coord dx;
|
|
coord dy;
|
|
int mines;
|
|
int shells;
|
|
double mobcost;
|
|
struct lchrstr *lcp;
|
|
|
|
if (lp->lnd_effic < LAND_MINEFF) {
|
|
wu(0, lp->lnd_own,
|
|
"%s %s,\nbut it died in the attack, and so couldn't retreat!\n",
|
|
prland(lp), conditions[findcondition(code)].desc[orig]);
|
|
if (!orig)
|
|
putland(lp->lnd_uid, lp);
|
|
return 0;
|
|
}
|
|
|
|
getsect(lp->lnd_x, lp->lnd_y, §);
|
|
|
|
if (lp->lnd_mobil <= 0.0) {
|
|
wu(0, lp->lnd_own,
|
|
"%s %s,\nbut had no mobility, and couldn't retreat!\n",
|
|
prland(lp), conditions[findcondition(code)].desc[orig]);
|
|
return 0;
|
|
}
|
|
|
|
for (i = 0; i < MAX_RETREAT && lp->lnd_rpath[0]; i++) {
|
|
if (lp->lnd_mobil <= 0.0) {
|
|
wu(0, lp->lnd_own,
|
|
"%s %s,\nbut ran out of mobility, and couldn't retreat fully!\n",
|
|
prland(lp), conditions[findcondition(code)].desc[orig]);
|
|
return 1;
|
|
}
|
|
dir = chkdir(lp->lnd_rpath[0], DIR_STOP, DIR_LAST);
|
|
if (dir == DIR_STOP || CANT_HAPPEN(dir < 0)) {
|
|
memmove(lp->lnd_rpath, lp->lnd_rpath + 1,
|
|
sizeof(lp->lnd_rpath) - 1);
|
|
if (lp->lnd_rpath[0] == 0)
|
|
lp->lnd_rflags = 0;
|
|
break;
|
|
}
|
|
dx = diroff[dir][0];
|
|
dy = diroff[dir][1];
|
|
|
|
lcp = &lchr[(int)lp->lnd_type];
|
|
newx = xnorm(lp->lnd_x + dx);
|
|
newy = ynorm(lp->lnd_y + dy);
|
|
|
|
getsect(newx, newy, §);
|
|
mobcost = lnd_mobcost(lp, §);
|
|
if (mobcost < 0
|
|
|| sect.sct_type == SCT_MOUNT
|
|
|| sect.sct_own != lp->lnd_own) {
|
|
wu(0, lp->lnd_own, "%s %s,\nbut could not retreat to %s!\n",
|
|
prland(lp),
|
|
conditions[findcondition(code)].desc[orig],
|
|
xyas(newx, newy, lp->lnd_own));
|
|
return 1;
|
|
}
|
|
lp->lnd_x = newx;
|
|
lp->lnd_y = newy;
|
|
lp->lnd_mobil -= mobcost;
|
|
lp->lnd_mission = 0;
|
|
memmove(lp->lnd_rpath, lp->lnd_rpath + 1,
|
|
sizeof(lp->lnd_rpath) - 1);
|
|
if (lp->lnd_rpath[0] == 0)
|
|
lp->lnd_rflags = 0;
|
|
|
|
mines = SCT_LANDMINES(§);
|
|
if (mines <= 0 || sect.sct_oldown == lp->lnd_own)
|
|
continue;
|
|
if (lcp->l_flags & L_ENGINEER) {
|
|
max = lcp->l_item[I_SHELL];
|
|
shells = lp->lnd_item[I_SHELL];
|
|
for (m = 0; mines > 0 && m < 5; m++) {
|
|
if (chance(0.66)) {
|
|
mines--;
|
|
shells = MIN(max, shells + 1);
|
|
}
|
|
}
|
|
sect.sct_mines = mines;
|
|
lp->lnd_item[I_SHELL] = shells;
|
|
putsect(§);
|
|
}
|
|
if (chance(DMINE_LHITCHANCE(mines))) {
|
|
wu(0, lp->lnd_own,
|
|
"%s %s,\nand hit a mine in %s while retreating!\n",
|
|
prland(lp),
|
|
conditions[findcondition(code)].desc[orig],
|
|
xyas(newx, newy, lp->lnd_own));
|
|
nreport(lp->lnd_own, N_LHIT_MINE, 0, 1);
|
|
m = MINE_LDAMAGE();
|
|
if (lcp->l_flags & L_ENGINEER)
|
|
m /= 2;
|
|
landdamage(lp, m);
|
|
mines--;
|
|
sect.sct_mines = mines;
|
|
putsect(§);
|
|
return 1;
|
|
}
|
|
}
|
|
|
|
if (orig) {
|
|
wu(0, lp->lnd_own, "%s %s, and retreated to %s\n",
|
|
prland(lp),
|
|
conditions[findcondition(code)].desc[orig],
|
|
xyas(lp->lnd_x, lp->lnd_y, lp->lnd_own));
|
|
} else {
|
|
wu(0, lp->lnd_own, "%s %s, and ended up at %s\n",
|
|
prland(lp),
|
|
conditions[findcondition(code)].desc[orig],
|
|
xyas(lp->lnd_x, lp->lnd_y, lp->lnd_own));
|
|
}
|
|
|
|
return 1;
|
|
}
|