363 lines
9.3 KiB
C
363 lines
9.3 KiB
C
/*
|
|
* Empire - A multi-player, client/server Internet based war game.
|
|
* Copyright (C) 1986-2010, Dave Pare, Jeff Bailey, Thomas Ruschak,
|
|
* Ken Stevens, Steve McClure
|
|
*
|
|
* This program 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 2 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, write to the Free Software
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
*
|
|
* ---
|
|
*
|
|
* 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.
|
|
*
|
|
* ---
|
|
*
|
|
* unitsub.c: Common subroutines for multiple type of units
|
|
*
|
|
* Known contributors to this file:
|
|
* Ron Koenderink, 2007
|
|
* Markus Armbruster, 2009
|
|
*/
|
|
|
|
#include <config.h>
|
|
|
|
#include "empobj.h"
|
|
#include "file.h"
|
|
#include "path.h"
|
|
#include "player.h"
|
|
#include "optlist.h"
|
|
#include "prototypes.h"
|
|
#include "unit.h"
|
|
|
|
void
|
|
unit_list(struct emp_qelem *unit_list)
|
|
{
|
|
struct emp_qelem *qp;
|
|
struct emp_qelem *next;
|
|
struct ulist *ulp;
|
|
int type, npln, nch, nxl;
|
|
struct empobj *unit;
|
|
struct lndstr *lnd;
|
|
struct shpstr *shp;
|
|
|
|
if (CANT_HAPPEN(QEMPTY(unit_list)))
|
|
return;
|
|
qp = unit_list->q_back;
|
|
ulp = (struct ulist *)qp;
|
|
type = ulp->unit.gen.ef_type;
|
|
if (CANT_HAPPEN(type != EF_LAND && type != EF_SHIP))
|
|
return;
|
|
|
|
if (type == EF_LAND)
|
|
pr("lnd# land type x,y a eff sh gun xl mu tech retr\n");
|
|
else
|
|
pr("shp# ship type x,y fl eff mil sh gun pn he xl ln mob tech\n");
|
|
|
|
for (; qp != unit_list; qp = next) {
|
|
next = qp->q_back;
|
|
ulp = (struct ulist *)qp;
|
|
lnd = &ulp->unit.land;
|
|
shp = &ulp->unit.ship;
|
|
unit = &ulp->unit.gen;
|
|
if (CANT_HAPPEN(type != unit->ef_type))
|
|
continue;
|
|
pr("%4d ", unit->uid);
|
|
pr("%-16.16s ", empobj_chr_name(unit));
|
|
prxy("%4d,%-4d ", unit->x, unit->y);
|
|
pr("%1.1s", &unit->group);
|
|
pr("%4d%%", unit->effic);
|
|
if (type == EF_LAND) {
|
|
pr("%4d", lnd->lnd_item[I_SHELL]);
|
|
pr("%4d", lnd->lnd_item[I_GUN]);
|
|
pr("%3d", lnd_nxlight(lnd));
|
|
} else {
|
|
pr("%4d", shp->shp_item[I_MILIT]);
|
|
pr("%4d", shp->shp_item[I_SHELL]);
|
|
pr("%4d", shp->shp_item[I_GUN]);
|
|
npln = shp_nplane(shp, &nch, &nxl, NULL);
|
|
pr("%3d%3d%3d", npln - nch - nxl, nch, nxl);
|
|
pr("%3d", shp_nland(shp));
|
|
}
|
|
pr("%4d", unit->mobil);
|
|
pr("%4d", unit->tech);
|
|
if (type == EF_LAND) {
|
|
pr("%4d%%", lnd->lnd_retreat);
|
|
}
|
|
pr("\n");
|
|
}
|
|
}
|
|
|
|
void
|
|
unit_put(struct emp_qelem *list, natid actor)
|
|
{
|
|
struct emp_qelem *qp;
|
|
struct emp_qelem *newqp;
|
|
struct ulist *ulp;
|
|
struct empobj *unit;
|
|
|
|
qp = list->q_back;
|
|
while (qp != list) {
|
|
ulp = (struct ulist *)qp;
|
|
unit = &ulp->unit.gen;
|
|
if (CANT_HAPPEN(unit->ef_type != EF_LAND
|
|
&& unit->ef_type != EF_SHIP))
|
|
continue;
|
|
if (actor) {
|
|
mpr(actor, "%s stopped at %s\n", obj_nameof(unit),
|
|
xyas(unit->x, unit->y, actor));
|
|
if (unit->ef_type == EF_LAND) {
|
|
if (ulp->mobil < -127)
|
|
ulp->mobil = -127;
|
|
unit->mobil = ulp->mobil;
|
|
}
|
|
}
|
|
if (unit->ef_type == EF_SHIP)
|
|
unit->mobil = (int)ulp->mobil;
|
|
put_empobj(unit->ef_type, unit->uid, unit);
|
|
newqp = qp->q_back;
|
|
emp_remque(qp);
|
|
free(qp);
|
|
qp = newqp;
|
|
}
|
|
}
|
|
|
|
char *
|
|
unit_path(int together, struct empobj *unit, char *buf)
|
|
{
|
|
coord destx;
|
|
coord desty;
|
|
struct sctstr d_sect, sect;
|
|
char *cp;
|
|
double dummy;
|
|
int mtype;
|
|
|
|
if (CANT_HAPPEN(unit->ef_type != EF_LAND && unit->ef_type != EF_SHIP))
|
|
return NULL;
|
|
|
|
if (!sarg_xy(buf, &destx, &desty))
|
|
return NULL;
|
|
if (!together) {
|
|
pr("Cannot go to a destination sector if not all starting in the same sector\n");
|
|
return NULL;
|
|
}
|
|
if (!getsect(destx, desty, &d_sect)) {
|
|
pr("%d,%d is not a sector\n", destx, desty);
|
|
return NULL;
|
|
}
|
|
if (unit->ef_type == EF_SHIP) {
|
|
cp = BestShipPath(buf, unit->x, unit->y,
|
|
d_sect.sct_x, d_sect.sct_y, player->cnum);
|
|
if (!cp || unit->mobil <= 0) {
|
|
pr("Can't get to '%s' right now.\n",
|
|
xyas(d_sect.sct_x, d_sect.sct_y, player->cnum));
|
|
return NULL;
|
|
}
|
|
} else {
|
|
getsect(unit->x, unit->y, §);
|
|
mtype = lnd_mobtype((struct lndstr *)unit);
|
|
cp = BestLandPath(buf, §, &d_sect, &dummy, mtype);
|
|
if (!cp) {
|
|
pr("No owned %s from %s to %s!\n",
|
|
mtype == MOB_RAIL ? "railway" : "path",
|
|
xyas(unit->x, unit->y, player->cnum),
|
|
xyas(d_sect.sct_x, d_sect.sct_y, player->cnum));
|
|
return NULL;
|
|
}
|
|
pr("Using path '%s'\n", cp);
|
|
}
|
|
return cp;
|
|
}
|
|
|
|
void
|
|
unit_view(struct emp_qelem *list)
|
|
{
|
|
struct sctstr sect;
|
|
struct emp_qelem *qp;
|
|
struct emp_qelem *next;
|
|
struct ulist *ulp;
|
|
|
|
for (qp = list->q_back; qp != list; qp = next) {
|
|
next = qp->q_back;
|
|
ulp = (struct ulist *)qp;
|
|
if (CANT_HAPPEN(!(ef_flags(ulp->unit.gen.ef_type) & EFF_XY)))
|
|
continue;
|
|
getsect(ulp->unit.gen.x, ulp->unit.gen.y, §);
|
|
if (ulp->unit.gen.ef_type == EF_SHIP) {
|
|
if (((struct mchrstr *)ulp->chrp)->m_flags & M_FOOD)
|
|
pr("[fert:%d] ", sect.sct_fertil);
|
|
if (((struct mchrstr *)ulp->chrp)->m_flags & M_OIL)
|
|
pr("[oil:%d] ", sect.sct_oil);
|
|
}
|
|
pr("%s @ %s %d%% %s\n", obj_nameof(&ulp->unit.gen),
|
|
xyas(ulp->unit.gen.x, ulp->unit.gen.y, player->cnum),
|
|
sect.sct_effic, dchr[sect.sct_type].d_name);
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Update cargo of CARRIER for movement or destruction.
|
|
* If the carrier is destroyed, destroy its cargo (planes, land units,
|
|
* nukes).
|
|
* Else update their location to the carrier's. Any op sectors equal
|
|
* to location get updated, too.
|
|
*/
|
|
void
|
|
unit_update_cargo(struct empobj *carrier)
|
|
{
|
|
int cargo_type;
|
|
struct nstr_item ni;
|
|
union empobj_storage obj;
|
|
|
|
for (cargo_type = EF_PLANE; cargo_type <= EF_NUKE; cargo_type++) {
|
|
snxtitem_cargo(&ni, cargo_type, carrier->ef_type, carrier->uid);
|
|
while (nxtitem(&ni, &obj)) {
|
|
if (!carrier->own) {
|
|
mpr(obj.gen.own, "%s lost!\n", obj_nameof(&obj.gen));
|
|
obj.gen.effic = 0;
|
|
} else {
|
|
/* mission op-area centered on the obj travels with it */
|
|
if (obj.gen.opx == obj.gen.x && obj.gen.opy == obj.gen.y) {
|
|
obj.gen.opx = carrier->x;
|
|
obj.gen.opy = carrier->y;
|
|
}
|
|
obj.gen.x = carrier->x;
|
|
obj.gen.y = carrier->y;
|
|
}
|
|
put_empobj(cargo_type, obj.gen.uid, &obj);
|
|
}
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Drop cargo of UNIT.
|
|
* Give it to NEWOWN, unless it's zero.
|
|
*/
|
|
void
|
|
unit_drop_cargo(struct empobj *unit, natid newown)
|
|
{
|
|
int type;
|
|
struct nstr_item ni;
|
|
union empobj_storage cargo;
|
|
|
|
for (type = EF_PLANE; type <= EF_NUKE; type++) {
|
|
snxtitem_cargo(&ni, type, unit->ef_type, unit->uid);
|
|
while (nxtitem(&ni, &cargo)) {
|
|
switch (type) {
|
|
case EF_PLANE:
|
|
cargo.plane.pln_ship = cargo.plane.pln_land = -1;
|
|
break;
|
|
case EF_LAND:
|
|
cargo.land.lnd_ship = cargo.land.lnd_land = -1;
|
|
break;
|
|
case EF_NUKE:
|
|
cargo.nuke.nuk_plane = -1;
|
|
break;
|
|
}
|
|
mpr(cargo.gen.own, "%s transferred off %s %d to %s\n",
|
|
obj_nameof(&cargo.gen),
|
|
ef_nameof(unit->ef_type), unit->uid,
|
|
xyas(cargo.gen.x, cargo.gen.y, cargo.gen.own));
|
|
if (newown)
|
|
unit_give_away(&cargo.gen, newown, cargo.gen.own);
|
|
put_empobj(type, cargo.gen.uid, &cargo.gen);
|
|
}
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Give UNIT and its cargo to RECIPIENT.
|
|
* No action if RECIPIENT already owns UNIT.
|
|
* If GIVER is non-zero, inform RECIPIENT and GIVER of the transaction.
|
|
* Clears mission and group on the units given away.
|
|
*/
|
|
void
|
|
unit_give_away(struct empobj *unit, natid recipient, natid giver)
|
|
{
|
|
int type;
|
|
struct nstr_item ni;
|
|
union empobj_storage cargo;
|
|
|
|
if (unit->own == recipient)
|
|
return;
|
|
|
|
if (giver) {
|
|
mpr(unit->own, "%s given to %s\n",
|
|
obj_nameof(unit), cname(recipient));
|
|
mpr(recipient, "%s given to you by %s\n",
|
|
obj_nameof(unit), cname(giver));
|
|
}
|
|
|
|
unit->own = recipient;
|
|
unit_wipe_orders(unit);
|
|
put_empobj(unit->ef_type, unit->uid, unit);
|
|
|
|
for (type = EF_PLANE; type <= EF_NUKE; type++) {
|
|
snxtitem_cargo(&ni, type, unit->ef_type, unit->uid);
|
|
while (nxtitem(&ni, &cargo))
|
|
unit_give_away(&cargo.gen, recipient, giver);
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Wipe orders and such from UNIT.
|
|
*/
|
|
void
|
|
unit_wipe_orders(struct empobj *unit)
|
|
{
|
|
struct shpstr *sp;
|
|
struct plnstr *pp;
|
|
struct lndstr *lp;
|
|
int i;
|
|
|
|
unit->group = 0;
|
|
unit->opx = unit->opy = 0;
|
|
unit->mission = 0;
|
|
unit->radius = 0;
|
|
|
|
switch (unit->ef_type) {
|
|
case EF_SHIP:
|
|
sp = (struct shpstr *)unit;
|
|
sp->shp_destx[0] = sp->shp_desty[0] = 0;
|
|
sp->shp_destx[1] = sp->shp_desty[1] = 0;
|
|
for (i = 0; i < TMAX; ++i) {
|
|
sp->shp_tstart[i] = I_NONE;
|
|
sp->shp_tend[i] = I_NONE;
|
|
sp->shp_lstart[i] = 0;
|
|
sp->shp_lend[i] = 0;
|
|
}
|
|
sp->shp_autonav = 0;
|
|
sp->shp_mobquota = 0;
|
|
sp->shp_path[0] = 0;
|
|
sp->shp_follow = sp->shp_uid;
|
|
sp->shp_rflags = 0;
|
|
sp->shp_rpath[0] = 0;
|
|
break;
|
|
case EF_PLANE:
|
|
pp = (struct plnstr *)unit;
|
|
pp->pln_range = pln_range_max(pp);
|
|
break;
|
|
case EF_LAND:
|
|
lp = (struct lndstr *)unit;
|
|
lp->lnd_retreat = morale_base;
|
|
lp->lnd_rflags = 0;
|
|
lp->lnd_rpath[0] = 0;
|
|
break;
|
|
case EF_NUKE:
|
|
break;
|
|
default:
|
|
CANT_REACH();
|
|
}
|
|
}
|